Cuts and decompositions: algorithms and combinatorial properties

Publicaciones

Autores: Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná, Aneta Pokorná
Publicado en: Algorithmica, Edición 01784617, 2022, Página(s) 1526–1547, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-022-00937-9

Decreasing the Maximum Average Degree by Deleting an Independent Set or a d-Degenerate Subgraph

Autores: Wojciech Nadara, Marcin Smulewicz
Publicado en: Electronic Journal of Combinatorics, Edición 10778926, 2022, Página(s) P1.49, ISSN 1077-8926
Editor: Electronic Journal of Combinatorics
DOI: 10.37236/9455

Packing Directed Cycles Quarter- and Half-Integrally

Autores: Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge
Publicado en: Combinatorica, Edición 02099683, 2022, ISSN 0209-9683
Editor: Springer Verlag
DOI: 10.1007/s00493-021-4743-y

On objects dual to tree-cut decompositions

Autores: Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
Publicado en: Journal of Combinatorial Theory, Series B, Edición 00958956, 2022, Página(s) 401-428, ISSN 0095-8956
Editor: Academic Press
DOI: 10.1016/j.jctb.2022.07.009

On Supereulerian 2-Edge-Coloured Graphs

Autores: Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
Publicado en: Graphs and Combinatorics, 2021, ISSN 0911-0119
Editor: Springer Verlag
DOI: 10.1007/s00373-021-02377-8

Degeneracy of P_t-free and C_>=t-free graphs with no large complete bipartite subgraphs

Autores: Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Paweł Rzążewski, Stephan Thomasse, Bartosz Walczak
Publicado en: Journal of Combinatorial Theory, Series B, Edición 00958956, 2022, Página(s) 353-378, ISSN 0095-8956
Editor: Academic Press
DOI: 10.1016/j.jctb.2021.10.005

Randomized Contractions Meet Lean Decompositions

Autores: Marek Cygan, Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh, Magnus Wahlström
Publicado en: ACM Transactions on Algorithms, Edición 17/1, 2021, Página(s) 1-30, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3426738

Improved Bounds for the Excluded-Minor Approximation of Treedepth

Autores: Wojciech Czerwiński, Wojciech Nadara, Marcin Pilipczuk
Publicado en: SIAM Journal on Discrete Mathematics, Edición 35/2, 2021, Página(s) 934-947, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m128819x

Jones' Conjecture in Subcubic Graphs

Autores: Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Publicado en: Electron. J. Comb., Edición 10778926, 2021, Página(s) P4.5, ISSN 1077-8926
Editor: Electronic Journal of Combinatorics
DOI: 10.37236/9192

Designing RNA Secondary Structures Is Hard

Autores: Édouard Bonnet, Paweł Rzążewski, Florian Sikora
Publicado en: Journal of Computational Biology, Edición 27/3, 2020, Página(s) 302-316, ISSN 1557-8666
Editor: Mary Ann Liebert, Inc.
DOI: 10.1089/cmb.2019.0420

Constant Congestion Brambles in Directed Graphs

Autores: Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Publicado en: SIAM Journal on Discrete Mathematics, Edición 08954801, 2022, Página(s) 922-938, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m1417661

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors

Autores: Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Publicado en: Journal of Computer and System Sciences, Edición 120, 2021, Página(s) 75-96, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2021.03.001

An Improved FPT Algorithm for Independent Feedback Vertex Set

Autores: Shaohua Li, Marcin Pilipczuk
Publicado en: Theory of Computing Systems, Edición 64/8, 2020, Página(s) 1317-1330, ISSN 1432-4350
Editor: Springer Verlag
DOI: 10.1007/s00224-020-09973-w

Constant Congestion Brambles

Autores: Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
Publicado en: Discrete Mathematics & Theoretical Computer Science, Edición 13658050, 2022, ISSN 1365-8050
Editor: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.6699

Exact and approximation algorithms for sensor placement against DDoS attacks

Autores: Konstanty Junosza-Szaniawski, Dariusz Nogalski, Paweł Rzążewski
Publicado en: International Journal of Applied Mathematics and Computer Science, Edición 1641876X, 2022, Página(s) 35-49, ISSN 1641-876X
Editor: Technical University Press
DOI: 10.34768/amcs-2022-0004

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five

Autores: Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk, Stéphan Thomassé
Publicado en: SIAM Journal on Discrete Mathematics, Edición 34/2, 2020, Página(s) 1472-1483, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1249473

Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four

