Skip to main content

Technology Transfer between Integer Programming and Efficient Algorithms

Searching for OpenAIRE data...

Publications

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

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

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

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

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

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

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

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.

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

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

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