{"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":19,"n_cols":5,"rows_kept":19,"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],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910483967503321"]
[null,null,"Titolo",null,"Graph-theoretic concepts in computer science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004 : revised papers / / Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel (eds.)"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, : Springer, 2004"]
[null,null,"ISBN",null,"3-540-30559-9"]
[null,null,"Edizione",null,"[1st ed. 2005.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 404 p.)"]
[null,null,"Collana",null,"Lecture notes in computer science, , 0302-9743 ; ; 3353"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Graph theory"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Computer algorithms"]
[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,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Papers -- Lexicographic Breadth First Search – A Survey -- Wireless Networking: Graph Theory Unplugged -- Graph Algorithms: Trees -- Constant Time Generation of Trees with Specified Diameter -- Treelike Comparability Graphs: Characterization, Recognition, and Applications -- Elegant Distance Constrained Labelings of Trees -- Collective Tree Spanners and Routing in AT-free Related Graphs -- Graph Algorithms: Recognition and Decomposition -- On the Maximum Cardinality Search Lower Bound for Treewidth -- Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs -- Recognizing HHD-free and Welsh-Powell Opposition Graphs -- Bimodular Decomposition of Bipartite Graphs -- Coloring a Graph Using Split Decomposition -- Graph Algorithms: Various Problems -- Decremental Clique Problem -- A Symbolic Approach to the All-Pairs Shortest-Paths Problem -- Minimal de Bruijn Sequence in a Language with Forbidden Substrings -- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic  -- Optimization and Approximation Algorithms -- The Computational Complexity of the Minimum Weight Processor Assignment Problem -- A Stochastic Location Problem with Applications to Tele-diagnostic -- A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs -- Tolerance Based Algorithms for the ATSP -- Parameterized Complexity and Exponential Algorithms -- Finding k Disjoint Triangles in an Arbitrary Graph -- Exact "]
[{"$nulls":4},"(Exponential) Algorithms for the Dominating Set Problem -- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps -- Counting, Combinatorics, and Optimization -- Planar Graphs, via Well-Orderly Maps and Trees -- Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs -- Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters -- Applications (Biology, Graph Drawing) -- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs -- Octagonal Drawings of Plane Graphs with Prescribed Face Areas -- Crossing Reduction in Circular Layouts -- Graph Classes and NP Hardness -- Characterization and Recognition of Generalized Clique-Helly Graphs -- Edge-Connectivity Augmentation and Network Matrices -- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size -- The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small -- Core Stability of Minimum Coloring Games."]
[null,null,null,"Sommario/riassunto","During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment."]