The SCEAS System
Navigation Menu

Search the dblp DataBase


Daniel Lokshtanov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Lokshtanov, Christian Sloper
    Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:105-113 [Conf]
  2. Pinar Heggernes, Daniel Lokshtanov
    Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:187-198 [Conf]
  3. Pinar Heggernes, Daniel Lokshtanov
    Optimal broadcast domination in polynomial time. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3267-3280 [Journal]
  4. Daniel Lokshtanov
    On the Complexity of Computing Treelength. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:276-287 [Conf]
  5. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
    On the Complexity of Some Colorful Problems Parameterized by Treewidth. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:366-377 [Conf]

  6. Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. [Citation Graph (, )][DBLP]

  7. Imbalance Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]

  8. (Meta) Kernelization. [Citation Graph (, )][DBLP]

  9. Subexponential Algorithms for Partial Cover Problems. [Citation Graph (, )][DBLP]

  10. Incompressibility through Colors and IDs. [Citation Graph (, )][DBLP]

  11. Distortion Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]

  12. Fast FAST. [Citation Graph (, )][DBLP]

  13. Local Search: Is Brute-Force Avoidable? [Citation Graph (, )][DBLP]

  14. Bandwidth on AT-Free Graphs. [Citation Graph (, )][DBLP]

  15. Graph Layout Problems Parameterized by Vertex Cover. [Citation Graph (, )][DBLP]

  16. Wheel-Free Deletion Is W[2]-Hard. [Citation Graph (, )][DBLP]

  17. Even Faster Algorithm for Set Splitting! [Citation Graph (, )][DBLP]

  18. Capacitated Domination and Covering: A Parameterized Perspective. [Citation Graph (, )][DBLP]

  19. On the Directed Degree-Preserving Spanning Tree Problem. [Citation Graph (, )][DBLP]

  20. Planar Capacitated Dominating Set Is W[1]-Hard. [Citation Graph (, )][DBLP]

  21. Sharp Separation and Applications to Exact and Parameterized Algorithms. [Citation Graph (, )][DBLP]

  22. On the Complexity of Reconstructing H -free Graphs from Their Star Systems. [Citation Graph (, )][DBLP]

  23. Algorithmic Lower Bounds for Problems on Decomposable Graphs. [Citation Graph (, )][DBLP]

  24. An exact almost optimal algorithm for target set selection in social networks. [Citation Graph (, )][DBLP]

  25. Clique-width: on the price of generality. [Citation Graph (, )][DBLP]

  26. Bidimensionality and Kernels. [Citation Graph (, )][DBLP]

  27. Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. [Citation Graph (, )][DBLP]

  28. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. [Citation Graph (, )][DBLP]

  29. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. [Citation Graph (, )][DBLP]

  30. Saving space by algebraization. [Citation Graph (, )][DBLP]

  31. Cops and Robber Game without Recharging. [Citation Graph (, )][DBLP]

  32. Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. [Citation Graph (, )][DBLP]

  33. Linear Kernel for Planar Connected Dominating Set. [Citation Graph (, )][DBLP]

  34. Guard Games on Graphs: Keep the Intruder Out! [Citation Graph (, )][DBLP]

  35. An Exact Algorithm for Minimum Distortion Embedding. [Citation Graph (, )][DBLP]

  36. Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. [Citation Graph (, )][DBLP]

  37. Characterizing and Computing Minimal Cograph Completions. [Citation Graph (, )][DBLP]

  38. Simpler Parameterized Algorithm for OCT. [Citation Graph (, )][DBLP]

  39. Parameterized Low-distortion Embeddings - Graph metrics into lines and trees [Citation Graph (, )][DBLP]

  40. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves [Citation Graph (, )][DBLP]

  41. (Meta) Kernelization [Citation Graph (, )][DBLP]

  42. Faster Algorithms for Finding and Counting Subgraphs [Citation Graph (, )][DBLP]

  43. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [Citation Graph (, )][DBLP]

  44. Bidimensionality and EPTAS [Citation Graph (, )][DBLP]

  45. Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal [Citation Graph (, )][DBLP]

  46. Finding the longest isometric cycle in a graph. [Citation Graph (, )][DBLP]

  47. Characterizing and computing minimal cograph completions. [Citation Graph (, )][DBLP]

  48. On the complexity of computing treelength. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002