Daniel Lokshtanov
University of California, Santa Barbara
H-index: 52
North America-United States
Top articles of Daniel Lokshtanov
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs | Daniel Lokshtanov Fahad Panolan Saket Saurabh Jie Xue Meirav Zehavi | 2024/2/5 | |
Query Planning for Robust and Scalable Hybrid Network Telemetry Systems | Proceedings of the ACM on Networking | Chaofan Shou Rohan Bhatia Arpit Gupta Rob Harrison Daniel Lokshtanov | 2024/3/28 |
Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time | Akanksha Agrawal Paloma T Lima Daniel Lokshtanov Saket Saurabh Roohani Sharma | 2024 | |
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints | arXiv preprint arXiv:2403.07328 | Tanmay Inamdar Pallavi Jain Daniel Lokshtanov Abhishek Sahu Saket Saurabh | 2024/3/12 |
The parameterized complexity of guarding almost convex polygons | Discrete & Computational Geometry | Akanksha Agrawal Kristine VK Knudsen Daniel Lokshtanov Saket Saurabh Meirav Zehavi | 2024/3 |
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable | Sayan Bandyapadhyay William Lochet Daniel Lokshtanov Saket Saurabh Jie Xue | 2024 | |
Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth | arXiv preprint arXiv:2402.14211 | Maria Chudnovsky Peter Gartland Sepehr Hajebi Daniel Lokshtanov Sophie Spirkl | 2024/2/22 |
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition | Tuukka Korhonen Daniel Lokshtanov | 2024 | |
Odd Cycle Transversal on -free Graphs in Polynomial Time | arXiv preprint arXiv:2402.11465 | Akanksha Agrawal Paloma T Lima Daniel Lokshtanov Pawel Rzążewski Saket Saurabh | 2024/2/18 |
Meta-theorems for Parameterized Streaming Algorithms | Daniel Lokshtanov Pranabendu Misra Fahad Panolan MS Ramanujan Saket Saurabh | 2024 | |
Tree independence number II. Three-path-configurations | MARIA CHUDNOVSKY SEPEHR HAJEBI DANIEL LOKSHTANOV SOPHIE SPIRKL | 2024/4/30 | |
Counting and Sampling Labeled Chordal Graphs in Polynomial Time | arXiv preprint arXiv:2308.09703 | Úrsula Hébert-Johnson Daniel Lokshtanov Eric Vigoda | 2023/8/18 |
Maximum Weight Independent set in graphs with no long claws in quasi-polynomial time | arXiv preprint arXiv:2305.15738 | Peter Gartland Daniel Lokshtanov Tomáš Masařík Marcin Pilipczuk Michał Pilipczuk | 2023/5/25 |
Shortest cycles with monotone submodular costs | ACM Transactions on Algorithms | Fedor V Fomin Petr A Golovach Tuukka Korhonen Daniel Lokshtanov Giannos Stamoulis | 2023/11/13 |
The chromatic number of squares of random graphs | The journal of combinatorics | Kalyan Garapaty Daniel Lokshtanov Hemanta K Maji Alex Pothen | 2023/1 |
Parameterized Approximation Scheme for Feedback Vertex Set | Satyabrata Jana Daniel Lokshtanov Soumen Mandal Ashutosh Rai Saket Saurabh | 2023 | |
Lossy kernelization for (implicit) hitting set problems | arXiv preprint arXiv:2308.05974 | Fedor V Fomin Tien-Nam Le Daniel Lokshtanov Saket Saurabh Stéphan Thomassé | 2023/8/11 |
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs | arXiv preprint arXiv:2304.13695 | Daniel Lokshtanov Fahad Panolan Saket Saurabh Jie Xue Meirav Zehavi | 2023/4/26 |
b-Coloring Parameterized by Clique-Width | Theory of Computing Systems | Lars Jaffke Paloma T Lima Daniel Lokshtanov | 2023/9/23 |
Breaking the all subsets barrier for min k-cut | Daniel Lokshtanov Saket Saurabh Vaishali Surianarayanan | 2023 |
Co-Authors
