| 2015 | Approximating Source Location and Star Survivable Network Problems. | Guy Kortsarz, Zeev Nutov |
| 2015 | Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. | Christian Komusiewicz, Andr Nichterlein, Rolf Niedermeier |
| 2015 | An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. | Balzs Keszegh, Dmtr Plvlgyi |
| 2015 | Finding Paths in Grids with Forbidden Transitions. | Mamadou Moustapha Kant, Fatima Zahra Moataz, Benjamin Momge, Nicolas Nisse |
| 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 | Parity Linkage and the Erdős-Psa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs. | Felix Joos |
| 2015 | On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. | Bart M. P. Jansen |
| 2015 | Testing Full Outer-2-planarity in Linear Time. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2015 | Saturated Simple and 2-simple Topological Graphs with Few Edges. | Pter Hajnal, Alexander Igamberdiev, Gnter Rote, Andr Schulz |
| 2015 | Colouring and Covering Nowhere Dense Graphs. | Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos |
| 2015 | Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks. | Carsten Grimm |
| 2015 | On the Number of Minimal Separators in Graphs. | Serge Gaspers, Simon Mackenzie |
| 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 | Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. | William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani |
| 2015 | Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. | Feodor F. Dragan, Arne Leitert |
| 2015 | Polynomial Kernelization for Removing Induced Claws and Diamonds. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna |
| 2015 | An | Christophe Crespelle, Anthony Perez, Ioan Todinca |
| 2015 | On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. | Fernanda Couto, Lurbio Faria, Sylvain Gravier, Sulamita Klein, Vincius Fernandes dos Santos |
| 2015 | On the Tree Search Problem with Non-uniform Costs. | Ferdinando Cicalese, Balzs Keszegh, Bernard Lidick, Dmtr Plvlgyi, Toms Valla |
| 2015 | Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time. | Andreas Brandstdt, Elaine M. Eschen, Erik Friese |
| 2015 | Complexity of Secure Sets. | Bernhard Bliem, Stefan Woltran |
| 2015 | The Stable Fixtures Problem with Payments. | Pter Bir, Walter Kern, Danil Paulusma, Pter Wojuteczky |
| 2015 | Triangulating Planar Graphs While Keeping the Pathwidth Small. | Therese Biedl |
| 2015 | Induced Minor Free Graphs: Isomorphism and Clique-width. | Rmy Belmonte, Yota Otachi, Pascal Schweitzer |
| 2015 | Weak Unit Disk and Interval Representation of Graphs. | Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter |