default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID39. WG 2013: Lübeck, Germany
- Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk:
Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Lecture Notes in Computer Science 8165, Springer 2013, ISBN 978-3-642-45042-6 - Feodor F. Dragan:
Tree-Like Structures in Graphs: A Metric Point of View. 1-4 - Ola Svensson:
Overview of New Approaches for Approximating TSP. 5-11 - Isolde Adler, Mamadou Moustapha Kanté:
Linear Rank-Width and Linear Clique-Width of Trees. 12-25 - Md. Jawaherul Alam, Steven Chaplick
, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold-Coloring and Unit-Cube Contact Representation of Graphs. 26-37 - Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer:
Rolling Upward Planarity Testing of Strongly Connected Graphs. 38-49 - Lucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Towards a Provably Resilient Scheme for Graph-Based Watermarking. 50-63 - Anne Berry, Annegret Wagler:
The Normal Graph Conjecture for Classes of Sparse Graphs. 64-75 - René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. 76-87 - Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen:
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. 88-99 - Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ 5-Graph is a Spanner. 100-114 - Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). 115-126 - Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. 127-138 - Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt:
Equilateral L-Contact Graphs. 139-151 - Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze:
Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. 152-164 - Nina Chiarelli, Martin Milanic:
Linear Separation of Total Dominating Sets in Graphs. 165-176 - Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Sparse Square Roots. 177-188 - Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang:
Completing Colored Graphs to Meet a Target Property. 189-200 - Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. 201-212 - Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs. 213-224 - Carola Doerr, G. Ramakrishna, Jens M. Schmidt:
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. 225-236 - Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
Thickness and Colorability of Geometric Graphs. 237-248 - Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto:
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. 249-260 - Michael R. Fellows, Bart M. P. Jansen:
FPT Is Characterized by Useful Obstruction Sets. 261-273 - Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos:
Excluding Graphs as Immersions in Surface Embedded Graphs. 274-285 - Marc Gillé:
OBDD-Based Representation of Interval Graphs. 286-297 - Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer:
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. 298-309 - Frank Kammer:
A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. 310-320 - Ton Kloks, Yue-Li Wang:
On Retracts, Absolute Retracts, and Folds in Cographs. 321-332 - Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak:
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. 333-344 - Nathan Lindzey, Ross M. McConnell:
On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. 345-357 - Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt:
Certifying 3-Edge-Connectivity. 358-369 - Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. 370-381 - Ragnar Nevries, Christian Rosenke:
Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs. 382-393 - Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson:
Beyond Knights and Knaves. 394-405 - André Schulz:
Drawing Graphs with Few Arcs. 406-417 - Jan Arne Telle, Yngve Villanger:
Connecting Terminals and 2-Disjoint Connected Subgraphs. 418-428
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 2025-12-12 01:06 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:
