Technology Transfer between Integer Programming and Efficient Algorithms

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Computing Generalized Convolutions Faster Than Brute Force

Autori: Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Pubblicato in: Algorithmica, Numero 86(1), 2024, Pagina/e 334-366, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-023-01176-2

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

Autori: Karl Bringmann, Vincent Cohen-Addad, Debarati Das
Pubblicato in: ACM Transactions on Algorithms, Numero 19(1), 2023, Pagina/e 9:1-9:24, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3568398

Generating all invertible matrices by row operations

Autori: Petr Gregor, Hung P. Hoang, Arturo Merino, Ondřej Mička
Pubblicato in: Discrete Mathematics, Numero 349, 2026, Pagina/e 114851, ISSN 0012-365X
Editore: Elsevier BV
DOI: 10.1016/j.disc.2025.114851

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries

Autori: Karl Bringmann, Nofar Carmeli
Pubblicato in: Logical Methods in Computer Science, Numero Volume 21, Numero 1, 2025, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(1:29)2025

Tight Fine-Grained Bounds for Direct Access on Join Queries

Autori: Karl Bringmann, Nofar Carmeli, Stefan Mengel
Pubblicato in: ACM Transactions on Database Systems, Numero 50, 2025, Pagina/e 1-44, ISSN 0362-5915
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3707448

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

Autori: Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
Pubblicato in: TheoretiCS, Numero Volume 3, 2024, ISSN 2751-4838
Editore: 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

Autori: Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Węgrzycki
Pubblicato in: SIAM Journal on Computing, Numero 52(6), 2023, Pagina/e 1369-1412, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1478112

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

Autori: Karl Bringmann, Marvin Künnemann, André Nusser
Pubblicato in: Journal of Computational Geometry, Numero 12, 2021, Pagina/e 70-108, ISSN 0000-0000
Editore: none
DOI: 10.20382/jocg.v12i1a4

Scheduling Lower Bounds via AND Subset Sum

Autori: Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Pubblicato in: Journal of Computer and System Sciences, Numero 127, 2022, Pagina/e 29-40, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2022.01.005

Faster Minimization of Tardy Processing Time on a Single Machine

Autori: Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Pubblicato in: Algorithmica, Numero 84(5), 2022, Pagina/e 1341-1356, ISSN 1432-0541
Editore: Springer
DOI: 10.1007/s00453-022-00928-w

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

Autori: Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 37(1), 2023, Pagina/e 1566-1586, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1518943

SETH-based Lower Bounds for Subset Sum and Bicriteria Path

Autori: Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Pubblicato in: ACM Transactions on Algorithms, Numero 18(1), 2022, Pagina/e 6:1-6:22, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3450524

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

Autori: Karl Bringmann, Marvin Künnemann, André Nusser
Pubblicato in: ACM Transactions on Algorithms, Numero 17, 2021, Pagina/e 25:1-25:42, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3460656

Beating Bellman’s Algorithm for Subset Sum

Autori: Karl Bringmann, Nick Fischer, Vasileios Nakos
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Pagina/e 4596-4612
Editore: 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

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

Clustering to Minimize Cluster-Aware Norm Objectives

Autori: Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Pagina/e 255-287
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.8

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

Autori: Amir Abboud, Karl Bringmann, Nick Fischer
Pubblicato in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, 2023, Pagina/e 391-404, ISBN 978-1-4503-9913-5
Editore: ACM
DOI: 10.1145/3564246.3585240

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

Autori: Karl Bringmann, Vasileios Nakos
Pubblicato in: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, 2020, Pagina/e 982-995
Editore: ACM

Tight Fine-Grained Bounds for Direct Access on Join Queries

Autori: Karl Bringmann, Nofar Carmeli, Stefan Mengel
Pubblicato in: PODS '22: International Conference on Management of Data, 2022, Pagina/e 427-436, ISBN 978-1-4503-9260-0
Editore: ACM
DOI: 10.1145/3517804.3526234

Fitting Tree Metrics with Minimum Disagreements

Autori: Evangelos Kipouridis
Pubblicato in: 31st Annual European Symposium on Algorithms, ESA 2023, Numero 274, 2023, Pagina/e 70:1-70:10, ISBN 978-3-95977-295-2
Editore: 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

Autori: Karl Bringmann, Alejandro Cassis
Pubblicato in: 31st Annual European Symposium on Algorithms, ESA 2023, Numero 274, 2023, Pagina/e 24:1-24:16, ISBN 978-3-95977-295-2
Editore: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.24

Approximating Subset Sum Ratio faster than Subset Sum

Autori: Karl Bringmann
Pubblicato in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Pagina/e 1260-1277, ISBN 978-1-61197-791-2
Editore: SIAM
DOI: 10.1137/1.9781611977912.50

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

Autori: Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
Pubblicato in: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, Numero 287, 2024, Pagina/e 22:1-22:25, ISBN 978-3-95977-309-6
Editore: 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

