Daniel Lokshtanov - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 297

2023

Erdős-Pósa property of obstructions to interval graphsAkanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. jgt, 102(4):702-727, April 2023. [doi]

Shortest Cycles With Monotone Submodular CostsFedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis. soda 2023: 2214-2227 [doi]

Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced SubgraphsPeter Gartland, Daniel Lokshtanov. soda 2023: 3063-3097 [doi]

Graph Classes with Few Minimal Separators. II. A DichotomyPeter Gartland, Daniel Lokshtanov. soda 2023: 3098-3178 [doi]

An Improved Parameterized Algorithm for TreewidthTuukka Korhonen, Daniel Lokshtanov. stoc 2023: 528-541 [doi]

A Framework for Approximation Schemes on Disk GraphsDaniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue 0003, Meirav Zehavi. soda 2023: 2228-2241 [doi]

2022

A Constant Factor Approximation for Navigating Through Connected Obstacles in the PlaneNeeraj Kumar 0004, Daniel Lokshtanov, Saket Saurabh 0001, Subhash Suri. soda 2022: 822-839 [doi]

Point Separation and Obstacle Removal by Finding and Hitting Odd CyclesNeeraj Kumar 0004, Daniel Lokshtanov, Saket Saurabh 0001, Subhash Suri, Jie Xue 0003. compgeom 2022: [doi]

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-EquivalentAkanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. soda 2022: 1976-2004 [doi]

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free GraphsSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue. soda 2022: 2063-2084 [doi]

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk GraphsSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003. compgeom 2022: [doi]

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching NumberJean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov. algorithmica, 84(12):3587-3602, 2022. [doi]

On the threshold of intractabilityPål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan. jcss, 124:1-25, 2022. [doi]

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern CoveringFedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001. SICOMP, 51(6):1866-1930, 2022. [doi]

Gehrlein Stable Committee with Multi-modal PreferencesSushmita Gupta, Pallavi Jain 0001, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh 0001. sagt 2022: 508-525 [doi]

Backdoor Sets on Nowhere Dense SATDaniel Lokshtanov, Fahad Panolan, M. S. Ramanujan 0001. icalp 2022: [doi]

Wordle Is NP-HardDaniel Lokshtanov, Bernardo Subercaseaux. fun 2022: [doi]

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minorDaniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001. stoc 2022: 914-923 [doi]

On the Parameterized Complexity of Reconfiguration of Connected Dominating SetsDaniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz. algorithmica, 84(2):482-509, 2022. [doi]

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. soda 2022: 179-198 [doi]

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue, Meirav Zehavi. soda 2022: 2005-2031 [doi]

FPT-approximation for FPT ProblemsDaniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. soda 2022: 199-218 [doi]

2021

A Constant Factor Approximation for Navigating Through Connected Obstacles in the PlaneNeeraj Kumar 0004, Daniel Lokshtanov, Saket Saurabh 0001, Subhash Suri. soda 2021: 822-839 [doi]

Diversity in Kemeny Rank Aggregation: A Parameterized ApproachEmmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf 0001. IJCAI 2021: 10-16 [doi]

Faster and enhanced inclusion-minimal cograph completionChristophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry. DAM, 288:138-151, 2021. [doi]

Randomized Contractions Meet Lean DecompositionsMarek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001, Magnus Wahlström. TALG, 17(1), 2021. [doi]

Computing the Largest Bond and the Maximum Connected Cut of a GraphGabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza. algorithmica, 83(5):1421-1458, 2021. [doi]

Bisection of bounded treewidth graphs by convolutionsEduard Eiben, Daniel Lokshtanov, Amer E. Mouawad. jcss, 119:125-132, 2021. [doi]

Multiplicative Parameterization Above a GuaranteeFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. toct, 13(3), 2021. [doi]

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower BoundsFedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh 0001, Meirav Zehavi. toct, 13(2), 2021. [doi]

>t -free graphs in quasipolynomial timePeter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski. stoc 2021: 330-341 [doi]

On the Parameterized Approximability of Contraction to Classes of Chordal GraphsSpoorthy Gunda, Pallavi Jain 0001, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. toct, 13(4), 2021. [doi]

b-Coloring Parameterized by Clique-WidthLars Jaffke, Paloma T. Lima, Daniel Lokshtanov. STACS 2021: [doi]

Exploiting Dense Structures in Parameterized ComplexityWilliam Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. STACS 2021: [doi]

2-Approximating Feedback Vertex Set in TournamentsDaniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. TALG, 17(2), 2021. [doi]

Dominating Set in Weakly Closed Graphs is Fixed Parameter TractableDaniel Lokshtanov, Vaishali Surianarayanan. fsttcs 2021: [doi]

Efficient Algorithms for Least Square Piecewise Polynomial RegressionDaniel Lokshtanov, Subhash Suri, Jie Xue. esa 2021: [doi]

An ETH-Tight Algorithm for Multi-Team FormationDaniel Lokshtanov, Saket Saurabh 0001, Subhash Suri, Jie Xue. fsttcs 2021: [doi]

k-Paths: Simpler, Deterministic, and in Polynomial SpaceDaniel Lokshtanov, Andreas Björklund, Saket Saurabh 0001, Meirav Zehavi. TALG, 17(3), 2021. [doi]

FPT-approximation for FPT ProblemsDaniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. soda 2021: 199-218 [doi]

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. soda 2021: 179-198 [doi]

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk GraphsMeirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001. jocg, 12(2):126-148, 2021. [doi]

2020

nAkanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. siamdm, 34(2):1302-1325, 2020. [doi]

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion ProblemsAkanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. TALG, 16(4), 2020. [doi]

The Parameterized Complexity of Guarding Almost Convex PolygonsAkanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. compgeom 2020: [doi]

