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
- 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) - [c129]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 - [c128]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 - [c127]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 - [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)