Dimitrios M. Thilikos
Orcid: 0000-0003-0470-1800Affiliations:
- Polytechnic University of Catalonia, Barcelona, Spain
According to our database1,
Dimitrios M. Thilikos
authored at least 246 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on lsi.upc.es
On csauthors.net:
Bibliography
2024
TheoretiCS, 2024
Theor. Comput. Sci., 2024
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes.
CoRR, 2024
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Discret. Appl. Math., December, 2023
SIAM J. Comput., August, 2023
Inf. Comput., August, 2023
ACM Trans. Algorithms, July, 2023
J. Comb. Theory B, July, 2023
Discret. Math., April, 2023
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
2022
ACM Trans. Comput. Theory, December, 2022
ACM Trans. Comput. Log., 2022
ACM Trans. Algorithms, 2022
SIAM J. Discret. Math., 2022
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph.
Discret. Appl. Math., 2022
2021
SIAM J. Discret. Math., 2021
Proceedings of the Approximation, 2021
2020
Theor. Comput. Sci., 2020
SIAM J. Discret. Math., 2020
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks, 2020
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties.
Theory Comput. Syst., 2020
J. Comput. Syst. Sci., 2020
Eur. J. Comb., 2020
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph.
CoRR, 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
Proceedings of the 25th International Conference on Pattern Recognition, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the Treewidth, Kernels, and Algorithms, 2020
2019
Theor. Comput. Sci., 2019
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
2018
ACM Trans. Algorithms, 2018
Electron. Notes Discret. Math., 2018
Algorithmica, 2018
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018
2017
J. Comput. Syst. Sci., 2017
J. Comput. Syst. Sci., 2017
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.
Inf. Comput., 2017
Eur. J. Comb., 2017
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017
2016
Theor. Comput. Sci., 2016
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013.
Discret. Appl. Math., 2016
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
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
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
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
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015
2014
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014
Proceedings of the 2014 SIAM International Conference on Data Mining, 2014
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
2013
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2).
NII Shonan Meet. Rep., 2013
Knowl. Inf. Syst., 2013
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121).
Dagstuhl Reports, 2013
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
Theor. Comput. Sci., 2012
Theory Comput. Syst., 2012
J. Comput. Syst. Sci., 2012
Discret. Appl. Math., 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012
2011
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
SIAM J. Discret. Math., 2011
J. Graph Theory, 2011
J. Discrete Algorithms, 2011
Discret. Optim., 2011
Discret. Appl. Math., 2011
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071).
Dagstuhl Reports, 2011
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.
Algorithmica, 2011
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Proceedings of the Algorithms - ESA 2011, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
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
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010
Proceedings of the Algorithms, 2010
2009
J. Discrete Algorithms, 2009
J. Comput. Syst. Sci., 2009
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs.
Electron. Notes Discret. Math., 2009
Electron. Notes Discret. Math., 2009
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
J. Comput. Syst. Sci., 2008
Algorithmica, 2008
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
2006
SIAM J. Comput., 2006
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006
Proceedings of the Algorithm Theory, 2006
2005
Fixed-parameter algorithms for (<i>k</i>, <i>r</i>)-center in planar graphs and map graphs.
ACM Trans. Algorithms, 2005
Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i>-minor-free graphs.
J. ACM, 2005
Electron. Notes Discret. Math., 2005
Parameterized Complexity for Graph Layout Problems.
Bull. EATCS, 2005
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.
Discret. Appl. Math., 2005
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.
Algorithmica, 2005
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
2004
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci., 2004
Electron. Notes Discret. Math., 2004
Proceedings of the STACS 2004, 2004
Subexponential parameterized algorithms on graphs of bounded-genus and <i>H</i>-minor-free graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004
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
Discret. Appl. Math., 2003
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
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Exponential Speedup of Fixed-Parameter Algorithms on K<sub>3, 3</sub>-Minor-Free or K<sub>5</sub>-Minor-Free Graphs.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
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 K<sub>3, 3</sub>-minor-free or K<sub>5</sub>-minor-free graphs.
Electron. Notes Discret. Math., 2001
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
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
2000
Int. J. Found. Comput. Sci., 2000
Discret. Appl. Math., 2000
On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints.
Constraints An Int. J., 2000
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
1999
Electron. Notes Discret. Math., 1999
1997
Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems.
Inf. Process. Lett., 1997
Inf. Process. Lett., 1997
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
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