A Polynomial Sized Kernel for Tracking Paths ProblemAritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001. algorithmica, 82(1):41-63, 2020. [doi]

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching NumberJean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov. latin 2020: 600-612 [doi]

Parameterized Complexity of Feedback Vertex Sets on HypergraphsPratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001. fsttcs 2020: [doi]

Removing Connected Obstacles in the Plane Is FPTEduard Eiben, Daniel Lokshtanov. compgeom 2020: [doi]

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence ProblemsFedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh 0001. TALG, 16(2), 2020. [doi]

Approximation Schemes for Low-rank Binary Matrix Approximation ProblemsFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001. TALG, 16(1), 2020. [doi]

Bidimensionality and KernelsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos. SICOMP, 49(6):1397-1422, 2020. [doi]

Going Far from DegeneracyFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. siamdm, 34(3):1587-1601, 2020. [doi]

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk GraphsFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. compgeom 2020: [doi]

Approximation Schemes via Width/Weight Trade-offs on Minor-free GraphsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. soda 2020: 2299-2318 [doi]

Parameterization Above a Multiplicative GuaranteeFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. innovations 2020: [doi]

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower BoundsFedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh 0001, Meirav Zehavi. icalp 2020: [doi]

Hitting topological minors is FPTFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. stoc 2020: 1317-1326 [doi]

Parameterized AlgorithmsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. In Tim Roughgarden, editor, Beyond the Worst-Case Analysis of Algorithms. pages 27-51, Cambridge University Press, 2020. [doi]

A New Perspective on FO Model Checking of Dense Graph ClassesJakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan 0001. tocl, 21(4), 2020. [doi]

Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial TimePeter Gartland, Daniel Lokshtanov. focs 2020: 613-624 [doi]

On the Parameterized Approximability of Contraction to Classes of Chordal GraphsSpoorthy Gunda, Pallavi Jain 0001, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. approx 2020: [doi]

Fault Tolerant Subgraphs with Applications in KernelizationWilliam Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. innovations 2020: [doi]

2-Approximating Feedback Vertex Set in TournamentsDaniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. soda 2020: 1010-1018 [doi]

A (2 + ε)-Factor Approximation Algorithm for Split Vertex DeletionDaniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. icalp 2020: [doi]

Fair Covering of Points by BallsDaniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue 0003. cccg 2020: 26-32

A Parameterized Approximation Scheme for Min $k$-CutDaniel Lokshtanov, Saket Saurabh 0001, Vaishali Surianarayanan. focs 2020: 798-809 [doi]

Covering Small Independent Sets and Separators with Applications to Parameterized AlgorithmsDaniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. TALG, 16(3), 2020. [doi]

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint PathsDaniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. BIRTHDAY 2020: 112-128 [doi]

Parameterized Complexity and Approximability of Directed Odd Cycle TransversalDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi. soda 2020: 2181-2200 [doi]

An exponential time parameterized algorithm for planar disjoint pathsDaniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh 0001, Meirav Zehavi. stoc 2020: 1307-1316 [doi]

On the Parameterized Complexity of Reconfiguration of Connected Dominating SetsDaniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz. iwpec 2020: [doi]

2019

Feedback Vertex Set Inspired Kernel for Chordal Vertex DeletionAkanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. TALG, 15(1), 2019. [doi]

Split Contraction: The Untold StoryAkanksha Agrawal, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. toct, 11(3), 2019. [doi]

nAkanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. icalp 2019: [doi]

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free GraphsGábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen. algorithmica, 81(2):421-438, 2019. [doi]

Approximate Counting of k-Paths: Deterministic and in Polynomial SpaceAndreas Björklund, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. icalp 2019: [doi]

Minimum Bisection Is Fixed-Parameter TractableMarek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001. SICOMP, 48(2):417-450, 2019. [doi]

Computing the Largest Bond of a GraphGabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza. iwpec 2019: [doi]

Bisection of Bounded Treewidth Graphs by ConvolutionsEduard Eiben, Daniel Lokshtanov, Amer E. Mouawad. esa 2019: [doi]

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing ProblemsFedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi. TALG, 15(1), 2019. [doi]

Spanning Circuits in Regular MatroidsFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001. TALG, 15(4), 2019. [doi]

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk GraphsFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. dcg, 62(4):879-911, 2019. [doi]

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner TreeFedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001. siamdm, 33(1):327-345, 2019. [doi]

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph ColoringFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. TALG, 15(1), 2019. [doi]

Exact Algorithms via Monotone Local SearchFedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh 0001. JACM, 66(2), 2019. [doi]

Going Far From DegeneracyFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. esa 2019: [doi]

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their DualsFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. icalp 2019: [doi]

Decomposition of Map Graphs with ApplicationsFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. icalp 2019: [doi]

Picking Random Vertices (Invited Talk)Daniel Lokshtanov. mfcs 2019: [doi]

The Complexity of Independent Set Reconfiguration on Bipartite GraphsDaniel Lokshtanov, Amer E. Mouawad. TALG, 15(1), 2019. [doi]

Packing Cycles Faster Than Erdos-PosaDaniel Lokshtanov, Amer E. Mouawad, Saket Saurabh 0001, Meirav Zehavi. siamdm, 33(3):1194-1215, 2019. [doi]

Balanced Judicious Bipartition is Fixed-Parameter TractableDaniel Lokshtanov, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. siamdm, 33(4):1878-1911, 2019. [doi]

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVSDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. wads 2019: 523-537 [doi]

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Daniel Lokshtanov'

Viewing Publication 1 - 100 from 297

2023

2022

2021

2020

2019

2018

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Daniel Lokshtanov'

Viewing Publication 1 - 100 from 297

2023

2022

2021

2020

2019

2018

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1