Technology Transfer between Integer Programming and Efficient Algorithms

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

Computing Generalized Convolutions Faster Than Brute Force

Author(s): Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Published in: Algorithmica, Issue 86(1), 2024, Page(s) 334-366, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-023-01176-2

A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence

Author(s): Karl Bringmann, Vincent Cohen-Addad, Debarati Das
Published in: ACM Transactions on Algorithms, Issue 19(1), 2023, Page(s) 9:1-9:24, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3568398

Generating all invertible matrices by row operations

Author(s): Petr Gregor, Hung P. Hoang, Arturo Merino, Ondřej Mička
Published in: Discrete Mathematics, Issue 349, 2026, Page(s) 114851, ISSN 0012-365X
Publisher: Elsevier BV
DOI: 10.1016/j.disc.2025.114851

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries

Author(s): Karl Bringmann, Nofar Carmeli
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:29)2025

Tight Fine-Grained Bounds for Direct Access on Join Queries

Author(s): Karl Bringmann, Nofar Carmeli, Stefan Mengel
Published in: ACM Transactions on Database Systems, Issue 50, 2025, Page(s) 1-44, ISSN 0362-5915
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3707448

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

Author(s): Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
Published in: TheoretiCS, Issue Volume 3, 2024, ISSN 2751-4838
Publisher: TheoretiCS Foundation e.V.
DOI: 10.46298/theoretics.24.22

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: SIAM Journal on Computing, Issue 52(6), 2023, Page(s) 1369-1412, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1478112

Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance

Author(s): Karl Bringmann, Marvin Künnemann, André Nusser
Published in: Journal of Computational Geometry, Issue 12, 2021, Page(s) 70-108, ISSN 0000-0000
Publisher: none
DOI: 10.20382/jocg.v12i1a4

Scheduling Lower Bounds via AND Subset Sum

Author(s): Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Published in: Journal of Computer and System Sciences, Issue 127, 2022, Page(s) 29-40, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2022.01.005

Faster Minimization of Tardy Processing Time on a Single Machine

Author(s): Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Published in: Algorithmica, Issue 84(5), 2022, Page(s) 1341-1356, ISSN 1432-0541
Publisher: Springer
DOI: 10.1007/s00453-022-00928-w

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

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

SETH-based Lower Bounds for Subset Sum and Bicriteria Path

Author(s): Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Published in: ACM Transactions on Algorithms, Issue 18(1), 2022, Page(s) 6:1-6:22, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3450524

Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm

Author(s): Karl Bringmann, Marvin Künnemann, André Nusser
Published in: ACM Transactions on Algorithms, Issue 17, 2021, Page(s) 25:1-25:42, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3460656

Beating Bellman’s Algorithm for Subset Sum

Author(s): Karl Bringmann, Nick Fischer, Vasileios Nakos
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 4596-4612
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.157

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints

Author(s): Jesper Nederlof, Céline M. F. Swennenhuis, Karol Węgrzycki
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 535-552
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.16

Clustering to Minimize Cluster-Aware Norm Objectives

Author(s): Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 255-287
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.8

Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics

Author(s): Amir Abboud, Karl Bringmann, Nick Fischer
Published in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, 2023, Page(s) 391-404, ISBN 978-1-4503-9913-5
Publisher: ACM
DOI: 10.1145/3564246.3585240

Top-k-convolution and the quest for near-linear output-sensitive subset sum

Author(s): Karl Bringmann, Vasileios Nakos
Published in: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, 2020, Page(s) 982-995
Publisher: ACM

Tight Fine-Grained Bounds for Direct Access on Join Queries

Author(s): Karl Bringmann, Nofar Carmeli, Stefan Mengel
Published in: PODS '22: International Conference on Management of Data, 2022, Page(s) 427-436, ISBN 978-1-4503-9260-0
Publisher: ACM
DOI: 10.1145/3517804.3526234

Fitting Tree Metrics with Minimum Disagreements

Author(s): Evangelos Kipouridis
Published in: 31st Annual European Symposium on Algorithms, ESA 2023, Issue 274, 2023, Page(s) 70:1-70:10, ISBN 978-3-95977-295-2
Publisher: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.70

Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution

Author(s): Karl Bringmann, Alejandro Cassis
Published in: 31st Annual European Symposium on Algorithms, ESA 2023, Issue 274, 2023, Page(s) 24:1-24:16, ISBN 978-3-95977-295-2
Publisher: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.24

Approximating Subset Sum Ratio faster than Subset Sum

Author(s): Karl Bringmann
Published in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Page(s) 1260-1277, ISBN 978-1-61197-791-2
Publisher: SIAM
DOI: 10.1137/1.9781611977912.50

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

Author(s): Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
Published in: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, Issue 287, 2024, Page(s) 22:1-22:25, ISBN 978-3-95977-309-6
Publisher: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.itcs.2024.22

Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms

Author(s): Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
Published in: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 2023, Page(s) 4768-4845, ISBN 978-1-61197-755-4
Publisher: SIAM
DOI: 10.1137/1.9781611977554.ch177

Near-Optimal Directed Low-Diameter Decompositions

Author(s): Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
Published in: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Issue 334, 2025, Page(s) 35:1-35:18, ISBN 978-3-95977-372-0
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2025.35

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

Author(s): Friedrich Eisenbrand, Lars Rohwedder, Karol Węgrzycki
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 1610-1620
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00100

A Structural Investigation of the Approximability of Polynomial-Time Problems

Author(s): Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 30:1-30:20, ISBN 978-3-95977-235-8
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2022.30

A Faster Algorithm for Constrained Correlation Clustering

Author(s): Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
Published in: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Issue 327, 2025, Page(s) 32:1-32:18, ISBN 978-3-95977-365-2
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2025.32

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours

Author(s): François Dross, Krzysztof Fleszar, Karol Węgrzycki, Anna Zych-Pawlewicz
Published in: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 2023, Page(s) 1433-1463, ISBN 978-1-61197-755-4
Publisher: SIAM
DOI: 10.1137/1.9781611977554.ch52

A polynomial-time OPT^ɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph

Author(s): Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
Published in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Page(s) 625-638, ISBN 978-1-61197-791-2
Publisher: SIAM
DOI: 10.1137/1.9781611977912.23

A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends

Author(s): Karl Bringmann, Egor Gorbachev
Published in: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Page(s) 2145-2156
Publisher: ACM
DOI: 10.1145/3717823.3718141

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Author(s): Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Węgrzycki
Published in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Issue 261, 2023, Page(s) 131:1-131:20, ISBN 978-3-95977-278-5
Publisher: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2023.131

Separator Theorem and Algorithms for Planar Hyperbolic Graphs

Author(s): Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Published in: 40th International Symposium on Computational Geometry, SoCG 2024, Issue 293, 2024, Page(s) 67:1-67:17, ISBN 978-3-95977-316-4
Publisher: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2024.67

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

Author(s): Jesper Nederlof, Karol Wegrzycki
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Page(s) 1670-1683
Publisher: ACM

Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution

Author(s): Karl Bringmann, Alejandro Cassis
Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 31:1-31:21, ISBN 978-3-95977-235-8
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2022.31

Dynamic Dynamic Time Warping

Author(s): Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg
Published in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Page(s) 208-242, ISBN 978-1-61197-791-2
Publisher: SIAM
DOI: 10.1137/1.9781611977912.10

Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution

Author(s): Karl Bringmann, Nick Fischer, Vasileios Nakos
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Page(s) 1711-1724
Publisher: ACM

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution

Author(s): Karl Bringmann, Nick Fischer, Vasileios Nakos
Published in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Page(s) 3069-3090, ISBN 978-1-61197-707-3
Publisher: SIAM
DOI: 10.1137/1.9781611977073.119

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 Wegrzycki
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Page(s) 1682-1701, ISBN 978-1-61197-646-5
Publisher: SIAM
DOI: 10.1137/1.9781611976465.102

Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves

Author(s): Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
Published in: 38th International Symposium on Computational Geometry, SoCG 2022, 2022, Page(s) 20:1-20:17, ISBN 978-3-95977-227-3
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2022.20

Scheduling Lower Bounds via AND Subset Sum

Author(s): Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020, Page(s) 4:1-4:15
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.4

Isolation Schemes for Problems on Decomposable Graphs

