Structure Theory for Directed Graphs

Project Information

DISTRUCT

Grant agreement ID: 648527

DOI 10.3030/648527

Project closed

EC signature date 7 April 2015

Start date 1 July 2015

End date 30 June 2021

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 826 773,00

EU contribution € 1 826 773,00

Coordinated by

TECHNISCHE UNIVERSITAT BERLIN
Germany

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Other (7)

Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation

Author(s): Chun-Hung Liu, Irene Muzi
Published in: 2020
Publisher: arXiv

Half-integral Erdös-Pósa property of directed odd cycles

Author(s): Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie
Published in: 2020
Publisher: arXiv.org

A Flat Wall Theorem for Matching Minors in Bipartite Graphs

Author(s): Archontia C.Giannopoulou,Sebastian Wiederrecht
Published in: arXiv, Issue 2110.07553, 2021
Publisher: arXiv.org

Excluding a Planar Matching Minor in Bipartite Graphs

Author(s): Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Published in: 2021
Publisher: arXiv.org

A note on the complexity of Feedback Vertex Set parameterized by mim-width

Author(s): Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
Published in: Issue 5, 2017
Publisher: arxiv

The Erdos-Posa Property for Directed Graphs

Author(s): Amiri, Saeed Akhoondian; Kawarabayashi, Ken-Ichi; Kreutzer, Stephan; Wollan, Paul
Published in: 2016
Publisher: arXiv

Braces of Perfect Matching Width 2

Author(s): Giannopoulou, Archontia C.; Hatzel, Meike; Wiederrecht, Sebastian
Published in: 2019
Publisher: arXiv

Peer reviewed articles (19)

Coloring and Covering Nowhere Dense Graphs

Author(s): Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos
Published in: SIAM Journal of Discrete Mathematics, Issue 32(4), 2018, Page(s) 2467--2481, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1168753

A New Perspective on {FO} Model Checking of Dense Graph Classes

Author(s): Jakub Gajarský, Petr Hliněný, Daniel Lokshtanov, Jan Obdržálek, M. S. Ramanujan
Published in: ACM Trans. Comput. Log., Issue 21(4), 2020, Page(s) 28:1--28:23, ISSN 1529-3785
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3383206

Scattered Classes of Graphs

Author(s): O-Joung Kwon, Sang-il Oum
Published in: SIAM Journal on Discrete Mathematics (SIDMA), Issue 34(1), 2021, Page(s) 972-999, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1293776

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes

Author(s): Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Published in: SIAM Journal on Discrete Mathematics, Issue 35(1), 2021, Page(s) 105-151, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18M1228839

Model-Checking on Ordered Structures

Author(s): Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Published in: ACM Transactions on Computational Logic, Issue 21(2), 2020, Page(s) 11:1-11:28, ISSN 1529-3785
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3360011

Erdős-Pósa property of chordless cycles and its applications

Author(s): Eun Jung Kim, O-joung Kwon
Published in: Journal of Combinatorial Theory, Series B, Issue 145, 2020, Page(s) 65-112, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2020.05.002

Avoidable Paths in Graphs

Author(s): Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
Published in: The Electronic Journal of Combinatorics, Issue 27(4), 2020, Page(s) P4.46, ISSN 1077-8926
Publisher: Electronic Journal of Combinatorics
DOI: 10.37236/9030

A Polynomial Kernel for Distance-Hereditary Vertex Deletion

Author(s): Eun Jung Kim, O-joung Kwon
Published in: Algorithmica, Issue 83(7), 2021, Page(s) 2096-2141, ISSN 1432-0541
Publisher: Springer
DOI: 10.1007/s00453-021-00820-z

Packing and Covering Induced Subdivisions

Author(s): O-joung Kwon, Jean-Florent Raymond
Published in: SIAM Journal of Discrete Mathematics, Issue 35(2), 2021, Page(s) 597--636, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1226166

DAG-width is PSPACE-complete

Author(s): Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich
Published in: Theor. Comput. Sci., Issue 655, 2016, Page(s) 78--89, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2016.09.011

Induced minors and well-quasi-ordering

Author(s): Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
Published in: Journal of Combinatorial Theory, Series B, Issue 134, 2019, Page(s) 110-142, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2018.05.005

Cutwidth: Obstructions and Algorithmic Aspects

Author(s): Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Published in: Algorithmica, Issue 81/2, 2019, Page(s) 557-588, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-018-0424-7

Majority Colourings of Digraphs

Author(s): Stephan Kreutzer, Sang-il Oum, Paul Seymour, Dominic Van der Zypen, David R. Wood
Published in: The Electronic Journal of Combinatorics, Issue 24/2, 2017, ISSN 1077-8926
Publisher: Electronic Journal of Combinatorics
DOI: 10.37236/6410

A Menger-like property of tree-cut width

Author(s): Giannopoulou, Archontia C.; Kwon, O-joung; Raymond, Jean-Florent; Thilikos, Dimitrios M.
Published in: Journal of Combinatorial Theory, Series B, Issue 148, 2021, Page(s) 1-22, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2020.12.005

Matching Connectivity: On the Structure of Graphs with Perfect Matchings

Author(s): Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Published in: Electronic Notes in Discrete Mathematics, Issue 61, 2017, Page(s) 505-511, ISSN 1571-0653
Publisher: Elsevier BV
DOI: 10.1016/j.endm.2017.06.080

Chi-boundedness of graph classes excluding wheel vertex-minors

Author(s): Hojin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Published in: Journal of Combinatorial Theory, Series B, Issue 135, 2019, Page(s) 319-348, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2018.08.009

Packing and covering immersion-expansions of planar sub-cubic graphs

Author(s): Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Published in: European Journal of Combinatorics, Issue 65, 2017, Page(s) 154-167, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2017.05.009

On the Tractability of Optimization Problems on H-Graphs

Author(s): Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
Published in: Algorithmica, Issue 82(9), 2020, Page(s) 2432-2473, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-020-00692-9

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants

Author(s): Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
Published in: ACM Transactions on Algorithms, Issue 16(3), 2020, Page(s) 39:1-39:23, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3386686

Conference proceedings (31)

Packing Directed Circuits Quarter-Integrally

Author(s): Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019, Page(s) 72:1-72:13
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2019.72

A tight Erdős-Pósa function for planar minors

Author(s): Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
Published in: Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019, Page(s) 1485-1500
Publisher: SIAM
DOI: 10.1137/1.9781611975482.90

Directed Tangle Tree-Decompositions and Applications

Author(s): Archontia C. Giannopoulou, Ken-ichi Kawarabayashi,O-joung Kwon,Stephan Kreutzer
Published in: Proceedings of the of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), 2022
Publisher: SIAM

Recovering Sparse Graphs

Author(s): Jakub Gajarsky, Daniel Kral
Published in: 43rd International Symposium on Mathematical Foundations of Computer Science, (MFCS 2018), Issue 117, 2018, Page(s) 29:1--29:15
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2018.29

Computing Shrub-Depth Decompositions

Author(s): Jakub Gajarský, Stephan Kreutzer
Published in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Issue 154, 2020, Page(s) 56:1--56:17
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2020.56

Optimal Discretization is Fixed-parameter Tractable

Author(s): Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, Page(s) 1702--1719
Publisher: SIAM
DOI: 10.1137/1.9781611976465.103

The Directed Flat Wall Theorem

Author(s): Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
Published in: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, January 5-8, 2020, 2020, Page(s) 239258
Publisher: SIAM
DOI: 10.1137/1.9781611975994.15

On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface

Author(s): Albert Atserias, Stephan Kreutzer, Marc Noy
Published in: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Issue 2018, 2018
Publisher: EATCS

Kernelization and Sparseness: the Case of Dominating Set

