default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID50th WG 2024: Gozd Martuljek, Slovenia
- Daniel Král
, Martin Milanic:
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers. Lecture Notes in Computer Science 14760, Springer 2025, ISBN 978-3-031-75408-1
Test of Time Award Survey
- Hans L. Bodlaender:
Approximation Algorithms for Treewidth, Pathwidth, and Treedepth - A Short Survey. 3-18
Contributed Talks
- Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron:
Fast Winning Strategies for the Attacker in Eternal Domination. 21-34 - Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler:
Independent Set Reconfiguration in H-Free Graphs. 35-49 - Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney:
Enumerating Minimal Solution Sets for Metric Graph Problems. 50-64 - Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time. 65-78 - Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald:
Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. 79-91 - Therese Biedl, Debajyoti Mondal:
Improved Outerplanarity Bounds for Planar Graphs. 92-106 - Hans L. Bodlaender, Krisztina Szilágyi:
XNLP-Hardness of Parameterized Problems on Planar Graphs. 107-120 - Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg:
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. 121-135 - Nathan Claudet, Simon Perdrix:
Covering a Graph with Minimal Local Sets. 136-150 - Sarel Cohen, Lior Kamma, Aikaterini Niklanovits:
A New Approach for Approximating Directed Rooted Networks. 151-165 - Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Covering and Packing Partially Ordered Items. 166-180 - Carl Feghali, Malory Marin, Rémi Watrigant:
Beyond Recognizing Well-Covered Graphs. 181-195 - Eva Fluck, Sandra Kiefer, Christoph Standke:
Untangling Gaussian Mixtures. 196-210 - P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad:
Face-Hitting Dominating Sets in Planar Graphs. 211-219 - Robert Ganian, Mathis Rocton, Daniel Unterberger:
The Parameterized Complexity Landscape of the Unsplittable Flow Problem. 220-235 - Yuval Gitlitz, Ofer Neiman, Richard Spence:
Lightweight Near-Additive Spanners. 236-250 - Irene Heinrich, Eda Kaja, Pascal Schweitzer:
Finite Vertex-Colored Ultrahomogeneous Oriented Graphs. 251-265 - Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf:
Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete. 266-281 - Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia:
Roman Cycle Hitting Set. 282-296 - Telikepalli Kavitha:
Popular Solutions for Optimal Matchings. 297-311 - Ryan Keeney, Daniel Lokshtanov:
Degreewidth on Semi-complete Digraphs. 312-326 - Linda Kleist, Peter Kramer, Christian Rieck:
On the Connectivity of the Flip Graph of Plane Spanning Paths. 327-342 - Kacper Kluk, Hoang La, Marta Piecyk:
Graph Reconstruction with Connectivity Queries. 343-357 - Stefan Kratsch, Van Bang Le:
On Polynomial Kernelization for Stable Cutset. 358-373 - R. Krithika, V. K. Kutty Malu, Prafullkumar Tale:
Revisiting Path Contraction and Cycle Contraction. 374-386 - Jan Kyncl, Jan Soukup:
Many Views of Planar Point Sets. 387-399 - Benedikt Künzel, Jonathan Rollin:
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs. 400-414 - Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith:
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. 415-429 - Miriam Münch, Maximilian Pfister, Ignaz Rutter:
Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth. 430-443 - Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen:
The Complexity of Diameter on H-free Graphs. 444-459 - Dimitrios M. Thilikos, Sebastian Wiederrecht:
Approximating Branchwidth on Parametric Extensions of Planarity. 460-474
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-02-19 00:50 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:
