![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Daniel 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
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j110]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) - [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] - [i120]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) - [i119]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) - [i118]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) - [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]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA 2020: 2181-2200 - [c146]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA 2020: 2299-2318 - [c145]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An exponential time parameterized algorithm for planar disjoint paths. STOC 2020: 1307-1316 - [c144]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Hitting topological minors is FPT. STOC 2020: 1317-1326 - [p1]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms 2020: 27-51 - [i93]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and Enhanced Inclusion-Minimal Cograph Completion. CoRR abs/2001.07765 (2020) - [i92]Eduard Eiben, Daniel Lokshtanov:
Removing Connected Obstacles in the Plane is FPT. CoRR abs/2002.01218 (2020) - [i91]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR abs/2003.00938 (2020) - [i90]Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. CoRR abs/2003.04254 (2020) - [i89]Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. CoRR abs/2003.07793 (2020) - [i88]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR abs/2004.11621 (2020) - [i87]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
A Parameterized Approximation Scheme for Min k-Cut. CoRR abs/2005.00134 (2020) - [i86]Peter Gartland, Daniel Lokshtanov:
Independent Set on Pk-Free Graphs in Quasi-Polynomial Time. CoRR abs/2005.00690 (2020) - [i85]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR abs/2006.10364 (2020) - [i84]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. CoRR abs/2007.04513 (2020) - [i83]Peter Gartland, Daniel Lokshtanov:
Dominated Minimal Separators are Tame (Nearly All Others are Feral). CoRR abs/2007.08761 (2020) - [i82]Peter Gartland, Daniel Lokshtanov:
Independent Set on C≥-Free Graphs in Quasi-Polynomial Time. CoRR abs/2007.11402 (2020) - [i81]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. CoRR abs/2008.08373 (2020) - [i80]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. CoRR abs/2011.14463 (2020)
2010 – 2019
- 2019
- [j81]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81(2): 421-438 (2019) - [j80]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. 62(4): 879-911 (2019) - [j79]Fedor V. Fomin
, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. J. ACM 66(2): 8:1-8:23 (2019) - [j78]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Minimum Bisection Is Fixed-Parameter Tractable. SIAM J. Comput. 48(2): 417-450 (2019) - [j77]Fedor V. Fomin
, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. 33(1): 327-345 (2019) - [j76]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdos-Posa. SIAM J. Discret. Math. 33(3): 1194-1215 (2019) - [j75]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 1878-1911 (2019) - [j74]Daniel Lokshtanov, Amer E. Mouawad:
The Complexity of Independent Set Reconfiguration on Bipartite Graphs. ACM Trans. Algorithms 15(1): 7:1-7:19 (2019) - [j73]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms 15(1): 9:1-9:27 (2019) - [j72]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms 15(1): 11:1-11:28 (2019) - [j71]Fedor V. Fomin
, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms 15(1): 13:1-13:44 (2019) - [j70]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. ACM Trans. Algorithms 15(4): 52:1-52:38 (2019) - [j69]Akanksha Agrawal
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Split Contraction: The Untold Story. ACM Trans. Comput. Theory 11(3): 18:1-18:22 (2019) - [c143]Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad:
Bisection of Bounded Treewidth Graphs by Convolutions. ESA 2019: 42:1-42:11 - [c142]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. ESA 2019: 47:1-47:14 - [c141]Akanksha Agrawal
, Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
:
Path Contraction Faster Than 2n. ICALP 2019: 11:1-11:13 - [c140]Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Deterministic and in Polynomial Space. ICALP 2019: 24:1-24:15 - [c139]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP 2019: 59:1-59:13 - [c138]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. ICALP 2019: 60:1-60:15 - [c137]Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa
, Rafael C. S. Schouery
, Uéverton S. Souza
:
Computing the Largest Bond of a Graph. IPEC 2019: 12:1-12:15 - [c136]Daniel Lokshtanov:
Picking Random Vertices (Invited Talk). MFCS 2019: 3:1-3:1 - [c135]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS 2019: 523-537 - [i79]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. CoRR abs/1902.02526 (2019) - [i78]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR abs/1902.06957 (2019) - [i77]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Slightly Superexponential Parameterized Problems. CoRR abs/1902.08723 (2019) - [i76]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. CoRR abs/1903.01291 (2019) - [i75]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR abs/1904.02944 (2019) - [i74]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
A Brief Note on Single Source Fault Tolerant Reachability. CoRR abs/1904.08150 (2019) - [i73]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR abs/1910.00581 (2019) - [i72]Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the largest bond of a graph. CoRR abs/1910.01071 (2019) - 2018
- [j68]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Long directed (s, t)-path: FPT algorithm. Inf. Process. Lett. 140: 8-12 (2018) - [j67]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh:
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. J. ACM 65(2): 10:1-10:44 (2018) - [j66]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
, M. S. Ramanujan
, Saket Saurabh:
Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95: 122-131 (2018) - [j65]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Slightly Superexponential Parameterized Problems. SIAM J. Comput. 47(3): 675-702 (2018) - [j64]Fedor V. Fomin
, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. 32(2): 966-985 (2018) - [j63]Akanksha Agrawal
, Daniel Lokshtanov, Diptapriyo Majumdar
, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. 32(3): 1619-1643 (2018) - [j62]Daniel Lokshtanov, Michal Pilipczuk
, Saket Saurabh:
Below All Subsets for Minimal Connected Dominating Set. SIAM J. Discret. Math. 32(3): 2332-2345 (2018) - [j61]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. SIAM J. Discret. Math. 32(4): 2512-2565 (2018) - [j60]Daniel Lokshtanov, Marcin Pilipczuk
, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graphs. ACM Trans. Algorithms 14(1): 3:1-3:30 (2018) - [j59]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms 14(1): 6:1-6:31 (2018) - [j58]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ACM Trans. Algorithms 14(1): 7:1-7:37 (2018) - [j57]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Trans. Algorithms 14(2): 13:1-13:30 (2018) - [j56]Daniel Lokshtanov, Pranabendu Misra
, Fahad Panolan
, Saket Saurabh:
Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms 14(2): 14:1-14:20 (2018) - [j55]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk
, Marcin Wrochna
:
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms 14(3): 34:1-34:45 (2018) - [j54]Akanksha Agrawal
, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. ACM Trans. Comput. Theory 10(4): 18:1-18:25 (2018) - [c134]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra
, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM 2018: 1:1-1:15 - [c133]Timothy Carpenter, Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG 2018: 21:1-21:14 - [c132]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP 2018: 110:1-110:4 - [c131]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. ICALP 2018: 135:1-135:14 - [c130]Daniel Lokshtanov, Pranabendu Misra
, Fahad Panolan
, Saket Saurabh, Meirav Zehavi
:
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS 2018: 32:1-32:13 - [c129]David Eppstein, Daniel Lokshtanov:
The Parameterized Complexity of Finding Point Sets with Hereditary Properties. IPEC 2018: 11:1-11:14 - [c128]Daniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh:
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. IPEC 2018: 25:1-25:13 - [c127]Aritra Banik
, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
A Polynomial Sized Kernel for Tracking Paths Problem. LATIN 2018: 94-107 - [c126]Akanksha Agrawal
, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh:
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS 2018: 53:1-53:15 - [c125]Daniel Lokshtanov, Amer E. Mouawad:
The complexity of independent set reconfiguration on bipartite graphs. SODA 2018: 185-195 - [c124]Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák:
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. SODA 2018: 247-261 - [c123]Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
:
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA 2018: 262-273 - [c122]Tien-Nam Le
, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA 2018: 331-342 - [c121]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. SODA 2018: 1916-1933 - [c120]Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Roohani Sharma, Meirav Zehavi
:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA 2018: 2785-2800 - [c119]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra
, Saket Saurabh, Meirav Zehavi
:
Erdös-Pósa Property of Obstructions to Interval Graphs. STACS 2018: 7:1-7:15 - [e1]Daniel Lokshtanov, Naomi Nishimura:
12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria. LIPIcs 89, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-051-4 [contents] - [i71]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. CoRR abs/1802.01453 (2018) - [i70]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. CoRR abs/1804.04077 (2018) - [i69]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. CoRR abs/1805.01823 (2018) - [i68]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR abs/1807.07156 (2018) - [i67]David Eppstein, Daniel Lokshtanov:
The Parameterized Complexity of Finding Point Sets with Hereditary Properties. CoRR abs/1808.02162 (2018) - [i66]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh:
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR abs/1809.08437 (2018) - [i65]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh:
Randomized contractions meet lean decompositions. CoRR abs/1810.06864 (2018) - 2017
- [j53]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Quick but Odd Growth of Cacti. Algorithmica 79(1): 271-290 (2017) - [j52]Rajesh Chitnis
, Fedor V. Fomin
, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88: 195-207 (2017) - [j51]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
:
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B 122: 815-843 (2017) - [j50]Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. SIAM J. Comput. 46(1): 161-189 (2017) - [j49]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. 31(2): 1294-1327 (2017) - [j48]Daniel Lokshtanov, Pranabendu Misra
, M. S. Ramanujan, Saket Saurabh:
Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. 31(3): 1581-1615 (2017) - [j47]Archontia C. Giannopoulou, Bart M. P. Jansen
, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms 13(3): 35:1-35:35 (2017) - [j46]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Representative Families of Product Families. ACM Trans. Algorithms 13(3): 36:1-36:29 (2017) - [c118]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and Enhanced Inclusion-Minimal Cograph Completion. COCOA (1) 2017: 210-224 - [c117]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear-Time Parameterized Algorithm for Node Unique Label Cover. ESA 2017: 57:1-57:15 - [c116]Akanksha Agrawal
, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan:
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS 2017: 9:1-9:14 - [c115]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS 2017: 40:40-40:15 - [c114]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. ICALP 2017: 56:1-56:15 - [c113]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi
:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP 2017: 65:1-65:15 - [c112]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
:
Packing Cycles Faster Than Erdos-Posa. ICALP 2017: 71:1-71:15 - [c111]Akanksha Agrawal
, Daniel Lokshtanov, Pranabendu Misra
, Saket Saurabh, Meirav Zehavi
:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA 2017: 1383-1398 - [c110]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA 2017: 1419-1432 - [c109]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. SODA 2017: 1433-1441 - [c108]Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams
, Huacheng Yu:
Beating Brute Force for Systems of Polynomial Equations over Finite Fields. SODA 2017: 2190-2202 - [c107]Akanksha Agrawal
, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
:
Split Contraction: The Untold Story. STACS 2017: 5:1-5:14 - [c106]Fedor V. Fomin
, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS 2017: 32:1-32:14 - [c105]Daniel Lokshtanov, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
Lossy kernelization. STOC 2017: 224-237 - [c104]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad:
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. WG 2017: 32-44 - [i64]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
The Half-integral Erdös-Pósa Property for Non-null Cycles. CoRR abs/1703.02866 (2017) - [i63]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR abs/1704.04249 (2017) - [i62]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR abs/1704.07279 (2017) - [i61]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR abs/1705.01414 (2017) - [i60]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdős-Pósa. CoRR abs/1707.01037 (2017) - [i59]Daniel Lokshtanov, Amer E. Mouawad:
The complexity of independent set reconfiguration on bipartite graphs. CoRR abs/1707.02638 (2017) - [i58]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR abs/1707.04908 (2017) - [i57]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR abs/1707.04917 (2017) - [i56]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering vectors by spaces: Regular matroids. CoRR abs/1710.02300 (2017) - [i55]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR abs/1710.05491 (2017) - [i54]Daniel Lokshtanov, Dániel Marx:
Clustering with Local Restrictions. CoRR abs/1711.03885 (2017) - [i53]Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR abs/1712.06747 (2017) - 2016
- [j45]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. Algorithmica 74(3): 992-1018 (2016) - [j44]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM 63(4): 29:1-29:60 (2016) - [j43]Hans L. Bodlaender
, Fedor V. Fomin
, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016) - [j42]Hans L. Bodlaender
, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin
, Daniel Lokshtanov, Michal Pilipczuk
:
A ck n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45(2): 317-378 (2016) - [j41]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30(1): 383-410 (2016) - [j40]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
:
Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. SIAM J. Discret. Math. 30(3): 1371-1384 (2016) - [j39]Marek Cygan
, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto
, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
:
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12(3): 41:1-41:24 (2016) - [c103]Fedor V. Fomin
, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG 2016: 39:1-39:15 - [c102]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. FOCS 2016: 515-524 - [c101]Mithilesh Kumar, Daniel Lokshtanov:
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. FSTTCS 2016: 24:1-24:15 - [c100]Akanksha Agrawal
, Daniel Lokshtanov, Diptapriyo Majumdar
, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP 2016: 26:1-26:14 - [c99]Mithilesh Kumar, Daniel Lokshtanov:
A 2lk Kernel for l-Component Order Connectivity. IPEC 2016: 20:1-20:14 - [c98]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN 2016: 1-13 - [c97]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. LICS 2016: 176-184 - [c96]Daniel Lokshtanov, Marcin Pilipczuk
, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graphs. SODA 2016: 1784-1803 - [c95]Akanksha Agrawal
, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. STACS 2016: 7:1-7:15 - [c94]Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin
, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl
, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz
, Somnath Sikdar:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [c93]Mithilesh Kumar, Daniel Lokshtanov:
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. STACS 2016: 49:1-49:13 - [c92]Fedor V. Fomin
, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact algorithms via monotone local search. STOC 2016: 764-775 - [c91]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Lower Bounds for Approximation Schemes for Closest String. SWAT 2016: 12:1-12:10 - [r1]Daniel Lokshtanov:
Kernelization, Bidimensionality and Kernels. Encyclopedia of Algorithms 2016: 1006-1011 - [i52]Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Lossy Kernelization. CoRR abs/1604.04111 (2016) - [i51]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. CoRR abs/1604.05999 (2016) - [i50]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear Time Parameterized Algorithm for Node Unique Label Cover. CoRR abs/1604.08764 (2016) - [i49]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. CoRR abs/1606.05689 (2016) - [i48]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. CoRR abs/1607.05516 (2016) - [i47]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. CoRR abs/1609.04347 (2016) - [i46]Mithilesh Kumar, Daniel Lokshtanov:
A 2ℓk Kernel for ℓ-Component Order Connectivity. CoRR abs/1610.04711 (2016) - [i45]Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh:
Below all subsets for Minimal Connected Dominating Set. CoRR abs/1611.00840 (2016) - 2015
- [b1]Marek Cygan, Fedor V. Fomin, Lukasz Kowalik
, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Parameterized Algorithms. Springer 2015, ISBN 978-3-319-21274-6, pp. 3-555 - [c90]Christina Boucher, Christine Lo, Daniel Lokshtanov:
Consensus Patterns (Probably) Has no EPTAS. ESA 2015: 239-250 - [c89]Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
:
On the Threshold of Intractability. ESA 2015: 411-423 - [c88]Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
:
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. ESA 2015: 545-556 - [c87]Jakub Gajarský, Petr Hlinený
, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak
, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. FOCS 2015: 963-974 - [c86]Fedor V. Fomin
, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) 2015: 494-505 - [c85]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) 2015: 629-641 - [c84]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan
, Saket Saurabh:
Deterministic Truncation of Linear Matroids. ICALP (1) 2015: 922-934 - [c83]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ICALP (1) 2015: 935-946 - [c82]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Quick but Odd Growth of Cacti. IPEC 2015: 258-269 - [c81]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh:
Solving d-SAT via Backdoors to Small Treewidth. SODA 2015: 630-641 - [c80]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on Sparse Graphs. WADS 2015: 506-517 - [i44]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR abs/1502.03965 (2015) - [i43]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Reconfiguration on sparse graphs. CoRR abs/1502.04803 (2015) - [i42]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. CoRR abs/1504.04115 (2015) - [i41]Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the Threshold of Intractability. CoRR abs/1505.00612 (2015) - [i40]Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graph. CoRR abs/1507.02163 (2015) - [i39]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Lower bounds for approximation schemes for Closest String. CoRR abs/1509.05809 (2015) - [i38]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. CoRR abs/1510.01557 (2015) - [i37]Mithilesh Kumar, Daniel Lokshtanov:
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. CoRR abs/1510.07676 (2015) - [i36]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR abs/1510.08154 (2015) - [i35]Daniel Lokshtanov:
Parameterized Integer Quadratic Programming: Variables and Coefficients. CoRR abs/1511.00310 (2015) - [i34]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR abs/1511.01379 (2015) - [i33]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. CoRR abs/1512.01621 (2015) - 2014
- [j38]Pinar Heggernes
, Pim van 't Hof
, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
:
Contracting Graphs to Paths and Trees. Algorithmica 68(1): 109-132 (2014) - [j37]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On Cutwidth Parameterized by Vertex Cover. Algorithmica 68(4): 940-953 (2014) - [j36]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On the Hardness of Losing Width. Theory Comput. Syst. 54(1): 73-82 (2014) - [j35]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov, Saket Saurabh:
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. SIAM J. Comput. 43(5): 1541-1563 (2014) - [j34]Michael Dom, Daniel Lokshtanov, Saket Saurabh:
Kernelization Lower Bounds Through Colors and IDs. ACM Trans. Algorithms 11(2): 13:1-13:20 (2014) - [j33]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms 11(2): 15:1-15:31 (2014) - [j32]Christine Lo, Boyko Kakaradov, Daniel Lokshtanov, Christina Boucher:
SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers. IEEE ACM Trans. Comput. Biol. Bioinform. 11(4): 648-656 (2014) - [c79]Fedor V. Fomin
, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh:
Representative Sets of Product Families. ESA 2014: 443-454 - [c78]Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
:
Solving Multicut Faster Than 2 n. ESA 2014: 666-676 - [c77]Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. FOCS 2014: 186-195 - [c76]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
:
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS 2014: 85-96 - [c75]Markus Sortland Dregi, Daniel Lokshtanov:
Parameterized Complexity of Bandwidth on Trees. ICALP (1) 2014: 405-416 - [c74]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. SODA 2014: 142-151 - [c73]Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger:
Independent Set in P5-Free Graphs in Polynomial Time. SODA 2014: 570-581 - [c72]Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
A Near-Optimal Planarization Algorithm. SODA 2014: 1802-1811 - [c71]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Minimum bisection is fixed parameter tractable. STOC 2014: 323-332 - [i32]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Sets of Product Families. CoRR abs/1402.3909 (2014) - [i31]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. CoRR abs/1403.2009 (2014) - [i30]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. CoRR abs/1404.0818 (2014) - [i29]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. CoRR abs/1404.4506 (2014) - [i28]Markus Sortland Dregi, Daniel Lokshtanov:
Parameterized Complexity of Bandwidth on Trees. CoRR abs/1404.7810 (2014) - [i27]Pål Grønås Drange
, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization and Sparseness: the case of Dominating Set. CoRR abs/1411.4575 (2014) - [i26]Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk:
Representative sets for multisets. CoRR abs/1411.6756 (2014) - [i25]Hans L. Bodlaender
, Pinar Heggernes, Daniel Lokshtanov:
Graph Modification Problems (Dagstuhl Seminar 14071). Dagstuhl Reports 4(2): 38-59 (2014) - [i24]Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith:
Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). Dagstuhl Reports 4(11): 1-21 (2014) - 2013
- [j31]Fedor V. Fomin
, Fabrizio Grandoni
, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh:
Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3): 584-604 (2013) - [j30]Daniel Lokshtanov, Dániel Marx:
Clustering with local restrictions. Inf. Comput. 222: 278-292 (2013) - [j29]Pinar Heggernes
, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. 231: 109-116 (2013) - [j28]Frederic Dorn, Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. 233: 60-70 (2013) - [j27]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Imbalance is fixed parameter tractable. Inf. Process. Lett. 113(19-21): 714-718 (2013) - [j26]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory 74(4): 417-424 (2013) - [j25]Pinar Heggernes
, Pim van 't Hof
, Daniel Lokshtanov, Christophe Paul
:
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27(4): 2143-2156 (2013) - [j24]Michael R. Fellows
, Fedor V. Fomin
, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond
, Saket Saurabh:
Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory 5(4): 16:1-16:20 (2013) - [c70]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA 2013: 671-682 - [c69]Hans L. Bodlaender
, Pål Grønås Drange
, Markus S. Dregi, Fedor V. Fomin
, Daniel Lokshtanov, Michal Pilipczuk
:
An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS 2013: 499-508 - [c68]Ravi Kumar, Daniel Lokshtanov, Sergei Vassilvitskii, Andrea Vattani:
Near-Optimal Bounds for Cross-Validation via Loss Stability. ICML (1) 2013: 27-35 - [c67]Hans L. Bodlaender
, Paul S. Bonsma, Daniel Lokshtanov:
The Fine Details of Fast Dynamic Programming over Tree Decompositions. IPEC 2013: 41-53 - [c66]Rajesh Hemant Chitnis
, Fedor V. Fomin
, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Exact Algorithms for Some Terminal Set Problems. IPEC 2013: 150-162 - [c65]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. IPEC 2013: 189-201 - [c64]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. IPEC 2013: 243-254 - [c63]Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh:
Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC 2013: 255-267 - [c62]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS 2013: 92-103 - [i23]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. CoRR abs/1304.4626 (2013) - [i22]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A O(c^k n) 5-Approximation Algorithm for Treewidth. CoRR abs/1304.6321 (2013) - [i21]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR abs/1309.7891 (2013) - [i20]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR abs/1310.2378 (2013) - [i19]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Minimum Bisection is fixed parameter tractable. CoRR abs/1311.2563 (2013) - 2012
- [j23]Fedor V. Fomin
, Fabrizio Grandoni
, Daniel Lokshtanov, Saket Saurabh:
Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica 63(3): 692-706 (2012) - [j22]Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao:
Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3): 698-706 (2012) - [j21]Michael R. Fellows
, Fedor V. Fomin
, Daniel Lokshtanov, Frances A. Rosamond
, Saket Saurabh, Yngve Villanger:
Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78(3): 707-719 (2012) - [j20]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov:
Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012) - [j19]Pinar Heggernes
, Pim van 't Hof
, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. 26(3): 1008-1021 (2012) - [j18]Daniel Binkele-Raible, Henning Fernau
, Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms 8(4): 38:1-38:19 (2012) - [c61]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Kernelization - Preprocessing with a Guarantee. The Multivariate Algorithmic Revolution and Beyond 2012: 129-161 - [c60]Marek Cygan
, Holger Dell
, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto
, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
:
On Problems as Hard as CNF-SAT. CCC 2012: 74-84 - [c59]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS 2012: 470-479 - [c58]Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström
:
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. FSTTCS 2012: 424-434 - [c57]Daniel Lokshtanov, M. S. Ramanujan:
Parameterized Tractability of Multiway Cut with Parity Constraints. ICALP (1) 2012: 750-761 - [c56]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on H-minor-free graphs. SODA 2012: 82-93 - [c55]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Bidimensionality and geometric graphs. SODA 2012: 1563-1575 - [i18]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms using Linear Programming. CoRR abs/1203.0833 (2012) - [i17]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation and Optimal FPT Algorithms. CoRR abs/1204.4230 (2012) - [i16]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. CoRR abs/1210.0257 (2012) - [i15]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. CoRR abs/1210.0260 (2012) - 2011
- [j17]Oren Ben-Zwi, Danny Hermelin
, Daniel Lokshtanov, Ilan Newman:
Treewidth governs the complexity of target set selection. Discret. Optim. 8(1): 87-96 (2011) - [j16]Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the directed Full Degree Spanning Tree problem. Discret. Optim. 8(1): 97-109 (2011) - [j15]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Lower bounds based on the Exponential Time Hypothesis. Bull. EATCS 105: 41-72 (2011) - [j14]Michael R. Fellows
, Fedor V. Fomin
, Daniel Lokshtanov, Frances A. Rosamond
, Saket Saurabh, Stefan Szeider
, Carsten Thomassen
:
On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2): 143-153 (2011) - [j13]Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16): 814-818 (2011) - [j12]Fedor V. Fomin
, Jan Kratochvíl
, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle:
On the complexity of reconstructing H-free graphs from their Star Systems. J. Graph Theory 68(2): 113-124 (2011) - [j11]Pinar Heggernes
, Daniel Lokshtanov, Rodica Mihai
, Charis Papadopoulos
:
Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. 25(3): 1418-1437 (2011) - [j10]Daniel Lokshtanov, Matthias Mnich
, Saket Saurabh:
A linear kernel for planar connected dominating set. Theor. Comput. Sci. 412(23): 2536-2543 (2011) - [j9]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh:
An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. 412(29): 3530-3536 (2011) - [j8]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov:
Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. 412(46): 6484-6497 (2011) - [j7]Petr A. Golovach
, Pinar Heggernes
, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011) - [c54]Daniel Lokshtanov:
Kernelization: An Overview. FCT 2011: 39-40 - [c53]Pinar Heggernes
, Pim van 't Hof
, Daniel Lokshtanov, Christophe Paul
:
Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228 - [c52]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause
, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Tight Bounds for Linkages in Planar Graphs. ICALP (1) 2011: 110-121 - [c51]Daniel Lokshtanov, Dániel Marx:
Clustering with Local Restrictions. ICALP (1) 2011: 785-797 - [c50]Pinar Heggernes
, Pim van 't Hof
, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
:
Contracting Graphs to Paths and Trees. IPEC 2011: 55-66 - [c49]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On the Hardness of Losing Width. IPEC 2011: 159-168 - [c48]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On Cutwidth Parameterized by Vertex Cover. IPEC 2011: 246-258 - [c47]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Bidimensionality and EPTAS. SODA 2011: 748-759 - [c46]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Slightly Superexponential Parameterized Problems. SODA 2011: 760-776 - [c45]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. SODA 2011: 777-789 - [c44]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200 - [c43]Paul S. Bonsma, Daniel Lokshtanov:
Feedback Vertex Set in Mixed Graphs. WADS 2011: 122-133 - [c42]Daniel Lokshtanov, Matthias Mnich
, Saket Saurabh:
Planar k-Path in Subexponential Time and Polynomial Space. WG 2011: 262-270 - [i14]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. CoRR abs/1102.5441 (2011) - [i13]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. CoRR abs/1104.3677 (2011) - [i12]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Bidimensionality and Geometric Graphs. CoRR abs/1107.2221 (2011) - [i11]Christina Boucher, Christine Lo, Daniel Lokshtanov:
Outlier Detection for DNA Fragment Assembly. CoRR abs/1111.0376 (2011) - [i10]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNFSAT. CoRR abs/1112.2275 (2011) - 2010
- [j6]Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
:
Characterizing and computing minimal cograph completions. Discret. Appl. Math. 158(7): 755-764 (2010) - [j5]Daniel Lokshtanov:
On the complexity of computing treelength. Discret. Appl. Math. 158(7): 820-827 (2010) - [j4]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010) - [c41]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI 2010: 65-70 - [c40]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Imbalance Is Fixed Parameter Tractable. COCOON 2010: 199-208 - [c39]Michael R. Fellows
, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond
, Saket Saurabh:
Determining the Winner of a Dodgson Election is Hard. FSTTCS 2010: 459-468 - [c38]Henning Fernau
, Fedor V. Fomin
, Daniel Lokshtanov, Matthias Mnich
, Geevarghese Philip, Saket Saurabh:
Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348 - [c37]Fedor V. Fomin
, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh:
Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN 2010: 72-83 - [c36]Daniel Lokshtanov:
Algorithmic Lower Bounds for Problems on Decomposable Graphs. MFCS 2010: 37 - [c35]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502 - [c34]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. SODA 2010: 503-510 - [c33]Frederic Dorn, Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS 2010: 251-262 - [c32]Daniel Lokshtanov, Jesper Nederlof:
Saving space by algebraization. STOC 2010: 321-330 - [c31]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov:
Cops and Robber Game without Recharging. SWAT 2010: 273-284 - [c30]Pinar Heggernes
, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT 2010: 334-345 - [c29]Pinar Heggernes
, Pim van 't Hof
, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87 - [c28]Pinar Heggernes
, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul
, Jan Arne Telle:
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183 - [i9]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. CoRR abs/1001.0821 (2010) - [i8]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Bidimensionality and EPTAS. CoRR abs/1005.5449 (2010) - [i7]Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal. CoRR abs/1007.5450 (2010) - [i6]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. CoRR abs/1010.1365 (2010) - [i5]Paul S. Bonsma, Daniel Lokshtanov:
Feedback Vertex Set in Mixed Graphs. CoRR abs/1010.5974 (2010)
2000 – 2009
- 2009
- [j3]Daniel Lokshtanov:
Finding the longest isometric cycle in a graph. Discret. Appl. Math. 157(12): 2670-2674 (2009) - [j2]Michael R. Fellows
, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich
, Frances A. Rosamond
, Saket Saurabh:
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. 45(4): 822-848 (2009) - [c27]Hans L. Bodlaender
, Fedor V. Fomin
, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. FOCS 2009: 629-638 - [c26]Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Subexponential Algorithms for Partial Cover Problems. FSTTCS 2009: 193-201 - [c25]Noga Alon, Daniel Lokshtanov, Saket Saurabh:
Fast FAST. ICALP (1) 2009: 49-58 - [c24]Michael Dom, Daniel Lokshtanov, Saket Saurabh:
Incompressibility through Colors and IDs. ICALP (1) 2009: 378-389 - [c23]Michael R. Fellows
, Fedor V. Fomin
, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond
, Saket Saurabh:
Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474 - [c22]Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491 - [c21]Petr A. Golovach
, Pinar Heggernes
, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582 - [c20]Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar:
Simpler Parameterized Algorithm for OCT. IWOCA 2009: 380-384 - [c19]Hans L. Bodlaender
, Daniel Lokshtanov, Eelko Penninkx:
Planar Capacitated Dominating Set Is W[1]-Hard. IWPEC 2009: 50-60 - [c18]Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the Directed Degree-Preserving Spanning Tree Problem. IWPEC 2009: 276-287 - [c17]Daniel Lokshtanov, Saket Saurabh:
Even Faster Algorithm for Set Splitting! IWPEC 2009: 288-299 - [c16]Oren Ben-Zwi, Danny Hermelin
, Daniel Lokshtanov, Ilan Newman:
An exact almost optimal algorithm for target set selection in social networks. EC 2009: 355-362 - [c15]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Clique-width: on the price of generality. SODA 2009: 825-834 - [c14]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432 - [c13]Daniel Lokshtanov, Matthias Mnich
, Saket Saurabh:
Linear Kernel for Planar Connected Dominating Set. TAMC 2009: 281-290 - [c12]Fedor V. Fomin
, Petr A. Golovach
, Daniel Lokshtanov:
Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158 - [c11]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh:
An Exact Algorithm for Minimum Distortion Embedding. WG 2009: 112-121 - [i4]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. CoRR abs/0904.0727 (2009) - [i3]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh:
Faster Algorithms for Finding and Counting Subgraphs. CoRR abs/0912.2371 (2009) - 2008
- [c10]Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
:
Characterizing and Computing Minimal Cograph Completions. FAW 2008: 147-158 - [c9]Michael R. Fellows
, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond
, Saket Saurabh:
Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305 - [c8]Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90 - [c7]Daniel Lokshtanov:
Wheel-Free Deletion Is W[2]-Hard. IWPEC 2008: 141-147 - [c6]Fedor V. Fomin
, Jan Kratochvíl
, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle:
On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205 - [c5]Pinar Heggernes
, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229 - [i2]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees. CoRR abs/0804.3028 (2008) - [i1]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves. CoRR abs/0810.4796 (2008) - 2007
- [c4]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider
, Carsten Thomassen:
On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377 - [c3]Daniel Lokshtanov:
On the Complexity of Computing Treelength. MFCS 2007: 276-287 - 2006
- [j1]Pinar Heggernes
, Daniel Lokshtanov:
Optimal broadcast domination in polynomial time. Discret. Math. 306(24): 3267-3280 (2006) - 2005
- [c2]Daniel Lokshtanov, Christian Sloper:
Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. ACiD 2005: 105-113 - [c1]Pinar Heggernes
, Daniel Lokshtanov:
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. WG 2005: 187-198
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint