Decomposition methods for discrete problems

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

Twin-Width and Types

Author(s): Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk
Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 123:1--123:21
Publisher: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022
DOI: 10.4230/lipics.icalp.2022.123

Flipper games for monadically stable graph classes

Author(s): Gajarský, Jakub; Mählmann, Nikolas; McCarty, Rose; Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Siebertz, Sebastian; Sokołowski, Marek; Toruńczyk, Szymon
Published in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 128:1--128:16
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.48550/arxiv.2301.13735

Compact representation for matrices of bounded twin-width

Author(s): Michał Pilipczuk, Marek Sokołowski, Anna Zych-Pawlewicz
Published in: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 2022, Page(s) 52:1-52:14
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2022.52

On the Complexity of Problems on Tree-Structured Graphs

Author(s): Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
Published in: 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, 2023
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2022.6

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time

Author(s): Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Published in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Page(s) 683-691
Publisher: ACM
DOI: 10.1145/3618260.3649791

Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time

Author(s): Łukasz Kowalik
Published in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.81

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Author(s): Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk
Published in: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Page(s) 54:1-54:13
Publisher: ACM
DOI: 10.1145/3531130.3533367

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set

Author(s): Paloma T. Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, Kenny Štorgel
Published in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.85

Stable graphs of bounded twin-width

Author(s): Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk
Published in: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Page(s) 39:1--39:12
Publisher: ACM
DOI: 10.1145/3531130.3533356

Distal Combinatorial Tools for Graphs of Bounded Twin-Width

Author(s): Wojciech Przybyszewski
Published in: 38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2023, 2023, Page(s) 1--13
Publisher: IEEE
DOI: 10.1109/lics56636.2023.10175719

List Locally Surjective Homomorphisms in Hereditary Graph Classes

Author(s): Dvořák, Pavel; Masařík, Tomáš; Novotná, Jana; Krawczyk, Monika; Rzążewski, Paweł; Żuk, Aneta
Published in: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, 2022, Page(s) 30:1--30:15
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2022.30

Characterising Memory in Infinite Games

Author(s): Antonio Casares, Pierre Ohlmann
Published in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 122:1--122:18
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.122

Fixed-Parameter Tractability of Graph Isomorphism in Graphs with an Excluded Minor

Author(s): Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
Published in: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Page(s) 914-923
Publisher: ACM
DOI: 10.1145/3519935.3520076

Elementary first-order model checking for sparse graphs

Author(s): Jakub Gajarský, Michał Pilipczuk, Marek Sokołowski, Giannos Stamoulis, Szymon Toruńczyk
Published in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025, Page(s) 1-14
Publisher: ACM
DOI: 10.1145/3661814.3662094

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments

Author(s): Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Published in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.43

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

Author(s): Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Toruńczyk
Published in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 125:1--125:18
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.125

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument

Author(s): Konrad Majewski, Tomáš Masařík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, Marek Sokołowski
Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 93:1-93:19
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2022.93

Algorithms and Data Structures for First-Order Logic with Connectivity under Vertex Failures

Author(s): Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk, Alexandre Vigny
Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 102:1--102:18
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2022.102

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games

Author(s): K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdziński
Published in: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, 2022
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.fsttcs.2022.44

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP

Author(s): Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
Published in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.15

Single-conflict colorings of degenerate graphs

Author(s): Peter Bradshaw, Tomáš Masařík
Published in: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, Page(s) 201-209
Publisher: Masaryk University Press
DOI: 10.5817/cz.muni.eurocomb23-028

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters

Author(s): Groenland, Carla; Mannens, Isja; Nederlof, Jesper; Piecyk, Marta; Rzążewski, Paweł
Published in: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2024.77

Positionality in Σ^0_2 and a Completeness Result

Author(s): Pierre Ohlmann, Michał Skrzypczak
Published in: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.54

Dynamic Data Structures for Parameterized String Problems

Author(s): Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz
Published in: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Page(s) 50:1--50:22
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.50

On classes of bounded tree rank, their interpretations, and efficient sparsification

Author(s): Gajarský, Jakub; McCarty, Rose
Published in: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2404.18904

Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters

Author(s): Hans L. Bodlaender, Carla Groenland, Michał Pilipczuk
Published in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 27:1--27:20
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.27

On Rational Recursive Sequences

Author(s): Clemente, Lorenzo; Donten-Bury, Maria; Mazowiecki, Filip; Pilipczuk, Michał
Published in: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Page(s) 24:1--24:21
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.24

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes

Author(s): Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Toruńczyk, Szymon
Published in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 135:1--135:17
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.135

Sparse induced subgraphs in <i>P</i><sub>6</sub>-free graphs

Author(s): Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 5291-5299
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.190

Computing Treedepth in Polynomial Space and Linear FPT Time

Author(s): Wojciech Nadara, Michał Pilipczuk, Marcin Smulewicz
Published in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 79:1--79:14
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.79

Determining 4-Edge-Connected Components in Linear Time

Author(s): Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokołowski
Published in: 29th Annual European Symposium on Algorithms, ESA 2021, 2021, Page(s) 71:1-71:15
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2021.71

Flip-width: Cops and Robber on dense graphs

Author(s): Szymon Toruńczyk
Published in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 663-700
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00045

Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane

Author(s): Katarzyna Kowalska, Michał Pilipczuk
Published in: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.47

Maintaining CMSO2 Properties on Dynamic Structures with Bounded Feedback Vertex Number

Author(s): Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Published in: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Page(s) 46:1--46:13
Publisher: Schloss Dagstuhl --- Leibniz Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.46

A parameterized approximation scheme for the 2D-Knapsack problem with wide items

Author(s): Pilipczuk, Michal; Mari, Mathieu; Picavet, Timothe
Published in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2307.10672

Taming Graphs with No Large Creatures and Skinny Ladders

Author(s): Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Paweł Rzążewski, Uéverton S. Souza
Published in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 58:1--58:8
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.58

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs

Author(s): Barış Can Esmer, Jacob Focke, Dániel Marx, Paweł Rzążewski
Published in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.39

Twin-width IV: ordered graphs and matrices

Author(s): Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Toruńczyk
Published in: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Page(s) 924-937
Publisher: ACM
DOI: 10.1145/3519935.3520037

Dynamic treewidth

Author(s): Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michał Pilipczuk, Marek Sokołowski
Published in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 1734-1744
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00105

Max Weight Independent Set in Sparse Graphs with No Long Claws

Author(s): Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł Rzążewski
Published in: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.4

Parameterized Dynamic Data Structure for Split Completion

Author(s): Konrad Majewski, Michał Pilipczuk, Anna Zych-Pawlewicz
Published in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.87

Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*

Author(s): Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michał Pilipczuk
Published in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, Page(s) 2262-2277
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00140

Polynomial Kernel for Immersion Hitting in Tournaments

Author(s): Łukasz Bożyk, Michał Pilipczuk
Published in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 26:1--26:17
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.26

Simpler and faster algorithms for detours in planar digraphs

Author(s): Hatzel, Meike; Majewski, Konrad; Pilipczuk, Michał; Sokołowski, Marek
Published in: 2023 Symposium on Simplicity in Algorithms, SOSA 2023, 2023, Page(s) 156--165
Publisher: SIAM
DOI: 10.48550/arxiv.2301.02421

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Author(s): Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen
Published in: 31st Annual European Symposium on Algorithms, ESA 2023, 2023, Page(s) 18:1--18:18
Publisher: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2023.18

Sparse Graphs of Twin-width 2 Have Bounded Tree-width

Author(s): Bergougnoux, Benjamin; Gajarský, Jakub; Guśpiel, Grzegorz; Hliněný, Petr; Pokrývka, Filip; Sokołowski, Marek
Published in: 34th International Symposium on Algorithms and Computation, ISAAC 2023, 2023
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.isaac.2023.11

Treelike Decompositions for Transductions of Sparse Graphs

Author(s): Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk
Published in: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Page(s) 31:1-31:14
Publisher: ACM
DOI: 10.1145/3531130.3533349

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

Author(s): Jesper Nederlof; Michał Pilipczuk; Celine M. F. Swennenhuis; Karol Węgrzycki
Published in: SIAM Journal on Discrete Mathematics, Issue Volume 37(3), 2023, Page(s) 1566--1586, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1518943

Characterising memory in infinite games

Author(s): Antonio Casares, Pierre Ohlmann
Published in: Logical Methods in Computer Science, Issue Volume 21, Issue 1, 2025, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(1:28)2025

Partitioning edges of a planar graph into linear forests and a matching

Author(s): Marthe Bonamy; Jadwiga Czyżewska; Łukasz Kowalik; Michał Pilipczuk
Published in: Journal of Graph Theory, Issue Volume 104, Issue 3, 2023, Page(s) 659-677, ISSN 0364-9024
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22995

Graphs of bounded twin-width are quasi-polynomially $\chi$-bounded

Author(s): Pilipczuk, Michał; Sokołowski, Marek
Published in: Journal of Combinatorial Theory, series B, Issue Volume 161, 2023, Page(s) 382--406, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2023.02.006

Transducing paths in graph classes with unbounded shrubdepth

Author(s): Patrice Ossona de Mendez; Michał Pilipczuk; Sebastian Siebertz
Published in: European Journal of Combinatorics, Issue Available online, 2023, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2022.103660

Single‐conflict colorings of degenerate graphs

Author(s): Peter Bradshaw, Tomáš Masařík
Published in: Journal of Graph Theory, Issue 109, 2025, Page(s) 170-183, ISSN 0364-9024
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/jgt.23025

Every graph is eventually Turán-good

Author(s): Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek
Published in: Journal of Combinatorial Theory, series B, Issue Volume 162, 2023, Page(s) 231-243, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2023.06.004

Parameterized algorithms for block-structured integer programs with large entries

Author(s): Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michał Pilipczuk, Adam Polak
Published in: TheoretiCS, Issue Volume 4, 2025, ISSN 2751-4838
Publisher: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.25.15

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number

Author(s): Marcin Pilipczuk, Paweł Rzążewski
Published in: Discrete Mathematics & Theoretical Computer Science, Issue vol. 27:2, 2025, ISSN 1365-8050
Publisher: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.12438

On the independence number of intersection graphs of axis-parallel segments

Author(s): Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Published in: Journal of Computational Geometry, Issue Volume 14(1), 2023, ISSN 0000-0000
Publisher: Journal of Computational Geometry, member of Free Journals Network
DOI: 10.20382/jocg.v14i1a5

Treedepth vs Circumference

Author(s): Marcin Briański; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michał T. Seweryn; Roohani Sharma
Published in: Combinatorica, Issue Volume 43(4), 2023, Page(s) 659--664, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-023-00028-5

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Author(s): Jesper Nederlof; Michał Pilipczuk; Karol Węgrzycki
Published in: Electronic Journal of Combinatorics, Issue Volume 30(3), number P3.33, 2023, ISSN 1077-8926
Publisher: Electronic Journal of Combinatorics
DOI: 10.37236/11095

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem

Author(s): Albert Atserias; Joanna Fijalkow
Published in: SIAM Journal on Computing, Issue Volume 52(5), 2023, Page(s) 1193-1229, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1338435

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Author(s): Mikołaj Bojańczyk, Joanna Fijalkow, Bartek Klin, Joshua Moerman
Published in: TheoretiCS, Issue Volume 3, 2024, ISSN 2751-4838
Publisher: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.13

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

Author(s): Pierre Ohlmann
Published in: TheoretiCS, Issue Volume 2, 2023, ISSN 2751-4838
Publisher: TheoretiCS Foundation e.V.
DOI: 10.46298/theoretics.23.3

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth

Author(s): Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski, Bartosz Walczak
Published in: SIAM Journal on Discrete Mathematics, Issue 39, 2025, Page(s) 1189-1200, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/24m1659960

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

Author(s): Łukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Published in: 2024 Symposium on Simplicity in Algorithms (SOSA), 2024, Page(s) 279-285
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977936.25

Searching for OpenAIRE data...

Publications

Share this page Share this page on social networks

Download Download the content of the page