Dimitrios M. Thilikos

391 papers A* 31A 20B 52C 10Misc 4Journal 245Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximating branchwidth on parametric extensions of planarity. J. Comput. Syst. Sci. Dimitrios M. Thilikos, Sebastian Wiederrecht
2026	A*	`conf`	Catching Rats in H-minor-free Graphs. SODA Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht
2026	J	`jnl`	Dynamic programming on bipartite tree decompositions. J. Comput. Syst. Sci. Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2026	J	`jnl`	Making the interval membership width of temporal graphs connected and bidirectional. J. Comput. Syst. Sci. Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
2026	J	`jnl`	Vertex identification to a forest. Discret. Math. Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2026	A*	`conf`	ℋ-Planarity and Parametric Extensions: when Modulators Act Globally. SODA Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos
2025	J	`jnl`	A constant-factor approximation for weighted bond cover. J. Comput. Syst. Sci. Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2025	J	`jnl`	Catching Rats in CoRR Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht
2025	J	`jnl`	Colorful Minors. CoRR Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2025	J	`jnl`	Compound Logics for Modification Problems. ACM Trans. Comput. Log. Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2025	A*	`conf`	Finding irrelevant vertices in linear time on bounded-genus graphs. SODA Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos
2025	A	`conf`	Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion. ESA Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2025	J	`jnl`	Graph Parameters, Universal Obstructions, and WQO. Order Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
2025	J	`jnl`	Graph modification of bounded size to minor-closed classes as fast as vertex deletion. CoRR Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2025	J	`jnl`	H-Planarity and Parametric Extensions: when Modulators Act Globally. CoRR Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos
2025	A*	`conf`	Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. SODA Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2025	J	`jnl`	Plane Strong Connectivity Augmentation. CoRR Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald, Dimitrios M. Thilikos
2025	J	`jnl`	The Local Structure Theorem for Graph Minors with Finite Index. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	J	`jnl`	A more accurate view of the Flat Wall Theorem. J. Graph Theory Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024	B	`conf`	Approximating Branchwidth on Parametric Extensions of Planarity. WG Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	A*	`conf`	Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	J	`jnl`	Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	J	`jnl`	Faster parameterized algorithms for modification problems to minor-closed classes. TheoretiCS Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024	J	`jnl`	Killing a Vortex. J. ACM Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	C	`conf`	Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. IWOCA Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
2024	A*	`conf`	Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
2024	A*	`conf`	Obstructions to Erdös-Pósa Dualities for Minors. FOCS Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	J	`jnl`	Obstructions to Erdös-Pósa Dualities for Minors. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	J	`jnl`	Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024	J	`jnl`	Preface to special issue on theory and applications of Graph Searching. Theor. Comput. Sci. Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos
2024	J	`jnl`	Vertex identification to a forest. CoRR Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2023	J	`jnl`	Approximating branchwidth on parametric extensions of planarity. CoRR Dimitrios M. Thilikos, Sebastian Wiederrecht
2023	J	`jnl`	Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2023	J	`jnl`	Combing a Linkage in an Annulus. SIAM J. Discret. Math. Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023	A*	`conf`	Compound Logics for Modification Problems. ICALP Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2023	B	`conf`	Dynamic Programming on Bipartite Tree Decompositions. IPEC Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2023	J	`jnl`	Dynamic programming on bipartite tree decompositions. CoRR Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2023	J	`jnl`	Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
2023	A*	`conf`	Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
2023	A*	`conf`	Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2023	J	`jnl`	Graph Parameters, Universal Obstructions, and WQO. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
2023	J	`jnl`	Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2023	J	`jnl`	Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023	A*	`conf`	Kernelization for Graph Packing Problems via Rainbow Matching. SODA Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
2023	J	`jnl`	Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
2023	A*	`conf`	Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023	J	`jnl`	On Strict Brambles. Graphs Comb. Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros
2023	J	`jnl`	The mixed search game against an agile and visible fugitive is monotone. Discret. Math. Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
2023	J	`jnl`	Universal Obstructions of Graph Parameters. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
2022	J	`jnl`	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2022	J	`jnl`	A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discret. Appl. Math. Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
2022	J	`jnl`	An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2022	J	`jnl`	Block Elimination Distance. Graphs Comb. Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2022	J	`jnl`	Contraction Bidimensionality of Geometric Intersection Graphs. Algorithmica Julien Baste, Dimitrios M. Thilikos
2022	J	`jnl`	Contraction Bidimensionality of Geometric Intersection Graphs. CoRR Julien Baste, Dimitrios M. Thilikos
2022	J	`jnl`	Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
2022	J	`jnl`	Faster parameterized algorithms for modification problems to minor-closed classes. CoRR Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2022	J	`jnl`	Kernelization for Graph Packing Problems via Rainbow Matching. CoRR Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
2022	J	`jnl`	Killing a Vortex. CoRR Dimitrios M. Thilikos, Sebastian Wiederrecht
2022	A*	`conf`	Killing a vortex. FOCS Dimitrios M. Thilikos, Sebastian Wiederrecht
2022	J	`jnl`	Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2022	J	`jnl`	On Strict Brambles. CoRR Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros
2022	J	`jnl`	Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2022	J	`jnl`	The mixed search game against an agile and visible fugitive is monotone. CoRR Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
2021	—	`conf`	A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2021	J	`jnl`	A Constant-factor Approximation for Weighted Bond Cover. CoRR Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2021	J	`jnl`	A Menger-like property of tree-cut width. J. Comb. Theory B Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2021	J	`jnl`	A more accurate view of the Flat Wall Theorem. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2021	B	`conf`	Block Elimination Distance. WG Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	Block Elimination Distance. CoRR Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	B	`conf`	Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	J	`jnl`	Compactors for parameterized counting problems. Comput. Sci. Rev. Dimitrios M. Thilikos
2021	J	`jnl`	Compound Logics for Modification Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	Connected search for a lazy robber. J. Graph Theory Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
2021	J	`jnl`	Edge-trewidth: Algorithmic and combinatorial properties. CoRR Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
2021	J	`jnl`	Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2021	J	`jnl`	Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2021	J	`jnl`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2021	J	`jnl`	Minimum Reload Cost Graph Factors. Theory Comput. Syst. Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2021	J	`jnl`	Minor obstructions for apex-pseudoforests. Discret. Math. Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis
2021	A*	`conf`	Parameterized Complexity of Elimination Distance to First-Order Logic Properties. LICS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	J	`jnl`	Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	J	`jnl`	k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2020	A	`conf`	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2020	—	`conf`	A Retrospective on (Meta) Kernelization. Treewidth, Kernels, and Algorithms Dimitrios M. Thilikos
2020	A*	`conf`	A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	A linear fixed parameter tractable algorithm for connected pathwidth. CoRR Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2020	J	`jnl`	A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. CoRR Christophe Paul, Guillaume Mescoff, Dimitrios M. Thilikos
2020	A	`conf`	An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020	A*	`conf`	An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2020	J	`jnl`	Bidimensionality and Kernels. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2020	J	`jnl`	Edge Degeneracy: Algorithmic and Structural Results. CoRR Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
2020	J	`jnl`	Edge degeneracy: Algorithmic and structural results. Theor. Comput. Sci. Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
2020	B	`conf`	Hcore-Init: Neural Network Initialization based on Graph Degeneracy. ICPR Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis
2020	J	`jnl`	Hcore-Init: Neural Network Initialization based on Graph Degeneracy. CoRR Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis
2020	J	`jnl`	Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	A*	`conf`	Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. SODA Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020	J	`jnl`	Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Minor-obstructions for apex sub-unicyclic graphs. Discret. Appl. Math. Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona
2020	J	`jnl`	On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2020	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2020	J	`jnl`	Sparse obstructions for minor-covering parameters. Discret. Appl. Math. Dimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris Zoros
2020	J	`jnl`	Structure and enumeration of K4-minor-free links and link-diagrams. Eur. J. Comb. Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona
2020	J	`jnl`	Subgraph Complementation. Algorithmica Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
2020	J	`jnl`	k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2019	B	`conf`	Clustering to Given Connectivities. IPEC Petr A. Golovach, Dimitrios M. Thilikos
2019	—	`conf`	Connected Search for a Lazy Robber. FSTTCS Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
2019	J	`jnl`	Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2019	J	`jnl`	Explicit Linear Kernels for Packing Problems. Algorithmica Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2019	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers WG Ignasi Sau, Dimitrios M. Thilikos
2019	J	`jnl`	Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2019	J	`jnl`	Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2019	A	`conf`	Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2019	B	`conf`	Minimum Reload Cost Graph Factors. SOFSEM Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2019	A	`conf`	Modification to Planarity is Fixed Parameter Tractable. STACS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2019	J	`jnl`	Preface to special issue on Theory and Applications of Graph Searching. Theor. Comput. Sci. Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos
2018	B	`conf`	A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2018	—	`conf`	Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. GASCom Ioannis Giotis, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2018	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	An O(log OPT)-Approximation for Covering and Packing Minor Models of θ Algorithmica Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	Clustering to Given Connectivities. CoRR Petr A. Golovach, Dimitrios M. Thilikos
2018	B	`conf`	Data-Compression for Parametrized Counting Problems on Sparse Graphs. ISAAC Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos
2018	J	`jnl`	Data-compression for Parametrized Counting Problems on Sparse graphs. CoRR Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos
2018	J	`jnl`	Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2018	J	`jnl`	Lean tree-cut decompositions: obstructions and algorithms. CoRR Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2018	J	`jnl`	Minimum Reload Cost Graph Factors. CoRR Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2018	J	`jnl`	On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2018	—	`conf`	Partial Complementation of Graphs. SWAT Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
2018	J	`jnl`	Partial complementation of graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
2018	J	`jnl`	Structure and Enumeration of K Electron. Notes Discret. Math. Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona
2018	J	`jnl`	Structured Connectivity Augmentation. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2017	J	`jnl`	A linear kernel for planar red-blue dominating set. Discret. Appl. Math. Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2017	J	`jnl`	Acyclic edge coloring through the Lovász Local Lemma. Theor. Comput. Sci. Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2017	B	`conf`	Contraction-Bidimensionality of Geometric Intersection Graphs. IPEC Julien Baste, Dimitrios M. Thilikos
2017	J	`jnl`	Editing to a planar graph of given degrees. J. Comput. Syst. Sci. Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2017	J	`jnl`	Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2017	A*	`conf`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2017	J	`jnl`	Low Polynomial Exclusion of Planar Graph Patterns. J. Graph Theory Jean-Florent Raymond, Dimitrios M. Thilikos
2017	J	`jnl`	Minors in graphs of large ϴ Eur. J. Comb. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia
2017	B	`conf`	Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2017	B	`conf`	Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Recent techniques and results on the Erdős-Pósa property. Discret. Appl. Math. Jean-Florent Raymond, Dimitrios M. Thilikos
2017	B	`conf`	Structured Connectivity Augmentation. MFCS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2017	J	`jnl`	Structured Connectivity Augmentation. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2017	J	`jnl`	The Parameterized Complexity of Graph Cyclability. SIAM J. Discret. Math. Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos
2016	J	`jnl`	(Meta) Kernelization. J. ACM Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2016	J	`jnl`	A k-core Decomposition Framework for Graph Clustering. CoRR Christos Giatsidis, Fragkiskos D. Malliaros, Nikolaos Tziortziotis, Charanpal Dhanjal, Emmanouil Kiagias, Dimitrios M. Thilikos, Michalis Vazirgiannis
2016	J	`jnl`	An edge variant of the Erdős-Pósa property. Discret. Math. Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2016	J	`jnl`	Bidimensionality and Kernels. CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2016	—	`ch.`	Bidimensionality. Encyclopedia of Algorithms Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2016	—	`ch.`	Branchwidth of Graphs. Encyclopedia of Algorithms Fedor V. Fomin, Dimitrios M. Thilikos
2016	J	`jnl`	Contraction obstructions for connected graph searching. Discret. Appl. Math. Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros
2016	B	`conf`	Cutwidth: Obstructions and Algorithmic Aspects. IPEC Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	J	`jnl`	Cutwidth: obstructions and algorithmic aspects. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	J	`jnl`	Explicit linear kernels for packing problems. CoRR Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2016	B	`conf`	FPT Algorithms for Plane Completion Problems. MFCS Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros
2016	J	`jnl`	Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Discret. Appl. Math. Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos
2016	J	`jnl`	Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos
2016	J	`jnl`	Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna
2016	J	`jnl`	Minimal disconnected cuts in planar graphs. Networks Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos
2016	B	`conf`	Packing and Covering Immersion Models of Planar Subcubic Graphs. WG Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2016	J	`jnl`	Planar Disjoint-Paths Completion. Algorithmica Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2016	J	`jnl`	Recent techniques and results on the Erdős-Pósa property. CoRR Jean-Florent Raymond, Dimitrios M. Thilikos
2015	C	`conf`	A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros
2015	Misc	`conf`	A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2015	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. CoRR Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	An FPT 2-Approximation for Tree-cut Decomposition. WAOA Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	An O(log OPT)-approximation for covering and packing minor models of $θ CoRR Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	C	`conf`	An alternative proof for the constructive Asymmetric Lovász Local Lemma. CTW Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2015	J	`jnl`	An alternative proof for the constructive Asymmetric Lovász Local Lemma. CoRR Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2015	B	`conf`	Bidimensionality and Parameterized Algorithms (Invited Talk). IPEC Dimitrios M. Thilikos
2015	Misc	`conf`	Editing to a Planar Graph of Given Degrees. CSR Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	J	`jnl`	Editing to a Planar Graph of Given Degrees. CoRR Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	J	`jnl`	Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Forbidding Kuratowski Graphs as Immersions. J. Graph Theory Archontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos
2015	B	`conf`	Minimal Disconnected Cuts in Planar Graphs. FCT Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos
2015	J	`jnl`	Minors in graphs of large $θ CoRR Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	—	`conf`	On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. ANALCO Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2015	B	`conf`	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Planar Disjoint-Paths Completion. CoRR Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2015	B	`conf`	Variants of Plane Diameter Completion. IPEC Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos
2015	J	`jnl`	Variants of Plane Diameter Completion. CoRR Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos
2014	J	`jnl`	A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2014	J	`jnl`	A linear kernel for planar red-blue dominating set. CoRR Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
2014	B	`conf`	Bidimensionality of Geometric Intersection Graphs. SOFSEM Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos
2014	A*	`conf`	CoreCluster: A Degeneracy Based Graph Clustering Framework. AAAI Christos Giatsidis, Fragkiskos D. Malliaros, Dimitrios M. Thilikos, Michalis Vazirgiannis
2014	J	`jnl`	Dynamic programming for graphs on surfaces. ACM Trans. Algorithms Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2014	A	`conf`	Explicit Linear Kernels via Dynamic Programming. STACS Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2014	J	`jnl`	Lift-contractions. Eur. J. Comb. Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos
2014	J	`jnl`	On the Algorithmic Lovász Local Lemma. CoRR Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2014	J	`jnl`	Outerplanar obstructions for matroid pathwidth. Discret. Math. Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki
2014	A	`conf`	Quantifying trust dynamics in signed graphs, the S-Cores approach. SDM Christos Giatsidis, Bogdan Cautis, Silviu Maniu, Dimitrios M. Thilikos, Michalis Vazirgiannis
2014	J	`jnl`	Report on NII Shonan Meeting 2013-018. Bull. EATCS Gregory Z. Gutin, Dimitrios M. Thilikos
2014	J	`jnl`	Square roots of minor closed graph classes. Discret. Appl. Math. Nestor V. Nestoridis, Dimitrios M. Thilikos
2014	A	`conf`	The Parameterized Complexity of Graph Cyclability. ESA Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos
2014	J	`jnl`	The Parameterized Complexity of Graph Cyclability. CoRR Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos
2013	C	`conf`	A linear kernel for planar red-blue dominating set. CTW Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	An edge variant of the Erdős-Pósa property. CoRR Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	Asymptotic enumeration of non-crossing partitions on surfaces. Discret. Math. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Dagstuhl Reports Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
2013	J	`jnl`	Bidimensionality of Geometric Intersection Graphs. CoRR Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos
2013	J	`jnl`	Characterizing graphs of small carving-width. Discret. Appl. Math. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	J	`jnl`	D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst. Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis
2013	B	`conf`	Excluding Graphs as Immersions in Surface Embedded Graphs. WG Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
2013	J	`jnl`	Explicit linear kernels via dynamic programming. CoRR Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	J	`jnl`	Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013	A	`conf`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013	J	`jnl`	Low Polynomial Exclusion of Planar Graph Patterns CoRR Jean-Florent Raymond, Dimitrios M. Thilikos
2013	J	`jnl`	Optimizing the Graph Minors Weak Structure Theorem. SIAM J. Discret. Math. Archontia C. Giannopoulou, Dimitrios M. Thilikos
2013	J	`jnl`	Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2). NII Shonan Meet. Rep. Gregory Z. Gutin, Kazuo Iwama, Dimitrios M. Thilikos
2013	J	`jnl`	Polynomial Gap Extensions of the Erdős-Pósa Theorem. CoRR Jean-Florent Raymond, Dimitrios M. Thilikos
2012	J	`jnl`	A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	J	`jnl`	Catalan structures and dynamic programming in H-minor-free graphs. J. Comput. Syst. Sci. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2012	C	`conf`	Characterizing Graphs of Small Carving-Width. COCOA Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	J	`jnl`	Connected graph searching. Inf. Comput. Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos
2012	J	`jnl`	Containment relations in split graphs. Discret. Appl. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	A	`conf`	Contraction checking in graphs on surfaces. STACS Marcin Kaminski, Dimitrios M. Thilikos
2012	Misc	`conf`	Dynamic Programming for H-minor-free Graphs. COCOON Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2012	J	`jnl`	Fast Minor Testing in Planar Graphs. Algorithmica Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2012	J	`jnl`	Forbidden graphs for tree-depth. Eur. J. Comb. Zdenek Dvorák, Archontia C. Giannopoulou, Dimitrios M. Thilikos
2012	J	`jnl`	Forbidding Kuratowski Graphs as Immersions CoRR Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
2012	J	`jnl`	Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2012	—	`conf`	Graph Minors and Parameterized Algorithm Design. The Multivariate Algorithmic Revolution and Beyond Dimitrios M. Thilikos
2012	J	`jnl`	Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	J	`jnl`	LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Discret. Appl. Math. Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos
2012	A*	`conf`	Linear kernels for (connected) dominating set on SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	On exact algorithms for treewidth. ACM Trans. Algorithms Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	J	`jnl`	On graph contractions and induced minors. Discret. Appl. Math. Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2012	J	`jnl`	Outerplanar obstructions for a feedback vertex set. Eur. J. Comb. Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos
2012	B	`ed.`	Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings IPEC Dimitrios M. Thilikos, Gerhard J. Woeginger
2012	A*	`conf`	Visual exploration of collaboration networks based on graph degeneracy. KDD Christos Giatsidis, Klaus Berberich, Dimitrios M. Thilikos, Michalis Vazirgiannis
2011	J	`jnl`	A min-max theorem for LIFO-search. Electron. Notes Discret. Math. Archontia C. Giannopoulou, Dimitrios M. Thilikos
2011	J	`jnl`	Approximating Width Parameters of Hypergraphs with Excluded Minors. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2011	J	`jnl`	Asymptotic Enumeration of Non-crossing Partitions on Surfaces CoRR Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2011	J	`jnl`	Confronting Intractability via Parameters CoRR Rodney G. Downey, Dimitrios M. Thilikos
2011	J	`jnl`	Confronting intractability via parameters. Comput. Sci. Rev. Rodney G. Downey, Dimitrios M. Thilikos
2011	J	`jnl`	Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Contraction obstructions for treewidth. J. Comb. Theory B Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2011	A*	`conf`	D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. ICDM Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis
2011	J	`jnl`	Dynamic Programming for Graphs on Surfaces CoRR Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2011	B	`conf`	Evaluating Cooperation in Communities with the k-Core Structure. ASONAM Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis
2011	A	`conf`	Fast Sub-exponential Algorithms and Compactness in Planar Graphs. ESA Dimitrios M. Thilikos
2011	J	`jnl`	Faster parameterized algorithms for minor containment. Theor. Comput. Sci. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2011	B	`conf`	Increasing the Minimum Degree of a Graph by Contractions. IPEC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Lift Contractions. Electron. Notes Discret. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	C	`conf`	Odd cyclic surface separators in planar graphs. CTW Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos
2011	J	`jnl`	On disconnected cuts and separators. Discret. Appl. Math. Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	On self-duality of branchwidth in graphs of bounded genus. Discret. Appl. Math. Ignasi Sau, Dimitrios M. Thilikos
2011	—	`conf`	On the Existence of Nash Equilibria in Strategic Search Games. TGC Carme Àlvarez, Amalia Duch, Maria J. Serna, Dimitrios M. Thilikos
2011	J	`jnl`	Optimizing the Graph Minors Weak Structure Theorem CoRR Archontia C. Giannopoulou, Dimitrios M. Thilikos
2011	J	`jnl`	Outerplanar Obstructions for Matroid Pathwidth. Electron. Notes Discret. Math. Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki
2011	J	`jnl`	Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discret. Optim. Petr A. Golovach, Dimitrios M. Thilikos
2011	B	`conf`	Planar Disjoint-Paths Completion. IPEC Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2011	J	`jnl`	Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. Algorithmica Athanassios Koutsonas, Dimitrios M. Thilikos
2011	J	`jnl`	Searching for a Visible, Lazy Fugitive. SIAM J. Discret. Math. David Richerby, Dimitrios M. Thilikos
2011	J	`jnl`	Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2011	J	`jnl`	Square Roots of Minor Closed Graph Classes. Electron. Notes Discret. Math. Nestor V. Nestoridis, Dimitrios M. Thilikos
2011	J	`jnl`	Strengthening Erdös-Pósa property for minor-closed graph classes. J. Graph Theory Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos
2011	J	`jnl`	Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2011	—	`conf`	Tight Bounds for Linkages in Planar Graphs. ICALP (1) Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010	J	`jnl`	A note on the subgraphs of the (2×∞)-grid. Discret. Math. Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos
2010	B	`conf`	Approximation Algorithms for Domination Search. WAOA Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2010	A*	`conf`	Bidimensionality and Kernels. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010	J	`jnl`	Contracting planar graphs to contractions of triangulations CoRR Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2010	—	`conf`	Contractions of Planar Graphs in Polynomial Time. ESA (1) Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2010	—	`conf`	Dynamic Programming for Graphs on Surfaces. ICALP (1) Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2010	—	`conf`	Fast Minor Testing in Planar Graphs. ESA (1) Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	—	`conf`	Faster Parameterized Algorithms for Minor Containment. SWAT Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	B	`ed.`	Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers WG Dimitrios M. Thilikos
2010	B	`conf`	On Contracting Graphs to Fixed Pattern Graphs. SOFSEM Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2010	J	`jnl`	Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos
2010	J	`jnl`	Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. J. Discrete Algorithms Ignasi Sau, Dimitrios M. Thilikos
2009	J	`jnl`	(Meta) Kernelization CoRR Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	A*	`conf`	(Meta) Kernelization. FOCS Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	A	`conf`	Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2009	A	`conf`	Contraction Bidimensionality: The Accurate Picture. ESA Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2009	—	`conf`	Contraction Bidimensionality: the Accurate Picture. Parameterized complexity and approximation algorithms Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2009	J	`jnl`	Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
2009	J	`jnl`	Graph Searching in a Crime Wave. SIAM J. Discret. Math. David Richerby, Dimitrios M. Thilikos
2009	B	`conf`	Induced Packing of Odd Cycles in a Planar Graph. ISAAC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009	J	`jnl`	Obstructions for Tree-depth. Electron. Notes Discret. Math. Archontia C. Giannopoulou, Dimitrios M. Thilikos
2009	C	`conf`	On Self-Duality of Branchwidth in Graphs of Bounded Genus. CTW Ignasi Sau, Dimitrios M. Thilikos
2009	J	`jnl`	Outerplanar Obstructions for the Feedback Vertex Set. Electron. Notes Discret. Math. Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos
2009	J	`jnl`	Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms Hannes Moser, Dimitrios M. Thilikos
2009	B	`conf`	Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009	—	`conf`	Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC Petr A. Golovach, Dimitrios M. Thilikos
2009	J	`jnl`	Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. Electron. Notes Discret. Math. Ignasi Sau, Dimitrios M. Thilikos
2008	J	`jnl`	An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. Fedor V. Fomin, Dimitrios M. Thilikos
2008	J	`jnl`	Approximating acyclicity parameters of sparse hypergraphs CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2008	—	`ch.`	Branchwidth of Graphs. Encyclopedia of Algorithms Fedor V. Fomin, Dimitrios M. Thilikos
2008	A*	`conf`	Catalan structures and dynamic programming in SODA Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2008	J	`jnl`	Efficient algorithms for counting parameterized list H-colorings. J. Comput. Syst. Sci. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2008	J	`jnl`	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2008	J	`jnl`	Forewords: Special issue on graph searching. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos
2008	C	`conf`	Improving the gap of Erdös-Pósa property for minor-closed graph classes. CTW Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos
2008	B	`conf`	Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. WG Athanassios Koutsonas, Dimitrios M. Thilikos
2008	B	`conf`	Searching for a Visible, Lazy Fugitive. WG David Richerby, Dimitrios M. Thilikos
2008	J	`jnl`	Subexponential parameterized algorithms. Comput. Sci. Rev. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2007	J	`jnl`	Complexity issues on bounded restrictive H-coloring. Discret. Math. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2007	B	`conf`	Graph Searching in a Crime Wave. WG David Richerby, Dimitrios M. Thilikos
2007	J	`jnl`	Invitation to fixed-parameter algorithms. Comput. Sci. Rev. Dimitrios M. Thilikos
2007	J	`jnl`	On self duality of pathwidth in polyhedral graph embeddings. J. Graph Theory Fedor V. Fomin, Dimitrios M. Thilikos
2007	A*	`conf`	Subexponential Parameterized Algorithms. ICALP Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2006	J	`jnl`	A 3-approximation for the pathwidth of Halin graphs. J. Discrete Algorithms Fedor V. Fomin, Dimitrios M. Thilikos
2006	J	`jnl`	Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Comput. Fedor V. Fomin, Dimitrios M. Thilikos
2006	A	`conf`	Fast FPT-Algorithms for Cleaning Grids. STACS Josep Díaz, Dimitrios M. Thilikos
2006	—	`conf`	Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2006	—	`conf`	Kernels for the Vertex Cover Problem on the Preferred Attachment Model. WEA Josep Díaz, Jordi Petit, Dimitrios M. Thilikos
2006	J	`jnl`	New upper bounds on the decomposability of planar graphs. J. Graph Theory Fedor V. Fomin, Dimitrios M. Thilikos
2006	A	`conf`	On Exact Algorithms for Treewidth. ESA Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2006	—	`conf`	Parameterized Complexity of Finding Regular Induced Subgraphs. ACiD Hannes Moser, Dimitrios M. Thilikos
2006	J	`jnl`	The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discret. Math. Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	Connected Graph Searching in Outerplanar Graphs. Electron. Notes Discret. Math. Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca
2005	J	`jnl`	Cutwidth I: A linear time fixed parameter algorithm. J. Algorithms Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2005	J	`jnl`	Cutwidth II: Algorithms for partial w-trees of bounded degree. J. Algorithms Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2005	J	`jnl`	Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. Algorithmica Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2005	J	`jnl`	Fixed-parameter algorithms for ( ACM Trans. Algorithms Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	Parameterized Complexity for Graph Layout Problems. Bull. EATCS Maria J. Serna, Dimitrios M. Thilikos
2005	B	`conf`	Parameterized Counting Algorithms for General Graph Covering Problems. WADS Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2005	J	`jnl`	Subexponential parameterized algorithms on bounded-genus graphs and J. ACM Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	The restrictive Discret. Appl. Math. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2004	C	`conf`	A 3-Approximation for the Pathwidth of Halin Graphs. CTW Fedor V. Fomin, Dimitrios M. Thilikos
2004	J	`jnl`	A 3-approximation for the pathwidth of Halin graphs. Electron. Notes Discret. Math. Fedor V. Fomin, Dimitrios M. Thilikos
2004	A	`conf`	A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS Fedor V. Fomin, Dimitrios M. Thilikos
2004	J	`jnl`	Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2004	B	`conf`	Bidimensional Parameters and Local Treewidth. LATIN Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	J	`jnl`	Bidimensional Parameters and Local Treewidth. SIAM J. Discret. Math. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	—	`conf`	Computing Small Search Numbers in Linear Time. IWPEC Hans L. Bodlaender, Dimitrios M. Thilikos
2004	A*	`conf`	Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP Fedor V. Fomin, Dimitrios M. Thilikos
2004	A	`conf`	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2004	A	`conf`	Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings. ESA Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2004	—	`conf`	Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2004	A*	`conf`	Subexponential parameterized algorithms on graphs of bounded-genus and SODA Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	B	`conf`	The Bidimensional Theory of Bounded-Genus Graphs. MFCS Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2003	A	`conf`	Dominating Sets and Local Treewidth. ESA Fedor V. Fomin, Dimitrios M. Thilikos
2003	A*	`conf`	Dominating sets in planar graphs: branch-width and exponential speed-up. SODA Fedor V. Fomin, Dimitrios M. Thilikos
2003	A*	`conf`	Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2003	J	`jnl`	On the monotonicity of games generated by symmetric submodular functions. Discret. Appl. Math. Fedor V. Fomin, Dimitrios M. Thilikos
2003	B	`conf`	Searching Is Not Jumping. WG Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos
2003	B	`conf`	Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
2002	—	`conf`	-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. APPROX Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2002	J	`jnl`	Counting H-colorings of partial k-trees. Theor. Comput. Sci. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2002	B	`conf`	Exponential Speedup of Fixed-Parameter Algorithms on K ISAAC Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2002	—	`conf`	H-Colorings of Large Degree Graphs. EurAsia-ICT Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos
2002	J	`jnl`	On Graph Powers for Leaf-Labeled Trees. J. Algorithms Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2002	B	`conf`	The Complexity of Restrictive H-Coloring. WG Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2001	B	`conf`	(H, C, K)-Coloring: Fast, Easy, and Hard Cases. MFCS Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2001	A	`conf`	A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. ESA Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2001	Misc	`conf`	Counting H-Colorings of Partial k-Trees. COCOON Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2001	B	`conf`	Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2001	J	`jnl`	Fast approximation schemes for K Electron. Notes Discret. Math. Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2001	B	`conf`	On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG Fedor V. Fomin, Dimitrios M. Thilikos
2001	—	`conf`	Recent Results on Parameterized H-Colorings. Graphs, Morphisms and Statistical Physics Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
2001	B	`conf`	Stability and non-stability of the FIFO protocol. SPAA Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos
2000	J	`jnl`	Algorithms and obstructions for linear-width and related search parameters. Discret. Appl. Math. Dimitrios M. Thilikos
2000	B	`conf`	Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. ISAAC Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2000	J	`jnl`	Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2000	—	`conf`	On Graph Powers for Leaf-Labeled Trees. SWAT Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2000	J	`jnl`	On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints. Constraints An Int. J. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
1999	B	`conf`	Finding Smallest Supertrees Under Minor Containment. WG Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
1999	J	`jnl`	Graphs with Branchwidth at Most Three. J. Algorithms Hans L. Bodlaender, Dimitrios M. Thilikos
1999	J	`jnl`	Isomorphism for Graphs of Bounded Distance Width. Algorithmica Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
1999	J	`jnl`	Monotonicity and inert fugitive search games. Electron. Notes Discret. Math. Yannis C. Stamatiou, Dimitrios M. Thilikos
1999	J	`jnl`	Quickly Excluding K Electron. Notes Discret. Math. Dimitrios M. Thilikos
1997	A*	`conf`	Constructive Linear Time Algorithms for Branchwidth. ICALP Hans L. Bodlaender, Dimitrios M. Thilikos
1997	J	`jnl`	Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. Inf. Process. Lett. Dimitrios M. Thilikos, Hans L. Bodlaender
1997	J	`jnl`	Fugitive-Search Games on Graphs and Related Parameters. Theor. Comput. Sci. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
1997	C	`conf`	Isomorphism for Graphs of Bounded Distance Width. CIAC Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
1997	J	`jnl`	It is Hard to Know when Greedy is Good for Finding Independent Sets. Inf. Process. Lett. Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki
1997	J	`jnl`	On Interval Routing Schemes and Treewidth. Inf. Comput. Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos
1997	J	`jnl`	Treewidth for Graphs with Small Chordality. Discret. Appl. Math. Hans L. Bodlaender, Dimitrios M. Thilikos
1996	J	`jnl`	The Linkage of a Graph. SIAM J. Comput. Lefteris M. Kirousis, Dimitrios M. Thilikos
1995	B	`conf`	On Interval Routing Schemes and Treewidth. WG Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen
1995	—	`conf`	Partial Arc Consistency. Over-Constrained Systems Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
1995	—	`conf`	Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. FSTTCS Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
1994	B	`conf`	Fugitive-Search Games on Graphs and Related Parameters. WG Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos