Abstract is missing.
- Structures and Hyperstructures in Metabolic NetworksAlberto Marchetti-Spaccamela. 1-4 [doi]
- Important Separators and Parameterized AlgorithmsDániel Marx. 5-10 [doi]
- Split Clique Graph ComplexityLiliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez. 11-22 [doi]
- On Searching for Small Kochen-Specker Vector SystemsFelix Arends, Joël Ouaknine, Charles W. Wampler. 23-34 [doi]
- Characterizations of Deque and Queue GraphsChristopher Auer, Andreas Gleißner. 35-46 [doi]
- Graph Classes with Structured Neighborhoods and Algorithmic ApplicationsRémy Belmonte, Martin Vatshelle. 47-58 [doi]
- Exact Algorithms for KaylesHans L. Bodlaender, Dieter Kratsch. 59-70 [doi]
- The Cinderella Game on Holes and Anti-holesMarijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger. 71-82 [doi]
- On the Complexity of Planar Covering of Small GraphsOndrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec. 83-94 [doi]
- Approximability of Economic Equilibrium for Housing Markets with Duplicate HousesKatarína Cechlárová, Eva Jelínková. 95-106 [doi]
- Planarization and Acyclic Colorings of Subcubic Claw-Free GraphsChristine T. Cheng, Eric McDermid, Ichiro Suzuki. 107-118 [doi]
- List Coloring in the Absence of a Linear ForestJean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma. 119-130 [doi]
- Parameterized Complexity of Eulerian Deletion ProblemsMarek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter. 131-142 [doi]
- Restricted Cuts for Bisections in Solid Grids: A Proof via PolygonsAndreas Emil Feldmann, Shantanu Das 0001, Peter Widmayer. 143-154 [doi]
- Maximum Independent Set in 2-Direction Outersegment GraphsHolger Flier, Matús Mihalák, Peter Widmayer, Anna Zych. 155-166 [doi]
- Complexity of Splits Reconstruction for Low-Degree TreesSerge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan. 167-178 [doi]
- Empires Make Cartography Hard: The Complexity of the Empire Colouring ProblemAndrew R. A. McGrae, Michele Zito. 179-190 [doi]
- Alternation GraphsMagnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin. 191-202 [doi]
- Improved Bounds for Minimum Fault-Tolerant Gossip GraphsToru Hasunuma, Hiroshi Nagamochi. 203-214 [doi]
- Parameterized Two-Player Nash EquilibriumDanny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström. 215-226 [doi]
- Counting Independent Sets in Claw-Free GraphsKonstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski. 227-237 [doi]
- On the Independence Number of Graphs with Maximum Degree 3Iyad A. Kanj, Fenghui Zhang. 238-249 [doi]
- On Computing an Optimal Semi-matchingFrantisek Galcík, Ján Katrenic, Gabriel Semanisin. 250-261 [doi]
- Planar k-Path in Subexponential Time and Polynomial SpaceDaniel Lokshtanov, Matthias Mnich, Saket Saurabh. 262-270 [doi]
- Approximability of the Path-Distance-Width for AT-free GraphsYota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki. 271-282 [doi]
- Hanani-Tutte and Monotone DrawingsRadoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic. 283-294 [doi]
- On Collinear Sets in Straight-Line DrawingsAlexander Ravsky, Oleg Verbitsky. 295-306 [doi]
- From Few Components to an Eulerian Graph by Adding ArcsManuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller. 307-318 [doi]
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a GridSteven Chaplick, Elad Cohen, Juraj Stacho. 319-330 [doi]
- A Polynomial Time Algorithm for Bounded Directed PathwidthHisao Tamaki. 331-342 [doi]