Abstract is missing.
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with HeuristicsChristian Komusiewicz, André Nichterlein, Rolf Niedermeier. 3-15 [doi]
- Open Problems on Graph Coloring for Special Graph ClassesDaniël Paulusma. 16-30 [doi]
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical NetworksShmuel Zaks. 31-46 [doi]
- The Stable Fixtures Problem with PaymentsPéter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky. 49-63 [doi]
- Complexity of Secure SetsBernhard Bliem, Stefan Woltran. 64-77 [doi]
- Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial TimeAndreas Brandstädt, Elaine M. Eschen, Erik Friese. 78-89 [doi]
- On the Tree Search Problem with Non-uniform CostsFerdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla. 90-102 [doi]
- O(n^2) Time Algorithm for the Minimal Permutation Completion ProblemChristophe Crespelle, Anthony Perez, Ioan Todinca. 103-115 [doi]
- On the Number of Minimal Separators in GraphsSerge Gaspers, Simon Mackenzie. 116-121 [doi]
- Efficient Farthest-Point Queries in Two-terminal Series-parallel NetworksCarsten Grimm. 122-137 [doi]
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal GraphsMamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno. 138-153 [doi]
- Finding Paths in Grids with Forbidden TransitionsMamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse. 154-168 [doi]
- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized ResultsThiago Braga Marcilon, Rudini M. Sampaio. 169-185 [doi]
- Minimum Eccentricity Shortest Paths in Some Structured Graph ClassesFeodor F. Dragan, Arne Leitert. 189-202 [doi]
- Approximating Source Location and Star Survivable Network ProblemsGuy Kortsarz, Zeev Nutov. 203-218 [doi]
- On the Complexity of Computing the k-restricted Edge-connectivity of a GraphLuis Pedro Montejano, Ignasi Sau. 219-233 [doi]
- Weak Unit Disk and Interval Representation of GraphsMd. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter. 237-251 [doi]
- Simultaneous Visibility Representations of Plane st-graphs Using L-shapesWilliam S. Evans, Giuseppe Liotta, Fabrizio Montecchiani. 252-265 [doi]
- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and PseudohalfplanesBalázs Keszegh, Dömötör Pálvölgyi. 266-280 [doi]
- Unsplittable Coverings in the PlaneJános Pach, Dömötör Pálvölgyi. 281-296 [doi]
- Induced Minor Free Graphs: Isomorphism and Clique-widthRémy Belmonte, Yota Otachi, Pascal Schweitzer. 299-311 [doi]
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold GraphsFernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos. 312-324 [doi]
- Colouring and Covering Nowhere Dense GraphsMartin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos Stavropoulos. 325-338 [doi]
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected GraphsFelix Joos. 339-350 [doi]
- Well-quasi-ordering Does Not Imply Bounded Clique-widthVadim V. Lozin, Igor Razgon, Victor Zamaraev. 351-359 [doi]
- A Slice Theoretic Approach for Embedding Problems on DigraphsMateus de Oliveira Oliveira. 360-372 [doi]
- Decomposition Theorems for Square-free 2-matchings in Bipartite GraphsKenjiro Takazawa. 373-387 [doi]
- Saturated Simple and 2-simple Topological Graphs with Few EdgesPéter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz 0001. 391-405 [doi]
- Testing Full Outer-2-planarity in Linear TimeSeok-Hee Hong, Hiroshi Nagamochi. 406-421 [doi]
- Triangulating Planar Graphs While Keeping the Pathwidth SmallTherese C. Biedl. 425-439 [doi]
- Polynomial Kernelization for Removing Induced Claws and DiamondsMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna. 440-455 [doi]
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation GraphsFlorent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov. 456-471 [doi]
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SATBart M. P. Jansen. 472-486 [doi]
- Recognizing k-equistable Graphs in FPT TimeEun Jung Kim 0002, Martin Milanic, Oliver Schaudt. 487-498 [doi]
- Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal CliquesMathieu Liedloff, Pedro Montealegre, Ioan Todinca. 499-512 [doi]