default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitrios M. Thilikos
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j154]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A constant-factor approximation for weighted bond cover. J. Comput. Syst. Sci. 149: 103617 (2025)- [c133]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. SODA 2025: 3728-3742 - [c132]Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos:
Finding irrelevant vertices in linear time on bounded-genus graphs. SODA 2025: 3762-3774 - 2024
- [j153]Dimitrios M. Thilikos
, Sebastian Wiederrecht:
Killing a Vortex. J. ACM 71(4): 27:1-27:56 (2024) - [j152]Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on theory and applications of Graph Searching. Theor. Comput. Sci. 1016: 114759 (2024) - [j151]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. TheoretiCS 3 (2024) - [c131]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Obstructions to Erdös-Pósa Dualities for Minors. FOCS 2024: 31-52 - [c130]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP 2024: 114:1-114:19 - [c129]Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos:
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. IWOCA 2024: 247-258 - [c128]Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS 2024: 68:1-68:12 - [c127]Dimitrios M. Thilikos, Sebastian Wiederrecht:
Approximating Branchwidth on Parametric Extensions of Planarity. WG 2024: 460-474 - [i84]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR abs/2406.16647 (2024) - [i83]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR abs/2406.18465 (2024) - [i82]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Obstructions to Erdös-Pósa Dualities for Minors. CoRR abs/2407.09671 (2024) - [i81]Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Vertex identification to a forest. CoRR abs/2409.08883 (2024) - 2023
- [j150]Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. 341: 40-54 (2023) - [j149]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
The mixed search game against an agile and visible fugitive is monotone. Discret. Math. 346(4): 113345 (2023) - [j148]Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros:
On Strict Brambles. Graphs Comb. 39(2): 24 (2023) - [j147]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. 293: 105049 (2023) - [j146]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of minor-closed graph classes. I. Bounding the obstructions. J. Comb. Theory B 161: 180-227 (2023) - [j145]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52(4): 865-912 (2023) - [j144]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Combing a Linkage in an Annulus. SIAM J. Discret. Math. 37(4): 2332-2364 (2023) - [j143]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms 19(3): 23:1-23:29 (2023) - [c126]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. ICALP 2023: 61:1-61:21 - [c125]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP 2023: 93:1-93:19 - [c124]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming on Bipartite Tree Decompositions. IPEC 2023: 26:1-26:22 - [c123]Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA 2023: 2111-2121 - [c122]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Kernelization for Graph Packing Problems via Rainbow Matching. SODA 2023: 3654-3663 - [c121]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA 2023: 3684-3699 - [i80]Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR abs/2302.07033 (2023) - [i79]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos:
Graph Parameters, Universal Obstructions, and WQO. CoRR abs/2304.03688 (2023) - [i78]Dimitrios M. Thilikos, Sebastian Wiederrecht:
Approximating branchwidth on parametric extensions of planarity. CoRR abs/2304.04517 (2023) - [i77]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos:
Universal Obstructions of Graph Parameters. CoRR abs/2304.14121 (2023) - [i76]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming on bipartite tree decompositions. CoRR abs/2309.07754 (2023) - 2022
- [j142]Julien Baste, Dimitrios M. Thilikos:
Contraction Bidimensionality of Geometric Intersection Graphs. Algorithmica 84(2): 510-531 (2022) - [j141]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discret. Appl. Math. 312: 72-85 (2022) - [j140]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. Graphs Comb. 38(5): 133 (2022) - [j139]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. 36(1): 411-435 (2022) - [j138]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. ACM Trans. Algorithms 18(3): 21:1-21:30 (2022) - [j137]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. 23(3): 17:1-17:35 (2022) - [j136]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14(3-4): 1-29 (2022) - [c120]Dimitrios M. Thilikos, Sebastian Wiederrecht:
Killing a vortex. FOCS 2022: 1069-1080 - [i75]Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros:
On Strict Brambles. CoRR abs/2201.05783 (2022) - [i74]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
The mixed search game against an agile and visible fugitive is monotone. CoRR abs/2204.10691 (2022) - [i73]Dimitrios M. Thilikos, Sebastian Wiederrecht:
Killing a Vortex. CoRR abs/2207.04923 (2022) - [i72]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR abs/2207.06874 (2022) - [i71]Julien Baste, Dimitrios M. Thilikos:
Contraction Bidimensionality of Geometric Intersection Graphs. CoRR abs/2207.09751 (2022) - [i70]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. CoRR abs/2210.02167 (2022) - [i69]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR abs/2211.01723 (2022) - [i68]Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR abs/2212.09348 (2022) - 2021
- [j135]Dimitrios M. Thilikos:
Compactors for parameterized counting problems. Comput. Sci. Rev. 39: 100344 (2021) - [j134]Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis:
Minor obstructions for apex-pseudoforests. Discret. Math. 344(10): 112529 (2021) - [j133]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
A Menger-like property of tree-cut width. J. Comb. Theory B 148: 1-22 (2021) - [j132]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected search for a lazy robber. J. Graph Theory 97(4): 510-552 (2021) - [j131]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. Theory Comput. Syst. 65(5): 815-838 (2021) - [j130]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35(1): 105-151 (2021) - [c119]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM 2021: 7:1-7:14 - [c118]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. LICS 2021: 1-13 - [c117]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. WG 2021: 28-38 - [c116]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG 2021: 308-320 - [i67]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
A more accurate view of the Flat Wall Theorem. CoRR abs/2102.06463 (2021) - [i66]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs. CoRR abs/2102.13409 (2021) - [i65]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR abs/2103.00882 (2021) - [i64]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. CoRR abs/2103.01872 (2021) - [i63]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR abs/2103.06536 (2021) - [i62]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR abs/2103.06614 (2021) - [i61]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR abs/2104.02998 (2021) - [i60]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-factor Approximation for Weighted Bond Cover. CoRR abs/2105.00857 (2021) - [i59]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR abs/2106.03425 (2021) - [i58]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. CoRR abs/2111.02755 (2021) - [i57]Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
Edge-trewidth: Algorithmic and combinatorial properties. CoRR abs/2112.07524 (2021) - 2020
- [j129]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Subgraph Complementation. Algorithmica 82(7): 1859-1880 (2020) - [j128]Dimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris Zoros:
Sparse obstructions for minor-covering parameters. Discret. Appl. Math. 278: 28-50 (2020) - [j127]Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona:
Minor-obstructions for apex sub-unicyclic graphs. Discret. Appl. Math. 284: 538-555 (2020) - [j126]Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona:
Structure and enumeration of K4-minor-free links and link-diagrams. Eur. J. Comb. 89: 103147 (2020) - [j125]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. 109: 56-77 (2020) - [j124]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory Comput. Syst. 64(2): 251-271 (2020) - [j123]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75(3): 259-277 (2020) - [j122]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. SIAM J. Comput. 49(6): 1397-1422 (2020) - [j121]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. 34(3): 1623-1648 (2020) - [j120]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. 814: 135-152 (2020) - [j119]Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos:
Edge degeneracy: Algorithmic and structural results. Theor. Comput. Sci. 839: 164-175 (2020) - [c115]Dimitrios M. Thilikos:
A Retrospective on (Meta) Kernelization. Treewidth, Kernels, and Algorithms 2020: 222-246 - [c114]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA 2020: 51:1-51:17 - [c113]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA 2020: 64:1-64:16 - [c112]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP 2020: 95:1-95:20 - [c111]Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis:
Hcore-Init: Neural Network Initialization based on Graph Degeneracy. ICPR 2020: 5852-5858 - [c110]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. SODA 2020: 931-950 - [c109]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA 2020: 951-970 - [i56]Christophe Paul, Guillaume Mescoff, Dimitrios M. Thilikos:
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. CoRR abs/2004.00547 (2020) - [i55]Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis:
Hcore-Init: Neural Network Initialization based on Graph Degeneracy. CoRR abs/2004.07636 (2020) - [i54]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A linear fixed parameter tractable algorithm for connected pathwidth. CoRR abs/2004.11937 (2020) - [i53]Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR abs/2004.12692 (2020) - [i52]Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos:
Edge Degeneracy: Algorithmic and Structural Results. CoRR abs/2009.03809 (2020)
2010 – 2019
- 2019
- [j118]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81(2): 557-588 (2019) - [j117]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels for Packing Problems. Algorithmica 81(4): 1615-1656 (2019) - [j116]Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on Theory and Applications of Graph Searching. Theor. Comput. Sci. 794: 1-2 (2019) - [c108]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected Search for a Lazy Robber. FSTTCS 2019: 7:1-7:14 - [c107]Petr A. Golovach, Dimitrios M. Thilikos:
Clustering to Given Connectivities. IPEC 2019: 18:1-18:17 - [c106]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. SOFSEM 2019: 67-80 - [c105]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Modification to Planarity is Fixed Parameter Tractable. STACS 2019: 28:1-28:17 - [c104]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS 2019: 32:1-32:14 - [e3]Ignasi Sau, Dimitrios M. Thilikos:
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers. Lecture Notes in Computer Science 11789, Springer 2019, ISBN 978-3-030-30785-1 [contents] - [i51]Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR abs/1907.02919 (2019) - [i50]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR abs/1907.04442 (2019) - 2018
- [j115]Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80(1): 116-135 (2018) - [j114]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(log OPT)-Approximation for Covering and Packing Minor Models of θr. Algorithmica 80(4): 1330-1356 (2018) - [j113]Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona:
Structure and Enumeration of K4-minor-free links and link diagrams. Electron. Notes Discret. Math. 68: 119-124 (2018) - [j112]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. SIAM J. Discret. Math. 32(4): 2612-2635 (2018) - [j111]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms 14(1): 6:1-6:31 (2018) - [c103]Ioannis Giotis, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. GASCom 2018: 148-155 - [c102]Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos:
Data-Compression for Parametrized Counting Problems on Sparse Graphs. ISAAC 2018: 20:1-20:13 - [c101]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC 2018: 2:1-2:13 - [c100]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Partial Complementation of Graphs. SWAT 2018: 21:1-21:13 - [i49]Petr A. Golovach, Dimitrios M. Thilikos:
Clustering to Given Connectivities. CoRR abs/1803.09483 (2018) - [i48]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Partial complementation of graphs. CoRR abs/1804.10920 (2018) - [i47]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. CoRR abs/1805.04375 (2018) - [i46]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean tree-cut decompositions: obstructions and algorithms. CoRR abs/1808.00863 (2018) - [i45]Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos:
Data-compression for Parametrized Counting Problems on Sparse graphs. CoRR abs/1809.08160 (2018) - [i44]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. CoRR abs/1810.11700 (2018) - 2017
- [j110]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. Discret. Appl. Math. 217: 536-547 (2017) - [j109]Jean-Florent Raymond, Dimitrios M. Thilikos:
Recent techniques and results on the Erdős-Pósa property. Discret. Appl. Math. 231: 25-43 (2017) - [j108]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
Minors in graphs of large ϴr-girth. Eur. J. Comb. 65: 106-121 (2017) - [j107]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. 65: 154-167 (2017) - [j106]Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia:
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. 257: 139-156 (2017) - [j105]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a planar graph of given degrees. J. Comput. Syst. Sci. 85: 168-182 (2017) - [j104]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. 86: 191-206 (2017) - [j103]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89: 315-327 (2017) - [j102]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B 122: 815-843 (2017) - [j101]Jean-Florent Raymond, Dimitrios M. Thilikos:
Low Polynomial Exclusion of Planar Graph Patterns. J. Graph Theory 84(1): 26-44 (2017) - [j100]Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. SIAM J. Discret. Math. 31(1): 511-541 (2017) - [j99]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
Acyclic edge coloring through the Lovász Local Lemma. Theor. Comput. Sci. 665: 40-50 (2017) - [c99]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP 2017: 57:1-57:15 - [c98]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC 2017: 3:1-3:12 - [c97]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC 2017: 4:1-4:12 - [c96]Julien Baste, Dimitrios M. Thilikos:
Contraction-Bidimensionality of Geometric Intersection Graphs. IPEC 2017: 5:1-5:13 - [c95]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. MFCS 2017: 29:1-29:13 - [i43]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR abs/1703.01686 (2017) - [i42]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR abs/1704.07284 (2017) - [i41]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. CoRR abs/1706.04255 (2017) - 2016
- [j98]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. Algorithmica 76(2): 401-425 (2016) - [j97]Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos:
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Discret. Appl. Math. 199: 1-2 (2016) - [j96]Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros:
Contraction obstructions for connected graph searching. Discret. Appl. Math. 209: 27-47 (2016) - [j95]Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An edge variant of the Erdős-Pósa property. Discret. Math. 339(8): 2027-2035 (2016) - [j94]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016) - [j93]Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos:
Minimal disconnected cuts in planar graphs. Networks 68(4): 250-259 (2016) - [j92]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 655: 1 (2016) - [c94]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. IPEC 2016: 15:1-15:13 - [c93]Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros:
FPT Algorithms for Plane Completion Problems. MFCS 2016: 26:1-26:13 - [c92]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and Covering Immersion Models of Planar Subcubic Graphs. WG 2016: 74-84 - [r3]Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensionality. Encyclopedia of Algorithms 2016: 203-207 - [r2]Fedor V. Fomin, Dimitrios M. Thilikos:
Branchwidth of Graphs. Encyclopedia of Algorithms 2016: 232-237 - [i40]Jean-Florent Raymond, Dimitrios M. Thilikos:
Recent techniques and results on the Erdős-Pósa property. CoRR abs/1603.04615 (2016) - [i39]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. CoRR abs/1606.05689 (2016) - [i38]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: obstructions and algorithmic aspects. CoRR abs/1606.05975 (2016) - [i37]Christos Giatsidis, Fragkiskos D. Malliaros, Nikolaos Tziortziotis, Charanpal Dhanjal, Emmanouil Kiagias, Dimitrios M. Thilikos, Michalis Vazirgiannis:
A k-core Decomposition Framework for Graph Clustering. CoRR abs/1607.02096 (2016) - [i36]Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna:
Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR abs/1609.07780 (2016) - [i35]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels for packing problems. CoRR abs/1610.06131 (2016) - 2015
- [j91]Archontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos:
Forbidding Kuratowski Graphs as Immersions. J. Graph Theory 78(1): 43-60 (2015) - [j90]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. 29(4): 1864-1894 (2015) - [c91]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. ANALCO 2015: 16-25 - [c90]Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR 2015: 123-142 - [c89]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CSR 2015: 143-156 - [c88]Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos:
Minimal Disconnected Cuts in Planar Graphs. FCT 2015: 243-254 - [c87]Dimitrios M. Thilikos:
Bidimensionality and Parameterized Algorithms (Invited Talk). IPEC 2015: 1-16 - [c86]Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos:
Variants of Plane Diameter Completion. IPEC 2015: 30-42 - [c85]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC 2015: 78-89 - [c84]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. WAOA 2015: 35-46 - [c83]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA 2015: 122-132 - [i34]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
An alternative proof for the constructive Asymmetric Lovász Local Lemma. CTW 2015: 89-92 - [i33]Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros:
A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW 2015: 97-100 - [i32]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
An alternative proof for the constructive Asymmetric Lovász Local Lemma. CoRR abs/1505.02568 (2015) - [i31]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CoRR abs/1508.02773 (2015) - [i30]Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos:
Variants of Plane Diameter Completion. CoRR abs/1509.00757 (2015) - [i29]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR abs/1509.04880 (2015) - [i28]Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR abs/1509.07404 (2015) - [i27]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
Minors in graphs of large $θr-girth. CoRR abs/1510.03041 (2015) - [i26]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(log OPT)-approximation for covering and packing minor models of $θr. CoRR abs/1510.03945 (2015) - [i25]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. CoRR abs/1511.04952 (2015) - 2014
- [j89]Nestor V. Nestoridis, Dimitrios M. Thilikos:
Square roots of minor closed graph classes. Discret. Appl. Math. 168: 34-39 (2014) - [j88]Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki:
Outerplanar obstructions for matroid pathwidth. Discret. Math. 315-316: 95-101 (2014) - [j87]Gregory Z. Gutin, Dimitrios M. Thilikos:
Report on NII Shonan Meeting 2013-018. Bull. EATCS 112 (2014) - [j86]Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos:
Lift-contractions. Eur. J. Comb. 35: 286-296 (2014) - [j85]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming for graphs on surfaces. ACM Trans. Algorithms 10(2): 8:1-8:26 (2014) - [c82]Christos Giatsidis, Fragkiskos D. Malliaros, Dimitrios M. Thilikos, Michalis Vazirgiannis:
CoreCluster: A Degeneracy Based Graph Clustering Framework. AAAI 2014: 44-50 - [c81]Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. ESA 2014: 492-504 - [c80]Christos Giatsidis, Bogdan Cautis, Silviu Maniu, Dimitrios M. Thilikos, Michalis Vazirgiannis:
Quantifying trust dynamics in signed graphs, the S-Cores approach. SDM 2014: 668-676 - [c79]Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos:
Bidimensionality of Geometric Intersection Graphs. SOFSEM 2014: 293-305 - [c78]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. STACS 2014: 312-324 - [i24]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR abs/1403.5702 (2014) - [i23]Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
On the Algorithmic Lovász Local Lemma. CoRR abs/1407.5374 (2014) - [i22]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. CoRR abs/1408.6388 (2014) - [i21]Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. CoRR abs/1412.3955 (2014) - 2013
- [j84]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Characterizing graphs of small carving-width. Discret. Appl. Math. 161(13-14): 1888-1893 (2013) - [j83]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Asymptotic enumeration of non-crossing partitions on surfaces. Discret. Math. 313(5): 635-649 (2013) - [j82]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) - [j81]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Optimizing the Graph Minors Weak Structure Theorem. SIAM J. Discret. Math. 27(3): 1209-1227 (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) - [c77]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 - [c76]Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos:
Excluding Graphs as Immersions in Surface Embedded Graphs. WG 2013: 274-285 - [i20]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. CTW 2013: 117-120 - [i19]Jean-Florent Raymond, Dimitrios M. Thilikos:
Low Polynomial Exclusion of Planar Graph Patterns. CoRR abs/1305.7112 (2013) - [i18]Jean-Florent Raymond, Dimitrios M. Thilikos:
Polynomial Gap Extensions of the Erdős-Pósa Theorem. CoRR abs/1305.7376 (2013) - [i17]Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos:
Bidimensionality of Geometric Intersection Graphs. CoRR abs/1308.6166 (2013) - [i16]Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR abs/1310.2378 (2013) - [i15]Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An edge variant of the Erdős-Pósa property. CoRR abs/1311.1108 (2013) - [i14]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels via dynamic programming. CoRR abs/1312.6585 (2013) - [i13]Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Dagstuhl Reports 3(3): 51-74 (2013) - [i12]Gregory Z. Gutin, Kazuo Iwama, Dimitrios M. Thilikos:
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2). NII Shonan Meet. Rep. 2013 (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. Discret. Appl. Math. 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. Discret. Appl. Math. 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. Discret. Appl. Math. 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 Dvorák, 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 Trans. Algorithms 9(1): 12:1-12:23 (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) - [c75]Dimitrios M. Thilikos:
Graph Minors and Parameterized Algorithm Design. The Multivariate Algorithmic Revolution and Beyond 2012: 228-256 - [c74]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 - [c73]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for H-minor-free Graphs. COCOON 2012: 86-97 - [c72]Christos Giatsidis, Klaus Berberich, Dimitrios M. Thilikos, Michalis Vazirgiannis:
Visual exploration of collaboration networks based on graph degeneracy. KDD 2012: 1512-1515 - [c71]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 - [c70]Marcin Kaminski, Dimitrios M. Thilikos:
Contraction checking in graphs on surfaces. STACS 2012: 182-193 - [e2]Dimitrios M. Thilikos, Gerhard J. Woeginger:
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 [contents] - [i11]Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos:
Forbidding Kuratowski Graphs as Immersions. CoRR abs/1207.5329 (2012) - [i10]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. Comput. Sci. Rev. 5(4): 279-317 (2011) - [j65]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
On disconnected cuts and separators. Discret. Appl. Math. 159(13): 1345-1351 (2011) - [j64]Ignasi Sau, Dimitrios M. Thilikos:
On self-duality of branchwidth in graphs of bounded genus. Discret. Appl. Math. 159(17): 2184-2186 (2011) - [j63]Petr A. Golovach, Dimitrios M. Thilikos:
Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discret. Optim. 8(1): 72-86 (2011) - [j62]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
A min-max theorem for LIFO-search. Electron. Notes Discret. Math. 38: 395-400 (2011) - [j61]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Lift Contractions. Electron. Notes Discret. Math. 38: 407-412 (2011) - [j60]Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki:
Outerplanar Obstructions for Matroid Pathwidth. Electron. Notes Discret. Math. 38: 541-546 (2011) - [j59]Nestor V. Nestoridis, Dimitrios M. Thilikos:
Square Roots of Minor Closed Graph Classes. Electron. Notes Discret. Math. 38: 681-686 (2011) - [j58]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction obstructions for treewidth. J. Comb. Theory 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. J. Graph Theory 66(3): 235-240 (2011) - [j55]David Richerby, Dimitrios M. Thilikos:
Searching for a Visible, Lazy Fugitive. SIAM J. Discret. 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. Discret. 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) - [c69]Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis:
Evaluating Cooperation in Communities with the k-Core Structure. ASONAM 2011: 87-93 - [c68]Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos:
Odd cyclic surface separators in planar graphs. CTW 2011: 165-167 - [c67]Dimitrios M. Thilikos:
Fast Sub-exponential Algorithms and Compactness in Planar Graphs. ESA 2011: 358-369 - [c66]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 - [c65]Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis:
D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. ICDM 2011: 201-210 - [c64]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79 - [c63]Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. IPEC 2011: 80-93 - [c62]Carme Àlvarez, Amalia Duch, Maria J. Serna, Dimitrios M. Thilikos:
On the Existence of Nash Equilibria in Strategic Search Games. TGC 2011: 58-72 - [i9]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Optimizing the Graph Minors Weak Structure Theorem. CoRR abs/1102.5762 (2011) - [i8]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Asymptotic Enumeration of Non-crossing Partitions on Surfaces. CoRR abs/1104.2477 (2011) - [i7]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for Graphs on Surfaces. CoRR abs/1104.2486 (2011) - [i6]Rodney G. Downey, Dimitrios M. Thilikos:
Confronting Intractability via Parameters. CoRR abs/1106.3161 (2011) - [i5]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×∞)-grid. Discret. Math. 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) - [c61]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109 - [c60]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contractions of Planar Graphs in Polynomial Time. ESA (1) 2010: 122-133 - [c59]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for Graphs on Surfaces. ICALP (1) 2010: 372-383 - [c58]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. SODA 2010: 503-510 - [c57]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 - [c56]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333 - [c55]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximation Algorithms for Domination Search. WAOA 2010: 130-141 - [e1]Dimitrios M. Thilikos:
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 [contents] - [i4]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. Electron. Notes Discret. Math. 32: 59-66 (2009) - [j46]Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos:
Outerplanar Obstructions for the Feedback Vertex Set. Electron. Notes Discret. Math. 34: 167-171 (2009) - [j45]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Obstructions for Tree-depth. Electron. Notes Discret. Math. 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. Discret. Math. 23(1): 349-368 (2009) - [c54]Ignasi Sau, Dimitrios M. Thilikos:
On Self-Duality of Branchwidth in Graphs of Bounded Genus. CTW 2009: 19-22 - [c53]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717 - [c52]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. FOCS 2009: 629-638 - [c51]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523 - [c50]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 - [c49]Petr A. Golovach, Dimitrios M. Thilikos:
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC 2009: 210-221 - [c48]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456 - [i3]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction Bidimensionality: the Accurate Picture. Parameterized complexity and approximation algorithms 2009 - [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. Comput. Sci. Rev. 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) - [c47]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 - [c46]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs. SODA 2008: 631-640 - [c45]Athanassios Koutsonas, Dimitrios M. Thilikos:
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. WG 2008: 264-274 - [c44]David Richerby, Dimitrios M. Thilikos:
Searching for a Visible, Lazy Fugitive. WG 2008: 348-359 - [r1]Fedor V. Fomin, Dimitrios M. Thilikos:
Branchwidth of Graphs. Encyclopedia of Algorithms 2008 - [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. Comput. Sci. Rev. 1(2): 103-104 (2007) - [j35]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Complexity issues on bounded restrictive H-coloring. Discret. Math. 307(16): 2082-2093 (2007) - [j34]Fedor V. Fomin, Dimitrios M. Thilikos:
On self duality of pathwidth in polyhedral graph embeddings. J. Graph Theory 55(1): 42-54 (2007) - [c43]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms. ICALP 2007: 15-27 - [c42]David Richerby, Dimitrios M. Thilikos:
Graph Searching in a Crime Wave. WG 2007: 21-32 - 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. J. 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. Discret. Math. 20(2): 357-371 (2006) - [c41]Hannes Moser, Dimitrios M. Thilikos:
Parameterized Complexity of Finding Regular Induced Subgraphs. ACiD 2006: 107-118 - [c40]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 - [c39]Josep Díaz, Dimitrios M. Thilikos:
Fast FPT-Algorithms for Cleaning Grids. STACS 2006: 361-371 - [c38]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT 2006: 172-183 - [c37]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. Discret. Appl. Math. 145(2): 297-305 (2005) - [j27]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. 152(1-3): 229-245 (2005) - [j26]Maria J. Serna, Dimitrios M. Thilikos:
Parameterized Complexity for Graph Layout Problems. Bull. EATCS 86: 41-65 (2005) - [j25]Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca:
Connected Graph Searching in Outerplanar Graphs. Electron. Notes Discret. Math. 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 Trans. Algorithms 1(1): 33-47 (2005) - [c36]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. Electron. Notes Discret. Math. 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. Discret. Math. 18(3): 501-511 (2004) - [c35]Fedor V. Fomin, Dimitrios M. Thilikos:
A 3-Approximation for the Pathwidth of Halin Graphs. CTW 2004: 137-141 - [c34]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 - [c33]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 - [c32]Fedor V. Fomin, Dimitrios M. Thilikos:
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP 2004: 581-592 - [c31]Hans L. Bodlaender, Dimitrios M. Thilikos:
Computing Small Search Numbers in Linear Time. IWPEC 2004: 37-48 - [c30]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126 - [c29]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118 - [c28]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203 - [c27]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 - [c26]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. Discret. Appl. Math. 131(2): 323-335 (2003) - [c25]Fedor V. Fomin, Dimitrios M. Thilikos:
Dominating Sets and Local Treewidth. ESA 2003: 221-229 - [c24]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 - [c23]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 - [c22]Fedor V. Fomin, Dimitrios M. Thilikos:
Dominating sets in planar graphs: branch-width and exponential speed-up. SODA 2003: 168-177 - [c21]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) - [c20]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 - [c19]Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos:
H-Colorings of Large Degree Graphs. EurAsia-ICT 2002: 850-857 - [c18]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 - [c17]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. Electron. Notes Discret. Math. 10: 137-142 (2001) - [c16]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Counting H-Colorings of Partial k-Trees. COCOON 2001: 298-307 - [c15]Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Recent Results on Parameterized H-Colorings. Graphs, Morphisms and Statistical Physics 2001: 65-85 - [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 An Int. J. 5(3): 251-273 (2000) - [j12]Dimitrios M. Thilikos:
Algorithms and obstructions for linear-width and related search parameters. Discret. Appl. Math. 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. Electron. Notes Discret. Math. 3: 184 (1999) - [j8]Dimitrios M. Thilikos:
Quickly Excluding K2, r from Planar Graphs. Electron. Notes Discret. Math. 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. Discret. Appl. Math. 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
[j147] [c126] [j137] [j136] [c118] [c116] [i66] [i61] [i59] [i58] [j129] [j124] [j122] [c114] [c105] [j112] [j111] [c100] [i48] [i47] [c95] [i41] [j94] [j92] [r3] [r2] [i39] [c77] [i13] [j79] [j73] [j72] [j71] [j70] [j68] [c71] [i10] [j58] [j56] [j54] [j53] [j51] [i5] [j49] [c61] [c58] [c56] [c55] [c53] [c52] [c48] [i3] [i2] [j40] [j38] [j37] [c47] [c46] [r1] [i1] [j34] [c43] [j33] [j32] [j31] [c40] [c38] [j25] [j24] [j21] [j20] [j18] [c35] [c32] [c29] [c27] [c26] [j17] [c25] [c24] [c22] [c10]
[c132] [j147] [j144] [j143] [c126] [c121] [j137] [j136] [i69] [c118] [c116] [i66] [i61] [i59] [i58] [j129] [j124] [c114] [c110] [c107] [c105] [i51] [j112] [c100] [i49] [i48] [i47] [j105] [j100] [c95] [i41] [c89] [c86] [i31] [i30] [j86] [c81] [i21] [j80] [j78] [j69] [j63] [j61] [j58] [j54] [c68] [c64] [c55] [c53] [c51] [c49] [c48] [i3] [i1]
Marcin Kaminski 0001
aka: Marcin Jakub Kaminski
aka: Marcin Jakub Kaminski
[c133] [j151] [i83] [i81] [j146] [j145] [c126] [c125] [c124] [i76] [j138] [i70] [i67] [i65] [i63] [i62] [i58] [j125] [j123] [j121] [j120] [c112] [c109] [i53] [j117] [e3] [i50] [j115] [j114] [c101] [j110] [j108] [j104] [j103] [c98] [c97] [i43] [i42] [j95] [i35] [j90] [c90] [c85] [c84] [c83] [i29] [i28] [i27] [i26] [j85] [c78] [i24] [i22] [j83] [i20] [i15] [i14] [j79] [c73] [j64] [j51] [i8] [i7] [j48] [c61] [c59] [c56] [j47] [c54]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
