{"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":28,"n_cols":5,"rows_kept":28,"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],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910143884803321"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers / / edited by Ludek Kucera"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002"]
[null,null,"ISBN",null,"3-540-36379-3"]
[null,null,"Edizione",null,"[1st ed. 2002.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 422 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2573"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computers"]
[{"$nulls":4},"Computer simulation"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Simulation and Modeling"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Numeric Computing"]
[{"$nulls":4},"Discrete Mathematics in Computer 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,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Maximum Cardinality Search for Computing Minimal Triangulations -- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem -- On the Minimum Size of a Contraction-Universal Tree -- Optimal Area Algorithm for Planar Polyline Drawings -- Cycles in Generalized Networks -- New Graph Classes of Bounded Clique-Width -- More about Subcolorings -- Search in Indecomposable Graphs -- On the Complexity of (k, l)-Graph Sandwich Problems -- Algorithms and Models for the On-Line Vertex-Covering -- Weighted Node Coloring: When Stable Sets Are Expensive -- The Complexity of Restrictive H-Coloring -- A New 3-Color Criterion for Planar Graphs -- An Additive Stretched Routing Scheme for Chordal Graphs -- Complexity of Pattern Coloring of Cycle Systems -- Safe Reduction "]
[{"$nulls":4},"Rules for Weighted Treewidth -- Graph Separator Algorithms: A Refined Analysis -- Generalized H-Coloring and H-Covering of Trees -- The Complexity of Approximating the Oriented Diameter of Chordal Graphs -- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies -- Completely Independent Spanning Trees in Maximal Planar Graphs -- Facets of the Directed Acyclic Graph Layering Polytope -- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP -- Complexity of Some Infinite Games Played on Finite Graphs -- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs -- A Multi-scale Algorithm for the Linear Arrangement Problem -- On the b-Chromatic Number of Graphs -- Budgeted Maximum Graph Coverage -- Online Call Admission in Optical Networks with Larger Demands -- The Forest Wrapping Problem on Outerplanar Graphs -- On the Recognition of P 4 -Comparability Graphs -- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs -- Cluster Graph Modification Problems -- Two Counterexamples in Graph Drawing -- Connected and Loosely Connected List Homomorphisms -- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal."]
[null,null,null,"Sommario/riassunto","The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees’commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings."]