Publications
Academic article
- Daniel Lokshtanov; Paweł Rzążewski; Saket Saurabh et al. (2026). Maximum Partial List H$H$-Coloring on P<inf>5</inf>-Free Graphs in Polynomial Time. (external link)
- Tanmay Inamdar; Satyabrata Jana; Madhumita Kundu et al. (2026). FPT Approximations for Connected Maximum Coverage. (external link)
- Daniel Lokshtanov; M. S. Ramanujan; Saket Saurabh (2026). When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices. (external link)
- Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2025). Fixed-Parameter Tractability of Hedge Cut. (external link)
- Michael Dom; Daniel Lokshtanov; Saket Saurabh et al. (2008). Capacitated Domination and Covering: A Parameterized Perspective. (external link)
- Archontia Giannopoulou; Bart Maarten Paul Jansen; Daniel Lokshtanov et al. (2015). Uniform kernelization complexity of hitting forbidden minors. (external link)
- Daniel Lokshtanov; Marcin Pilipczuk; Michal Pawel Pilipczuk et al. (2017). Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2017). Representative families of product families. (external link)
- Marek Cygan; Holger Dell; Daniel Lokshtanov et al. (2016). On problems as hard as CNF-SAT. (external link)
- Lars Jaffke; Paloma T. Lima; Daniel Lokshtanov (2023). b-Coloring Parameterized by Clique-Width. (external link)
- Fedor Fomin; Daniel Lokshtanov; Neeldhara Misra et al. (2012). Planar F-deletion: Approximation, kernelization and optimal FPT algorithms (extended abstract). (external link)
- Fedor Fomin; Fabrizio Grandoni; Dieter Kratsch et al. (2013). Computing optimal Steiner trees in polynomial space. (external link)
- Daniel Lokshtanov; Daniel Marx; Saket Saurabh (2018). Slightly superexponential parameterized problems. (external link)
- Akanksha Agrawal; Pallavi Jain; Lawqueen Kanesh et al. (2018). Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. (external link)
- Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan et al. (2017). Hitting selected (ODD) Cycles. (external link)
- Frederic Dorn; Fedor Fomin; Daniel Lokshtanov et al. (2010). Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. (external link)
- Fedor Fomin; Daniel Lokshtanov; Syed Mohammad Meesum et al. (2017). Matrix rigidity from the viewpoint of parameterized complexity. (external link)
- Sudeshna Kolay; Daniel Lokshtanov; Fahad Panolan et al. (2017). Quick but Odd Growth of Cacti. (external link)
- Daniel Lokshtanov (2010). Algorithmic Lower Bounds for Problems on Decomposable Graphs. (external link)
- Pål Grønås Drange; Markus Fanebust Dregi; Daniel Lokshtanov et al. (2021). On the threshold of intractability. (external link)
- Fedor Fomin; Daniel Lokshtanov; Dániel Marx et al. (2022). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (external link)
- Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh (2010). Imbalance is fixed parameter tractable. (external link)
- Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan et al. (2017). Lossy kernelization. (external link)
- Daniel Lokshtanov (2010). On the complexity of computing treelength. (external link)
- Jean Blair; Pinar Heggernes; Paloma T. Lima et al. (2022). On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. (external link)
- Fedor Fomin; Daniel Lokshtanov; Dániel Marx et al. (2016). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (external link)
- Daniel Lokshtanov; Saket Saurabh; Roohani Sharma et al. (2018). Balanced judicious bipartition is fixed-paramater tractable. (external link)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2014). On cutwidth parameterized by vertex cover. (external link)
- Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh (2013). Imbalance is fixed parameter tractable. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Amer E. Mouawad (2017). Critical node cut parameterized by treewidth and solution size is W[1]-Hard. (external link)
- Daniel Lokshtanov; Federico Mancini; Charis Papadopoulos (2010). Characterizing and computing minimal cograph completions. (external link)
- Michael Dom; Daniel Lokshtanov; Saket Saurabh (2014). Kernelization lower bounds through colors and IDs. (external link)
- Rajesh Chitnis; Fedor Fomin; Daniel Lokshtanov et al. (2017). Faster exact algorithms for some terminal set problems. (external link)
- Oren Ben-Zwi; Danny Hermelin; Daniel Lokshtanov et al. (2011). Treewidth governs the complexity of target set selection. (external link)
- Jean R S Blair; Pinar Heggernes; Paloma T. Lima et al. (2020). On the maximum number of edges in chordal graphs of bounded degree and matching number. (external link)
- Daniel Lokshtanov; Saket Saurabh; Roohani Sharma et al. (2019). Balanced judicious bipartition is fixed-parameter tractable. (external link)
- Hans L. Bodlaender; Pål Grønås Drange; Markus Sortland Dregi et al. (2013). An O(c^k n) 5-approximation algorithm for treewidth. (external link)
- Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov et al. (2013). Obtaining a bipartite graph by contracting few edges. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2017). Finding, hitting and packing cycles in subexponential time on unit disk graphs. (external link)
- Fedor Fomin; Daniel Lokshtanov; Syed Mohammad Meesum et al. (2018). Matrix rigidity from the viewpoint of parameterized complexity. (external link)
- Fedor Fomin; Petteri Kaski; Daniel Lokshtanov et al. (2015). Parameterized single-exponential time polynomial space algorithm for steiner tree. (external link)
- Daniel Lokshtanov; Mateus De Oliveira Oliveira; Saket Saurabh (2019). A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. (external link)
- David Eppstein; Daniel Lokshtanov (2019). The parameterized complexity of finding point sets with hereditary properties. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Amer E. Mouawad et al. (2018). Simultaneous feedback vertex set: A parameterized perspective. (external link)
- Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov et al. (2013). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. (external link)
- Pinar Heggernes; Pim van 't Hof; Benjamin Lévêque et al. (2014). Contracting graphs to paths and trees. (external link)
- Akanksha Agrawal; R Krithika; Daniel Lokshtanov et al. (2018). On the parameterized complexity of simultaneous deletion problems. (external link)
- Timothy Carpenter; Fedor Fomin; Daniel Lokshtanov et al. (2018). Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. (external link)
- Spoorthy Gunda; Pallavi Jain; Daniel Lokshtanov et al. (2021). On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. (external link)
- Henning Fernau; Fedor Fomin; Daniel Lokshtanov et al. (2014). Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. (external link)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2018). Kernels for (Connected) dominating set on graphs with excluded topological minors. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2019). Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. (external link)
- Aritra Banik; Pratibha Choudhary; Daniel Lokshtanov et al. (2018). A polynomial sized kernel for tracking paths problem. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Amer Abdo Mouawad et al. (2016). SIMULTANEOUS Feedback Vertex set: A parameterized perspective. (external link)
- Pål Grønås Drange; Markus Sortland Dregi; Daniel Lokshtanov et al. (2015). On the threshold of intractability. (external link)
- Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh et al. (2019). Packing cycles faster than Erdos-Posa. (external link)
- Christophe Crespelle; Daniel Lokshtanov; Thi Ha Duong Phan et al. (2021). Faster and enhanced inclusion-minimal cograph completion. (external link)
- Daniel Lokshtanov (2009). Finding the longest isometric cycle in a graph. (external link)
- Fedor Fomin; Daniel Lokshtanov; Venkatesh Raman et al. (2012). Faster algorithms for finding and counting subgraphs. (external link)
- Daniel Lokshtanov; Daniel Marx (2013). Clustering with local restrictions. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov (2011). Guard games on graphs: Keep the intruder out!. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2020). Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2021). ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2018). Polylogarithmic approximation algorithms for weighted-F-Deletion problems. (external link)
- Pinar Heggernes; Daniel Lokshtanov; Rodica Georgeta Mihai et al. (2008). Cutwidth of split graphs, threshold graphs, and proper interval graphs. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2010). Intractability of clique-width parameterizations. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2019). Spanning circuits in regular matroids. (external link)
- Sudeshna Kolay; Daniel Lokshtanov; Fahad Panolan et al. (2015). Quick but odd growth of cacti. (external link)
- Pinar Heggernes; Pim van 't Hof; Benjamin Lévêque et al. (2012). Contracting graphs to paths and trees. (external link)
- Mark Jones; Daniel Lokshtanov; Ramanujan Maadapuzhi Shridharan et al. (2017). Parameterized complexity of directed Steiner tree on sparse graphs. (external link)
- Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan et al. (2015). Deterministic truncation of linear matroids. (external link)
- Ariel Gabizon; Daniel Lokshtanov; Michal Pawel Pilipczuk (2015). Fast algorithms for parameterized problems with relaxed disjointness constraints. (external link)
- Fedor Fomin; Serge Gaspers; Daniel Lokshtanov et al. (2016). Exact algorithms via monotone local search. (external link)
- Michael Fellows; Daniel Lokshtanov; Neeldhara Misra et al. (2008). Graph Layout problems Parameterized by Vertex Cover. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2018). Covering Vectors by Spaces: Regular Matroids. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2016). Efficient computation of representative families with applications in parameterized and exact algorithms. (external link)
- Daniel Lokshtanov (2008). Wheel-free deletion is W[2]-Hard. (external link)
- Frederic Dorn; Fedor Fomin; Daniel Lokshtanov et al. (2013). Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. (external link)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh (2011). An exact algorithm for minimum distortion embedding. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2018). Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. (external link)
- Akanksha Agrawal; Kristine Vitting Klinkby Knudsen; Daniel Lokshtanov et al. (2023). The Parameterized Complexity of Guarding Almost Convex Polygons. (external link)
- Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan et al. (2018). Quasipolynomial representation of transversal matroids with applications in parameterized complexity. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2020). ETH-tight algorithms for long path and cycle on unit disk graphs. (external link)
- Gabor Bacso; Daniel Lokshtanov; Dániel Marx et al. (2018). Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs. (external link)
- Fedor Fomin; Serge Gaspers; Daniel Lokshtanov et al. (2019). Exact algorithms via monotone local search. (external link)
- Olawale Hassan; Iyad Kanj; Daniel Lokshtanov et al. (2016). On the ordered list subgraph embedding problems. (external link)
- Daniel Lokshtanov; Ramanujan Maadapuzhi Shridharan; Saket Saurabh (2015). Linear time parameterized algorithms for subset feedback vertex set. (external link)
- Archontia Giannopoulou; Bart M.P. Jansen; Daniel Lokshtanov et al. (2017). Uniform kernelization complexity of hitting forbidden minors. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov (2012). Cops and robber game without recharging. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2014). Representative sets of product families. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2018). Erdos-Posa property of obstructions to interval graphs. (external link)
- Pinar Heggernes; Daniel Lokshtanov; Rodica Mihai et al. (2011). Cutwidth of Split Graphs and Threshold Graphs. (external link)
- Fedor Fomin; Fabrizio Grandoni; Daniel Lokshtanov et al. (2012). Sharp separation and applications to exact and parameterized algorithms. (external link)
- Fedor Fomin; Jan Kratochvil; Daniel Lokshtanov et al. (2011). On the Complexity of Reconstructing H-Free Graphs from Their Star Systems. (external link)
- Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov et al. (2012). Computing the cutwidth of bipartite permutation graphs in linear time. (external link)
- Daniel Lokshtanov; Matthias Mnich; Saket Saurabh (2011). A linear kernel for a planar connected dominating set. (external link)
- Isolde Marianne Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause et al. (2017). Irrelevant vertices for the planar Disjoint Paths Problem. (external link)
- Akanksha Agrawal; Paloma T. Lima; Daniel Lokshtanov et al. (2025). Odd Cycle Transversal on P5-free Graphs in Polynomial Time. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2019). Going Far From Degeneracy. (external link)
- Fedor Fomin; Daniel Lokshtanov; Neeldhara Misra et al. (2013). Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Saket Saurabh et al. (2019). Split contraction: The untold story. (external link)
- Fedor Fomin; Daniel Lokshtanov; Venkatesh Raman et al. (2011). Subexponential algorithms for partial cover problems. (external link)
- Michael R. Fellows; Fedor Fomin; Daniel Lokshtanov et al. (2011). On the complexity of some colorful problems parameterized by treewidth. (external link)
- Daniel Lokshtanov; MS Ramanujan; Saket Saurabh et al. (2018). Reducing CMSO model checking to highly connected graphs. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2014). Almost optimal lower bounds for problems parameterized by clique-width. (external link)
- Michael Fellows; Daniel Lokshtanov; Neeldhara Misra et al. (2009). The complexity ecology of parameters: An illustration using bounded max leaf number. (external link)
- Mithilesh Kumar; Daniel Lokshtanov (2016). Faster exact and parameterized algorithm for feedback vertex set in tournaments. (external link)
- Petr Golovach; Daniel Lokshtanov; Saket Saurabh et al. (2018). Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. (external link)
- Daniel Lokshtanov; Pranabendu Misra; Michal Pawel Pilipczuk et al. (2025). AN EXPONENTIAL TIME PARAMETERIZED ALGORITHM FOR PLANAR DISJOINT PATHS. (external link)
- Hans L. Bodlaender; Fedor Fomin; Daniel Lokshtanov et al. (2016). (Meta) Kernelization. (external link)
- Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan et al. (2020). A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. (external link)
- Neeraj Kumar; Daniel Lokshtanov; Saket Saurabh et al. (2021). A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. (external link)
- Daniel Lokshtanov; Maadapuzhi-Sridharan Ramanujan; Saket Saurabh et al. (2025). Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2020). Hitting Topological Minors Is FPT. (external link)
- Akanksha Agrawal; Kristine Vitting Klinkby Knudsen; Daniel Lokshtanov et al. (2020). The Parameterized Complexity of Guarding Almost Convex Polygons. (external link)
- Pål Grønås Drange; Markus Sortland Dregi; Fedor Fomin et al. (2016). Kernelization and sparseness: The case of dominating set. (external link)
- Emmanuel Jean Paul Pierre Arrighi; Henning Fernau; Daniel Lokshtanov et al. (2021). Diversity in Kemeny Rank Aggregation: A Parameterized Approach. (external link)
- Daniel Lokshtanov; Daniel Marx; Saket Saurabh (2018). Known algorithms on graphs of bounded treewidth are probably optimal. (external link)
- Daniel Lokshtanov; M.S. Ramanujan; Saket Saurabh et al. (2020). Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. (external link)
- Daniel Lokshtanov; Pranabendu Misra; M.S. Ramanujan et al. (2021). FPT-approximation for FPT Problems. (external link)
- Daniel Lokshtanov; Saket Saurabh; Meirav Zehavi (2021). Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). (external link)
- Akanksha Agrawal; Fedor Fomin; Daniel Lokshtanov et al. (2019). Path Contraction Faster Than 2n. (external link)
- Akanksha Agrawal; Fedor Fomin; Daniel Lokshtanov et al. (2020). Path contraction faster than $2^n$. (external link)
- Daniel Lokshtanov; N.S. Narayanaswamy; Venkatesh Raman et al. (2014). Faster parameterized algorithms using linear programming. (external link)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2020). Bidimensionality and Kernels. (external link)
- Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan et al. (2015). Reconfiguration on sparse graphs. (external link)
- Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan et al. (2018). Reconfiguration on sparse graphs. (external link)
- Mithilesh Kumar; Daniel Lokshtanov (2017). A 2lk kernel for l-component order connectivity. (external link)
- Fedor Fomin; Sudeshna Kolay; Daniel Lokshtanov et al. (2020). Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. (external link)
- Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov et al. (2010). Computing the cutwidth of bipartite permutation graphs in linear time. (external link)
- Petr Golovach; Pinar Heggernes; Dieter Kratsch et al. (2011). Bandwidth on AT-free graphs. (external link)
- Daniel Lokshtanov; Amer E. Mouawad (2018). The complexity of independent set reconfiguration on bipartite graphs. (external link)
- Fedor Fomin; Daniel Lokshtanov; Neeldhara Misra et al. (2016). Hitting forbidden minors: Approximation and kernelization. (external link)
- Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh et al. (2017). Packing cycles faster than Erdös-Pósa. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Saket Saurabh et al. (2017). Split contraction: The untold story. (external link)
- Daniel Lokshtanov; Ramanujan Maadapuzhi Shridharan; Saket Saurabh (2018). Linear time parameterized algorithms for subset feedback vertex set. (external link)
- Akanksha Agrawal; Sudeshna Kolay; Daniel Lokshtanov et al. (2016). A faster FPT algorithm and a smaller kernel for block graph vertex deletion. (external link)
- Fedor Fomin; Tien-Nam Le; Daniel Lokshtanov et al. (2019). Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. (external link)
- Daniel Lokshtanov; Saket Saurabh; Ondrej Suchy (2014). Solving Multicut faster than 2n. (external link)
- Lars Jaffke; Paloma Thome de Lima; Daniel Lokshtanov (2021). b-Coloring Parameterized by Clique-Width. (external link)
- Fedor Fomin; Sudeshna Kolay; Daniel Lokshtanov et al. (2016). Subexponential algorithms for rectilinear Steiner tree and arborescence problems. (external link)
- Fedor Fomin; Jan Kratochvil; Daniel Lokshtanov et al. (2008). On the complexity of reconstructing H-free graphs from their Star Systems. (external link)
- Hans L. Bodlaender; Pål Grønås Drange; Markus Sortland Dregi et al. (2016). A $c^k n$ 5-approximation algorithm for treewidth. (external link)
- Henning Fernau; Fedor Fomin; Daniel Lokshtanov et al. (2009). Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. (external link)
- Noga Alon; Daniel Lokshtanov; Saket Saurabh (2009). Fast FAST. (external link)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh (2009). An Exact Algorithm for Minimum Distortion Embedding. (external link)
- Daniel Lokshtanov; Venkatesh Raman; Saket Saurabh et al. (2009). On the Directed Degree-Preserving Spanning Tree Problem. (external link)
- Saket Saurabh; Daniel Lokshtanov (2009). Even Faster Algorithm for Set Splitting!. (external link)
- Daniel Lokshtanov; Federico Mancini; Charis Papadopoulos (2008). Characterizing and Computing Minimal Cograph Completions. (external link)
- Daniel Lokshtanov; Marcin Pilipczuk; Erik Jan van Leeuwen (2017). Independence and efficient domination on P6-free graphs. (external link)
- Daniel Lokshtanov; Matthias Mnich; Saket Saurabh (2009). Linear Kernel for Planar Connected Dominating Set. (external link)
- Michael Fellows; Fedor Fomin; Daniel Lokshtanov et al. (2009). Distortion Is Fixed Parameter Tractable. (external link)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh (2018). Excluded grid minors and efficient polynomial-time approximation schemes. (external link)
- Daniel Lokshtanov; Saket Saurabh; Somnath Sikdar (2009). Simpler Parameterized Algorithm for OCT. (external link)
- Michael Dom; Daniel Lokshtanov; Saket Saurabh (2009). Incompressibility through Colors and IDs. (external link)
- Fedor Fomin; Daniel Lokshtanov; Venkatesh Raman et al. (2009). Subexponential Algorithms for Partial Cover Problems. (external link)
- Daniel Lokshtanov; Venkatesh Raman; Saket Saurabh et al. (2011). On the directed Full Degree Spanning Tree problem. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2018). Long directed (s,t)-path: FPT algorithm. (external link)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2026). Decomposition of Map Graphs with Applications. (external link)
- Daniel Lokshtanov (2007). On the Complexity of Computing Treelength. (external link)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2020). Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. (external link)
- Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee et al. (2020). 2-Approximating Feedback Vertex Set in Tournaments. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2017). Spanning Circuits in Regular Matroids. (external link)
- Daniel Lokshtanov; Michal Pilipczuk; Saket Saurabh (2018). Below all subsets for minimal connected dominating set. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2018). Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. (external link)
- Christina Boucher; Christine Lo; Daniel Lokshtanov (2015). Consensus patterns (Probably) has no EPTAS. (external link)
- Daniel Lokshtanov; M. S. Ramanujan; Saket Saurabh (2017). A linear-Time parameterized algorithm for node unique label cover. (external link)
- Jakub Gajarský; Petr Hliněný; Jan Obdržálek et al. (2016). A new perspective on FO model checking of dense graph classes. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Diptapriyo Majumdar et al. (2016). Kernelization of cycle packing with relaxed disjointness constraints. (external link)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2016). Lower bounds for approximation schemes for closest string. (external link)
- Fedor Fomin; Daniel Lokshtanov; Ivan Mihajlin et al. (2021). Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2017). Covering vectors by spaces: Regular matroids. (external link)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2022). Erdős–Pósa property of obstructions to interval graphs. (external link)
- William Lochet; Daniel Lokshtanov; Pranabendu Misra et al. (2020). Fault tolerant subgraphs with applications in kernelization. (external link)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2019). Minimum Bisection Is Fixed-Parameter Tractable. (external link)
- Pinar Heggernes; Daniel Lokshtanov; Jesper Nederlof et al. (2010). Generalized graph clustering: recognizing (p,q)-cluster graphs. (external link)
- Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov et al. (2010). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. (external link)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2018). Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. (external link)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2020). Parameterization Above a Multiplicative Guarantee. (external link)
- Daniel Binkele-Raible; Henning Fernau; Fedor Fomin et al. (2012). Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. (external link)
- Archontia Giannopoulou; Daniel Lokshtanov; Saket Saurabh et al. (2016). Tree deletion set has a polynomial kernel (but No OPTο(1) Approximation). (external link)
- Daniel Lokshtanov; M.S. Ramanujan; Saket Saurabh et al. (2018). Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. (external link)
- Pinar Heggernes; Daniel Lokshtanov (2006). Optimal broadcast domination in polynomial time. (external link)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2012). On Cutwidth Parameterized by Vertex Cover. (external link)
- Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee et al. (2021). 2-Approximating Feedback Vertex Set in Tournaments. (external link)
- Archontia Giannopoulou; Daniel Lokshtanov; Saket Saurabh et al. (2014). Tree deletion set has a polynomial kernel (but no OPTO(1) approximation). (external link)
- Petr Golovach; Pinar Heggernes; Dieter Kratsch et al. (2009). Bandwidth on AT-Free Graphs. (external link)
Academic book chapter
- Daniel Lokshtanov; Jesper Nederlof (2010). Saving Space by Algebraization. (external link)
- Michael Fellows; Frances Rosamond; Fedor Fomin et al. (2009). Local Search: Is Brute-Force Avoidable?. (external link)
- Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov et al. (2011). Obtaining a bipartite graph by contracting few edges. (external link)
Doctoral thesis (PhD)
- Mithilesh Kumar; Daniel Lokshtanov (2017). Multivariate Algorithmic Analysis of Hitting Small Sets. (external link)
- Markus Fanebust Dregi; Daniel Lokshtanov (2017). Beyond the question of fixed-parameter tractability. (external link)
- Daniel Lokshtanov (2009). New methods in parameterized algorithms and complexity. (external link)