Daniel Lokshtanov
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
169
Venues
25
Active years
2005–2026
Best venue rank
A*
Where they publish
- A*SODA45 papers
- A*ICALP27 papers
- AESA16 papers
- A*STOC14 papers
- ASTACS14 papers
- A*FOCS9 papers
- BWG8 papers
- BMFCS6 papers
- BLATIN5 papers
- BWADS4 papers
- CIWOCA3 papers
- A*IJCAI3 papers
- CCOCOA2 papers
- BISAAC2 papers
- CLAGOS1 paper
- NationalFUN1 paper
- BSAGT1 paper
- A*LICS1 paper
- A*ICML1 paper
- BFCT1 paper
- A*AAAI1 paper
- NationalCOCOON1 paper
- CTAMC1 paper
- BWAOA1 paper
- NationalFAW1 paper
Papers
169 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Parameterized Approximation of Rectangle Stabbing. | Huairui Chu, Ajaykrishnan E. S., Daniel Lokshtanov, Anikait Mundhra, Thomas Schibler, Xiaoyang Xu, Jie Xue |
| 2026 | ESA | On the Complexity of Multipacking. | Sandip Das, Sk Samim Islam, Daniel Lokshtanov |
| 2026 | ESA | Covering Points with Rectangular Boundaries. | Madhumita Kundu, Daniel Lokshtanov, Soumi Nandi, Saket Saurabh, Kushal Singanporia |
| 2026 | STOC | Forbidden Subgraphs of Graphs with Low Bandwidth. | Maria Chudnovsky, Daniel Lokshtanov, Eran Nevo |
| 2026 | STOC | Fine-Grained Bounds for Courcelle's Theorem. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | ICALP | Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dniel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue |
| 2025 | IWOCA | Parameterized Algorithms for Power Edge Set and Zero Forcing Set. | Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh |
| 2025 | MFCS | Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. | Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2025 | SODA | PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. | Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2025 | SODA | Tree Independence Number IV. Even-hole-free graphs. | Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl |
| 2025 | SODA | Fixed-Parameter Tractability of Hedge Cut. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh |
| 2025 | SODA | Crossing Number in Slightly Superexponential Time (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi |
| 2025 | SODA | Parameterized Approximation for Capacitated | Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue |
| 2025 | STOC | Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | STOC | Subexponential Parameterized Algorithms for Hitting Subgraphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | STACS | Parameterized Saga of First-Fit and Last-Fit Coloring. | Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma |
| 2025 | STACS | Sampling Unlabeled Chordal Graphs in Expected Polynomial Time. | rsula Hbert-Johnson, Daniel Lokshtanov |
| 2024 | FOCS | Efficient Approximation of Fractional Hypertree Width. | Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue |
| 2024 | ICALP | Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. | Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | IJCAI | Parameterized Complexity of Kidney Exchange Revisited. | rsula Hbert-Johnson, Daniel Lokshtanov, Chinmay Sonar, Vaishali Surianarayanan |
| 2024 | SODA | Odd Cycle Transversal on | Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma |
| 2024 | SODA | Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2024 | SODA | Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. | Tuukka Korhonen, Daniel Lokshtanov |
| 2024 | SODA | Meta-theorems for Parameterized Streaming Algorithms‡. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2024 | STOC | Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. | Peter Gartland, Daniel Lokshtanov, Toms Masark, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | WG | Degreewidth on Semi-complete Digraphs. | Ryan Keeney, Daniel Lokshtanov |
| 2023 | ESA | Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). | Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2023 | ESA | Lossy Kernelization for (Implicit) Hitting Set Problems. | Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2023 | ESA | Counting and Sampling Labeled Chordal Graphs in Polynomial Time. | rsula Hbert-Johnson, Daniel Lokshtanov, Eric Vigoda |
| 2023 | ICALP | Breaking the All Subsets Barrier for Min k-Cut. | Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2023 | LAGOS | Min-max coverage problems on tree-like metrics. | Eric Aaron, rsula Hbert-Johnson, Danny Krizanc, Daniel Lokshtanov |
| 2023 | MFCS | Parameterized Approximation Scheme for Feedback Vertex Set. | Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh |
| 2023 | SODA | Shortest Cycles With Monotone Submodular Costs. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
| 2023 | SODA | Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. | Peter Gartland, Daniel Lokshtanov |
| 2023 | SODA | Graph Classes with Few Minimal Separators. II. A Dichotomy. | Peter Gartland, Daniel Lokshtanov |
| 2023 | SODA | A Framework for Approximation Schemes on Disk Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2023 | STOC | An Improved Parameterized Algorithm for Treewidth. | Tuukka Korhonen, Daniel Lokshtanov |
| 2023 | WADS | An ETH-Tight Algorithm for Bidirected Steiner Connectivity. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2022 | FUN | Wordle Is NP-Hard. | Daniel Lokshtanov, Bernardo Subercaseaux |
| 2022 | ICALP | Backdoor Sets on Nowhere Dense SAT. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan |
| 2022 | SODA | Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. | Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2022 | SODA | Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2022 | SODA | Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2022 | STOC | Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2022 | SAGT | Gehrlein Stable Committee with Multi-modal Preferences. | Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh |
| 2021 | ESA | Efficient Algorithms for Least Square Piecewise Polynomial Regression. | Daniel Lokshtanov, Subhash Suri, Jie Xue |
| 2021 | IJCAI | Diversity in Kemeny Rank Aggregation: A Parameterized Approach. | Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf |
| 2021 | SODA | A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. | Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri |
| 2021 | SODA | FPT-approximation for FPT Problems. | Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2021 | SODA | Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). | Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | STOC | Finding large induced sparse subgraphs in | Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2021 | STACS | b-Coloring Parameterized by Clique-Width. | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
| 2021 | STACS | Exploiting Dense Structures in Parameterized Complexity. | William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2020 | FOCS | Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time. | Peter Gartland, Daniel Lokshtanov |
| 2020 | FOCS | A Parameterized Approximation Scheme for Min $k$-Cut. | Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2020 | ICALP | Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. | Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi |
| 2020 | ICALP | A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | LATIN | 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 |
| 2020 | SODA | Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2020 | SODA | 2-Approximating Feedback Vertex Set in Tournaments. | Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | SODA | Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2020 | STOC | Hitting topological minors is FPT. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2020 | STOC | An exponential time parameterized algorithm for planar disjoint paths. | Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi |
| 2019 | ESA | Bisection of Bounded Treewidth Graphs by Convolutions. | Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad |
| 2019 | ESA | Going Far From Degeneracy. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Path Contraction Faster Than 2 | Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale |
| 2019 | ICALP | Approximate Counting of k-Paths: Deterministic and in Polynomial Space. | Andreas Bjrklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Decomposition of Map Graphs with Applications. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | MFCS | Picking Random Vertices (Invited Talk). | Daniel Lokshtanov |
| 2019 | WADS | Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | ICALP | Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | ICALP | Reducing CMSO Model Checking to Highly Connected Graphs. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | LATIN | A Polynomial Sized Kernel for Tracking Paths Problem. | Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2018 | MFCS | Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. | Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh |
| 2018 | SODA | Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. | Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. | Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2018 | SODA | The complexity of independent set reconfiguration on bipartite graphs. | Daniel Lokshtanov, Amer E. Mouawad |
| 2018 | SODA | Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. | Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlk |
| 2018 | SODA | Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | SODA | When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2018 | STACS | Erds-Psa Property of Obstructions to Interval Graphs. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | COCOA | Faster and Enhanced Inclusion-Minimal Cograph Completion. | Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry |
| 2017 | ESA | A Linear-Time Parameterized Algorithm for Node Unique Label Cover. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2017 | ICALP | Covering Vectors by Spaces: Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | ICALP | Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2017 | ICALP | Packing Cycles Faster Than Erdos-Posa. | Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi |
| 2017 | SODA | Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | SODA | Spanning Circuits in Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | SODA | Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. | Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna |
| 2017 | SODA | Beating Brute Force for Systems of Polynomial Equations over Finite Fields. | Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu |
| 2017 | STOC | Lossy kernelization. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | STACS | Split Contraction: The Untold Story. | Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2017 | STACS | Matrix Rigidity from the Viewpoint of Parameterized Complexity. | Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi |
| 2017 | WG | Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. | Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad |
| 2016 | FOCS | Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. | Fedor V. Fomin, Daniel Lokshtanov, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2016 | ICALP | Kernelization of Cycle Packing with Relaxed Disjointness Constraints. | Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh |
| 2016 | LATIN | A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. | Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh |
| 2016 | LICS | A New Perspective on FO Model Checking of Dense Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Daniel Lokshtanov, M. S. Ramanujan |
| 2016 | SODA | Independence and Efficient Domination on | Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen |
| 2016 | STOC | Exact algorithms via monotone local search. | Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh |
| 2016 | STACS | Simultaneous Feedback Vertex Set: A Parameterized Perspective. | Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh |
| 2016 | STACS | Kernelization and Sparseness: the Case of Dominating Set. | Pl Grns Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Snchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar |
| 2016 | STACS | Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. | Mithilesh Kumar, Daniel Lokshtanov |
| 2015 | ESA | Consensus Patterns (Probably) Has no EPTAS. | Christina Boucher, Christine Lo, Daniel Lokshtanov |
| 2015 | ESA | On the Threshold of Intractability. | Pl Grns Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan |
| 2015 | ESA | Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. | Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk |
| 2015 | FOCS | FO Model Checking on Posets of Bounded Width. | Jakub Gajarsk, Petr Hlinen, Daniel Lokshtanov, Jan Obdrzlek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh |
| 2015 | ICALP | Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. | Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2015 | ICALP | Uniform Kernelization Complexity of Hitting Forbidden Minors. | Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh |
| 2015 | ICALP | Deterministic Truncation of Linear Matroids. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2015 | ICALP | Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2015 | SODA | Solving | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh |
| 2015 | WADS | Reconfiguration on Sparse Graphs. | Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2014 | ESA | Representative Sets of Product Families. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2014 | ESA | Solving Multicut Faster Than 2 n. | Daniel Lokshtanov, Saket Saurabh, Ondrej Such |
| 2014 | FOCS | Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2014 | ICALP | Parameterized Complexity of Bandwidth on Trees. | Markus Sortland Dregi, Daniel Lokshtanov |
| 2014 | SODA | Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2014 | SODA | A Near-Optimal Planarization Algorithm. | Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh |
| 2014 | SODA | Independent Set in | Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger |
| 2014 | STOC | Minimum bisection is fixed parameter tractable. | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2013 | ESA | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. | Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Such |
| 2013 | FOCS | An O(c^k n) 5-Approximation Algorithm for Treewidth. | Hans L. Bodlaender, Pl Grns Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
| 2013 | ICML | Near-Optimal Bounds for Cross-Validation via Loss Stability. | Ravi Kumar, Daniel Lokshtanov, Sergei Vassilvitskii, Andrea Vattani |
| 2013 | STACS | Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2012 | FOCS | Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2012 | ICALP | Parameterized Tractability of Multiway Cut with Parity Constraints. | Daniel Lokshtanov, M. S. Ramanujan |
| 2012 | SODA | Bidimensionality and geometric graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2012 | SODA | Linear kernels for (connected) dominating set on | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2011 | FCT | Kernelization: An Overview. | Daniel Lokshtanov |
| 2011 | ICALP | Tight Bounds for Linkages in Planar Graphs. | Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2011 | ICALP | Clustering with Local Restrictions. | Daniel Lokshtanov, Dniel Marx |
| 2011 | SODA | Bidimensionality and EPTAS. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2011 | SODA | Slightly Superexponential Parameterized Problems. | Daniel Lokshtanov, Dniel Marx, Saket Saurabh |
| 2011 | SODA | Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. | Daniel Lokshtanov, Dniel Marx, Saket Saurabh |
| 2011 | STACS | Hitting forbidden minors: Approximation and Kernelization. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | WADS | Feedback Vertex Set in Mixed Graphs. | Paul S. Bonsma, Daniel Lokshtanov |
| 2011 | WG | Planar k-Path in Subexponential Time and Polynomial Space. | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
| 2010 | AAAI | Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | COCOON | Imbalance Is Fixed Parameter Tractable. | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2010 | IWOCA | Ranking and Drawing in Subexponential Time. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | LATIN | Sharp Separation and Applications to Exact and Parameterized Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh |
| 2010 | MFCS | Algorithmic Lower Bounds for Problems on Decomposable Graphs. | Daniel Lokshtanov |
| 2010 | SODA | Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2010 | SODA | Bidimensionality and Kernels. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2010 | STOC | Saving space by algebraization. | Daniel Lokshtanov, Jesper Nederlof |
| 2010 | STACS | Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | WG | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
| 2010 | WG | Generalized Graph Clustering: Recognizing ( | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
| 2009 | FOCS | (Meta) Kernelization. | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
| 2009 | ICALP | Fast FAST. | Noga Alon, Daniel Lokshtanov, Saket Saurabh |
| 2009 | ICALP | Incompressibility through Colors and IDs. | Michael Dom, Daniel Lokshtanov, Saket Saurabh |
| 2009 | ICALP | Distortion Is Fixed Parameter Tractable. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
| 2009 | IJCAI | Local Search: Is Brute-Force Avoidable? | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
| 2009 | ISAAC | Bandwidth on AT-Free Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
| 2009 | IWOCA | Simpler Parameterized Algorithm for OCT. | Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar |
| 2009 | SODA | Clique-width: on the price of generality. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2009 | STACS | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
| 2009 | TAMC | Linear Kernel for Planar Connected Dominating Set. | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
| 2009 | WAOA | Guard Games on Graphs: Keep the Intruder Out! | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
| 2009 | WG | An Exact Algorithm for Minimum Distortion Embedding. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2008 | FAW | Characterizing and Computing Minimal Cograph Completions. | Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos |
| 2008 | ISAAC | Graph Layout Problems Parameterized by Vertex Cover. | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |
| 2008 | LATIN | On the Complexity of Reconstructing H -free Graphs from Their Star Systems. | Fedor V. Fomin, Jan Kratochvl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle |
| 2008 | WG | Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
| 2007 | COCOA | On the Complexity of Some Colorful Problems Parameterized by Treewidth. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
| 2007 | MFCS | On the Complexity of Computing Treelength. | Daniel Lokshtanov |
| 2005 | WG | Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. | Pinar Heggernes, Daniel Lokshtanov |