| 2016 | Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers Ernst W. Mayr |
| 2015 | A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2015 | A Slice Theoretic Approach for Embedding Problems on Digraphs. Mateus de Oliveira Oliveira |
| 2015 | Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov |
| 2015 | An Christophe Crespelle, Anthony Perez, Ioan Todinca |
| 2015 | An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. Balázs Keszegh, Dömötör Pálvölgyi |
| 2015 | Approximating Source Location and Star Survivable Network Problems. Guy Kortsarz, Zeev Nutov |
| 2015 | Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Mathieu Liedloff, Pedro Montealegre, Ioan Todinca |
| 2015 | Colouring and Covering Nowhere Dense Graphs. Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos |
| 2015 | Complexity of Secure Sets. Bernhard Bliem, Stefan Woltran |
| 2015 | Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs. Kenjiro Takazawa |
| 2015 | Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. Andreas Brandstädt, Elaine M. Eschen, Erik Friese |
| 2015 | Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks. Carsten Grimm |
| 2015 | Finding Paths in Grids with Forbidden Transitions. Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse |
| 2015 | Induced Minor Free Graphs: Isomorphism and Clique-width. Rémy Belmonte, Yota Otachi, Pascal Schweitzer |
| 2015 | Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. Feodor F. Dragan, Arne Leitert |
| 2015 | On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. Bart M. P. Jansen |
| 2015 | On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks. Shmuel Zaks |
| 2015 | On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. Luis Pedro Montejano, Ignasi Sau |
| 2015 | On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos |
| 2015 | On the Number of Minimal Separators in Graphs. Serge Gaspers, Simon Mackenzie |
| 2015 | On the Tree Search Problem with Non-uniform Costs. Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla |
| 2015 | Open Problems on Graph Coloring for Special Graph Classes. Daniël Paulusma |
| 2015 | Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. Christian Komusiewicz, André Nichterlein, Rolf Niedermeier |
| 2015 | Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs. Felix Joos |
| 2015 | Polynomial Kernelization for Removing Induced Claws and Diamonds. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna |
| 2015 | Recognizing k-equistable Graphs in FPT Time. Eun Jung Kim, Martin Milanic, Oliver Schaudt |
| 2015 | Saturated Simple and 2-simple Topological Graphs with Few Edges. Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz |
| 2015 | Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani |
| 2015 | Testing Full Outer-2-planarity in Linear Time. Seok-Hee Hong, Hiroshi Nagamochi |
| 2015 | The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results. Thiago Braga Marcilon, Rudini M. Sampaio |
| 2015 | The Stable Fixtures Problem with Payments. Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky |
| 2015 | Triangulating Planar Graphs While Keeping the Pathwidth Small. Therese Biedl |
| 2015 | Unsplittable Coverings in the Plane. János Pach, Dömötör Pálvölgyi |
| 2015 | Weak Unit Disk and Interval Representation of Graphs. Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter |
| 2015 | Well-quasi-ordering Does Not Imply Bounded Clique-width. Vadim V. Lozin, Igor Razgon, Victor Zamaraev |