Autores: Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomáš Masařík
Publicado en: Discrete Applied Mathematics, Edición 0166218X, 2022, Página(s) 120-132, ISSN 0166-218X
Editor: Elsevier BV
DOI: 10.1016/j.dam.2021.09.021

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs

Autores: Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk, Michał Pilipczuk
Publicado en: The Electronic Journal of Combinatorics, Edición 28/1, 2021, ISSN 1077-8926
Editor: Electronic Journal of Combinatorics
DOI: 10.37236/9473

Polynomial Treedepth Bounds in Linear Colorings

Autores: Jeremy Kun, Michael P. O’Brien, Marcin Pilipczuk, Blair D. Sullivan
Publicado en: Algorithmica, Edición 83/1, 2021, Página(s) 361-386, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-020-00760-0

Two lower bounds for p-centered colorings

Autores: Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
Publicado en: Discrete Mathematics & Theoretical Computer Science, Edición 22(4), 2020, ISSN 1365-8050
Editor: Maison de l'informatique et des mathematiques discretes
DOI: 10.23638/dmtcs-22-4-9

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Autores: Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Publicado en: SIAM Journal on Discrete Mathematics, Edición 34/1, 2020, Página(s) 640-681, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1239362

Vertex Deletion into Bipartite Permutation Graphs

Autores: Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Publicado en: Algorithmica, Edición 01784617, 2022, Página(s) 2271-2291, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-021-00923-7

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited

Autores: Jan Kratochvíl, Tomás Masarík, Jana Novotná
Publicado en: Algorithmica, Edición 01784617, 2021, Página(s) 3649–368, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-021-00837-4

Coloring squares of planar graphs with small maximum degree

Autores: Mateusz Krzyziński, Paweł Rzążewski, Szymon Tur
Publicado en: Discussiones Mathematicae Graph Theory, Edición 12343099, 2022, ISSN 1234-3099
Editor: Technical University Press
DOI: 10.7151/dmgt.2472

Efficient algorithms for measuring the funnel-likeness of DAGs

Autores: Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Publicado en: Journal of Combinatorial Optimization, Edición 39/1, 2020, Página(s) 216-245, ISSN 1382-6905
Editor: Kluwer Academic Publishers
DOI: 10.1007/s10878-019-00464-4

Many-visits TSP revisited

Autores: Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Publicado en: J. Comput. Syst. Sci., Edición 00220000, 2022, Página(s) 112-128, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2021.09.007

Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs

Autores: Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
Publicado en: ACM Transactions on Algorithms, Edición 15496325, 2022, Página(s) 4:1-4:57, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3414473

Completeness for the Complexity Class ∀∃R and Area-Universality

Autores: Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Paweł Rzążewski
Publicado en: Discrete & Computational Geometry, Edición 01795376, 2022, ISSN 0179-5376
Editor: Springer Verlag
DOI: 10.1007/s00454-022-00381-0

Computing the best-case energy complexity of satisfying assignments in monotone circuits

Autores: Janio Carlos Nascimento Silva, Uéverton S. Souza
Publicado en: Theoretical Computer Science, Edición 03043975, 2022, Página(s) 41-55, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2022.08.005

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$Pt-Free and Broom-Free Graphs

Autores: Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Publicado en: Algorithmica, 2018, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-018-0479-5

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

Autores: Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
Publicado en: Algorithmica, 2018, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-018-0504-8

Assessing the Computational Complexity of Multi-Layer Subgraph Detection

Autores: Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Publicado en: Network Science, 2018, ISSN 2050-1242
Editor: Cambridge University Press

Caterpillars in Erdős–Hajnal

Autores: Anita Liebenau, Marcin Pilipczuk, Paul Seymour, Sophie Spirkl
Publicado en: Journal of Combinatorial Theory, Series B, 2018, ISSN 0095-8956
Editor: Academic Press
DOI: 10.1016/j.jctb.2018.09.002

On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments

Autores: Bożyk, Łukasz; Pilipczuk, Michał
Publicado en: Discrete Mathematics & Theoretical Computer Science, Edición 13658050, 2022, ISSN 1365-8050
Editor: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.7099

A Double Exponential Lower Bound for the Distinct Vectors Problem

Autores: Marcin Pilipczuk, Manuel Sorge
Publicado en: Discrete Mathematics & Theoretical Computer Science, Edición 22(4), 2020, ISSN 1365-8050
Editor: Maison de l'informatique et des mathematiques discretes
DOI: 10.23638/dmtcs-22-4-7

