| No. |
Title |
Author |
Year |
| 1 |
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands |
Bang-Jensen, Jørgen et al. |
2023 |
| 2 |
Breaking the All Subsets Barrier for Min k-Cut |
Lokshtanov, Daniel et al. |
2023 |
| 3 |
Fixed-Parameter Algorithms for Fair Hitting Set Problems |
Inamdar, Tanmay et al. |
2023 |
| 4 |
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii |
Bandyapadhyay, Sayan et al. |
2023 |
| 5 |
Kernelization for Spreading Points |
Fomin, Fedor V. et al. |
2023 |
| 6 |
Lossy Kernelization for (Implicit) Hitting Set Problems |
Fomin, Fedor V. et al. |
2023 |
| 7 |
Minimum-Membership Geometric Set Cover, Revisited |
Bandyapadhyay, Sayan et al. |
2023 |
| 8 |
Parameterized Approximation Scheme for Feedback Vertex Set |
Jana, Satyabrata et al. |
2023 |
| 9 |
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability) |
Inamdar, Tanmay et al. |
2023 |
| 10 |
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation |
Agrawal, Akanksha et al. |
2022 |
| 11 |
An Exact Algorithm for Knot-Free Vertex Deletion |
Ramanujan, M. S. et al. |
2022 |
| 12 |
Detours in Directed Graphs |
Fomin, Fedor V. et al. |
2022 |
| 13 |
Exact Exponential Algorithms for Clustering Problems |
Fomin, Fedor V. et al. |
2022 |
| 14 |
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems |
Kanesh, Lawqueen et al. |
2022 |
| 15 |
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets |
Abhinav, Ankit et al. |
2022 |
| 16 |
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles |
Kumar, Neeraj et al. |
2022 |
| 17 |
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs |
Bandyapadhyay, Sayan et al. |
2022 |
| 18 |
A Polynomial Kernel for Bipartite Permutation Vertex Deletion |
Kanesh, Lawqueen et al. |
2021 |
| 19 |
A Polynomial Kernel for Deletion to Ptolemaic Graphs |
Agrawal, Akanksha et al. |
2021 |
| 20 |
An ETH-Tight Algorithm for Multi-Team Formation |
Lokshtanov, Daniel et al. |
2021 |
| 21 |
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs |
Agrawal, Akanksha et al. |
2021 |
| 22 |
Diverse Collections in Matroids and Graphs |
Fomin, Fedor V. et al. |
2021 |
| 23 |
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space |
Fomin, Fedor V. et al. |
2021 |
| 24 |
Exploiting Dense Structures in Parameterized Complexity |
Lochet, William et al. |
2021 |
| 25 |
k-Distinct Branchings Admits a Polynomial Kernel |
Bang-Jensen, Jørgen et al. |
2021 |
| 26 |
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion |
Lokshtanov, Daniel et al. |
2020 |
| 27 |
A Polynomial Kernel for Paw-Free Editing |
Eiben, Eduard et al. |
2020 |
| 28 |
Approximation in (Poly-) Logarithmic Space |
Biswas, Arindam et al. |
2020 |
| 29 |
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds |
Fomin, Fedor V. et al. |
2020 |
| 30 |
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2020 |
| 31 |
Fault Tolerant Subgraphs with Applications in Kernelization |
Lochet, William et al. |
2020 |
| 32 |
Improved FPT Algorithms for Deletion to Forest-Like Structures |
Gowda, Kishen N. et al. |
2020 |
| 33 |
On the (Parameterized) Complexity of Almost Stable Marriage |
Gupta, Sushmita et al. |
2020 |
| 34 |
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs |
Gunda, Spoorthy et al. |
2020 |
| 35 |
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components |
Neogi, Rian et al. |
2020 |
| 36 |
On the Parameterized Complexity of Grid Contraction |
Saurabh, Saket et al. |
2020 |
| 37 |
On the Parameterized Complexity of Maximum Degree Contraction Problem |
Saurabh, Saket et al. |
2020 |
| 38 |
Optimal Output Sensitive Fault Tolerant Cuts |
Banerjee, Niranka et al. |
2020 |
| 39 |
Parameterization Above a Multiplicative Guarantee |
Fomin, Fedor V. et al. |
2020 |
| 40 |
Parameterized Complexity of Directed Spanner Problems |
Fomin, Fedor V. et al. |
2020 |
| 41 |
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs |
Choudhary, Pratibha et al. |
2020 |
| 42 |
Quick Separation in Chordal and Split Graphs |
Misra, Pranabendu et al. |
2020 |
| 43 |
The Parameterized Complexity of Guarding Almost Convex Polygons |
Agrawal, Akanksha et al. |
2020 |
| 44 |
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem |
Lokshtanov, Daniel et al. |
2019 |
| 45 |
Approximate Counting of k-Paths: Deterministic and in Polynomial Space |
Björklund, Andreas et al. |
2019 |
| 46 |
Connecting the Dots (with Minimum Crossings) |
Agrawal, Akanksha et al. |
2019 |
| 47 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |
| 48 |
Decomposition of Map Graphs with Applications |
Fomin, Fedor V. et al. |
2019 |
| 49 |
Exact and Approximate Digraph Bandwidth |
Jain, Pallavi et al. |
2019 |
| 50 |
Exploring the Kernelization Borders for Hitting Cycles |
Agrawal, Akanksha et al. |
2019 |
| 51 |
Going Far From Degeneracy |
Fomin, Fedor V. et al. |
2019 |
| 52 |
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) |
Fomin, Fedor V. et al. |
2019 |
| 53 |
Packing Arc-Disjoint Cycles in Tournaments |
Bessy, Stéphane et al. |
2019 |
| 54 |
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices |
Agrawal, Akanksha et al. |
2019 |
| 55 |
Parameterized Complexity of Conflict-Free Matchings and Paths |
Agrawal, Akanksha et al. |
2019 |
| 56 |
Parameterized Complexity of Multi-Node Hubs |
Saurabh, Saket et al. |
2019 |
| 57 |
Parameterized Streaming Algorithms for Min-Ones d-SAT |
Agrawal, Akanksha et al. |
2019 |
| 58 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |
| 59 |
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces |
Carpenter, Timothy et al. |
2018 |
| 60 |
Balanced Judicious Bipartition is Fixed-Parameter Tractable |
Lokshtanov, Daniel et al. |
2018 |
| 61 |
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS |
Lokshtanov, Daniel et al. |
2018 |
| 62 |
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy |
Agrawal, Akanksha et al. |
2018 |
| 63 |
Erdös-Pósa Property of Obstructions to Interval Graphs |
Agrawal, Akanksha et al. |
2018 |
| 64 |
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming |
Fomin, Fedor V. et al. |
2018 |
| 65 |
On the Parameterized Complexity of Contraction to Generalization of Trees |
Agrawal, Akanksha et al. |
2018 |
| 66 |
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers |
Bishnu, Arijit et al. |
2018 |
| 67 |
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 68 |
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity |
Lokshtanov, Daniel et al. |
2018 |
| 69 |
Reducing CMSO Model Checking to Highly Connected Graphs |
Lokshtanov, Daniel et al. |
2018 |
| 70 |
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number |
Misra, Pranabendu et al. |
2018 |
| 71 |
A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
Lokshtanov, Daniel et al. |
2017 |
| 72 |
Communication Complexity of Pairs of Graph Families with Applications |
Kolay, Sudeshna et al. |
2017 |
| 73 |
Covering Vectors by Spaces: Regular Matroids |
Fomin, Fedor V. et al. |
2017 |
| 74 |
Exact Algorithms for Terrain Guarding |
Ashok, Pradeesha et al. |
2017 |
| 75 |
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2017 |
| 76 |
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set |
Agrawal, Akanksha et al. |
2017 |
| 77 |
Matrix Rigidity from the Viewpoint of Parameterized Complexity |
Fomin, Fedor V. et al. |
2017 |
| 78 |
Packing Cycles Faster Than Erdos-Posa |
Lokshtanov, Daniel et al. |
2017 |
| 79 |
Parameterized Algorithms and Kernels for Rainbow Matching |
Gupta, Sushmita et al. |
2017 |
| 80 |
Split Contraction: The Untold Story |
Agrawal, Akanksha et al. |
2017 |
| 81 |
Editing to Connected f-Degree Graph |
Fomin, Fedor V. et al. |
2016 |
| 82 |
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers |
Lal, Akash et al. |
2016 |
| 83 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |
| 84 |
Kernelization of Cycle Packing with Relaxed Disjointness Constraints |
Agrawal, Akanksha et al. |
2016 |
| 85 |
Kernels for Deletion to Classes of Acyclic Digraphs |
Agrawal, Akanksha et al. |
2016 |
| 86 |
LIPICs, Volume 65, FSTTCS'16, Complete Volume |
Lal, Akash et al. |
2016 |
| 87 |
Lower Bounds for Approximation Schemes for Closest String |
Cygan, Marek et al. |
2016 |
| 88 |
Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs |
Kolay, Sudeshna et al. |
2016 |
| 89 |
Simultaneous Feedback Edge Set: A Parameterized Perspective |
Agrawal, Akanksha et al. |
2016 |
| 90 |
Simultaneous Feedback Vertex Set: A Parameterized Perspective |
Agrawal, Akanksha et al. |
2016 |
| 91 |
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems |
Fomin, Fedor et al. |
2016 |
| 92 |
B-Chromatic Number: Beyond NP-Hardness |
Panolan, Fahad et al. |
2015 |
| 93 |
Finding Even Subgraphs Even Faster |
Goyal, Prachi et al. |
2015 |
| 94 |
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators |
Majumdar, Diptapriyo et al. |
2015 |
| 95 |
Quick but Odd Growth of Cacti |
Kolay, Sudeshna et al. |
2015 |
| 96 |
Connecting Vertices by Independent Trees |
Basavaraju, Manu et al. |
2014 |
| 97 |
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) |
Giannopoulou, Archontia C. et al. |
2014 |
| 98 |
Backdoors to q-Horn |
Gaspers, Serge et al. |
2013 |
| 99 |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
Fomin, Fedor V. et al. |
2013 |
| 100 |
Partially Polynomial Kernels for Set Cover and Test Cover |
Basavaraju, Manu et al. |
2013 |
