TY - BOOK
ED - Conference on Graphtheoretic Concepts in Computer Science
TI - Graph-theoretic concepts in computer science: 38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, revised selected papers
T2 - Lecture notes in computer science
SN - 3642346111
AV - QA166 .C66 2012
U1 - 511.5 23
PY - 2012///
CY - Heidelberg, New York
PB - Springer
KW - Graph theory
KW - Data processing
KW - Congresses
KW - Computer science
KW - Informatique
KW - eclas
KW - fast
KW - computerwetenschappen
KW - computer sciences
KW - wiskunde
KW - mathematics
KW - algoritmen
KW - algorithms
KW - computeranalyse
KW - computer analysis
KW - kunstmatige intelligentie
KW - artificial intelligence
KW - gegevensstructuren
KW - data structures
KW - meetkunde
KW - geometry
KW - Information and Communication Technology (General)
KW - Informatie- en communicatietechnologie (algemeen)
KW - Electronic books
KW - Conference papers and proceedings
KW - Computer software
KW - lcgft
N1 - Invited talks: Account on intervals; Dieter Rautenbach --; Constructing resilient structures in graphs: rigid vs. competitive fault-tolerance; David Peleg --; Alternating reachability and integer sum of closed alternating trails; Amitava Bhattacharya --; Poster session: Student poster session: Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern --; Papers: Triangulation and clique separator decomposition of claw-free graphs; Anne Berry, Annegret Wagler --; Minimum weighted clique cover on strip-composed perfect graphs; Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels --; Graph Isomorphism for graph classes characterized by two forbidden induced subgraphs; Stefan Kratsch, Pascal Schweitzer --; Optimization problems in dotted interval graphs; Danny Hermelin, Julián Mestre, Dror Rawitz --; The maximum clique problem in multiple interval graphs (extended abstract); Matthew C. Francis --; Daniel Gonçalves, Pascal Ochem --; Solutions for the stable roommates problem with payments; Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma --; Which multi-peg tower of Hanoi problems are exponential?; Daniel Berend, Amir Sapir --; h-Quasi planar drawings of bounded treewidth graphs in linear area; Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani --; The duals of upward planar graphs on cylinders; Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner --; The (weighted) metric dimension of graphs: hard and easy cases; Leah Epstein, Asaf Levin, Gerhard J. Woeginger --; Determining the L(2,1)-span in polynomial space; Konstanty Junosza-Szaniawski, Jan Kratochvil, Mathieu Liedloff, Paweł --; On the minimum degree up to local complementation: bounds and complexity; Jérôme Javelle, Mehdi Mhalla, Simon Perdrix --; On the stable degree of graphs; Haiko Müller --; A 9k kernal for nonseparating independent set in planar graphs; Łukasz Kowalik, Marcin Mucha --; Parameterized algorithms for Even Cycle Transversal; Pranabendu Misra, Venkatesh Raman, M.S. Ramnujan, Sakat Saurabh --; Bisections above tight lower bounds; Matthias Mnich, Rico Zenklusen --; On group feedback vertex set parameterized by the size of the cutest; Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk --; Fault tolerant additive spanners; Gilad Braunschvig, Shiri Chechik, David Peleg --; Multi-rooted greedy approximation of directed steiner trees with applications; Tomoya Hibi, Toshihiro Fujito --; Approximating infeasible 2VPI-systems; Neele Leithäuser, Sven O. Krumke, Maximilian Merkert --; Hydras: directed hypergraphs and horn formulas; Robert H. Sloan, Despina Stasi, György Turán --; Minimum weight dynamo and fast opinion spreading; Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter Quattrociocchi --; Immediate versus eventual conversion: comparing geodetic and hull numbers in P₃-convexity; Carmen Cecilia Centeno, Lucia Draque Penso, Dietr Rautenbach --; Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill; Steven Chaplick, Vit Jelínek, Jan Kratochvil, Tomáš Vyskočil --; On the recognition of k-Equistable graphs; Vadim E. Levit, martin Milanič, David Tankus --; Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs; Ganica Gavril --; Parameterized domination in circle graphs; Nicolas Bousquet, Daniel Gonçlaves, George B. Mertzios, Christophe Paul, Ignasi Sau --; How to eliminate a graph; Petr A. Golovach, Pinar Heggernes, Pim van't Hof, Fredrik Manne, Daniël Paulusma --; On the parameterized complexity of finding separators with non-hereditary properties; Pinar Heggernes, Pim van't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
N2 - 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
UR - https://link-springer-com.libraryproxy.ist.ac.at/book/10.1007/978-3-642-34611-8
ER -