Technology Transfer between Integer Programming and Efficient Algorithms

Publications

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

Auteurs: Karl Bringmann, Vasileios Nakos
Publié dans: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, 2020, Page(s) 982-995
Éditeur: ACM

Tight Fine-Grained Bounds for Direct Access on Join Queries

Auteurs: Karl Bringmann, Nofar Carmeli, Stefan Mengel
Publié dans: PODS '22: International Conference on Management of Data, 2022, Page(s) 427-436, ISBN 978-1-4503-9260-0
Éditeur: ACM
DOI: 10.1145/3517804.3526234

A Structural Investigation of the Approximability of Polynomial-Time Problems

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

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

Auteurs: Jesper Nederlof, Karol Wegrzycki
Publié dans: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Page(s) 1670-1683
Éditeur: ACM

Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution

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

Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution

Auteurs: Karl Bringmann, Nick Fischer, Vasileios Nakos
Publié dans: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, 2021, Page(s) 1711-1724
Éditeur: ACM

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution

Auteurs: Karl Bringmann, Nick Fischer, Vasileios Nakos
Publié dans: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 2022, Page(s) 3069-3090, ISBN 978-1-61197-707-3
Éditeur: SIAM
DOI: 10.1137/1.9781611977073.119

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

Auteurs: Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
Publié dans: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Page(s) 1682-1701, ISBN 978-1-61197-646-5
Éditeur: SIAM
DOI: 10.1137/1.9781611976465.102

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

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

Scheduling Lower Bounds via AND Subset Sum

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

Isolation Schemes for Problems on Decomposable Graphs

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

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

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

Fine-Grained Completeness for Optimization in P

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

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

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

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

Auteurs: Karl Bringmann
Publié dans: Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, 2021, Page(s) 60-70, ISBN 978-3-030-80048-2
Éditeur: Springer
DOI: 10.1007/978-3-030-80049-9_6

Improved Sublinear-Time Edit Distance for Preprocessed Strings

Auteurs: Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
Publié dans: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 32:1-32:20, ISBN 978-3-95977-235-8
Éditeur: 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

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

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

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

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

Auteurs: Karl Bringmann, André Nusser
Publié dans: 37th International Symposium on Computational Geometry (SoCG 2021), 2021, Page(s) 18:1-18:17
Éditeur: 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

Auteurs: Mahdi Cheraghchi, Vasileios Nakos
Publié dans: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 1203-1213, ISBN 978-1-7281-9621-3
Éditeur: IEEE
DOI: 10.1109/focs46700.2020.00115

A Fine-Grained Perspective on Approximating Subset Sum and Partition

Auteurs: Karl Bringmann, Vasileios Nakos
Publié dans: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Page(s) 1797-1815
Éditeur: SIAM

Computing Generalized Convolutions Faster Than Brute Force

Auteurs: Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki
Publié dans: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Leibniz International Proceedings in Informatics (LIPIcs), Numéro 249, 2022, Page(s) 12:1--12:22, ISBN 978-3-95977-260-0
Éditeur: "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

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

On Near-Linear-Time Algorithms for Dense Subset Sum

Auteurs: Karl Bringmann, Philip Wellnitz
Publié dans: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 2021, Page(s) 1777-1796
Éditeur: SIAM

Impossibility Results for Grammar-Compressed Linear Algebra

Auteurs: Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Publié dans: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, 2020, Page(s) 8810-8823
Éditeur: Curran Associates, Inc.

Faster Minimization of Tardy Processing Time on a Single Machine

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

On the Approximability of Multistage Min-Sum Set Cover

Auteurs: Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis
Publié dans: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

Auteurs: Karl Bringmann, Jasper Slusallek
Publié dans: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

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

Auteurs: Karl Bringmann, Vincent Cohen-Addad, Debarati Das
Publié dans: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Fast and Simple Modular Subset Sum

Auteurs: Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Publié dans: 4th Symposium on Simplicity in Algorithms, SOSA 2021, 2021, Page(s) 57-67
Éditeur: SIAM

Knapsack and Subset Sum with Small Items

Auteurs: Adam Polak, Lars Rohwedder, Karol Wegrzycki
Publié dans: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Fast n-fold Boolean Convolution via Additive Combinatorics

Auteurs: Karl Bringmann, Vasileios Nakos
Publié dans: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Éditeur: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs

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

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

Auteurs: Karl Bringmann, Marvin Künnemann, André Nusser
Publié dans: Journal of Computational Geometry, Numéro 12, 2021, Page(s) 70-108, ISSN 0000-0000
Éditeur: none
DOI: 10.20382/jocg.v12i1a4

Scheduling Lower Bounds via AND Subset Sum

Auteurs: Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Publié dans: Journal of Computer and System Sciences, Numéro 127, 2022, Page(s) 29-40, ISSN 0022-0000
Éditeur: Academic Press
DOI: 10.1016/j.jcss.2022.01.005

Faster Minimization of Tardy Processing Time on a Single Machine

Auteurs: Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
Publié dans: Algorithmica, Numéro 84(5), 2022, Page(s) 1341-1356, ISSN 1432-0541
Éditeur: Springer
DOI: 10.1007/s00453-022-00928-w

SETH-based Lower Bounds for Subset Sum and Bicriteria Path

Auteurs: Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay
Publié dans: ACM Transactions on Algorithms, Numéro 18(1), 2022, Page(s) 6:1-6:22, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3450524

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

Auteurs: Karl Bringmann, Marvin Künnemann, André Nusser
Publié dans: ACM Transactions on Algorithms, Numéro 17, 2021, Page(s) 25:1-25:42, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3460656

Recherche de données OpenAIRE...

Publications

Partager cette page

Télécharger