Autori: Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
Pubblicato in: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 2023, Pagina/e 4768-4845, ISBN 978-1-61197-755-4
Editore: SIAM
DOI: 10.1137/1.9781611977554.ch177

Near-Optimal Directed Low-Diameter Decompositions

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

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

Autori: Friedrich Eisenbrand, Lars Rohwedder, Karol Węgrzycki
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 1610-1620
Editore: IEEE
DOI: 10.1109/focs61266.2024.00100

A Structural Investigation of the Approximability of Polynomial-Time Problems

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

A Faster Algorithm for Constrained Correlation Clustering

Autori: Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
Pubblicato in: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Numero 327, 2025, Pagina/e 32:1-32:18, ISBN 978-3-95977-365-2
Editore: 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

Autori: François Dross, Krzysztof Fleszar, Karol Węgrzycki, Anna Zych-Pawlewicz
Pubblicato in: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 2023, Pagina/e 1433-1463, ISBN 978-1-61197-755-4
Editore: SIAM
DOI: 10.1137/1.9781611977554.ch52

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

Autori: Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
Pubblicato in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Pagina/e 625-638, ISBN 978-1-61197-791-2
Editore: SIAM
DOI: 10.1137/1.9781611977912.23

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

Autori: Karl Bringmann, Egor Gorbachev
Pubblicato in: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Pagina/e 2145-2156
Editore: ACM
DOI: 10.1145/3717823.3718141

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

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

Separator Theorem and Algorithms for Planar Hyperbolic Graphs

Autori: Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Pubblicato in: 40th International Symposium on Computational Geometry, SoCG 2024, Numero 293, 2024, Pagina/e 67:1-67:17, ISBN 978-3-95977-316-4
Editore: 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

Autori: Jesper Nederlof, Karol Wegrzycki
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Pagina/e 1670-1683
Editore: ACM

Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution

Autori: Karl Bringmann, Alejandro Cassis
Pubblicato in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Pagina/e 31:1-31:21, ISBN 978-3-95977-235-8
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2022.31

Dynamic Dynamic Time Warping

Autori: Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg
Pubblicato in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Pagina/e 208-242, ISBN 978-1-61197-791-2
Editore: SIAM
DOI: 10.1137/1.9781611977912.10

Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution

Autori: Karl Bringmann, Nick Fischer, Vasileios Nakos
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Pagina/e 1711-1724
Editore: ACM

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution

Autori: Karl Bringmann, Nick Fischer, Vasileios Nakos
Pubblicato in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Pagina/e 3069-3090, ISBN 978-1-61197-707-3
Editore: SIAM
DOI: 10.1137/1.9781611977073.119

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

Autori: Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Pagina/e 1682-1701, ISBN 978-1-61197-646-5
Editore: SIAM
DOI: 10.1137/1.9781611976465.102

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

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

Scheduling Lower Bounds via AND Subset Sum

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

Isolation Schemes for Problems on Decomposable Graphs

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

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

Autori: Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
Pubblicato in: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, 2021, Pagina/e 351-362, ISBN 978-1-6654-2055-6
Editore: IEEE
DOI: 10.1109/focs52979.2021.00043

Fine-Grained Completeness for Optimization in P

Autori: Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, 2021, Pagina/e 9:1-9:22
Editore: 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

Autori: Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
Pubblicato in: Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Numero 13992, 2023, Pagina/e 196-217, ISBN 978-3-031-30828-4
Editore: Springer LNCS
DOI: 10.1007/978-3-031-30829-1_10

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

Autori: Karl Bringmann, Anita Dürr, Adam Polak
Pubblicato in: 32nd Annual European Symposium on Algorithms (ESA 2024), Numero 308, 2024, Pagina/e 33:1-33:15, ISBN 978-3-95977-338-6
Editore: 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

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

Faster Sublinear-Time Edit Distance

Autori: Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka
Pubblicato in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Pagina/e 3274-3301, ISBN 978-1-61197-791-2
Editore: SIAM
DOI: 10.1137/1.9781611977912.117

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

Autori: Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
Pubblicato in: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Pagina/e 1102-1115, ISBN 978-1-4503-9264-8
Editore: ACM
DOI: 10.1145/3519935.3519990

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

Autori: Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
Pubblicato in: 40th International Symposium on Computational Geometry, SoCG 2024, Numero 293, 2024, Pagina/e 25:1-25:17, ISBN 978-3-95977-316-4
Editore: 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

Autori: Karl Bringmann
Pubblicato in: Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, 2021, Pagina/e 60-70, ISBN 978-3-030-80048-2
Editore: Springer
DOI: 10.1007/978-3-030-80049-9_6

The Time Complexity of Fully Sparse Matrix Multiplication

Autori: Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann
Pubblicato in: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024, Pagina/e 4670-4703, ISBN 978-1-61197-791-2
Editore: SIAM
DOI: 10.1137/1.9781611977912.167

Generating All Invertible Matrices by Row Operations

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

Dynamic Data Structures for Parameterized String Problems

Autori: Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz
Pubblicato in: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Numero 254, 2023, Pagina/e 50:1-50:22, ISBN 978-3-95977-266-2
Editore: LIPIcs Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2023.50

Structural Parameterization of Steiner Tree Packing

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

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

Autori: Karl Bringmann, Alejandro Cassis, Nick Fischer
Pubblicato in: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, 2023, Pagina/e 515-538, ISBN 979-8-3503-1894-4
Editore: IEEE
DOI: 10.1109/focs57990.2023.00038

Improved Sublinear-Time Edit Distance for Preprocessed Strings

Autori: Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
Pubblicato in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Pagina/e 32:1-32:20, ISBN 978-3-95977-235-8
Editore: 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

Autori: Karl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros
Pubblicato in: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Pagina/e 517-550, ISBN 978-1-61197-707-3
Editore: SIAM
DOI: 10.1137/1.9781611977073.25

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

Autori: Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir
Pubblicato in: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Pagina/e 1487-1500, ISBN 978-1-4503-9264-8
Editore: ACM
DOI: 10.1145/3519935.3520066

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

Autori: Karl Bringmann, André Nusser
Pubblicato in: 37th International Symposium on Computational Geometry (SoCG 2021), 2021, Pagina/e 18:1-18:17
Editore: 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

Autori: Mahdi Cheraghchi, Vasileios Nakos
Pubblicato in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Pagina/e 1203-1213, ISBN 978-1-7281-9621-3
Editore: IEEE
DOI: 10.1109/focs46700.2020.00115

Fine-Grained Equivalence for Problems Related to Integer Linear Programming

Autori: Lars Rohwedder, Karol Węgrzycki
Pubblicato in: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), Numero 325, 2025, Pagina/e 83:1-83:18, ISBN 978-3-95977-361-4
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.itcs.2025.83

A Fine-Grained Perspective on Approximating Subset Sum and Partition

Autori: Karl Bringmann, Vasileios Nakos
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Pagina/e 1797-1815
Editore: SIAM

Computing Generalized Convolutions Faster Than Brute Force

Autori: Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki
Pubblicato in: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Leibniz International Proceedings in Informatics (LIPIcs), Numero 249, 2022, Pagina/e 12:1--12:22, ISBN 978-3-95977-260-0
Editore: "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

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

On Near-Linear-Time Algorithms for Dense Subset Sum

Autori: Karl Bringmann, Philip Wellnitz
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Pagina/e 1777-1796
Editore: SIAM

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds

Autori: Itai Boneh, Egor Gorbachev, Tomasz Kociumaka
Pubblicato in: 33rd Annual European Symposium on Algorithms (ESA 2025), Numero 351, 2025, Pagina/e 45:1-45:16, ISBN 978-3-95977-395-9
Editore: 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

Autori: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Pubblicato in: 32nd Annual European Symposium on Algorithms (ESA 2024), Numero 308, 2024, Pagina/e 43:1-43:18, ISBN 978-3-95977-338-6
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.43

Knapsack with Small Items in Near-Quadratic Time

Autori: Karl Bringmann
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, 2024, Pagina/e 259-270
Editore: ACM
DOI: 10.1145/3618260.3649719

Impossibility Results for Grammar-Compressed Linear Algebra

Autori: Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Pubblicato in: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, 2020, Pagina/e 8810-8823
Editore: Curran Associates, Inc.

Optimal Algorithms for Bounded Weighted Edit Distance

Autori: Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
Pubblicato in: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, 2023, Pagina/e 2177-2187, ISBN 979-8-3503-1894-4
Editore: IEEE
DOI: 10.1109/focs57990.2023.00135

Faster Minimization of Tardy Processing Time on a Single Machine

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

On the Approximability of Multistage Min-Sum Set Cover

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

Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

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

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

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

Fast and Simple Modular Subset Sum

Autori: Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Pubblicato in: 4th Symposium on Simplicity in Algorithms, SOSA 2021, 2021, Pagina/e 57-67
Editore: SIAM

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

Autori: Egor Gorbachev, Tomasz Kociumaka
Pubblicato in: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Pagina/e 2157-2166
Editore: ACM
DOI: 10.1145/3717823.3718168

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

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

Knapsack and Subset Sum with Small Items

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

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications

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

Fast n-fold Boolean Convolution via Additive Combinatorics

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

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs

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

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Autori: Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Pubblicato in: The Electronic Journal of Combinatorics, Numero 30(3), 2023
Editore: The Electronic Journal of Combinatorics
DOI: 10.37236/11095

È in corso la ricerca di dati su OpenAIRE...

Pubblicazioni

Condividi questa pagina Condividi questa pagina sui social network

Scarica Scarica il contenuto della pagina