Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Dimitrios M. Thilikos
2010 – today
- 2013
[j83]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Characterizing graphs of small carving-width. Discrete Applied Mathematics 161(13-14): 1888-1893 (2013)- [j82]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Asymptotic enumeration of non-crossing partitions on surfaces. Discrete Mathematics 313(5): 635-649 (2013)
- [j81]Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis: D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst. 35(2): 311-343 (2013)
- [j80]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. 481: 74-84 (2013)
- [c76]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos: A linear kernel for planar red-blue dominating set. CTW 2013: 117-120
- [c75]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS 2013: 92-103
- [i11]Jean-Florent Raymond, Dimitrios M. Thilikos: Low Polynomial Exclusion of Planar Graph Patterns. CoRR abs/1305.7112 (2013)
- 2012
- [j79]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012)
- [j78]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Containment relations in split graphs. Discrete Applied Mathematics 160(1-2): 155-163 (2012)
- [j77]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On graph contractions and induced minors. Discrete Applied Mathematics 160(6): 799-809 (2012)
- [j76]Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos: LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Discrete Applied Mathematics 160(15): 2089-2097 (2012)
- [j75]Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos: Outerplanar obstructions for a feedback vertex set. Eur. J. Comb. 33(5): 948-968 (2012)
- [j74]Zdenek Dvorak, Archontia C. Giannopoulou, Dimitrios M. Thilikos: Forbidden graphs for tree-depth. Eur. J. Comb. 33(5): 969-979 (2012)
- [j73]Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos: Connected graph searching. Inf. Comput. 219: 1-16 (2012)
- [j72]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Catalan structures and dynamic programming in H-minor-free graphs. J. Comput. Syst. Sci. 78(5): 1606-1622 (2012)
- [j71]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012)
- [j70]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On exact algorithms for treewidth. ACM Transactions on Algorithms 9(1): 12 (2012)
- [j69]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. 420: 28-35 (2012)
- [j68]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 463: 1 (2012)
- [c74]Dimitrios M. Thilikos: Graph Minors and Parameterized Algorithm Design. The Multivariate Algorithmic Revolution and Beyond 2012: 228-256
- [c73]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370
- [c72]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Dynamic Programming for H-minor-free Graphs. COCOON 2012: 86-97
- [c71]Christos Giatsidis, Klaus Berberich, Dimitrios M. Thilikos, Michalis Vazirgiannis: Visual exploration of collaboration networks based on graph degeneracy. KDD 2012: 1512-1515
- [c70]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Linear kernels for (connected) dominating set on H-minor-free graphs. SODA 2012: 82-93
- [c69]Marcin Kaminski, Dimitrios M. Thilikos: Contraction checking in graphs on surfaces. STACS 2012: 182-193
- [e2]Dimitrios M. Thilikos, Gerhard J. Woeginger (Eds.): Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. Lecture Notes in Computer Science 7535, Springer 2012, ISBN 978-3-642-33292-0
- [i10]Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos: Forbidding Kuratowski Graphs as Immersions. CoRR abs/1207.5329 (2012)
- [i9]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. CoRR abs/1210.0257 (2012)
- 2011
- [j67]Athanassios Koutsonas, Dimitrios M. Thilikos: Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. Algorithmica 60(4): 987-1003 (2011)
- [j66]Rodney G. Downey, Dimitrios M. Thilikos: Confronting intractability via parameters. Computer Science Review 5(4): 279-317 (2011)
- [j65]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: On disconnected cuts and separators. Discrete Applied Mathematics 159(13): 1345-1351 (2011)
- [j64]Ignasi Sau, Dimitrios M. Thilikos: On self-duality of branchwidth in graphs of bounded genus. Discrete Applied Mathematics 159(17): 2184-2186 (2011)
- [j63]Petr A. Golovach, Dimitrios M. Thilikos: Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discrete Optimization 8(1): 72-86 (2011)
- [j62]Archontia C. Giannopoulou, Dimitrios M. Thilikos: A min-max theorem for LIFO-search. Electronic Notes in Discrete Mathematics 38: 395-400 (2011)
- [j61]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Lift Contractions. Electronic Notes in Discrete Mathematics 38: 407-412 (2011)
- [j60]Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki: Outerplanar Obstructions for Matroid Pathwidth. Electronic Notes in Discrete Mathematics 38: 541-546 (2011)
- [j59]Nestor V. Nestoridis, Dimitrios M. Thilikos: Square Roots of Minor Closed Graph Classes. Electronic Notes in Discrete Mathematics 38: 681-686 (2011)
- [j58]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction obstructions for treewidth. J. Comb. Theory, Ser. B 101(5): 302-314 (2011)
- [j57]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms 9(3): 299-306 (2011)
- [j56]Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos: Strengthening Erdös-Pósa property for minor-closed graph classes. Journal of Graph Theory 66(3): 235-240 (2011)
- [j55]David Richerby, Dimitrios M. Thilikos: Searching for a Visible, Lazy Fugitive. SIAM J. Discrete Math. 25(2): 497-513 (2011)
- [j54]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Width Parameters of Hypergraphs with Excluded Minors. SIAM J. Discrete Math. 25(3): 1331-1348 (2011)
- [j53]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. 412(24): 2699 (2011)
- [j52]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. 412(45): 6340-6350 (2011)
- [j51]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011)
- [c68]Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis: Evaluating Cooperation in Communities with the k-Core Structure. ASONAM 2011: 87-93
- [c67]Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos: Odd cyclic surface separators in planar graphs. CTW 2011: 165-167
- [c66]Dimitrios M. Thilikos: Fast Sub-exponential Algorithms and Compactness in Planar Graphs. ESA 2011: 358-369
- [c65]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Tight Bounds for Linkages in Planar Graphs. ICALP (1) 2011: 110-121
- [c64]Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis: D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. ICDM 2011: 201-210
- [c63]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79
- [c62]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos: Planar Disjoint-Paths Completion. IPEC 2011: 80-93
- [c61]Carme Àlvarez, Amalia Duch, Maria J. Serna, Dimitrios M. Thilikos: On the Existence of Nash Equilibria in Strategic Search Games. TGC 2011: 58-72
- [i8]Archontia C. Giannopoulou, Dimitrios M. Thilikos: Optimizing the Graph Minors Weak Structure Theorem. CoRR abs/1102.5762 (2011)
- [i7]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Asymptotic Enumeration of Non-crossing Partitions on Surfaces. CoRR abs/1104.2477 (2011)
- [i6]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Dynamic Programming for Graphs on Surfaces. CoRR abs/1104.2486 (2011)
- [i5]Rodney G. Downey, Dimitrios M. Thilikos: Confronting Intractability via Parameters. CoRR abs/1106.3161 (2011)
- [i4]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports 1(2): 30-46 (2011)
- 2010
- [j50]Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos: A note on the subgraphs of the (2× INFINITY )-grid. Discrete Mathematics 310(3): 531-536 (2010)
- [j49]Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos: Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. 31(7): 1617-1628 (2010)
- [j48]Ignasi Sau, Dimitrios M. Thilikos: Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. J. Discrete Algorithms 8(3): 330-338 (2010)
- [c60]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109
- [c59]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contractions of Planar Graphs in Polynomial Time. ESA (1) 2010: 122-133
- [c58]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Dynamic Programming for Graphs on Surfaces. ICALP (1) 2010: 372-383
- [c57]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Bidimensionality and Kernels. SODA 2010: 503-510
- [c56]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514
- [c55]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333
- [c54]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximation Algorithms for Domination Search. WAOA 2010: 130-141
- [e1]Dimitrios M. Thilikos (Ed.): Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers. Lecture Notes in Computer Science 6410, 2010, ISBN 978-3-642-16925-0
- [i3]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations. CoRR abs/1012.2460 (2010)
2000 – 2009
- 2009
- [j47]Ignasi Sau, Dimitrios M. Thilikos: Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. Electronic Notes in Discrete Mathematics 32: 59-66 (2009)
- [j46]Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos: Outerplanar Obstructions for the Feedback Vertex Set. Electronic Notes in Discrete Mathematics 34: 167-171 (2009)
- [j45]Archontia C. Giannopoulou, Dimitrios M. Thilikos: Obstructions for Tree-depth. Electronic Notes in Discrete Mathematics 34: 249-253 (2009)
- [j44]Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. 75(4): 231-244 (2009)
- [j43]Hannes Moser, Dimitrios M. Thilikos: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7(2): 181-190 (2009)
- [j42]David Richerby, Dimitrios M. Thilikos: Graph Searching in a Crime Wave. SIAM J. Discrete Math. 23(1): 349-368 (2009)
- [c53]Ignasi Sau, Dimitrios M. Thilikos: On Self-Duality of Branchwidth in Graphs of Bounded Genus. CTW 2009: 19-22
- [c52]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717
- [c51]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. FOCS 2009: 629-638
- [c50]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523
- [c49]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC 2009: 605-615
- [c48]Petr A. Golovach, Dimitrios M. Thilikos: Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC 2009: 210-221
- [c47]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
- [i2]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. CoRR abs/0904.0727 (2009)
- 2008
- [j41]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. Algorithmica 52(2): 167-176 (2008)
- [j40]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential parameterized algorithms. Computer Science Review 2(1): 29-39 (2008)
- [j39]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: Efficient algorithms for counting parameterized list H-colorings. J. Comput. Syst. Sci. 74(5): 919-937 (2008)
- [j38]Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos: Forewords: Special issue on graph searching. Theor. Comput. Sci. 399(3): 157 (2008)
- [j37]Fedor V. Fomin, Dimitrios M. Thilikos: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3): 236-245 (2008)
- [c46]Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos: Improving the gap of Erdös-Pósa property for minor-closed graph classes. CTW 2008: 2-6
- [c45]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Catalan structures and dynamic programming in H-minor-free graphs. SODA 2008: 631-640
- [c44]Athanassios Koutsonas, Dimitrios M. Thilikos: Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. WG 2008: 264-274
- [c43]
- [r1]
- [i1]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs. CoRR abs/0809.3646 (2008)
- 2007
- [j36]Dimitrios M. Thilikos: Invitation to fixed-parameter algorithms. Computer Science Review 1(2): 103-104 (2007)
- [j35]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: Complexity issues on bounded restrictive H-coloring. Discrete Mathematics 307(16): 2082-2093 (2007)
- [j34]Fedor V. Fomin, Dimitrios M. Thilikos: On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory 55(1): 42-54 (2007)
- [c42]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Subexponential Parameterized Algorithms. ICALP 2007: 15-27
- [c41]
- 2006
- [j33]Fedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. J. Discrete Algorithms 4(4): 499-510 (2006)
- [j32]Fedor V. Fomin, Dimitrios M. Thilikos: New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51(1): 53-81 (2006)
- [j31]Fedor V. Fomin, Dimitrios M. Thilikos: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Comput. 36(2): 281-309 (2006)
- [j30]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discrete Math. 20(2): 357-371 (2006)
- [c40]Hannes Moser, Dimitrios M. Thilikos: Parameterized Complexity of Finding Regular Induced Subgraphs. ACiD 2006: 107-118
- [c39]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On Exact Algorithms for Treewidth. ESA 2006: 672-683
- [c38]
- [c37]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT 2006: 172-183
- [c36]Josep Díaz, Jordi Petit, Dimitrios M. Thilikos: Kernels for the Vertex Cover Problem on the Preferred Attachment Model. WEA 2006: 231-240
- 2005
- [j29]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. Algorithmica 41(4): 245-267 (2005)
- [j28]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: The restrictive H-coloring problem. Discrete Applied Mathematics 145(2): 297-305 (2005)
- [j27]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discrete Applied Mathematics 152(1-3): 229-245 (2005)
- [j26]Maria J. Serna, Dimitrios M. Thilikos: Parameterized Complexity for Graph Layout Problems. Bulletin of the EATCS 86: 41-65 (2005)
- [j25]Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca: Connected Graph Searching in Outerplanar Graphs. Electronic Notes in Discrete Mathematics 22: 213-216 (2005)
- [j24]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6): 866-893 (2005)
- [j23]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: Cutwidth I: A linear time fixed parameter algorithm. J. Algorithms 56(1): 1-24 (2005)
- [j22]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: Cutwidth II: Algorithms for partial w-trees of bounded degree. J. Algorithms 56(1): 25-49 (2005)
- [j21]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. ACM Transactions on Algorithms 1(1): 33-47 (2005)
- [c35]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Parameterized Counting Algorithms for General Graph Covering Problems. WADS 2005: 99-109
- 2004
- [j20]Fedor V. Fomin, Dimitrios M. Thilikos: A 3-approximation for the pathwidth of Halin graphs. Electronic Notes in Discrete Mathematics 17: 157-162 (2004)
- [j19]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. J. Comput. Syst. Sci. 69(2): 166-195 (2004)
- [j18]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. SIAM J. Discrete Math. 18(3): 501-511 (2004)
- [c34]Fedor V. Fomin, Dimitrios M. Thilikos: A 3-Approximation for the Pathwidth of Halin Graphs. CTW 2004: 137-141
- [c33]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. ESA 2004: 275-286
- [c32]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. ESA 2004: 311-322
- [c31]Fedor V. Fomin, Dimitrios M. Thilikos: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP 2004: 581-592
- [c30]Hans L. Bodlaender, Dimitrios M. Thilikos: Computing Small Search Numbers in Linear Time. IWPEC 2004: 37-48
- [c29]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126
- [c28]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118
- [c27]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203
- [c26]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. SODA 2004: 830-839
- [c25]Fedor V. Fomin, Dimitrios M. Thilikos: A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS 2004: 56-67
- 2003
- [j17]Fedor V. Fomin, Dimitrios M. Thilikos: On the monotonicity of games generated by symmetric submodular functions. Discrete Applied Mathematics 131(2): 323-335 (2003)
- [c24]
- [c23]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. ICALP 2003: 829-844
- [c22]Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS 2003: 239-248
- [c21]Fedor V. Fomin, Dimitrios M. Thilikos: Dominating sets in planar graphs: branch-width and exponential speed-up. SODA 2003: 168-177
- [c20]Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos: Searching Is Not Jumping. WG 2003: 34-45
- 2002
- [j16]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002)
- [j15]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: Counting H-colorings of partial k-trees. Theor. Comput. Sci. 281(1-2): 291-309 (2002)
- [c19]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. APPROX 2002: 67-80
- [c18]Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos: H-Colorings of Large Degree Graphs. EurAsia-ICT 2002: 850-857
- [c17]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. ISAAC 2002: 262-273
- [c16]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: The Complexity of Restrictive H-Coloring. WG 2002: 126-137
- 2001
- [j14]Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electronic Notes in Discrete Mathematics 10: 137-142 (2001)
- [c15]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: Counting H-Colorings of Partial k-Trees. COCOON 2001: 298-307
- [c14]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. ESA 2001: 380-390
- [c13]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: (H, C, K)-Coloring: Fast, Easy, and Hard Cases. MFCS 2001: 304-315
- [c12]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. SPAA 2001: 48-52
- [c11]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS 2001: 75-86
- [c10]Fedor V. Fomin, Dimitrios M. Thilikos: On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG 2001: 177-188
- 2000
- [j13]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. Constraints 5(3): 251-273 (2000)
- [j12]Dimitrios M. Thilikos: Algorithms and obstructions for linear-width and related search parameters. Discrete Applied Mathematics 105(1-3): 239-271 (2000)
- [j11]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000)
- [c9]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. ISAAC 2000: 192-203
- [c8]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. SWAT 2000: 125-138
1990 – 1999
- 1999
- [j10]Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos: Isomorphism for Graphs of Bounded Distance Width. Algorithmica 24(2): 105-127 (1999)
- [j9]Yannis C. Stamatiou, Dimitrios M. Thilikos: Monotonicity and inert fugitive search games. Electronic Notes in Discrete Mathematics 3: 184 (1999)
- [j8]Dimitrios M. Thilikos: Quickly Excluding K2, r from Planar Graphs. Electronic Notes in Discrete Mathematics 3: 189-194 (1999)
- [j7]Hans L. Bodlaender, Dimitrios M. Thilikos: Graphs with Branchwidth at Most Three. J. Algorithms 32(2): 167-194 (1999)
- [c7]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. WG 1999: 303-312
- 1997
- [j6]Hans L. Bodlaender, Dimitrios M. Thilikos: Treewidth for Graphs with Small Chordality. Discrete Applied Mathematics 79(1-3): 45-61 (1997)
- [j5]Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos: On Interval Routing Schemes and Treewidth. Inf. Comput. 139(1): 92-109 (1997)
- [j4]Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki: It is Hard to Know when Greedy is Good for Finding Independent Sets. Inf. Process. Lett. 61(2): 101-111 (1997)
- [j3]Dimitrios M. Thilikos, Hans L. Bodlaender: Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. Inf. Process. Lett. 61(5): 227-232 (1997)
- [j2]Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos: Fugitive-Search Games on Graphs and Related Parameters. Theor. Comput. Sci. 172(1-2): 233-254 (1997)
- [c6]Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos: Isomorphism for Graphs of Bounded Distance Width. CIAC 1997: 276-287
- [c5]Hans L. Bodlaender, Dimitrios M. Thilikos: Constructive Linear Time Algorithms for Branchwidth. ICALP 1997: 627-637
- 1996
- [j1]Lefteris M. Kirousis, Dimitrios M. Thilikos: The Linkage of a Graph. SIAM J. Comput. 25(3): 626-647 (1996)
- 1995
- [c4]Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos: Partial Arc Consistency. Over-Constrained Systems 1995: 229-236
- [c3]Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos: Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. FSTTCS 1995: 210-224
- [c2]Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen: On Interval Routing Schemes and Treewidth. WG 1995: 181-196
- 1994
- [c1]Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos: Fugitive-Search Games on Graphs and Related Parameters. WG 1994: 331-342
Coauthor Index
[c75] [j79] [j73] [j72] [j71] [j70] [j68] [c70] [i9] [j58] [j56] [j54] [j53] [j51] [i4] [j49] [c60] [c57] [c55] [c54] [c52] [c51] [c47] [i2] [j40] [j38] [j37] [c46] [c45] [r1] [i1] [j34] [c42] [j33] [j32] [j31] [c39] [c37] [j25] [j24] [j21] [j20] [j18] [c34] [c31] [c28] [c26] [c25] [j17] [c24] [c23] [c21] [c10]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:38 CEST by the dblp team