Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. - Daniel Lokshtanov; Christian Sloper (ACiD, 2005)

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. - Pinar Heggernes; Daniel Lokshtanov (WG, 2005)

Optimal broadcast domination in polynomial time. - Pinar Heggernes; Daniel Lokshtanov (Discret. Math., 2006)

Graph Layout Problems Parameterized by Vertex Cover. - Michael R. Fellows; Daniel Lokshtanov; Neeldhara Misra; Frances A. Rosamond; Saket Saurabh 001 (ISAAC, 2008)

Capacitated Domination and Covering: A Parameterized Perspective. - Michael Dom; Daniel Lokshtanov; Saket Saurabh 001; Yngve Villanger (IWPEC, 2008)

Wheel-Free Deletion Is W[2]-Hard. - Daniel Lokshtanov (IWPEC, 2008)

On the Complexity of Reconstructing H -free Graphs from Their Star Systems. - Fedor V. Fomin; Jan Kratochvíl; Daniel Lokshtanov; Federico Mancini 001; Jan Arne Telle (LATIN, 2008)

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. - Pinar Heggernes; Daniel Lokshtanov; Rodica Mihai; Charis Papadopoulos (WG, 2008)

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Elena Losievskaja; Frances A. Rosamond; Saket Saurabh 001 (CoRR, 2008)

Fast FAST. - Noga Alon; Daniel Lokshtanov; Saket Saurabh 001 (ICALP (1), 2009)

Incompressibility through Colors and IDs. - Michael Dom; Daniel Lokshtanov; Saket Saurabh 001 (ICALP (1), 2009)

Simpler Parameterized Algorithm for OCT. - Daniel Lokshtanov; Saket Saurabh 001; Somnath Sikdar (IWOCA, 2009)

Planar Capacitated Dominating Set Is W[1]-Hard. - Hans L. Bodlaender; Daniel Lokshtanov; Eelko Penninkx (IWPEC, 2009)

On the Directed Degree-Preserving Spanning Tree Problem. - Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (IWPEC, 2009)

Even Faster Algorithm for Set Splitting! - Daniel Lokshtanov; Saket Saurabh 001 (IWPEC, 2009)

An exact almost optimal algorithm for target set selection in social networks. - Oren Ben-Zwi; Danny Hermelin; Daniel Lokshtanov; Ilan Newman (EC, 2009)

Clique-width: on the price of generality. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2009)

Finding the longest isometric cycle in a graph. - Daniel Lokshtanov (Discret. Appl. Math., 2009)

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. - Michael R. Fellows; Daniel Lokshtanov; Neeldhara Misra; Matthias Mnich; Frances A. Rosamond; Saket Saurabh 001 (Theory Comput. Syst., 2009)

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (AAAI, 2010)

Determining the Winner of a Dodgson Election is Hard. - Michael R. Fellows; Bart M. P. Jansen; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001 (FSTTCS, 2010)

Ranking and Drawing in Subexponential Time. - Henning Fernau; Fedor V. Fomin; Daniel Lokshtanov; Matthias Mnich; Geevarghese Philip; Saket Saurabh 001 (IWOCA, 2010)

Algorithmic Lower Bounds for Problems on Decomposable Graphs. - Daniel Lokshtanov (MFCS, 2010)

Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2010)

Saving space by algebraization. - Daniel Lokshtanov; Jesper Nederlof (STOC, 2010)

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. - Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (SWAT, 2010)

Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. - Pinar Heggernes; Daniel Lokshtanov; Jesper Nederlof; Christophe Paul; Jan Arne Telle (WG, 2010)

On the complexity of computing treelength. - Daniel Lokshtanov (Discret. Appl. Math., 2010)

Characterizing and computing minimal cograph completions. - Daniel Lokshtanov; Federico Mancini 001; Charis Papadopoulos (Discret. Appl. Math., 2010)

Intractability of Clique-Width Parameterizations. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001 (SIAM J. Comput., 2010)

Kernelization: An Overview. - Daniel Lokshtanov (FCT, 2011)

Tight Bounds for Linkages in Planar Graphs. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (ICALP (1), 2011)

Bidimensionality and EPTAS. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (SODA, 2011)

Feedback Vertex Set in Mixed Graphs. - Paul S. Bonsma; Daniel Lokshtanov (WADS, 2011)

Planar k-Path in Subexponential Time and Polynomial Space. - Daniel Lokshtanov; Matthias Mnich; Saket Saurabh 001 (WG, 2011)

Outlier Detection for DNA Fragment Assembly - Christina Boucher 001; Christine Lo; Daniel Lokshtanov (CoRR, 2011)

On Problems as Hard as CNFSAT - Marek Cygan; Holger Dell; Daniel Lokshtanov; Dániel Marx; Jesper Nederlof; Yoshio Okamoto; Ramamohan Paturi; Saket Saurabh 001; Magnus Wahlström (CoRR, 2011)

Treewidth governs the complexity of target set selection. - Oren Ben-Zwi; Danny Hermelin; Daniel Lokshtanov; Ilan Newman (Discret. Optim., 2011)

On the directed Full Degree Spanning Tree problem. - Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Discret. Optim., 2011)

Lower bounds based on the Exponential Time Hypothesis. - Daniel Lokshtanov; Dániel Marx; Saket Saurabh 001 (Bull. EATCS, 2011)

On the complexity of some colorful problems parameterized by treewidth. - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001; Stefan Szeider; Carsten Thomassen (Inf. Comput., 2011)

Subexponential algorithms for partial cover problems. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Inf. Process. Lett., 2011)

On the complexity of reconstructing H-free graphs from their Star Systems. - Fedor V. Fomin; Jan Kratochvíl; Daniel Lokshtanov; Federico Mancini 001; Jan Arne Telle (J. Graph Theory, 2011)

Cutwidth of Split Graphs and Threshold Graphs. - Pinar Heggernes; Daniel Lokshtanov; Rodica Mihai; Charis Papadopoulos (SIAM J. Discret. Math., 2011)

Guard games on graphs: Keep the intruder out! - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov (Theor. Comput. Sci., 2011)

An exact algorithm for minimum distortion embedding. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001 (Theor. Comput. Sci., 2011)

Bandwidth on AT-free graphs. - Petr A. Golovach; Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov; Daniel Meister 001; Saket Saurabh 001 (Theor. Comput. Sci., 2011)

A linear kernel for planar connected dominating set. - Daniel Lokshtanov; Matthias Mnich; Saket Saurabh 001 (Theor. Comput. Sci., 2011)

Kernelization - Preprocessing with a Guarantee. - Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (The Multivariate Algorithmic Revolution and Beyond, 2012)

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (FOCS, 2012)

Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. - Daniel Lokshtanov; Saket Saurabh 001; Magnus Wahlström (FSTTCS, 2012)

Parameterized Tractability of Multiway Cut with Parity Constraints. - Daniel Lokshtanov; M. S. Ramanujan 001 (ICALP (1), 2012)

Bidimensionality and geometric graphs. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2012)

Linear kernels for (connected) dominating set on H-minor-free graphs. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (SODA, 2012)

Sharp Separation and Applications to Exact and Parameterized Algorithms. - Fedor V. Fomin; Fabrizio Grandoni 001; Daniel Lokshtanov; Saket Saurabh 001 (Algorithmica, 2012)

Planar F-Deletion: Approximation and Optimal FPT Algorithms - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (CoRR, 2012)

Local search: Is brute-force avoidable? - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001; Yngve Villanger (J. Comput. Syst. Sci., 2012)

Faster algorithms for finding and counting subgraphs. - Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; B. V. Raghavendra Rao (J. Comput. Syst. Sci., 2012)

Cops and Robber Game Without Recharging. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov (Theory Comput. Syst., 2012)

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. - Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov; Jesper Nederlof (SIAM J. Discret. Math., 2012)

Kernel(s) for problems with no kernel: On out-trees with many leaves. - Daniel Binkele-Raible; Henning Fernau; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Yngve Villanger (ACM Trans. Algorithms, 2012)

An O(c^k n) 5-Approximation Algorithm for Treewidth. - Hans L. Bodlaender; Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Daniel Lokshtanov; Michal Pilipczuk (FOCS, 2013)

Near-Optimal Bounds for Cross-Validation via Loss Stability. - Ravi Kumar 001; Daniel Lokshtanov; Sergei Vassilvitskii; Andrea Vattani (ICML (1), 2013)

The Fine Details of Fast Dynamic Programming over Tree Decompositions. - Hans L. Bodlaender; Paul S. Bonsma; Daniel Lokshtanov (IPEC, 2013)

Hardness of r-dominating set on Graphs of Diameter (r + 1). - Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; M. S. Ramanujan 001; Saket Saurabh 001 (IPEC, 2013)

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. - Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (IPEC, 2013)

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (STACS, 2013)

