Daniel Lokshtanov

489 papers A* 96A 35B 43C 6Misc 3Journal 261Unranked 42

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs. SOSA Ajaykrishnan E. S., Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan
2026	A	`conf`	FPT Approximations for Connected Maximum Coverage. ITCS Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	FPT Approximations for Connected Maximum Coverage. CoRR Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	Faster Parameterized Vertex Multicut. CoRR Huairui Chu, Yuxi Liu, Daniel Lokshtanov, Junqiang Peng, Kangyi Tian, Mingyu Xiao
2026	J	`jnl`	Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number. CoRR Daniel Lokshtanov, Michal Pilipczuk, Pawel Rzazewski
2026	J	`jnl`	Induced Minors and Coarse Tree Decompositions. CoRR Maria Chudnovsky, Julien Codsi, Ajaykrishnan E. S., Daniel Lokshtanov
2026	J	`jnl`	On the complexity of Multipacking. CoRR Sandip Das, Sk Samim Islam, Daniel Lokshtanov
2026	J	`jnl`	Response to: "best practices when benchmarking CATCH for the design of genome enrichment probes". Bioinform. Jarno N. Alanko, Ilya B. Slizovskiy, Daniel Lokshtanov, Travis Gagie, Noelle R. Noyes, Christina Boucher
2026	—	`conf`	The Sparsification Lemma via Measure and Conquer. SOSA Daniel Lokshtanov, Saket Saurabh, Jie Xue
2026	J	`jnl`	Tree independence number II. Three-path-configurations. J. Comb. Theory B Maria Chudnovsky, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl
2026	J	`jnl`	When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices. J. Comb. Theory B Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2025	J	`jnl`	A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. CoRR Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh
2025	J	`jnl`	A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs. CoRR Ajaykrishnan E. S., Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan
2025	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. SIAM J. Comput. Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2025	—	`conf`	Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division. FSTTCS Ajaykrishnan E. S., Daniel Lokshtanov
2025	J	`jnl`	Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division. CoRR Ajaykrishnan E. S., Daniel Lokshtanov
2025	A*	`conf`	Crossing Number in Slightly Superexponential Time (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi
2025	A*	`conf`	Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025	J	`jnl`	Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized. Proc. ACM Manag. Data Vaishali Surianarayanan, Anikait Mundhra, Ajaykrishnan E. S., Daniel Lokshtanov
2025	A*	`conf`	Fixed-Parameter Tractability of Hedge Cut. SODA Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh
2025	J	`jnl`	Odd Cycle Transversal on ACM Trans. Algorithms Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2025	A*	`conf`	PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. SODA Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2025	C	`conf`	Parameterized Algorithms for Power Edge Set and Zero Forcing Set. IWOCA Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh
2025	A*	`conf`	Parameterized Approximation for Capacitated SODA Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2025	A	`conf`	Parameterized Saga of First-Fit and Last-Fit Coloring. STACS Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2025	J	`jnl`	Path Contraction Faster than 2 CoRR Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2025	B	`conf`	Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. MFCS Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2025	A*	`conf`	Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. ICALP Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2025	A	`conf`	Sampling Unlabeled Chordal Graphs in Expected Polynomial Time. STACS Úrsula Hébert-Johnson, Daniel Lokshtanov
2025	J	`jnl`	Sampling Unlabeled Chordal Graphs in Expected Polynomial Time. CoRR Úrsula Hébert-Johnson, Daniel Lokshtanov
2025	A*	`conf`	Subexponential Parameterized Algorithms for Hitting Subgraphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025	A*	`conf`	Tree Independence Number IV. Even-hole-free graphs. SODA Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl
2025	J	`jnl`	Tree independence number V. Walls and claws. CoRR Maria Chudnovsky, Julien Codsi, Daniel Lokshtanov, Martin Milanic, Varun Sivashankar
2025	J	`jnl`	Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. ACM Trans. Comput. Theory Daniel Lokshtanov, Ramanujan Maadapuzhi Sridharan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2024	A	`ed.`	41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, March 12-14, 2024 STACS Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
2024	A*	`conf`	A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	A Parameterized Approximation Scheme for Min $k$-Cut. SIAM J. Comput. Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2024	A	`conf`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	B	`conf`	Degreewidth on Semi-complete Digraphs. WG Ryan Keeney, Daniel Lokshtanov
2024	A*	`conf`	Efficient Approximation of Fractional Hypertree Width. FOCS Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024	J	`jnl`	Efficient Approximation of Fractional Hypertree Width. CoRR Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024	A*	`conf`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024	J	`jnl`	Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. CoRR Mithilesh Kumar, Daniel Lokshtanov
2024	J	`jnl`	Fixed-Parameter Tractability of Hedge Cut. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh
2024	A*	`conf`	Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. SODA Tuukka Korhonen, Daniel Lokshtanov
2024	A	`conf`	Kernelization of Counting Problems. ITCS Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Lower Bound for Independence Covering in ACM Trans. Comput. Theory Michael Kuhn, Daniel Lokshtanov, Zachary Miller
2024	J	`jnl`	Maximum Partial List H-Coloring on P CoRR Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2024	A*	`conf`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2024	A*	`conf`	Meta-theorems for Parameterized Streaming Algorithms‡. SODA Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2024	A*	`conf`	Odd Cycle Transversal on SODA Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma
2024	J	`jnl`	Odd Cycle Transversal on P CoRR Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2024	J	`jnl`	Parameterized Approximation for Capacitated CoRR Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024	A*	`conf`	Parameterized Complexity of Kidney Exchange Revisited. IJCAI Úrsula Hébert-Johnson, Daniel Lokshtanov, Chinmay Sonar, Vaishali Surianarayanan
2024	J	`jnl`	Parameterized Saga of First-Fit and Last-Fit Coloring. CoRR Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2024	J	`jnl`	Query Planning for Robust and Scalable Hybrid Network Telemetry Systems. Proc. ACM Netw. Chaofan Shou, Rohan Bhatia, Arpit Gupta, Rob Harrison, Daniel Lokshtanov, Walter Willinger
2024	J	`jnl`	Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024	A*	`conf`	Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	J	`jnl`	Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	J	`jnl`	Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2024	J	`jnl`	Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Tree Independence Number IV. Even-hole-free Graphs. CoRR Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl
2024	J	`jnl`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024	—	`conf`	When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. FSTTCS Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2024	J	`jnl`	When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2024	J	`jnl`	b-Coloring Parameterized by Clique-Width. Theory Comput. Syst. Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov
2023	A*	`conf`	A Framework for Approximation Schemes on Disk Graphs. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	B	`conf`	An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2023	A*	`conf`	An Improved Parameterized Algorithm for Treewidth. STOC Tuukka Korhonen, Daniel Lokshtanov
2023	A*	`conf`	Breaking the All Subsets Barrier for Min k-Cut. ICALP Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	A	`conf`	Counting and Sampling Labeled Chordal Graphs in Polynomial Time. ESA Úrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda
2023	J	`jnl`	Counting and Sampling Labeled Chordal Graphs in Polynomial Time. CoRR Úrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda
2023	J	`jnl`	Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2023	A*	`conf`	Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. SODA Peter Gartland, Daniel Lokshtanov
2023	A*	`conf`	Graph Classes with Few Minimal Separators. II. A Dichotomy. SODA Peter Gartland, Daniel Lokshtanov
2023	J	`jnl`	Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	J	`jnl`	Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. CoRR Tuukka Korhonen, Daniel Lokshtanov
2023	J	`jnl`	Kernelization of Counting Problems. CoRR Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	A	`conf`	Lossy Kernelization for (Implicit) Hitting Set Problems. ESA Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Lower Bound for Independence Covering in C CoRR Michael Kuhn, Daniel Lokshtanov, Zachary Miller
2023	J	`jnl`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2023	J	`jnl`	Meta-theorems for Parameterized Streaming Algorithms. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2023	C	`conf`	Min-max coverage problems on tree-like metrics. LAGOS Eric Aaron, Úrsula Hébert-Johnson, Danny Krizanc, Daniel Lokshtanov
2023	J	`jnl`	On Induced Versions of Menger's Theorem on Sparse Graphs. CoRR Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov
2023	B	`conf`	Parameterized Approximation Scheme for Feedback Vertex Set. MFCS Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh
2023	A	`conf`	Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	J	`jnl`	Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	J	`jnl`	Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	A*	`conf`	Shortest Cycles With Monotone Submodular Costs. SODA Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2022	J	`jnl`	A Framework for Approximation Schemes on Disk Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	J	`jnl`	An Improved Parameterized Algorithm for Treewidth. CoRR Tuukka Korhonen, Daniel Lokshtanov
2022	A*	`conf`	Backdoor Sets on Nowhere Dense SAT. ICALP Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan
2022	A*	`conf`	Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	A*	`conf`	Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	B	`conf`	Gehrlein Stable Committee with Multi-modal Preferences. SAGT Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
2022	J	`jnl`	Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	J	`jnl`	On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. Algorithmica Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
2022	J	`jnl`	On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2022	J	`jnl`	On the threshold of intractability. J. Comput. Syst. Sci. Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan
2022	A*	`conf`	Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022	J	`jnl`	Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022	J	`jnl`	Shortest Cycles With Monotone Submodular Costs. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2022	A*	`conf`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2022	J	`jnl`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	A*	`conf`	Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	J	`jnl`	Syotti: scalable bait design for DNA enrichment. Bioinform. Jarno N. Alanko, Ilya B. Slizovskiy, Daniel Lokshtanov, Travis Gagie, Noelle R. Noyes, Christina Boucher
2022	A*	`conf`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2022	Misc	`conf`	Wordle Is NP-Hard. FUN Daniel Lokshtanov, Bernardo Subercaseaux
2022	J	`jnl`	Wordle is NP-hard. CoRR Daniel Lokshtanov, Bernardo Subercaseaux
2021	J	`jnl`	2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	A*	`conf`	A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
2021	—	`conf`	An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2021	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Approximate Counting of ACM Trans. Algorithms Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Bisection of bounded treewidth graphs by convolutions. J. Comput. Syst. Sci. Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad
2021	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 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
2021	A*	`conf`	Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf
2021	J	`jnl`	Diversity in Kemeny Rank Aggregation: A Parameterized Approach. CoRR Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf
2021	—	`conf`	Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable. FSTTCS Daniel Lokshtanov, Vaishali Surianarayanan
2021	J	`jnl`	DynamiQ: Planning for Dynamics in Network Streaming Analytics Systems. CoRR Rohan Bhatia, Arpit Gupta, Rob Harrison, Daniel Lokshtanov, Walter Willinger
2021	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2021	A	`conf`	Efficient Algorithms for Least Square Piecewise Polynomial Regression. ESA Daniel Lokshtanov, Subhash Suri, Jie Xue
2021	A*	`conf`	Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Elimination Distance to Topological-minor-free Graphs is FPT. CoRR Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021	A	`conf`	Exploiting Dense Structures in Parameterized Complexity. STACS William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2021	A*	`conf`	FPT-approximation for FPT Problems. SODA Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Faster and enhanced inclusion-minimal cograph completion. Discret. Appl. Math. Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry
2021	A*	`conf`	Finding large induced sparse subgraphs in STOC Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2021	J	`jnl`	Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2021	J	`jnl`	Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström
2021	J	`jnl`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2021	A	`conf`	b-Coloring Parameterized by Clique-Width. STACS Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov
2020	A*	`conf`	2-Approximating Feedback Vertex Set in Tournaments. SODA Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2020	A*	`conf`	A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2020	J	`jnl`	A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. CoRR Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
2020	J	`jnl`	A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2020	A*	`conf`	A Parameterized Approximation Scheme for Min $k$-Cut. FOCS Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2020	J	`jnl`	A Parameterized Approximation Scheme for Min k-Cut. CoRR Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2020	J	`jnl`	A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2020	A*	`conf`	An exponential time parameterized algorithm for planar disjoint paths. STOC Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2020	A*	`conf`	Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Bidimensionality and Kernels. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2020	A*	`conf`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR 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
2020	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	J	`jnl`	Dominated Minimal Separators are Tame (Nearly All Others are Feral). CoRR Peter Gartland, Daniel Lokshtanov
2020	A*	`conf`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Treewidth, Kernels, and Algorithms Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. CoRR Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Fair Covering of Points by Balls. CCCG Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue
2020	J	`jnl`	Faster and Enhanced Inclusion-Minimal Cograph Completion. CoRR Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry
2020	A	`conf`	Fault Tolerant Subgraphs with Applications in Kernelization. ITCS William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	J	`jnl`	Going Far from Degeneracy. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Hitting topological minors is FPT. STOC Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time. FOCS Peter Gartland, Daniel Lokshtanov
2020	J	`jnl`	Independent Set on C CoRR Peter Gartland, Daniel Lokshtanov
2020	J	`jnl`	Independent Set on P CoRR Peter Gartland, Daniel Lokshtanov
2020	B	`conf`	On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. LATIN Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
2020	—	`conf`	On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020	B	`conf`	On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2020	A	`conf`	Parameterization Above a Multiplicative Guarantee. ITCS Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`ch.`	Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2020	J	`jnl`	Path Contraction Faster than 2 SIAM J. Discret. Math. Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Removing Connected Obstacles in the Plane Is FPT. SoCG Eduard Eiben, Daniel Lokshtanov
2020	J	`jnl`	Removing Connected Obstacles in the Plane is FPT. CoRR Eduard Eiben, Daniel Lokshtanov
2020	J	`jnl`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2020	A*	`conf`	The Parameterized Complexity of Guarding Almost Convex Polygons. SoCG Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	The Parameterized Complexity of Guarding Almost Convex Polygons. CoRR Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	b-Coloring Parameterized by Clique-Width. CoRR Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov
2019	J	`jnl`	A Brief Note on Single Source Fault Tolerant Reachability. CoRR Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Approximate Counting of k-Paths: Deterministic and in Polynomial Space. ICALP Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2019	A	`conf`	Bisection of Bounded Treewidth Graphs by Convolutions. ESA Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad
2019	J	`jnl`	Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	B	`conf`	Computing the Largest Bond of a Graph. IPEC Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2019	J	`jnl`	Computing the largest bond of a graph. CoRR Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2019	A*	`conf`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Decomposition of Map Graphs with Applications. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Decomposition of Map Graphs with Applications. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Exact Algorithms via Monotone Local Search. J. ACM Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2019	J	`jnl`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A	`conf`	Going Far From Degeneracy. ESA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Going Far From Degeneracy. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Minimum Bisection Is Fixed-Parameter Tractable. SIAM J. Comput. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2019	J	`jnl`	On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2019	J	`jnl`	Packing Cycles Faster Than Erdos-Posa. SIAM J. Discret. Math. Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2019	A*	`conf`	Path Contraction Faster Than 2 ICALP Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2019	B	`conf`	Picking Random Vertices (Invited Talk). MFCS Daniel Lokshtanov
2019	J	`jnl`	Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Slightly Superexponential Parameterized Problems. CoRR Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2019	J	`jnl`	Spanning Circuits in Regular Matroids. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2019	J	`jnl`	Split Contraction: The Untold Story. ACM Trans. Comput. Theory Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2019	J	`jnl`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2019	J	`jnl`	The Complexity of Independent Set Reconfiguration on Bipartite Graphs. ACM Trans. Algorithms Daniel Lokshtanov, Amer E. Mouawad
2019	B	`conf`	Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	B	`ed.`	12th International Symposium on Parameterized and Exact Computation, IPEC 2017, Vienna, Austria, September 6-8, 2017 IPEC Daniel Lokshtanov, Naomi Nishimura
2018	J	`jnl`	A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh
2018	J	`jnl`	A New Perspective on FO Model Checking of Dense Graph Classes. CoRR Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
2018	B	`conf`	A Polynomial Sized Kernel for Tracking Paths Problem. LATIN Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2018	B	`conf`	A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. IPEC Daniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh
2018	A*	`conf`	Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos
2018	J	`jnl`	Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2018	A*	`conf`	Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. SODA Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák
2018	J	`jnl`	Below All Subsets for Minimal Connected Dominating Set. SIAM J. Discret. Math. Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh
2018	A*	`conf`	Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	A*	`conf`	Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2018	B	`conf`	Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh
2018	A*	`conf`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	Covering Vectors by Spaces: Regular Matroids. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2018	J	`jnl`	Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2018	A	`conf`	Erdös-Pósa Property of Obstructions to Interval Graphs. STACS Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. J. ACM Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2018	J	`jnl`	Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna
2018	J	`jnl`	Independence and Efficient Domination on ACM Trans. Algorithms Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
2018	J	`jnl`	Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2018	J	`jnl`	Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2018	J	`jnl`	Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Trans. Algorithms Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2018	J	`jnl`	Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ACM Trans. Algorithms Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2018	J	`jnl`	Long directed ( Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2018	—	`conf`	Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	A	`conf`	Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Randomized contractions meet lean decompositions. CoRR Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh
2018	J	`jnl`	Reconfiguration on sparse graphs. J. Comput. Syst. Sci. Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2018	A*	`conf`	Reducing CMSO Model Checking to Highly Connected Graphs. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Reducing CMSO Model Checking to Highly Connected Graphs. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Simultaneous Feedback Vertex Set: A Parameterized Perspective. ACM Trans. Comput. Theory Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2018	J	`jnl`	Slightly Superexponential Parameterized Problems. SIAM J. Comput. Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2018	J	`jnl`	Subexponential-time Algorithms for Maximum Independent Set in P CoRR Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2018	A*	`conf`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2018	B	`conf`	The Parameterized Complexity of Finding Point Sets with Hereditary Properties. IPEC David Eppstein, Daniel Lokshtanov
2018	J	`jnl`	The Parameterized Complexity of Finding Point Sets with Hereditary Properties. CoRR David Eppstein, Daniel Lokshtanov
2018	A*	`conf`	The complexity of independent set reconfiguration on bipartite graphs. SODA Daniel Lokshtanov, Amer E. Mouawad
2018	A*	`conf`	When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. SODA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	A	`conf`	A Linear-Time Parameterized Algorithm for Node Unique Label Cover. ESA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos
2017	—	`conf`	Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	J	`jnl`	Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	A*	`conf`	Beating Brute Force for Systems of Polynomial Equations over Finite Fields. SODA Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu
2017	J	`jnl`	Clustering with Local Restrictions. CoRR Daniel Lokshtanov, Dániel Marx
2017	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	A*	`conf`	Covering Vectors by Spaces: Regular Matroids. ICALP Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	J	`jnl`	Covering vectors by spaces: Regular matroids. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	B	`conf`	Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. WG Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad
2017	—	`conf`	Faster and Enhanced Inclusion-Minimal Cograph Completion. COCOA (1) Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry
2017	J	`jnl`	Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	A*	`conf`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	A*	`conf`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. SIAM J. Comput. Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2017	A*	`conf`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2017	J	`jnl`	Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2017	A*	`conf`	Lossy kernelization. STOC Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2017	A	`conf`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2017	—	`conf`	On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan
2017	A*	`conf`	Packing Cycles Faster Than Erdos-Posa. ICALP Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Packing Cycles Faster Than Erdős-Pósa. CoRR Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2017	J	`jnl`	Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Quick but Odd Growth of Cacti. Algorithmica Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2017	J	`jnl`	Representative Families of Product Families. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2017	A*	`conf`	Spanning Circuits in Regular Matroids. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	A	`conf`	Split Contraction: The Untold Story. STACS Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	The Half-integral Erdös-Pósa Property for Non-null Cycles. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	The complexity of independent set reconfiguration on bipartite graphs. CoRR Daniel Lokshtanov, Amer E. Mouawad
2017	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	(Meta) Kernelization. J. ACM Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2016	B	`conf`	A 2lk Kernel for l-Component Order Connectivity. IPEC Mithilesh Kumar, Daniel Lokshtanov
2016	J	`jnl`	A 2ℓk Kernel for ℓ-Component Order Connectivity. CoRR Mithilesh Kumar, Daniel Lokshtanov
2016	B	`conf`	A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	A Linear Time Parameterized Algorithm for Node Unique Label Cover. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2016	A*	`conf`	A New Perspective on FO Model Checking of Dense Graph Classes. LICS Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2016	J	`jnl`	A c SIAM J. Comput. Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2016	J	`jnl`	Below all subsets for Minimal Connected Dominating Set. CoRR Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	Bidimensionality and Kernels. CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2016	J	`jnl`	Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	A*	`conf`	Exact algorithms via monotone local search. STOC Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2016	—	`conf`	Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. FSTTCS Mithilesh Kumar, Daniel Lokshtanov
2016	A	`conf`	Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. STACS Mithilesh Kumar, Daniel Lokshtanov
2016	J	`jnl`	Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2016	A*	`conf`	Independence and Efficient Domination on SODA Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
2016	A	`conf`	Kernelization and Sparseness: the Case of Dominating Set. STACS 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
2016	A*	`conf`	Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2016	—	`ch.`	Kernelization, Bidimensionality and Kernels. Encyclopedia of Algorithms Daniel Lokshtanov
2016	J	`jnl`	Lossy Kernelization. CoRR Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	—	`conf`	Lower Bounds for Approximation Schemes for Closest String. SWAT Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	On Problems as Hard as CNF-SAT. ACM Trans. Algorithms Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2016	J	`jnl`	On the Ordered List Subgraph Embedding Problems. Algorithmica Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
2016	A	`conf`	Simultaneous Feedback Vertex Set: A Parameterized Perspective. STACS Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2016	J	`jnl`	Spanning Circuits in Regular Matroids. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2016	A*	`conf`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	A*	`conf`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. FOCS Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. CoRR Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	Tree Deletion Set Has a Polynomial Kernel but No OPT SIAM J. Discret. Math. Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2015	J	`jnl`	A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2015	A	`conf`	Consensus Patterns (Probably) Has no EPTAS. ESA Christina Boucher, Christine Lo, Daniel Lokshtanov
2015	—	`conf`	Deterministic Truncation of Linear Matroids. ICALP (1) Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2015	J	`jnl`	Exact Algorithms via Monotone Local Search. CoRR Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2015	A*	`conf`	FO Model Checking on Posets of Bounded Width. FOCS Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	FO Model Checking on Posets of Bounded Width. CoRR Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	A	`conf`	Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. ESA Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
2015	J	`jnl`	Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. CoRR Mithilesh Kumar, Daniel Lokshtanov
2015	J	`jnl`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2015	J	`jnl`	Independence and Efficient Domination on P CoRR Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
2015	—	`conf`	Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ICALP (1) Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Lower bounds for approximation schemes for Closest String. CoRR Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2015	A	`conf`	On the Threshold of Intractability. ESA Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
2015	J	`jnl`	On the Threshold of Intractability. CoRR Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
2015	—	`book`	Parameterized Algorithms Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2015	J	`jnl`	Parameterized Integer Quadratic Programming: Variables and Coefficients. CoRR Daniel Lokshtanov
2015	—	`conf`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	B	`conf`	Quick but Odd Growth of Cacti. IPEC Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	B	`conf`	Reconfiguration on Sparse Graphs. WADS Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Reconfiguration on sparse graphs. CoRR Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Simultaneous Feedback Vertex Set: A Parameterized Perspective. CoRR Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2015	A*	`conf`	Solving SODA Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
2015	—	`conf`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2015	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2014	A*	`conf`	A Near-Optimal Planarization Algorithm. SODA Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. SIAM J. Comput. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Contracting Graphs to Paths and Trees. Algorithmica Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2014	J	`jnl`	Deterministic Truncation of Linear Matroids. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2014	A*	`conf`	Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2014	A*	`conf`	Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. FOCS Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	Graph Modification Problems (Dagstuhl Seminar 14071). Dagstuhl Reports Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov
2014	A*	`conf`	Independent Set in SODA Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger
2014	J	`jnl`	Kernelization Lower Bounds Through Colors and IDs. ACM Trans. Algorithms Michael Dom, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Kernelization and Sparseness: the case of Dominating Set. CoRR 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
2014	A*	`conf`	Minimum bisection is fixed parameter tractable. STOC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	On Cutwidth Parameterized by Vertex Cover. Algorithmica Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	On the Hardness of Losing Width. Theory Comput. Syst. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	On the Ordered List Subgraph Embedding Problems. CoRR Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
2014	J	`jnl`	Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451). Dagstuhl Reports Stefan Kratsch, Daniel Lokshtanov, Dániel Marx, Peter Rossmanith
2014	—	`conf`	Parameterized Complexity of Bandwidth on Trees. ICALP (1) Markus Sortland Dregi, Daniel Lokshtanov
2014	J	`jnl`	Parameterized Complexity of Bandwidth on Trees. CoRR Markus Sortland Dregi, Daniel Lokshtanov
2014	A	`conf`	Representative Sets of Product Families. ESA Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2014	J	`jnl`	Representative Sets of Product Families. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2014	J	`jnl`	Representative sets for multisets. CoRR Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
2014	J	`jnl`	SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers. IEEE ACM Trans. Comput. Biol. Bioinform. Christine Lo, Boyko Kakaradov, Daniel Lokshtanov, Christina Boucher
2014	A	`conf`	Solving Multicut Faster Than 2 n. ESA Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2014	—	`conf`	Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2013	J	`jnl`	A O(c^k n) 5-Approximation Algorithm for Treewidth CoRR Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	A*	`conf`	An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	J	`jnl`	Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Clustering with local restrictions. Inf. Comput. Daniel Lokshtanov, Dániel Marx
2013	J	`jnl`	Computing Optimal Steiner Trees in Polynomial Space. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh
2013	J	`jnl`	Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2013	J	`jnl`	Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2013	B	`conf`	Faster Exact Algorithms for Some Terminal Set Problems. IPEC Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2013	J	`jnl`	Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	B	`conf`	Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
2013	J	`jnl`	Imbalance is fixed parameter tractable. Inf. Process. Lett. Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2013	J	`jnl`	Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013	A	`conf`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013	J	`jnl`	Minimum Bisection is fixed parameter tractable. CoRR Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2013	—	`conf`	Near-Optimal Bounds for Cross-Validation via Loss Stability. ICML (1) Ravi Kumar, Daniel Lokshtanov, Sergei Vassilvitskii, Andrea Vattani
2013	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2013	B	`conf`	On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. IPEC Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2013	B	`conf`	On the Ordered List Subgraph Embedding Problems. IPEC Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
2013	A	`conf`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2013	J	`jnl`	Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2013	B	`conf`	The Fine Details of Fast Dynamic Programming over Tree Decompositions. IPEC Hans L. Bodlaender, Paul S. Bonsma, Daniel Lokshtanov
2013	J	`jnl`	Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2012	A*	`conf`	Bidimensionality and geometric graphs. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2012	J	`jnl`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2012	J	`jnl`	Cops and Robber Game Without Recharging. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2012	J	`jnl`	Faster Parameterized Algorithms using Linear Programming CoRR Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	J	`jnl`	Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao
2012	J	`jnl`	Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2012	—	`conf`	Kernelization - Preprocessing with a Guarantee. The Multivariate Algorithmic Revolution and Beyond Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	A*	`conf`	Linear kernels for (connected) dominating set on SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	Local search: Is brute-force avoidable? J. Comput. Syst. Sci. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger
2012	A	`conf`	On Problems as Hard as CNF-SAT. CCC Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2012	J	`jnl`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs CoRR Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2012	—	`conf`	Parameterized Tractability of Multiway Cut with Parity Constraints. ICALP (1) Daniel Lokshtanov, M. S. Ramanujan
2012	J	`jnl`	Planar F-Deletion: Approximation and Optimal FPT Algorithms CoRR Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	A*	`conf`	Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	J	`jnl`	Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh
2012	—	`conf`	Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. FSTTCS Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström
2011	J	`jnl`	A linear kernel for planar connected dominating set. Theor. Comput. Sci. Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2011	J	`jnl`	An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2011	J	`jnl`	Bandwidth on AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2011	A*	`conf`	Bidimensionality and EPTAS. SODA Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	Bidimensionality and Geometric Graphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2011	—	`conf`	Clustering with Local Restrictions. ICALP (1) Daniel Lokshtanov, Dániel Marx
2011	J	`jnl`	Contracting Graphs to Paths and Trees CoRR Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	Contracting Graphs to Paths and Trees. IPEC Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	J	`jnl`	Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
2011	B	`conf`	Feedback Vertex Set in Mixed Graphs. WADS Paul S. Bonsma, Daniel Lokshtanov
2011	J	`jnl`	Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2011	A	`conf`	Hitting forbidden minors: Approximation and Kernelization. STACS Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2011	B	`conf`	Kernelization: An Overview. FCT Daniel Lokshtanov
2011	A*	`conf`	Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. SODA Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Lower bounds based on the Exponential Time Hypothesis. Bull. EATCS Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges CoRR Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	—	`conf`	Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	On Cutwidth Parameterized by Vertex Cover. IPEC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2011	J	`jnl`	On Problems as Hard as CNFSAT CoRR Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2011	B	`conf`	On the Hardness of Losing Width. IPEC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2011	J	`jnl`	On the complexity of reconstructing J. Graph Theory Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2011	J	`jnl`	On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011	J	`jnl`	On the directed Full Degree Spanning Tree problem. Discret. Optim. Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2011	J	`jnl`	Outlier Detection for DNA Fragment Assembly CoRR Christina Boucher, Christine Lo, Daniel Lokshtanov
2011	B	`conf`	Planar k-Path in Subexponential Time and Polynomial Space. WG Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2011	A*	`conf`	Slightly Superexponential Parameterized Problems. SODA Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Subexponential algorithms for partial cover problems. Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	—	`conf`	Tight Bounds for Linkages in Planar Graphs. ICALP (1) Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2011	J	`jnl`	Treewidth governs the complexity of target set selection. Discret. Optim. Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman
2010	A*	`conf`	Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010	B	`conf`	Algorithmic Lower Bounds for Problems on Decomposable Graphs. MFCS Daniel Lokshtanov
2010	J	`jnl`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs CoRR Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	A	`conf`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	J	`jnl`	Bidimensionality and EPTAS CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	A*	`conf`	Bidimensionality and Kernels. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010	J	`jnl`	Characterizing and computing minimal cograph completions. Discret. Appl. Math. Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
2010	B	`conf`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2010	—	`conf`	Cops and Robber Game without Recharging. SWAT Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2010	—	`conf`	Determining the Winner of a Dodgson Election is Hard. FSTTCS Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh
2010	A*	`conf`	Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	J	`jnl`	Feedback Vertex Set in Mixed Graphs CoRR Paul S. Bonsma, Daniel Lokshtanov
2010	—	`conf`	Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	B	`conf`	Generalized Graph Clustering: Recognizing ( WG Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
2010	J	`jnl`	Hitting forbidden minors: Approximation and Kernelization CoRR Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2010	Misc	`conf`	Imbalance Is Fixed Parameter Tractable. COCOON Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2010	J	`jnl`	Intractability of Clique-Width Parameterizations. SIAM J. Comput. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010	J	`jnl`	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal CoRR Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2010	J	`jnl`	On the complexity of computing treelength. Discret. Appl. Math. Daniel Lokshtanov
2010	C	`conf`	Ranking and Drawing in Subexponential Time. IWOCA Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
2010	A*	`conf`	Saving space by algebraization. STOC Daniel Lokshtanov, Jesper Nederlof
2010	B	`conf`	Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh
2009	J	`jnl`	(Meta) Kernelization CoRR Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	A*	`conf`	(Meta) Kernelization. FOCS Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	B	`conf`	An Exact Algorithm for Minimum Distortion Embedding. WG Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2009	A*	`conf`	An exact almost optimal algorithm for target set selection in social networks. EC Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman
2009	B	`conf`	Bandwidth on AT-Free Graphs. ISAAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2009	A*	`conf`	Clique-width: on the price of generality. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2009	—	`conf`	Distortion Is Fixed Parameter Tractable. ICALP (1) Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2009	—	`conf`	Even Faster Algorithm for Set Splitting! IWPEC Daniel Lokshtanov, Saket Saurabh
2009	—	`conf`	Fast FAST. ICALP (1) Noga Alon, Daniel Lokshtanov, Saket Saurabh
2009	J	`jnl`	Faster Algorithms for Finding and Counting Subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh
2009	J	`jnl`	Finding the longest isometric cycle in a graph. Discret. Appl. Math. Daniel Lokshtanov
2009	B	`conf`	Guard Games on Graphs: Keep the Intruder Out! WAOA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2009	—	`conf`	Incompressibility through Colors and IDs. ICALP (1) Michael Dom, Daniel Lokshtanov, Saket Saurabh
2009	A	`conf`	Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2009	C	`conf`	Linear Kernel for Planar Connected Dominating Set. TAMC Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2009	A*	`conf`	Local Search: Is Brute-Force Avoidable? IJCAI Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2009	—	`conf`	On the Directed Degree-Preserving Spanning Tree Problem. IWPEC Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009	—	`conf`	Planar Capacitated Dominating Set Is IWPEC Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
2009	C	`conf`	Simpler Parameterized Algorithm for OCT. IWOCA Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar
2009	—	`conf`	Subexponential Algorithms for Partial Cover Problems. FSTTCS Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2009	J	`jnl`	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
2008	—	`conf`	Capacitated Domination and Covering: A Parameterized Perspective. IWPEC Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2008	Misc	`conf`	Characterizing and Computing Minimal Cograph Completions. FAW Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
2008	B	`conf`	Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
2008	B	`conf`	Graph Layout Problems Parameterized by Vertex Cover. ISAAC Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
2008	J	`jnl`	Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2008	B	`conf`	On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2008	J	`jnl`	Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2008	—	`conf`	Wheel-Free Deletion Is W[2]-Hard. IWPEC Daniel Lokshtanov
2007	B	`conf`	On the Complexity of Computing Treelength. MFCS Daniel Lokshtanov
2007	C	`conf`	On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2006	J	`jnl`	Optimal broadcast domination in polynomial time. Discret. Math. Pinar Heggernes, Daniel Lokshtanov
2005	—	`conf`	Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. ACiD Daniel Lokshtanov, Christian Sloper
2005	B	`conf`	Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. WG Pinar Heggernes, Daniel Lokshtanov