|
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
SODA 2025 - 36th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2025, New Orleans, United States. pp.403-445, ⟨10.1137/1.9781611978322.12⟩
Communication dans un congrès
lirmm-04918933
v1
|
|
Approximating Branchwidth on Parametric Extensions of Planarity
Dimitrios M. Thilikos
,
Sebastian Wiederrecht
WG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.460-474, ⟨10.1007/978-3-031-75409-8_32⟩
Communication dans un congrès
hal-04986133
v1
|
|
Finding irrelevant vertices in linear time on bounded-genus graphs
Petr A. Golovach
,
Stavros Kolliopoulos
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
SODA 2025 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2025, New Orleans, Louisiana, United States. pp.3762-3774, ⟨10.1137/1.9781611978322.126⟩
Communication dans un congrès
hal-04986101
v1
|
|
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
Nicole Schirrmacher
,
Sebastian Siebertz
,
Giannos Stamoulis
,
Dimitrios Thilikos
,
Alexandre Vigny
LICS 2024 - 39th ACM/IEEE Symposium on Logic in Computer Science, Jul 2024, Tallinn, Estonia. pp.1-12, ⟨10.1145/3661814.3662089⟩
Communication dans un congrès
hal-04625781
v1
|
|
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Filippos Christodoulou
,
Andrea Marino
,
Ana Silva
,
Pierluigi Crescenzi
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-04702099
v1
|
|
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces
Christophe Paul
,
Evangelos Protopapas
,
Dimitrios M. Thilikos
,
Sebastian Wiederrecht
ICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming, Jul 2024, Tallin, Estonia. pp.114:1-114:19, ⟨10.4230/LIPIcs.ICALP.2024.114⟩
Communication dans un congrès
lirmm-04702132
v1
|
|
Obstructions to Erdős-Pósa Dualities for Minors
Christophe Paul
,
Evangelos Protopapas
,
Dimitrios M. Thilikos
,
Sebastian Wiederrecht
Communication dans un congrès
lirmm-04825442
v1
|
|
Compound Logics for Modification Problems
Fedor V. Fomin
,
Petr A. Golovach
,
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.61:1-61:21, ⟨10.4230/LIPIcs.ICALP.2023.61⟩
Communication dans un congrès
lirmm-04253801
v1
|
|
Faster parameterized algorithms for modification problems to minor-closed classes
Laure Morelle
,
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.93:1-93:19, ⟨10.4230/LIPIcs.ICALP.2023.93⟩
Communication dans un congrès
lirmm-04253814
v1
|
|
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
Petr Golovach
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
SODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3684-3699, ⟨10.1137/1.9781611977554.ch141⟩
Communication dans un congrès
hal-04043007
v1
|
|
Dynamic programming on bipartite tree decompositions
Lars Jaffke
,
Laure Morelle
,
Ignasi Sau
,
Dimitrios M. Thilikos
IPEC 2023 - 18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. pp.16:1-16:22, ⟨10.4230/LIPIcs.IPEC.2023.26⟩
Communication dans un congrès
lirmm-04253839
v1
|
|
Excluding Single-Crossing Matching Minors in Bipartite Graphs
Archontia Giannopoulou
,
Dimitrios M. Thilikos
,
Sebastian Wiederrecht
Communication dans un congrès
hal-04042983
v1
|
|
Kernelization for Graph Packing Problems via Rainbow Matching
Stéphane Bessy
,
Marin Bougeret
,
Dimitrios M. Thilikos
,
Sebastian Wiederrecht
SODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩
Communication dans un congrès
hal-04042995
v1
|
|
Killing a vortex
Dimitrios M. Thilikos
,
Sebastian Wiederrecht
FOCS 2022 - 63rd IEEE Annual Symposium on Foundations of Computer Science, Oct 2022, Denver, United States. pp.1069-1080, ⟨10.1109/FOCS54457.2022.00104⟩
Communication dans un congrès
hal-04043027
v1
|
|
Parameterized Complexity of Elimination Distance to First-Order Logic Properties
Fedor V. Fomin
,
Petr A. Golovach
,
Dimitrios M. Thilikos
Communication dans un congrès
hal-04043100
v1
|
|
Hcore-Init: Neural Network Initialization based on Graph Degeneracy
Stratis Limnios
,
George Dasoulas
,
Dimitrios M. Thilikos
,
Michalis Vazirgiannis
Communication dans un congrès
hal-03002744
v2
|
|
A Constant-Factor Approximation for Weighted Bond Cover
Eun Jung Kim
,
Euiwoong Lee
,
Dimitrios M. Thilikos
APPROX/RANDOM 2021 - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Aug 2021, Seattle, United States. pp.7:1--7:14, ⟨10.4230/LIPIcs.APPROX/RANDOM.2021.7⟩
Communication dans un congrès
hal-03390188
v1
|
|
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
Fedor V. Fomin
,
Petr A. Golovach
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
Communication dans un congrès
hal-03002709
v1
|
|
Hitting topological minor models in planar graphs is fixed parameter tractable
Petr A. Golovach
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
SODA 2020 - 31st ACM/SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.931-950, ⟨10.1137/1.9781611975994.56⟩
Communication dans un congrès
hal-03003167
v1
|
|
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
SODA 2020 - 31st ACM/SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.951-970, ⟨10.1137/1.9781611975994.57⟩
Communication dans un congrès
lirmm-02991215
v1
|
|
A linear fixed parameter tractable algorithm for connected pathwidth
Mamadou Moustapha Kanté
,
Christophe Paul
,
Dimitrios M. Thilikos
Communication dans un congrès
hal-03002761
v1
|
|
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.95:1-95:20, ⟨10.4230/LIPIcs.ICALP.2020.95⟩
Communication dans un congrès
lirmm-02991704
v1
|
|
Lean Tree-Cut Decompositions: Obstructions and Algorithms
Archontia C. Giannopoulou
,
O-Joung Kwon
,
Jean-Florent Raymond
,
Dimitrios M. Thilikos
STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14, ⟨10.4230/LIPIcs.STACS.2019.32⟩
Communication dans un congrès
lirmm-02342775
v1
|
|
Modification to Planarity is Fixed Parameter Tractable
Fedor V. Fomin
,
Petr A. Golovach
,
Dimitrios M. Thilikos
STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.28:1--28:17, ⟨10.4230/LIPIcs.STACS.2019.28⟩
Communication dans un congrès
lirmm-02342768
v1
|
|
Minimum Reload Cost Graph Factors
Julien Baste
,
Didem Gözüpek
,
Mordechai Shalom
,
Dimitrios M. Thilikos
SOFSEM 2019 - 45th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2019, Nový Smokovec, Slovakia. pp.67-80, ⟨10.1007/978-3-030-10801-4_7⟩
Communication dans un congrès
lirmm-02342817
v1
|
|
Connected Search for a Lazy Robber
Isolde Adler
,
Christophe Paul
,
Dimitrios M. Thilikos
FSTTCS 2019 - 39th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.7:1--7:14, ⟨10.4230/LIPIcs.FSTTCS.2019.7⟩
Communication dans un congrès
hal-03003243
v1
|
|
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13, ⟨10.4230/LIPIcs.IPEC.2018.2⟩
Communication dans un congrès
lirmm-02342806
v1
|
|
Clustering to Given Connectivities
Petr A. Golovach
,
Dimitrios M. Thilikos
IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.18:1-18:17, ⟨10.4230/LIPIcs.IPEC.2019.18⟩
Communication dans un congrès
hal-03003256
v1
|
|
Contraction-Bidimensionality of Geometric Intersection Graphs
Julien Baste
,
Dimitrios M. Thilikos
IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.5:1--5:13, ⟨10.4230/LIPIcs.IPEC.2017.5⟩
Communication dans un congrès
lirmm-01890527
v1
|
|
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12, ⟨10.4230/LIPIcs.IPEC.2017.4⟩
Communication dans un congrès
hal-01733845
v1
|
|
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma
Ioannis Giotis
,
Lefteris Kirousis
,
John Livieratos
,
Kostas I Psaromiligkos
,
Dimitrios M. Thilikos
International Conference on Random and Exhaustive Generation of Combinatorial Structures (GASCom), Jun 2018, Athens, Greece. pp.148-155
Communication dans un congrès
lirmm-01890510
v1
|
|
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter
Julien Baste
,
Didem Gözüpek
,
Ignasi Sau
,
Mordechai Shalom
,
Dimitrios M. Thilikos
IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12, ⟨10.4230/LIPIcs.IPEC.2017.3⟩
Communication dans un congrès
hal-01733767
v1
|
|
Data-Compression for Parametrized Counting Problems on Sparse Graphs
Eun Jung Kim
,
Maria Serna
,
Dimitrios M. Thilikos
29th International Symposium on Algorithms and Computation (ISAAC), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13, ⟨10.4230/LIPIcs.ISAAC.2018.20⟩
Communication dans un congrès
lirmm-02342803
v1
|
|
Partial complementation of graphs
Fedor V. Fomin
,
Petr A. Golovach
,
Torstein J F Strømme
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-01890534
v1
|
|
Cutwidth: obstructions and algorithmic aspects
Archontia C. Giannopoulou
,
Michał Pilipczuk
,
Jean-Florent Raymond
,
Dimitrios M. Thilikos
,
Marcin Wrochna
IPEC 2016 - 11th International Symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩
Communication dans un congrès
lirmm-01370305
v1
|
|
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
Archontia C. Giannopoulou
,
Michal Pilipczuk
,
Jean-Florent Raymond
,
Dimitrios M. Thilikos
,
Marcin Wrochna
Communication dans un congrès
lirmm-01610076
v1
|
|
Structured Connectivity Augmentation
Fedor V. Fomin
,
Petr A. Golovach
,
Dimitrios M. Thilikos
MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.29:1--29:13, ⟨10.4230/LIPIcs.MFCS.2017.29⟩
Communication dans un congrès
lirmm-01890542
v1
|
|
An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$
Dimitris Chatzidimitriou
,
Jean-Florent Raymond
,
Ignasi Sau
,
Dimitrios M. Thilikos
Communication dans un congrès
hal-01218496
v1
|
|
FPT Algorithms for Plane Completion Problems
Dimitris Chatzidimitriou
,
Archontia C. Giannopoulou
,
Spyridon Maniatis
,
Clément Requilé
,
Dimitrios M. Thilikos
et al.
Communication dans un congrès
lirmm-01370324
v1
|
|
Packing and Covering Immersion Models of Planar subcubic Graphs
Archontia C. Giannopoulou
,
O-Joung Kwon
,
Jean-Florent Raymond
,
Dimitrios M. Thilikos
WG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩
Communication dans un congrès
lirmm-01370310
v2
|
|
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
Eun Jung Kim
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩
Communication dans un congrès
lirmm-01263999
v1
|
|
A Fixed Parameter Algorithm for Plane Subgraph Completion
Dimitris Chatzidimitriou
,
Archontia C. Giannopoulou
,
Clément Requilé
,
Dimitrios M. Thilikos
,
Dimitris Zoros
CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, Istanbul, Turkey
Communication dans un congrès
lirmm-01370331
v1
|
|
An FPT 2-Approximation for Tree-cut Decomposition
Eun Jung Kim
,
Sang-Il Oum
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩
Communication dans un congrès
lirmm-01264015
v1
|
|
Editing to a Planar Graph of Given Degrees
Konrad K. Dabrowski
,
Petr A. Golovach
,
Pim Van'T Hof
,
Daniël Paulusma
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-01225602
v1
|
|
Variants of Plane Diameter Completion
Clément Requilé
,
Dimitrios M. Thilikos
,
Petr A. Golovach
IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42, ⟨10.4230/LIPIcs.IPEC.2015.30⟩
Communication dans un congrès
lirmm-01225566
v1
|
|
An alternative proof for the constructive Asymmetric Lovász Local Lemma
Ioannis Giotis
,
Lefteris Kirousis
,
Kostas I. Psaromiligkos
,
Dimitrios M. Thilikos
CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, İstanbul, Turkey
Communication dans un congrès
lirmm-01370328
v1
|
|
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
Nathann Cohen
,
Daniel Gonçalves
,
Eun Jung Kim
,
Christophe Paul
,
Ignasi Sau
et al.
Communication dans un congrès
hal-01178222
v1
|
|
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
Ioannis Giotis
,
Lefteris Kirousis
,
Kostas I. Psaromiligkos
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-01225505
v1
|
|
Algorithms and Combinatorics on the Erdős–Pósa property
Dimitrios M. Thilikos
AGTAC: Algorithmic Graph Theory on the Adriatic Coast, Jun 2015, Koper, Slovenia
Communication dans un congrès
lirmm-01483655
v1
|
|
Minimal Disconnected Cuts in Planar Graphs
Marcin J. Kaminski
,
Daniël Paulusma
,
Stewart Anthony
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-01225549
v1
|
|
Bidimensionality and Parameterized Algorithms
Dimitrios M. Thilikos
IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.1-16, ⟨10.4230/LIPIcs.IPEC.2015.1⟩
Communication dans un congrès
lirmm-01370293
v1
|
|
Contraction Obstructions for Connected Graph Searching
Best Micah J
,
Arvind Gupta
,
Dimitrios M. Thilikos
,
Dimitris Zoros
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-01083704
v1
|
|
CORECLUSTER: A Degeneracy Based Graph Clustering Framework
Christos Giatsidis
,
Fragkiskos Malliaros
,
Dimitrios M. Thilikos
,
Michalis Vazirgiannis
IAAA: Innovative Applications of Artificial Intelligence, Jul 2014, Quebec City, Canada
Communication dans un congrès
lirmm-01083536
v1
|
|
Quantifying trust dynamics in signed graphs, the S-Cores approach
Christos Giatsidis
,
Bogdan Cautis
,
Silviu Maniu
,
Michalis Vazirgiannis
,
Dimitrios M. Thilikos
SDM 2014 - 14th SIAM International Conference on Data Mining, Aug 2014, Philadelphia, United States. pp.668-676, ⟨10.1137/1.9781611973440.77⟩
Communication dans un congrès
lirmm-01083529
v1
|
|
The Parameterized Complexity of Graph Cyclability
Petr A. Golovach
,
Marcin Kamiski
,
Spyridon Maniatis
,
Dimitrios M. Thilikos
Communication dans un congrès
hal-01083993
v1
|
|
Bidimensionality of Geometric Intersection Graphs
Alexander Grigoriev
,
Athanassios Koutsonas
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-00904537
v1
|
|
Covering and packing pumpkin models
Dimitris Chatzidimitriou
,
Jean-Florent Raymond
,
Ignasi Sau
,
Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-01083652
v1
|
|
Geometric Extensions of Cutwidth in any Dimension
Menelaos Karavelas
,
Dimitris Zoros
,
Spyridon Maniatis
,
Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-01083698
v1
|
|
Structure of W_4 -immersion free graphs
Rémy Belmonte
,
Archontia C. Giannopoulou
,
Daniel Lokshtanov
,
Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
hal-01084005
v1
|
|
Explicit linear kernels via dynamic programming
Valentin Garnero
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
Communication dans un congrès
hal-01084007
v1
|
|
An edge variant of the Erdős-Pósa property
Jean-Florent Raymond
,
Ignasi Sau
,
Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
lirmm-00904544
v1
|
|
A linear kernel for planar red-blue dominating set
Valentin Garnero
,
Ignasi Sau
,
Dimitrios M. Thilikos
CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120
Communication dans un congrès
lirmm-00846771
v1
|
|
Evaluating Cooperation in coauthorship graphs with degeneracy
Christos Giatsidis
,
Michalis Vazirgiannis
,
Dimitrios M. Thilikos
BDA: Bases de Données Avancées, Oct 2013, Nantes, France
Communication dans un congrès
lirmm-00904582
v1
|
|
Polynomial Gap Extensions of the Erdős-Pósa Theorem
Jean-Florent Raymond
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-01083659
v1
|
|
Excluding Graphs as Immersions in Surface Embedded Graphs
Archontia C. Giannopoulou
,
Marcin Kamiński
,
Dimitrios M. Thilikos
WG 2013 - 39th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2013, Lübeck, Germany. pp.274-285, ⟨10.1007/978-3-642-45043-3_24⟩
Communication dans un congrès
lirmm-01483644
v1
|
|
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
Fedor V. Fomin
,
Daniel Lokshtanov
,
Saket Saurabh
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-00804758
v1
|
|
Theory and Applications of Bidimensionality
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-01483650
v1
|
|
Contraction checking in graphs on surfaces
Marcin Kaminski
,
Dimitrios M. Thilikos
STACS'12: 29th Symposium on Theoretical Aspects of Computer Science, Feb 2012, Paris, France. pp.182-193
Communication dans un congrès
hal-00678173
v1
|
|
Dynamic Programming for $H$-minor-free Graphs
Juanjo Rué
,
Ignasi Sau
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-00736708
v1
|
|
Fast Minor Testing in Planar Graphs
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Communication dans un congrès
lirmm-00736769
v1
|
|
Dynamic programming for graphs on surfaces
Juanjo Rué
,
Ignasi Sau
,
Dimitrios M. Thilikos
ICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383
Communication dans un congrès
lirmm-00736703
v1
|
|
Approximating Acyclicity Parameters of Sparse Hypergraphs
Fedor V. Fomin
,
Petr A. Golovach
,
Dimitrios M. Thilikos
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.445-456
Communication dans un congrès
inria-00359709
v1
|
|
On Self-Duality of Branchwidth in Graphs of Bounded Genus
Dimitrios M. Thilikos
8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2009, Paris, France. pp.19-22
Communication dans un congrès
hal-00795413
v1
|
|
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs
Dimitrios M. Thilikos
DIMAP workshop on Algorithmic Graph Theory (AGT09), 2009, Warwick, United Kingdom. pp.59-66
Communication dans un congrès
hal-00795284
v1
|