Coverart for item
The Resource Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)

Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)

Label
Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
Title
Graph-theoretic concepts in computer science
Title remainder
39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
Statement of responsibility
Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Title variation
WG 2013
Creator
Contributor
Editor
Subject
Genre
Language
eng
Summary
This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lubeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications
Member of
Cataloging source
GW5XE
Dewey number
511.5
Illustrations
illustrations
Index
index present
LC call number
QA166
LC item number
.C66 2013
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2013
http://bibfra.me/vocab/lite/meetingName
International Workshop WG
Nature of contents
dictionaries
NLM call number
QA 267.G47
http://library.link/vocab/relatedWorkOrContributorName
  • Brandstädt, Andreas
  • Jansen, Klaus
  • Reischuk, Rüdiger
Series statement
  • Lecture Notes in Computer Science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
8165
http://library.link/vocab/subjectName
  • Graph theory
  • Computer science
  • Computers
  • Electronic Data Processing
  • Computer science
  • Graph theory
  • Engineering & Applied Sciences
  • Computer Science
  • Computer Science
  • Discrete Mathematics in Computer Science
  • Algorithm Analysis and Problem Complexity
  • Data Structures
  • Geometry
  • Algorithms
Label
Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Instantiates
Publication
Note
Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Rolling Upward Planarity Testing of Strongly Connected Graphs
  • Christopher Auer, Christian Bachmaier
  • Towards a Provably Resilient Scheme for Graph-Based Watermarking
  • Lucila Maria Souza Bento, Davidson Boccardo
  • The Normal Graph Conjecture for Classes of Sparse Graphs
  • Anne Berry, Annegret Wagler
  • On the Parameterized Complexity of Computing Graph Bisections
  • René van Bevern, Andreas Emil Feldmann
  • Fixed-Parameter Tractability and Characterizations of Small Special Treewidth
  • Hans L. Bodlaender, Stefan Kratsch
  • Tree-Like Structures in Graphs: A Metric Point of View
  • Feodor F. Dragan
  • Overview of New Approaches for Approximating TSP
  • Ola Svensson
  • Linear Rank-Width and Linear Clique-Width of Trees
  • Isolde Adler, Mamadou Moustapha Kanté
  • Threshold-Coloring and Unit-Cube Contact Representation of Graphs
  • Md. Jawaherul Alam, Steven Chaplick
  • Luerbio Faria, Celina M.H. de Figueiredo
  • FPT Is Characterized by Useful Obstruction Sets
  • Michael R. Fellows, Bart M.P. Jansen
  • Excluding Graphs as Immersions in Surface Embedded Graphs
  • Archontia C. Giannopoulou, Marcin Kamiński
  • OBDD-Based Representation of Interval Graphs
  • Marc Gillé
  • Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs
  • Kathrin Hanauer, Franz J. Brandenburg
  • A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem
  • Frank Kammer
  • Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs
  • Emilio Di Giacomo, Giuseppe Liotta
  • Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
  • Carola Doerr, G. Ramakrishna
  • Thickness and Colorability of Geometric Graphs
  • Stephane Durocher, Ellen Gethner
  • The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube
  • Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
  • Neeldhara Misra, Fahad Panolan, Ashutosh Rai
  • Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
  • Ragnar Nevries, Christian Rosenke
  • Beyond Knights and Knaves
  • Christine T. Cheng, Andrew McConvey
  • Drawing Graphs with Few Arcs
  • André Schulz
  • Connecting Terminals and 2-Disjoint Connected Subgraphs
  • Jan Arne Telle, Yngve Villanger
  • On Retracts, Absolute Retracts, and Folds in Cographs
  • Ton Kloks, Yue-Li Wang
  • Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors
  • Tomasz Krawczyk, Arkadiusz Pawlik
  • On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
  • Nathan Lindzey, Ross M. McConnell
  • Certifying 3-Edge-Connectivity
  • Kurt Mehlhorn, Adrian Neumann
Control code
867773812
Dimensions
unknown
Extent
1 online resource (xx, 430 pages)
File format
unknown
Form of item
online
Isbn
9783642450426
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-45043-3
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)867773812
Label
Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Publication
Note
Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Rolling Upward Planarity Testing of Strongly Connected Graphs
  • Christopher Auer, Christian Bachmaier
  • Towards a Provably Resilient Scheme for Graph-Based Watermarking
  • Lucila Maria Souza Bento, Davidson Boccardo
  • The Normal Graph Conjecture for Classes of Sparse Graphs
  • Anne Berry, Annegret Wagler
  • On the Parameterized Complexity of Computing Graph Bisections
  • René van Bevern, Andreas Emil Feldmann
  • Fixed-Parameter Tractability and Characterizations of Small Special Treewidth
  • Hans L. Bodlaender, Stefan Kratsch
  • Tree-Like Structures in Graphs: A Metric Point of View
  • Feodor F. Dragan
  • Overview of New Approaches for Approximating TSP
  • Ola Svensson
  • Linear Rank-Width and Linear Clique-Width of Trees
  • Isolde Adler, Mamadou Moustapha Kanté
  • Threshold-Coloring and Unit-Cube Contact Representation of Graphs
  • Md. Jawaherul Alam, Steven Chaplick
  • Luerbio Faria, Celina M.H. de Figueiredo
  • FPT Is Characterized by Useful Obstruction Sets
  • Michael R. Fellows, Bart M.P. Jansen
  • Excluding Graphs as Immersions in Surface Embedded Graphs
  • Archontia C. Giannopoulou, Marcin Kamiński
  • OBDD-Based Representation of Interval Graphs
  • Marc Gillé
  • Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs
  • Kathrin Hanauer, Franz J. Brandenburg
  • A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem
  • Frank Kammer
  • Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs
  • Emilio Di Giacomo, Giuseppe Liotta
  • Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
  • Carola Doerr, G. Ramakrishna
  • Thickness and Colorability of Geometric Graphs
  • Stephane Durocher, Ellen Gethner
  • The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube
  • Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
  • Neeldhara Misra, Fahad Panolan, Ashutosh Rai
  • Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
  • Ragnar Nevries, Christian Rosenke
  • Beyond Knights and Knaves
  • Christine T. Cheng, Andrew McConvey
  • Drawing Graphs with Few Arcs
  • André Schulz
  • Connecting Terminals and 2-Disjoint Connected Subgraphs
  • Jan Arne Telle, Yngve Villanger
  • On Retracts, Absolute Retracts, and Folds in Cographs
  • Ton Kloks, Yue-Li Wang
  • Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors
  • Tomasz Krawczyk, Arkadiusz Pawlik
  • On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
  • Nathan Lindzey, Ross M. McConnell
  • Certifying 3-Edge-Connectivity
  • Kurt Mehlhorn, Adrian Neumann
Control code
867773812
Dimensions
unknown
Extent
1 online resource (xx, 430 pages)
File format
unknown
Form of item
online
Isbn
9783642450426
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-45043-3
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)867773812

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...