Author(s): Pål Grønås Drange , Markus Sortland Dregi , Fedor V. Fomin , Stephan Kreutzer , Daniel Lokshtanov , Marcin Pilipczuk , Michal Pilipczuk , Felix Reidl , Fernando S{\'{a}}nchez Villaamil , Saket Saurabh , Sebastian Siebertz , Somnath
Published in: 33rd Symposium on Theoretical Aspects of Computer Science, Issue 33, 2016, Page(s) 31:1--31:14, ISBN 978-3-95977-001-9
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2016.31

A Local Constant Factor MDS Approximation for Bounded Genus Graphs

Author(s): Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
Published in: Proceedings of the 2016 {ACM} Symposium on Principles of Distributed Computing, 2016, Page(s) 227-233, ISBN 978-1-4503-3964-3
Publisher: ACM
DOI: 10.1145/2933057.2933084

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

Author(s): Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, Page(s) 1533-1545, ISBN 978-1-61197-478-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611974782.100

The Generalised Colouring Numbers on Classes of Bounded Expansion

Author(s): Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Published in: 41st International Symposium on Mathematical Foundations of Computer Science, Issue 41, 2017, Page(s) 85:1--85:13, ISBN 978-3-95977-016-3
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2016.85

Routing with Congestion in Acyclic Digraphs

Author(s): Saeed Akhoondian Amiri and Stephan Kreutzer and Dàniel Marx and Roman Rabinovich
Published in: 41st International Symposium on Mathematical Foundations of Computer Science, 2016, Page(s) 7:1--7:11, ISBN 978-3-95977-016-3
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2016.7

Cutwidth: Obstructions and Algorithmic Aspects

Author(s): Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin
Published in: IPEC: International Symposium on Parameterized and Exact Computation, Issue 1, 2016
Publisher: Lipics
DOI: 10.4230/lipics.ipec.2016.15

Transiently Consistent SDN Updates: Being Greedy is Hard

Author(s): Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
Published in: Structural Information and Communication Complexity, Issue 9988, 2016, Page(s) 391-406, ISBN 978-3-319-48313-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-48314-6_25

Erd\H{o}s-P\'osa property of chordless cycles and its applications

Author(s): Kim, Eun Jung; Kwon, O-joung
Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Publisher: SIAM

Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width

Author(s): Jaffke, Lars; Kwon, O-Joung; Telle, Jan Arne
Published in: 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2017
Publisher: Lipics
DOI: 10.4230/lipics.ipec.2017.21

Enumerating Minimal Dominating Sets in Triangle-Free Graphs

Author(s): Bonamy, Marthe; Defrain, Oscar; Heinrich, Marc; Raymond, Jean-Florent
Published in: "36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.16:1--16:12, ⟨10.4230/LIPIcs.STACS.2019.16⟩", Issue 1, 2019
Publisher: Lipics
DOI: 10.4230/LIPIcs.STACS.2019.16

Congestion-Free Rerouting of Flows on DAGs

Author(s): Akhoondian Amiri, Saeed; Dudycz, Szymon; Schmid, Stefan; Wiederrecht, Sebastian
Published in: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Issue 45, 2018, ISBN 978-3-95977-076-7
Publisher: Lipics
DOI: 10.4230/lipics.icalp.2018.143

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width

Author(s): Bergougnoux, Benjamin; Kwon, O-joung; Kanté, Mamadou Moustapha
Published in: 15th International Symposium on Algorithms and Data Structures (WADS), Issue 15, 2017, Page(s) 121--132
Publisher: Springer

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs

Author(s): Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
Published in: Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers, Issue 11789, 2019, Page(s) 53-65, ISBN 978-3-030-30785-1
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-30786-8_5

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width

Author(s): Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
Published in: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Issue 35, 2018
Publisher: Lipics
DOI: 10.4230/lipics.stacs.2018.42

FPT Algorithms for Plane Completion Problems

Author(s): Chatzidimitriou, Dimitris; Giannopoulou, Archontia C.; Maniatis, Spyridon; Requilé, Clément; Thilikos, Dimitrios M.; Zoros, Dimitris
Published in: MFCS: Mathematical Foundations of Computer Science, Issue 24, 2016
Publisher: Lipics
DOI: 10.4230/LIPIcs.MFCS.2016.26

Neighborhood complexity and kernelization for nowhere dense classes of graphs

Author(s): Eickmeyer, Kord; Giannopoulou, Archontia C.; Kreutzer, Stephan; Kwon, O-Joung; Pilipczuk, Michal; Rabinovich, Roman; Siebertz, Sebastian
Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Issue 44, 2017
Publisher: Lipics
DOI: 10.4230/lipics.icalp.2017.63

First-Order Interpretations of Bounded Expansion Classes

Author(s): Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; de Mendez, Patrice Ossona; Pilipczuk, Michał; Siebertz, Sebastian; Toruńczyk, Szymon
Published in: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Issue 45, 2018
Publisher: Lipics
DOI: 10.4230/lipics.icalp.2018.126

Lean Tree-Cut Decompositions: Obstructions and Algorithms

Author(s): Giannopoulou, Archontia; Kwon, O-joung; Raymond, Jean-Florent; Thilikos, Dimitrios M.,
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Issue 36, 2019
Publisher: Lipics
DOI: 10.4230/lipics.stacs.2019.32

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes

Author(s): Giannopoulou, Archontia C.; Pilipczuk, Michał; Thilikos, Dimitrios M.; Raymond, Jean-Florent; Wrochna, Marcin
Published in: "ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. 44th International Colloquium on Automata, Languages, and Programming, 80 (57), pp.1-15, 2017, Leibniz International Proceedings in Informatics (LIPIcs). 〈10.4230/LIPIcs.ICALP.2017.57〉", 2017
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2017.57

Algorithmic Properties of Sparse Digraphs

Author(s): Kreutzer, Stephan; de Mendez, Patrice Ossona; Rabinovich, Roman; Siebertz, Sebastian
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Issue 36, 2019
Publisher: Lipics
DOI: 10.4230/lipics.stacs.2019.46

Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs

Author(s): Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstädt
Published in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Issue 66, 2017, Page(s) 48:1--48:15
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2017.48

Polynomial Planar Directed Grid Theorem

Author(s): Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer
Published in: Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA 2019), 2019, Page(s) 1465--1484
Publisher: SIAM
DOI: 10.1137/1.9781611975482.89

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width

Author(s): Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
Published in: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2018, Page(s) 6:1--6:14
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Book chapters (2)

Towards the Graph Minor Theorems for Directed Graphs

Author(s): Ken-Ichi Kawarabayashi, Stephan Kreutzer
Published in: Automata, Languages, and Programming, Issue 9135, 2015, Page(s) 3-10, ISBN 978-3-662-47665-9
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-47666-6_1

A Polynomial Kernel for Distance-Hereditary Vertex Deletion

Author(s): Eun Jung Kim, O-Joung Kwon
Published in: Algorithms and Data Structures, Issue 10389, 2017, Page(s) 509-520, ISBN 978-3-319-62126-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-62127-2_43

Thesis and dissertations (1)

Structural graph theory meets algorithms: covering and connectivity problems in graphs

Author(s): Akhoondian Amiri, Saeed
Published in: Issue 12, 2017
Publisher: TU Berlin
DOI: 10.14279/depositonce-6538