The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Daniel Lokshantov Daniel Lokshtanov ( http://dblp.L3S.de/Authors/Daniel_Lokshantov )

URL (Homepage):  http://www.ii.uib.no/~daniello/  Author page on DBLP  Author page in RDF  Community of Daniel Lokshantov in ASPL-2

Publication years (Num. hits)
2005-2009 (34) 2010 (22) 2011 (29) 2012 (17) 2013 (22) 2014 (25) 2015 (24) 2016 (29) 2017 (35) 2018 (39) 2019 (10)
Publication types (Num. hits)
article(149) book(1) incollection(1) inproceedings(134) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(73) SODA(23) ACM Trans. Algorithms(16) IPEC(13) SIAM J. Discrete Math.(12) ICALP (1)(11) STACS(10) FSTTCS(8) Algorithmica(7) ESA(7) WG(7) FOCS(6) ICALP(6) IWPEC(5) SIAM J. Comput.(5) Inf. Comput.(4) More (+10 of total 56)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 13 keywords

Results
Found 287 publication records. Showing 286 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Gá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. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad The Complexity of Independent Set Reconfiguration on Bipartite Graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001 Slightly Superexponential Parameterized Problems. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Going Far From Degeneracy. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Decomposition of Map Graphs with Applications. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Long directed (s, t)-path: FPT algorithm. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001 Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001 Reconfiguration on sparse graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001 Deterministic Truncation of Linear Matroids. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen Independence and Efficient Domination on P6-free Graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001 Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh 0001, Meirav Zehavi Matrix Rigidity from the Viewpoint of Parameterized Complexity. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001 Below All Subsets for Minimal Connected Dominating Set. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh 0001 Kernelization of Cycle Packing with Relaxed Disjointness Constraints. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Covering Vectors by Spaces: Regular Matroids. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh 0001 Randomized contractions meet lean decompositions. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1David Eppstein, Daniel Lokshtanov The Parameterized Complexity of Finding Point Sets with Hereditary Properties. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan A New Perspective on FO Model Checking of Dense Graph Classes. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi Reducing CMSO Model Checking to Highly Connected Graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Gá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. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh 0001 A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh 0001 Simultaneous Feedback Vertex Set: A Parameterized Perspective. Search on Bibsonomy TOCT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001 Slightly Superexponential Parameterized Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Erdös-Pósa Property of Obstructions to Interval Graphs. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi Reducing CMSO Model Checking to Highly Connected Graphs. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad The complexity of independent set reconfiguration on bipartite graphs. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. Search on Bibsonomy SODA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Eppstein, Daniel Lokshtanov The Parameterized Complexity of Finding Point Sets with Hereditary Properties. Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh 0001 A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Naomi Nishimura (eds.) 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  BibTeX  RDF
1Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Anastasios Sidiropoulos Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh 0001 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001 A Polynomial Sized Kernel for Tracking Paths Problem. Search on Bibsonomy LATIN The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Quick but Odd Growth of Cacti. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh 0001 Faster exact algorithms for some terminal set problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh 0001 Uniform Kernelization Complexity of Hitting Forbidden Minors. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Representative Families of Product Families. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh 0001 Hitting Selected (Odd) Cycles. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Ondrej Suchý Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Anastasios Sidiropoulos Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Balanced Judicious Partition is Fixed-Parameter Tractable. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Covering vectors by spaces: Regular matroids. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 The Half-integral Erdös-Pósa Property for Non-null Cycles. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad The complexity of independent set reconfiguration on bipartite graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh 0001, Meirav Zehavi Packing Cycles Faster Than Erdős-Pósa. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Dániel Marx Clustering with Local Restrictions. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos Irrelevant vertices for the planar Disjoint Paths Problem. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Split Contraction: The Untold Story. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh 0001, Meirav Zehavi Matrix Rigidity from the Viewpoint of Parameterized Complexity. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001 Lossy kernelization. Search on Bibsonomy STOC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry Faster and Enhanced Inclusion-Minimal Cograph Completion. Search on Bibsonomy COCOA (1) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Covering Vectors by Spaces: Regular Matroids. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh 0001, Meirav Zehavi Packing Cycles Faster Than Erdos-Posa. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001, Marcin Wrochna Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu Beating Brute Force for Systems of Polynomial Equations over Finite Fields. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Spanning Circuits in Regular Matroids. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 A Linear-Time Parameterized Algorithm for Node Unique Label Cover. Search on Bibsonomy ESA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, R. Krithika 0001, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan On the Parameterized Complexity of Simultaneous Deletion Problems. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Balanced Judicious Bipartition is Fixed-Parameter Tractable. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic On the Ordered List Subgraph Embedding Problems. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. Search on Bibsonomy J. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh 0001, Dimitrios M. Thilikos (Meta) Kernelization. Search on Bibsonomy J. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh 0001, Magnus Wahlström On Problems as Hard as CNF-SAT. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh 0001, Ondrej Suchý Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 Hitting Forbidden Minors: Approximation and Kernelization. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mithilesh Kumar 0001, Daniel Lokshtanov A 2ℓk Kernel for ℓ-Component Order Connectivity. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001 Below all subsets for Minimal Connected Dominating Set. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001 Lossy Kernelization. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Spanning Circuits in Regular Matroids. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001 A Linear Time Parameterized Algorithm for Node Unique Label Cover. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos Bidimensionality and Kernels. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Hans 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. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov Kernelization, Bidimensionality and Kernels. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 286 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license