Author(s): Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Published in: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 2022, Page(s) 50:1-50:20, ISBN 978-3-95977-222-8
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2022.50

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

Author(s): Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
Published in: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, 2021, Page(s) 351-362, ISBN 978-1-6654-2055-6
Publisher: IEEE
DOI: 10.1109/focs52979.2021.00043

Fine-Grained Completeness for Optimization in P

Author(s): Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, 2021, Page(s) 9:1-9:22
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.approx/random.2021.9

Coverability in 2-VASS with One Unary Counter is in NP

Author(s): Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
Published in: Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Issue 13992, 2023, Page(s) 196-217, ISBN 978-3-031-30828-4
Publisher: Springer LNCS
DOI: 10.1007/978-3-031-30829-1_10

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing

Author(s): Karl Bringmann, Anita Dürr, Adam Polak
Published in: 32nd Annual European Symposium on Algorithms (ESA 2024), Issue 308, 2024, Page(s) 33:1-33:15, ISBN 978-3-95977-338-6
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.33

The Tractability Border of Reachability in Simple Vector Addition Systems with States

Author(s): Dmitry Chistikov, Wojciech Czerwiński, Filip Mazowiecki, Łukasz Orlikowski, Henry Sinclair-Banks, Karol Węgrzycki
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 1332-1354
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00086

Faster Sublinear-Time Edit Distance

Author(s): Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka
Published in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Page(s) 3274-3301, ISBN 978-1-61197-791-2
Publisher: SIAM
DOI: 10.1137/1.9781611977912.117

Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime

Author(s): Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
Published in: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Page(s) 1102-1115, ISBN 978-1-4503-9264-8
Publisher: ACM
DOI: 10.1145/3519935.3519990

Fine-Grained Complexity of Earth Mover's Distance Under Translation

Author(s): Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
Published in: 40th International Symposium on Computational Geometry, SoCG 2024, Issue 293, 2024, Page(s) 25:1-25:17, ISBN 978-3-95977-316-4
Publisher: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2024.25

Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry

Author(s): Karl Bringmann
Published in: Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, 2021, Page(s) 60-70, ISBN 978-3-030-80048-2
Publisher: Springer
DOI: 10.1007/978-3-030-80049-9_6

The Time Complexity of Fully Sparse Matrix Multiplication

Author(s): Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann
Published in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Page(s) 4670-4703, ISBN 978-1-61197-791-2
Publisher: SIAM
DOI: 10.1137/1.9781611977912.167

Generating All Invertible Matrices by Row Operations

Author(s): Petr Gregor, Hung P. Hoang, Arturo Merino, Ondřej Mička
Published in: 35th International Symposium on Algorithms and Computation (ISAAC 2024), Issue 322, 2024, Page(s) 35:1-35:14, ISBN 978-3-95977-354-6
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.isaac.2024.35

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, Issue 254, 2023, Page(s) 50:1-50:22, ISBN 978-3-95977-266-2
Publisher: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2023.50

Structural Parameterization of Steiner Tree Packing

Author(s): Niko Hastrich, Kirill Simonov
Published in: 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), 2026
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

Author(s): Karl Bringmann, Alejandro Cassis, Nick Fischer
Published in: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, 2023, Page(s) 515-538, ISBN 979-8-3503-1894-4
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00038

Improved Sublinear-Time Edit Distance for Preprocessed Strings

Author(s): Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 32:1-32:20, ISBN 978-3-95977-235-8
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2022.32

Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance

Author(s): Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros
Published in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Page(s) 517-550, ISBN 978-1-61197-707-3
Publisher: SIAM
DOI: 10.1137/1.9781611977073.25

Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond

Author(s): Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir
Published in: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Page(s) 1487-1500, ISBN 978-1-4503-9264-8
Publisher: ACM
DOI: 10.1145/3519935.3520066

Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation

Author(s): Karl Bringmann, André Nusser
Published in: 37th International Symposium on Computational Geometry (SoCG 2021), 2021, Page(s) 18:1-18:17
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2021.18

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

Author(s): Mahdi Cheraghchi, Vasileios Nakos
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 1203-1213, ISBN 978-1-7281-9621-3
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00115

Fine-Grained Equivalence for Problems Related to Integer Linear Programming

Author(s): Lars Rohwedder, Karol Węgrzycki
Published in: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), Issue 325, 2025, Page(s) 83:1-83:18, ISBN 978-3-95977-361-4
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.itcs.2025.83

A Fine-Grained Perspective on Approximating Subset Sum and Partition

Author(s): Karl Bringmann, Vasileios Nakos
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Page(s) 1797-1815
Publisher: SIAM

Computing Generalized Convolutions Faster Than Brute Force

Author(s): Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki
Published in: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Leibniz International Proceedings in Informatics (LIPIcs), Issue 249, 2022, Page(s) 12:1--12:22, ISBN 978-3-95977-260-0
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.ipec.2022.12

When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation

Author(s): Karl Bringmann, Marvin Künnemann, André Nusser
Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Page(s) 25:1-25:17
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2020.25

On Near-Linear-Time Algorithms for Dense Subset Sum

Author(s): Karl Bringmann, Philip Wellnitz
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Page(s) 1777-1796
Publisher: SIAM

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds

Author(s): Itai Boneh, Egor Gorbachev, Tomasz Kociumaka
Published in: 33rd Annual European Symposium on Algorithms (ESA 2025), Issue 351, 2025, Page(s) 45:1-45:16, ISBN 978-3-95977-395-9
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2025.45

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), Issue 308, 2024, Page(s) 43:1-43:18, ISBN 978-3-95977-338-6
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.43

Knapsack with Small Items in Near-Quadratic Time

Author(s): Karl Bringmann
Published in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, 2024, Page(s) 259-270
Publisher: ACM
DOI: 10.1145/3618260.3649719

Impossibility Results for Grammar-Compressed Linear Algebra

Author(s): Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Published in: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, 2020, Page(s) 8810-8823
Publisher: Curran Associates, Inc.

Optimal Algorithms for Bounded Weighted Edit Distance

Author(s): Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
Published in: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, 2023, Page(s) 2177-2187, ISBN 979-8-3503-1894-4
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00135

Faster Minimization of Tardy Processing Time on a Single Machine

Author(s): Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020, Page(s) 19:1-19:12
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.19

On the Approximability of Multistage Min-Sum Set Cover

Author(s): Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

Author(s): Karl Bringmann, Jasper Slusallek
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence

Author(s): Karl Bringmann, Vincent Cohen-Addad, Debarati Das
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Fast and Simple Modular Subset Sum

Author(s): Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Published in: 4th Symposium on Simplicity in Algorithms, SOSA 2021, 2021, Page(s) 57-67
Publisher: SIAM

Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights

Author(s): Egor Gorbachev, Tomasz Kociumaka
Published in: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Page(s) 2157-2166
Publisher: ACM
DOI: 10.1145/3717823.3718168

Approximating Klee’s Measure Problem and a Lower Bound for Union Volume Estimation

Author(s): Karl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, Yanheng Wang
Published in: 41st International Symposium on Computational Geometry (SoCG 2025), Issue 332, 2025, Page(s) 25:1-25:16, ISBN 978-3-95977-370-6
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2025.25

Knapsack and Subset Sum with Small Items

Author(s): Adam Polak, Lars Rohwedder, Karol Wegrzycki
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications

Author(s): Paweł Gawrychowski, Egor Gorbachev, Tomasz Kociumaka
Published in: 33rd Annual European Symposium on Algorithms (ESA 2025), Issue 351, 2025, Page(s) 74:1-74:17, ISBN 978-3-95977-395-9
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2025.74

Fast n-fold Boolean Convolution via Additive Combinatorics

Author(s): Karl Bringmann, Vasileios Nakos
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs

Author(s): Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
Published in: 38th International Symposium on Computational Geometry, SoCG 2022, 2022, Page(s) 21:1-21:16, ISBN 978-3-95977-227-3
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2022.21

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Author(s): Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Published in: The Electronic Journal of Combinatorics, Issue 30(3), 2023
Publisher: The Electronic Journal of Combinatorics
DOI: 10.37236/11095

Searching for OpenAIRE data...

Publications

Share this page Share this page on social networks

Download Download the content of the page