(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth

Autores: Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
Publicado en: Journal of Graph Theory, Edición 97/4, 2021, Página(s) 624-641, ISSN 0364-9024
Editor: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22675

Multi-budgeted Directed Cuts

Autores: Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Publicado en: Algorithmica, Edición 82/8, 2020, Página(s) 2135-2155, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-019-00609-1

On the density of sets of the Euclidean plane avoiding distance 1

Autores: Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
Publicado en: Discrete Mathematics & Theoretical Computer Science, Edición vol. 23 no. 1/Combinatorics, 2021, ISSN 1365-8050
Editor: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.5153

Tuza's Conjecture for Threshold Graphs

Autores: Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa
Publicado en: Discrete Mathematics & Theoretical Computer Science, Edición 13658050, 2022, ISSN 1365-8050
Editor: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.7660

Linear Bounds for Cycle-free Saturation Games

Autores: Sean English, Tomáš Masařík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro
Publicado en: Electronic Journal of Combinatorics, Edición 10778926, 2022, ISSN 1077-8926
Editor: Electronic Journal of Combinatorics
DOI: 10.37236/10808

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Autores: Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Publicado en: Algorithmica, Edición 83/8, 2021, Página(s) 2634-2650, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-020-00745-z

A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs

Autores: Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk
Publicado en: SIAM Journal on Computing, Edición 00975397, 2022, Página(s) 254-289, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1304088

Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs

Autores: Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky
Publicado en: Graphs and Combinatorics, Edición 09110119, 2021, Página(s) 2595–2599, ISSN 0911-0119
Editor: Springer Verlag
DOI: 10.1007/s00373-021-02380-z

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

Autores: Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski, Florian Sikora, Stéphan Thomassé
Publicado en: Journal of the ACM, Edición 68/2, 2021, Página(s) 1-38, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3433160

Threshold Treewidth and Hypertree Width

Autores: Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider
Publicado en: Journal of Artificial Intelligence Research, Edición 10769757, 2022, ISSN 1076-9757
Editor: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.13661

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

Autores: Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Publicado en: Artificial Intelligence, Edición 00043702, 2022, ISSN 0004-3702
Editor: Elsevier BV
DOI: 10.1016/j.artint.2021.103644

Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs

Autores: Karolina Okrasa, Paweł Rzaͅżewski
Publicado en: SIAM Journal on Computing, Edición 50/2, 2021, Página(s) 487-508, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1320146

Matchings under Preferences: Strength of Stability and Tradeoffs

Autores: Jiehua Chen, Piotr Skowron, Manuel Sorge
Publicado en: ACM Transactions on Economics and Computation, Edición 21678375, 2021, Página(s) 20:1-55, ISSN 2167-8375
Editor: ACM
DOI: 10.1145/3485000

h -Index manipulation by undoing merges

Autores: René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
Publicado en: Quantitative Science Studies, Edición 1/4, 2020, Página(s) 1529-1552, ISSN 2641-3337
Editor: MIT
DOI: 10.1162/qss_a_00093

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

Autores: Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
Publicado en: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Página(s) 66:1--66:20
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2022.66

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited

Autores: Jan Kratochvíl, Tomás Masarík, Jana Novotná
Publicado en: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), 2020, Página(s) 57:1--57:14
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2020.57

Tuza’s Conjecture for Threshold Graphs

Autores: Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa
Publicado en: Extended Abstracts EuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Edición 14, 2021, Página(s) 765-771, ISBN 978-3-030-83822-5
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-83823-2_122

Close Relatives (Of Feedback Vertex Set), Revisited

Autores: Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
Publicado en: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, 2021, Página(s) 21:1-21:15
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2021.21

Vertex Deletion into Bipartite Permutation Graphs

Autores: Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Publicado en: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020, Página(s) 5:1--5:16
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2020.5

On 3-Coloring of $$(2P_4,C_5)$$-Free Graphs

Autores: Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná, Aneta Pokorná
Publicado en: Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, Edición 12911, 2021, Página(s) 388-401, ISBN 978-3-030-86837-6
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-86838-3_30

Compact Representation for Matrices of Bounded Twin-Width

Autores: Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz
Publicado en: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 2022, Página(s) 52:1--52:14
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2022.52

Approximating Pathwidth for Graphs of Small Treewidth

Autores: Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 1965-1976, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.117

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles

Autores: Jiehua Chen, Wojciech Czerwiński, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michał Pilipczuk, Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 796-809, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.50

Cluster Editing Parameterized Above Modification-Disjoint P3-Packings

Autores: Shaohua Li, Marcin Pilipczuk, Manuel Sorge
Publicado en: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 2021, Página(s) 49:1--49:16
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2021.49

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

Autores: Radek Hušek, Dušan Knop,Tomáš Masařík
Publicado en: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020, Página(s) 16:1--16:18
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2020.16

On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy

Autores: Gabriel L. Duarte, Uéverton S. Souza
Publicado en: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, 2022, Página(s) 187-200, ISBN 978-3-031-15913-8
Editor: Springer
DOI: 10.1007/978-3-031-15914-5_14

Hardness of Metric Dimension in Graphs of Constant Treewidth

Autores: Shaohua Li, Marcin Pilipczuk
Publicado en: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, 2021, Página(s) 24:1-24:13
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2021.24

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor

Autores: Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
Publicado en: STOC'22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Página(s) 914-923
Editor: ACM
DOI: 10.1145/3519935.3520076

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth

Autores: Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
Publicado en: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, 2020, Página(s) 37:1--37:18
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2020.37

Computing List Homomorphisms in Geometric Intersection Graphs

Autores: Sándor Kisfaludi-Bak, Karolina Okrasa, Paweł Rzążewski
Publicado en: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, 2022, Página(s) 313-327
Editor: Springer
DOI: 10.1007/978-3-031-15914-5_23

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

Autores: Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Publicado en: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Página(s) 1119-1125, ISBN 978-0-9992411-6-5
Editor: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/156

Threshold Treewidth and Hypertree Width

Autores: Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider
Publicado en: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Página(s) 1898-1904, ISBN 978-0-9992411-6-5
Editor: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/263

Complexity of the List Homomorphism Problem in Hereditary Graph Classes

Autores: Karolina Okrasa, Paweł Rzążewski
Publicado en: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), 2021, Página(s) 54:1--54:17
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2021.54

Determining 4-Edge-Connected Components in Linear Time

Autores: Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski
Publicado en: 29th Annual European Symposium on Algorithms (ESA 2021), 2021, Página(s) 71:1--71:15
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2021.71

Constant Congestion Brambles in Directed Graphs

Autores: Tomáš Masařík, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge
Publicado en: Extended Abstracts EuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Edición 14, 2021, Página(s) 318-324, ISBN 978-3-030-83822-5
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-83823-2_50

Induced subgraphs of bounded treewidth and the container method

Autores: Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł Rzążewski, Paul Seymour
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 1948-1964, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.116

Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs

Autores: Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza
Publicado en: Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, 2022, Página(s) 257-269
Editor: Springer
DOI: 10.1007/978-3-031-06678-8_19

Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs

Autores: Hugo Jacob, Marcin Pilipczuk
Publicado en: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, 2022, Página(s) 287-299
Editor: Springer
DOI: 10.1007/978-3-031-15914-5_21

Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time

Autores: Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Publicado en: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Página(s) 330-341, ISBN 9781450380539
Editor: ACM
DOI: 10.1145/3406325.3451034

On Directed Feedback Vertex Set parameterized by treewidth

Autores: Bonamy, Marthe; Kowalik, Łukasz; Nederlof, Jesper; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin
Publicado en: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, LNCS 11159, 2018, Página(s) 65-78
Editor: Springer
DOI: 10.1007/978-3-030-00256-5_6

On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs

Autores: Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał
Publicado en: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science, 2018, Página(s) 474-484
Editor: IEEE
DOI: 10.1109/FOCS.2018.00052

An improved FPT algorithm for Independent Feedback Vertex Set

Autores: Li, Shaohua; Pilipczuk, Marcin
Publicado en: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, LNCS 111159, 2018
Editor: Springer
DOI: 10.1007/978-3-030-00256-5_28

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Autores: Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Publicado en: Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18), 2018, Página(s) 51:1-51:14
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ESA.2018.51

Cluster Editing in Multi-Layer and Temporal Graphs

Autores: Jiehua Chen, Ondrej Suchy, Hendrik Molter, Manuel Sorge
Publicado en: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC'18), 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Flexibility of planar graphs without 4-cycles

Autores: Masařík, Tomáš
Publicado en: Acta Mathematica Universitatis Comenianae, Edición 88(3), 2019, Página(s) 935-940
Editor: Charles University

Multi-budgeted directed cuts

Autores: Kratsch, Stefan; Li, Shaohua; Marx, Dániel; Pilipczuk, Marcin; Wahlström, Magnus
Publicado en: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2018, Página(s) 18:1-18:14
Editor: LIPIcs
DOI: 10.4230/lipics.ipec.2018.18

Matchings under Preferences - Strength of Stability and Trade-Offs

Autores: Jiehua Chen, Piotr Skowron, Manuel Sorge
Publicado en: Proceedings of the 2019 ACM Conference on Economics and Computation - EC '19, 2019, Página(s) 41-59, ISBN 9781-450367929
Editor: ACM Press
DOI: 10.1145/3328526.3329555

On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors

Autores: Chen, Jiehua; Hermelin, Danny; Sorge, Manuel
Publicado en: 27th Annual European Symposium on Algorithms (ESA '19), 2019, Página(s) 28:1--28:16
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2019.28

Improved Bounds for the Excluded-Minor Approximation of Treedepth

Autores: Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Publicado en: 27th Annual European Symposium on Algorithms (ESA 2019), 2019, Página(s) 34:1-34:13
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2019.34

Packing Directed Circuits Quarter-Integrally

Autores: Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge
Publicado en: 27th Annual European Symposium on Algorithms (ESA 2019), 2019, Página(s) 72:1-72:13
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2019.72

Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs

Autores: Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
Publicado en: 27th Annual European Symposium on Algorithms (ESA 2019), 2019, Página(s) 33:1-33:14
Editor: LIPIcs
DOI: 10.4230/lipics.esa.2019.33

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs

Autores: Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
Publicado en: ACM-SIAM Symposium on Discrete Algorithms (SODA20), 2020
Editor: ACM

A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

Autores: Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
Publicado en: 60th Annual IEEE Symposium on Foundations of Computer Science, 2019
Editor: IEEE

Algorithmic Properties of Sparse Digraphs

Autores: Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Publicado en: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019, Página(s) 46:1-46:20
Editor: LIPIcs
DOI: 10.4230/lipics.stacs.2019.46

Representing Graphs and Hypergraphs by Touching Polygons in 3D

Autores: William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Publicado en: Graph Drawing 2019, 2019
Editor: Springer

An Improved FPT Algorithm for the Flip Distance Problem

Autores: Shaohua Li, Qilong Feng, Xiangzhong Meng, Jianxin Wang
Publicado en: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, 2017
Editor: LIPIcs
DOI: 10.4230/lipics.mfcs.2017.65

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs

Autores: Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
Publicado en: 31st International Symposium on Algorithms and Computation, ISAAC 2020, Edición 181, 2020, Página(s) 59:1--59:15
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2020.59

Sparsification Lower Bounds for List H-Coloring

Autores: Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Publicado en: 31st International Symposium on Algorithms and Computation (ISAAC 2020), 2020, Página(s) 58:1--58:17
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2020.58

Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths

Autores: Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Publicado en: 4th Symposium on Simplicity in Algorithms, SOSA 2021, 2021, Página(s) 204--209, ISBN 978-1-61197-649-6
Editor: SIAM
DOI: 10.1137/1.9781611976496.23

Reducing the Vertex Cover Number via Edge Contractions

Autores: Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Publicado en: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, 2022, Página(s) 69:1--69:14
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2022.69

Solving hard cut problems via flow-augmentation

Autores: Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 149-168, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.11

Many Visits TSP Revisited

Autores: Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Publicado en: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Página(s) 66:1--66:22
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2020.66

Polynomial Kernel for Immersion Hitting in Tournaments

Autores: Łukasz Bożyk, Michał Pilipczuk
Publicado en: 30th Annual European Symposium on Algorithms (ESA 2022), 2022, Página(s) 26:1-26:17
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.26

Computing Treedepth in Polynomial Space and Linear FPT Time

Autores: Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
Publicado en: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Página(s) 79:1--79:14
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.79

Directed flow-augmentation

Autores: Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Publicado en: STOC'22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Página(s) 938-947
Editor: ACM
DOI: 10.1145/3519935.3520018

Optimal Discretization is Fixed-parameter Tractable

Autores: Stefan Kratsch, Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 1702-1719, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.103

Taming Graphs with No Large Creatures and Skinny Ladders

Autores: Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Publicado en: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Página(s) 58:1-58:8
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.58

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument

Autores: Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Publicado en: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Página(s) 93:1-93:19
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2022.93

Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs

Autores: Karolina Okrasa, Marta Piecyk, Paweł Rzążewski
Publicado en: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Página(s) 74:1--74:24
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2020.74

Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge Colors

Autores: Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Publicado en: Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings, Edición 11485, 2019, Página(s) 99-111, ISBN 978-3-030-17401-9
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-17402-6_9

Buscando datos de OpenAIRE...

Publicaciones

Compartir esta página

Descargar