pith. sign in

Daniel Lokshtanov

Identifiers

  • name variant Daniel Lokshtanov 0.60 · backfill

Papers (74)

  1. Parameterized Approximation of Rectangle Stabbing cs.CG · 2026 · author #3
  2. Induced Minors and Coarse Tree Decompositions math.CO · 2026 · author #4
  3. (Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence math.CO · 2025 · author #3
  4. A Brief Note on Single Source Fault Tolerant Reachability cs.DS · 2019 · author #1
  5. Decomposition of Map Graphs with Applications cs.DS · 2019 · author #2
  6. Slightly Superexponential Parameterized Problems cs.CC · 2019 · author #1
  7. Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals cs.DS · 2019 · author #3
  8. Going Far From Degeneracy cs.DS · 2019 · author #3
  9. A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments cs.DS · 2018 · author #1
  10. The Parameterized Complexity of Finding Point Sets with Hereditary Properties cs.CG · 2018 · author #2
  11. Approximation Schemes for Low-Rank Binary Matrix Approximation Problems cs.DS · 2018 · author #3
  12. A New Perspective on FO Model Checking of Dense Graph Classes cs.LO · 2018 · author #3
  13. Subexponential-time Algorithms for Maximum Independent Set in $P_t$-free and Broom-free Graphs cs.DS · 2018 · author #2
  14. Reducing CMSO Model Checking to Highly Connected Graphs cs.DS · 2018 · author #1
  15. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces cs.CG · 2017 · author #3
  16. Clustering with Local Restrictions cs.DS · 2017 · author #1
  17. Balanced Judicious Partition is Fixed-Parameter Tractable cs.DS · 2017 · author #1
  18. Covering vectors by spaces: Regular matroids cs.DS · 2017 · author #3
  19. Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion cs.DS · 2017 · author #2
  20. Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems cs.DS · 2017 · author #2
  21. The complexity of independent set reconfiguration on bipartite graphs cs.CC · 2017 · author #1
  22. Packing Cycles Faster Than Erd\H{o}s-P\'osa cs.DS · 2017 · author #1
  23. Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms cs.DS · 2017 · author #1
  24. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs cs.DS · 2017 · author #2
  25. Parameterized Complexity and Approximability of Directed Odd Cycle Transversal cs.DS · 2017 · author #1
  26. The Half-integral Erd\"os-P\'osa Property for Non-null Cycles cs.DM · 2017 · author #1
  27. Below all subsets for Minimal Connected Dominating Set cs.DS · 2016 · author #1
  28. A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set cs.DS · 2016 · author #1
  29. Spanning Circuits in Regular Matroids cs.DS · 2016 · author #3
  30. A Linear Time Parameterized Algorithm for Node Unique Label Cover cs.DS · 2016 · author #1
  31. Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering cs.DS · 2016 · author #2
  32. Lossy Kernelization cs.DS · 2016 · author #1
  33. The Structure of $W_4$-Immersion-Free Graphs math.CO · 2016 · author #3
  34. Exact Algorithms via Monotone Local Search cs.DS · 2015 · author #3
  35. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth cs.DS · 2015 · author #2
  36. Parameterized Integer Quadratic Programming: Variables and Coefficients cs.DS · 2015 · author #1
  37. A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion cs.DS · 2015 · author #3
  38. Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments cs.DS · 2015 · author #2
  39. Simultaneous Feedback Vertex Set: A Parameterized Perspective cs.DS · 2015 · author #2
  40. Lower bounds for approximation schemes for Closest String cs.DS · 2015 · author #2
  41. Independence and Efficient Domination on $P_6$-free Graphs cs.DS · 2015 · author #1
  42. On the Threshold of Intractability cs.DS · 2015 · author #3
  43. FO Model Checking on Posets of Bounded Width cs.LO · 2015 · author #3
  44. Reconfiguration on sparse graphs cs.CC · 2015 · author #1
  45. Uniform Kernelization Complexity of Hitting Forbidden Minors cs.DS · 2015 · author #3
  46. Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints cs.DS · 2014 · author #2
  47. Kernelization and Sparseness: the case of Dominating Set cs.DS · 2014 · author #5
  48. Parameterized Complexity of Bandwidth on Trees cs.DS · 2014 · author #2
  49. Deterministic Truncation of Linear Matroids cs.DS · 2014 · author #1
  50. Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth cs.DS · 2014 · author #1
  51. Representative Sets of Product Families cs.DS · 2014 · author #2
  52. Minimum Bisection is fixed parameter tractable cs.DS · 2013 · author #2
  53. Irrelevant Vertices for the Planar Disjoint Paths Problem math.CO · 2013 · author #4
  54. Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation) cs.DS · 2013 · author #2
  55. A O(c^k n) 5-Approximation Algorithm for Treewidth cs.DS · 2013 · author #5
  56. Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms cs.DS · 2013 · author #2
  57. Parameterized Complexity of Directed Steiner Tree on Sparse Graphs cs.DS · 2012 · author #2
  58. Kernels for (connected) Dominating Set on graphs with Excluded Topological subgraphs cs.DS · 2012 · author #2
  59. SeeSite: Efficiently Finding Co-occurring Splice Sites and Exon Splicing Enhancers q-bio.QM · 2012 · author #3
  60. Faster Parameterized Algorithms using Linear Programming cs.DS · 2012 · author #1
  61. On Problems as Hard as CNFSAT cs.DS · 2011 · author #3
  62. Outlier Detection for DNA Fragment Assembly cs.DS · 2011 · author #3
  63. Bidimensionality and Geometric Graphs cs.DS · 2011 · author #2
  64. Contracting Graphs to Paths and Trees cs.DS · 2011 · author #4
  65. Obtaining a Bipartite Graph by Contracting Few Edges cs.DS · 2011 · author #3
  66. Feedback Vertex Set in Mixed Graphs cs.DS · 2010 · author #2
  67. Hitting forbidden minors: Approximation and Kernelization cs.DS · 2010 · author #2
  68. Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal cs.DS · 2010 · author #1
  69. Bidimensionality and EPTAS cs.DS · 2010 · author #2
  70. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs cs.DS · 2010 · author #3
  71. Faster Algorithms for Finding and Counting Subgraphs cs.DS · 2009 · author #2
  72. (Meta) Kernelization cs.DM · 2009 · author #3
  73. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves cs.DS · 2008 · author #3
  74. Parameterized Low-distortion Embeddings - Graph metrics into lines and trees cs.DS · 2008 · author #3

Mentions

  • 1511.01379 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1511.00310 #1 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1510.08154 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1510.07676 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1510.01557 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1509.05809 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1507.02163 #1 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1505.00612 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1504.04115 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1502.04803 #1 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1502.03965 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1411.6756 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1411.4575 #5 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1404.7810 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1404.4506 #1 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1404.0818 #1 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1402.3909 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1311.2563 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1310.2378 #4 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1309.7891 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1304.6321 #5 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1304.4626 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1210.0260 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1210.0257 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1206.5846 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1203.0833 #1 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1112.2275 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1111.0376 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1107.2221 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1104.3677 #4 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1102.5441 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1010.5974 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1010.1365 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1007.5450 #1 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1005.5449 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 1001.0821 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 0912.2371 #2 · backfill · confidence 0.70 Daniel Lokshtanov
  • 0904.0727 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 0810.4796 #3 · backfill · confidence 0.70 Daniel Lokshtanov
  • 0804.3028 #3 · backfill · confidence 0.70 Daniel Lokshtanov

Frequent Coauthors