Computing Optimal Steiner Trees in Polynomial Space. - Fedor V. Fomin; Fabrizio Grandoni 001; Dieter Kratsch; Daniel Lokshtanov; Saket Saurabh 001 (Algorithmica, 2013)

A O(c^k n) 5-Approximation Algorithm for Treewidth - Hans L. Bodlaender; Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Daniel Lokshtanov; Michal Pilipczuk (CoRR, 2013)

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. - Frederic Dorn; Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Inf. Comput., 2013)

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. - Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Inf. Comput., 2013)

Clustering with local restrictions. - Daniel Lokshtanov; Dániel Marx (Inf. Comput., 2013)

Imbalance is fixed parameter tractable. - Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh 001 (Inf. Process. Lett., 2013)

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; Saket Saurabh 001 (J. Graph Theory, 2013)

Obtaining a Bipartite Graph by Contracting Few Edges. - Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov; Christophe Paul (SIAM J. Discret. Math., 2013)

Distortion is Fixed Parameter Tractable. - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Elena Losievskaja; Frances A. Rosamond; Saket Saurabh 001 (ACM Trans. Comput. Theory, 2013)

Representative Sets of Product Families. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (ESA, 2014)

Solving Multicut Faster Than 2 n. - Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (ESA, 2014)

Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). - Archontia C. Giannopoulou; Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (FSTTCS, 2014)

Parameterized Complexity of Bandwidth on Trees. - Markus Sortland Dregi; Daniel Lokshtanov (ICALP (1), 2014)

Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2014)

A Near-Optimal Planarization Algorithm. - Bart M. P. Jansen; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2014)

Independent Set in P5-Free Graphs in Polynomial Time. - Daniel Lokshtanov; Martin Vatshelle; Yngve Villanger (SODA, 2014)

On Cutwidth Parameterized by Vertex Cover. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (Algorithmica, 2014)

Contracting Graphs to Paths and Trees. - Pinar Heggernes; Pim van 't Hof; Benjamin Lévêque; Daniel Lokshtanov; Christophe Paul (Algorithmica, 2014)

Kernelization and Sparseness: the case of Dominating Set. - Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Saket Saurabh 001; Fernando Sánchez Villaamil; Somnath Sikdar (CoRR, 2014)

Representative sets for multisets. - Ariel Gabizon; Daniel Lokshtanov; Michal Pilipczuk (CoRR, 2014)

Graph Modification Problems (Dagstuhl Seminar 14071). - Hans L. Bodlaender; Pinar Heggernes; Daniel Lokshtanov (Dagstuhl Reports, 2014)

Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). - Stefan Kratsch; Daniel Lokshtanov; Dániel Marx; Peter Rossmanith (Dagstuhl Reports, 2014)

On the Hardness of Losing Width. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (Theory Comput. Syst., 2014)

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001 (SIAM J. Comput., 2014)

Kernelization Lower Bounds Through Colors and IDs. - Michael Dom; Daniel Lokshtanov; Saket Saurabh 001 (ACM Trans. Algorithms, 2014)

Faster Parameterized Algorithms Using Linear Programming. - Daniel Lokshtanov; N. S. Narayanaswamy; Venkatesh Raman 001; M. S. Ramanujan 001; Saket Saurabh 001 (ACM Trans. Algorithms, 2014)

SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers. - Christine Lo; Boyko Kakaradov; Daniel Lokshtanov; Christina Boucher 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2014)

Parameterized Algorithms - Marek Cygan; Fedor V. Fomin; Lukasz Kowalik; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (Springer, 2015)

Consensus Patterns (Probably) Has no EPTAS. - Christina Boucher 001; Christine Lo; Daniel Lokshtanov (ESA, 2015)

Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. - Ariel Gabizon; Daniel Lokshtanov; Michal Pilipczuk (ESA, 2015)

FO Model Checking on Posets of Bounded Width. - Jakub Gajarský; Petr Hlinený; Daniel Lokshtanov; Jan Obdrzálek; Sebastian Ordyniak; M. S. Ramanujan 001; Saket Saurabh 001 (FOCS, 2015)

Solving d-SAT via Backdoors to Small Treewidth. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; M. S. Ramanujan 001; Saket Saurabh 001 (SODA, 2015)

Parameterized Integer Quadratic Programming: Variables and Coefficients. - Daniel Lokshtanov (CoRR, 2015)

Independence and Efficient Domination on P6-free Graph. - Daniel Lokshtanov; Marcin Pilipczuk; Erik Jan van Leeuwen (CoRR, 2015)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. - Mithilesh Kumar 001; Daniel Lokshtanov (FSTTCS, 2016)

