{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[17,2,17,3],[18,2,18,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465275303316"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers / / edited by Martin Charles Golumbic, Michael Stern, Avivit Levy, Gila Morgenstern"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012"]
[null,null,"ISBN",null,"3-642-34611-1"]
[null,null,"Edizione",null,"[1st ed. 2012.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 346 p. 45 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 7551"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Geometry"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Data Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Account on Intervals -- Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance -- Alternating Reachabillity and Integer Sum of Closed Alternating Trails: The 3rd Annual Uri N. Peled Memorial Lecture -- Triangulation and Clique Separator Decomposition of Claw-Free Graphs -- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs -- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs -- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area -- The Duals of Upward Planar Graphs on Cylinders -- On the Minimum Degree Up to Local Complementation: Bounds and Complexity -- Bisections above Tight Lower Bounds -- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications -- Hydras: Directed Hypergraphs and Horn Formulas -- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill -- Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle "]
[{"$nulls":4},"Graphs -- Parameterized Domination in Circle Graphs -- On the Parameterized Complexity of Finding Separators with Non-hereditary Properties."]
[null,null,null,"Sommario/riassunto","This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition."]