default search action
44th WG 2018: Cottbus, Germany
- Andreas Brandstädt, Ekkehard Köhler, Klaus Meer:
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Lecture Notes in Computer Science 11159, Springer 2018, ISBN 978-3-030-00255-8 - Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. 1-14 - Jesse Beisegel:
Characterising AT-free Graphs with BFS. 15-26 - Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
, Chrysanthi N. Raftopoulou
Edge Partitions of Optimal 2-plane and 3-plane Graphs. 27-39 - Thomas Bellitto, Benjamin Bergougnoux:
On Minimum Connecting Transition Sets in Graphs. 40-51 - Jelco M. Bodewes, Hans L. Bodlaender
Recognizing Hyperelliptic Graphs in Polynomial Time. 52-64 - Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk
On Directed Feedback Vertex Set Parameterized by Treewidth. 65-78 - Édouard Bonnet, Pawel Rzazewski
Optimality Program in Segment and String Graphs. 79-90 - Paz Carmi, Vida Dujmovic, Pat Morin
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. 91-99 - Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari:
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. 100-110 - Giordano Da Lozzo
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. 111-124 - Konrad K. Dabrowski
Computing Small Pivot-Minors. 125-138 - Peter Damaschke:
Saving Probe Bits by Cube Domination. 139-151 - Mateus de Oliveira Oliveira:
Graph Amalgamation Under Logical Constraints. 152-163 - Michael Gene Dobbins, Linda Kleist
∀∃ℝ-Completeness and Area-Universality. 164-175 - Szymon Dudycz
Optimal General Matchings. 176-189 - Martin E. Dyer
Quasimonotone Graphs. 190-202 - Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner
Equiangular Polygon Contact Representations. 203-215 - Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. 216-227 - Renzo Gómez
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. 228-238 - Niels Grüttemeier, Christian Komusiewicz:
On the Relation of Strong Triadic Closure and Cluster Deletion. 239-251 - Meike Hatzel, Sebastian Wiederrecht
On Perfect Linegraph Squares. 252-265 - Lars Jaffke
On Weak Isomorphism of Rooted Vertex-Colored Graphs. 266-278 - Matthew Johnson
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. 279-291 - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized d-Scattered Set. 292-305 - Telikepalli Kavitha:
Popular Matchings of Desired Size. 306-317 - Linda Kleist
Convexity-Increasing Morphs of Planar Graphs. 318-330 - Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan
Treedepth Bounds in Linear Colorings. 331-343 - Shaohua Li, Marcin Pilipczuk
An Improved FPT Algorithm for Independent Feedback Vertex Set. 344-355 - Anna Lubiw, Debajyoti Mondal:
Construction and Local Routing for Angle-Monotone Graphs. 356-368 - B. S. Panda, Anita Das
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. 369-381
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: