Dimitrios M. Thilikos

According to our database1, Dimitrios M. Thilikos authored at least 198 papers between 1995 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties.
Theory Comput. Syst., 2020

Hitting minors on bounded treewidth graphs. III. Lower bounds.
J. Comput. Syst. Sci., 2020

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Preface to special issue on Theory and Applications of Graph Searching.
Theor. Comput. Sci., 2019

Cutwidth: Obstructions and Algorithmic Aspects.
Algorithmica, 2019

Explicit Linear Kernels for Packing Problems.
Algorithmica, 2019

Lean Tree-Cut Decompositions: Obstructions and Algorithms.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Modification to Planarity is Fixed Parameter Tractable.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Minimum Reload Cost Graph Factors.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Clustering to Given Connectivities.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Connected Search for a Lazy Robber.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors.
ACM Trans. Algorithms, 2018

Structured Connectivity Augmentation.
SIAM J. Discrete Math., 2018

Structure and Enumeration of K4-minor-free links and link diagrams.
Electron. Notes Discret. Math., 2018

An FPT 2-Approximation for Tree-Cut Decomposition.
Algorithmica, 2018

An O(log OPT)-Approximation for Covering and Packing Minor Models of θr.
Algorithmica, 2018

Partial Complementation of Graphs.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Data-Compression for Parametrized Counting Problems on Sparse Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017
Acyclic edge coloring through the Lovász Local Lemma.
Theor. Comput. Sci., 2017

The Parameterized Complexity of Graph Cyclability.
SIAM J. Discrete Math., 2017

Low Polynomial Exclusion of Planar Graph Patterns.
Journal of Graph Theory, 2017

Irrelevant vertices for the planar Disjoint Paths Problem.
J. Comb. Theory, Ser. B, 2017

Parameterized algorithms for min-max multiway cut and list digraph homomorphism.
J. Comput. Syst. Sci., 2017

Editing to a planar graph of given degrees.
J. Comput. Syst. Sci., 2017

A polynomial-time algorithm for Outerplanar Diameter Improvement.
J. Comput. Syst. Sci., 2017

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.
Inf. Comput., 2017

Packing and covering immersion-expansions of planar sub-cubic graphs.
Eur. J. Comb., 2017

Minors in graphs of large ϴr-girth.
Eur. J. Comb., 2017

Recent techniques and results on the Erdős-Pósa property.
Discret. Appl. Math., 2017

A linear kernel for planar red-blue dominating set.
Discret. Appl. Math., 2017

Hitting minors on bounded treewidth graphs.
CoRR, 2017

Contraction-Bidimensionality of Geometric Intersection Graphs.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Branchwidth of Graphs.
Encyclopedia of Algorithms, 2016

Bidimensionality.
Encyclopedia of Algorithms, 2016

Forewords: Special issue on Theory and Applications of Graph Searching Problems.
Theor. Comput. Sci., 2016

Minimal disconnected cuts in planar graphs.
Networks, 2016

(Meta) Kernelization.
J. ACM, 2016

An edge variant of the Erdős-Pósa property.
Discret. Math., 2016

Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013.
Discret. Appl. Math., 2016

Contraction obstructions for connected graph searching.
Discret. Appl. Math., 2016

A k-core Decomposition Framework for Graph Clustering.
CoRR, 2016

Planar Disjoint-Paths Completion.
Algorithmica, 2016

Packing and Covering Immersion Models of Planar Subcubic Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

FPT Algorithms for Plane Completion Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Explicit Linear Kernels via Dynamic Programming.
SIAM J. Discrete Math., 2015

Forbidding Kuratowski Graphs as Immersions.
Journal of Graph Theory, 2015

An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

Bidimensionality and Parameterized Algorithms (Invited Talk).
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Variants of Plane Diameter Completion.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

An alternative proof for the constructive Asymmetric Lovász Local Lemma.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

A Fixed Parameter Algorithm for Plane Subgraph Completion.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014
Dynamic programming for graphs on surfaces.
ACM Trans. Algorithms, 2014

Report on NII Shonan Meeting 2013-018.
Bulletin of the EATCS, 2014

On the Algorithmic Lovász Local Lemma.
CoRR, 2014

Bidimensionality of Geometric Intersection Graphs.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Quantifying trust dynamics in signed graphs, the S-Cores approach.
Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

CoreCluster: A Degeneracy Based Graph Clustering Framework.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Increasing the minimum degree of a graph by contractions.
Theor. Comput. Sci., 2013

Optimizing the Graph Minors Weak Structure Theorem.
SIAM J. Discrete Math., 2013

Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2).
NII Shonan Meet. Rep., 2013

D-cores: measuring collaboration of directed graphs based on degeneracy.
Knowl. Inf. Syst., 2013

Asymptotic enumeration of non-crossing partitions on surfaces.
Discret. Math., 2013

Characterizing graphs of small carving-width.
Discret. Appl. Math., 2013

Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121).
Dagstuhl Reports, 2013

Polynomial Gap Extensions of the Erdős-Pósa Theorem.
CoRR, 2013

Excluding Graphs as Immersions in Surface Embedded Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Induced packing of odd cycles in planar graphs.
Theor. Comput. Sci., 2012

Foreword: Special Issue on Theory and Applications of Graph Searching Problems.
Theor. Comput. Sci., 2012

On exact algorithms for treewidth.
ACM Trans. Algorithms, 2012

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.
Theory Comput. Syst., 2012

Catalan structures and dynamic programming in H-minor-free graphs.
J. Comput. Syst. Sci., 2012

Connected graph searching.
Inf. Comput., 2012

Forbidden graphs for tree-depth.
Eur. J. Comb., 2012

On graph contractions and induced minors.
Discret. Appl. Math., 2012

Containment relations in split graphs.
Discret. Appl. Math., 2012

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.
Discret. Appl. Math., 2012

Fast Minor Testing in Planar Graphs.
Algorithmica, 2012

Contraction checking in graphs on surfaces.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Linear kernels for (connected) dominating set on H-minor-free graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Visual exploration of collaboration networks based on graph degeneracy.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Dynamic Programming for H-minor-free Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Graph Minors and Parameterized Algorithm Design.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
Parameterizing cut sets in a graph by the number of their components.
Theor. Comput. Sci., 2011

Special Issue on "Theory and Applications of Graph Searching Problems".
Theor. Comput. Sci., 2011

Faster parameterized algorithms for minor containment.
Theor. Comput. Sci., 2011

Searching for a Visible, Lazy Fugitive.
SIAM J. Discrete Math., 2011

Approximating Width Parameters of Hypergraphs with Excluded Minors.
SIAM J. Discrete Math., 2011

Strengthening Erdös-Pósa property for minor-closed graph classes.
Journal of Graph Theory, 2011

Contracting planar graphs to contractions of triangulations.
J. Discrete Algorithms, 2011

Contraction obstructions for treewidth.
J. Comb. Theory, Ser. B, 2011

Square Roots of Minor Closed Graph Classes.
Electron. Notes Discret. Math., 2011

Outerplanar Obstructions for Matroid Pathwidth.
Electron. Notes Discret. Math., 2011

Lift Contractions.
Electron. Notes Discret. Math., 2011

A min-max theorem for LIFO-search.
Electron. Notes Discret. Math., 2011

Paths of bounded length and their cuts: Parameterized complexity and algorithms.
Discret. Optim., 2011

On self-duality of branchwidth in graphs of bounded genus.
Discret. Appl. Math., 2011

On disconnected cuts and separators.
Discret. Appl. Math., 2011

Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071).
Dagstuhl Reports, 2011

Confronting intractability via parameters.
Comput. Sci. Rev., 2011

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.
Algorithmica, 2011

On the Existence of Nash Equilibria in Strategic Search Games.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Tight Bounds for Linkages in Planar Graphs.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Fast Sub-exponential Algorithms and Compactness in Planar Graphs.
Proceedings of the Algorithms - ESA 2011, 2011

Odd cyclic surface separators in planar graphs.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Evaluating Cooperation in Communities with the k-Core Structure.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011

2010
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs.
J. Discrete Algorithms, 2010

Rank-width and tree-width of H-minor-free graphs.
Eur. J. Comb., 2010

A note on the subgraphs of the (2×∞)-grid.
Discret. Math., 2010

Approximation Algorithms for Domination Search.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

On Contracting Graphs to Fixed Pattern Graphs.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Bidimensionality and Kernels.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Contractions of Planar Graphs in Polynomial Time.
Proceedings of the Algorithms, 2010

2009
Graph Searching in a Crime Wave.
SIAM J. Discrete Math., 2009

Parameterized complexity of finding regular induced subgraphs.
J. Discrete Algorithms, 2009

Derivation of algorithms for cutwidth and related graph layout parameters.
J. Comput. Syst. Sci., 2009

Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs.
Electron. Notes Discret. Math., 2009

Outerplanar Obstructions for the Feedback Vertex Set.
Electron. Notes Discret. Math., 2009

Obstructions for Tree-depth.
Electron. Notes Discret. Math., 2009

Approximating Acyclicity Parameters of Sparse Hypergraphs.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Induced Packing of Odd Cycles in a Planar Graph.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Contraction Bidimensionality: the Accurate Picture.
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

2008
Branchwidth of Graphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

An annotated bibliography on guaranteed graph searching.
Theor. Comput. Sci., 2008

Forewords: Special issue on graph searching.
Theor. Comput. Sci., 2008

Efficient algorithms for counting parameterized list H-colorings.
J. Comput. Syst. Sci., 2008

Subexponential parameterized algorithms.
Comput. Sci. Rev., 2008

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica, 2008

Catalan structures and dynamic programming in H-minor-free graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Improving the gap of Erdös-Pósa property for minor-closed graph classes.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
On self duality of pathwidth in polyhedral graph embeddings.
Journal of Graph Theory, 2007

Complexity issues on bounded restrictive H-coloring.
Discret. Math., 2007

Invitation to fixed-parameter algorithms.
Comput. Sci. Rev., 2007

2006
The Bidimensional Theory of Bounded-Genus Graphs.
SIAM J. Discrete Math., 2006

Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.
SIAM J. Comput., 2006

New upper bounds on the decomposability of planar graphs.
Journal of Graph Theory, 2006

Kernels for the Vertex Cover Problem on the Preferred Attachment Model.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.
Proceedings of the Algorithm Theory, 2006

Fast FPT-Algorithms for Cleaning Grids.
Proceedings of the STACS 2006, 2006

2005
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.
ACM Trans. Algorithms, 2005

Cutwidth II: Algorithms for partial w-trees of bounded degree.
J. Algorithms, 2005

Cutwidth I: A linear time fixed parameter algorithm.
J. Algorithms, 2005

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.
J. ACM, 2005

Connected Graph Searching in Outerplanar Graphs.
Electron. Notes Discret. Math., 2005

Parameterized Complexity for Graph Layout Problems.
Bulletin of the EATCS, 2005

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.
Discret. Appl. Math., 2005

The restrictive H-coloring problem.
Discret. Appl. Math., 2005

Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.
Algorithmica, 2005

Parameterized Counting Algorithms for General Graph Covering Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004
Bidimensional Parameters and Local Treewidth.
SIAM J. Discrete Math., 2004

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci., 2004

A 3-approximation for the pathwidth of Halin graphs.
Electron. Notes Discret. Math., 2004

A Simple and Fast Approach for Solving Problems on Planar Graphs.
Proceedings of the STACS 2004, 2004

Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Smaller Kernels for Hitting Set Problems of Constant Arity.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Computing Small Search Numbers in Linear Time.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.
Proceedings of the Algorithms, 2004

2003
On the monotonicity of games generated by symmetric submodular functions.
Discret. Appl. Math., 2003

Searching Is Not Jumping.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Dominating Sets and Local Treewidth.
Proceedings of the Algorithms, 2003

2002
Counting H-colorings of partial k-trees.
Theor. Comput. Sci., 2002

On Graph Powers for Leaf-Labeled Trees.
J. Algorithms, 2002

The Complexity of Restrictive H-Coloring.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

H-Colorings of Large Degree Graphs.
Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.
Electron. Notes Discret. Math., 2001

Stability and non-stability of the FIFO protocol.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

(H, C, K)-Coloring: Fast, Easy, and Hard Cases.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.
Proceedings of the Algorithms, 2001

Recent Results on Parameterized H-Colorings.
Proceedings of the Graphs, 2001

2000
Finding Smallest Supertrees Under Minor Containment.
Int. J. Found. Comput. Sci., 2000

Algorithms and obstructions for linear-width and related search parameters.
Discret. Appl. Math., 2000

On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints.
Constraints, 2000

Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Graphs with Branchwidth at Most Three.
J. Algorithms, 1999

Quickly Excluding K2, r from Planar Graphs.
Electron. Notes Discret. Math., 1999

Monotonicity and inert fugitive search games.
Electron. Notes Discret. Math., 1999

Isomorphism for Graphs of Bounded Distance Width.
Algorithmica, 1999

1997
Fugitive-Search Games on Graphs and Related Parameters.
Theor. Comput. Sci., 1997

Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems.
Inf. Process. Lett., 1997

It is Hard to Know when Greedy is Good for Finding Independent Sets.
Inf. Process. Lett., 1997

On Interval Routing Schemes and Treewidth.
Inf. Comput., 1997

Treewidth for Graphs with Small Chordality.
Discret. Appl. Math., 1997

Constructive Linear Time Algorithms for Branchwidth.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
The Linkage of a Graph.
SIAM J. Comput., 1996

1995
Partiality and Approximation Schemes for Local Consistency in Networks of Constraints.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Partial Arc Consistency.
Proceedings of the Over-Constrained Systems, 1995


  Loading...