The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Dimitrios M. Thilikos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hannes Moser, Dimitrios M. Thilikos
    Parameterized Complexity of Finding Regular Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:107-118 [Conf]
  2. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:67-80 [Conf]
  3. Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
    Isomorphism for Graphs of Bounded Distance Width. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:276-287 [Conf]
  4. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Counting H-Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:298-307 [Conf]
  5. Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    Partial Arc Consistency. [Citation Graph (0, 0)][DBLP]
    Over-Constrained Systems, 1995, pp:229-236 [Conf]
  6. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
    On Exact Algorithms for Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:672-683 [Conf]
  7. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:275-286 [Conf]
  8. Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
    Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  9. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating Sets and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:221-229 [Conf]
  10. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:380-390 [Conf]
  11. Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos
    H-Colorings of Large Degree Graphs. [Citation Graph (0, 0)][DBLP]
    EurAsia-ICT, 2002, pp:850-857 [Conf]
  12. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:210-224 [Conf]
  13. Hans L. Bodlaender, Dimitrios M. Thilikos
    Constructive Linear Time Algorithms for Branchwidth. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:627-637 [Conf]
  14. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:829-844 [Conf]
  15. Fedor V. Fomin, Dimitrios M. Thilikos
    Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:581-592 [Conf]
  16. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:262-273 [Conf]
  17. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:192-203 [Conf]
  18. Hans L. Bodlaender, Dimitrios M. Thilikos
    Computing Small Search Numbers in Linear Time. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:37-48 [Conf]
  19. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Smaller Kernels for Hitting Set Problems of Constant Arity. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:121-126 [Conf]
  20. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:109-118 [Conf]
  21. Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
    Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:239-248 [Conf]
  22. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    The Bidimensional Theory of Bounded-Genus Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:191-203 [Conf]
  23. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    (H, C, K)-Coloring: Fast, Easy, and Hard Cases. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:304-315 [Conf]
  24. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:830-839 [Conf]
  25. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating sets in planar graphs: branch-width and exponential speed-up. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:168-177 [Conf]
  26. Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos
    Stability and non-stability of the FIFO protocol. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:48-52 [Conf]
  27. Josep Díaz, Dimitrios M. Thilikos
    Fast FPT-Algorithms for Cleaning Grids. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:361-371 [Conf]
  28. Fedor V. Fomin, Dimitrios M. Thilikos
    A Simple and Fast Approach for Solving Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:56-67 [Conf]
  29. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:172-183 [Conf]
  30. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:125-138 [Conf]
  31. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:75-86 [Conf]
  32. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Parameterized Counting Algorithms for General Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:99-109 [Conf]
  33. Josep Díaz, Jordi Petit, Dimitrios M. Thilikos
    Kernels for the Vertex Cover Problem on the Preferred Attachment Model. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:231-240 [Conf]
  34. Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos
    Searching Is Not Jumping. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:34-45 [Conf]
  35. Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen
    On Interval Routing Schemes and Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:181-196 [Conf]
  36. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
    Fugitive-Search Games on Graphs and Related Parameters. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:331-342 [Conf]
  37. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    The Complexity of Restrictive H-Coloring. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:126-137 [Conf]
  38. Fedor V. Fomin, Dimitrios M. Thilikos
    On the Monotonicity of Games Generated by Symmetric Submodular Functions. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:177-188 [Conf]
  39. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:303-312 [Conf]
  40. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:4, pp:245-267 [Journal]
  41. Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
    Isomorphism for Graphs of Bounded Distance Width. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:2, pp:105-127 [Journal]
  42. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints. [Citation Graph (0, 0)][DBLP]
    Constraints, 2000, v:5, n:3, pp:251-273 [Journal]
  43. Hans L. Bodlaender, Dimitrios M. Thilikos
    Treewidth for Graphs with Small Chordality. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:45-61 [Journal]
  44. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    The restrictive H-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:297-305 [Journal]
  45. Fedor V. Fomin, Dimitrios M. Thilikos
    On the monotonicity of games generated by symmetric submodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:323-335 [Journal]
  46. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:229-245 [Journal]
  47. Dimitrios M. Thilikos
    Algorithms and obstructions for linear-width and related search parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:105, n:1-3, pp:239-271 [Journal]
  48. Maria J. Serna, Dimitrios M. Thilikos
    Parameterized Complexity for Graph Layout Problems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:86, n:, pp:41-65 [Journal]
  49. Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos
    On Interval Routing Schemes and Treewidth. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:1, pp:92-109 [Journal]
  50. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:445-465 [Journal]
  51. Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki
    It is Hard to Know when Greedy is Good for Finding Independent Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:2, pp:101-111 [Journal]
  52. Dimitrios M. Thilikos, Hans L. Bodlaender
    Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:5, pp:227-232 [Journal]
  53. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:866-893 [Journal]
  54. Hans L. Bodlaender, Dimitrios M. Thilikos
    Graphs with Branchwidth at Most Three. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:2, pp:167-194 [Journal]
  55. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:69-108 [Journal]
  56. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Cutwidth I: A linear time fixed parameter algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:1, pp:1-24 [Journal]
  57. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Cutwidth II: Algorithms for partial w-trees of bounded degree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:1, pp:25-49 [Journal]
  58. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:166-195 [Journal]
  59. Fedor V. Fomin, Dimitrios M. Thilikos
    A 3-approximation for the pathwidth of Halin graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:499-510 [Journal]
  60. Lefteris M. Kirousis, Dimitrios M. Thilikos
    The Linkage of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:3, pp:626-647 [Journal]
  61. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:281-309 [Journal]
  62. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:501-511 [Journal]
  63. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:33-47 [Journal]
  64. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
    Fugitive-Search Games on Graphs and Related Parameters. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:233-254 [Journal]
  65. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Counting H-colorings of partial k-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:291-309 [Journal]
  66. Fedor V. Fomin, Dimitrios M. Thilikos
    New upper bounds on the decomposability of planar graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:1, pp:53-81 [Journal]
  67. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Subexponential Parameterized Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:15-27 [Conf]
  68. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Complexity issues on bounded restrictive H-coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2082-2093 [Journal]

  69. Contraction Bidimensionality: The Accurate Picture. [Citation Graph (, )][DBLP]


  70. Contractions of Planar Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  71. Fast Minor Testing in Planar Graphs. [Citation Graph (, )][DBLP]


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


  73. Dynamic Programming for Graphs on Surfaces. [Citation Graph (, )][DBLP]


  74. Induced Packing of Odd Cycles in a Planar Graph. [Citation Graph (, )][DBLP]


  75. Parameterizing Cut Sets in a Graph by the Number of Their Components. [Citation Graph (, )][DBLP]


  76. Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. [Citation Graph (, )][DBLP]


  77. Catalan structures and dynamic programming in H-minor-free graphs. [Citation Graph (, )][DBLP]


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


  79. On Contracting Graphs to Fixed Pattern Graphs. [Citation Graph (, )][DBLP]


  80. Approximating Acyclicity Parameters of Sparse Hypergraphs. [Citation Graph (, )][DBLP]


  81. Faster Parameterized Algorithms for Minor Containment. [Citation Graph (, )][DBLP]


  82. Graph Searching in a Crime Wave. [Citation Graph (, )][DBLP]


  83. Searching for a Visible, Lazy Fugitive. [Citation Graph (, )][DBLP]


  84. Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. [Citation Graph (, )][DBLP]


  85. Improving the gap of Erdös-Pósa property for minor-closed graph classes. [Citation Graph (, )][DBLP]


  86. On Self-Duality of Branchwidth in Graphs of Bounded Genus. [Citation Graph (, )][DBLP]


  87. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


  88. Approximating acyclicity parameters of sparse hypergraphs [Citation Graph (, )][DBLP]


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


  90. A note on the subgraphs of the (2× INFINITY )-grid. [Citation Graph (, )][DBLP]


  91. Rank-width and tree-width of H-minor-free graphs. [Citation Graph (, )][DBLP]


Search in 0.212secs, Finished in 0.215secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002