Structure Theory for Directed Graphs

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

Autori: Chun-Hung Liu, Irene Muzi
Pubblicato in: 2020
Editore: arXiv

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

Autori: Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie
Pubblicato in: 2020
Editore: arXiv.org

A Flat Wall Theorem for Matching Minors in Bipartite Graphs

Autori: Archontia C.Giannopoulou,Sebastian Wiederrecht
Pubblicato in: arXiv, Numero 2110.07553, 2021
Editore: arXiv.org

Excluding a Planar Matching Minor in Bipartite Graphs

Autori: Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Pubblicato in: 2021
Editore: arXiv.org

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

Autori: Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
Pubblicato in: Numero 5, 2017
Editore: arxiv

The Erdos-Posa Property for Directed Graphs

Autori: Amiri, Saeed Akhoondian; Kawarabayashi, Ken-Ichi; Kreutzer, Stephan; Wollan, Paul
Pubblicato in: 2016
Editore: arXiv

Braces of Perfect Matching Width 2

Autori: Giannopoulou, Archontia C.; Hatzel, Meike; Wiederrecht, Sebastian
Pubblicato in: 2019
Editore: arXiv

Coloring and Covering Nowhere Dense Graphs

Autori: Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos
Pubblicato in: SIAM Journal of Discrete Mathematics, Numero 32(4), 2018, Pagina/e 2467--2481, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1168753

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

Autori: Jakub Gajarský, Petr Hliněný, Daniel Lokshtanov, Jan Obdržálek, M. S. Ramanujan
Pubblicato in: ACM Trans. Comput. Log., Numero 21(4), 2020, Pagina/e 28:1--28:23, ISSN 1529-3785
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3383206

Scattered Classes of Graphs

Autori: O-Joung Kwon, Sang-il Oum
Pubblicato in: SIAM Journal on Discrete Mathematics (SIDMA), Numero 34(1), 2021, Pagina/e 972-999, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1293776

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

Autori: Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 35(1), 2021, Pagina/e 105-151, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18M1228839

Model-Checking on Ordered Structures

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

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

Autori: Eun Jung Kim, O-joung Kwon
Pubblicato in: Journal of Combinatorial Theory, Series B, Numero 145, 2020, Pagina/e 65-112, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2020.05.002

Avoidable Paths in Graphs

Autori: Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
Pubblicato in: The Electronic Journal of Combinatorics, Numero 27(4), 2020, Pagina/e P4.46, ISSN 1077-8926
Editore: Electronic Journal of Combinatorics
DOI: 10.37236/9030

A Polynomial Kernel for Distance-Hereditary Vertex Deletion

Autori: Eun Jung Kim, O-joung Kwon
Pubblicato in: Algorithmica, Numero 83(7), 2021, Pagina/e 2096-2141, ISSN 1432-0541
Editore: Springer
DOI: 10.1007/s00453-021-00820-z

Packing and Covering Induced Subdivisions

Autori: O-joung Kwon, Jean-Florent Raymond
Pubblicato in: SIAM Journal of Discrete Mathematics, Numero 35(2), 2021, Pagina/e 597--636, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1226166

DAG-width is PSPACE-complete

Autori: Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich
Pubblicato in: Theor. Comput. Sci., Numero 655, 2016, Pagina/e 78--89, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2016.09.011

Induced minors and well-quasi-ordering

Autori: Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
Pubblicato in: Journal of Combinatorial Theory, Series B, Numero 134, 2019, Pagina/e 110-142, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2018.05.005

Cutwidth: Obstructions and Algorithmic Aspects

Autori: Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Pubblicato in: Algorithmica, Numero 81/2, 2019, Pagina/e 557-588, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-018-0424-7

Majority Colourings of Digraphs

Autori: Stephan Kreutzer, Sang-il Oum, Paul Seymour, Dominic Van der Zypen, David R. Wood
Pubblicato in: The Electronic Journal of Combinatorics, Numero 24/2, 2017, ISSN 1077-8926
Editore: Electronic Journal of Combinatorics
DOI: 10.37236/6410

A Menger-like property of tree-cut width

Autori: Giannopoulou, Archontia C.; Kwon, O-joung; Raymond, Jean-Florent; Thilikos, Dimitrios M.
Pubblicato in: Journal of Combinatorial Theory, Series B, Numero 148, 2021, Pagina/e 1-22, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2020.12.005

Matching Connectivity: On the Structure of Graphs with Perfect Matchings

Autori: Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Pubblicato in: Electronic Notes in Discrete Mathematics, Numero 61, 2017, Pagina/e 505-511, ISSN 1571-0653
Editore: Elsevier BV
DOI: 10.1016/j.endm.2017.06.080

Chi-boundedness of graph classes excluding wheel vertex-minors

Autori: Hojin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan
Pubblicato in: Journal of Combinatorial Theory, Series B, Numero 135, 2019, Pagina/e 319-348, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2018.08.009

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

Autori: Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Pubblicato in: European Journal of Combinatorics, Numero 65, 2017, Pagina/e 154-167, ISSN 0195-6698
Editore: Academic Press
DOI: 10.1016/j.ejc.2017.05.009

On the Tractability of Optimization Problems on H-Graphs

Autori: Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
Pubblicato in: Algorithmica, Numero 82(9), 2020, Pagina/e 2432-2473, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-020-00692-9

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants

Autori: Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
Pubblicato in: ACM Transactions on Algorithms, Numero 16(3), 2020, Pagina/e 39:1-39:23, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3386686

Packing Directed Circuits Quarter-Integrally

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

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

Autori: Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
Pubblicato in: Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019, Pagina/e 1485-1500
Editore: SIAM
DOI: 10.1137/1.9781611975482.90

Directed Tangle Tree-Decompositions and Applications

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

Recovering Sparse Graphs

Autori: Jakub Gajarsky, Daniel Kral
Pubblicato in: 43rd International Symposium on Mathematical Foundations of Computer Science, (MFCS 2018), Numero 117, 2018, Pagina/e 29:1--29:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2018.29

Computing Shrub-Depth Decompositions

Autori: Jakub Gajarský, Stephan Kreutzer
Pubblicato in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Numero 154, 2020, Pagina/e 56:1--56:17
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2020.56

Optimal Discretization is Fixed-parameter Tractable

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

The Directed Flat Wall Theorem

Autori: Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
Pubblicato in: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, January 5-8, 2020, 2020, Pagina/e 239258
Editore: SIAM
DOI: 10.1137/1.9781611975994.15

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

Autori: Albert Atserias, Stephan Kreutzer, Marc Noy
Pubblicato in: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Numero 2018, 2018
Editore: EATCS

Kernelization and Sparseness: the Case of Dominating Set

Autori: 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
Pubblicato in: 33rd Symposium on Theoretical Aspects of Computer Science, Numero 33, 2016, Pagina/e 31:1--31:14, ISBN 978-3-95977-001-9
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2016.31

A Local Constant Factor MDS Approximation for Bounded Genus Graphs

Autori: Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
Pubblicato in: Proceedings of the 2016 {ACM} Symposium on Principles of Distributed Computing, 2016, Pagina/e 227-233, ISBN 978-1-4503-3964-3
Editore: ACM
DOI: 10.1145/2933057.2933084

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

Autori: Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Pubblicato in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, Pagina/e 1533-1545, ISBN 978-1-61197-478-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611974782.100

The Generalised Colouring Numbers on Classes of Bounded Expansion

Autori: Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Pubblicato in: 41st International Symposium on Mathematical Foundations of Computer Science, Numero 41, 2017, Pagina/e 85:1--85:13, ISBN 978-3-95977-016-3
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2016.85

Routing with Congestion in Acyclic Digraphs

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

Cutwidth: Obstructions and Algorithmic Aspects

Autori: Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin
Pubblicato in: IPEC: International Symposium on Parameterized and Exact Computation, Numero 1, 2016
Editore: Lipics
DOI: 10.4230/lipics.ipec.2016.15

Transiently Consistent SDN Updates: Being Greedy is Hard

Autori: Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
Pubblicato in: Structural Information and Communication Complexity, Numero 9988, 2016, Pagina/e 391-406, ISBN 978-3-319-48313-9
Editore: 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

Autori: Kim, Eun Jung; Kwon, O-joung
Pubblicato in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Editore: SIAM

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

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

Enumerating Minimal Dominating Sets in Triangle-Free Graphs

Autori: Bonamy, Marthe; Defrain, Oscar; Heinrich, Marc; Raymond, Jean-Florent
Pubblicato 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⟩", Numero 1, 2019
Editore: Lipics
DOI: 10.4230/LIPIcs.STACS.2019.16

Congestion-Free Rerouting of Flows on DAGs

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

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

Autori: Bergougnoux, Benjamin; Kwon, O-joung; Kanté, Mamadou Moustapha
Pubblicato in: 15th International Symposium on Algorithms and Data Structures (WADS), Numero 15, 2017, Pagina/e 121--132
Editore: Springer

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

Autori: Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
Pubblicato in: Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers, Numero 11789, 2019, Pagina/e 53-65, ISBN 978-3-030-30785-1
Editore: 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

Autori: Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne
Pubblicato in: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Numero 35, 2018
Editore: Lipics
DOI: 10.4230/lipics.stacs.2018.42

FPT Algorithms for Plane Completion Problems

Autori: Chatzidimitriou, Dimitris; Giannopoulou, Archontia C.; Maniatis, Spyridon; Requilé, Clément; Thilikos, Dimitrios M.; Zoros, Dimitris
Pubblicato in: MFCS: Mathematical Foundations of Computer Science, Numero 24, 2016
Editore: Lipics
DOI: 10.4230/LIPIcs.MFCS.2016.26

Neighborhood complexity and kernelization for nowhere dense classes of graphs

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

First-Order Interpretations of Bounded Expansion Classes

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

Lean Tree-Cut Decompositions: Obstructions and Algorithms

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

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

Autori: Giannopoulou, Archontia C.; Pilipczuk, Michał; Thilikos, Dimitrios M.; Raymond, Jean-Florent; Wrochna, Marcin
Pubblicato 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
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2017.57

Algorithmic Properties of Sparse Digraphs

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

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

Autori: Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstädt
Pubblicato in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Numero 66, 2017, Pagina/e 48:1--48:15
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2017.48

Polynomial Planar Directed Grid Theorem

Autori: Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer
Pubblicato in: Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA 2019), 2019, Pagina/e 1465--1484
Editore: SIAM
DOI: 10.1137/1.9781611975482.89

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

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

Towards the Graph Minor Theorems for Directed Graphs

Autori: Ken-Ichi Kawarabayashi, Stephan Kreutzer
Pubblicato in: Automata, Languages, and Programming, Numero 9135, 2015, Pagina/e 3-10, ISBN 978-3-662-47665-9
Editore: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-47666-6_1

A Polynomial Kernel for Distance-Hereditary Vertex Deletion

Autori: Eun Jung Kim, O-Joung Kwon
Pubblicato in: Algorithms and Data Structures, Numero 10389, 2017, Pagina/e 509-520, ISBN 978-3-319-62126-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-62127-2_43

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

Autori: Akhoondian Amiri, Saeed
Pubblicato in: Numero 12, 2017
Editore: TU Berlin
DOI: 10.14279/depositonce-6538

Pubblicazioni

Condividi questa pagina

Scarica