| No. |
Title |
Author |
Year |
| 1 |
Breaking the All Subsets Barrier for Min k-Cut |
Lokshtanov, Daniel et al. |
2023 |
| 2 |
Counting and Sampling Labeled Chordal Graphs in Polynomial Time |
Hébert-Johnson, Úrsula et al. |
2023 |
| 3 |
Lossy Kernelization for (Implicit) Hitting Set Problems |
Fomin, Fedor V. et al. |
2023 |
| 4 |
Parameterized Approximation Scheme for Feedback Vertex Set |
Jana, Satyabrata et al. |
2023 |
| 5 |
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability) |
Inamdar, Tanmay et al. |
2023 |
| 6 |
Backdoor Sets on Nowhere Dense SAT |
Lokshtanov, Daniel et al. |
2022 |
| 7 |
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles |
Kumar, Neeraj et al. |
2022 |
| 8 |
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs |
Bandyapadhyay, Sayan et al. |
2022 |
| 9 |
Wordle Is NP-Hard |
Lokshtanov, Daniel et al. |
2022 |
| 10 |
An ETH-Tight Algorithm for Multi-Team Formation |
Lokshtanov, Daniel et al. |
2021 |
| 11 |
b-Coloring Parameterized by Clique-Width |
Jaffke, Lars et al. |
2021 |
| 12 |
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable |
Lokshtanov, Daniel et al. |
2021 |
| 13 |
Efficient Algorithms for Least Square Piecewise Polynomial Regression |
Lokshtanov, Daniel et al. |
2021 |
| 14 |
Exploiting Dense Structures in Parameterized Complexity |
Lochet, William et al. |
2021 |
| 15 |
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion |
Lokshtanov, Daniel et al. |
2020 |
| 16 |
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds |
Fomin, Fedor V. et al. |
2020 |
| 17 |
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2020 |
| 18 |
Fault Tolerant Subgraphs with Applications in Kernelization |
Lochet, William et al. |
2020 |
| 19 |
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs |
Gunda, Spoorthy et al. |
2020 |
| 20 |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets |
Lokshtanov, Daniel et al. |
2020 |
| 21 |
Parameterization Above a Multiplicative Guarantee |
Fomin, Fedor V. et al. |
2020 |
| 22 |
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs |
Choudhary, Pratibha et al. |
2020 |
| 23 |
Removing Connected Obstacles in the Plane Is FPT |
Eiben, Eduard et al. |
2020 |
| 24 |
The Parameterized Complexity of Guarding Almost Convex Polygons |
Agrawal, Akanksha et al. |
2020 |
| 25 |
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem |
Lokshtanov, Daniel et al. |
2019 |
| 26 |
Approximate Counting of k-Paths: Deterministic and in Polynomial Space |
Björklund, Andreas et al. |
2019 |
| 27 |
Bisection of Bounded Treewidth Graphs by Convolutions |
Eiben, Eduard et al. |
2019 |
| 28 |
Computing the Largest Bond of a Graph |
Duarte, Gabriel L. et al. |
2019 |
| 29 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |
| 30 |
Decomposition of Map Graphs with Applications |
Fomin, Fedor V. et al. |
2019 |
| 31 |
Going Far From Degeneracy |
Fomin, Fedor V. et al. |
2019 |
| 32 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |
| 33 |
Picking Random Vertices (Invited Talk) |
Lokshtanov, Daniel |
2019 |
| 34 |
The Parameterized Complexity of Finding Point Sets with Hereditary Properties |
Eppstein, David et al. |
2019 |
| 35 |
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces |
Carpenter, Timothy et al. |
2018 |
| 36 |
Balanced Judicious Bipartition is Fixed-Parameter Tractable |
Lokshtanov, Daniel et al. |
2018 |
| 37 |
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS |
Lokshtanov, Daniel et al. |
2018 |
| 38 |
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy |
Agrawal, Akanksha et al. |
2018 |
| 39 |
Erdös-Pósa Property of Obstructions to Interval Graphs |
Agrawal, Akanksha et al. |
2018 |
| 40 |
Front Matter, Table of Contents, Preface, Conference Organization |
Lokshtanov, Daniel et al. |
2018 |
| 41 |
LIPIcs, Volume 89, IPEC'17, Complete Volume |
Lokshtanov, Daniel et al. |
2018 |
| 42 |
On the Parameterized Complexity of Simultaneous Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 43 |
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 44 |
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity |
Lokshtanov, Daniel et al. |
2018 |
| 45 |
Reducing CMSO Model Checking to Highly Connected Graphs |
Lokshtanov, Daniel et al. |
2018 |
| 46 |
A 2lk Kernel for l-Component Order Connectivity |
Kumar, Mithilesh et al. |
2017 |
| 47 |
A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
Lokshtanov, Daniel et al. |
2017 |
| 48 |
Covering Vectors by Spaces: Regular Matroids |
Fomin, Fedor V. et al. |
2017 |
| 49 |
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2017 |
| 50 |
Matrix Rigidity from the Viewpoint of Parameterized Complexity |
Fomin, Fedor V. et al. |
2017 |
| 51 |
Packing Cycles Faster Than Erdos-Posa |
Lokshtanov, Daniel et al. |
2017 |
| 52 |
Split Contraction: The Untold Story |
Agrawal, Akanksha et al. |
2017 |
| 53 |
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments |
Kumar, Mithilesh et al. |
2016 |
| 54 |
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments |
Kumar, Mithilesh et al. |
2016 |
| 55 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |
| 56 |
Kernelization of Cycle Packing with Relaxed Disjointness Constraints |
Agrawal, Akanksha et al. |
2016 |
| 57 |
Lower Bounds for Approximation Schemes for Closest String |
Cygan, Marek et al. |
2016 |
| 58 |
Simultaneous Feedback Vertex Set: A Parameterized Perspective |
Agrawal, Akanksha et al. |
2016 |
| 59 |
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems |
Fomin, Fedor et al. |
2016 |
| 60 |
Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451) |
Kratsch, Stefan et al. |
2015 |
| 61 |
Quick but Odd Growth of Cacti |
Kolay, Sudeshna et al. |
2015 |
| 62 |
Graph Modification Problems (Dagstuhl Seminar 14071) |
Bodlaender, Hans L. et al. |
2014 |
| 63 |
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) |
Giannopoulou, Archontia C. et al. |
2014 |
| 64 |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
Fomin, Fedor V. et al. |
2013 |
| 65 |
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs |
Lokshtanov, Daniel et al. |
2012 |
| 66 |
Hitting forbidden minors: Approximation and Kernelization |
Fomin, Fedor V. et al. |
2011 |
| 67 |
Obtaining a Bipartite Graph by Contracting Few Edges |
Heggernes, Pinar et al. |
2011 |
| 68 |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
Dorn, Frederic et al. |
2010 |
| 69 |
Determining the Winner of a Dodgson Election is Hard |
Fellows, Michael et al. |
2010 |
| 70 |
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves |
Fernau, Henning et al. |
2009 |
| 71 |
Subexponential Algorithms for Partial Cover Problems |
Fomin, Fedor V. et al. |
2009 |
