|
Ziad Ismaili Alaoui, Namrata and Sebastian Wild
|
Succinct Preferential-Attachment Graphs
|
|
Todor Antić, Giuseppe Liotta, Tomáš Masařík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff and Johannes Zink
|
Unbent Collections of Orthogonal Drawings
|
|
Leonid Antipov and Stefan Kratsch
|
Boundaried Kernelization
|
|
Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh Hang Nguyen and Mikaël Rabie
|
Canadian Traveler Problems in Temporal Graphs
|
|
Matthias Bentert, Fedor Fomin, Petr Golovach and Laure Morelle
|
When does FTP become FPT?
|
|
Helena Bergold, Vesna Iršič Chenoweth, Robert Lauff, Joachim Orthaber, Manfred Scheucher and Alexandra Wesolek
|
Subgraph-Universal Planar Graphs for Trees
|
|
Sriram Bhyravarapu, Shashanka Kulamarva, Pritesh Kumar, Shivesh K. Roy and Saket Saurabh
|
Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT
|
|
Sriram Bhyravarapu, Soumem Mandal, Ashutosh Rai, Saket Saurabh and Shaily Verma
|
Chromatic Index under Parameterized Settings
|
|
Hans Bodlaender, Danny Hermelin and Erik Jan van Leeuwen
|
Concurrency Constrained Scheduling with Tree-Like Constraints
|
|
Flavia Bonomo, Nick Brettell, Andrea Munaro and Daniel Paulusma
|
Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms
|
|
Mujin Choi, Claire Hilaire, Martin Milanič and Sebastian Wiederrecht
|
Excluding an induced wheel minor in graphs without large induced stars
|
|
Daniel Cranston, Moritz Mühlenthaler and Benjamin Peyrille
|
A simple quadratic kernel for Token Jumping on surfaces
|
|
Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler, Sebastian Ordyniak and Daniel Paulusma
|
Bounding Width on Graph Classes of Constant Diameter
|
|
Thomas Depian, Simon D. Fink, Robert Ganian and Martin Nöllenburg
|
The Peculiarities of Extending Queue Layouts
|
|
Louiss Esperet and Sébastien Zeitoun
|
Reductions in local certification
|
|
Simon D. Fink, Matthias Pfretzschner and Peter Stumpf
|
Segment Intersection Representations, Level Planarity and Constrained Ordering Problems
|
|
Babak Ghanbari and Robert Samal
|
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
|
|
Denise Graafsma, Bodo Manthey and Alexander Skopalik
|
Playing Snake on a Graph
|
|
Meike Hatzel and Michał Pilipczuk
|
On graphs coverable by chubby shortest paths
|
|
Vojtěch Hotmar and Jiří Fink
|
Matchings of five directions in hypercube extends to Hamilton cycles and paths with prescribed ends
|
|
Lars Jaffke, Paloma de Lima, Wojciech Nadara and Emmanuel Sam
|
A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees
|
|
Marc Kaufmann, Johannes Lengler, Ulysse Schaller and Konstantin Sturm
|
Expanders in Models of Social Networks
|
|
Batya Kenig
|
Connectivity-Preserving Minimum Separator in AT-free Graphs
|
|
Christian Komusiewicz, Diptapriyo Majumdar and Frank Sommer
|
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
|
|
Stefan Kratsch and Pascal Kunz
|
Efficient parameterized approximation
|
|
Michael Lampis and Manolis Vasilakis
|
Structural Parameterizations for Induced and Acyclic Matching
|
|
Malory Marin, Stéphan Thomassé, Nicolas Trotignon and Rémi Watrigant
|
A structural description of Zykov and Blanche Descartes graphs
|
|
George Mertzios, Hendrik Molter, Nils Morawietz and Paul Spirakis
|
Realizing temporal transportation trees
|
|
Haiko Müller and Arash Rafiey
|
Interval H-graphs : Recognition and forbidden obstructions
|
|
Geevarghese Philip and Shrinidhi Teganahally Sridhara
|
Faster Algorithms for Graph Monopolarity
|
|
Marco Ricci, Jonathan Rollin, André Schulz and Alexandra Weinberger
|
On plane cycles in geometric multipartite graphs
|
|
Paweł Rzążewski and Bartosz Walczak
|
Polynomial-time recognition and maximum independent set in Burling graphs
|