default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40. WG 2014: Nouan-le-Fuzelier, France
- Dieter Kratsch, Ioan Todinca:
Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8747, Springer 2014, ISBN 978-3-319-12339-4 - Reinhard Diestel, Sang-il Oum:
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). 1-14 - Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
:
Distributedly Testing Cycle-Freeness. 15-28 - Eric Aaron, Danny Krizanc, Elliot Meyerson:
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs. 29-41 - Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon:
Linear Rank-Width of Distance-Hereditary Graphs. 42-55 - Nieke Aerts, Stefan Felsner:
Vertex Contact Graphs of Paths on a Grid. 56-68 - Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin:
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). 69-80 - Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Separation Dimension. 81-92 - Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal Induced Matchings in Triangle-Free Graphs. 93-104 - Paul S. Bonsma:
Independent Set Reconfiguration in Cographs. 105-116 - Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. 117-128 - Eglantine Camby, Oliver Schaudt:
A New Characterization of Pk-free Graphs. 129-138 - Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho:
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. 139-151 - Basile Couëtoux, Elie Nakache, Yann Vaxès:
The Maximum Labeled Path Problem. 152-163 - Thomas Erlebach, Michael Hoffmann:
Minimum Spanning Tree Verification Under Uncertainty. 164-175 - Radoslav Fulek:
Towards the Hanani-Tutte Theorem for Clustered Graphs. 176-188 - Rajiv Gandhi, Guy Kortsarz:
On Set Expansion Problems and the Small Set Expansion Conjecture. 189-200 - Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. 201-213 - Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad:
Recognizing Threshold Tolerance Graphs in O(n2) Time. 214-224 - Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. 225-237 - Qian-Ping Gu, Gengchun Xu:
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. 238-249 - Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. 250-262 - Michel Habib, Antoine Mamcarz:
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. 263-274 - Stefan Hougardy, Rasmus T. Schroeder:
Edge Elimination in TSP Instances. 275-286 - Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke:
The Parameterized Complexity of the Rainbow Subgraph Problem. 287-298 - Leo van Iersel, Steven Kelk:
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees. 299-311 - Satoru Iwata, Alantha Newman, R. Ravi:
Graph-TSP from Steiner Cycles. 312-323 - Felix Joos:
A Characterization of Mixed Unit Interval Graphs. 324-335 - Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
On the Number of Connected Sets in Bounded Degree Graphs. 336-347 - Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. 348-359 - Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. 360-371 - Thiago Braga Marcilon, Samuel Nascimento, Rudini M. Sampaio:
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results. 372-383 - Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. 384-395 - Sigve Hortemo Sæther, Jan Arne Telle:
Between Treewidth and Clique-Width. 396-407 - Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. 408-419
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:
