Technology transfer between modern algorithmic paradigms

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

Contracting a planar graph efficiently

Author(s): Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam; Lacki, Jakub; Rotenberg, Eva; Sankowski, Piotr
Published in: 25th Annual European Symposium on Algorithms (ESA 2017), 2017, ISBN 978-3-95977-049-1
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2017.50

Determining 4-edge-connected components in linear time

Author(s): Nadara, Wojciech; Radecki, Mateusz; Smulewicz, Marcin; Sokołowski, Marek
Published in: 29th Annual European Symposium on Algorithms (ESA 2021), 2021
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2021.71

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

Author(s): Maria Chudnovsky; Marcin Pilipczuk; Michał Pilipczuk; Stéphan Thomassé
Published in: ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 2020
Publisher: ACM
DOI: 10.1137/1.9781611975994.139

Adapting Stable Matchings to Evolving Preferences

Author(s): Robert Bredereck; Jiehua Chen; Dušan Knop; Junjie Luo; Rolf Niedermeier
Published in: The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI} 2020, 2020
Publisher: AAAI Press
DOI: 10.1609/aaai.v34i02.5550

Tight Lower Bounds for List Edge Coloring

Author(s): Kowalik, Lukasz; Socala, Arkadiusz
Published in: 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.swat.2018.28

Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max

Author(s): Karl Bringmann; Marvin Künnemann; Karol Węgrzycki
Published in: STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, ISBN 978-1-4503-6705-9
Publisher: Association for Computing Machinery
DOI: 10.1145/3313276.3316373

Unary Words Have the Smallest Levenshtein k-Neighbourhoods

Author(s): Charalampopoulos, Panagiotis; Pissis, Solon P.; Radoszewski, Jakub; Walen, Tomasz; Zuba, Wiktor; Gortz, Inge Li; Weimann, Oren
Published in: CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching, 2020, ISBN 978-3-95977-149-8
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.cpm.2020.10

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

Author(s): Cslovjecsek, Jana; Eisenbrand, Friedrich; Pilipczuk, Michał; Venzin, Moritz; Weismantel, Robert
Published in: Leibniz International Proceedings in Informatics, 204, Issue 1, 2021
Publisher: 29th Annual European Symposium on Algorithms (ESA 2021)
DOI: 10.3929/ethz-b-000507027

Online facility location with deletions

Author(s): Cygan, Marek; Czumaj, Artur; Mucha, Marcin; Sankowski, Piotr
Published in: 26th Annual European Symposium on Algorithms (ESA 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2018.21

The Asymmetric Travelling Salesman Problem in Sparse Digraphs

Author(s): Kowalik, ��ukasz; Majewski, Konrad
Published in: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.ipec.2020.23

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

Author(s): Magnús M. Halldórsson; Guy Kortsarz; Marek Cygan
Published in: WAOA 2020. Lecture Notes in Computer Science, vol 12806., 2020
Publisher: Springer
DOI: 10.1007/978-3-030-80879-2_11

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

Author(s): Vincent Cohen-Addad; Michał Pilipczuk; Marcin Pilipczuk
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00042

Subquadratic Approximation Scheme for Partition

Author(s): Marcin Mucha; Karol Węgrzycki; Michał Włodarczyk
Published in: Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020, ISBN 978-1-61197-548-2
Publisher: SIAM
DOI: 10.1137/1.9781611975482.5

Many Visits TSP Revisited

Author(s): Kowalik, Łukasz; Li, Shaohua; Nadara, Wojciech; Smulewicz, Marcin; Wahlström, Magnus
Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2020.66

Finding large $H$-colorable subgraphs in hereditary graph classes

Author(s): Maria Chudnovsky; Jason King; Michał Pilipczuk; Paweł Rzaͅżewski; Sophie Spirkl
Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.1137/20m1367660

Rankwidth meets stability

Author(s): Ossona De Mendez, Patrice; Nešetřil, Jaroslav; Pilipczuk, Michał; Rabinovich, Roman; Siebertz, Sebastian
Published in: SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2021, ISBN 978-1-61197-646-5
Publisher: SIAM
DOI: 10.1137/1.9781611976465.120

On Directed Feedback Vertex Set Parameterized by Treewidth

Author(s): Bonamy, Marthe; Kowalik, Łukasz; Nederlof, Jesper; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin; Brandstädt, Andreas; Köhler, Ekkehard; Meer, Klaus
Published in: Lecture Notes in Computer Science book series (LNCS, volume 11159), 2018, ISSN 0302-9743
Publisher: Springer
DOI: 10.1007/978-3-030-00256-5_6

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

Author(s): Marcin Pilipczuk; Michał Pilipczuk; Paweł Rzążewski
Published in: Symposium on Simplicity in Algorithms (SOSA) 2021, 2021, ISBN 978-1-61197-649-6
Publisher: SIAM
DOI: 10.1137/1.9781611976496.23

Round Compression for Parallel Matching Algorithms

Author(s): Artur Czumaj; Jakub Łącki; Aleksander Mądry; Slobodan Mitrović; Krzysztof Onak; Piotr Sankowski
Published in: STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, ISBN 978-1-4503-5559-9
Publisher: ACM
DOI: 10.1137/18m1197655

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Author(s): Dušan Knop; Michał Pilipczuk; Marcin Wrochna
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2019.44

On the Complexity Landscape of Connected f -Factor Problems

Author(s): Ganian, R.; Narayanaswamy, N. S.; Ordyniak, S.; Rahul, C. S.; Ramanujan, M. S.
Published in: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), 2020
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2016.41

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Author(s): Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas
Published in: VOLUME=112;TITLE=26th Annual European Symposium on Algorithms, 2018, ISBN 978-3-95977-081-1
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.1007/s00453-019-00670-w

Integer Programming and Incidence Treedepth.

Author(s): Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin
Published in: Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings, 2019, ISSN 0302-9743
Publisher: Springer
DOI: 10.1007/978-3-030-17953-3_15

Faster Approximate Pattern Matching: A Unified Approach

Author(s): Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, ISBN 978-1-7281-9621-3
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00095

Reachability for Bounded Branching VASS

Author(s): Mazowiecki, Filip; Pilipczuk, Michał
Published in: 30th International Conference on Concurrency Theory (CONCUR 2019), 2019, ISBN 978-3-95977-121-4
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2019.28

Hardness of Approximation for H-Free Edge Modification Problems

Author(s): Ivan Bliznets, Marek Cygan, Paweł Komosa, Michał Pilipczuk
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, Issue 60, 2016, Page(s) 3:1-3:17, ISBN 978-3-95977-018-7
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.3

Clifford Algebras Meet Tree Decompositions

Author(s): Michał Włodarczyk
Published in: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Issue 63, 2016, Page(s) 29:1--29:18, ISBN 978-3-95977-023-1
Publisher: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.IPEC.2016.29

On Problems Equivalent to (min,+)-Convolution

Author(s): Marek Cygan, Marcin Mucha, Karol Węgrzycki, Michał Włodarczyk
Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Issue 80, 2017, Page(s) 22:1--22:15, ISBN 978-3-95977-041-5
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.22

When the Optimum is also Blind: a New Perspective on Universal Optimization

Author(s): Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michał Wlodarczyk
Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Issue 80, 2017, Page(s) 35:1-35:15, ISBN 978-3-95977-041-5
Publisher: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.35

Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration

Author(s): Marcin Bieńkowski, Jarosław Byrka, Marcin Mucha
Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Issue 80, 2017, Page(s) 13:1--13:14, ISBN 978-3-95977-041-5
Publisher: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.13

Improving TSP Tours Using Dynamic Programming over Tree Decompositions

Author(s): Marek Cygan, Łukasz Kowalik, Arkadiusz Socała
Published in: 25th Annual European Symposium on Algorithms (ESA 2017), Issue 87, 2017, Page(s) 30:1--30:14, ISBN 978-3-95977-049-1
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ESA.2017.30

Tight Lower Bounds for the Complexity of Multicoloring

Author(s): Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Socała, Marcin Wrochna
Published in: 25th Annual European Symposium on Algorithms (ESA 2017), Issue 87, 2017, Page(s) 18:1--18:14, ISBN 978-3-95977-049-1
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ESA.2017.18

Why Do Cascade Sizes Follow a Power-Law?

Author(s): Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
Published in: Proceedings of the 26th International Conference on World Wide Web - WWW '17, 2017, Page(s) 569-576, ISBN 9781-450349130
Publisher: ACM Press
DOI: 10.1145/3038912.3052565

Improved Distance Queries and Cycle Counting by Frobenius Normal Form

Author(s): Piotr Sankowski, Karol Węgrzycki
Published in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Issue 66, 2017, Page(s) 56:1--56:14, ISBN 978-3-95977-028-6
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2017.56

Approximation and Parameterized Complexity of Minimax Approval Voting

Author(s): Marek Cygan, Łukasz Kowalik, Arkadiusz Socała, Krzysztof Sornat
Published in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017, Page(s) 459--465
Publisher: AAAI Press

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

Author(s): Chalermsook, Parinya; Cygan, Marek; Kortsarz, Guy; Laekhanukit, Bundit; Manurangsi, Pasin; Nanongkai, Danupon; Trevisan, Luca
Published in: Proceedings of FOCS 2017, Issue 5, 2017
Publisher: IEEE

Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors

Author(s): Nederlof, Jesper; Węgrzycki, Karol
Published in: STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, ISBN 978-1-4503-8053-9
Publisher: ACM

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

Author(s): Chen, Jiehua; Hermelin, Danny; Sorge, Manuel
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.28

Internal Dictionary Matching

Author(s): Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed; Jakub Radoszewski; Wojciech Rytter; Tomasz Waleń
Published in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2019.22

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Author(s): Jana Novotná; Jana Novotná; Karolina Okrasa; Karolina Okrasa; Michał Pilipczuk; Paweł Rzążewski; Paweł Rzążewski; Erik Jan van Leeuwen; Bartosz Walczak
Published in: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2019.23

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

Author(s): Nederlof, Jesper; Pilipczuk, Michal; Swennenhuis, Céline M. F.; Wegrzycki, Karol; Adler, Isolde; Müller, Haiko
Published in: Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, 2020
Publisher: Springer
DOI: 10.1007/978-3-030-60440-0_3

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Author(s): Bonnet, Édouard; Iwata, Yoichi; Jansen, Bart M.P.; Kowalik, Łukasz; Bender, Michael A.; Svensson, Ola; Herman, Grzegorz
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.23

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

Author(s): Cohen-Addad, Vincent; Pilipczuk, Marcin; Pilipczuk, Michał
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.33

VC density of set systems defnable in tree-like graphs

Author(s): Paszke, Adam; Pilipczuk, Michał
Published in: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), 2020
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2020.78

Parameterized Inapproximability for Steiner Orientation by Gap Amplification

Author(s): Włodarczyk, Michał
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020, ISBN 978-3-95977-138-2
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2020.104

Shorter Labeling Schemes for Planar Graphs

Author(s): Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał
Published in: ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 2020
Publisher: SIAM
DOI: 10.1137/1.9781611975994.27

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

Author(s): 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
Published in: ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021
Publisher: ACM
DOI: 10.1137/1.9781611976465.50

Equal-Subset-Sum Faster Than the Meet-in-the-Middle

Author(s): Mucha, Marcin; Nederlof, Jesper; Pawlewicz, Jakub; Węgrzycki, Karol; Bender, Michael A.; Svensson, Ola; Herman, Grzegorz
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2019.73

On polynomial recursive sequences

Author(s): Michaël Cadilhac; Filip Mazowiecki; Charles Paperman; Michał Pilipczuk; Géraud Sénizergues
Published in: "ICALP 2020 - 47th International Colloquium on Automata, Languages and Programming, Jul 2020, Saarbrücken / Virtual, Germany. ⟨10.4230/LIPIcs.ICALP.2020.117⟩", 2020, ISBN 978-3-95977-138-2
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2020.117

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Author(s): Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Węgrzycki
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 1682-1701, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.102

Bounds on Half Graph Orders in Powers of Sparse Graphs

Author(s): Sokołowski, Marek
Published in: Extended Abstracts EuroComb 2021, 2021, ISBN 978-3-030-83823-2
Publisher: Springer
DOI: 10.1007/978-3-030-83823-2_39

Clustering Powers of Sparse Graphs

Author(s): Jaroslav Nesetril; Patrice Ossona de Mendez; Michał Pilipczuk; Xuding Zhu
Published in: The Electronic Journal of Combinatorics, Open Journal Systems, 2020, 27 (4),, 2020, ISSN 1077-8926
Publisher: Electronic Journal of Combinatorics
DOI: 10.37236/9417

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

Author(s): Maria Chudnovsky; Marcin Pilipczuk; Michał Pilipczuk; Stéphan Thomassé
Published in: SIAM Journal on Discrete Mathematics, 2020, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1249473

Approximation and Parameterized Complexity of Minimax Approval Voting

Author(s): Marek Cygan; Lukasz Kowalik; Arkadiusz Socała; Krzysztof Sornat
Published in: Journal of Artificial Intelligence Research, 2018, ISSN 1076-9757
Publisher: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.11253

Covering minimal separators andpotential maximal cliques in $P_{t}$-free graphs

Author(s): Andrzej Grzesik; Tereza Klimošová; Marcin Pilipczuk; Michał Pilipczuk
Published in: Electronic Journal of Combinatorics, 2020, ISSN 1077-8926
Publisher: Electronic Journal of Combinatorics
DOI: 10.37236/9473

Circular Pattern Matching with k Mismatches.

Author(s): Panagiotis Charalampopoulos; Panagiotis Charalampopoulos; Tomasz Kociumaka; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszyński; Tomasz Waleń; Wiktor Zuba
Published in: Journal of Computer and System Sciences, 2021, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2020.07.003

SMART: SuperMaximal approximate repeats tool.

Author(s): Lorraine A.K. Ayad; Panagiotis Charalampopoulos; Panagiotis Charalampopoulos; Solon P. Pissis
Published in: Bioinformatics, 36(8), 2589 - 2591, 2020, ISSN 1367-4803
Publisher: Oxford University Press
DOI: 10.1093/bioinformatics/btz953

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

Author(s): Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
Published in: SIAM Journal on Computing, Issue 49/4, 2020, Page(s) 772-810, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1166869

Improved Distance Queries and Cycle Counting by Frobenius Normal Form.

Author(s): Sankowski, Piotr; Węgrzycki, Karol
Published in: Theory of Computing Systems, 2018, ISSN 1432-4350
Publisher: Springer Verlag
DOI: 10.1007/s00224-018-9894-x

Shortest Augmenting Paths for Online Matchings on Trees

Author(s): Bartłomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych
Published in: Theory of Computing Systems, 2018, ISSN 1432-4350
Publisher: Springer Verlag
DOI: 10.1007/978-3-319-28684-6_6

Minimum Bisection Is Fixed-Parameter Tractable

Author(s): Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk; Michał Pilipczuk; Saket Saurabh
Published in: SIAM Journal on Computing, 2019, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/140988553

Randomized Contractions Meet Lean Decompositions

Author(s): Marek Cygan; Paweł Komosa; Daniel Lokshtanov; Marcin Pilipczuk; Michał Pilipczuk; Saket Saurabh; Magnus Wahlström
Published in: ACM Transactions on Algorithms, 2020, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3426738

Matchings under Preferences - Strength of Stability and Trade-Offs

Author(s): Chen, Jiehua; Skowron, Piotr; Sorge, Manuel
Published in: ACM Transactions on Economics and Computation, 2021, ISSN 2167-8375
Publisher: Association for Computing Machinery
DOI: 10.1145/3485000

Small One-Dimensional Euclidean Preference Profiles

Author(s): Jiehua Chen; Sven Grottke
Published in: Social Choice and Welfare, 2021, ISSN 0176-1714
Publisher: Springer Verlag
DOI: 10.1007/s00355-020-01301-y

Erdös-Hajnal properties for powers of sparse graphs

Author(s): Marcin Briański; Piotr Micek; Michał Pilipczuk; Michał T. Seweryn
Published in: SIAM Journal on Discrete Mathematics, 2021, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1342756

Searching for OpenAIRE data...

Publications

Share this page Share this page on social networks

Download Download the content of the page