A 2lk Kernel for l-Component Order Connectivity. - Mithilesh Kumar 001; Daniel Lokshtanov (IPEC, 2016)

A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. - Akanksha Agrawal 001; Sudeshna Kolay; Daniel Lokshtanov; Saket Saurabh 001 (LATIN, 2016)

Kernelization and Sparseness: the Case of Dominating Set. - Pål Grønås Drange; Markus Sortland Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Fernando Sánchez Villaamil; Saket Saurabh 001; Sebastian Siebertz; Somnath Sikdar (STACS, 2016)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. - Mithilesh Kumar 001; Daniel Lokshtanov (STACS, 2016)

Lower Bounds for Approximation Schemes for Closest String. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (SWAT, 2016)

On the Ordered List Subgraph Embedding Problems. - Olawale Hassan; Iyad A. Kanj; Daniel Lokshtanov; Ljubomir Perkovic (Algorithmica, 2016)

A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001 (CoRR, 2016)

(Meta) Kernelization. - Hans L. Bodlaender; Fedor V. Fomin; Daniel Lokshtanov; Eelko Penninkx; Saket Saurabh 001; Dimitrios M. Thilikos (J. ACM, 2016)

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (J. ACM, 2016)

A ck n 5-Approximation Algorithm for Treewidth. - Hans L. Bodlaender; Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Daniel Lokshtanov; Michal Pilipczuk (SIAM J. Comput., 2016)

Hitting Forbidden Minors: Approximation and Kernelization. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; Saket Saurabh 001 (SIAM J. Discret. Math., 2016)

Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. - Archontia C. Giannopoulou; Daniel Lokshtanov; Saket Saurabh 001; Ondrej Suchý 001 (SIAM J. Discret. Math., 2016)

On Problems as Hard as CNF-SAT. - Marek Cygan; Holger Dell; Daniel Lokshtanov; Dániel Marx; Jesper Nederlof; Yoshio Okamoto; Ramamohan Paturi; Saket Saurabh 001; Magnus Wahlström (ACM Trans. Algorithms, 2016)

Kernelization, Bidimensionality and Kernels. - Daniel Lokshtanov (Encyclopedia of Algorithms, 2016)

A Linear-Time Parameterized Algorithm for Node Unique Label Cover. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001 (ESA, 2017)

On the Parameterized Complexity of Simultaneous Deletion Problems. - Akanksha Agrawal 001; R. Krithika 001; Daniel Lokshtanov; Amer E. Mouawad; M. S. Ramanujan 001 (FSTTCS, 2017)

Beating Brute Force for Systems of Polynomial Equations over Finite Fields. - Daniel Lokshtanov; Ramamohan Paturi; Suguru Tamaki; R. Ryan Williams; Huacheng Yu (SODA, 2017)

Lossy kernelization. - Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (STOC, 2017)

Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. - Akanksha Agrawal 001; Daniel Lokshtanov; Amer E. Mouawad (WG, 2017)

Quick but Odd Growth of Cacti. - Sudeshna Kolay; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (Algorithmica, 2017)

Polylogarithmic Approximation Algorithms for Weighted-$ mathcal{F}$-Deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (CoRR, 2017)

The Half-integral Erdös-Pósa Property for Non-null Cycles. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001 (CoRR, 2017)

Balanced Judicious Partition is Fixed-Parameter Tractable. - Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (CoRR, 2017)

Faster exact algorithms for some terminal set problems. - Rajesh Chitnis; Fedor V. Fomin; Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (J. Comput. Syst. Sci., 2017)

Irrelevant vertices for the planar Disjoint Paths Problem. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (J. Comb. Theory B, 2017)

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. - Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (SIAM J. Comput., 2017)

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. - Mark Jones 001; Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Ondrej Suchý 001 (SIAM J. Discret. Math., 2017)

Hitting Selected (Odd) Cycles. - Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2017)

Representative Families of Product Families. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (ACM Trans. Algorithms, 2017)

Uniform Kernelization Complexity of Hitting Forbidden Minors. - Archontia C. Giannopoulou; Bart M. P. Jansen; Daniel Lokshtanov; Saket Saurabh 001 (ACM Trans. Algorithms, 2017)

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. - Timothy Carpenter; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Anastasios Sidiropoulos (SoCG, 2018)

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ICALP, 2018)

Reducing CMSO Model Checking to Highly Connected Graphs. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (ICALP, 2018)

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ITCS, 2018)

The Parameterized Complexity of Finding Point Sets with Hereditary Properties. - David Eppstein; Daniel Lokshtanov (IPEC, 2018)

A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. - Daniel Lokshtanov; Mateus de Oliveira Oliveira; Saket Saurabh 001 (IPEC, 2018)

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Daniel Lokshtanov; Saket Saurabh 001 (MFCS, 2018)

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. - Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (SODA, 2018)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (SODA, 2018)

Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. - Daniel Lokshtanov; Ivan Mikhailin; Ramamohan Paturi; Pavel Pudlák (SODA, 2018)

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001 (SODA, 2018)

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. - Gábor Bacsó; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Zsolt Tuza; Erik Jan van Leeuwen (CoRR, 2018)

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. - Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee; Geevarghese Philip; Fahad Panolan; Saket Saurabh 001 (CoRR, 2018)

Randomized contractions meet lean decompositions. - Marek Cygan; Pawel Komosa; Daniel Lokshtanov; Michal Pilipczuk; Marcin Pilipczuk; Saket Saurabh 001 (CoRR, 2018)

Long directed (s, t)-path: FPT algorithm. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Inf. Process. Lett., 2018)

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001 (J. ACM, 2018)

Reconfiguration on sparse graphs. - Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (J. Comput. Syst. Sci., 2018)

Slightly Superexponential Parameterized Problems. - Daniel Lokshtanov; Dániel Marx; Saket Saurabh 001 (SIAM J. Comput., 2018)

Kernelization of Cycle Packing with Relaxed Disjointness Constraints. - Akanksha Agrawal 001; Daniel Lokshtanov; Diptapriyo Majumdar; Amer E. Mouawad; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Covering Vectors by Spaces: Regular Matroids. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Matrix Rigidity from the Viewpoint of Parameterized Complexity. - Fedor V. Fomin; Daniel Lokshtanov; Syed Mohammad Meesum; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2018)

Below All Subsets for Minimal Connected Dominating Set. - Daniel Lokshtanov; Michal Pilipczuk; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Michal Pilipczuk; Marcin Wrochna (ACM Trans. Algorithms, 2018)

Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (ACM Trans. Algorithms, 2018)

Deterministic Truncation of Linear Matroids. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001 (ACM Trans. Algorithms, 2018)

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. - Daniel Lokshtanov; Dániel Marx; Saket Saurabh 001 (ACM Trans. Algorithms, 2018)

Independence and Efficient Domination on P6-free Graphs. - Daniel Lokshtanov; Marcin Pilipczuk; Erik Jan van Leeuwen (ACM Trans. Algorithms, 2018)

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001 (ACM Trans. Algorithms, 2018)

Simultaneous Feedback Vertex Set: A Parameterized Perspective. - Akanksha Agrawal 001; Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh 001 (ACM Trans. Comput. Theory, 2018)

Approximate Counting of k-Paths: Deterministic and in Polynomial Space. - Andreas Björklund; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ICALP, 2019)

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ICALP, 2019)

Decomposition of Map Graphs with Applications. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ICALP, 2019)

Computing the Largest Bond of a Graph. - Gabriel L. Duarte; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (IPEC, 2019)

Picking Random Vertices (Invited Talk). - Daniel Lokshtanov (MFCS, 2019)

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (WADS, 2019)

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. - Gábor Bacsó; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Zsolt Tuza; Erik Jan van Leeuwen (Algorithmica, 2019)

Reducing Topological Minor Containment to the Unique Linkage Theorem. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (CoRR, 2019)

A Brief Note on Single Source Fault Tolerant Reachability. - Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (CoRR, 2019)

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2019)

Exact Algorithms via Monotone Local Search. - Fedor V. Fomin; Serge Gaspers; Daniel Lokshtanov; Saket Saurabh 001 (J. ACM, 2019)

Minimum Bisection Is Fixed-Parameter Tractable. - Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (SIAM J. Comput., 2019)

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. - Fedor V. Fomin; Petteri Kaski; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (SIAM J. Discret. Math., 2019)

Packing Cycles Faster Than Erdos-Posa. - Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2019)

Balanced Judicious Bipartition is Fixed-Parameter Tractable. - Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (SIAM J. Discret. Math., 2019)

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2019)

Spanning Circuits in Regular Matroids. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001 (ACM Trans. Algorithms, 2019)

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2019)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ACM Trans. Algorithms, 2019)

The Complexity of Independent Set Reconfiguration on Bipartite Graphs. - Daniel Lokshtanov; Amer E. Mouawad (ACM Trans. Algorithms, 2019)

Split Contraction: The Untold Story. - Akanksha Agrawal 001; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Comput. Theory, 2019)

Parameterized Algorithms. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Beyond the Worst-Case Analysis of Algorithms, 2020)

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. - Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Treewidth, Kernels, and Algorithms, 2020)

Fair Covering of Points by Balls. - Daniel Lokshtanov; Chinmay Sonar; Subhash Suri; Jie Xue 003 (CCCG, 2020)

Removing Connected Obstacles in the Plane Is FPT. - Eduard Eiben; Daniel Lokshtanov (SoCG, 2020)

Independent Set on $ mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov (FOCS, 2020)

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. - Pratibha Choudhary; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (FSTTCS, 2020)

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (ICALP, 2020)

Parameterization Above a Multiplicative Guarantee. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ITCS, 2020)

Fault Tolerant Subgraphs with Applications in Kernelization. - William Lochet; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ITCS, 2020)

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (SODA, 2020)

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2020)

Hitting topological minors is FPT. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (STOC, 2020)

A Polynomial Sized Kernel for Tracking Paths Problem. - Aritra Banik; Pratibha Choudhary; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2020)

Independent Set on Pk-Free Graphs in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov (CoRR, 2020)

Dominated Minimal Separators are Tame (Nearly All Others are Feral). - Peter Gartland; Daniel Lokshtanov (CoRR, 2020)

Independent Set on C≥-Free Graphs in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov (CoRR, 2020)

Bidimensionality and Kernels. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (SIAM J. Comput., 2020)

Path Contraction Faster than 2n. - Akanksha Agrawal 001; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Prafullkumar Tale (SIAM J. Discret. Math., 2020)

Going Far from Degeneracy. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2020)

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2020)

Approximation Schemes for Low-rank Binary Matrix Approximation Problems. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (ACM Trans. Algorithms, 2020)

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. - Fedor V. Fomin; Daniel Lokshtanov; Sudeshna Kolay; Fahad Panolan; Saket Saurabh 001 (ACM Trans. Algorithms, 2020)

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ACM Trans. Algorithms, 2020)

A New Perspective on FO Model Checking of Dense Graph Classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Daniel Lokshtanov; M. S. Ramanujan 001 (ACM Trans. Comput. Log., 2020)

Efficient Algorithms for Least Square Piecewise Polynomial Regression. - Daniel Lokshtanov; Subhash Suri; Jie Xue 003 (ESA, 2021)

An ETH-Tight Algorithm for Multi-Team Formation. - Daniel Lokshtanov; Saket Saurabh 001; Subhash Suri; Jie Xue 003 (FSTTCS, 2021)

Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable. - Daniel Lokshtanov; Vaishali Surianarayanan (FSTTCS, 2021)

Diversity in Kemeny Rank Aggregation: A Parameterized Approach. - Emmanuel Arrighi; Henning Fernau; Daniel Lokshtanov; Mateus de Oliveira Oliveira; Petra Wolf 002 (IJCAI, 2021)

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. - Neeraj Kumar 004; Daniel Lokshtanov; Saket Saurabh 001; Subhash Suri (SODA, 2021)

FPT-approximation for FPT Problems. - Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2021)

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). - Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (SODA, 2021)

Exploiting Dense Structures in Parameterized Complexity. - William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (STACS, 2021)

Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. - Peter Gartland; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2021)

Computing the Largest Bond and the Maximum Connected Cut of a Graph. - Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (Algorithmica, 2021)

Elimination Distance to Topological-minor-free Graphs is FPT. - Akanksha Agrawal 001; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (CoRR, 2021)

DynamiQ: Planning for Dynamics in Network Streaming Analytics Systems. - Rohan Bhatia; Arpit Gupta; Rob Harrison; Daniel Lokshtanov; Walter Willinger (CoRR, 2021)

Faster and enhanced inclusion-minimal cograph completion. - Christophe Crespelle; Daniel Lokshtanov; Thi Ha Duong Phan; Eric Thierry (Discret. Appl. Math., 2021)

Bisection of bounded treewidth graphs by convolutions. - Eduard Eiben; Daniel Lokshtanov; Amer E. Mouawad (J. Comput. Syst. Sci., 2021)

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. - Meirav Zehavi; Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (J. Comput. Geom., 2021)

