Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Lokshtanov
Person information
- affiliation (PhD 2009): University of California Santa Barbara, Department of Computer Science, CA, USA
- affiliation: University of Bergen, Department of Informatics, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j111]Akanksha Agrawal
, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. 71(2): 358-398 (2024)- [j110]Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. Theory Comput. Syst. 68(4): 1049-1081 (2024) - [j109]Chaofan Shou, Rohan Bhatia, Arpit Gupta, Rob Harrison, Daniel Lokshtanov, Walter Willinger:
Query Planning for Robust and Scalable Hybrid Network Telemetry Systems. Proc. ACM Netw. 2(CoNEXT1): 1-27 (2024) - [j108]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20(1): 2:1-2:16 (2024) - [j107]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20(3): 20 (2024) - [c202]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG 2024: 72:1-72:11 - [c201]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18 - [c200]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. ITCS 2024: 77:1-77:23 - [c199]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA 2024: 699-711 - [c198]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms‡. SODA 2024: 712-739 - [c197]Tuukka Korhonen, Daniel Lokshtanov:
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. SODA 2024: 5249-5275 - [c196]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. SODA 2024: 5276-5290 - [c195]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC 2024: 683-691 - [e2]Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov:
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. LIPIcs 289, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-311-9 [contents] - [i121]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Polynomial Time. CoRR abs/2402.11465 (2024) - [i120]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR abs/2403.07328 (2024) - [i119]Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR abs/2405.15372 (2024) - [i118]Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl:
Tree Independence Number IV. Even-hole-free Graphs. CoRR abs/2407.08927 (2024) - [i117]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR abs/2407.09356 (2024) - 2023
- [j106]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102(4): 702-727 (2023) - [j105]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19(2): 11:1-11:68 (2023) - [c194]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - [c193]Úrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda:
Counting and Sampling Labeled Chordal Graphs in Polynomial Time. ESA 2023: 58:1-58:17 - [c192]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA 2023: 63:1-63:17 - [c191]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Breaking the All Subsets Barrier for Min k-Cut. ICALP 2023: 90:1-90:19 - [c190]Eric Aaron, Úrsula Hébert-Johnson, Danny Krizanc, Daniel Lokshtanov:
Min-max coverage problems on tree-like metrics. LAGOS 2023: 148-156 - [c189]Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS 2023: 56:1-56:15 - [c188]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. SODA 2023: 2214-2227 - [c187]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [c186]Peter Gartland, Daniel Lokshtanov:
Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. SODA 2023: 3063-3097 - [c185]Peter Gartland, Daniel Lokshtanov:
Graph Classes with Few Minimal Separators. II. A Dichotomy. SODA 2023: 3098-3178 - [c184]Tuukka Korhonen, Daniel Lokshtanov:
An Improved Parameterized Algorithm for Treewidth. STOC 2023: 528-541 - [c183]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - [i116]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR abs/2304.13695 (2023) - [i115]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR abs/2305.15738 (2023) - [i114]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i113]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. CoRR abs/2308.02188 (2023) - [i112]Tuukka Korhonen, Daniel Lokshtanov:
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. CoRR abs/2308.04795 (2023) - [i111]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR abs/2308.05974 (2023) - [i110]Úrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda:
Counting and Sampling Labeled Chordal Graphs in Polynomial Time. CoRR abs/2308.09703 (2023) - [i109]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR abs/2308.10657 (2023) - [i108]Michael Kuhn, Daniel Lokshtanov, Zachary Miller:
Lower Bound for Independence Covering in C4-Free Graphs. CoRR abs/2308.15671 (2023) - [i107]Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov:
On Induced Versions of Menger's Theorem on Sparse Graphs. CoRR abs/2309.08169 (2023) - [i106]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR abs/2312.01589 (2023) - 2022
- [j104]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica 84(2): 482-509 (2022) - [j103]Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov:
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. Algorithmica 84(12): 3587-3602 (2022) - [j102]Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the threshold of intractability. J. Comput. Syst. Sci. 124: 1-25 (2022) - [j101]Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. 51(6): 1866-1930 (2022) - [c182]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG 2022: 11:1-11:16 - [c181]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG 2022: 52:1-52:14 - [c180]Daniel Lokshtanov, Bernardo Subercaseaux:
Wordle Is NP-Hard. FUN 2022: 19:1-19:8 - [c179]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan:
Backdoor Sets on Nowhere Dense SAT. ICALP 2022: 91:1-91:20 - [c178]Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - [c177]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA 2022: 1976-2004 - [c176]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA 2022: 2005-2031 - [c175]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA 2022: 2063-2084 - [c174]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC 2022: 914-923 - [i105]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR abs/2203.08193 (2022) - [i104]Daniel Lokshtanov, Bernardo Subercaseaux:
Wordle is NP-hard. CoRR abs/2203.16713 (2022) - [i103]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR abs/2210.14629 (2022) - [i102]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR abs/2210.14638 (2022) - [i101]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. CoRR abs/2211.02717 (2022) - [i100]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. CoRR abs/2211.04797 (2022) - [i99]Tuukka Korhonen, Daniel Lokshtanov:
An Improved Parameterized Algorithm for Treewidth. CoRR abs/2211.07154 (2022) - 2021
- [j100]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83(5): 1421-1458 (2021) - [j99]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and enhanced inclusion-minimal cograph completion. Discret. Appl. Math. 288: 138-151 (2021) - [j98]Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad:
Bisection of bounded treewidth graphs by convolutions. J. Comput. Syst. Sci. 119: 125-132 (2021) - [j97]Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. 12(2): 126-148 (2021) - [j96]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström:
Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms 17(1): 6:1-6:30 (2021) - [j95]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17(2): 11:1-11:14 (2021) - [j94]Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. ACM Trans. Algorithms 17(3): 26:1-26:44 (2021) - [j93]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory 13(2): 10:1-10:25 (2021) - [j92]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13(3): 18:1-18:16 (2021) - [j91]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13(4): 27:1-27:40 (2021) - [c173]Daniel Lokshtanov, Subhash Suri, Jie Xue:
Efficient Algorithms for Least Square Piecewise Polynomial Regression. ESA 2021: 63:1-63:15 - [c172]Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS 2021: 28:1-28:9 - [c171]Daniel Lokshtanov, Vaishali Surianarayanan:
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable. FSTTCS 2021: 29:1-29:17 - [c170]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI 2021: 10-16 - [c169]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA 2021: 179-198 - [c168]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
FPT-approximation for FPT Problems. SODA 2021: 199-218 - [c167]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA 2021: 822-839 - [c166]Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. STACS 2021: 43:1-43:15 - [c165]William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Exploiting Dense Structures in Parameterized Complexity. STACS 2021: 50:1-50:17 - [c164]Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. STOC 2021: 330-341 - [i98]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR abs/2103.17041 (2021) - [i97]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR abs/2104.09950 (2021) - [i96]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. CoRR abs/2105.09413 (2021) - [i95]Rohan Bhatia, Arpit Gupta, Rob Harrison, Daniel Lokshtanov, Walter Willinger:
DynamiQ: Planning for Dynamics in Network Streaming Analytics Systems. CoRR abs/2106.05420 (2021) - [i94]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR abs/2111.14196 (2021) - 2020
- [j90]Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82(1): 41-63 (2020) - [j89]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. SIAM J. Comput. 49(6): 1397-1422 (2020) - [j88]Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
Path Contraction Faster than 2n. SIAM J. Discret. Math. 34(2): 1302-1325 (2020) - [j87]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far from Degeneracy. SIAM J. Discret. Math. 34(3): 1587-1601 (2020) - [j86]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16(1): 12:1-12:39 (2020) - [j85]Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16(2): 21:1-21:37 (2020) - [j84]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16(3): 32:1-32:31 (2020) - [j83]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms 16(4): 51:1-51:38 (2020) - [j82]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. 21(4): 28:1-28:23 (2020) - [c163]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM 2020: 51:1-51:19 - [c162]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Treewidth, Kernels, and Algorithms 2020: 112-128 - [c161]Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue:
Fair Covering of Points by Balls. CCCG 2020: 26-32 - [c160]Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. SoCG 2020: 3:1-3:16 - [c159]Eduard Eiben, Daniel Lokshtanov:
Removing Connected Obstacles in the Plane Is FPT. SoCG 2020: 39:1-39:14 - [c158]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG 2020: 44:1-44:18 - [c157]Peter Gartland, Daniel Lokshtanov:
Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time. FOCS 2020: 613-624 - [c156]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
A Parameterized Approximation Scheme for Min $k$-Cut. FOCS 2020: 798-809 - [c155]Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS 2020: 18:1-18:15 - [c154]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP 2020: 49:1-49:18 - [c153]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP 2020: 80:1-80:16 - [c152]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterization Above a Multiplicative Guarantee. ITCS 2020: 39:1-39:13 - [c151]William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS 2020: 47:1-47:22 - [c150]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC 2020: 24:1-24:15 - [c149]Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov:
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. LATIN 2020: 600-612 - [c148]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. SODA 2020: 1010-1018 - [c147]