|
- Daniel Lokshtanov, Amer Mouawad, Fahad Panolan and Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
- Louis Dublois, Michael Lampis and Vangelis Paschos
New Algorithms for Mixed Dominating Set
- Davis Issac, Andreas Emil Feldmann and Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
- Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani and Daniel Paulusma
Bounding the Mim-Width of Hereditary Graph Classes
- Marcelo Garlet Milani
A Polynomial Kernel for Funnel Arc Deletion Set
- Lukasz Kowalik and Konrad Majewski
The Asymmetric Travelling Salesman Problem in Sparse Digraphs
- Joergen Bang-Jensen, Eduard Eiben, Gregory Gutin, Magnus Wahlström and Anders Yeo
Component Order Connectivity in Directed Graphs
- Leon Kellerhals and Tomohiro Koana
Parameterized Complexity of Geodetic Set
- Dishant Goyal, Ragesh Jaiswal and Amit Kumar
FPT Approximation for Constrained Metric $k$-Median/Means
- Hans L. Bodlaender and Marieke van der Wegen
Parameterized Complexity of Scheduling Chains of Jobs with Delays
- Tuukka Korhonen
Finding Optimal Triangulations Parameterized by Edge Clique Cover
- Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muehlenthaler and Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic
- Radek Hušek, Dušan Knop and Tomáš Masařík
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- Jesper Nederlof and Céline Swennenhuis
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
- Carl Einarson and Felix Reidl
A general kernelization technique for domination and independence problems in sparse classes
- Steven Chaplick, Petr A. Golovach, Tim A. Hartmann and Dusan Knop
Recognizing Proper Tree-Graphs
- Fedor Fomin, Petr Golovach, William Lochet, Pranabendu Misra, Saket Saurabh and Roohani Sharma
Parameterized Complexity of Directed Spanner Problems
- Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin and Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
- Eduard Eiben, William Lochet and Saket Saurabh
A Polynomial Kernel for Paw-Free Editing
- Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell and O-Joung Kwon
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth
- Ashwin Jacob, Diptapriyo Majumdar and Venkatesh Raman
Parameterized Complexity of Deletion to Scattered Graph Classes
- Ashwin Jacob, Fahad Panolan, Venkatesh Raman and Vibha Sahlot
Structural Parameterizations with Modulator Oblivion
- Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná and Karolina Okrasa
Vertex deletion into bipartite permutation graphs
- Yasuaki Kobayashi and Yota Otachi
Parameterized Complexity of Graph Burning
- Akanksha Agrawal and Ramanujan M. Sridharan
On the Parameterized Complexity of Clique Elimination Distance
- Saket Saurabh and Prafullkumar Tale
On the Parameterized Complexity of Maximum Degree Contraction Problem
|