Randomized Contractions Meet Lean Decompositions. - Marek Cygan; Pawel Komosa; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001; Magnus Wahlström (ACM Trans. Algorithms, 2021)

Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. - Daniel Lokshtanov; Andreas Björklund; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2021)

2-Approximating Feedback Vertex Set in Tournaments. - Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (ACM Trans. Algorithms, 2021)

Multiplicative Parameterization Above a Guarantee. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Comput. Theory, 2021)

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. - Fedor V. Fomin; Daniel Lokshtanov; Ivan Mihajlin; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Comput. Theory, 2021)

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. - Spoorthy Gunda; Pallavi Jain 001; Daniel Lokshtanov; Saket Saurabh 001; Prafullkumar Tale (ACM Trans. Comput. Theory, 2021)

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. - Neeraj Kumar 004; Daniel Lokshtanov; Saket Saurabh 001; Subhash Suri; Jie Xue 003 (SoCG, 2022)

Wordle Is NP-Hard. - Daniel Lokshtanov; Bernardo Subercaseaux (FUN, 2022)

Backdoor Sets on Nowhere Dense SAT. - Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001 (ICALP, 2022)

Gehrlein Stable Committee with Multi-modal Preferences. - Sushmita Gupta; Pallavi Jain 001; Daniel Lokshtanov; Sanjukta Roy 001; Saket Saurabh 001 (SAGT, 2022)

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. - Akanksha Agrawal 001; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2022)

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2022)

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SODA, 2022)

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. - Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (STOC, 2022)

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. - Jean R. S. Blair; Pinar Heggernes; Paloma T. Lima; Daniel Lokshtanov (Algorithmica, 2022)

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. - Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan; Sebastian Siebertz (Algorithmica, 2022)

Syotti: scalable bait design for DNA enrichment. - Jarno N. Alanko; Ilya B. Slizovskiy; Daniel Lokshtanov; Travis Gagie; Noelle R. Noyes; Christina Boucher 001 (Bioinform., 2022)

Highly unbreakable graph with a fixed excluded minor are almost rigid. - Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (CoRR, 2022)

On the threshold of intractability. - Pål Grønås Drange; Markus Fanebust Dregi; Daniel Lokshtanov; Blair D. Sullivan (J. Comput. Syst. Sci., 2022)

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. - Fedor V. Fomin; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (SIAM J. Comput., 2022)

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). - Tanmay Inamdar 002; Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan (ESA, 2023)

Lossy Kernelization for (Implicit) Hitting Set Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ESA, 2023)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time. - Úrsula Hébert-Johnson; Daniel Lokshtanov; Eric Vigoda (ESA, 2023)

Breaking the All Subsets Barrier for Min k-Cut. - Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan (ICALP, 2023)

Min-max coverage problems on tree-like metrics. - Eric Aaron; Úrsula Hébert-Johnson; Danny Krizanc; Daniel Lokshtanov (LAGOS, 2023)

Parameterized Approximation Scheme for Feedback Vertex Set. - Satyabrata Jana; Daniel Lokshtanov; Soumen Mandal 001; Ashutosh Rai 001; Saket Saurabh 001 (MFCS, 2023)

Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. - Peter Gartland; Daniel Lokshtanov (SODA, 2023)

Graph Classes with Few Minimal Separators. II. A Dichotomy. - Peter Gartland; Daniel Lokshtanov (SODA, 2023)

A Framework for Approximation Schemes on Disk Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SODA, 2023)

An Improved Parameterized Algorithm for Treewidth. - Tuukka Korhonen; Daniel Lokshtanov (STOC, 2023)

An ETH-Tight Algorithm for Bidirected Steiner Connectivity. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (WADS, 2023)

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (CoRR, 2023)

Lower Bound for Independence Covering in C4-Free Graphs. - Michael Kuhn; Daniel Lokshtanov; Zachary Miller (CoRR, 2023)

On Induced Versions of Menger's Theorem on Sparse Graphs. - Peter Gartland; Tuukka Korhonen; Daniel Lokshtanov (CoRR, 2023)

Erdős-Pósa property of obstructions to interval graphs. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (J. Graph Theory, 2023)

Polynomial Kernel for Interval Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2023)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (APPROX/RANDOM, 2024)

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SoCG, 2024)

Efficient Approximation of Fractional Hypertree Width. - Viktoriia Korchemna; Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan; Jie Xue 003 (FOCS, 2024)

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. - Sushmita Gupta; Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (FSTTCS, 2024)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. - Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (ICALP, 2024)

Parameterized Complexity of Kidney Exchange Revisited. - Úrsula Hébert-Johnson; Daniel Lokshtanov; Chinmay Sonar; Vaishali Surianarayanan (IJCAI, 2024)

Kernelization of Counting Problems. - Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ITCS, 2024)

Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma (SODA, 2024)

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2024)

Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. - Tuukka Korhonen; Daniel Lokshtanov (SODA, 2024)

Meta-theorems for Parameterized Streaming Algorithms‡. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2024)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov; Tomás Masarík; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2024)

Degreewidth on Semi-complete Digraphs. - Ryan Keeney; Daniel Lokshtanov (WG, 2024)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (CoRR, 2024)

Maximum Partial List H-Coloring on P5-free graphs in polynomial time. - Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (CoRR, 2024)

Query Planning for Robust and Scalable Hybrid Network Telemetry Systems. - Chaofan Shou; Rohan Bhatia; Arpit Gupta; Rob Harrison; Daniel Lokshtanov; Walter Willinger (Proc. ACM Netw., 2024)

A Parameterized Approximation Scheme for Min $k$-Cut. - Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan (SIAM J. Comput., 2024)

Shortest Cycles with Monotone Submodular Costs. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Daniel Lokshtanov; Giannos Stamoulis (ACM Trans. Algorithms, 2024)

The Parameterized Complexity of Guarding Almost Convex Polygons. - Akanksha Agrawal 001; Kristine V. K. Knudsen; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2024)

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (ACM Trans. Algorithms, 2024)

b-Coloring Parameterized by Clique-Width. - Lars Jaffke; Paloma T. Lima; Daniel Lokshtanov (Theory Comput. Syst., 2024)

Lower Bound for Independence Covering in C4-free Graphs. - Michael Kuhn; Daniel Lokshtanov; Zachary Miller (ACM Trans. Comput. Theory, 2024)

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Dániel Marx; Pranabendu Misra; Daniel Neuen; Saket Saurabh 001; Prafullkumar Tale; Jie Xue 003 (ICALP, 2025)

Parameterized Algorithms for Power Edge Set and Zero Forcing Set. - Sriram Bhyravarapu; Lawqueen Kanesh; Madhumita Kundu; Daniel Lokshtanov; Saket Saurabh 001 (IWOCA, 2025)

Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. - Rohit Gurjar; Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (MFCS, 2025)

PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. - Sayan Bandyapadhyay; Katie Clinch; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2025)

Tree Independence Number IV. Even-hole-free graphs. - Maria Chudnovsky; Peter Gartland; Sepehr Hajebi; Daniel Lokshtanov; Sophie Spirkl (SODA, 2025)

Fixed-Parameter Tractability of Hedge Cut. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2025)

Crossing Number in Slightly Superexponential Time (Extended Abstract). - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Roohani Sharma; Jie Xue 003; Meirav Zehavi (SODA, 2025)

Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities. - Daniel Lokshtanov; Abhishek Sahu; Saket Saurabh 001; Vaishali Surianarayanan; Jie Xue 003 (SODA, 2025)

Parameterized Saga of First-Fit and Last-Fit Coloring. - Akanksha Agrawal 001; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Shaily Verma (STACS, 2025)

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time. - Úrsula Hébert-Johnson; Daniel Lokshtanov (STACS, 2025)

Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (STOC, 2025)

Subexponential Parameterized Algorithms for Hitting Subgraphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (STOC, 2025)

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. - Daniel Lokshtanov; Pranabendu Misra; Michal Pilipczuk; Saket Saurabh 001; Meirav Zehavi (SIAM J. Comput., 2025)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (ACM Trans. Algorithms, 2025)

Tree independence number V. Walls and claws. - Maria Chudnovsky; Julien Codsi; Daniel Lokshtanov; Martin Milanic; Varun Sivashankar (CoRR, 2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. - Satyabrata Jana; Lawqueen Kanesh; Madhumita Kundu; Daniel Lokshtanov; Saket Saurabh 001 (CoRR, 2025)

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. - Daniel Lokshtanov; Ramanujan Maadapuzhi Sridharan; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ACM Trans. Comput. Theory, 2025)

Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized. - Vaishali Surianarayanan; Anikait Mundhra; Ajaykrishnan E. S; Daniel Lokshtanov (Proc. ACM Manag. Data, 2025)

Tree independence number II. Three-path-configurations. - Maria Chudnovsky; Sepehr Hajebi; Daniel Lokshtanov; Sophie Spirkl (J. Comb. Theory B, 2026)