The Resource Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers
Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers
Resource Information
The item Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 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 2628, 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 graphtheoretic 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, graphbased modeling, graphdrawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graphtheoretic 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 scalefree networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition
 Language
 eng
 Extent
 1 online resource (xiii, 346 pages).
 Contents

 Anne Berry, Annegret Wagler
 Minimum weighted clique cover on stripcomposed 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
 Invited talks: Account on intervals
 Solutions for the stable roommates problem with payments
 Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
 Which multipeg tower of Hanoi problems are exponential?
 Daniel Berend, Amir Sapir
 hQuasi 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
 Dieter Rautenbach
 Determining the L(2,1)span in polynomial space
 Konstanty JunoszaSzaniawski, 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
 Constructing resilient structures in graphs: rigid vs. competitive faulttolerance
 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
 Multirooted greedy approximation of directed steiner trees with applications
 Tomoya Hibi, Toshihiro Fujito
 Approximating infeasible 2VPIsystems
 Neele Leithäuser, Sven O. Krumke, Maximilian Merkert
 David Peleg
 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 P3convexity
 Carmen Cecilia Centeno, Lucia Draque Penso, Dietr Rautenbach
 Bendbounded path intersection graphs: sausages, noodles, and waffles on a grill
 Steven Chaplick, Vit Jelínek, Jan Kratochvil, Tomáš Vyskočil
 On the recognition of kEquistable graphs
 Vadim E. Levit, martin Milanič, David Tankus
 Alternating reachability and integer sum of closed alternating trails
 Maximum induced multicliques and complete multipartite subgraphs in polygoncircle 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 nonhereditary properties
 Pinar Heggernes, Pim van't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
 Amitava Bhattacharya
 Poster session: Student poster session: Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
 Papers: Triangulation and clique separator decomposition of clawfree graphs
 Isbn
 9783642346118
 Label
 Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers
 Language
 eng
 Summary
 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 2628, 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 graphtheoretic 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, graphbased modeling, graphdrawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graphtheoretic 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 scalefree networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition
 Cataloging source
 YDXCP
 Dewey number
 511.5
 Index
 no index present
 LC call number
 QA166
 LC item number
 .C66 2012
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2012
 http://bibfra.me/vocab/lite/meetingName
 Conference on Graphtheoretic Concepts in Computer Science
 Nature of contents
 dictionaries
 Series statement
 Lecture notes in computer science
 Series volume
 7551
 http://library.link/vocab/subjectName

 Graph theory
 Computer science
 Informatique
 Computer science
 Graph theory
 Label
 Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Anne Berry, Annegret Wagler
 Minimum weighted clique cover on stripcomposed 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
 Invited talks: Account on intervals
 Solutions for the stable roommates problem with payments
 Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
 Which multipeg tower of Hanoi problems are exponential?
 Daniel Berend, Amir Sapir
 hQuasi 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
 Dieter Rautenbach
 Determining the L(2,1)span in polynomial space
 Konstanty JunoszaSzaniawski, 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
 Constructing resilient structures in graphs: rigid vs. competitive faulttolerance
 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
 Multirooted greedy approximation of directed steiner trees with applications
 Tomoya Hibi, Toshihiro Fujito
 Approximating infeasible 2VPIsystems
 Neele Leithäuser, Sven O. Krumke, Maximilian Merkert
 David Peleg
 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 P3convexity
 Carmen Cecilia Centeno, Lucia Draque Penso, Dietr Rautenbach
 Bendbounded path intersection graphs: sausages, noodles, and waffles on a grill
 Steven Chaplick, Vit Jelínek, Jan Kratochvil, Tomáš Vyskočil
 On the recognition of kEquistable graphs
 Vadim E. Levit, martin Milanič, David Tankus
 Alternating reachability and integer sum of closed alternating trails
 Maximum induced multicliques and complete multipartite subgraphs in polygoncircle 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 nonhereditary properties
 Pinar Heggernes, Pim van't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
 Amitava Bhattacharya
 Poster session: Student poster session: Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
 Papers: Triangulation and clique separator decomposition of clawfree graphs
 Control code
 816818883
 Dimensions
 unknown
 Extent
 1 online resource (xiii, 346 pages).
 Form of item
 online
 Isbn
 9783642346118
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642346118
 Specific material designation
 remote
 System control number
 (OCoLC)816818883
 Label
 Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Anne Berry, Annegret Wagler
 Minimum weighted clique cover on stripcomposed 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
 Invited talks: Account on intervals
 Solutions for the stable roommates problem with payments
 Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
 Which multipeg tower of Hanoi problems are exponential?
 Daniel Berend, Amir Sapir
 hQuasi 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
 Dieter Rautenbach
 Determining the L(2,1)span in polynomial space
 Konstanty JunoszaSzaniawski, 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
 Constructing resilient structures in graphs: rigid vs. competitive faulttolerance
 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
 Multirooted greedy approximation of directed steiner trees with applications
 Tomoya Hibi, Toshihiro Fujito
 Approximating infeasible 2VPIsystems
 Neele Leithäuser, Sven O. Krumke, Maximilian Merkert
 David Peleg
 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 P3convexity
 Carmen Cecilia Centeno, Lucia Draque Penso, Dietr Rautenbach
 Bendbounded path intersection graphs: sausages, noodles, and waffles on a grill
 Steven Chaplick, Vit Jelínek, Jan Kratochvil, Tomáš Vyskočil
 On the recognition of kEquistable graphs
 Vadim E. Levit, martin Milanič, David Tankus
 Alternating reachability and integer sum of closed alternating trails
 Maximum induced multicliques and complete multipartite subgraphs in polygoncircle 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 nonhereditary properties
 Pinar Heggernes, Pim van't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
 Amitava Bhattacharya
 Poster session: Student poster session: Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
 Papers: Triangulation and clique separator decomposition of clawfree graphs
 Control code
 816818883
 Dimensions
 unknown
 Extent
 1 online resource (xiii, 346 pages).
 Form of item
 online
 Isbn
 9783642346118
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642346118
 Specific material designation
 remote
 System control number
 (OCoLC)816818883
Subject
 Computer science
 Computer science  Congresses
 Computer software
 Computer software
 Conference papers and proceedings
 Conference papers and proceedings
 Graph theory  Data processing
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Informatique
 Computer science
Genre
Member of
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 7551
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/Fw5vM0o7V0k/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/Fw5vM0o7V0k/">Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/Fw5vM0o7V0k/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/Fw5vM0o7V0k/">Graphtheoretic concepts in computer science : 38th international workshop, WG 2012, Jerusalem, Israel, June 2628, 2012, revised selected papers</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>