Technology Transfer between Integer Programming and Efficient Algorithms

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Computing Generalized Convolutions Faster Than Brute Force

Autores: Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Publicado en: Algorithmica, Edición 86(1), 2024, Página(s) 334-366, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-023-01176-2

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

Autores: Karl Bringmann, Vincent Cohen-Addad, Debarati Das
Publicado en: ACM Transactions on Algorithms, Edición 19(1), 2023, Página(s) 9:1-9:24, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3568398

Generating all invertible matrices by row operations

Autores: Petr Gregor, Hung P. Hoang, Arturo Merino, Ondřej Mička
Publicado en: Discrete Mathematics, Edición 349, 2026, Página(s) 114851, ISSN 0012-365X
Editor: Elsevier BV
DOI: 10.1016/j.disc.2025.114851

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries

Autores: Karl Bringmann, Nofar Carmeli
Publicado en: Logical Methods in Computer Science, Edición Volume 21, Edición 1, 2025, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(1:29)2025

Tight Fine-Grained Bounds for Direct Access on Join Queries

Autores: Karl Bringmann, Nofar Carmeli, Stefan Mengel
Publicado en: ACM Transactions on Database Systems, Edición 50, 2025, Página(s) 1-44, ISSN 0362-5915
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3707448

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

Autores: Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
Publicado en: TheoretiCS, Edición Volume 3, 2024, ISSN 2751-4838
Editor: 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

Autores: Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Węgrzycki
Publicado en: SIAM Journal on Computing, Edición 52(6), 2023, Página(s) 1369-1412, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1478112

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

Autores: Karl Bringmann, Marvin Künnemann, André Nusser
Publicado en: Journal of Computational Geometry, Edición 12, 2021, Página(s) 70-108, ISSN 0000-0000
Editor: none
DOI: 10.20382/jocg.v12i1a4

Scheduling Lower Bounds via AND Subset Sum

Autores: Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Publicado en: Journal of Computer and System Sciences, Edición 127, 2022, Página(s) 29-40, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2022.01.005

Faster Minimization of Tardy Processing Time on a Single Machine

Autores: Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Publicado en: Algorithmica, Edición 84(5), 2022, Página(s) 1341-1356, ISSN 1432-0541
Editor: Springer
DOI: 10.1007/s00453-022-00928-w

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

Autores: Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki
Publicado en: SIAM Journal on Discrete Mathematics, Edición 37(1), 2023, Página(s) 1566-1586, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1518943

SETH-based Lower Bounds for Subset Sum and Bicriteria Path

Autores: Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Publicado en: ACM Transactions on Algorithms, Edición 18(1), 2022, Página(s) 6:1-6:22, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3450524

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

Autores: Karl Bringmann, Marvin Künnemann, André Nusser
Publicado en: ACM Transactions on Algorithms, Edición 17, 2021, Página(s) 25:1-25:42, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3460656

Beating Bellman’s Algorithm for Subset Sum

Autores: Karl Bringmann, Nick Fischer, Vasileios Nakos
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Página(s) 4596-4612
Editor: 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

Autores: Jesper Nederlof, Céline M. F. Swennenhuis, Karol Węgrzycki
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Página(s) 535-552
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.16

Clustering to Minimize Cluster-Aware Norm Objectives

Autores: Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Página(s) 255-287
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.8

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

Autores: Amir Abboud, Karl Bringmann, Nick Fischer
Publicado en: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, 2023, Página(s) 391-404, ISBN 978-1-4503-9913-5
Editor: ACM
DOI: 10.1145/3564246.3585240

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

Autores: Karl Bringmann, Vasileios Nakos
Publicado en: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, 2020, Página(s) 982-995
Editor: ACM

Tight Fine-Grained Bounds for Direct Access on Join Queries

Autores: Karl Bringmann, Nofar Carmeli, Stefan Mengel
Publicado en: PODS '22: International Conference on Management of Data, 2022, Página(s) 427-436, ISBN 978-1-4503-9260-0
Editor: ACM
DOI: 10.1145/3517804.3526234

Fitting Tree Metrics with Minimum Disagreements

Autores: Evangelos Kipouridis
Publicado en: 31st Annual European Symposium on Algorithms, ESA 2023, Edición 274, 2023, Página(s) 70:1-70:10, ISBN 978-3-95977-295-2
Editor: 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

Autores: Karl Bringmann, Alejandro Cassis
Publicado en: 31st Annual European Symposium on Algorithms, ESA 2023, Edición 274, 2023, Página(s) 24:1-24:16, ISBN 978-3-95977-295-2
Editor: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.24

Approximating Subset Sum Ratio faster than Subset Sum

Autores: Karl Bringmann
Publicado en: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Página(s) 1260-1277, ISBN 978-1-61197-791-2
Editor: SIAM
DOI: 10.1137/1.9781611977912.50

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

Autores: Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
Publicado en: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, Edición 287, 2024, Página(s) 22:1-22:25, ISBN 978-3-95977-309-6
Editor: 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

Autores: Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
Publicado en: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 2023, Página(s) 4768-4845, ISBN 978-1-61197-755-4
Editor: SIAM
DOI: 10.1137/1.9781611977554.ch177

Near-Optimal Directed Low-Diameter Decompositions

Autores: Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
Publicado en: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Edición 334, 2025, Página(s) 35:1-35:18, ISBN 978-3-95977-372-0
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2025.35

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

Autores: Friedrich Eisenbrand, Lars Rohwedder, Karol Węgrzycki
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 1610-1620
Editor: IEEE
DOI: 10.1109/focs61266.2024.00100

A Structural Investigation of the Approximability of Polynomial-Time Problems

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

A Faster Algorithm for Constrained Correlation Clustering

Autores: Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
Publicado en: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Edición 327, 2025, Página(s) 32:1-32:18, ISBN 978-3-95977-365-2
Editor: 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

Autores: François Dross, Krzysztof Fleszar, Karol Węgrzycki, Anna Zych-Pawlewicz
Publicado en: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 2023, Página(s) 1433-1463, ISBN 978-1-61197-755-4
Editor: SIAM
DOI: 10.1137/1.9781611977554.ch52

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

Autores: Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
Publicado en: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Página(s) 625-638, ISBN 978-1-61197-791-2
Editor: SIAM
DOI: 10.1137/1.9781611977912.23

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

Autores: Karl Bringmann, Egor Gorbachev
Publicado en: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Página(s) 2145-2156
Editor: ACM
DOI: 10.1145/3717823.3718141

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

Autores: Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Węgrzycki
Publicado en: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Edición 261, 2023, Página(s) 131:1-131:20, ISBN 978-3-95977-278-5
Editor: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2023.131

Separator Theorem and Algorithms for Planar Hyperbolic Graphs

Autores: Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Publicado en: 40th International Symposium on Computational Geometry, SoCG 2024, Edición 293, 2024, Página(s) 67:1-67:17, ISBN 978-3-95977-316-4
Editor: 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

Autores: Jesper Nederlof, Karol Wegrzycki
Publicado en: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Página(s) 1670-1683
Editor: ACM

Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution

Autores: Karl Bringmann, Alejandro Cassis
Publicado en: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Página(s) 31:1-31:21, ISBN 978-3-95977-235-8
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2022.31

Dynamic Dynamic Time Warping

Autores: Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg
Publicado en: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Página(s) 208-242, ISBN 978-1-61197-791-2
Editor: SIAM
DOI: 10.1137/1.9781611977912.10

Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution

Autores: Karl Bringmann, Nick Fischer, Vasileios Nakos
Publicado en: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Página(s) 1711-1724
Editor: ACM

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution

Autores: Karl Bringmann, Nick Fischer, Vasileios Nakos
Publicado en: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Página(s) 3069-3090, ISBN 978-1-61197-707-3
Editor: SIAM
DOI: 10.1137/1.9781611977073.119

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

Autores: Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Página(s) 1682-1701, ISBN 978-1-61197-646-5
Editor: SIAM
DOI: 10.1137/1.9781611976465.102

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

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

Scheduling Lower Bounds via AND Subset Sum

Autores: Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Publicado en: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020, Página(s) 4:1-4:15
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.4

Isolation Schemes for Problems on Decomposable Graphs

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

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

Autores: Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
Publicado en: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, 2021, Página(s) 351-362, ISBN 978-1-6654-2055-6
Editor: IEEE
DOI: 10.1109/focs52979.2021.00043

Fine-Grained Completeness for Optimization in P

Autores: Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
Publicado en: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, 2021, Página(s) 9:1-9:22
Editor: 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

Autores: Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
Publicado en: Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Edición 13992, 2023, Página(s) 196-217, ISBN 978-3-031-30828-4
Editor: Springer LNCS
DOI: 10.1007/978-3-031-30829-1_10

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

Autores: Karl Bringmann, Anita Dürr, Adam Polak
Publicado en: 32nd Annual European Symposium on Algorithms (ESA 2024), Edición 308, 2024, Página(s) 33:1-33:15, ISBN 978-3-95977-338-6
Editor: 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

Autores: Dmitry Chistikov, Wojciech Czerwiński, Filip Mazowiecki, Łukasz Orlikowski, Henry Sinclair-Banks, Karol Węgrzycki
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 1332-1354
Editor: IEEE
DOI: 10.1109/focs61266.2024.00086

Faster Sublinear-Time Edit Distance

Autores: Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka
Publicado en: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Página(s) 3274-3301, ISBN 978-1-61197-791-2
Editor: SIAM
DOI: 10.1137/1.9781611977912.117

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

Autores: Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
Publicado en: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Página(s) 1102-1115, ISBN 978-1-4503-9264-8
Editor: ACM
DOI: 10.1145/3519935.3519990

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

Autores: Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
Publicado en: 40th International Symposium on Computational Geometry, SoCG 2024, Edición 293, 2024, Página(s) 25:1-25:17, ISBN 978-3-95977-316-4
Editor: 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

Autores: Karl Bringmann
Publicado en: Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, 2021, Página(s) 60-70, ISBN 978-3-030-80048-2
Editor: Springer
DOI: 10.1007/978-3-030-80049-9_6

The Time Complexity of Fully Sparse Matrix Multiplication

Autores: Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann
Publicado en: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Página(s) 4670-4703, ISBN 978-1-61197-791-2
Editor: SIAM
DOI: 10.1137/1.9781611977912.167

Generating All Invertible Matrices by Row Operations

Autores: Petr Gregor, Hung P. Hoang, Arturo Merino, Ondřej Mička
Publicado en: 35th International Symposium on Algorithms and Computation (ISAAC 2024), Edición 322, 2024, Página(s) 35:1-35:14, ISBN 978-3-95977-354-6
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.isaac.2024.35

Dynamic Data Structures for Parameterized String Problems

Autores: Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz
Publicado en: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Edición 254, 2023, Página(s) 50:1-50:22, ISBN 978-3-95977-266-2
Editor: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2023.50

Structural Parameterization of Steiner Tree Packing

Autores: Niko Hastrich, Kirill Simonov
Publicado en: 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), 2026
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

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

Autores: Karl Bringmann, Alejandro Cassis, Nick Fischer
Publicado en: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, 2023, Página(s) 515-538, ISBN 979-8-3503-1894-4
Editor: IEEE
DOI: 10.1109/focs57990.2023.00038

Improved Sublinear-Time Edit Distance for Preprocessed Strings

Autores: Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
Publicado en: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Página(s) 32:1-32:20, ISBN 978-3-95977-235-8
Editor: 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

Autores: Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros
Publicado en: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Página(s) 517-550, ISBN 978-1-61197-707-3
Editor: SIAM
DOI: 10.1137/1.9781611977073.25

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

Autores: Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir
Publicado en: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Página(s) 1487-1500, ISBN 978-1-4503-9264-8
Editor: ACM
DOI: 10.1145/3519935.3520066

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

Autores: Karl Bringmann, André Nusser
Publicado en: 37th International Symposium on Computational Geometry (SoCG 2021), 2021, Página(s) 18:1-18:17
Editor: 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

Autores: Mahdi Cheraghchi, Vasileios Nakos
Publicado en: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Página(s) 1203-1213, ISBN 978-1-7281-9621-3
Editor: IEEE
DOI: 10.1109/focs46700.2020.00115

Fine-Grained Equivalence for Problems Related to Integer Linear Programming

Autores: Lars Rohwedder, Karol Węgrzycki
Publicado en: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), Edición 325, 2025, Página(s) 83:1-83:18, ISBN 978-3-95977-361-4
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.itcs.2025.83

A Fine-Grained Perspective on Approximating Subset Sum and Partition

Autores: Karl Bringmann, Vasileios Nakos
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Página(s) 1797-1815
Editor: SIAM

Computing Generalized Convolutions Faster Than Brute Force

Autores: Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki
Publicado en: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Leibniz International Proceedings in Informatics (LIPIcs), Edición 249, 2022, Página(s) 12:1--12:22, ISBN 978-3-95977-260-0
Editor: "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

Autores: Karl Bringmann, Marvin Künnemann, André Nusser
Publicado en: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Página(s) 25:1-25:17
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2020.25

On Near-Linear-Time Algorithms for Dense Subset Sum

Autores: Karl Bringmann, Philip Wellnitz
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Página(s) 1777-1796
Editor: SIAM

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds

Autores: Itai Boneh, Egor Gorbachev, Tomasz Kociumaka
Publicado en: 33rd Annual European Symposium on Algorithms (ESA 2025), Edición 351, 2025, Página(s) 45:1-45:16, ISBN 978-3-95977-395-9
Editor: 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

Autores: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Publicado en: 32nd Annual European Symposium on Algorithms (ESA 2024), Edición 308, 2024, Página(s) 43:1-43:18, ISBN 978-3-95977-338-6
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.43

Knapsack with Small Items in Near-Quadratic Time

Autores: Karl Bringmann
Publicado en: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, 2024, Página(s) 259-270
Editor: ACM
DOI: 10.1145/3618260.3649719

Impossibility Results for Grammar-Compressed Linear Algebra

Autores: Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Publicado en: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, 2020, Página(s) 8810-8823
Editor: Curran Associates, Inc.

Optimal Algorithms for Bounded Weighted Edit Distance

Autores: Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
Publicado en: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, 2023, Página(s) 2177-2187, ISBN 979-8-3503-1894-4
Editor: IEEE
DOI: 10.1109/focs57990.2023.00135

Faster Minimization of Tardy Processing Time on a Single Machine

Autores: Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Publicado en: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020, Página(s) 19:1-19:12
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.19

On the Approximability of Multistage Min-Sum Set Cover

Autores: Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis
Publicado en: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

Autores: Karl Bringmann, Jasper Slusallek
Publicado en: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

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

Autores: Karl Bringmann, Vincent Cohen-Addad, Debarati Das
Publicado en: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Fast and Simple Modular Subset Sum

Autores: Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Publicado en: 4th Symposium on Simplicity in Algorithms, SOSA 2021, 2021, Página(s) 57-67
Editor: SIAM

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

Autores: Egor Gorbachev, Tomasz Kociumaka
Publicado en: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Página(s) 2157-2166
Editor: ACM
DOI: 10.1145/3717823.3718168

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

Autores: Karl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, Yanheng Wang
Publicado en: 41st International Symposium on Computational Geometry (SoCG 2025), Edición 332, 2025, Página(s) 25:1-25:16, ISBN 978-3-95977-370-6
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2025.25

Knapsack and Subset Sum with Small Items

Autores: Adam Polak, Lars Rohwedder, Karol Wegrzycki
Publicado en: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications

Autores: Paweł Gawrychowski, Egor Gorbachev, Tomasz Kociumaka
Publicado en: 33rd Annual European Symposium on Algorithms (ESA 2025), Edición 351, 2025, Página(s) 74:1-74:17, ISBN 978-3-95977-395-9
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2025.74

Fast n-fold Boolean Convolution via Additive Combinatorics

Autores: Karl Bringmann, Vasileios Nakos
Publicado en: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs

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

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Autores: Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Publicado en: The Electronic Journal of Combinatorics, Edición 30(3), 2023
Editor: The Electronic Journal of Combinatorics
DOI: 10.37236/11095

Buscando datos de OpenAIRE...

Publicaciones

Compartir esta página Compartir esta página en las redes sociales

Descargar el PDF Descargar el contenido de la página