default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID41. WG 2015: Garching, Germany
- Ernst W. Mayr:
Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers. Lecture Notes in Computer Science 9224, Springer 2016, ISBN 978-3-662-53173-0
Invited Talks
- Christian Komusiewicz, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. 3-15 - Daniël Paulusma
:
Open Problems on Graph Coloring for Special Graph Classes. 16-30 - Shmuel Zaks:
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks. 31-46
Computational Complexity
- Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The Stable Fixtures Problem with Payments. 49-63 - Bernhard Bliem, Stefan Woltran:
Complexity of Secure Sets. 64-77 - Andreas Brandstädt, Elaine M. Eschen, Erik Friese:
Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. 78-89 - Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the Tree Search Problem with Non-uniform Costs. 90-102 - Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. 103-115 - Serge Gaspers, Simon Mackenzie:
On the Number of Minimal Separators in Graphs. 116-121 - Carsten Grimm:
Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks. 122-137 - Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. 138-153 - Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse:
Finding Paths in Grids with Forbidden Transitions. 154-168 - Thiago Braga Marcilon, Rudini M. Sampaio:
The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results. 169-185
Design and Analysis
- Feodor F. Dragan, Arne Leitert:
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. 189-202 - Guy Kortsarz, Zeev Nutov:
Approximating Source Location and Star Survivable Network Problems. 203-218 - Luis Pedro Montejano, Ignasi Sau:
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. 219-233
Computational Geometry
- Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Weak Unit Disk and Interval Representation of Graphs. 237-251 - William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani:
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. 252-265 - Balázs Keszegh, Dömötör Pálvölgyi:
An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. 266-280 - János Pach, Dömötör Pálvölgyi:
Unsplittable Coverings in the Plane. 281-296
Structural Graph Theory
- Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-width. 299-311 - Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos:
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. 312-324 - Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos:
Colouring and Covering Nowhere Dense Graphs. 325-338 - Felix Joos:
Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs. 339-350 - Vadim V. Lozin, Igor Razgon, Victor Zamaraev:
Well-quasi-ordering Does Not Imply Bounded Clique-width. 351-359 - Mateus de Oliveira Oliveira:
A Slice Theoretic Approach for Embedding Problems on Digraphs. 360-372 - Kenjiro Takazawa:
Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs. 373-387
Graph Drawing
- Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated Simple and 2-simple Topological Graphs with Few Edges. 391-405 - Seok-Hee Hong, Hiroshi Nagamochi:
Testing Full Outer-2-planarity in Linear Time. 406-421
Fixed Parameter Tractability
- Therese Biedl:
Triangulating Planar Graphs While Keeping the Pathwidth Small. 425-439 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. 440-455 - Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. 456-471 - Bart M. P. Jansen:
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. 472-486 - Eun Jung Kim, Martin Milanic, Oliver Schaudt:
Recognizing k-equistable Graphs in FPT Time. 487-498 - Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. 499-512
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 2026-08-09 22:54 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
