Publications

Endnote

%0 Conference Proceedings
%A Borst, Sander
%A Eliáš, Marek
%A Venzin, Moritz
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Stronger Adversaries Grow Cheaper Forests: Online Node-weighted Steiner Problems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36E8-C
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2025-01-12 - 2025-01-15
%C New Orrleans, LA, USA
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%I SIAM

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Fischer, Nick
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Beating Bellman's Algorithm for Subset Sum : 
%U http://hdl.handle.net/21.11116/0000-0010-370C-4
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2025-01-12 - 2025-01-15
%C New Orrleans, LA, USA
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%I SIAM

Endnote

%0 Conference Proceedings
%A Cembrano, Javier
%A Correa, José
%A Schmidt-Kraepelin, Ulrike
%A Tsigonias-Dimitriadis, Alexandros
%A Verdugo, Victor
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T New Combinatorial Insights for Monotone Apportionment : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36AF-D
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms 
%Z date of event: 2025-01-12 - 2025-01-15
%C New Orrleans, LA, USA
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%I SIAM

Endnote

%0 Conference Proceedings
%A Herold, Martin
%A Kipouridis, Evangelos
%A Spoerhase, Joachim
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Clustering to Minimize Cluster-Aware Norm Objectives : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36A7-5
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2025-01-12 - 2025-01-15
%C New Orrleans, LA, USA
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%I SIAM

Endnote

%0 Conference Proceedings
%A Nederlof, Jesper
%A Swennenhuis, Céline M. F.
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs
  with Precedence Constraints : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36E1-3
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2025-01-12 - 2025-01-15
%C New Orrleans, LA, USA
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%I SIAM

Endnote

%0 Conference Proceedings
%A Abboud, Amir
%A Bringmann, Karl
%A Fischer, Nick
%A Künnemann, Marvin
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T The Time Complexity of Fully Sparse Matrix Multiplication : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2E5D-4
%R 10.1137/1.9781611977912.167
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 4670 - 4703
%I SIAM
%@ 978-1-61197-791-2
%U https://epubs.siam.org/doi/10.1137/1.9781611977912.167

Endnote

%0 Conference Proceedings
%A Agrawal, Akanksha
%A Lima, Paloma T.
%A Lokshtanov, Daniel
%A Saurabh, Saket
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2ED4-C
%R 10.1137/1.9781611977912.189
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 5276 - 5290
%I SIAM
%@ 978-1-61197-791-2

Endnote

%0 Journal Article
%A Akrami, Hannaneh
%A Alon, Noga
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2CEB-5
%R 10.1287/opre.2023.0433
%7 2024-10-21
%D 2024
%J Operations Research 
%& 1
%P 1 - 14
%I informs
%C Catonsville, MD
%@ false

Endnote

%0 Report
%A Akrami, Hannaneh
%A Rathi, Nidhi
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-3690-E
%U https://arxiv.org/abs/2409.01963
%D 2024
%X   We study the problem of computing \emph{fair} divisions of a set of<br>indivisible goods among agents with \emph{additive} valuations. For the past<br>many decades, the literature has explored various notions of fairness, that can<br>be primarily seen as either having \emph{envy-based} or \emph{share-based}<br>lens. For the discrete setting of resource-allocation problems, \emph{envy-free<br>up to any good} (EFX) and \emph{maximin share} (MMS) are widely considered as<br>the flag-bearers of fairness notions in the above two categories, thereby<br>capturing different aspects of fairness herein. Due to lack of existence<br>results of these notions and the fact that a good approximation of EFX or MMS<br>does not imply particularly strong guarantees of the other, it becomes<br>important to understand the compatibility of EFX and MMS allocations with one<br>another.<br>  In this work, we identify a novel way to simultaneously achieve MMS<br>guarantees with EFX/EF1 notions of fairness, while beating the best known<br>approximation factors [Chaudhury et al., 2021, Amanatidis et al., 2020]. Our<br>main contribution is to constructively prove the existence of (i) a partial<br>allocation that is both $2/3$-MMS and EFX, and (ii) a complete allocation that<br>is both $2/3$-MMS and EF1. Our algorithms run in pseudo-polynomial time if the<br>approximation factor for MMS is relaxed to $2/3-\varepsilon$ for any constant<br>$\varepsilon > 0$ and in polynomial time if, in addition, the EFX (or EF1)<br>guarantee is relaxed to $(1-\delta)$-EFX (or $(1-\delta)$-EF1) for any constant<br>$\delta>0$. In particular, we improve from the best approximation factor known<br>prior to our work, which computes partial allocations that are $1/2$-MMS and<br>EFX in pseudo-polynomial time [Chaudhury et al., 2021].<br>
%K Computer Science, Computer Science and Game Theory, cs.GT

Endnote

%0 Report
%A Akrami, Hannaneh
%A Rathi, Nidhi
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Epistemic EFX Allocations Exist for Monotone Valuations : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-3672-1
%U https://arxiv.org/abs/2405.14463
%D 2024
%X   We study the fundamental problem of fairly dividing a set of indivisible<br>items among agents with (general) monotone valuations. The notion of<br>envy-freeness up to any item (EFX) is considered to be one of the most<br>fascinating fairness concepts in this line of work. Unfortunately, despite<br>significant efforts, existence of EFX allocations is a major open problem in<br>fair division, thereby making the study of approximations and relaxations of<br>EFX a natural line of research. Recently, Caragiannis et al. introduced a<br>promising relaxation of EFX, called epistemic EFX (EEFX). We say an allocation<br>to be EEFX if, for every agent, it is possible to shuffle the items in the<br>remaining bundles so that she becomes "EFX-satisfied". Caragiannis et al. prove<br>existence and polynomial-time computability of EEFX allocations for additive<br>valuations. A natural question asks what happens when we consider valuations<br>more general than additive?<br>  We address this important open question and answer it affirmatively by<br>establishing the existence of EEFX allocations for an arbitrary number of<br>agents with general monotone valuations. To the best of our knowledge, EEFX is<br>the only known relaxation of EFX (beside EF1) to have such strong existential<br>guarantees. Furthermore, we complement our existential result by proving<br>computational and information-theoretic lower bounds. We prove that even for an<br>arbitrary number of (more than one) agents with identical submodular<br>valuations, it is PLS-hard to compute EEFX allocations and it requires<br>exponentially-many value queries to do so.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Garg, Jugal
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Breaking the 3/4 Barrier for Approximate Maximin Share : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1439-B
%R 10.1137/1.9781611977912
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 74 - 91
%I SIAM
%@ 978-1-61197-791-2
%U https://epubs.siam.org/doi/10.1137/1.9781611977912.4

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Garg, Jugal
%A Sharma, Eklavya
%A Taki, Setareh
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Improving Approximation Guarantees for Maximin Share : 
%G enq
%U http://hdl.handle.net/21.11116/0000-000F-143C-8
%D 2024
%B 25th ACM Conference on Economics and Computation
%Z date of event: 2024-07-08 - 2024-07-11
%C New Heaven, CT, USA
%B EC '24
%I ACM

Endnote

%0 Journal Article
%A Bannai, Hideo
%A Tomohiro, I.
%A Kociumaka, Tomasz
%A Koeppl, Dominik
%A Puglisi, Simon J.
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-3FF3-B
%R 10.1007/s00453-023-01125-z
%7 2023-05-06
%D 2024
%J Algorithmica
%V 86
%& 735
%P 735 - 756
%I Springer
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Grønlund, Allan
%A Künnemann, Marvin
%A Green Larsen, Kasper
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2D00-C
%R 10.4230/LIPIcs.ITCS.2024.22
%U urn:nbn:de:0030-drops-195500
%D 2024
%B 15th Innovations in Theoretical Computer Science Conference
%Z date of event: 2024-01-30 - 2024-02-02
%C Berkeley, CA, USA
%B 15th Innovations in Theoretical Computer Science Conference
%E Guruswami, Venkatesan
%P 1 - 25
%Z sequence number: 22
%I Schloss Dagstuhl
%@ 978-3-95977-309-6
%B Leibniz International Proceedings in Informatics
%N 287

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Fischer, Nick
%A van der Hoog, Ivor
%A Kipouridis, Evangelos
%A Kociumaka, Tomasz
%A Rotenberg, Eva
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Dynamic Dynamic Time Warping : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-031B-D
%R 10.1137/1.9781611977912.10
%D 2024
%8 04.01.2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 208 - 242
%I SIAM
%@ 978-1-61197-791-2

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Staals, Frank
%A Węgrzycki, Karol
%A van Wordragen, Geert
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Fine-Grained Complexity of Earth Mover’s Distance Under Translation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E5C-9
%R 10.4230/LIPIcs.SoCG.2024.25
%U urn:nbn:de:0030-drops-199706
%D 2024
%B 40th International Symposium on Computational Geometry
%Z date of event: 2024-06-11 - 2024-06-14
%C Athens, Greece
%B 40th International Symposium on Computational Geometry
%E Mulzer, Wolfgang; Phillips , Jeff M.
%P 1 - 17
%Z sequence number: 25
%I Schloss Dagstuhl
%@ 978-3-95977-316-4
%B Leibniz International Proceedings in Informatics
%N 293
%@ false

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Dürr, Anita
%A Polak, Adam
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E6E-5
%R 10.4230/LIPIcs.ESA.2024.33
%U urn:nbn:de:0030-drops-211047
%D 2024
%B 32nd Annual European Symposium on Algorithms
%Z date of event: 2024-09-02 - 2024-09-04
%C London, UK
%B 32nd Annual European Symposium on Algorithms
%E Chan, Timothy; Fischer, Johannes; Iacono, John; Herman, Grzegorz
%P 1 - 15
%Z sequence number: 33
%I Schloss Dagstuhl
%@ 978-3-95977-338-6
%B Leibniz International Proceedings in Informatics
%N 308
%@ false

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%A Fischer, Nick
%A Kociumaka, Tomasz
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Sublinear-Time Edit Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-33A4-B
%R 10.1137/1.9781611977912.117
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 3274 - 3301
%I SIAM
%@ 978-1-61197-791-2
%U https://epubs.siam.org/doi/10.1137/1.9781611977912.117

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Approximating Subset Sum Ratio faster than Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-34F6-E
%R 10.1137/1.9781611977912.50
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 1260 - 1277
%I SIAM
%@ 978-1-61197-791-2

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Ghazy, Ahmed
%A Künnemann, Marvin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Exploring the Approximability Landscape of 3SUM : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-34EA-C
%R 10.4230/LIPIcs.ESA.2024.34
%U urn:nbn:de:0030-drops-211057
%D 2024
%B 32nd Annual European Symposium on Algorithms
%Z date of event: 2024-09-02 - 2024-09-04
%C London, UK
%B 32nd Annual European Symposium on Algorithms
%E Chan, Timothy; Fischer, Johannes; Iacono, John; Herman, Grzegorz
%P 1 - 15
%Z sequence number: 34
%I Schloss Dagstuhl
%@ 978-3-95977-338-6
%B Leibniz International Proceedings in Informatics
%N 308
%@ false

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Knapsack with Small Items in Near-Quadratic Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-34EF-7
%R 10.1145/3618260.3649719
%D 2024
%B 56th Annual ACM Symposium on Theory of Computing
%Z date of event: 2024-06-24 - 2024-06-28
%C Vancouver, Canada
%B STOC '24
%E Moha, Bojan; Shinkar, Igor; O'Donnell, Ryan
%P 259 - 270
%I ACM
%@ 979-8-4007-0383-6

Endnote

%0 Journal Article
%A Caragiannis, Ioannis
%A Rathi, Nidhi
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Optimizing Over Serial Dictatorships : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-F1BA-F
%R 10.1007/s00224-024-10196-6
%7 2024-10-03
%D 2024
%8 03.10.2024
%J Theory of Computing Systems
%I Springer
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Cembrano, Javier
%A Klimm, Max
%A Knaack, Martin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Packing a Knapsack with Items Owned by Strategic Agents : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36BA-0
%D 2024
%B 20th Conference on Web and Internet Economics
%Z date of event: 2024-12-02 - 2024-12-05
%C Edinburgh, UK
%B 20th Conference on Web and Internet Economics

Endnote

%0 Conference Proceedings
%A Cembrano, Javier
%A Klimm, Max
%A Merino, Arturo
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Impartial Selection Under Combinatorial Constraints : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36BE-C
%D 2024
%B 20th Conference on Web and Internet Economics
%Z date of event: 2024-12-02 - 2024-12-05
%C Edinburgh, UK
%B 20th Conference on Web and Internet Economics

Endnote

%0 Journal Article
%A Chandran, L. Sunil
%A Hashim, Talha
%A Jacob, Dalu
%A Mathew, Rogers
%A Rajendraprasad, Deepak
%A Singh, Nitin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
%T New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1AB5-8
%R 10.1016/j.disc.2024.113894
%7 2024
%D 2024
%J Discrete Mathematics
%V 347
%N 4
%Z sequence number: 113894
%I North-Holland
%C Amsterdam
%@ false

Endnote

%0 Conference Proceedings
%A Chistikov, D.
%A Czerwiński, W.
%A Orlikowski, Ł.
%A Mazowiecki, F.
%A Sinclair-Banks, H.
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T The Tractability Border of Reachability in Simple Vector Addition Systems with States : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36DF-7
%R 10.1109/FOCS61266.2024.00086
%D 2024
%B 65th IEEE Symposium on Foundations of Computer Science
%Z date of event: 2024-10-27 - 2024-10-30
%C Chicago, IL, USA
%B 65th IEEE Symposium on Foundations of Computer Science
%P 1332 - 1354
%I IEEE
%@ 979-8-3315-1674-1

Endnote

%0 Journal Article
%A Coupette, Corinna
%A Hartung, Dirk
%A Katz, Daniel Martin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Legal Hypergraphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-888E-9
%R 10.1098/rsta.2023.0141
%2 PMC10894694
%D 2024
%J Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
%O Phil. Trans. R. Soc. A
%V 382
%N 2270
%& 1
%P 1 - 19
%Z sequence number: 20230141
%I Royal Society
%C London
%@ false

Endnote

%0 Conference Proceedings
%A Cslovjecsek, Jana
%A Pilipczuk, Michał
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E62-1
%R 10.4230/LIPIcs.ESA.2024.43
%U urn:nbn:de:0030-drops-211146
%D 2024
%B 32nd Annual European Symposium on Algorithms
%Z date of event: 2024-09-02 - 2024-09-04
%C London, UK
%B 32nd Annual European Symposium on Algorithms
%E Chan, Timothy; Fischer, Johannes; Iacono, John; Herman, Grzegorz
%P 1 - 18
%Z sequence number: 43
%I Schloss Dagstuhl
%@ 978-3-95977-338-6
%B Leibniz International Proceedings in Informatics
%N 308
%@ false

Endnote

%0 Conference Proceedings
%A Cslovjecsek, Jana
%A Pilipczuk, Michał
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Polynomial-time OPT Ɛ-Approximation Algorithm for Maximum Independent Set of Connected Subgraphs in a Planar Graph : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E74-D
%R 10.1137/1.9781611977912.23
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 625 - 638
%I SIAM
%@ 978-1-61197-791-2

Endnote

%0 Conference Proceedings
%A Duyster, Anouk
%A Kociumaka, Tomasz
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E51-4
%R 10.1007/978-3-031-72200-4_8
%D 2024
%B 31st International Symposium on String Processing and Information Retrieval
%Z date of event: 2024-09-23 - 2024-09-25
%C Puerto Vallarta, Mexico
%B String Processing and Information Retrieval
%E Lipták, Zsuzsanna; Moura, Edleno; Figueroa, Karina; Baeza-Yates, Ricardo
%P 102 - 117
%I Springer
%@ 978-3-031-72199-1
%B Lecture Notes in Computer Science
%N 14899
%U https://rdcu.be/dZM2q

Endnote

%0 Conference Proceedings
%A Eisenbrand, Friedrich
%A Rohwedder, Lars
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36D7-F
%R 10.1109/FOCS61266.2024.00100
%D 2024
%B 65th IEEE Symposium on Foundations of Computer Science
%Z date of event: 2024-10-27 - 2024-10-30
%C Chicago, IL, USA
%B 65th IEEE Symposium on Foundations of Computer Science
%P 1610 - 1620
%I IEEE
%@ 979-8-3315-1674-1

Endnote

%0 Journal Article
%A Esmer, Bariş Can
%A Kulik, Ariel
%A Marx, Dániel
%A Schepper, Philipp
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Computing Generalized Convolutions Faster Than Brute Force : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-36C4-8
%R 10.1007/s00453-023-01176-2
%7 2023
%D 2024
%J Algorithmica
%V 86
%& 334
%P 334 - 366
%I Springer-Verlag
%C New York
%@ false

Endnote

%0 Conference Proceedings
%A Fischer, Nick
%A Kaliciak, Piotr
%A Polak, Adam
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Deterministic 3SUM-Hardness : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2D9A-F
%R 10.4230/LIPIcs.ITCS.2024.49
%U urn:nbn:de:0030-drops-195772
%D 2024
%B 15th Innovations in Theoretical Computer Science Conference
%Z date of event: 2024-01-30 - 2024-02-02
%C Berkeley, CA, USA
%B 15th Innovations in Theoretical Computer Science Conference
%E Guruswami, Venkatesan
%P 1 - 24
%Z sequence number: 49
%I Schloss Dagstuhl
%@ 978-3-95977-309-6
%B Leibniz International Proceedings in Informatics
%N 287

Endnote

%0 Conference Proceedings
%A Focke, Jacob
%A Frei, Fabian
%A Li, Shaohua
%A Marx, Dániel
%A Schepper, Philipp
%A Sharma, Roohani
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Hitting Meets Packing: How Hard Can It Be? : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E65-E
%R 10.4230/LIPIcs.ESA.2024.55
%U urn:nbn:de:0030-drops-211261
%D 2024
%B 32nd Annual European Symposium on Algorithms
%Z date of event: 2024-09-02 - 2024-09-04
%C London, UK
%B 32nd Annual European Symposium on Algorithms
%E Chan, Timothy; Fischer, Johannes; Iacono, John; Herman, Grzegorz
%P 1 - 21
%Z sequence number: 55
%I Schloss Dagstuhl
%@ 978-3-95977-338-6
%B Leibniz International Proceedings in Informatics
%N 308
%@ false

Endnote

%0 Journal Article
%A Folz, Frederic
%A Mehlhorn, Kurt
%A Morigi, Giovanna
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Self-organized Transport in Noisy Dynamic Networks : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2CF2-C
%R 10.1103/PhysRevE.110.044310
%7 2024-10-21
%D 2024
%J Physical Review E
%O Phys. Rev. E
%V 110
%N 4
%Z sequence number: 044310
%I American Physical Society
%C Melville, NY
%@ false

Endnote

%0 Journal Article
%A Fried, Dvir
%A Golan, Shay
%A Kociumaka, Tomasz
%A Kopelowitz, Tsvi
%A Porat, Ely
%A Starikovskaya, Tatiana
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T An Improved Algorithm for The k-Dyck Edit Distance Problem : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2E2D-A
%R 10.1145/3627539
%7 2024-06-21
%D 2024
%J ACM Transactions on Algorithms
%V 20
%N 3
%& 1
%P 1 - 25
%Z sequence number: 26
%I ACM
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Gibney, Daniel
%A Jin, Ce
%A Kociumaka, Tomasz
%A Thankachan, Sharma V.
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-33E3-4
%R 10.1137/1.9781611977912.118
%D 2024
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2024-01-07 - 2024-01-10
%C Alexandria, VA, USA
%B Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Woodruff, David P.
%P 3302 - 3332
%I SIAM
%@ 978-1-61197-791-2
%U https://epubs.siam.org/doi/10.1137/1.9781611977912.118

Endnote

%0 Journal Article
%A Kim, Eun Jung
%A Masařík, Tomáš
%A Pilipczuk, Marcin
%A Sharma, Roohani
%A Wahlström, Magnus
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T On Weighted Graph Separation Problems and Flow-Augmentation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-7599-1
%R 10.1137/22M153118X
%7 2024
%D 2024
%J SIAM Journal on Discrete Mathematics
%& 170
%P 170 - 189
%I SIAM
%C Philadelphia, Pa.
%@ false

Endnote

%0 Conference Proceedings
%A Kisfaludi-Bak, Sándor
%A Masaříková, Jana
%A van Leeuwen, Erik Jan
%A Walczak, Bartosz
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Separator Theorem and Algorithms for Planar Hyperbolic Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E5F-6
%R 10.4230/LIPIcs.SoCG.2024.67
%U urn:nbn:de:0030-drops-200126
%D 2024
%B 40th International Symposium on Computational Geometry
%Z date of event: 2024-06-11 - 2024-06-14
%C Athens, Greece
%B 40th International Symposium on Computational Geometry
%E Mulzer, Wolfgang; Phillips , Jeff M.
%P 1 - 17
%Z sequence number: 67
%I Schloss Dagstuhl
%@ 978-3-95977-316-4
%B Leibniz International Proceedings in Informatics
%N 293
%@ false

Endnote

%0 Journal Article
%A Kociumaka, Tomasz
%A Radoszewski, Jakub
%A Rytter, Wojciech
%A Waleń, Tomasz
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Internal Pattern Matching Queries in a Text and Applications : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-3350-A
%R 10.1137/23M156761
%7 2024
%D 2024
%J SIAM Journal on Computing
%V 53
%N 5
%& 1524
%P 1524 - 1577
%I SIAM
%C Philadelphia, PA
%@ false

Endnote

%0 Conference Proceedings
%A Kociumaka, Tomasz
%A Nogler, Jakob
%A Wellnitz, Philip
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T On the Communication Complexity of Approximate Pattern Matching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-33F0-5
%R 10.1145/3618260.3649604
%D 2024
%B 56th Annual ACM Symposium on Theory of Computing
%Z date of event: 2024-06-24 - 2024-06-28
%C Vancouver, Canada
%B STOC '24
%E Moha, Bojan; Shinkar, Igor; O'Donnell, Ryan
%P 1758 - 1768
%I ACM
%@ 979-8-4007-0383-6

Endnote

%0 Journal Article
%A Kociumaka, Tomasz
%A Navarro, Gonzalo
%A Olivares, Francisco
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Near-Optimal Search Time in δ-Optimal Space, and Vice Versa : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-0D73-3
%R 10.1007/s00453-023-01186-0
%7 2023-11-06
%D 2024
%J Algorithmica
%V 86
%& 1031
%P 1031 - 1056
%I Springer
%C New York, NY
%@ false
%U https://rdcu.be/d0Kn4

Endnote

%0 Conference Proceedings
%A Kowalik, Lukasz
%A Lassota, Alexandra
%A Majewski, Konrad
%A Pilipczuk, Michał
%A Sokołowski, Marek
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2E3A-B
%R 10.1137/1.9781611977936.25
%D 2024
%B Seventh SIAM Symposium on Simplicity in Algorithms
%Z date of event: 2024-01-08 - 2024-01-10
%C Alexandria, VA, USA
%B Symposium on Simplicity in Algorithms
%E Parter, Merav; Pettie, Seth
%P 279 - 285
%I SIAM
%@ 978-1-61197-793-6

Endnote

%0 Conference Proceedings
%A Merino, Arturo
%A Namrata, 
%A Williams, Aaron
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T On the Hardness of Gray Code Problems for Combinatorial Objects : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-4EEB-2
%R 10.1007/978-981-97-0566-5_9
%D 2024
%B 18th International Conference and Workshops on Algorithms and
Computation
%Z date of event: 2024-03-18 - 2024-03-20
%C Kanazawa, Japan
%B WALCOM: Algorithms and Computation
%E Uehara, Ryuhei; Yamanaka, Katsuhisa; Yen, Hsu-Chun
%P 328 - 339
%I Springer
%@ 978-981-97-0565-8
%B Lecture Notes in Computer Science
%N 14549
%U https://rdcu.be/dIy4F

Endnote

%0 Journal Article
%A Merino, Arturo
%A Wiese, Andreas
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T On the Two-Dimensional Knapsack Problem for Convex Polygons : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-5226-A
%R 10.1145/3644390
%7 2024
%D 2024
%J ACM Transactions on Algorithms
%V 20
%N 2
%& 1
%P 1 - 38
%Z sequence number: 16
%I ACM
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Randolph, Tim
%A Węgrzycki, Karol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E6B-8
%R 10.4230/LIPIcs.ESA.2024.96
%U urn:nbn:de:0030-drops-211672
%D 2024
%B 32nd Annual European Symposium on Algorithms
%Z date of event: 2024-09-02 - 2024-09-04
%C London, UK
%B 32nd Annual European Symposium on Algorithms
%E Chan, Timothy; Fischer, Johannes; Iacono, John; Herman, Grzegorz
%P 1 - 19
%Z sequence number: 96
%I Schloss Dagstuhl
%@ 978-3-95977-338-6
%B Leibniz International Proceedings in Informatics
%N 308
%@ false

Endnote

%0 Journal Article
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T EFX Exists for Three Agents : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-6961-F
%R 10.1145/3616009
%D 2024
%J Journal of the ACM
%V 71
%N 1
%& 1
%P 1 - 27
%Z sequence number: 4
%I ACM
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Simon, Hans Ulrich
%A Telle, Jan Arne
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T MAP- and MLE-Based Teaching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-4ED2-D
%U http://jmlr.org/papers/v25/23-1086.html
%7 2024
%D 2024
%J Journal of Machine Learning Research
%O JMLR
%V 25
%& 1
%P 1 - 34
%Z sequence number: 96
%I Microtome Publishing
%C Brookline, MA
%@ false

Endnote

%0 Conference Proceedings
%A Abbasi, Fateme
%A Banerjee, Sandip
%A Byrka, Jaroslaw
%A Chalermsook, Parinya
%A Gadekar, Ameet
%A Khodamoradi, Kamyar
%A Marx, Dániel
%A Sharma, Roohani
%A Spoerhase, Joachim
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Parameterized Approximation Schemes for Clustering with General Norm Objectives : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-7547-F
%R 10.1109/FOCS57990.2023.00085
%D 2023
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%Z date of event: 2023-11-06 - 2023-11-09
%C  Santa Cruz, CA, USA 
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%P 1377 - 1399
%I IEEE
%@ 979-8-3503-1894-4

Endnote

%0 Conference Proceedings
%A Abboud, Amir
%A Bringmann, Karl
%A Fischer, Nick
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via 
Additive Combinatorics : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-8C13-1
%R 10.1145/3564246.3585240
%D 2023
%B 55th Annual ACM Symposium on Theory of Computing
%Z date of event: 2023-06-20 - 2023-06-23
%C Orlando, FL, USA
%B STOC '23
%E Saha, Barna; Servedio, Rocco A.
%P 391 - 404
%I ACM
%@ 978-1-4503-9913-5

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Garg, Jugal
%A Sharma, Eklavya
%A Taki, Setareh
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Simplification and Improvement of MMS Approximation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1420-6
%R 10.24963/ijcai.2023/276 
%D 2023
%B Thirty-Second International Joint Conference on Artificial Intelligence 
%Z date of event: 2023-08-19 - 2023-08-25
%C Macao
%B Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence 
%E Elkind, Edith
%P 2485 - 2493
%I IJCAI
%@ 978-1-956792-03-4 
%U https://www.ijcai.org/proceedings/2023/276

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Alon, Noga
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1437-D
%R 10.1145/3580507.3597799
%D 2023
%B 24th ACM Conference on Economics and Computation
%Z date of event: 2023-07-09 - 2023-07-12
%C London, UK
%B EC 2023
%P 61 - 61
%I ACM
%@ 979-8-4007-0104-7

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Fair and Efficient Allocation of Indivisible Chores with Surplus : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1425-1
%R 10.24963/ijcai.2023/277 
%D 2023
%B Thirty-Second International Joint Conference on Artificial Intelligence 
%Z date of event: 2023-08-19 - 2023-08-25
%C Macao
%B Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence 
%E Elkind, Edith
%P 2494 - 2502
%I IJCAI
%@ 978-1-956792-03-4 
%U https://www.ijcai.org/proceedings/2023/277

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Mehlhorn, Kurt
%A Seddighin, Masoud
%A Shahkarami, Golnoosh
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1435-F
%D 2023
%B Thirty-seventh Annual Conference on Neural Information Processing Systems
%Z date of event: 2023-12-10 - 2023-12-16
%C New Orleans, LA, USA
%B Advances in Neural Information Processing Systems 36
%E Oh, A.; Neumann, T.; Globerson, A.; Saenko, K.; Hartdt, M.; Levine, S.
%P 58821 - 58832
%I Curran Associates, Inc
%U https://proceedings.neurips.cc/paper_files/paper/2023/file/b7ed46bd87cd51d4c031b96d9b1a8eb6-Paper-Conference.pdf

Endnote

%0 Journal Article
%A Antoniadis, Antonios
%A Coester, Christian
%A Elias, Marek
%A Polak, Adam
%A Simon, Bertrand
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Online Metric Algorithms with Untrusted Predictions : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-2D93-B
%R 10.1145/3582689
%7 2023
%D 2023
%J ACM Transactions on Algorithms
%V 19
%N 2
%& 1
%P 1 - 34
%Z sequence number: 19
%I ACM
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Antoniadis, Antonios
%A Gouleakis, Themis
%A Kleer, Pieter
%A Kolev, Pavel
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Secretary and Online Matching Problems with Machine Learned Advice : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-9392-7
%R 10.1016/j.disopt.2023.100778
%7 2023
%D 2023
%J Discrete Optimization
%V 48
%N 2
%Z sequence number: 100778
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Conference Proceedings
%A Ardra, P. S.
%A Krithika, R.
%A Saurabh, Saket
%A Sharma, Roohani
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Balanced Substructures in Bicolored Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1D8F-4
%R 10.1007/978-3-031-23101-8_12
%D 2023
%B 48th International Conference on Current Trends in Theory and Practice of Computer Science
%Z date of event: 2023-01-15 - 2023-01-18
%C Nový Smokovec, Slovakia
%B SOFSEM 2023: Theory and Practice of Computer Science
%E Gąsieniec, Leszek
%P 177 - 191
%I Springer
%@ 978-3-031-23100-1
%B Lecture Notes in Computer Science
%N 13878
%U https://rdcu.be/c2Gfk

Endnote

%0 Report
%A Ashvinkumar, Vikrant
%A Bernstein, Aaron
%A Cao, Nairen
%A Grunau, Christoph
%A Haeupler, Bernhard
%A Jiang, Yonggang
%A Nanongkai, Danupon
%A Su, Hsin Hao
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Parallel and Distributed Exact Single-Source Shortest Paths with
  Negative Edge Weights : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-3E29-0
%U https://arxiv.org/abs/2303.00811
%R 10.48550/arXiv.2303.00811
%D 2023
%X   This paper presents parallel and distributed algorithms for single-source<br>shortest paths when edges can have negative weights (negative-weight SSSP). We<br>show a framework that reduces negative-weight SSSP in either setting to<br>$n^{o(1)}$ calls to any SSSP algorithm that works with a virtual source. More<br>specifically, for a graph with $m$ edges, $n$ vertices, undirected hop-diameter<br>$D$, and polynomially bounded integer edge weights, we show randomized<br>algorithms for negative-weight SSSP with (i) $W_{SSSP}(m,n)n^{o(1)}$ work and<br>$S_{SSSP}(m,n)n^{o(1)}$ span, given access to an SSSP algorithm with<br>$W_{SSSP}(m,n)$ work and $S_{SSSP}(m,n)$ span in the parallel model, (ii)<br>$T_{SSSP}(n,D)n^{o(1)}$, given access to an SSSP algorithm that takes<br>$T_{SSSP}(n,D)$ rounds in $\mathsf{CONGEST}$. This work builds off the recent<br>result of [Bernstein, Nanongkai, Wulff-Nilsen, FOCS'22], which gives a<br>near-linear time algorithm for negative-weight SSSP in the sequential setting.<br>  Using current state-of-the-art SSSP algorithms yields randomized algorithms<br>for negative-weight SSSP with (i) $m^{1+o(1)}$ work and $n^{1/2+o(1)}$ span in<br>the parallel model, (ii) $(n^{2/5}D^{2/5} + \sqrt{n} + D)n^{o(1)}$ rounds in<br>$\mathsf{CONGEST}$.<br>  Our main technical contribution is an efficient reduction for computing a<br>low-diameter decomposition (LDD) of directed graphs to computations of SSSP<br>with a virtual source. Efficiently computing an LDD has heretofore only been<br>known for undirected graphs in both the parallel and distributed models. The<br>LDD is a crucial step of the algorithm in [Bernstein, Nanongkai, Wulff-Nilsen,<br>FOCS'22], and we think that its applications to other problems in parallel and<br>distributed models are far from being exhausted.<br>
%K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Bathie, Gabriel
%A Kociumaka, Tomasz
%A Starikovskaya, Tatiana
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-34C7-3
%R 10.4230/LIPIcs.ISAAC.2023.10
%U urn:nbn:de:0030-drops-193124
%D 2023
%B 34th International Symposium on Algorithms and Computation
%Z date of event: 2023-12-03 - 2023-12-06
%C Kyoto, Japan
%B 34th International Symposium on Algorithms and Computation
%E Iwata, Satoru; Kakimura, Naonori
%P 1 - 17
%Z sequence number: 10
%I Schloss Dagstuhl
%@ 978-3-95977-289-1
%B Leibniz International Proceedings in Informatics
%N 283

Endnote

%0 Conference Proceedings
%A Beck, Moritz
%A Spoerhase, Joachim
%A Storandt, Sabine
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Mind the Gap: Edge Facility Location Problems in Theory and Practice : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-992D-6
%R 10.1007/978-3-031-25211-2_25
%D 2023
%B 9th International Conference on Algorithms and Discrete Applied Mathematics
%Z date of event: 2023-02-09 - 2023-02-11
%C Gandhinagar, India
%B Algorithms and Discrete Applied Mathematics
%E Bagchi, Amitabha; Muthu, Rahul
%P 321 - 334
%I Springer
%@ 978-3-031-25210-5
%B Lecture Notes in Computer Science
%N 13947
%U https://rdcu.be/c5J8c

Endnote

%0 Report
%A Bernstein, Aaron
%A Nanongkai, Danupon
%A Wulff-Nilsen, Christian
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Negative-Weight Single-Source Shortest Paths in Near-linear Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-6D7F-B
%U https://arxiv.org/abs/2203.03456
%D 2023
%X   We present a randomized algorithm that computes single-source shortest paths<br>(SSSP) in $O(m\log^8(n)\log W)$ time when edge weights are integral and can be<br>negative. This essentially resolves the classic negative-weight SSSP problem.<br>The previous bounds are $\tilde O((m+n^{1.5})\log W)$ [BLNPSSSW FOCS'20] and<br>$m^{4/3+o(1)}\log W$ [AMV FOCS'20]. Near-linear time algorithms were known<br>previously only for the special case of planar directed graphs [Fakcharoenphol<br>and Rao FOCS'01].<br>  In contrast to all recent developments that rely on sophisticated continuous<br>optimization methods and dynamic algorithms, our algorithm is simple: it<br>requires only a simple graph decomposition and elementary combinatorial tools.<br>In fact, ours is the first combinatorial algorithm for negative-weight SSSP to<br>break through the classic $\tilde O(m\sqrt{n}\log W)$ bound from over three<br>decades ago [Gabow and Tarjan SICOMP'89].<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Journal Article
%A Bhattacharya, Sayan
%A Henzinger, Monika
%A Nanongkai, Danupon
%A Wu, Xiaowei
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-36CD-F
%R 10.1137/21M1428649
%7 2023
%D 2023
%J SIAM Journal on Computing
%V 52
%N 5
%& 1132
%P 1132 - 1192
%I SIAM.
%C Philadelphia
%@ false

Endnote

%0 Conference Proceedings
%A Bhattacharya, Sayan
%A Kiss, Peter
%A Saranurak, Thatchaphol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-9BA1-F
%R 10.1145/3564246.3585252
%D 2023
%B 55th Annual ACM Symposium on Theory of Computing
%Z date of event: 2023-06-20 - 2023-06-23
%C Orlando, FL, USA
%B STOC '23
%P 254 - 266
%I ACM
%@ 978-1-4503-9913-5

Endnote

%0 Report
%A Bhattacharya, Sayan
%A Kiss, Peter
%A Saranurak, Thatchaphol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Dynamic (1.5+Epsilon)-Approximate Matching Size in Truly Sublinear
  Update Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-9BA8-8
%U https://arxiv.org/abs/2302.05030
%D 2023
%X   We show a fully dynamic algorithm for maintaining $(1+\epsilon)$-approximate<br>\emph{size} of maximum matching of the graph with $n$ vertices and $m$ edges<br>using $m^{0.5-\Omega_{\epsilon}(1)}$ update time. This is the first polynomial<br>improvement over the long-standing $O(n)$ update time, which can be trivially<br>obtained by periodic recomputation. Thus, we resolve the value version of a<br>major open question of the dynamic graph algorithms literature (see, e.g.,<br>[Gupta and Peng FOCS'13], [Bernstein and Stein SODA'16],[Behnezhad and Khanna<br>SODA'22]).<br>  Our key technical component is the first sublinear algorithm for $(1,\epsilon<br>n)$-approximate maximum matching with sublinear running time on dense graphs.<br>All previous algorithms suffered a multiplicative approximation factor of at<br>least $1.499$ or assumed that the graph has a very small maximum degree.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Bhattacharya, Sayan
%A Kiss, Peter
%A Saranurak, Thatchaphol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-4333-F
%R 10.1137/1.9781611977554.ch1
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 1 - 47
%I SIAM
%@ 978-1-61197-755-4

Endnote

%0 Conference Proceedings
%A Bhattacharya, Sayan
%A Kiss, Peter
%A Saranurak, Thatchaphol
%A Wajc, David
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-4336-C
%R 10.1137/1.9781611977554.ch5
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 100 - 128
%I SIAM
%@ 978-1-61197-755-4

Endnote

%0 Conference Proceedings
%A Blikstad, Joakim
%A Tu, Ta-Wei
%A Nanongkai, Danupon
%A Mukhopadhyay, Sagnik
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Fast Algorithms via Dynamic-Oracle Matroids : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-8C18-C
%R 10.1145/3564246.3585219
%D 2023
%B 55th Annual ACM Symposium on Theory of Computing
%Z date of event: 2023-06-20 - 2023-06-23
%C Orlando, FL, USA
%B STOC '23
%E Saha, Barna; Servedio, Rocco A.
%P 1229 - 1249
%I ACM
%@ 978-1-4503-9913-5

Endnote

%0 Report
%A Blikstad, Joakim
%A Kiss, Peter
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Incremental (1 - ε)-approximate dynamic matching in O(poly(1/ε)) update time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-A006-8
%U https://arxiv.org/abs/2302.08432
%D 2023
%X   In the dynamic approximate maximum bipartite matching problem we are given<br>bipartite graph $G$ undergoing updates and our goal is to maintain a matching<br>of $G$ which is large compared the maximum matching size $\mu(G)$. We define a<br>dynamic matching algorithm to be $\alpha$ (respectively $(\alpha,<br>\beta)$)-approximate if it maintains matching $M$ such that at all times $|M |<br>\geq \mu(G) \cdot \alpha$ (respectively $|M| \geq \mu(G) \cdot \alpha -<br>\beta$).<br>  We present the first deterministic $(1-\epsilon )$-approximate dynamic<br>matching algorithm with $O(poly(\epsilon ^{-1}))$ amortized update time for<br>graphs undergoing edge insertions. Previous solutions either required<br>super-constant [Gupta FSTTCS'14, Bhattacharya-Kiss-Saranurak SODA'23] or<br>exponential in $1/\epsilon $<br>[Grandoni-Leonardi-Sankowski-Schwiegelshohn-Solomon SODA'19] update time. Our<br>implementation is arguably simpler than the mentioned algorithms and its<br>description is self contained. Moreover, we show that if we allow for additive<br>$(1, \epsilon \cdot n)$-approximation our algorithm seamlessly extends to also<br>handle vertex deletions, on top of edge insertions. This makes our algorithm<br>one of the few small update time algorithms for $(1-\epsilon )$-approximate<br>dynamic matching allowing for updates both increasing and decreasing the<br>maximum matching size of $G$ in a fully dynamic manner.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Journal Article
%A Briański, Marcin
%A Joret, Gwenaël
%A Majewski, Konrad
%A Micek, Piotr
%A Seweryn, Michał T.
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Treedepth Vs Circumference : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-8E4E-E
%R 10.1007/s00493-023-00028-5
%7 2023
%D 2023
%J Combinatorica
%V 43
%& 659
%P 659 - 664
%I Springer
%C Heidelberg
%@ false

Endnote

%0 Journal Article
%A Briánski, Marcin
%A Joret, Gwenal
%A Majewski, Konrad
%A Micek, Piotr
%A Seweryn, Michał T.
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Treedepth Versus Circumference : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-6343-8
%R 10.1007/s00493-023-00028-5
%7 2023
%D 2023
%J Combinatorica
%I Springer
%C Heidelberg
%@ false
%U https://rdcu.be/dfJGd

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%A Fischer, Nick
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-7585-8
%R 10.1109/FOCS57990.2023.00038
%D 2023
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%Z date of event: 2023-11-06 - 2023-11-09
%C  Santa Cruz, CA, USA 
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%P 515 - 538
%I IEEE
%@ 979-8-3503-1894-4

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-3502-0
%R 10.4230/LIPIcs.ESA.2023.24
%U urn:nbn:de:0030-drops-186776
%D 2023
%B 31st Annual European Symposium on Algorithms
%Z date of event: 2023-09-04 - 2023-09-06
%C Amsterdam, The Netherlands 
%B 31st Annual European Symposium on Algorithms
%E Gørtz, Inge Li; Farach-Colton, Martin; Puglisi, Simon J.; Herman, Grzegorz
%P 1 - 16
%Z sequence number: 24
%I Schloss Dagstuhl
%B Leibniz International Proceedings in Informatics
%N 274
%@ false

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Kapralov, Michael
%A Makarov, Mikhail
%A Nakos, Vasileios
%A Yagudin, Amir
%A Zandieh, Amir
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-26DB-3
%R 10.1137/1.9781611977554.ch177
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 4768 - 4845
%I SIAM
%@ 978-1-61197-755-4

Endnote

%0 Journal Article
%A Bringmann, Karl
%A Cohen-Addad, Vincent
%A Das, Debarati
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T A Linear-Time n0.4-Approximation for Longest Common Subsequence : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-A7EC-E
%R 10.1145/3568398
%7 2023
%D 2023
%J ACM Transactions on Algorithms
%V 19
%N 1
%& 1
%P 1 - 24
%Z sequence number: 9
%I ACM
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Cassis, Alejandro
%A Kociumaka, Tomasz
%A Wellnitz, Philip
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Optimal Algorithms for Bounded Weighted Edit Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-75A2-7
%R 10.1109/FOCS57990.2023.00135
%D 2023
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%Z date of event: 2023-11-06 - 2023-11-09
%C  Santa Cruz, CA, USA 
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%P 2177 - 2187
%I IEEE
%@ 979-8-3503-1894-4

Endnote

%0 Conference Proceedings
%A Coupette, Corinna
%A Neumann, Stefan
%A Gionis, Aristides
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Reducing Exposure to Harmful Content via Graph Rewiring : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-7E86-E
%R 10.1145/3580305.3599489
%D 2023
%B 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
%Z date of event: 2023-08-06 - 2023-08-10
%C Long Beach, CA,  USA
%B KDD '23
%E Singh, Ambuj; Sun, Yizhou
%P 323 - 334
%I ACM
%@ 979-8-4007-0103-0

Endnote

%0 Journal Article
%A Coupette, Corinna
%A Vreeken, Jilles
%A Rieck, Bastian
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T All the world's a (hyper)graph: A data drama : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-0D14-E
%R 10.1093/llc/fqad071
%7 2023
%D 2023
%J Digital Scholarship in the Humanities 
%O Journal of the Alliance of Digital Humanities Organizations DSH
%Z sequence number: fqad071
%I Oxford University Press
%C Oxford
%@ false

Endnote

%0 Thesis
%A Coupette, Corinna
%Y Lenzen, Christoph
%A referee: Mehlhorn, Kurt
%A referee: Rieck, Sebastian
%A referee: Borgwardt, Karsten
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Beyond Flatland : Exploring Graphs in Many Dimensions : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-1099-3
%U urn:nbn:de:bsz:291--ds-408409
%R 10.22028/D291-40840
%F OTHER: hdl:20.500.11880/36729
%I Universität des Saarlandes
%C Saarbrücken
%D 2023
%P xxi, 237 p.
%V phd
%9 phd
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/36729

Endnote

%0 Conference Proceedings
%A Coupette, Corinna
%A Dalleiger, Sebastian
%A Rieck, Bastian
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-10CD-B
%D 2023
%B Eleventh International Conference on Learning Representations
%Z date of event: 2023-05-01 - 2023-05-05
%C Kigali, Rwanda
%X Bridging geometry and topology, curvature is a powerful and expressive invariant. While the utility of curvature has been theoretically and empirically confirmed in the context of manifolds and graphs, its generalization to the emerging domain of hypergraphs has remained largely unexplored. On graphs, Ollivier-Ricci curvature measures differences between random walks via Wasserstein distances, thus grounding a geometric concept in ideas from probability and optimal transport. We develop ORCHID, a flexible framework generalizing Ollivier-Ricci curvature to hypergraphs, and prove that the resulting curvatures have favorable theoretical properties. Through extensive experiments on synthetic and real-world hypergraphs from different domains, we demonstrate that ORCHID curvatures are both scalable and useful to perform a variety of hypergraph tasks in practice.
%K Computer Science, Learning, cs.LG,cs.SI,Statistics, Machine Learning, stat.ML
%B Eleventh International Conference on Learning Representations
%I OpenReview.net
%U https://openreview.net/forum?id=sPCKNl5qDps

Endnote

%0 Conference Proceedings
%A Das, Debarati
%A Gilbert, Jacob
%A Hajiaghayi, MohammadTaghi
%A Kociumaka, Tomasz
%A Saha, Barna
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Weighted Edit Distance Computation: Strings, Trees, and Dyck : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-8B20-3
%R 10.1145/3564246.3585178
%D 2023
%B 55th Annual ACM Symposium on Theory of Computing
%Z date of event: 2023-06-20 - 2023-06-23
%C Orlando, FL, USA
%B STOC '23
%P 377 - 390
%I ACM
%@ 978-1-4503-9913-5

Endnote

%0 Report
%A Döring, Simon
%A Marx, Dániel
%A Wellnitz, Philip
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Counting Small Induced Subgraphs with Edge-monotone Properties : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000F-1442-0
%U https://arxiv.org/abs/2311.08988
%D 2023
%X   We study the parameterized complexity of #IndSub($\Phi$), where given a graph<br>$G$ and an integer $k$, the task is to count the number of induced subgraphs on<br>$k$ vertices that satisfy the graph property $\Phi$. Focke and Roth [STOC 2022]<br>completely characterized the complexity for each $\Phi$ that is a hereditary<br>property (that is, closed under vertex deletions): #IndSub($\Phi$) is<br>#W[1]-hard except in the degenerate cases when every graph satisfies $\Phi$ or<br>only finitely many graphs satisfy $\Phi$. We complement this result with a<br>classification for each $\Phi$ that is edge monotone (that is, closed under<br>edge deletions): #IndSub($\Phi$) is #W[1]-hard except in the degenerate case<br>when there are only finitely many integers $k$ such that $\Phi$ is nontrivial<br>on $k$-vertex graphs. Our result generalizes earlier results for specific<br>properties $\Phi$ that are related to the connectivity or density of the graph.<br>  Further, we extend the #W[1]-hardness result by a lower bound which shows<br>that #IndSub($\Phi$) cannot be solved in time $f(k) \cdot |V(G)|^{o(\sqrt{\log<br>k/\log\log k})}$ for any function $f$, unless the Exponential-Time Hypothesis<br>(ETH) fails. For many natural properties, we obtain even a tight bound $f(k)<br>\cdot |V(G)|^{o(k)}$; for example, this is the case for every property $\Phi$<br>that is nontrivial on $k$-vertex graphs for each $k$ greater than some $k_0$.<br>
%K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Dross, François
%A Fleszar, Krzysztof
%A Węgrzycki, Karol
%A Zych-Pawlewicz, Anna
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1F6C-A
%R 10.1137/1.9781611977554.ch52
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 1433 - 1463
%I SIAM
%@ 978-1-61197-755-4

Endnote

%0 Conference Proceedings
%A Egidy, Fabian
%A Glaßer, Christian
%A Herold, Martin
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-3509-9
%R 10.4230/LIPIcs.MFCS.2023.44
%U urn:nbn:de:0030-drops-185784
%D 2023
%B 48th International Symposium on Mathematical Foundations of Computer Science 
%Z date of event: 2023-08-28 - 2023-09-01
%C Bordeaux, France
%B 48th International Symposium on Mathematical Foundations of Computer Science 
%E Leroux, Jérôme; Lombardy, Sylvain; Peleg, David
%P 1 - 15
%Z sequence number: 44
%I Schloss Dagstuhl
%@ 978-3-95977-292-1
%B Leibniz International Proceedings in Informatics
%N 272

Endnote

%0 Journal Article
%A Fallat, Shaun
%A Kirkpatrick, David
%A Simon, Hans U.
%A Soltani, Abolghasem
%A Zilles, Sandra
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T On Batch Teaching Without Collusion : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-7CCF-1
%U http://jmlr.org/papers/v24/22-0330.html
%7 2023
%D 2023
%J Journal of Machine Learning Research
%V 24
%& 1
%P 1 - 33
%I Microtome Publishing
%C Brookline, MA
%@ false

Endnote

%0 Thesis
%A Fischer, Nick
%Y Nanongkai, D.
%A referee: Bringmann, Karl
%A referee: Krautgamer, Robert
%A referee: Chan, Timothy
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Algorithms for Sparse Convolution and Sublinear Edit Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-EFD4-7
%R 10.22028/D291-40531
%U urn:nbn:de:bsz:291--ds-405314
%F OTHER: hdl:20.500.11880/36623
%I Universität des Saarlandes 
%C Saarbrücken
%D 2023
%P 183 p.
%V phd
%9 phd
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/36623

Endnote

%0 Conference Proceedings
%A Focke, Jacob
%A Marx, Dániel
%A Inerney, Fionn Mc
%A Neuen, Daniel
%A Sankar, Govind S.
%A Schepper, Philipp
%A Wellnitz, Philip
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1EA4-A
%R 10.1137/1.9781611977554.ch140
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 3664 - 3683
%I SIAM
%@ 978-1-61197-755-4

Endnote

%0 Journal Article
%A Folz, Frederic
%A Mehlhorn, Kurt
%A Morigi, Giovanna
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Noise-Induced Network Topologies : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-2CE4-C
%R 10.1103/PhysRevLett.130.267401
%7 2023-06-30
%D 2023
%J Physical Review Letters
%O Phys. Rev. Lett.
%V 130
%N 26
%Z sequence number: 267401
%I American Physical Society
%C Woodbury, N.Y.
%@ false

Endnote

%0 Report
%A Fu, Xinyu
%A Jiang, Yonggang
%A Yin, Yitong
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Perfect Simulation of Las Vegas Algorithms via Local Computation : 
%G enq
%U http://hdl.handle.net/21.11116/0000-000F-147A-2
%U https://arxiv.org/abs/2311.11679
%D 2023
%X   The notion of Las Vegas algorithm was introduced by Babai (1979) and may be<br>defined in two ways:<br>  * In Babai's original definition, a randomized algorithm is called Las Vegas<br>if it has finitely bounded running time and certifiable random failure.<br>  * Alternatively, in a widely accepted definition today, Las Vegas algorithms<br>mean the zero-error randomized algorithms with random running time.<br>  The equivalence between the two definitions is straightforward. In<br>particular, by repeatedly running the algorithm until no failure encountered,<br>one can simulate the correct output of a successful running.<br>  We show that this can also be achieved for distributed local computation.<br>Specifically, we show that in the LOCAL model, any Las Vegas algorithm that<br>terminates in finite time with locally certifiable failures, can be converted<br>to a zero-error Las Vegas algorithm, at a polylogarithmic cost in the time<br>complexity, such that the resulting algorithm perfectly simulates the output of<br>the original algorithm on the same instance conditioned on that the algorithm<br>successfully returns without failure.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Journal Article
%A Galby, Esther
%A Marx, Dániel
%A Schepper, Philipp
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Domination and Cut Problems on Chordal Graphs with Bounded Leafage : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-596A-8
%R 10.1007/s00453-023-01196-y
%7 2023
%D 2023
%J Algorithmica
%I Springer
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Galby, Esther
%A Marx, Dániel
%A Schepper, Philipp
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Parameterized Complexity of Weighted Multicut in Trees : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-E9BE-7
%R 10.1016/j.tcs.2023.114174
%7 2023
%D 2023
%J Theoretical Computer Science
%V 978
%Z sequence number: 114174
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Journal Article
%A Galby, Esther
%A Khazaliya, Liana
%A Mc Inerney, Fionn
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-0D2F-1
%R 10.1137/22M1510911
%7 2023
%D 2023
%J SIAM Journal on Discrete Mathematics
%V 37
%N 4
%& 2241
%P 2241 - 2264
%I SIAM
%C Philadelphia, Pa.
%@ false

Endnote

%0 Report
%A Gao, Yuan
%A Kyng, Rasmus
%A Spielman, Daniel A.
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Robust and Practical Solution of Laplacian Equations by Approximate
  Elimination : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-B1C8-A
%U https://arxiv.org/abs/2303.00709
%D 2023
%X   We introduce a new algorithm and software for solving linear equations in<br>symmetric diagonally dominant matrices with non-positive off-diagonal entries<br>(SDDM matrices), including Laplacian matrices. We use pre-conditioned conjugate<br>gradient (PCG) to solve the system of linear equations. Our preconditioner is a<br>variant of the Approximate Cholesky factorization of Kyng and Sachdeva (FOCS<br>2016). Our factorization approach is simple: we eliminate matrix rows/columns<br>one at a time and update the remaining matrix using sampling to approximate the<br>outcome of complete Cholesky factorization. Unlike earlier approaches, our<br>sampling always maintains a connectivity in the remaining non-zero structure.<br>Our algorithm comes with a tuning parameter that upper bounds the number of<br>samples made per original entry. We implement our algorithm in Julia, providing<br>two versions, AC and AC2, that respectively use 1 and 2 samples per original<br>entry. We compare their single-threaded performance to that of current<br>state-of-the-art solvers Combinatorial Multigrid (CMG),<br>BoomerAMG-preconditioned Krylov solvers from HyPre and PETSc, Lean Algebraic<br>Multigrid (LAMG), and MATLAB's with Incomplete Cholesky Factorization (ICC).<br>Our evaluation uses a broad class of problems, including all large SDDM<br>matrices from the SuiteSparse collection and diverse programmatically generated<br>instances. Our experiments suggest that our algorithm attains a level of<br>robustness and reliability not seen before in SDDM solvers, while retaining<br>good performance across all instances. Our code and data are public, and we<br>provide a tutorial on how to replicate our tests. We hope that others will<br>adopt this suite of tests as a benchmark, which we refer to as SDDM2023. Our<br>solver code is available at: https://github.com/danspielman/Laplacians.jl/ Our<br>benchmarking data and tutorial are available at:<br>https://rjkyng.github.io/SDDM2023/<br>
%K Mathematics, Numerical Analysis, math.NA,Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Mathematical Software, cs.MS,Computer Science, Numerical Analysis, cs.NA

Endnote

%0 Journal Article
%A Garg, Jugal
%A Hoefer, Martin
%A Mehlhorn, Kurt
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Satiation in Fisher Markets and Approximation of Nash Social Welfare : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-944A-9
%R 10.1287/moor.2019.0129
%7 2023
%D 2023
%J Mathematics of Operations Research
%I INFORMS
%@ false

Endnote

%0 Journal Article
%A Gawrychowski, Paweł
%A Kociumaka, Tomasz
%A Rytter, Wojciech
%A Waleń, Tomasz
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Tight Bound for the Number of Distinct Palindromes in a Tree : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-1B73-4
%R 10.37236/10842
%7 2023
%D 2023
%J The Electronic Journal of Combinatorics
%V 30
%N 2
%Z sequence number: P2.10
%I N.J. Calkin and H.S. Wilf
%C Atlanta, Ga.
%@ false

Endnote

%0 Conference Proceedings
%A Gionis, Aristides
%A Khodamoradi, Kamyar
%A Ordozgoiti, Bruno
%A Riegel, Benedikt
%A Spoerhase, Joachim
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Constant-Factor Approximation Algorithm for Reconciliation k-Median : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-739D-2
%U https://proceedings.mlr.press/v206/spoerhase23a/spoerhase23a.pdf
%D 2023
%B 26th International Conference on Artificial Intelligence and Statistics
%Z date of event: 2023-04-25 - 2023-04-27
%C Valencia, Spain
%B Proceedings of the 26th International Conference on Artificial Intelligence and Statistics
%E Ruiz, Francisco; Dy, Jennifer; van de Meent, Jan-Willem
%P 1719 - 1746
%I PMLR
%B Proceedings of the Machine Learning Research
%N 206

Endnote

%0 Conference Proceedings
%A Goldenberg, Elazar
%A Kociumaka, Tomasz
%A Krauthgamer, Robert
%A Saha, Barna
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T An Algorithmic Bridge Between Hamming and Levenshtein Distances : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1588-3
%R 10.4230/LIPIcs.ITCS.2023.58
%U urn:nbn:de:0030-drops-175615
%D 2023
%B 14th Innovations in Theoretical Computer Science Conference
%Z date of event: 2023-01-10 - 2023-01-13
%C Cambridge, MA, USA
%B 14th Innovations in Theoretical Computer Science Conference
%E Tauman Kalai, Yael
%P 1 - 23
%Z sequence number: 58
%I Schloss Dagstuhl
%@ 978-3-95977-263-1
%B Leibniz International Proceedings in Informatics
%U https://drops.dagstuhl.de/opus/volltexte/2023/17561/

Endnote

%0 Conference Proceedings
%A Goranci, Gramoz
%A Henzinger, Monika
%A Nanongkai, Danupon
%A Saranurak, Thatchaphol
%A Thorup, Mikkel
%A Wulff, Christian
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Fully Dynamic Exact Edge Connectivity in Sublinear Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-9383-9
%R 10.1137/1.9781611977554.ch3
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 70 - 86
%I SIAM
%@ 978-1-61197-755-4
%U https://epubs.siam.org/doi/reader/10.1137/1.9781611977554.ch3

Endnote

%0 Conference Proceedings
%A Gouleakis, Themis
%A Lakis, Konstantinos
%A Shahkarami, Golnoosh
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Learning-Augmented Algorithms for Online TSP on the Line : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-466C-D
%R 10.1609/aaai.v37i10.26414 
%D 2023
%B 37th AAAI Conference on Artificial Intelligence
%Z date of event: 2023-02-07 - 2023-02-14
%C Washington, DC, USA
%B Proceedings of the 37th AAAI Conference on Artificial Intelligence
%P 11989 - 11996
%I AAAI
%@  978-1-57735-880-0

Endnote

%0 Journal Article
%A Gregor, Petr
%A Merino, Arturo
%A Mütze, Torsten
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T The Hamilton Compression of Highly Symmetric Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-36F6-0
%R 10.1007/s00026-023-00674-y
%7 2023
%D 2023
%J Annals of Combinatorics
%I Springer-Verlag
%C Singapore
%@ false

Endnote

%0 Conference Proceedings
%A Gutowski, Grzegorz
%A Mittelstädt, Florian
%A Rutter, Ignaz
%A Spoerhase, Joachim
%A Wolff, Alexander
%A Zink, Johannes
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Coloring Mixed and Directional Interval Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-26A4-0
%R 10.1007/978-3-031-22203-0_30
%D 2023
%B 30th International Symposium on Graph Drawing and Network Visualization
%Z date of event: 2022-09-13 - 2022-09-16
%C Tokyo, Japan
%B Graph Drawing and Network Visualization
%E Angelini, Patrizio; von Hanxleden, Reinhard
%P 418 - 431
%I Springer
%@ 978-3-031-22202-3
%B Lecture Notes in Computer Science
%N 13764

Endnote

%0 Conference Proceedings
%A Hatzel, Meike
%A Jaffke, Lars
%A Lima, Paloma T.
%A Masařík, Tomáš
%A Pilipczuk, Marcin
%A Sharma, Roohani
%A Sorge, Manuel
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Fixed-Parameter Tractability of Directed Multicut with Three Terminal
Pairs Parameterized by the Size of the Cutset: Twin-width Meets
Flow-Augmentation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-8E4C-0
%R 10.1137/1.9781611977554.ch123
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 3229 - 3244
%I SIAM
%@ 978-1-61197-755-4

Endnote

%0 Conference Proceedings
%A Iliopoulos, Costas S.
%A Kociumaka, Tomasz
%A Radoszewski, Jakub
%A Rytter, Wojciech
%A Waleń, Tomasz
%A Zuba, Wiktor
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-3404-F
%R 10.4230/LIPIcs.CPM.2023.15
%U urn:nbn:de:0030-drops-179697
%D 2023
%B 34th Annual Symposium on Combinatorial Pattern Matching
%Z date of event: 2023-06-26 - 2023-06-28
%C Marne-la-Vallée, France
%B 34th Annual Symposium on Combinatorial Pattern Matching
%E Bulteau, Laurent; Lipták, Zsuzsanna
%P 1 - 15
%Z sequence number: 15
%I Schloss Dagstuhl
%@ 978-3-95977-276-1
%B  Leibniz International Proceedings in Informatics
%N 259

Endnote

%0 Conference Proceedings
%A Jiang, Yonggang
%A Mukhopadhyay, Sagnik
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Finding a Small Vertex Cut on Distributed Networks : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-947A-4
%R 10.1145/3564246.3585201
%D 2023
%B 55th Annual ACM Symposium on Theory of Computing
%Z date of event: 2023-06-20 - 2023-06-23
%C Orlando, FL, USA
%B STOC '23
%P 1791 - 1801
%I ACM
%@ 978-1-4503-9913-5

Endnote

%0 Conference Proceedings
%A Kempa, Dominik
%A Kociumaka, Tomasz
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-75D1-2
%R 10.1109/FOCS57990.2023.00114
%D 2023
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%Z date of event: 2023-11-06 - 2023-11-09
%C  Santa Cruz, CA, USA 
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%P 1877 - 1886
%I IEEE
%@ 979-8-3503-1894-4

Endnote

%0 Conference Proceedings
%A Kempa, Dominik
%A Kociumaka, Tomasz
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Breaking the O(n)-Barrier in the Construction of Compressed Suffix
  Arrays : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-158F-C
%R 10.1137/1.9781611977554.ch187
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 5122 - 5202
%I SIAM
%@ 978-1-61197-755-4

Endnote

%0 Conference Proceedings
%A Kipouridis, Evangelos
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fitting Tree Metrics with Minimum Disagreements : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E82-C
%R 10.4230/LIPIcs.ESA.2023.70
%U urn:nbn:de:0030-drops-187233
%D 2023
%B 31st Annual European Symposium on Algorithms
%Z date of event: 2023-09-04 - 2023-09-06
%C Amsterdam, The Netherlands 
%B 31st Annual European Symposium on Algorithms
%E Gørtz, Inge Li; Farach-Colton, Martin; Puglisi, Simon J.; Herman, Grzegorz
%P 1 - 10
%Z sequence number: 70
%I Schloss Dagstuhl
%B Leibniz International Proceedings in Informatics
%N 274
%@ false

Endnote

%0 Journal Article
%A Kleer, Pieter
%A Simon, Hans U.
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Primal and Dual Combinatorial Dimensions : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-15FE-F
%R 10.1016/j.dam.2022.11.010
%7 2023
%D 2023
%J Discrete Applied Mathematics
%V 327
%& 185
%P 185 - 196
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Conference Proceedings
%A Kociumaka, Tomasz
%A Mukherjee, Anish
%A Saha, Barna
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Approximating Edit Distance in the Fully Dynamic Model : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-75D3-0
%R 10.1109/FOCS57990.2023.00098
%D 2023
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%Z date of event: 2023-11-06 - 2023-11-09
%C  Santa Cruz, CA, USA 
%B IEEE 64th Annual Symposium on Foundations of Computer Science 
%P 1628 - 1638
%I IEEE
%@ 979-8-3503-1894-4

Endnote

%0 Conference Proceedings
%A Künnemann, Marvin
%A Mazowiecki, Filip
%A Schütze, Lia
%A Sinclair-Banks, Henry
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-0E78-9
%R 10.4230/LIPIcs.ICALP.2023.131
%U urn:nbn:de:0030-drops-181834
%D 2023
%B 50th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2023-07-10 - 2023-07-14
%C Paderborn, Germany
%B 50th International Colloquium on Automata, Languages, and Programming 
%E Etessami, Kousha; Feige, Uriel; Puppis, Gabriele
%P 1 - 20
%Z sequence number: 131
%I Schloss Dagstuhl
%@ 978-3-95977-278-5
%B Leibniz International Proceedings in Informatics
%N 261

Endnote

%0 Conference Proceedings
%A Li, Jason
%A Nanongkai, Danupon
%A Panigrahi, Debmalya
%A Saranurak, Thatchaphol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Near-Linear Time Approximations for Cut Problems via Fair Cuts : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-9381-B
%R 10.1137/1.9781611977554.ch10
%D 2023
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2023-01-22 - 2023-01-25
%C Florence, Italy
%B Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
%E Bansal, Nikhil; Nagarajan, Viswanath
%P 240 - 257
%I SIAM
%@ 978-1-61197-755-4
%U https://epubs.siam.org/doi/pdf/10.1137/1.9781611977554.ch10?download=true

Endnote

%0 Journal Article
%A Lobyrev, Feodor
%A Gallagher, Colin P.
%A Emeliyanenko, Pavel
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Mathematical Model Predicting the Abundance and Spatio-temporal Dispersal of Adfluvial Salmonid (Salvelinus Malma) fry in a Stream : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-0D21-F
%R 10.1016/j.ecoinf.2023.102359
%7 2023
%D 2023
%J Ecological Informatics 
%V 78
%Z sequence number: 102359
%I Elsevier	 
%C Amsterdam [u.a.]
%@ false

Endnote

%0 Conference Proceedings
%A Mazowiecki, Filip
%A Sinclair-Banks, Henry
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Coverability in 2-VASS with One Unary Counter is in NP : Coverability in 2-{VASS} with One Unary Counter is in {NP}
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-4678-F
%R 10.1007/978-3-031-30829-1_10
%D 2023
%B 26th International Conference on Foundations of Software Science and Computation Structures
%Z date of event: 2023-04-22 - 2023-04-27
%C Paris, France
%B Foundations of Software Science and Computation Structures
%E Kupferman, Orna; Sobocinski, Pawel
%P 196 - 217
%I Springer
%@ 978-3-031-30828-4 
%B Lecture Notes in Computer Science
%N 13992

Endnote

%0 Journal Article
%A Misra, Pranabendu
%A Saket, Saurabh
%A Sharma, Roohani
%A Zehavi, Meirav
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-9037-3
%R 10.1007/s00453-022-01093-w
%7 2023
%D 2023
%J Algorithmica
%I Springer-Verlag
%C New York
%@ false

Endnote

%0 Journal Article
%A Nederlof, Jesper
%A Pawlewicz, Jakub
%A Swennenhuis, Céline M. F.
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-36A8-8
%R 10.1137/22M1478112
%7 2023
%D 2023
%J SIAM Journal on Computing
%V 52
%N 6
%& 1369
%P 1369 - 1412
%I SIAM
%C Philadelphia
%@ false

Endnote

%0 Journal Article
%A Nederlof, Jesper
%A Pilipczuk, Michał
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1EF3-1
%R 10.37236/11095 
%7 2023
%D 2023
%J The Electronic Journal of Combinatorics
%V 30
%N 3
%Z sequence number: P3.33
%I N.J. Calkin and H.S. Wilf
%C Atlanta, Ga.
%@ false

Endnote

%0 Journal Article
%A Nederlof, Jesper
%A Pilipczuk, Michał
%A Swennenhuis, Celine M. F.
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-00C2-6
%R 10.1137/22M1518943
%7 2023
%D 2023
%J SIAM Journal on Discrete Mathematics
%V 37
%N 3
%& 1566
%P 1566 - 1586
%I SIAM
%C Philadelphia, PA
%@ false

Endnote

%0 Conference Proceedings
%A Olkowski, Jędrzej
%A Pilipczuk, Michał
%A Rychlicki, Mateusz
%A Węgrzycki, Karol
%A Zych-Pawlewicz, Anna
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Dynamic Data Structures for Parameterized String Problems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1F0E-4
%R 10.4230/LIPIcs.STACS.2023.50
%U urn:nbn:de:0030-drops-177026
%D 2023
%B 40th International Symposium on Theoretical Aspects of Computer Science
%Z date of event: 2023-03-07 - 2023-03-09
%C Hamburg, Germany
%B 40th International Symposium on Theoretical Aspects of Computer Science
%E Berenbrink, Petra; Bouyer, Patricia; Dawar, Anuj; Kanté, Mamadou Moustapha
%P 1 - 22
%Z sequence number: 50
%I Schloss Dagstuhl
%@ 978-3-95977-266-2
%B Leibniz International Proceedings in Informatics
%N 254
%@ false

Endnote

%0 Journal Article
%A Peyerimhoff, Norbert
%A Roth, Marc
%A Schmitt, Johannes
%A Stix, Jakob
%A Vdovina, Alina
%A Wellnitz, Philip
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Parameterized Counting and Cayley Graph Expanders : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000D-6355-4
%R 10.1137/22M1479804
%7 2023
%D 2023
%J SIAM Journal on Discrete Mathematics
%V 37
%N 2
%& 405
%P 405 - 486
%I SIAM
%C Philadelphia, Pa.
%@ false

Endnote

%0 Journal Article
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%A Mehta, Ruta
%A Misra, Pranabendu
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Improving EFX Guarantees through Rainbow Cycle Number : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-0D04-0
%R 10.1287/moor.2021.0252
%7 2023
%D 2023
%J Mathematics of Operations Research
%I informs
%C Catonsville, MD
%@ false

Endnote

%0 Conference Proceedings
%A Simon, Hans U.
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Tournaments, Johnson Graphs, and NC-Teaching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1606-5
%D 2023
%B The 34th International Conference on Algorithmic Learning Theory
%Z date of event: 2023-02-20 - 2023-02-23
%C Singapore, Singapore
%B Proceedings of the 34th International Conference on Algorithmic Learning Theory
%E Agrawal, Shipra; Orabona, Francesco
%P 1411 - 1428
%I PMLR
%B Proceedings of the Machine Learning Research
%N 201

Endnote

%0 Report
%A Zandieh, Amir
%A Han, Insu
%A Daliri, Majid
%A Karbasi, Amin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T KDEformer: Accelerating Transformers via Kernel Density Estimation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-90F7-A
%U https://arxiv.org/abs/2302.02451
%D 2023
%X   Dot-product attention mechanism plays a crucial role in modern deep<br>architectures (e.g., Transformer) for sequence modeling, however, na\"ive exact<br>computation of this model incurs quadratic time and memory complexities in<br>sequence length, hindering the training of long-sequence models. Critical<br>bottlenecks are due to the computation of partition functions in the<br>denominator of softmax function as well as the multiplication of the softmax<br>matrix with the matrix of values. Our key observation is that the former can be<br>reduced to a variant of the kernel density estimation (KDE) problem, and an<br>efficient KDE solver can be further utilized to accelerate the latter via<br>subsampling-based fast matrix products. Our proposed KDEformer can approximate<br>the attention in sub-quadratic time with provable spectral norm bounds, while<br>all prior results merely provide entry-wise error bounds. Empirically, we<br>verify that KDEformer outperforms other attention approximations in terms of<br>accuracy, memory, and runtime on various pre-trained models. On BigGAN image<br>generation, we achieve better generative scores than the exact computation with<br>over $4\times$ speedup. For ImageNet classification with T2T-ViT, KDEformer<br>shows over $18\times$ speedup while the accuracy drop is less than $0.5\%$.<br>
%K Computer Science, Learning, cs.LG,Computer Science, Computer Vision and Pattern Recognition, cs.CV,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Abboud, Amir
%A Bringmann, Karl
%A Khoury, Seri
%A Zamir, Or
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Hardness of Approximation in p via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-4797-B
%R 10.1145/3519935.3520066
%D 2022
%B 54th Annual ACM Symposium on Theory of Computing
%Z date of event: 2022-06-20 - 2022-06-24
%C Rome, Italy
%B STOC '22
%E Leonardi, Stefano; Gupta, Anupam
%P 1487 - 1500
%I ACM
%@ 978-1-4503-9264-8

Endnote

%0 Journal Article
%A Abboud, Amir
%A Bringmann, Karl
%A Hermelin, Danny
%A Shabtay, Dvir
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Scheduling Lower Bounds via AND Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-153C-B
%R 10.1016/j.jcss.2022.01.005
%7 2022
%D 2022
%J Journal of Computer and System Sciences
%V 127
%& 29
%P 29 - 40
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Journal Article
%A Abboud, Amir
%A Bringmann, Karl
%A Hermelin, Danny
%A Shabtay, Dvir
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T SETH-Based Lower Bounds for Subset Sum and Bicriteria Path : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-1543-2
%R 10.1145/3450524
%7 2022
%D 2022
%J ACM Transactions on Algorithms
%V 18
%N 1
%& 1
%P 1 - 22
%Z sequence number: 6
%I ACM
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Agrawal, Akanksha
%A Lokshtanov, Daniel
%A Misra, Pranabendu
%A Saurabh, Saket
%A Zehavi, Meirav
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Erdős–Pósa Property of Obstructions to Interval Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-589A-5
%R 10.1002/jgt.22895
%7 2022
%D 2022
%J Journal of Graph Theory
%V 102
%N 4
%& 702
%P 702 - 727
%I John Wiley & Sons.
%C New York
%@ false

Endnote

%0 Report
%A Akrami, Hannaneh
%A Alon, Noga
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T EFX Allocations: Simplifications and Improvements : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FEB-A
%U https://arxiv.org/abs/2205.07638
%D 2022
%X   The existence of EFX allocations is a fundamental open problem in discrete<br>fair division. Given a set of agents and indivisible goods, the goal is to<br>determine the existence of an allocation where no agent envies another<br>following the removal of any single good from the other agent's bundle. Since<br>the general problem has been illusive, progress is made on two fronts: $(i)$<br>proving existence when the number of agents is small, $(ii)$ proving existence<br>of relaxations of EFX. In this paper, we improve results on both fronts (and<br>simplify in one of the cases).<br>  We prove the existence of EFX allocations with three agents, restricting only<br>one agent to have an MMS-feasible valuation function (a strict generalization<br>of nice-cancelable valuation functions introduced by Berger et al. which<br>subsumes additive, budget-additive and unit demand valuation functions). The<br>other agents may have any monotone valuation functions. Our proof technique is<br>significantly simpler and shorter than the proof by Chaudhury et al. on<br>existence of EFX allocations when there are three agents with additive<br>valuation functions and therefore more accessible.<br>  Secondly, we consider relaxations of EFX allocations, namely, approximate-EFX<br>allocations and EFX allocations with few unallocated goods (charity). Chaudhury<br>et al. showed the existence of $(1-\epsilon)$-EFX allocation with<br>$O((n/\epsilon)^{\frac{4}{5}})$ charity by establishing a connection to a<br>problem in extremal combinatorics. We improve their result and prove the<br>existence of $(1-\epsilon)$-EFX allocations with $\tilde{O}((n/<br>\epsilon)^{\frac{1}{2}})$ charity. In fact, some of our techniques can be used<br>to prove improved upper-bounds on a problem in zero-sum combinatorics<br>introduced by Alon and Krivelevich.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Ray Chaudhury, Bhaskar
%A Hoefer, Martin
%A Mehlhorn, Kurt
%A Schmalhofer, Marco
%A Shahkarami, Golnoosh
%A Varricchio, Giovanna
%A Vermande, Quentin
%A van Wijland, Ernest
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Maximizing Nash Social Welfare in 2-Value Instances  : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FC6-3
%R 10.1609/aaai.v36i5.20402
%D 2022
%B 36th AAAI Conference on Artificial Intelligence
%Z date of event: 2022-02-22 - 2022-03-01
%C Virtual Conference
%B Proceedings of the 36th AAAI Conference on Artificial Intelligence
%P 4760 - 4767
%I AAAI
%@ 978-1-57735-876-3
%U https://ojs.aaai.org/index.php/AAAI/article/view/20402

Endnote

%0 Report
%A Akrami, Hannaneh
%A Ray Chaudhury, Bhaskar
%A Hoefer, Martin
%A Mehlhorn, Kurt
%A Schmalhofer, Marco
%A Shahkarami, Golnoosh
%A Varricchio, Giovanna
%A Vermande, Quentin
%A van Wijland, Ernest
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer
  Case : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FD5-2
%U https://arxiv.org/abs/2207.10949
%D 2022
%X   We consider the problem of maximizing the Nash social welfare when allocating<br>a set $G$ of indivisible goods to a set $N$ of agents. We study instances, in<br>which all agents have 2-value additive valuations: The value of a good $g \in<br>G$ for an agent $i \in N$ is either $1$ or $s$, where $s$ is an odd multiple of<br>$\frac{1}{2}$ larger than one. We show that the problem is solvable in<br>polynomial time. Akrami et at. showed that this problem is solvable in<br>polynomial time if $s$ is integral and is NP-hard whenever $s = \frac{p}{q}$,<br>$p \in \mathbb{N}$ and $q\in \mathbb{N}$ are co-prime and $p > q \ge 3$. For<br>the latter situation, an approximation algorithm was also given. It obtains an<br>approximation ratio of at most $1.0345$. Moreover, the problem is APX-hard,<br>with a lower bound of $1.000015$ achieved at $\frac{p}{q} = \frac{5}{4}$. The<br>case $q = 2$ and odd $p$ was left open.<br>  In the case of integral $s$, the problem is separable in the sense that the<br>optimal allocation of the heavy goods (= value $s$ for some agent) is<br>independent of the number of light goods (= value $1$ for all agents). This<br>leads to an algorithm that first computes an optimal allocation of the heavy<br>goods and then adds the light goods greedily. This separation no longer holds<br>for $s = \frac{3}{2}$; a simple example is given in the introduction. Thus an<br>algorithm has to consider heavy and light goods together. This complicates<br>matters considerably. Our algorithm is based on a collection of improvement<br>rules that transfers any allocation into an optimal allocation and exploits a<br>connection to matchings with parity constraints.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT

Endnote

%0 Conference Proceedings
%A Akrami, Hannaneh
%A Rezvan, Rojin
%A Seddighin, Masoud
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T An EF2X Allocation Protocol for Restricted Additive Valuations  : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FFA-9
%R 10.24963/ijcai.2022/3 
%D 2022
%B Thirty-First International Joint Conference on Artificial Intelligence
%Z date of event: 2022-07-23 - 2022-07-29
%C Vienna, Austria
%B Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
%E de Raedt, Luc
%P 17 - 23
%I IJCAI
%@ 978-1-956792-00-3

Endnote

%0 Report
%A Akrami, Hannaneh
%A Rezvan, Rojin
%A Seddighin, Masoud
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T An EF2X Allocation Protocol for Restricted Additive Valuations : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FF3-0
%U https://arxiv.org/abs/2202.13676
%D 2022
%X   We study the problem of fairly allocating a set of $m$ indivisible goods to a<br>set of $n$ agents. Envy-freeness up to any good (EFX) criteria -- which<br>requires that no agent prefers the bundle of another agent after removal of any<br>single good -- is known to be a remarkable analogous of envy-freeness when the<br>resource is a set of indivisible goods. In this paper, we investigate EFX<br>notion for the restricted additive valuations, that is, every good has some<br>non-negative value, and every agent is interested in only some of the goods.<br>  We introduce a natural relaxation of EFX called EFkX which requires that no<br>agent envies another agent after removal of any $k$ goods. Our main<br>contribution is an algorithm that finds a complete (i.e., no good is discarded)<br>EF2X allocation for the restricted additive valuations. In our algorithm we<br>devise new concepts, namely "configuration" and "envy-elimination" that might<br>be of independent interest.<br>  We also use our new tools to find an EFX allocation for restricted additive<br>valuations that discards at most $\lfloor n/2 \rfloor -1$ goods. This improves<br>the state of the art for the restricted additive valuations by a factor of $2$.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT

Endnote

%0 Journal Article
%A Amanatidis, Georgios
%A Kleer, Pieter
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-567A-D
%R 10.1137/20M1352697
%7 2022
%D 2022
%J SIAM Journal on Discrete Mathematics
%V 36
%N 1
%& 118
%P 118 - 146
%I The Society
%C Philadelphia, Pa.
%@ false

Endnote

%0 Journal Article
%A Amiri, Saeed Akhoondian
%A Wiederhake, Ben
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Distributed Distance-r Dominating Set on Sparse High-Girth Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-9DFE-8
%R 10.1016/j.tcs.2022.01.001
%7 2022
%D 2022
%J Theoretical Computer Science
%V 906
%& 18
%P 18 - 31
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Conference Proceedings
%A Anagnostides, Ioannis
%A Lenzen, Christoph
%A Haeupler, Bernhard
%A Zuzic, Goran
%A Gouleakis, Themis
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-7314-C
%R 10.4230/LIPIcs.DISC.2022.6
%U urn:nbn:de:0030-drops-171978
%D 2022
%B 36th International Symposium on Distributed Computing
%Z date of event: 2022-10-25 - 2022-10-27
%C Augusta, GA, USA
%B 36th International Symposium on Distributed Computing
%E Scheideler, Christian
%P 1 - 20
%Z sequence number: 6
%I Schloss Dagstuhl
%@ 978-3-95977-210-5
%B Leibniz International Proceedings in Informatics
%N 246
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2022/17197/https://creativecommons.org/licenses/by/4.0/legalcode

Endnote

%0 Journal Article
%A An, Haozhe
%A Gurumukhani, Mohit
%A Impagliazzo, Russell
%A Jaber, Michael
%A Künnemann, Marvin
%A Parga Nina, Maria Paula
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T The Fine-Grained Complexity of Multi-Dimensional Ordering Properties : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1F9C-3
%R 10.1007/s00453-022-01014-x
%7 2022
%D 2022
%J Algorithmica
%V 84
%& 3156
%P 3156 - 3191
%I Springer-Verlag
%C New York
%@ false

Endnote

%0 Conference Proceedings
%A Antoniadis, Antonios
%A Jabbarzade, Peyman
%A Shahkarami, Golnoosh
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Novel Prediction Setup for Online Speed-Scaling : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FBA-1
%R 10.4230/LIPIcs.SWAT.2022.9
%U urn:nbn:de:0030-drops-161693
%U https://drops.dagstuhl.de/opus/volltexte/2022/16169/
%D 2022
%B 18th Scandinavian Symposium and Workshops on Algorithm Theory
%Z date of event: 2022-06-27 - 2022-06-29
%C Tórshavn, Faroe Islands
%B 18th Scandinavian Symposium and Workshops on Algorithm Theory
%E Czumai, Artur; Xin, Qin
%P 1 - 20
%Z sequence number: 9
%I Schloss Dagstuhl
%@ 978-3-95977-236-5
%B Leibniz International Proceedings in Informatics
%N 227
%@ false

Endnote

%0 Report
%A Antoniadis, Antonios
%A Jabbarzade Ganje, Peyman
%A Shahkarami, Golnoosh
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Novel Prediction Setup for Online Speed-Scaling : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FBE-D
%U https://arxiv.org/abs/2112.03082
%D 2022
%X   Given the rapid rise in energy demand by data centers and computing systems<br>in general, it is fundamental to incorporate energy considerations when<br>designing (scheduling) algorithms. Machine learning can be a useful approach in<br>practice by predicting the future load of the system based on, for example,<br>historical data. However, the effectiveness of such an approach highly depends<br>on the quality of the predictions and can be quite far from optimal when<br>predictions are sub-par. On the other hand, while providing a worst-case<br>guarantee, classical online algorithms can be pessimistic for large classes of<br>inputs arising in practice.<br>  This paper, in the spirit of the new area of machine learning augmented<br>algorithms, attempts to obtain the best of both worlds for the classical,<br>deadline based, online speed-scaling problem: Based on the introduction of a<br>novel prediction setup, we develop algorithms that (i) obtain provably low<br>energy-consumption in the presence of adequate predictions, and (ii) are robust<br>against inadequate predictions, and (iii) are smooth, i.e., their performance<br>gradually degrades as the prediction error increases.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Learning, cs.LG

Endnote

%0 Conference Proceedings
%A Apers, Simon
%A Efron, Yuval
%A Gawrychowski, Paweł
%A Lee, Troy
%A Mukhopadhyay, Sagnik
%A Nanongkai, Danupon
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Cut Query Algorithms with Star Contraction : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-26C5-B
%R 10.1109/FOCS54457.2022.00055
%D 2022
%B IEEE 63rd Annual Symposium on Foundations of Computer Science
%Z date of event: 2022-10-31 - 2022-11-03
%C Denver, CO, USA
%B FOCS 2022
%P 507 - 518
%I IEEE
%@ 978-1-6654-5519-0

Endnote

%0 Conference Proceedings
%A Banyassady, Bahareh
%A de Berg, Mark
%A Bringmann, Karl
%A Buchin, Kevin
%A Fernau, Henning
%A Halperin, Dan
%A Kostitsyna, Irina
%A Okamoto, Yoshio
%A Slot, Stijn
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
%T Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-1553-0
%R 10.4230/LIPIcs.SoCG.2022.12
%U urn:nbn:de:0030-drops-160203
%D 2022
%B 38th International Symposium on Computational Geometry
%Z date of event: 2022-06-07 - 2022-06-10
%C Berlin, Germany
%B 38th International Symposium on Computational Geometry
%E Goaoc, Xavier; Kerber, Michael
%P 1 - 16
%Z sequence number: 12
%I Schloss Dagstuhl
%@ 978-3-95977-227-3
%B Leibniz International Proceedings in Informatics
%N 224
%@ false

Endnote

%0 Journal Article
%A Beier, René
%A Röglin, Heiko
%A Rösner, Clemens
%A Vöcking, Berthold
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T The Smoothed Number of Pareto-optimal Solutions in Bicriteria Integer Optimization : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-58A2-B
%R 10.1007/s10107-022-01885-6
%7 2022
%D 2022
%J Mathematical Programming / A
%I Springer
%C Heidelberg
%@ false

Endnote

%0 Conference Proceedings
%A Bernstein, Aaron
%A Nanongkai, Danupon
%A Wulff-Nilsen, Christian
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Negative-Weight Single-Source Shortest Paths in Near-linear Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-26C9-7
%R 10.1109/FOCS54457.2022.00063
%D 2022
%B IEEE 63rd Annual Symposium on Foundations of Computer Science
%Z date of event: 2022-10-31 - 2022-11-03
%C Denver, CO, USA
%B FOCS 2022
%P 600 - 611
%I IEEE
%@ 978-1-6654-5519-0

Endnote

%0 Report
%A Bhattacharya, Sayan
%A Kiss, Peter
%A Saranurak, Thatchaphol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-2696-0
%U https://arxiv.org/abs/2212.00189
%D 2022
%X   We study sublinear time algorithms for estimating the size of maximum<br>matching. After a long line of research, the problem was finally settled by<br>Behnezhad [FOCS'22], in the regime where one is willing to pay an approximation<br>factor of $2$. Very recently, Behnezhad et al.[SODA'23] improved the<br>approximation factor to $(2-\frac{1}{2^{O(1/\gamma)}})$ using $n^{1+\gamma}$<br>time. This improvement over the factor $2$ is, however, minuscule and they<br>asked if even $1.99$-approximation is possible in $n^{2-\Omega(1)}$ time. We<br>give a strong affirmative answer to this open problem by showing<br>$(1.5+\epsilon)$-approximation algorithms that run in<br>$n^{2-\Theta(\epsilon^{2})}$ time. Our approach is conceptually simple and<br>diverges from all previous sublinear-time matching algorithms: we show a<br>sublinear time algorithm for computing a variant of the edge-degree constrained<br>subgraph (EDCS), a concept that has previously been exploited in dynamic<br>[Bernstein Stein ICALP'15, SODA'16], distributed [Assadi et al. SODA'19] and<br>streaming [Bernstein ICALP'20] settings, but never before in the sublinear<br>setting. Independent work: Behnezhad, Roghani and Rubinstein [BRR'23]<br>independently showed sublinear algorithms similar to our Theorem 1.2 in both<br>adjacency list and matrix models. Furthermore, in [BRR'23], they show<br>additional results on strictly better-than-1.5 approximate matching algorithms<br>in both upper and lower bound sides.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Blikstad, Joakim
%A Brand, Jan Van Den
%A Efron, Yuval
%A Mukhopadhyay, Sagnik
%A Nanongkai, Danupon
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Nearly Optimal Communication and Query Complexity of Bipartite Matching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-26CF-1
%R 10.1109/FOCS54457.2022.00113
%D 2022
%B IEEE 63rd Annual Symposium on Foundations of Computer Science
%Z date of event: 2022-10-31 - 2022-11-03
%C Denver, CO, USA
%B FOCS 2022
%P 1174 - 1185
%I IEEE
%@ 978-1-6654-5519-0

Endnote

%0 Journal Article
%A Bonifaci, Vincenzo
%A Facca, Enrico
%A Folz, Frederic
%A Karrenbauer, Andreas
%A Kolev, Pavel
%A Mehlhorn, Kurt
%A Morigi, Giovanna
%A Shahkarami, Golnoosh
%A Vermande, Quentin
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Physarum-inspired Multi-commodity Flow Dynamics : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-28A1-3
%R 10.1016/j.tcs.2022.02.001
%7 2022
%D 2022
%J Theoretical Computer Science
%V 920
%& 1
%P 1 - 20
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Conference Proceedings
%A Boodaghians, Shant
%A Ray Chaudhury, Bhaskar
%A Mehta, Ruta
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-A3BB-9
%R 10.1137/1.9781611977073
%D 2022
%B Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2022-01-09 - 2022-01-12
%C Virtual
%B Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
%E Naor, Seffi; Buchbinder, Niv
%P 2285 - 2302
%I SIAM
%@ 978-1-61197-707-3

Endnote

%0 Report
%A Briański, Marcin
%A Joret, Gwenaël
%A Majewski, Konrad
%A Micek, Piotr
%A Seweryn, Michał T.
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Treedepth Vs Circumference : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1E81-1
%U https://arxiv.org/abs/2211.11410
%D 2022
%X   The circumference of a graph $G$ is the length of a longest cycle in $G$, or<br>$+\infty$ if $G$ has no cycle. Birmel\'e (2003) showed that the treewidth of a<br>graph $G$ is at most its circumference minus one. We strengthen this result for<br>$2$-connected graphs as follows: If $G$ is $2$-connected, then its treedepth is<br>at most its circumference. The bound is best possible and improves on an<br>earlier quadratic upper bound due to Marshall and Wood (2015).<br>
%K Mathematics, Combinatorics, math.CO,Computer Science, Discrete Mathematics, cs.DM

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%A Fischer, Nick
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-588D-4
%R 10.1145/3519935.3519990
%D 2022
%B 54th Annual ACM Symposium on Theory of Computing
%Z date of event: 2022-06-20 - 2022-06-24
%C Rome, Italy
%B STOC '22
%E Leonardi, Stefano; Gupta, Anupam
%P 1102 - 1115
%I ACM
%@ 978-1-4503-9264-8

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Driemel, Anne
%A Nusser, André
%A Psarros, Ioannis
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Tight Bounds for Approximate Near Neighbor Searching for Time Series
  under the Fréchet Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1D7D-9
%R 10.1137/1.9781611977073.25
%D 2022
%B Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2022-01-09 - 2022-01-12
%C Virtual
%B Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
%E Naor, Seffi; Buchbinder, Niv
%P 517 - 550
%I SIAM
%@ 978-1-61197-707-3

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Fischer, Nick
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Deterministic and Las Vegas Algorithms for Sparse Nonnegative
  Convolution : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1D81-2
%R 10.1137/1.9781611977073.119
%D 2022
%B Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2022-01-09 - 2022-01-12
%C Virtual
%B Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
%E Naor, Seffi; Buchbinder, Niv
%P 3069 - 3090
%I SIAM
%@ 978-1-61197-707-3

Endnote

%0 Journal Article
%A Bringmann, Karl
%A Keusch, Ralph
%A Lengler, Johannes
%A Maus, Yannic
%A Molla, Anisur Rahaman
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Greedy Routing and the Algorithmic Small-World Phenomenon : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-9DD0-A
%R 10.1016/j.jcss.2021.11.003
%7 2022
%D 2022
%J Journal of Computer and System Sciences
%V 125
%& 59
%P 59 - 105
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Journal Article
%A Bringmann, Karl
%A Fischer, Nick
%A Hermelin, Danny
%A Shabtay, Dvir
%A Wellnitz, Philip
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Minimization of Tardy Processing Time on a Single Machine : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-FAD4-E
%R 10.1007/s00453-022-00928-w
%7 2022
%D 2022
%J Algorithmica
%V 84
%& 1341
%P 1341 - 1356
%I Springer
%C New York
%@ false
%U https://rdcu.be/cG2A9

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Kisfaludi-Bak, Sándor
%A Künnemann, Marvin
%A Marx, Dániel
%A Nusser, André
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-1560-1
%R 10.4230/LIPIcs.SoCG.2022.20
%U urn:nbn:de:0030-drops-160287
%D 2022
%B 38th International Symposium on Computational Geometry
%Z date of event: 2022-06-07 - 2022-06-10
%C Berlin, Germany
%B 38th International Symposium on Computational Geometry
%E Goaoc, Xavier; Kerber, Michael
%P 1 - 17
%Z sequence number: 20
%I Schloss Dagstuhl
%@ 978-3-95977-227-3
%B Leibniz International Proceedings in Informatics
%N 224
%@ false

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Kisfaludi-Bak, Sándor
%A Künnemann, Marvin
%A Nusser, André
%A Parsaeian, Zahra
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-1572-D
%R 10.4230/LIPIcs.SoCG.2022.21
%U urn:nbn:de:0030-drops-160294
%D 2022
%B 38th International Symposium on Computational Geometry
%Z date of event: 2022-06-07 - 2022-06-10
%C Berlin, Germany
%B 38th International Symposium on Computational Geometry
%E Goaoc, Xavier; Kerber, Michael
%P 1 - 16
%Z sequence number: 21
%I Schloss Dagstuhl
%@ 978-3-95977-227-3
%B Leibniz International Proceedings in Informatics
%N 224
%@ false

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%A Fischer, Nick
%A Künnemann, Marvin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T A Structural Investigation of the Approximability of Polynomial-Time Problems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-15B5-1
%R 10.4230/LIPIcs.ICALP.2022.30
%U urn:nbn:de:0030-drops-163713
%D 2022
%B 49th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2022-07-04 - 2022-07-08
%C Paris, France
%B 49th EATCS International Conference on Automata, Languages, and Programming
%E Bojańczyk, Mikołaj; Merelli, Emanuela; Woodruff, David P.
%P 1 - 20
%Z sequence number: 30
%I Schloss Dagstuhl
%@ 978-3-95977-235-8}
%B Leibniz International Proceedings in Informatics
%N 229

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%A Fischer, Nick
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Improved Sublinear-Time Edit Distance for Preprocessed Strings : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-163A-C
%R 10.4230/LIPIcs.ICALP.2022.32
%U urn:nbn:de:0030-drops-163734
%D 2022
%B 49th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2022-07-04 - 2022-07-08
%C Paris, France
%B 49th EATCS International Conference on Automata, Languages, and Programming
%E Bojańczyk, Mikołaj; Merelli, Emanuela; Woodruff, David P.
%P 1 - 20
%Z sequence number: 32
%I Schloss Dagstuhl
%@ 978-3-95977-235-8}
%B Leibniz International Proceedings in Informatics
%N 229

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-1622-6
%R 10.4230/LIPIcs.ICALP.2022.31
%U urn:nbn:de:0030-drops-163727
%D 2022
%B 49th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2022-07-04 - 2022-07-08
%C Paris, France
%B 49th EATCS International Conference on Automata, Languages, and Programming
%E Bojańczyk, Mikołaj; Merelli, Emanuela; Woodruff, David P.
%P 1 - 21
%Z sequence number: 31
%I Schloss Dagstuhl
%@ 978-3-95977-235-8}
%B Leibniz International Proceedings in Informatics
%N 229

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Carmeli, Nofar
%A Mengel, Stefan
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Tight Fine-Grained Bounds for Direct Access on Join Queries : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-2037-3
%R 10.1145/3517804.3526234
%D 2022
%B 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
%Z date of event: 2022-06-12 - 2022-06-17
%C Philadelphia, PA, USA
%B PODS '22
%E Libkin, Leonid; Barceló, Pablo; Grez, Alejandro
%P 427 - 436
%I ACM
%@ 978-1-4503-9260-0

Endnote

%0 Conference Proceedings
%A Buchin, Kevin
%A Nusser, André
%A Wong, Sampson
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-268B-D
%R 10.4230/LIPIcs.SoCG.2022.22
%U urn:nbn:de:0030-drops-160307
%D 2022
%B 38th International Symposium on Computational Geometry
%Z date of event: 2022-06-07 - 2022-06-10
%C Berlin, Germany
%B 38th International Symposium on Computational Geometry
%E Goaoc, Xavier; Kerber, Michael
%P 1 - 16
%Z sequence number: 22
%I Schloss Dagstuhl
%@ 978-3-95977-227-3
%B Leibniz International Proceedings in Informatics
%N 224
%@ false

Endnote

%0 Thesis
%A Bund, Johannes
%Y Bläser, Markus
%A referee: Lenzen, Christoph
%A referee: Függer, Matthias
%A referee: Mehlhorn, Kurt
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Hazard-free Clock Synchronization : 
%U http://hdl.handle.net/21.11116/0000-000D-D178-0
%U urn:nbn:de:bsz:291--ds-404463
%R 10.22028/D291-40446
%F OTHER: hdl:20.500.11880/36387
%I Universität des Saarlandes
%C Saarbrücken
%D 2022
%P xii,180 p.
%V phd
%9 phd
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/36387

Endnote

%0 Report
%A Caoduro, Marco
%A Cslovjecsek, Jana
%A Pilipczuk, Michał
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Independence Number of Intersection Graphs of Axis-Parallel Segments : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1F1D-3
%U https://arxiv.org/abs/2205.15189
%D 2022
%X   We prove that for any triangle-free intersection graph of $n$ axis-parallel<br>segments in the plane, the independence number $\alpha$ of this graph is at<br>least $\alpha \ge n/4 + \Omega(\sqrt{n})$. We complement this with a<br>construction of a graph in this class satisfying $\alpha \le n/4 + c \sqrt{n}$<br>for an absolute constant $c$, which demonstrates the optimality of our result.<br>
%K Mathematics, Combinatorics, math.CO,Computer Science, Computational Geometry, cs.CG,Computer Science, Discrete Mathematics, cs.DM,

Endnote

%0 Conference Proceedings
%A Chalermsook, Parinya
%A Huang, Chien-Chung
%A Nanongkai, Danupon
%A Saranurak, Thatchaphol
%A Sukprasert, Pattara
%A Yingchareonthawornchai, Sorrachai
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-6D7C-E
%R 10.4230/LIPIcs.ICALP.2022.37
%U urn:nbn:de:0030-drops-163785
%D 2022
%B 49th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2022-07-04 - 2022-07-08
%C Paris, France
%B 49th EATCS International Conference on Automata, Languages, and Programming
%E Bojańczyk, Mikołaj; Merelli, Emanuela; Woodruff, David P.
%P 1 - 20
%Z sequence number: 37
%I Schloss Dagstuhl
%@ 978-3-95977-235-8}
%B Leibniz International Proceedings in Informatics
%N 229

Endnote

%0 Report
%A Charalampopoulos, Panagiotis
%A Kociumaka, Tomasz
%A Wellnitz, Philip
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Pattern Matching under Edit Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1EC9-1
%U https://arxiv.org/abs/2204.03087
%D 2022
%X   We consider the approximate pattern matching problem under the edit distance.<br>Given a text $T$ of length $n$, a pattern $P$ of length $m$, and a threshold<br>$k$, the task is to find the starting positions of all substrings of $T$ that<br>can be transformed to $P$ with at most $k$ edits. More than 20 years ago, Cole<br>and Hariharan [SODA'98, J. Comput.'02] gave an $\mathcal{O}(n+k^4 \cdot n/<br>m)$-time algorithm for this classic problem, and this runtime has not been<br>improved since.<br>  Here, we present an algorithm that runs in time $\mathcal{O}(n+k^{3.5}<br>\sqrt{\log m \log k} \cdot n/m)$, thus breaking through this long-standing<br>barrier. In the case where $n^{1/4+\varepsilon} \leq k \leq<br>n^{2/5-\varepsilon}$ for some arbitrarily small positive constant<br>$\varepsilon$, our algorithm improves over the state-of-the-art by polynomial<br>factors: it is polynomially faster than both the algorithm of Cole and<br>Hariharan and the classic $\mathcal{O}(kn)$-time algorithm of Landau and<br>Vishkin [STOC'86, J. Algorithms'89].<br>  We observe that the bottleneck case of the alternative $\mathcal{O}(n+k^4<br>\cdot n/m)$-time algorithm of Charalampopoulos, Kociumaka, and Wellnitz<br>[FOCS'20] is when the text and the pattern are (almost) periodic. Our new<br>algorithm reduces this case to a new dynamic problem (Dynamic Puzzle Matching),<br>which we solve by building on tools developed by Tiskin [SODA'10,<br>Algorithmica'15] for the so-called seaweed monoid of permutation matrices. Our<br>algorithm relies only on a small set of primitive operations on strings and<br>thus also applies to the fully-compressed setting (where text and pattern are<br>given as straight-line programs) and to the dynamic setting (where we maintain<br>a collection of strings under creation, splitting, and concatenation),<br>improving over the state of the art.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Charalampopoulos, Panagiotis
%A Kociumaka, Tomasz
%A Wellnitz, Philip
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Pattern Matching under Edit Distance: A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1571-D
%R 10.1109/FOCS54457.2022.00072
%D 2022
%B IEEE 63rd Annual Symposium on Foundations of Computer Science
%Z date of event: 2022-10-31 - 2022-11-03
%C Denver, CO, USA
%B FOCS 2022
%P 698 - 707
%I IEEE
%@ 978-1-6654-5519-0

Endnote

%0 Conference Proceedings
%A Charalampopoulos, Panagiotis
%A Kociumaka, Tomasz
%A Pissis, Solon P.
%A Radoszewski, Jakub
%A Rytter, Wojciech
%A Waleń, Tomasz
%A Zuba, Wiktor
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
%T Approximate Circular Pattern Matching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1531-5
%R 10.4230/LIPIcs.ESA.2022.35
%U urn:nbn:de:0030-drops-169738
%U https://drops.dagstuhl.de/opus/volltexte/2022/16973/
%D 2022
%B 30th Annual European Symposium on Algorithms
%Z date of event: 2022-09-05 - 2022-09-09
%C Berlin/Potsdam, Germany
%B 30th Annual European Symposium on Algorithms
%E Chechik, Shiri; Navarro, Gonzalo; Rotenberg, Eva; Herman, Grzegorz
%P 1 - 19
%Z sequence number: 35
%I Schloss Dagstuhl
%@ 978-3-95977-247-1
%B Leibniz International Proceedings in Informatics
%N 244
%@ false

Endnote

%0 Conference Proceedings
%A Coudert, David
%A Nusser, André
%A Viennot, Laurent
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Computing Graph Hyperbolicity Using Dominating Sets : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-268E-A
%R 10.1137/1.9781611977042.7
%D 2022
%B Symposium on Algorithm Engineering and Experiments 
%Z date of event: 2022-01-09 - 2022-01-10
%C Alexandria, VA, USA
%B Proceedings of the Symposium on Algorithm Engineering and Experiments 
%E Phillips, Cynthia A.; Speckman, Bettina
%P 78 - 90
%I SIAM
%@ 978-1-61197-704-2

Endnote

%0 Journal Article
%A Coudert, David
%A Nusser, André
%A Viennot, Laurent
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-FE19-C
%R 10.1145/3569169
%7 2022
%D 2022
%J ACM Journal of Experimental Algorithmics
%V 27
%Z sequence number: 1.15
%I ACM
%C New York, NY
%@ false

Endnote

%0 Report
%A Coupette, Corinna
%A Vreeken, Jilles
%A Rieck, Bastian
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T All the World's a (Hyper)Graph: A Data Drama : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-10C1-7
%U https://arxiv.org/abs/2206.08225
%D 2022
%X   We introduce Hyperbard, a dataset of diverse relational data representations<br>derived from Shakespeare's plays. Our representations range from simple graphs<br>capturing character co-occurrence in single scenes to hypergraphs encoding<br>complex communication settings and character contributions as hyperedges with<br>edge-specific node weights. By making multiple intuitive representations<br>readily available for experimentation, we facilitate rigorous representation<br>robustness checks in graph learning, graph mining, and network analysis,<br>highlighting the advantages and drawbacks of specific representations.<br>Leveraging the data released in Hyperbard, we demonstrate that many solutions<br>to popular graph mining problems are highly dependent on the representation<br>choice, thus calling current graph curation practices into question. As an<br>homage to our data source, and asserting that science can also be art, we<br>present all our points in the form of a play.<br>
%K Computer Science, Learning, cs.LG,Computer Science, Computation and Language, cs.CL,Computer Science, Computers and Society, cs.CY,cs.SI

Endnote

%0 Report
%A Coupette, Corinna
%A Hartung, Dirk
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Sharing and Caring: Creating a Culture of Constructive Criticism in
  Computational Legal Studies : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1083-D
%U https://arxiv.org/abs/2205.01071
%D 2022
%X   We introduce seven foundational principles for creating a culture of<br>constructive criticism in computational legal studies. Beginning by challenging<br>the current perception of papers as the primary scholarly output, we call for a<br>more comprehensive interpretation of publications. We then suggest to make<br>these publications computationally reproducible, releasing all of the data and<br>all of the code all of the time, on time, and in the most functioning form<br>possible. Subsequently, we invite constructive criticism in all phases of the<br>publication life cycle. We posit that our proposals will help form our field,<br>and float the idea of marking this maturity by the creation of a modern<br>flagship publication outlet for computational legal studies.<br>
%K Computer Science, Computers and Society, cs.CY,Computer Science, Computation and Language, cs.CL

Endnote

%0 Journal Article
%A Coupette, Corinna
%A Hartung, Dirk
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Rechtsstrukturvergleichung : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-108A-6
%R 10.1628/rabelsz-2022-0082
%7 2022
%D 2022
%J Rabels Zeitschrift für ausländisches und internationales Privatrecht 
%O RabelsZ
%V 86
%N 4
%& 935
%P 935 - 975

Endnote

%0 Conference Proceedings
%A Coupette, Corinna
%A Dalleiger, Sebastian
%A Vreeken, Jilles
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Differentially Describing Groups of Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-105C-B
%R 10.1609/aaai.v36i4.20312
%D 2022
%B 36th AAAI Conference on Artificial Intelligence
%Z date of event: 2022-02-22 - 2022-03-01
%C Virtual Conference
%B Proceedings of the 36th AAAI Conference on Artificial Intelligence
%P 3959 - 3967
%I AAAI
%@ 978-1-57735-876-3
%U https://ojs.aaai.org/index.php/AAAI/article/view/20312/20071

Endnote

%0 Journal Article
%A Coupette, Corinna
%A Hartung, Dirk
%A Beckedorf, Janis
%A Bother, Maximilian
%A Katz, Daniel Martin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Law Smells -  Defining and Detecting Problematic Patterns in Legal Drafting : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-CD04-B
%R 10.1007/s10506-022-09315-w
%7 2022
%D 2022
%J Artificial Intelligence and Law
%I Springer
%C New York, NY
%@ false

Endnote

%0 Report
%A Coupette, Corinna
%A Dalleiger, Sebastian
%A Vreeken, Jilles
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Differentially Describing Groups of Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-165D-4
%U https://arxiv.org/abs/2201.04064
%D 2022
%X   How does neural connectivity in autistic children differ from neural<br>connectivity in healthy children or autistic youths? What patterns in global<br>trade networks are shared across classes of goods, and how do these patterns<br>change over time? Answering questions like these requires us to differentially<br>describe groups of graphs: Given a set of graphs and a partition of these<br>graphs into groups, discover what graphs in one group have in common, how they<br>systematically differ from graphs in other groups, and how multiple groups of<br>graphs are related. We refer to this task as graph group analysis, which seeks<br>to describe similarities and differences between graph groups by means of<br>statistically significant subgraphs. To perform graph group analysis, we<br>introduce Gragra, which uses maximum entropy modeling to identify a<br>non-redundant set of subgraphs with statistically significant associations to<br>one or more graph groups. Through an extensive set of experiments on a wide<br>range of synthetic and real-world graph groups, we confirm that Gragra works<br>well in practice.<br>
%K cs.SI,Computer Science, Information Theory, cs.IT,Computer Science, Learning, cs.LG,Mathematics, Information Theory, math.IT

Endnote

%0 Journal Article
%A Croitoru, Cosmina
%A Croitoru, Madalina
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Indepth Combinatorial Analysis of Admissible Sets for Abstract Argumentation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-5D72-E
%R 10.1007/s10472-022-09785-3
%7 2022
%D 2022
%J Annals of Mathematics and Artificial Intelligence
%V 90
%& 1139
%P 1139 - 1158
%I Springer
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Cseh, Ágnes
%A Faenza, Yuri
%A Kavitha, Telikepalli
%A Powers, Vladlena
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Understanding Popular Matchings via Stable Matchings : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-57C3-8
%R 10.1137/19M124770X
%7 2022
%D 2022
%J SIAM Journal on Discrete Mathematics
%V 36
%N 1
%& 188
%P 188 - 213
%I The Society
%C Philadelphia, Pa.
%@ false

Endnote

%0 Conference Proceedings
%A Das, Debarati
%A Kociumaka, Tomasz
%A Saha, Barna
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1541-3
%R 10.4230/LIPIcs.ICALP.2022.49
%U urn:nbn:de:0030-drops-163902
%U https://drops.dagstuhl.de/opus/volltexte/2022/16390/
%D 2022
%B 49th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2022-07-04 - 2022-07-08
%C Paris, France
%B 49th EATCS International Conference on Automata, Languages, and Programming
%E Bojańczyk, Mikołaj; Merelli, Emanuela; Woodruff, David P.
%P 1 - 20
%Z sequence number: 49
%I Schloss Dagstuhl
%@ 978-3-95977-235-8
%B Leibniz International Proceedings in Informatics
%N 229

Endnote

%0 Conference Proceedings
%A Das, Debarati
%A Gilbert, Jacob
%A Hajiaghayi, MohammadTaghi
%A Kociumaka, Tomasz
%A Saha, Barna
%A Saleh, Hamed
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Õ(n + poly(k))-time Algorithm for Bounded Tree Edit Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-153D-9
%R 10.1109/FOCS54457.2022.00071
%D 2022
%B IEEE 63rd Annual Symposium on Foundations of Computer Science
%Z date of event: 2022-10-31 - 2022-11-03
%C Denver, CO, USA
%B FOCS 2022
%P 686 - 697
%I IEEE
%@ 978-1-6654-5519-0

Endnote

%0 Conference Proceedings
%A Esmer, Bariş Can
%A Kulik, Ariel
%A Marx, Dániel
%A Neuen, Daniel
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DA2-D
%R 10.4230/LIPIcs.ESA.2022.50
%U urn:nbn:de:0030-drops-169887
%U  https://drops.dagstuhl.de/opus/volltexte/2022/16988/
%D 2022
%B 30th Annual European Symposium on Algorithms
%Z date of event: 2022-09-05 - 2022-09-09
%C Berlin/Potsdam, Germany
%B 30th Annual European Symposium on Algorithms
%E Chechik, Shiri; Navarro, Gonzalo; Rotenberg, Eva; Herman, Grzegorz
%P 1 - 19
%Z sequence number: 50
%I Schloss Dagstuhl
%@ 978-3-95977-247-1
%B Leibniz International Proceedings in Informatics
%N 244
%@ false

Endnote

%0 Conference Proceedings
%A Esmer, Bariş Can
%A Kulik, Ariel
%A Marx, Dániel
%A Schepper, Philipp
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Computing Generalized Convolutions Faster Than Brute Force : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1EE6-0
%R 10.4230/LIPIcs.IPEC.2022.12
%U urn:nbn:de:0030-drops-173685
%U https://drops.dagstuhl.de/opus/volltexte/2022/17368/
%D 2022
%B 17th International Symposium on Parameterized and Exact Computation
%Z date of event: 2022-09-07 - 2022-09-09
%C Potsdam, Germany
%B 17th International Symposium on Parameterized and Exact Computation
%E Dell, Holger; Nederlof, Jesper
%P 1 - 22
%Z sequence number: 12
%I Schloss Dagstuhl
%@ 978-3-95977-260-0
%B Leibniz International Proceedings in Informatics
%N 249

Endnote

%0 Report
%A Esmer, Barış Can
%A Kulik, Ariel
%A Marx, Dániel
%A Neuen, Daniel
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Exponential-Time Approximation Algorithms Using Approximate
  Monotone Local Search : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1E6F-8
%U https://arxiv.org/abs/2206.13481
%D 2022
%X   We generalize the monotone local search approach of Fomin, Gaspers,<br>Lokshtanov and Saurabh [J.ACM 2019], by establishing a connection between<br>parameterized approximation and exponential-time approximation algorithms for<br>monotone subset minimization problems. In a monotone subset minimization<br>problem the input implicitly describes a non-empty set family over a universe<br>of size $n$ which is closed under taking supersets. The task is to find a<br>minimum cardinality set in this family. Broadly speaking, we use approximate<br>monotone local search to show that a parameterized $\alpha$-approximation<br>algorithm that runs in $c^k \cdot n^{O(1)}$ time, where $k$ is the solution<br>size, can be used to derive an $\alpha$-approximation randomized algorithm that<br>runs in $d^n \cdot n^{O(1)}$ time, where $d$ is the unique value in $d \in<br>(1,1+\frac{c-1}{\alpha})$ such that<br>$\mathcal{D}(\frac{1}{\alpha}\|\frac{d-1}{c-1})=\frac{\ln c}{\alpha}$ and<br>$\mathcal{D}(a \|b)$ is the Kullback-Leibler divergence. This running time<br>matches that of Fomin et al. for $\alpha=1$, and is strictly better when<br>$\alpha >1$, for any $c > 1$. Furthermore, we also show that this result can be<br>derandomized at the expense of a sub-exponential multiplicative factor in the<br>running time.<br>  We demonstrate the potential of approximate monotone local search by deriving<br>new and faster exponential approximation algorithms for Vertex Cover,<br>$3$-Hitting Set, Directed Feedback Vertex Set, Directed Subset Feedback Vertex<br>Set, Directed Odd Cycle Transversal and Undirected Multicut. For instance, we<br>get a $1.1$-approximation algorithm for Vertex Cover with running time $1.114^n<br>\cdot n^{O(1)}$, improving upon the previously best known $1.1$-approximation<br>running in time $1.127^n \cdot n^{O(1)}$ by Bourgeois et al. [DAM 2011].<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC

Endnote

%0 Conference Proceedings
%A Firman, Oksana
%A Spoerhase, Joachim
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Hypergraph Representation via Axis-Aligned Point-Subspace Cover : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-26B3-F
%R 10.1007/978-3-030-96731-4_27
%D 2022
%B 16th International Conference and Workshops on Algorithms and
Computation
%Z date of event: 2022-03-24 - 2022-03-26
%C Jember, Indonesia
%B WALCOM: Algorithms and Computation
%E Mutzel, Petra; Rahman, Md. Saidur; Slamin
%P 328 - 339
%I Springer
%@ 978-3-030-96730-7
%B Lecture Notes in Computer Science
%N 13174
%U https://rdcu.be/c21qy

Endnote

%0 Journal Article
%A Fomin, Fedor V.
%A Golovach, Petr A.
%A Lochet, William
%A Misra, Pranabendu
%A Saurabh, Saket
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Parameterized Complexity of Directed Spanner Problems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-BAB8-6
%R 10.1007/s00453-021-00911-x
%7 2021
%D 2022
%J Algorithmica
%V 84
%& 2292
%P 2292 - 2308
%I Springer-Verlag
%C New York
%@ false

Endnote

%0 Journal Article
%A Függer, Matthias
%A Kinali, Attila
%A Lenzen, Christoph
%A Wiederhake, Ben
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-201C-4
%R 10.1109/TCAD.2021.3097599
%7 2021
%D 2022
%J IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
%V 41
%N 8
%& 2518
%P 2518 - 2531
%I IEEE
%C Piscataway, NJ
%@ false

Endnote

%0 Conference Proceedings
%A Galby, Esther
%A Marx, Dániel
%A Schepper, Philipp
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Parameterized Complexity of Weighted Multicut in Trees : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-5925-8
%R 10.1007/978-3-031-15914-5_19
%D 2022
%B 48th International Workshop on Graph-Theoretic Concepts in Computer
   Science
%Z date of event: 2022-06-22 - 2022-06-24
%C Tübingen, Germany
%B Graph-Theoretic Concepts in Computer Science
%E Bekos, Michael A.; Kaufmann, Michael
%P 257 - 270
%I Springer
%@ 978-3-031-15913-8
%B Lecture Notes in Computer Science
%N 13453

Endnote

%0 Conference Proceedings
%A Galby, Esther
%A Marx, Dániel
%A Schepper, Philipp
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Domination and Cut Problems on Chordal Graphs with Bounded Leafage : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DB2-B
%R 10.4230/LIPIcs.IPEC.2022.14
%U urn:nbn:de:0030-drops-173704
%U https://drops.dagstuhl.de/opus/volltexte/2022/17370/
%D 2022
%B 17th International Symposium on Parameterized and Exact Computation
%Z date of event: 2022-09-07 - 2022-09-09
%C Potsdam, Germany
%B 17th International Symposium on Parameterized and Exact Computation
%E Dell, Holger; Nederlof, Jesper
%P 1 - 24
%Z sequence number: 14
%I Schloss Dagstuhl
%@ 978-3-95977-260-0
%B Leibniz International Proceedings in Informatics
%N 249

Endnote

%0 Conference Proceedings
%A Galby, Esther
%A Khazaliya, Liana
%A Mc Inerney, Fionn
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DB9-4
%R 10.4230/LIPIcs.MFCS.2022.51
%U urn:nbn:de:0030-drops-168496
%U https://drops.dagstuhl.de/opus/volltexte/2022/16849/
%D 2022
%B 47th International Symposium on Mathematical Foundations of Computer Science
%Z date of event: 2022-08-22 - 2022-08-26
%C Vienna, Austria
%B 47th International Symposium on Mathematical Foundations of Computer Science
%E Szeider, Stefan; Ganian, Robert; Silva, Alexandra
%P 1 - 15
%Z sequence number: 51
%I Schloss Dagstuhl
%@ 978-3-95977-256-3
%B Leibniz International Proceedings in Informatics
%N 241

Endnote

%0 Report
%A Galby, Esther
%A Marx, Dániel
%A Schepper, Philipp
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Parameterized Complexity of Weighted Multicut in Trees : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DC8-3
%U https://arxiv.org/abs/2205.10105
%D 2022
%X   The Edge Multicut problem is a classical cut problem where given an<br>undirected graph $G$, a set of pairs of vertices $\mathcal{P}$, and a budget<br>$k$, the goal is to determine if there is a set $S$ of at most $k$ edges such<br>that for each $(s,t) \in \mathcal{P}$, $G-S$ has no path from $s$ to $t$. Edge<br>Multicut has been relatively recently shown to be fixed-parameter tractable<br>(FPT), parameterized by $k$, by Marx and Razgon [SICOMP 2014], and<br>independently by Bousquet et al. [SICOMP 2018]. In the weighted version of the<br>problem, called Weighted Edge Multicut one is additionally given a weight<br>function $\mathtt{wt} : E(G) \to \mathbb{N}$ and a weight bound $w$, and the<br>goal is to determine if there is a solution of size at most $k$ and weight at<br>most $w$. Both the FPT algorithms for Edge Multicut by Marx et al. and Bousquet<br>et al. fail to generalize to the weighted setting. In fact, the weighted<br>problem is non-trivial even on trees and determining whether Weighted Edge<br>Multicut on trees is FPT was explicitly posed as an open problem by Bousquet et<br>al. [STACS 2009]. In this article, we answer this question positively by<br>designing an algorithm which uses a very recent result by Kim et al. [STOC<br>2022] about directed flow augmentation as subroutine.<br>  We also study a variant of this problem where there is no bound on the size<br>of the solution, but the parameter is a structural property of the input, for<br>example, the number of leaves of the tree. We strengthen our results by stating<br>them for the more general vertex deletion version.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC

Endnote

%0 Report
%A Galby, Esther
%A Marx, Dániel
%A Schepper, Philipp
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Domination and Cut Problems on Chordal Graphs with Bounded Leafage : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DF6-F
%U https://arxiv.org/abs/2208.02850
%D 2022
%X   The leafage of a chordal graph G is the minimum integer l such that G can be<br>realized as an intersection graph of subtrees of a tree with l leaves. We<br>consider structural parameterization by the leafage of classical domination and<br>cut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018,<br>Algorithmica 2020] proved, among other things, that Dominating Set on chordal<br>graphs admits an algorithm running in time $2^{O(l^2)} n^{O(1)}$. We present a<br>conceptually much simpler algorithm that runs in time $2^{O(l)} n^{O(1)}$. We<br>extend our approach to obtain similar results for Connected Dominating Set and<br>Steiner Tree. We then consider the two classical cut problems MultiCut with<br>Undeletable Terminals and Multiway Cut with Undeletable Terminals. We prove<br>that the former is W[1]-hard when parameterized by the leafage and complement<br>this result by presenting a simple $n^{O(l)}$-time algorithm. To our surprise,<br>we find that Multiway Cut with Undeletable Terminals on chordal graphs can be<br>solved, in contrast, in $n^{O(1)}$-time.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,

Endnote

%0 Report
%A Galby, Esther
%A Khazaliya, Liana
%A Inerney, Fionn Mc
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Metric Dimension Parameterized by Feedback Vertex Set and Other
  Structural Parameters : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DDF-A
%U https://arxiv.org/abs/2206.15424
%D 2022
%X   For a graph $G$, a subset $S \subseteq V(G)$ is called a \emph{resolving set}<br>if for any two vertices $u,v \in V(G)$, there exists a vertex $w \in S$ such<br>that $d(w,u) \neq d(w,v)$. The {\sc Metric Dimension} problem takes as input a<br>graph $G$ and a positive integer $k$, and asks whether there exists a resolving<br>set of size at most $k$. This problem was introduced in the 1970s and is known<br>to be NP-hard~[GT~61 in Garey and Johnson's book]. In the realm of<br>parameterized complexity, Hartung and Nichterlein~[CCC~2013] proved that the<br>problem is W[2]-hard when parameterized by the natural parameter $k$. They also<br>observed that it is FPT when parameterized by the vertex cover number and asked<br>about its complexity under \emph{smaller} parameters, in particular the<br>feedback vertex set number. We answer this question by proving that {\sc Metric<br>Dimension} is W[1]-hard when parameterized by the feedback vertex set number.<br>This also improves the result of Bonnet and Purohit~[IPEC 2019] which states<br>that the problem is W[1]-hard parameterized by the treewidth. Regarding the<br>parameterization by the vertex cover number, we prove that {\sc Metric<br>Dimension} does not admit a polynomial kernel under this parameterization<br>unless $NP\subseteq coNP/poly$. We observe that a similar result holds when the<br>parameter is the distance to clique. On the positive side, we show that {\sc<br>Metric Dimension} is FPT when parameterized by either the distance to cluster<br>or the distance to co-cluster, both of which are smaller parameters than the<br>vertex cover number.<br>
%K Computer Science, Discrete Mathematics, cs.DM,Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Report
%A Galby, Esther
%A Kisfaludi-Bak, Sándor
%A Marx, Dániel
%A Sharma, Roohani
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1E72-3
%U https://arxiv.org/abs/2208.06015
%D 2022
%X   In the Directed Steiner Network problem, the input is a directed graph G, a<br>subset T of k vertices of G called the terminals, and a demand graph D on T.<br>The task is to find a subgraph H of G with the minimum number of edges such<br>that for every edge (s,t) in D, the solution H contains a directed s to t path.<br>In this paper we investigate how the complexity of the problem depends on the<br>demand pattern when G is planar. Formally, if \mathcal{D} is a class of<br>directed graphs closed under identification of vertices, then the<br>\mathcal{D}-Steiner Network (\mathcal{D}-SN) problem is the special case where<br>the demand graph D is restricted to be from \mathcal{D}. For general graphs,<br>Feldmann and Marx [ICALP 2016] characterized those families of demand graphs<br>where the problem is fixed-parameter tractable (FPT) parameterized by the<br>number k of terminals. They showed that if \mathcal{D} is a superset of one of<br>the five hard families, then \mathcal{D}-SN is W[1]-hard parameterized by k,<br>otherwise it can be solved in time f(k)n^{O(1)}.<br>  For planar graphs an interesting question is whether the W[1]-hard cases can<br>be solved by subexponential parameterized algorithms. Chitnis et al. [SICOMP<br>2020] showed that, assuming the ETH, there is no f(k)n^{o(k)} time algorithm<br>for the general \mathcal{D}-SN problem on planar graphs, but the special case<br>called Strongly Connected Steiner Subgraph can be solved in time f(k)<br>n^{O(\sqrt{k})} on planar graphs. We present a far-reaching generalization and<br>unification of these two results: we give a complete characterization of the<br>behavior of every $\mathcal{D}$-SN problem on planar graphs. We show that<br>assuming ETH, either the problem is (1) solvable in time 2^{O(k)}n^{O(1)}, and<br>not in time 2^{o(k)}n^{O(1)}, or (2) solvable in time f(k)n^{O(\sqrt{k})}, but<br>not in time f(k)n^{o(\sqrt{k})}, or (3) solvable in time f(k)n^{O(k)}, but not<br>in time f(k)n^{o({k})}.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,

Endnote

%0 Report
%A Gao, Yuan
%A Kamkari, Hamidreza
%A Karrenbauer, Andreas
%A Mehlhorn, Kurt
%A Sharifi, Mohammadamin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Physarum Inspired Dynamics to Solve Semi-Definite Programs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B656-9
%U https://arxiv.org/abs/2111.02291
%D 2022
%X   Physarum Polycephalum is a Slime mold that can solve the shortest path<br>problem. A mathematical model based on the Physarum's behavior, known as the<br>Physarum Directed Dynamics, can solve positive linear programs. In this paper,<br>we will propose a Physarum based dynamic based on the previous work and<br>introduce a new way to solve positive Semi-Definite Programming (SDP) problems,<br>which are more general than positive linear programs. Empirical results suggest<br>that this extension of the dynamic can solve the positive SDP showing that the<br>nature-inspired algorithm can solve one of the hardest problems in the<br>polynomial domain. In this work, we will formulate an accurate algorithm to<br>solve positive and some non-negative SDPs and formally prove some key<br>characteristics of this solver thus inspiring future work to try and refine<br>this method.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Optimization and Control, math.OC

Endnote

%0 Conference Proceedings
%A Giliberti, Jeff
%A Karrenbauer, Andreas
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Improved Online Algorithm for Fractional Knapsack in the Random Order Model : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-11BF-A
%R 10.1007/978-3-030-92702-8_12
%D 2022
%B 19th Workshop on Approximation and Online Algorithms
%Z date of event: 2021-09-06 - 2021-09-10
%C Lisbon, Portugal
%B Approximation and Online Algorithms
%E Koenemann, Jochen; Preis, Britta
%P 188 - 205
%I Springer
%@ 978-3-030-92701-1 
%B Lecture Notes in Computer Science
%N 12982

Endnote

%0 Conference Proceedings
%A Goldenberg, Elazar
%A Kociumaka, Tomasz
%A Krauthgamer, Robert
%A Saha, Barna
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1578-6
%R 10.1109/FOCS54457.2022.00070
%D 2022
%B IEEE 63rd Annual Symposium on Foundations of Computer Science
%Z date of event: 2022-10-31 - 2022-11-03
%C Denver, CO, USA
%B FOCS 2022
%P 674 - 685
%I IEEE
%@ 978-1-6654-5519-0

Endnote

%0 Report
%A Gouleakis, Themis
%A Lakis, Konstantinos
%A Shahkarami, Golnoosh
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Learning-Augmented Algorithms for Online TSP on the Line : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1FCC-D
%U https://arxiv.org/abs/2206.00655
%D 2022
%X   We study the online Traveling Salesman Problem (TSP) on the line augmented<br>with machine-learned predictions. In the classical problem, there is a stream<br>of requests released over time along the real line. The goal is to minimize the<br>makespan of the algorithm. We distinguish between the open variant and the<br>closed one, in which we additionally require the algorithm to return to the<br>origin after serving all requests. The state of the art is a $1.64$-competitive<br>algorithm and a $2.04$-competitive algorithm for the closed and open variants,<br>respectively \cite{Bjelde:1.64}. In both cases, a tight lower bound is known<br>\cite{Ausiello:1.75, Bjelde:1.64}.<br>  In both variants, our primary prediction model involves predicted positions<br>of the requests. We introduce algorithms that (i) obtain a tight 1.5<br>competitive ratio for the closed variant and a 1.66 competitive ratio for the<br>open variant in the case of perfect predictions, (ii) are robust against<br>unbounded prediction error, and (iii) are smooth, i.e., their performance<br>degrades gracefully as the prediction error increases.<br>  Moreover, we further investigate the learning-augmented setting in the open<br>variant by additionally considering a prediction for the last request served by<br>the optimal offline algorithm. Our algorithm for this enhanced setting obtains<br>a 1.33 competitive ratio with perfect predictions while also being smooth and<br>robust, beating the lower bound of 1.44 we show for our original prediction<br>setting for the open variant. Also, we provide a lower bound of 1.25 for this<br>enhanced setting.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Learning, cs.LG

Endnote

%0 Report
%A Gutowski, Grzegorz
%A Mittelstädt, Florian
%A Rutter, Ignaz
%A Spoerhase, Joachim
%A Wolff, Alexander
%A Zink, Johannes
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Coloring Mixed and Directional Interval Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-269B-B
%U https://arxiv.org/abs/2208.14250
%D 2022
%X   A mixed graph has a set of vertices, a set of undirected egdes, and a set of<br>directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that<br>assigns to each vertex in $G$ a positive integer such that, for each edge $uv$<br>in $G$, $c(u) \ne c(v)$ and, for each arc $uv$ in $G$, $c(u) < c(v)$. For a<br>mixed graph $G$, the chromatic number $\chi(G)$ is the smallest number of<br>colors in any proper coloring of $G$. A directional interval graph is a mixed<br>graph whose vertices correspond to intervals on the real line. Such a graph has<br>an edge between every two intervals where one is contained in the other and an<br>arc between every two overlapping intervals, directed towards the interval that<br>starts and ends to the right.<br>  Coloring such graphs has applications in routing edges in layered orthogonal<br>graph drawing according to the Sugiyama framework; the colors correspond to the<br>tracks for routing the edges. We show how to recognize directional interval<br>graphs, and how to compute their chromatic number efficiently. On the other<br>hand, for mixed interval graphs, i.e., graphs where two intersecting intervals<br>can be connected by an edge or by an arc in either direction arbitrarily, we<br>prove that computing the chromatic number is NP-hard.<br>
%K Computer Science, Discrete Mathematics, cs.DM

Endnote

%0 Journal Article
%A Halperin, Dan
%A Har-Peled, Sariel
%A Mehlhorn, Kurt
%A Oh, Eunjin
%A Sharir, Micha
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T The Maximum-Level Vertex in an Arrangement of Lines : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-D020-7
%R 10.1007/s00454-021-00338-9
%7 2022
%D 2022
%J Discrete & Computational Geometry
%V 67
%& 439
%P 439 - 461
%I Springer
%C New York, NY
%@ false
%U https://rdcu.be/cFlQF

Endnote

%0 Conference Proceedings
%A Han, Insu
%A Zandieh, Amir
%A Lee, Jaehoon
%A Novak, Roman
%A Xiao, Lechao
%A Karbasi, Amin
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Fast Neural Kernel Embeddings for General Activations : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-90F3-E
%D 2022
%B 36th Conference on Neural Information Processing Systems
%Z date of event: 2022-11-28 - 2022-12-09
%C New Orleans, LA, USA
%B Advances in Neural Information Processing Systems 35
%E Koyejo, S.; Mohamed, S.; Agarwal, A.; Belgrave, D.; Cho, K.; Oh, A.
%P 35657 - 35671
%I Curran Associates, Inc.
%U https://openreview.net/pdf?id=yLilJ1vZgMe

Endnote

%0 Conference Proceedings
%A Han, Insu
%A Zandieh, Amir
%A Avron, Haim
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Random Gegenbauer Features for Scalable Kernel Methods : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-90FB-6
%U https://proceedings.mlr.press/v162/han22g.html
%D 2022
%B 39th International Conference on Machine Learning
%Z date of event: 2022-07-17 - 2022-07-23
%C Baltimore, MA, USA
%B Proceedings of the 39th International Conference on Machine Learning
%E Chaudhuri, Kamalika; Jegelka, Stefanie; Le, Song; Csaba, Szepesvari; Gang, Niu; Sabato, Sivan
%P 8330 - 8358
%B Proceedings of the Machine Learning Research
%N 162
%@ false

Endnote

%0 Report
%A Hatzel, Meike
%A Jaffke, Lars
%A Lima, Paloma T.
%A Masařík, Tomáš
%A Pilipczuk, Marcin
%A Sharma, Roohani
%A Sorge, Manuel
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Fixed-Parameter Tractability of Directed Multicut with Three Terminal
Pairs Parameterized by the Size of the Cutset: Twin-width Meets
Flow-Augmentation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DE8-F
%U https://arxiv.org/abs/2207.07425
%D 2022
%X   We show fixed-parameter tractability of the Directed Multicut problem with<br>three terminal pairs (with a randomized algorithm). This problem, given a<br>directed graph $G$, pairs of vertices (called terminals) $(s_1,t_1)$,<br>$(s_2,t_2)$, and $(s_3,t_3)$, and an integer $k$, asks to find a set of at most<br>$k$ non-terminal vertices in $G$ that intersect all $s_1t_1$-paths, all<br>$s_2t_2$-paths, and all $s_3t_3$-paths. The parameterized complexity of this<br>case has been open since Chitnis, Cygan, Hajiaghayi, and Marx proved<br>fixed-parameter tractability of the 2-terminal-pairs case at SODA 2012, and<br>Pilipczuk and Wahlstr\"{o}m proved the W[1]-hardness of the 4-terminal-pairs<br>case at SODA 2016.<br>  On the technical side, we use two recent developments in parameterized<br>algorithms. Using the technique of directed flow-augmentation [Kim, Kratsch,<br>Pilipczuk, Wahlstr\"{o}m, STOC 2022] we cast the problem as a CSP problem with<br>few variables and constraints over a large ordered domain.We observe that this<br>problem can be in turn encoded as an FO model-checking task over a structure<br>consisting of a few 0-1 matrices. We look at this problem through the lenses of<br>twin-width, a recently introduced structural parameter [Bonnet, Kim,<br>Thomass\'{e}, Watrigant, FOCS 2020]: By a recent characterization [Bonnet,<br>Giocanti, Ossona de Mendes, Simon, Thomass\'{e}, Toru\'{n}czyk, STOC 2022] the<br>said FO model-checking task can be done in FPT time if the said matrices have<br>bounded grid rank. To complete the proof, we show an irrelevant vertex rule: If<br>any of the matrices in the said encoding has a large grid minor, a vertex<br>corresponding to the ``middle'' box in the grid minor can be proclaimed<br>irrelevant -- not contained in the sought solution -- and thus reduced.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Report
%A Jaffke, Lars
%A Lima, Paloma T.
%A Sharma, Roohani
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T b-Coloring Parameterized by Pathwidth is XNLP-complete : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1E7E-7
%U https://arxiv.org/abs/2209.07772
%D 2022
%X   We show that the $b$-Coloring problem is complete for the class XNLP when<br>parameterized by the pathwidth of the input graph. Besides determining the<br>precise parameterized complexity of this problem, this implies that b-Coloring<br>parameterized by pathwidth is $W[t]$-hard for all $t$, and resolves the<br>parameterized complexity of $b$-Coloring parameterized by treewidth.<br>
%K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Jiang, Yonggang
%A Zheng, Chaodong
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Robust and Optimal Contention Resolution without Collision Detection : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-104C-D
%R 10.1145/3490148.3538592
%D 2022
%B 34th ACM Symposium on Parallelism in Algorithms and Architectures
%Z date of event: 2022-07-11 - 2022-07-14
%C Philadelphia, PA, USA 
%B SPAA '22
%E Agrawal, Kunal; Lee, I-Ting Angelina
%P 107 - 118
%I ACM
%@ 978-1-4503-9146-7

Endnote

%0 Report
%A Kim, Eun Jung
%A Masařík, Tomáš
%A Pilipczuk, Marcin
%A Sharma, Roohani
%A Wahlström, Magnus
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T On Weighted Graph Separation Problems and Flow-Augmentation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1E78-D
%U https://arxiv.org/abs/2208.14841
%D 2022
%X   One of the first application of the recently introduced technique of<br>\emph{flow-augmentation} [Kim et al., STOC 2022] is a fixed-parameter algorithm<br>for the weighted version of \textsc{Directed Feedback Vertex Set}, a landmark<br>problem in parameterized complexity. In this note we explore applicability of<br>flow-augmentation to other weighted graph separation problems parameterized by<br>the size of the cutset. We show the following. -- In weighted undirected graphs<br>\textsc{Multicut} is FPT, both in the edge- and vertex-deletion version. -- The<br>weighted version of \textsc{Group Feedback Vertex Set} is FPT, even with an<br>oracle access to group operations. -- The weighted version of \textsc{Directed<br>Subset Feedback Vertex Set} is FPT. Our study reveals \textsc{Directed<br>Symmetric Multicut} as the next important graph separation problem whose<br>parameterized complexity remains unknown, even in the unweighted setting.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,

Endnote

%0 Thesis
%A Kinali-Dogan, Attila
%Y Lenzen, Christoph
%A referee: Mehlhorn, Kurt
%A referee: Vernotte, Francoise
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T On Time, Time Synchronization and Noise in Time Measurement Systems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-5436-A
%I Universität des Saarlandes
%C Saarbrücken
%D 2022
%P 140 p.
%V phd
%9 phd

Endnote

%0 Journal Article
%A Kirkpatrick, David
%A Simon, Hans U.
%A Zilles, Sandra
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Optimal Collusion-Free Teaching : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-332F-7
%D 2022
%X   Formal models of learning from teachers need to respect certain criteria to<br>avoid collusion. The most commonly accepted notion of collusion-freeness was<br>proposed by Goldman and Mathias (1996), and various teaching models obeying<br>their criterion have been studied. For each model $M$ and each concept class<br>$\mathcal{C}$, a parameter $M$-$\mathrm{TD}(\mathcal{C})$ refers to the<br>teaching dimension of concept class $\mathcal{C}$ in model $M$---defined to be<br>the number of examples required for teaching a concept, in the worst case over<br>all concepts in $\mathcal{C}$.<br>  This paper introduces a new model of teaching, called no-clash teaching,<br>together with the corresponding parameter $\mathrm{NCTD}(\mathcal{C})$.<br>No-clash teaching is provably optimal in the strong sense that, given any<br>concept class $\mathcal{C}$ and any model $M$ obeying Goldman and Mathias's<br>collusion-freeness criterion, one obtains $\mathrm{NCTD}(\mathcal{C})\le<br>M$-$\mathrm{TD}(\mathcal{C})$. We also study a corresponding notion<br>$\mathrm{NCTD}^+$ for the case of learning from positive data only, establish<br>useful bounds on $\mathrm{NCTD}$ and $\mathrm{NCTD}^+$, and discuss relations<br>of these parameters to the VC-dimension and to sample compression.<br>  In addition to formulating an optimal model of collusion-free teaching, our<br>main results are on the computational complexity of deciding whether<br>$\mathrm{NCTD}^+(\mathcal{C})=k$ (or $\mathrm{NCTD}(\mathcal{C})=k$) for given<br>$\mathcal{C}$ and $k$. We show some such decision problems to be equivalent to<br>the existence question for certain constrained matchings in bipartite graphs.<br>Our NP-hardness results for the latter are of independent interest in the study<br>of constrained graph matchings.<br>
%K Computer Science, Learning, cs.LG,Statistics, Machine Learning, stat.ML
%J Journal of Machine Learning Research
%I JMLR.org
%@ false

Endnote

%0 Conference Proceedings
%A Kisfaludi-Bak, Sándor
%A Nederlof, Jesper
%A Węgrzycki, Karol
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Gap-ETH-Tight Approximation Scheme for Euclidean TSP : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-C557-6
%R 10.1109/FOCS52979.2021.00043
%D 2022
%B IEEE 62nd Annual Symposium on Foundations of Computer Science
%Z date of event: 2022-02-07 - 2022-02-10
%C Denver, CO, USA (Virtual Conference)
%B FOCS 2021
%P 351 - 362
%I IEEE
%@ 978-1-6654-2055-6

Endnote

%0 Conference Proceedings
%A Kociumaka, Tomasz
%A Navarro, Gonzalo
%A Olivares, Francisco
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Near-Optimal Search Time in δ-Optimal Space : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1534-2
%R 10.1007/978-3-031-20624-5_6
%D 2022
%B 5th Latin American Theoretical Informatics Symposium
%Z date of event: 2022-11-07 - 2022-11-11
%C Guanajuato, Mexico
%B LATIN 2022: Theoretical Informatics
%E Castañeda, Armando; Rodríguez-Henríquez, Francisco
%P 88 - 103
%I Springer
%@ 978-3-031-20623-8
%B Lecture Notes in Computer Science
%N 13568
%U https://rdcu.be/c19vn

Endnote

%0 Journal Article
%A Kociumaka, Tomasz
%A Navarro, Gonzalo
%A Prezza, Nicola
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Toward a Definitive Compressibility Measure for Repetitive Sequences : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-150A-2
%R 10.1109/TIT.2022.3224382
%7 2022
%D 2022
%J IEEE Transactions on Information Theory
%V 69
%N 4
%& 2074
%P 2074 - 2092
%I IEEE
%C Piscataway, NJ
%@ false

Endnote

%0 Conference Proceedings
%A Krithika, R.
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T The Complexity of Contracting Bipartite Graphs into Small Cycles  : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000B-5928-5
%R 10.1007/978-3-031-15914-5_26
%D 2022
%B 48th International Workshop on Graph-Theoretic Concepts in Computer
   Science
%Z date of event: 2022-06-22 - 2022-06-24
%C Tübingen, Germany
%B Graph-Theoretic Concepts in Computer Science
%E Bekos, Michael A.; Kaufmann, Michael
%P 356 - 369
%I Springer
%@ 978-3-031-15913-8
%B Lecture Notes in Computer Science
%N 13453

Endnote

%0 Report
%A Krithika, R.
%A Sharma, Roohani
%A Tale, Prafullkumar
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T The Complexity of Contracting Bipartite Graphs into Small Cycles : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1DCB-0
%U https://arxiv.org/abs/2206.07358
%D 2022
%X   For a positive integer $\ell \geq 3$, the $C_\ell$-Contractibility problem<br>takes as input an undirected simple graph $G$ and determines whether $G$ can be<br>transformed into a graph isomorphic to $C_\ell$ (the induced cycle on $\ell$<br>vertices) using only edge contractions. Brouwer and Veldman [JGT 1987] showed<br>that $C_4$-Contractibility is NP-complete in general graphs. It is easy to<br>verify that $C_3$-Contractibility is polynomial-time solvable. Dabrowski and<br>Paulusma [IPL 2017] showed that $C_{\ell}$-Contractibility is \NP-complete\ on<br>bipartite graphs for $\ell = 6$ and posed as open problems the status of the<br>problem when $\ell$ is 4 or 5. In this paper, we show that both<br>$C_5$-Contractibility and $C_4$-Contractibility are NP-complete on bipartite<br>graphs.<br>
%K Computer Science, Computational Complexity, cs.CC

Endnote

%0 Conference Proceedings
%A Künnemann, Marvin
%A Nusser, André
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1F8F-2
%R 10.1137/1.9781611977073
%D 2022
%B Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2022-01-09 - 2022-01-12
%C Virtual
%B Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
%E Naor, Seffi; Buchbinder, Niv
%P 3181 - 3201
%I SIAM
%@ 978-1-61197-707-3

Endnote

%0 Report
%A Li, Jason
%A Nanongkai, Danupon
%A Panigrahi, Debmalya
%A Saranurak, Thatchaphol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Near-Linear Time Approximations for Cut Problems via Fair Cuts : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000E-6DA9-A
%U https://arxiv.org/abs/2203.00751
%D 2022
%X   We introduce the notion of {\em fair cuts} as an approach to leverage<br>approximate $(s,t)$-mincut (equivalently $(s,t)$-maxflow) algorithms in<br>undirected graphs to obtain near-linear time approximation algorithms for<br>several cut problems. Informally, for any $\alpha\geq 1$, an $\alpha$-fair<br>$(s,t)$-cut is an $(s,t)$-cut such that there exists an $(s,t)$-flow that uses<br>$1/\alpha$ fraction of the capacity of \emph{every} edge in the cut. (So, any<br>$\alpha$-fair cut is also an $\alpha$-approximate mincut, but not vice-versa.)<br>We give an algorithm for $(1+\epsilon)$-fair $(s,t)$-cut in<br>$\tilde{O}(m)$-time, thereby matching the best runtime for<br>$(1+\epsilon)$-approximate $(s,t)$-mincut [Peng, SODA '16]. We then demonstrate<br>the power of this approach by showing that this result almost immediately leads<br>to several applications:<br>  - the first nearly-linear time $(1+\epsilon)$-approximation algorithm that<br>computes all-pairs maxflow values (by constructing an approximate Gomory-Hu<br>tree). Prior to our work, such a result was not known even for the special case<br>of Steiner mincut [Dinitz and Vainstein, STOC '94; Cole and Hariharan, STOC<br>'03];<br>  - the first almost-linear-work subpolynomial-depth parallel algorithms for<br>computing $(1+\epsilon)$-approximations for all-pairs maxflow values (again via<br>an approximate Gomory-Hu tree) in unweighted graphs;<br>  - the first near-linear time expander decomposition algorithm that works even<br>when the expansion parameter is polynomially small; this subsumes previous<br>incomparable algorithms [Nanongkai and Saranurak, FOCS '17; Wulff-Nilsen, FOCS<br>'17; Saranurak and Wang, SODA '19].<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Mansouri, Farnam
%A Simon, Hans U.
%A Singla, Adish
%A Zilles, Sandra
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T On Batch Teaching with Sample Complexity Bounded by VCD : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1601-A
%D 2022
%B 36th Conference on Neural Information Processing Systems
%Z date of event: 2022-11-28 - 2022-12-09
%C New Orleans, LA, USA
%B Advances in Neural Information Processing Systems 35
%E Koyejo, S.; Mohamed, S.; Agarwal, A.; Belgrave, D.; Cho, K.; Oh, A.
%P 15732 - 15742
%I Curran Associates, Inc
%U https://openreview.net/pdf?id=wKf5dRSartn

Endnote

%0 Conference Proceedings
%A Nederlof, Jesper
%A Pilipczuk, Michał
%A Swennenhuis, Céline M. F.
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Isolation Schemes for Problems on Decomposable Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1EEC-A
%R 10.4230/LIPIcs.STACS.2022.50
%U urn:nbn:de:0030-drops-158601
%D 2022
%B 39th International Symposium on Theoretical Aspects of Computer Science
%Z date of event: 2022-03-15 - 2022-03-18
%C Marseille, France (Virtual Conference)
%B 39th International Symposium on Theoretical Aspects of Computer Science
%E Berenbrink, Petra; Monmege, Benjamin
%P 1 - 20
%Z sequence number: 50
%I Schloss Dagstuhl
%@ 978-3-95977-222-8
%B Leibniz International Proceedings in Informatics
%N 219
%@ false

Endnote

%0 Report
%A Nederlof, Jesper
%A Swennenhuis, Céline M. F.
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Makespan Scheduling of Unit Jobs with Precedence Constraints in
O(1.995n) time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1F35-7
%U https://arxiv.org/abs/2208.02664
%D 2022
%X   In a classical scheduling problem, we are given a set of $n$ jobs of unit<br>length along with precedence constraints and the goal is to find a schedule of<br>these jobs on $m$ identical machines that minimizes the makespan. This problem<br>is well-known to be NP-hard for an unbounded number of machines. Using standard<br>3-field notation, it is known as $P|\text{prec}, p_j=1|C_{\max}$.<br>  We present an algorithm for this problem that runs in $O(1.995^n)$ time.<br>Before our work, even for $m=3$ machines the best known algorithms ran in<br>$O^\ast(2^n)$ time. In contrast, our algorithm works when the number of<br>machines $m$ is unbounded. A crucial ingredient of our approach is an algorithm<br>with a runtime that is only single-exponential in the vertex cover of the<br>comparability graph of the precedence constraint graph. This heavily relies on<br>insights from a classical result by Dolev and Warmuth (Journal of Algorithms<br>1984) for precedence graphs without long chains.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Thesis
%A Nusser, André
%Y Bringmann, Karl
%A referee: Mehlhorn, Kurt
%A referee: Chan, Timothy
%A referee: de Ber, Mark
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Fine-Grained Complexity and Algorithm Engineering of Geometric Similarity Measures : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-2693-3
%R 10.22028/D291-37018
%U urn:nbn:de:bsz:291--ds-370184
%F OTHER: hdl:20.500.11880/33904
%I Universität des Saarlandes
%C Saarbrücken
%D 2022
%P XIV, 210 p.
%V phd
%9 phd
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/33904

Endnote

%0 Journal Article
%A Ray Chaudhury, Bhaskar
%A Cheung, Yun Kuen
%A Garg, Jugal
%A Garg, Naveen
%A Hoefer, Martin
%A Mehlhorn, Kurt
%+ External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fair Division of Indivisible Goods for a Class of Concave Valuations : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-9DB8-6
%R 10.1613/jair.1.12911
%7 2022
%D 2022
%J Journal of Artificial Intelligence Research
%V 74
%& 111
%P 111 - 142
%I AI Access Foundation
%C S.l.
%@ false

Endnote

%0 Journal Article
%A Roth, Marc
%A Schmitt, Johannes
%A Wellnitz, Philip
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Counting Small Induced Subgraphs Satisfying Monotone Properties : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1EB6-6
%R 10.1137/20M1365624
%7 2022
%D 2022
%J SIAM Journal on Computing
%& FOCS20-139
%P FOCS20-139 - FOCS20-174
%I SIAM
%C Philadelphia, PA
%@ false

Endnote

%0 Thesis
%A Wiederhake, Ben
%Y Lenzen, Christoph
%A referee: Mehlhorn, Kurt
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Pulse Propagation, Graph Cover,
and Packet Forwarding : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-CEBE-9
%R 10.22028/D291-36608 
%U nbn:de:bsz:291--ds-366085
%F OTHER: hdl:20.500.11880/33316
%I Universität des Saarlandes
%C Saarbrücken
%D 2022
%P 83 p.
%V phd
%9 phd
%X We study distributed systems, with a particular focus on graph problems and fault<br>tolerance.<br>Fault-tolerance in a microprocessor or even System-on-Chip can be improved by using<br>a fault-tolerant pulse propagation design. The existing design TRIX achieves this goal<br>by being a distributed system consisting of very simple nodes. We show that even in<br>the typical mode of operation without faults, TRIX performs significantly better than a<br>regular wire or clock tree: Statistical evaluation of our simulated experiments show that<br>we achieve a skew with standard deviation of O(log log H), where H is the height of the<br>TRIX grid.<br>The distance-r generalization of classic graph problems can give us insights on how<br>distance affects hardness of a problem. For the distance-r dominating set problem, we<br>present both an algorithmic upper and unconditional lower bound for any graph class<br>with certain high-girth and sparseness criteria. In particular, our algorithm achieves a<br>O(r &#183; f(r))-approximation in time O(r), where f is the expansion function, which correlates<br>with density. For constant r, this implies a constant approximation factor, in constant<br>time. We also show that no algorithm can achieve a (2r + 1 &#8722; &#948;)-approximation for any<br>&#948; > 0 in time O(r), not even on the class of cycles of girth at least 5r. Furthermore, we<br>extend the algorithm to related graph cover problems and even to a different execution<br>model.<br>Furthermore, we investigate the problem of packet forwarding, which addresses the<br>question of how and when best to forward packets in a distributed system. These packets<br>are injected by an adversary. We build on the existing algorithm OED to handle more<br>than a single destination. In particular, we show that buffers of size O(log n) are sufficient<br>for this algorithm, in contrast to O(n) for the naive approach.
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/33316

Endnote

%0 Conference Proceedings
%A Woodruff, David
%A Zandieh, Amir
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-9101-E
%U https://proceedings.mlr.press/v162/woodruff22a.html
%D 2022
%B 39th International Conference on Machine Learning
%Z date of event: 2022-07-17 - 2022-07-23
%C Baltimore, MA, USA
%B Proceedings of the 39th International Conference on Machine Learning
%E Chaudhuri, Kamalika; Jegelka, Stefanie; Le, Song; Csaba, Szepesvari; Gang, Niu; Sabato, Sivan
%P 23933 - 23964
%B Proceedings of the Machine Learning Research
%N 162
%@ false

Endnote

%0 Report
%A Zandieh, Amir
%A Han, Insu
%A Avron, Haim
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Near Optimal Reconstruction of Spherical Harmonic Expansions : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-9105-A
%U https://arxiv.org/abs/2202.12995
%D 2022
%X   We propose an algorithm for robust recovery of the spherical harmonic<br>expansion of functions defined on the d-dimensional unit sphere<br>$\mathbb{S}^{d-1}$ using a near-optimal number of function evaluations. We show<br>that for any $f \in L^2(\mathbb{S}^{d-1})$, the number of evaluations of $f$<br>needed to recover its degree-$q$ spherical harmonic expansion equals the<br>dimension of the space of spherical harmonics of degree at most $q$ up to a<br>logarithmic factor. Moreover, we develop a simple yet efficient algorithm to<br>recover degree-$q$ expansion of $f$ by only evaluating the function on<br>uniformly sampled points on $\mathbb{S}^{d-1}$. Our algorithm is based on the<br>connections between spherical harmonics and Gegenbauer polynomials and leverage<br>score sampling methods. Unlike the prior results on fast spherical harmonic<br>transform, our proposed algorithm works efficiently using a nearly optimal<br>number of samples in any dimension d. We further illustrate the empirical<br>performance of our algorithm on numerical examples.<br>
%K Mathematics, Numerical Analysis, math.NA,Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Learning, cs.LG,Computer Science, Numerical Analysis, cs.NA,eess.SP

Endnote

%0 Report
%A Akrami, Hannaneh
%A Ray Chaudhury, Bhaskar
%A Hoefer, Martin
%A Mehlhorn, Kurt
%A Schmalhofer, Marco
%A Shahkarami, Golnoosh
%A Varricchio, Giovanna
%A Vermande, Quentin
%A van Wijland, Ernest
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Maximizing Nash Social Welfare in 2-Value Instances : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-2000-F
%U https://arxiv.org/abs/2107.08965
%D 2021
%X   We consider the problem of maximizing the Nash social welfare when allocating<br>a set $\mathcal{G}$ of indivisible goods to a set $\mathcal{N}$ of agents. We<br>study instances, in which all agents have 2-value additive valuations: The<br>value of every agent $i \in \mathcal{N}$ for every good $j \in \mathcal{G}$ is<br>$v_{ij} \in \{p,q\}$, for $p,q \in \mathbb{N}$, $p \le q$. Maybe surprisingly,<br>we design an algorithm to compute an optimal allocation in polynomial time if<br>$p$ divides $q$, i.e., when $p=1$ and $q \in \mathbb{N}$ after appropriate<br>scaling. The problem is \classNP-hard whenever $p$ and $q$ are coprime and $p<br>\ge 3$.<br>  In terms of approximation, we present positive and negative results for<br>general $p$ and $q$. We show that our algorithm obtains an approximation ratio<br>of at most 1.0345. Moreover, we prove that the problem is \classAPX-hard, with<br>a lower bound of $1.000015$ achieved at $p/q = 4/5$.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT

Endnote

%0 Report
%A Akrami, Hannaneh
%A Ray Chaudhury, Bhaskar
%A Mehlhorn, Kurt
%A Shahkarami, Golnoosh
%A Vermande, Quentin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Nash Social Welfare for 2-value Instances : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-DB45-4
%U https://arxiv.org/abs/2106.14816
%D 2021
%X   We study the problem of allocating a set of indivisible goods among agents<br>with 2-value additive valuations. Our goal is to find an allocation with<br>maximum Nash social welfare, i.e., the geometric mean of the valuations of the<br>agents. We give a polynomial-time algorithm to find a Nash social welfare<br>maximizing allocation when the valuation functions are integrally 2-valued,<br>i.e., each agent has a value either $1$ or $p$ for each good, for some positive<br>integer $p$. We then extend our algorithm to find a better approximation factor<br>for general 2-value instances.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT

Endnote

%0 Report
%A Amanatidis, Georgios
%A Kleer, Pieter
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B839-8
%U https://arxiv.org/abs/2110.09068
%D 2021
%X   The approximate uniform sampling of graphs with a given degree sequence is a<br>well-known, extensively studied problem in theoretical computer science and has<br>significant applications, e.g., in the analysis of social networks. In this<br>work we study an extension of the problem, where degree intervals are specified<br>rather than a single degree sequence. We are interested in sampling and<br>counting graphs whose degree sequences satisfy the degree interval constraints.<br>A natural scenario where this problem arises is in hypothesis testing on social<br>networks that are only partially observed.<br>  In this work, we provide the first fully polynomial almost uniform sampler<br>(FPAUS) as well as the first fully polynomial randomized approximation scheme<br>(FPRAS) for sampling and counting, respectively, graphs with near-regular<br>degree intervals, in which every node $i$ has a degree from an interval not too<br>far away from a given $d \in \N$. In order to design our FPAUS, we rely on<br>various state-of-the-art tools from Markov chain theory and combinatorics. In<br>particular, we provide the first non-trivial algorithmic application of a<br>breakthrough result of Liebenau and Wormald (2017) regarding an asymptotic<br>formula for the number of graphs with a given near-regular degree sequence.<br>Furthermore, we also make use of the recent breakthrough of Anari et al. (2019)<br>on sampling a base of a matroid under a strongly log-concave probability<br>distribution.<br>  As a more direct approach, we also study a natural Markov chain recently<br>introduced by Rechner, Strowick and M\"uller-Hannemann (2018), based on three<br>simple local operations: Switches, hinge flips, and additions/deletions of a<br>single edge. We obtain the first theoretical results for this Markov chain by<br>showing it is rapidly mixing for the case of near-regular degree intervals of<br>size at most one.<br>
%K Computer Science, Discrete Mathematics, cs.DM,Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Combinatorics, math.CO

Endnote

%0 Conference Proceedings
%A Anagnostides, Ioannis
%A Gouleakis, Themis
%A Marashian, Ali
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Robust Learning under Strong Noise via SQs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-DBCD-C
%U https://proceedings.mlr.press/v130/anagnostides21a.html
%D 2021
%B 24th International Conference on Artificial Intelligence and Statistics
%Z date of event: 2021-04-13 - 2021-04-15
%C Virtual Conference
%B Proceedings of the 24th International Conference on Artificial Intelligence and Statistics
%E Banerjee, Arindam; Fukumizu, Kenli
%P 3808 - 3816
%I PMLR
%B Proceedings of the Machine Learning Research
%N 130

Endnote

%0 Conference Proceedings
%A Anagnostides, Ioannis
%A Gouleakis, Themis
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-7306-C
%R 10.4230/LIPIcs.DISC.2021.5
%U urn:nbn:de:0030-drops-148077
%D 2021
%B 35th International Symposium on Distributed Computing
%Z date of event: 2021-10-04 - 2021-10-08
%C Freiburg, Germany (Virtual Conference)
%B 35th International Symposium on Distributed Computing
%E Gilbert, Seth
%P 1 - 19
%Z sequence number: 5
%I Schloss Dagstuhl
%@ 978-3-95977-210-5
%B Leibniz International Proceedings in Informatics
%N 209
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2021/14807/https://creativecommons.org/licenses/by/4.0/legalcode

Endnote

%0 Report
%A Anagnostides, Ioannis
%A Lenzen, Christoph
%A Haeupler, Bernhard
%A Zuzic, Goran
%A Gouleakis, Themis
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Almost Universally Optimal Distributed Laplacian Solvers via
Low-Congestion Shortcuts : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B83F-2
%U https://arxiv.org/abs/2109.05151
%D 2021
%X   In this work we refine the analysis of the distributed Laplacian solver<br>recently established by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21),<br>via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts.<br>Specifically, if $\epsilon > 0$ represents the error of the solver, we derive<br>two main results. First, for any $n$-node graph $G$ with hop-diameter $D$ and<br>treewidth bounded by $k$, we show the existence of a Laplacian solver with<br>round complexity $O(n^{o(1)}kD \log(1/\epsilon))$ in the CONGEST model. For<br>graphs with bounded treewidth this circumvents the notorious $\Omega(\sqrt{n})$<br>lower bound for "global" problems in general graphs. Moreover, following a<br>recent line of work in distributed algorithms, we consider a hybrid<br>communication model which enhances CONGEST with very limited global power in<br>the form of the recently introduced node-capacitated clique. In this model, we<br>show the existence of a Laplacian solver with round complexity $O(n^{o(1)}<br>\log(1/\epsilon))$. The unifying thread of these results is an application of<br>accelerated distributed algorithms for a congested variant of the standard<br>part-wise aggregation problem that we introduce. This primitive constitutes the<br>primary building block for simulating "local" operations on low-congestion<br>minors, and we believe that this framework could be more generally applicable.<br>
%K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC

Endnote

%0 Conference Proceedings
%A An, Haozhe
%A Gurumukhani, Mohit
%A Impagliazzo, Russell
%A Jaber, Michael
%A Künnemann, Marvin
%A Parga Nina, Maria Paula
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T The Fine-Grained Complexity of Multi-Dimensional Ordering Properties : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-CBD6-1
%R 10.4230/LIPIcs.IPEC.2021.3
%U urn:nbn:de:0030-drops-153869
%D 2021
%B 16th International Symposium on Parameterized and Exact Computation
%Z date of event: 2021-09-08 - 2021-09-10
%C Lisbon, Portugal
%B 16th International Symposium on Parameterized and Exact Computation
%E Golovach, Petr A.; Zehavi, Meirav
%P 1 - 15
%Z sequence number: 3
%I Schloss Dagstuhl
%@ 978-3-95977-216-7
%B Leibniz International Proceedings in Informatics
%N 214
%U https://drops.dagstuhl.de/opus/volltexte/2021/15386/https://creativecommons.org/licenses/by/4.0/legalcode

Endnote

%0 Report
%A Antoniadis, Antonios
%A Hoeksma, Ruben
%A Kisfaludi-Bak, Sándor
%A Schewior, Kevin
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Online Search for a Hyperplane in High-Dimensional Euclidean Space : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B814-1
%U https://arxiv.org/abs/2109.04340
%D 2021
%X   We consider the online search problem in which a server starting at the<br>origin of a $d$-dimensional Euclidean space has to find an arbitrary<br>hyperplane. The best-possible competitive ratio and the length of the shortest<br>curve from which each point on the $d$-dimensional unit sphere can be seen are<br>within a constant factor of each other. We show that this length is in<br>$\Omega(d)\cap O(d^{3/2})$.<br>
%K Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Axiotis, Kyriakos
%A Backurs, Arturs
%A Bringmann, Karl
%A Jin, Ce
%A Nakos, Vasileios
%A Tzamos, Christos
%A Wu, Hongxun
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Fast and Simple Modular Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-56CF-0
%R 10.1137/1.9781611976496.6
%D 2021
%B SIAM Symposium on Simplicity in Algorithms
%Z date of event: 2021-01-11 - 2021-01-12
%C Alexandria, VA, USA (Virtual Conference)
%B Symposium on Simplicity in Algorithms
%E King, Valerie; Viet Le, Hung
%P 57 - 67
%I SIAM
%@  978-1-61197-649-6

Endnote

%0 Journal Article
%A Becker, Ruben
%A Forster, Sebastian
%A Karrenbauer, Andreas
%A Lenzen, Christoph
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E543-A
%R 10.1137/19M1286955
%7 2021
%D 2021
%J SIAM Journal on Computing
%V 50
%N 3
%& 815
%P 815 - 856
%I SIAM
%C Philadelphia
%@ false

Endnote

%0 Journal Article
%A Berendsohn, Benjamin Aram
%A Kozma, László
%A Marx, Dániel
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Finding and Counting Permutations via CSPs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-3403-A
%R 10.1007/s00453-021-00812-z
%7 2021
%D 2021
%J Algorithmica
%V 83
%& 2552
%P 2552 - 2577
%I Springer
%C New York, NY
%@ false

Endnote

%0 Report
%A Bringmann, Karl
%A Slusallek, Jasper
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Current Algorithms for Detecting Subgraphs of Bounded Treewidth are
Probably Optimal : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E25F-F
%U https://arxiv.org/abs/2105.05062
%D 2021
%X   The Subgraph Isomorphism problem is of considerable importance in computer<br>science. We examine the problem when the pattern graph H is of bounded<br>treewidth, as occurs in a variety of applications. This problem has a<br>well-known algorithm via color-coding that runs in time $O(n^{tw(H)+1})$ [Alon,<br>Yuster, Zwick'95], where $n$ is the number of vertices of the host graph $G$.<br>While there are pattern graphs known for which Subgraph Isomorphism can be<br>solved in an improved running time of $O(n^{tw(H)+1-\varepsilon})$ or even<br>faster (e.g. for $k$-cliques), it is not known whether such improvements are<br>possible for all patterns. The only known lower bound rules out time<br>$n^{o(tw(H) / \log(tw(H)))}$ for any class of patterns of unbounded treewidth<br>assuming the Exponential Time Hypothesis [Marx'07].<br>  In this paper, we demonstrate the existence of maximally hard pattern graphs<br>$H$ that require time $n^{tw(H)+1-o(1)}$. Specifically, under the Strong<br>Exponential Time Hypothesis (SETH), a standard assumption from fine-grained<br>complexity theory, we prove the following asymptotic statement for large<br>treewidth $t$: For any $\varepsilon > 0$ there exists $t \ge 3$ and a pattern<br>graph $H$ of treewidth $t$ such that Subgraph Isomorphism on pattern $H$ has no<br>algorithm running in time $O(n^{t+1-\varepsilon})$.<br>  Under the more recent 3-uniform Hyperclique hypothesis, we even obtain tight<br>lower bounds for each specific treewidth $t \ge 3$: For any $t \ge 3$ there<br>exists a pattern graph $H$ of treewidth $t$ such that for any $\varepsilon>0$<br>Subgraph Isomorphism on pattern $H$ has no algorithm running in time<br>$O(n^{t+1-\varepsilon})$.<br>  In addition to these main results, we explore (1) colored and uncolored<br>problem variants (and why they are equivalent for most cases), (2) Subgraph<br>Isomorphism for $tw < 3$, (3) Subgraph Isomorphism parameterized by pathwidth,<br>and (4) a weighted problem variant.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Fischer, Nick
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E23F-3
%R 10.1145/3406325.3451090
%D 2021
%B 53rd Annual ACM SIGACT Symposium on Theory of Computing
%Z date of event: 2021-06-21 - 2021-06-25
%C Virtual, Italy
%B STOC '21
%E Khuller, Samir; Vassilevska Williams, Virginia
%P 1711 - 1724
%I ACM
%@ 9781450380539

Endnote

%0 Journal Article
%A Bringmann, Karl
%A Künnemann, Marvin
%A Nusser, André
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1F8A-7
%R 10.20382/jocg.v12i1a4 
%7 2021
%D 2021
%J Journal of Computational Geometry
%V 12
%N 1
%& 70
%P 70 - 108
%I JoCG.org

Endnote

%0 Report
%A Bringmann, Karl
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fine-Grained Complexity Theory: Conditional Lower Bounds for
  Computational Geometry : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B42E-9
%U https://arxiv.org/abs/2110.10283
%D 2021
%X   Fine-grained complexity theory is the area of theoretical computer science<br>that proves conditional lower bounds based on the Strong Exponential Time<br>Hypothesis and similar conjectures. This area has been thriving in the last<br>decade, leading to conditionally best-possible algorithms for a wide variety of<br>problems on graphs, strings, numbers etc. This article is an introduction to<br>fine-grained lower bounds in computational geometry, with a focus on lower<br>bounds for polynomial-time problems based on the Orthogonal Vectors Hypothesis.<br>Specifically, we discuss conditional lower bounds for nearest neighbor search<br>under the Euclidean distance and Fr\'echet distance.<br>
%K Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B428-F
%R 10.1007/978-3-030-80049-9_6
%D 2021
%B 17th Conference on Computability in Europe
%Z date of event: 2021-07-05 - 2021-07-09
%C Ghent, Belgium (Virtual Event)
%B Connecting with Computability
%E De Mol, Liesbeth; Weiermann, Andreas; Manea, Florin; Fernández-Duque, David
%P 60 - 70
%I Springer
%@ 978-3-030-80048-2
%B Lecture Notes in Computer Science
%N 12813

Endnote

%0 Report
%A Bringmann, Karl
%A Nusser, André
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff
  Distance Under Translation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E242-E
%U https://arxiv.org/abs/2101.07696
%D 2021
%X   Computing the similarity of two point sets is a ubiquitous task in medical<br>imaging, geometric shape comparison, trajectory analysis, and many more<br>settings. Arguably the most basic distance measure for this task is the<br>Hausdorff distance, which assigns to each point from one set the closest point<br>in the other set and then evaluates the maximum distance of any assigned pair.<br>A drawback is that this distance measure is not translational invariant, that<br>is, comparing two objects just according to their shape while disregarding<br>their position in space is impossible.<br>  Fortunately, there is a canonical translational invariant version, the<br>Hausdorff distance under translation, which minimizes the Hausdorff distance<br>over all translations of one of the point sets. For point sets of size $n$ and<br>$m$, the Hausdorff distance under translation can be computed in time $\tilde<br>O(nm)$ for the $L_1$ and $L_\infty$ norm [Chew, Kedem SWAT'92] and $\tilde O(nm<br>(n+m))$ for the $L_2$ norm [Huttenlocher, Kedem, Sharir DCG'93].<br>  As these bounds have not been improved for over 25 years, in this paper we<br>approach the Hausdorff distance under translation from the perspective of<br>fine-grained complexity theory. We show (i) a matching lower bound of<br>$(nm)^{1-o(1)}$ for $L_1$ and $L_\infty$ assuming the Orthogonal Vectors<br>Hypothesis and (ii) a matching lower bound of $n^{2-o(1)}$ for $L_2$ in the<br>imbalanced case of $m = O(1)$ assuming the 3SUM Hypothesis.<br>
%K Computer Science, Computational Geometry, cs.CG,Computer Science, Computational Complexity, cs.CC

Endnote

%0 Journal Article
%A Bringmann, Karl
%A Künnemann, Marvin
%A Nusser, André
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm  : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-2A8B-C
%R 10.1145/3460656
%7 2021
%D 2021
%J ACM Transactions on Algorithms
%V 17
%N 3
%& 1
%P 1 - 42
%Z sequence number: 25
%I ACM
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Bringmann, Karl
%A Nusser, André
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance under Translation  : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-2690-6
%R 10.20382/jocg.v13i2a3 
%7 2021
%D 2021
%J Journal of Computational Geometry
%V 13
%N 2
%& 30
%P 30 - 50
%I JoCG.org

Endnote

%0 Report
%A Bringmann, Karl
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fast n-fold Boolean Convolution via Additive Combinatorics : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E25B-3
%U https://arxiv.org/abs/2105.03968
%D 2021
%X   We consider the problem of computing the Boolean convolution (with<br>wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of<br>computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq<br>\mathbb{Z}_m$. Boolean convolution formalizes the frequent task of combining<br>two subproblems, where the whole problem has a solution of size $k$ if for some<br>$i$ the first subproblem has a solution of size~$i$ and the second subproblem<br>has a solution of size $k-i$. Our problem formalizes a natural generalization,<br>namely combining solutions of $n$ subproblems subject to a modular constraint.<br>This simultaneously generalises Modular Subset Sum and Boolean Convolution<br>(Sumset Computation). Although nearly optimal algorithms are known for special<br>cases of this problem, not even tiny improvements are known for the general<br>case.<br>  We almost resolve the computational complexity of this problem, shaving<br>essentially a factor of $n$ from the running time of previous algorithms.<br>Specifically, we present a \emph{deterministic} algorithm running in<br>\emph{almost} linear time with respect to the input plus output size $k$. We<br>also present a \emph{Las Vegas} algorithm running in \emph{nearly} linear<br>expected time with respect to the input plus output size $k$. Previously, no<br>deterministic or randomized $o(nk)$ algorithm was known.<br>  At the heart of our approach lies a careful usage of Kneser's theorem from<br>Additive Combinatorics, and a new deterministic almost linear output-sensitive<br>algorithm for non-negative sparse convolution. In total, our work builds a<br>solid toolbox that could be of independent interest.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Report
%A Bringmann, Karl
%A Driemel, Anne
%A Nusser, André
%A Psarros, Ioannis
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Tight Bounds for Approximate Near Neighbor Searching for Time Series
  under the Fréchet Distance : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B43F-6
%U https://arxiv.org/abs/2107.07792
%D 2021
%X   We study the $c$-approximate near neighbor problem under the continuous<br>Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a<br>radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the<br>curves into a data structure that, given a query curve $q$ with $k$ vertices,<br>either returns an input curve with Fr\'echet distance at most $c\cdot \delta$<br>to $q$, or returns that there exists no input curve with Fr\'echet distance at<br>most $\delta$ to $q$. We focus on the case where the input and the queries are<br>one-dimensional polygonal curves -- also called time series -- and we give a<br>comprehensive analysis for this case. We obtain new upper bounds that provide<br>different tradeoffs between approximation factor, preprocessing time, and query<br>time.<br>  Our data structures improve upon the state of the art in several ways. We<br>show that for any $0 < \varepsilon \leq 1$ an approximation factor of<br>$(1+\varepsilon)$ can be achieved within the same asymptotic time bounds as the<br>previously best result for $(2+\varepsilon)$. Moreover, we show that an<br>approximation factor of $(2+\varepsilon)$ can be obtained by using<br>preprocessing time and space $O(nm)$, which is linear in the input size, and<br>query time in $O(\frac{1}{\varepsilon})^{k+2}$, where the previously best<br>result used preprocessing time in $n \cdot O(\frac{m}{\varepsilon k})^k$ and<br>query time in $O(1)^k$. We complement our upper bounds with matching<br>conditional lower bounds based on the Orthogonal Vectors Hypothesis.<br>Interestingly, some of our lower bounds already hold for any super-constant<br>value of $k$. This is achieved by proving hardness of a one-sided sparse<br>version of the Orthogonal Vectors problem as an intermediate problem, which we<br>believe to be of independent interest.<br>
%K Computer Science, Computational Geometry, cs.CG,Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Slusallek, Jasper
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-DB85-B
%R 10.4230/LIPIcs.ICALP.2021.40
%U urn:nbn:de:0030-drops-141095
%D 2021
%B 48th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2021-07-12 - 2020-07-16
%C Glasgow, UK (Virtual Conference)
%B 48th International Colloquium on Automata, Languages, and Programming
%E Bansal, Nikhil; Merelli, Emanuela; Worrell, James
%P 1 - 16
%Z sequence number: 40
%I Schloss Dagstuhl
%@ 978-3-95977-195-5
%B Leibniz International Proceedings in Informatics
%N 198
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2021/14109/https://creativecommons.org/licenses/by/4.0/legalcode

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Das, Debarati
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T A Linear-Time n0.4-Approximation for Longest Common Subsequence : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-DB7B-8
%R 10.4230/LIPIcs.ICALP.2021.39
%U urn:nbn:de:0030-drops-141082
%D 2021
%B 48th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2021-07-12 - 2020-07-16
%C Glasgow, UK (Virtual Conference)
%B 48th International Colloquium on Automata, Languages, and Programming
%E Bansal, Nikhil; Merelli, Emanuela; Worrell, James
%P 1 - 20
%Z sequence number: 39
%I Schloss Dagstuhl
%@ 978-3-95977-195-5
%B Leibniz International Proceedings in Informatics
%N 198
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2021/14108/https://creativecommons.org/licenses/by/4.0/legalcode

Endnote

%0 Report
%A Bringmann, Karl
%A Kapralov, Michael
%A Makarov, Mikhail
%A Nakos, Vasileios
%A Yagudin, Amir
%A Zandieh, Amir
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Sparse Fourier Transform by Traversing Cooley-Tukey FFT Computation
  Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B459-8
%U https://arxiv.org/abs/2107.07347
%D 2021
%X   Computing the dominant Fourier coefficients of a vector is a common task in<br>many fields, such as signal processing, learning theory, and computational<br>complexity. In the Sparse Fast Fourier Transform (Sparse FFT) problem, one is<br>given oracle access to a $d$-dimensional vector $x$ of size $N$, and is asked<br>to compute the best $k$-term approximation of its Discrete Fourier Transform,<br>quickly and using few samples of the input vector $x$. While the sample<br>complexity of this problem is quite well understood, all previous approaches<br>either suffer from an exponential dependence of runtime on the dimension $d$ or<br>can only tolerate a trivial amount of noise. This is in sharp contrast with the<br>classical FFT algorithm of Cooley and Tukey, which is stable and completely<br>insensitive to the dimension of the input vector: its runtime is $O(N\log N)$<br>in any dimension $d$.<br>  In this work, we introduce a new high-dimensional Sparse FFT toolkit and use<br>it to obtain new algorithms, both on the exact, as well as in the case of<br>bounded $\ell_2$ noise. This toolkit includes i) a new strategy for exploring a<br>pruned FFT computation tree that reduces the cost of filtering, ii) new<br>structural properties of adaptive aliasing filters recently introduced by<br>Kapralov, Velingker and Zandieh'SODA'19, and iii) a novel lazy estimation<br>argument, suited to reducing the cost of estimation in FFT tree-traversal<br>approaches. Our robust algorithm can be viewed as a highly optimized sparse,<br>stable extension of the Cooley-Tukey FFT algorithm.<br>  Finally, we explain the barriers we have faced by proving a conditional<br>quadratic lower bound on the running time of the well-studied non-equispaced<br>Fourier transform problem. This resolves a natural and frequently asked<br>question in computational Fourier transforms. Lastly, we provide a preliminary<br>experimental evaluation comparing the runtime of our algorithm to FFTW and SFFT<br>2.0.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Nusser, André
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-DB6F-6
%R 10.4230/LIPIcs.SoCG.2021.18
%U urn:nbn:de:0030-drops-138177
%D 2021
%B 37th International Symposium on Computational Geometry
%Z date of event: 2021-06-07 - 2021-06-11
%C Buffalo, NY, USA (Virtual Conference)
%B 37th International Symposium on Computational Geometry
%E Buchin, Kevin; Colin de Verdière, Érich
%P 1 - 17
%Z sequence number: 18
%I Schloss Dagstuhl
%@ 978-3-95977-184-9
%B Leibniz International Proceedings in Informatics
%N 189
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2021/13817/https://creativecommons.org/licenses/by/4.0/legalcode

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fast n-Fold Boolean Convolution via Additive Combinatorics : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-DB8E-2
%R 10.4230/LIPIcs.ICALP.2021.41
%U urn:nbn:de:0030-drops-141108
%D 2021
%B 48th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2021-07-12 - 2020-07-16
%C Glasgow, UK (Virtual Conference)
%B 48th International Colloquium on Automata, Languages, and Programming
%E Bansal, Nikhil; Merelli, Emanuela; Worrell, James
%P 1 - 17
%Z sequence number: 41
%I Schloss Dagstuhl
%@ 978-3-95977-195-5
%B Leibniz International Proceedings in Informatics
%N 198
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2021/14110/pdf/LIPIcs-ICALP-2021-41.pdfhttps://creativecommons.org/licenses/by/4.0/legalcode

Endnote

%0 Report
%A Bringmann, Karl
%A Fischer, Nick
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Deterministic and Las Vegas Algorithms for Sparse Nonnegative
  Convolution : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B454-D
%U https://arxiv.org/abs/2107.07625
%D 2021
%X   Computing the convolution $A\star B$ of two length-$n$ integer vectors $A,B$<br>is a core problem in several disciplines. It frequently comes up in algorithms<br>for Knapsack, $k$-SUM, All-Pairs Shortest Paths, and string pattern matching<br>problems. For these applications it typically suffices to compute convolutions<br>of nonnegative vectors. This problem can be classically solved in time $O(n\log<br>n)$ using the Fast Fourier Transform.<br>  However, often the involved vectors are sparse and hence one could hope for<br>output-sensitive algorithms to compute nonnegative convolutions. This question<br>was raised by Muthukrishnan and solved by Cole and Hariharan (STOC '02) by a<br>randomized algorithm running in near-linear time in the (unknown) output-size<br>$t$. Chan and Lewenstein (STOC '15) presented a deterministic algorithm with a<br>$2^{O(\sqrt{\log t\cdot\log\log n})}$ overhead in running time and the<br>additional assumption that a small superset of the output is given; this<br>assumption was later removed by Bringmann and Nakos (ICALP '21).<br>  In this paper we present the first deterministic near-linear-time algorithm<br>for computing sparse nonnegative convolutions. This immediately gives improved<br>deterministic algorithms for the state-of-the-art of output-sensitive Subset<br>Sum, block-mass pattern matching, $N$-fold Boolean convolution, and others,<br>matching up to log-factors the fastest known randomized algorithms for these<br>problems. Our algorithm is a blend of algebraic and combinatorial ideas and<br>techniques.<br>  Additionally, we provide two fast Las Vegas algorithms for computing sparse<br>nonnegative convolutions. In particular, we present a simple $O(t\log^2t)$ time<br>algorithm, which is an accessible alternative to Cole and Hariharan's<br>algorithm. We further refine this new algorithm to run in Las Vegas time<br>$O(t\log t\cdot\log\log t)$, matching the running time of the dense case apart<br>from the $\log\log t$ factor.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Report
%A Bringmann, Karl
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset
  Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B434-1
%U https://arxiv.org/abs/2107.13206
%D 2021
%X   In the classical Subset Sum problem we are given a set $X$ and a target $t$,<br>and the task is to decide whether there exists a subset of $X$ which sums to<br>$t$. A recent line of research has resulted in $\tilde{O}(t)$-time algorithms,<br>which are (near-)optimal under popular complexity-theoretic assumptions. On the<br>other hand, the standard dynamic programming algorithm runs in time $O(n \cdot<br>|\mathcal{S}(X,t)|)$, where $\mathcal{S}(X,t)$ is the set of all subset sums of<br>$X$ that are smaller than $t$. Furthermore, all known pseudopolynomial<br>algorithms actually solve a stronger task, since they actually compute the<br>whole set $\mathcal{S}(X,t)$.<br>  As the aforementioned two running times are incomparable, in this paper we<br>ask whether one can achieve the best of both worlds: running time<br>$\tilde{O}(|\mathcal{S}(X,t)|)$. In particular, we ask whether<br>$\mathcal{S}(X,t)$ can be computed in near-linear time in the output-size.<br>Using a diverse toolkit containing techniques such as color coding, sparse<br>recovery, and sumset estimates, we make considerable progress towards this<br>question and design an algorithm running in time<br>$\tilde{O}(|\mathcal{S}(X,t)|^{4/3})$.<br>  Central to our approach is the study of top-$k$-convolution, a natural<br>problem of independent interest: given sparse polynomials with non-negative<br>coefficients, compute the lowest $k$ non-zero monomials of their product. We<br>design an algorithm running in time $\tilde{O}(k^{4/3})$, by a combination of<br>sparse convolution and sumset estimates considered in Additive Combinatorics.<br>Moreover, we provide evidence that going beyond some of the barriers we have<br>faced requires either an algorithmic breakthrough or possibly new techniques<br>from Additive Combinatorics on how to pass from information on restricted<br>sumsets to information on unrestricted sumsets.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Discrete Mathematics, cs.DM

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Cassis, Alejandro
%A Fischer, Nick
%A Künnemann, Marvin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Fine-Grained Completeness for Optimization in P : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B411-8
%R 10.4230/LIPIcs.APPROX/RANDOM.2021.9
%U urn:nbn:de:0030-drops-147024
%D 2021
%B 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 25th International Conference on Randomization and Computation
%Z date of event: 2021-08-16 - 2021-08-18
%C Seattle, WA, USA
%B Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
%E Wootters, Mary; Sanità, Laura
%P 1 - 22
%Z sequence number: 9
%I Schloss Dagstuhl
%@ 978-3-95977-207-5
%B Leibniz International Proceedings in Informatics
%N 207
%@ false

Endnote

%0 Report
%A Bringmann, Karl
%A Cassis, Alejandro
%A Fischer, Nick
%A Künnemann, Marvin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Fine-Grained Completeness for Optimization in P : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E26A-2
%U https://arxiv.org/abs/2107.01721
%D 2021
%X   We initiate the study of fine-grained completeness theorems for exact and<br>approximate optimization in the polynomial-time regime. Inspired by the first<br>completeness results for decision problems in P (Gao, Impagliazzo, Kolokolova,<br>Williams, TALG 2019) as well as the classic class MaxSNP and<br>MaxSNP-completeness for NP optimization problems (Papadimitriou, Yannakakis,<br>JCSS 1991), we define polynomial-time analogues MaxSP and MinSP, which contain<br>a number of natural optimization problems in P, including Maximum Inner<br>Product, general forms of nearest neighbor search and optimization variants of<br>the $k$-XOR problem. Specifically, we define MaxSP as the class of problems<br>definable as $\max_{x_1,\dots,x_k} \#\{ (y_1,\dots,y_\ell) :<br>\phi(x_1,\dots,x_k, y_1,\dots,y_\ell) \}$, where $\phi$ is a quantifier-free<br>first-order property over a given relational structure (with MinSP defined<br>analogously). On $m$-sized structures, we can solve each such problem in time<br>$O(m^{k+\ell-1})$. Our results are:<br>  - We determine (a sparse variant of) the Maximum/Minimum Inner Product<br>problem as complete under *deterministic* fine-grained reductions: A strongly<br>subquadratic algorithm for Maximum/Minimum Inner Product would beat the<br>baseline running time of $O(m^{k+\ell-1})$ for *all* problems in MaxSP/MinSP by<br>a polynomial factor.<br>  - This completeness transfers to approximation: Maximum/Minimum Inner Product<br>is also complete in the sense that a strongly subquadratic $c$-approximation<br>would give a $(c+\varepsilon)$-approximation for all MaxSP/MinSP problems in<br>time $O(m^{k+\ell-1-\delta})$, where $\varepsilon > 0$ can be chosen<br>arbitrarily small. Combining our completeness with~(Chen, Williams, SODA 2019),<br>we obtain the perhaps surprising consequence that refuting the OV Hypothesis is<br>*equivalent* to giving a $O(1)$-approximation for all MinSP problems in<br>faster-than-$O(m^{k+\ell-1})$ time.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Fine-Grained Perspective on Approximating Subset Sum and Partition : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-90DD-D
%R 10.1137/1.9781611976465.108
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 1797 - 1815
%I SIAM
%@ 978-1-61197-646-5

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Wellnitz, Philip
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T On Near-Linear-Time Algorithms for Dense Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8C7E-F
%R 10.1137/1.9781611976465.107
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 1777 - 1796
%I SIAM
%@ 978-1-61197-646-5

Endnote

%0 Report
%A Bringmann, Karl
%A Fischer, Nick
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative
  Convolution : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E263-9
%U https://arxiv.org/abs/2105.05984
%D 2021
%X   Computing the convolution $A\star B$ of two length-$n$ vectors $A,B$ is an<br>ubiquitous computational primitive. Applications range from string problems to<br>Knapsack-type problems, and from 3SUM to All-Pairs Shortest Paths. These<br>applications often come in the form of nonnegative convolution, where the<br>entries of $A,B$ are nonnegative integers. The classical algorithm to compute<br>$A\star B$ uses the Fast Fourier Transform and runs in time $O(n\log n)$.<br>  However, often $A$ and $B$ satisfy sparsity conditions, and hence one could<br>hope for significant improvements. The ideal goal is an $O(k\log k)$-time<br>algorithm, where $k$ is the number of non-zero elements in the output, i.e.,<br>the size of the support of $A\star B$. This problem is referred to as sparse<br>nonnegative convolution, and has received considerable attention in the<br>literature; the fastest algorithms to date run in time $O(k\log^2 n)$.<br>  The main result of this paper is the first $O(k\log k)$-time algorithm for<br>sparse nonnegative convolution. Our algorithm is randomized and assumes that<br>the length $n$ and the largest entry of $A$ and $B$ are subexponential in $k$.<br>Surprisingly, we can phrase our algorithm as a reduction from the sparse case<br>to the dense case of nonnegative convolution, showing that, under some mild<br>assumptions, sparse nonnegative convolution is equivalent to dense nonnegative<br>convolution for constant-error randomized algorithms. Specifically, if $D(n)$<br>is the time to convolve two nonnegative length-$n$ vectors with success<br>probability $2/3$, and $S(k)$ is the time to convolve two nonnegative vectors<br>with output size $k$ with success probability $2/3$, then<br>$S(k)=O(D(k)+k(\log\log k)^2)$.<br>  Our approach uses a variety of new techniques in combination with some old<br>machinery from linear sketching and structured linear algebra, as well as new<br>insights on linear hashing, the most classical hash function.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC

Endnote

%0 Report
%A Bringmann, Karl
%A Cohen-Addad, Vincent
%A Das, Debarati
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T A Linear-Time n0.4-Approximation for Longest Common Subsequence : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E267-5
%U https://arxiv.org/abs/2106.08195
%D 2021
%X   We consider the classic problem of computing the Longest Common Subsequence<br>(LCS) of two strings of length $n$. While a simple quadratic algorithm has been<br>known for the problem for more than 40 years, no faster algorithm has been<br>found despite an extensive effort. The lack of progress on the problem has<br>recently been explained by Abboud, Backurs, and Vassilevska Williams [FOCS'15]<br>and Bringmann and K\"unnemann [FOCS'15] who proved that there is no<br>subquadratic algorithm unless the Strong Exponential Time Hypothesis fails.<br>This has led the community to look for subquadratic approximation algorithms<br>for the problem.<br>  Yet, unlike the edit distance problem for which a constant-factor<br>approximation in almost-linear time is known, very little progress has been<br>made on LCS, making it a notoriously difficult problem also in the realm of<br>approximation. For the general setting, only a naive<br>$O(n^{\varepsilon/2})$-approximation algorithm with running time<br>$\tilde{O}(n^{2-\varepsilon})$ has been known, for any constant $0 <<br>\varepsilon \le 1$. Recently, a breakthrough result by Hajiaghayi, Seddighin,<br>Seddighin, and Sun [SODA'19] provided a linear-time algorithm that yields a<br>$O(n^{0.497956})$-approximation in expectation; improving upon the naive<br>$O(\sqrt{n})$-approximation for the first time.<br>  In this paper, we provide an algorithm that in time $O(n^{2-\varepsilon})$<br>computes an $\tilde{O}(n^{2\varepsilon/5})$-approximation with high<br>probability, for any $0 < \varepsilon \le 1$. Our result (1) gives an<br>$\tilde{O}(n^{0.4})$-approximation in linear time, improving upon the bound of<br>Hajiaghayi, Seddighin, Seddighin, and Sun, (2) provides an algorithm whose<br>approximation scales with any subquadratic running time $O(n^{2-\varepsilon})$,<br>improving upon the naive bound of $O(n^{\varepsilon/2})$ for any $\varepsilon$,<br>and (3) instead of only in expectation, succeeds with high probability.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,

Endnote

%0 Conference Proceedings
%A Charalampopoulos, Panagiotis
%A Kociumaka, Tomasz
%A Wellnitz, Philip
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Faster Approximate Pattern Matching: A Unified Approach : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8C66-9
%R 10.1109/FOCS46700.2020
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 978 - 989
%I IEEE
%@ 978-1-7281-9621-3

Endnote

%0 Thesis
%A Chaudhury, Bhaskar Ray
%Y Mehlhorn, Kurt
%A referee: Bringmann, Karl
%A referee: Roughgarden, Tim
%A referee: Moulin, Herve
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Finding Fair and Efficient Allocations : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-9CC9-5
%R 10.22028/D291-34537 
%U nbn:de:bsz:291--ds-345370
%F OTHER: hdl:20.500.11880/31737
%I Universität des Saarlandes
%C Saarbrücken
%D 2021
%P 173 p.
%V phd
%9 phd
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/31737

Endnote

%0 Conference Proceedings
%A Chaudhury, Bhaskar Ray
%A Garg, Jugal
%A Mehlhorn, Kurt
%A Mehta, Ruta
%A Misra, Pranabendu
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Improving EFX Guarantees through Rainbow Cycle Number : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B3F6-7
%R 10.1145/3465456.3467605
%D 2021
%B 22nd ACM Conference on Economics and Computation
%Z date of event: 2021-07-18 - 2021-07-23
%C Budapest, Hungary (Virtual)
%B EC '21
%E Biró, Péter; Chawla, Shuchi; Echenique, Federico; Sodomka, Eric
%P 310 - 311
%I ACM
%@ 978-1-4503-8554-1

Endnote

%0 Conference Proceedings
%A Cheraghchi, Mahdi
%A Nakos, Vasileios
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-56C6-9
%R 10.1109/FOCS46700.2020
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 1203 - 1213
%I IEEE
%@ 978-1-7281-9621-3

Endnote

%0 Conference Proceedings
%A Coupette, Corinna
%A Singh, Jyotsna
%A Spamann, Holger
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Simplify Your Law: Using Information Theory to Deduplicate Legal Documents : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-5E10-B
%R 10.1109/ICDMW53433.2021.00083
%D 2021
%B 21st IEEE International Conference on Data Mining Workshops 
%Z date of event: 2021-12-07 - 2021-12-10
%C Virtual Conference
%B 21st IEEE International Conference on Data Mining Workshops 
%E Xue, Bing; Pechenizkiy, Mykola; Koh, Yun Sing
%P 631 - 638
%I IEEE
%@ 978-1-6654-2428-8

Endnote

%0 Journal Article
%A Coupette, Corinna
%A Beckedorf, Janis
%A Hartung, Dirk
%A Bommarito, Michael
%A Katz, Daniel Martin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Measuring Law Over Time: A Network Analytical Framework with an Application to Statutes and Regulations in the United States and Germany : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-D8FA-B
%R 10.3389/fphy.2021.658463
%7 2021
%D 2021
%J Frontiers in Physics
%V 9
%Z sequence number: 658463
%I Frontiers Media
%C Lausanne
%@ false

Endnote

%0 Conference Proceedings
%A Coupette, Corinna
%A Vreeken, Jilles
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Graph Similarity Description: How Are These Graphs Similar? : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-652C-5
%R 10.1145/3447548.3467257
%D 2021
%B 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
%Z date of event: 2021-08-14 - 2021-08-18
%C Virtual Event, Singapore
%B KDD '21
%E Zhu, Fieda; Ooi, Beng, Chin; Miao, Chunyan; Cong, Gao; Tang, Jiliang; Derr, Tyler
%P 185 - 195
%I ACM
%@ 978-1-4503-8332-5

Endnote

%0 Conference Proceedings
%A Coupette, Corinna
%A Lenzen, Christoph
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Breezing Proof of the KMW Bound : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-7A44-4
%R 10.1137/1.9781611976496.21
%D 2021
%B SIAM Symposium on Simplicity in Algorithms
%Z date of event: 2021-01-11 - 2021-01-12
%C Alexandria, VA, USA (Virtual Conference)
%B Symposium on Simplicity in Algorithms
%E King, Valerie; Viet Le, Hung
%P 184 - 195
%I SIAM
%@ 978-1-61197-649-6

Endnote

%0 Journal Article
%A Cruciani, Emilio
%A Natale, Emanuele
%A Nusser, André
%A Scornavacca, Giacomo
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-BA11-3
%R 10.1007/s00446-021-00396-5
%7 2021
%D 2021
%J Distributed Computing
%V 34
%& 207
%P 207 - 225
%I Springer International
%C Berlin
%@ false

Endnote

%0 Journal Article
%A Darwish, Omar
%A Elmasry, Amr
%A Katajainen, Jyrki
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-D8F2-3
%R 10.1145/3452938
%7 2021
%D 2021
%J ACM Transactions on Algorithms
%V 17
%N 2
%Z sequence number: 18
%I ACM
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Dayama, Niraj Ramesh
%A Shiripour, Morteza
%A Oulasvirta, Antti
%A Ivanko, Evgeny
%A Karrenbauer, Andreas
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Foraging-based Optimization of Menu Systems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-9D57-6
%R 10.1016/j.ijhcs.2021.102624
%7 2021
%D 2021
%J International Journal of Human-Computer Studies
%V 151
%Z sequence number: 102624
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Conference Proceedings
%A de Berg, Mark
%A Kisfaludi-Bak, Sándor
%A Monemizadeh, Morteza
%A Theocharous, Leonidas
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Clique-Based Separators for Geometric Intersection Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B811-4
%R 10.4230/LIPIcs.ISAAC.2021.22
%U urn:nbn:de:0030-drops-154556
%D 2021
%B 32nd International Symposium on Algorithms and Computation
%Z date of event: 2021-12-06 - 2021-12-08
%C Fukuoka, Japan
%B 32nd International Symposium on Algorithms and Computation
%E Ahn, Hee-Kap; Sadakane, Kunihiko
%P 1 - 15
%Z sequence number: 22
%I Schloss Dagstuhl
%@ 978-3-95977-214-3
%B Leibniz International Proceedings in Informatics
%N 212
%@ false

Endnote

%0 Conference Proceedings
%A Diakonikolas, Ilias
%A Gouleakis, Themis
%A Kane, Daniel M.
%A Peebles, John
%A Price, Eric
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Optimal Testing of Discrete Distributions with High Probability : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-CD4F-8
%R 10.1145/3406325.3450997
%D 2021
%B 53rd Annual ACM SIGACT Symposium on Theory of Computing
%Z date of event: 2021-06-21 - 2021-06-25
%C Virtual, Italy
%B STOC '21
%E Khuller, Samir; Vassilevska Williams, Virginia
%P 542 - 555
%I ACM
%@ 9781450380539

Endnote

%0 Journal Article
%A Dörfler, Julian
%A Roth, Marc
%A Schmitt, Johannes
%A Wellnitz, Philip
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-A583-8
%R 10.1007/s00453-021-00894-9
%7 2021
%D 2021
%J Algorithmica
%I Springer-Verlag
%C New York
%@ false

Endnote

%0 Journal Article
%A Driemel, Anne
%A Nusser, André
%A Phillips, Jeff M.
%A Psarros, Ioannis
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-414C-9
%R 10.1007/s00454-021-00318-z
%7 2021
%D 2021
%J Discrete & Computational Geometry
%I Springer
%C New York, NY
%@ false

Endnote

%0 Journal Article
%A Dyer, Martin
%A Greenhill, Catherine
%A Kleer, Pieter
%A Ross, James
%A Stougie, Leen
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Sampling Hypergraphs with Given Degrees : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B820-3
%R 10.1016/j.disc.2021.112566
%7 2021
%D 2021
%J Discrete Mathematics
%V 344
%N 11
%Z sequence number: 112566
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Journal Article
%A Feit, Anna Maria
%A Nancel, Mathieu
%A John, Maximilian
%A Karrenbauer, Andreas
%A Weir, Daryl
%A Oulasvirta, Antti
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T AZERTY Amélioré: Computational Design on a National Scale : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-E78E-5
%R 10.1145/3382035
%7 2021
%D 2021
%K {F}r\'{e}chet
%J Communications of the ACM
%V 64
%N 2
%& 48
%P 48 - 58
%I Association for Computing Machinery, Inc.
%C New York
%@ false

Endnote

%0 Journal Article
%A Folz, Frederic
%A Mehlhorn, Kurt
%A Morigi, Giovanna
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Interplay of Periodic Dynamics and Noise: Insights from a Simple Adaptive System : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-9D3F-1
%R 10.1103/PhysRevE.104.054215
%7 2021
%D 2021
%J Physical Review E
%O Phys. Rev. E
%V 104
%N 5
%Z sequence number: 054215
%I American Physical Society
%C Melville, NY
%@ false

Endnote

%0 Report
%A Giliberti, Jeff
%A Karrenbauer, Andreas
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Improved Online Algorithm for Fractional Knapsack in the Random Order Model : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B637-C
%U https://arxiv.org/abs/2109.04428
%D 2021
%X   The fractional knapsack problem is one of the classical problems in<br>combinatorial optimization, which is well understood in the offline setting.<br>However, the corresponding online setting has been handled only briefly in the<br>theoretical computer science literature so far, although it appears in several<br>applications. Even the previously best known guarantee for the competitive<br>ratio was worse than the best known for the integral problem in the popular<br>random order model. We show that there is an algorithm for the online<br>fractional knapsack problem that admits a competitive ratio of 4.39. Our result<br>significantly improves over the previously best known competitive ratio of 9.37<br>and surpasses the current best 6.65-competitive algorithm for the integral<br>case. Moreover, our algorithm is deterministic in contrast to the randomized<br>algorithms achieving the results mentioned above.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Grohe, Martin
%A Neuen, Daniel
%A Wiebking, Daniel
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Isomorphism Testing for Graphs Excluding Small Minors : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9947-D
%R 10.1109/FOCS46700.2020.00064
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 625 - 636
%I IEEE
%@ 978-1-7281-9621-3

Endnote

%0 Report
%A Kleer, Pieter
%A Simon, Hans Ulrich
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Primal and Dual Combinatorial Dimensions : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B834-D
%U https://arxiv.org/abs/2108.10037
%D 2021
%X   We give tight bounds on the relation between the primal and dual of various<br>combinatorial dimensions, such as the pseudo-dimension and fat-shattering<br>dimension, for multi-valued function classes. These dimensional notions play an<br>important role in the area of learning theory. We first review some (folklore)<br>results that bound the dual dimension of a function class in terms of its<br>primal, and after that give (almost) matching lower bounds. In particular, we<br>give an appropriate generalization to multi-valued function classes of a<br>well-known bound due to Assouad (1983), that relates the primal and dual<br>VC-dimension of a binary function class.<br>
%K Mathematics, Combinatorics, math.CO,Computer Science, Discrete Mathematics, cs.DM,Computer Science, Learning, cs.LG

Endnote

%0 Conference Proceedings
%A Kleer, Pieter
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Sampling from the Gibbs Distribution in Congestion Games : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B3F8-5
%R 10.1145/3465456.3467597
%D 2021
%B 22nd ACM Conference on Economics and Computation
%Z date of event: 2021-07-18 - 2021-07-23
%C Budapest, Hungary (Virtual)
%B EC '21
%E Biró, Péter; Chawla, Shuchi; Echenique, Federico; Sodomka, Eric
%P 679 - 680
%I ACM
%@ 978-1-4503-8554-1

Endnote

%0 Report
%A Kleer, Pieter
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Sampling from the Gibbs Distribution in Congestion Games : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E54C-1
%U https://arxiv.org/abs/2105.12982
%D 2021
%X   Logit dynamics is a form of randomized game dynamics where players have a<br>bias towards strategic deviations that give a higher improvement in cost. It is<br>used extensively in practice. In congestion (or potential) games, the dynamics<br>converges to the so-called Gibbs distribution over the set of all strategy<br>profiles, when interpreted as a Markov chain. In general, logit dynamics might<br>converge slowly to the Gibbs distribution, but beyond that, not much is known<br>about their algorithmic aspects, nor that of the Gibbs distribution. In this<br>work, we are interested in the following two questions for congestion games: i)<br>Is there an efficient algorithm for sampling from the Gibbs distribution? ii)<br>If yes, do there also exist natural randomized dynamics that converges quickly<br>to the Gibbs distribution?<br>  We first study these questions in extension parallel congestion games, a<br>well-studied special case of symmetric network congestion games. As our main<br>result, we show that there is a simple variation on the logit dynamics (in<br>which we in addition are allowed to randomly interchange the strategies of two<br>players) that converges quickly to the Gibbs distribution in such games. This<br>answers both questions above affirmatively. We also address the first question<br>for the class of so-called capacitated $k$-uniform congestion games.<br>  To prove our results, we rely on the recent breakthrough work of Anari, Liu,<br>Oveis-Gharan and Vinzant (2019) concerning the approximate sampling of the base<br>of a matroid according to strongly log-concave probability distribution.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT,Computer Science, Discrete Mathematics, cs.DM,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Journal Article
%A Kleer, Pieter
%A Schäfer, Guido
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Computation and Efficiency of Potential Function Minimizers of Combinatorial Congestion Games : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0006-F285-2
%R 10.1007/s10107-020-01546-6
%7 2020
%D 2021
%J Mathematical Programming
%V 190
%N 1
%& 523
%P 523 - 560
%I Springer
%C New York, NY

Endnote

%0 Report
%A Künnemann, Marvin
%A Nusser, André
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-B462-D
%U https://arxiv.org/abs/2111.02544
%D 2021
%X   We revisit the classical problem of determining the largest copy of a simple<br>polygon $P$ that can be placed into a simple polygon $Q$. Despite significant<br>effort, known algorithms require high polynomial running times. (Barequet and<br>Har-Peled, 2001) give a lower bound of $n^{2-o(1)}$ under the 3SUM conjecture<br>when $P$ and $Q$ are (convex) polygons with $\Theta(n)$ vertices each. This<br>leaves open whether we can establish (1) hardness beyond quadratic time and (2)<br>any superlinear bound for constant-sized $P$ or $Q$.<br>  In this paper, we affirmatively answer these questions under the $k$SUM<br>conjecture, proving natural hardness results that increase with each degree of<br>freedom (scaling, $x$-translation, $y$-translation, rotation): (1) Finding the<br>largest copy of $P$ that can be $x$-translated into $Q$ requires time<br>$n^{2-o(1)}$ under the 3SUM conjecture. (2) Finding the largest copy of $P$<br>that can be arbitrarily translated into $Q$ requires time $n^{2-o(1)}$ under<br>the 4SUM conjecture. (3) The above lower bounds are almost tight when one of<br>the polygons is of constant size: we obtain an $\tilde O((pq)^{2.5})$-time<br>algorithm for orthogonal polygons $P,Q$ with $p$ and $q$ vertices,<br>respectively. (4) Finding the largest copy of $P$ that can be arbitrarily<br>rotated and translated into $Q$ requires time $n^{3-o(1)}$ under the 5SUM<br>conjecture.<br>  We are not aware of any other such natural $($degree of freedom $+ 1)$-SUM<br>hardness for a geometric optimization problem.<br>
%K Computer Science, Computational Geometry, cs.CG,Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Lenzen, Christoph
%A Vahidi, Hossein
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Approximate Minimum Directed Spanning Trees Under Congestion : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E553-8
%R 10.1007/978-3-030-79527-6_20
%D 2021
%B 28th International Colloquium on Structural Information and Communication Complexity
%Z date of event: 2021-06-28 - 2021-07-01
%C Wrocław, Poland (Online)
%B Structural Information and Communication Complexity
%E Jurdziński, Tomasz; Schmid, Stefan
%P 352 - 369
%I Springer
%@ 978-3-030-79526-9
%B Lecture Notes in Computer Science
%N 12810

Endnote

%0 Journal Article
%A Lokshtanov, Daniel
%A Misra, Pranabendu
%A Mukherjee, Joydeep
%A Panolan, Fahad
%A Philip, Geevarghese
%A Saurabh, Saket
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T 2-Approximating Feedback Vertex Set in Tournaments  : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-D8F8-D
%R 10.1145/3446969
%7 2021
%D 2021
%J ACM Transactions on Algorithms
%V 17
%N 2
%Z sequence number: 11
%I ACM
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Lokshtanov, Daniel
%A Misra, Pranabendu
%A Ramanujan, M. S.
%A Saurabh, Saket
%A Zehavi, Meirav
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T FPT-approximation for FPT Problems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-D2AE-8
%R 10.1137/1.9781611976465.14
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 199 - 218
%I SIAM
%@ 978-1-61197-646-5

Endnote

%0 Journal Article
%A Madathil, Jayakrishnan
%A Sharma, Roohani
%A Zehavi, Meirav
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-2C54-9
%R 10.1007/s00453-021-00806-x
%7 2021
%D 2021
%J Algorithmica
%V 83
%& 1861
%P 1861 - 1884
%I Springer
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Nederlof, Jesper
%A Węgrzycki, Karol
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000A-CD68-B
%R 10.1145/3406325.3451024
%D 2021
%B 53rd Annual ACM SIGACT Symposium on Theory of Computing
%Z date of event: 2021-06-21 - 2021-06-25
%C Virtual, Italy
%B STOC '21
%E Khuller, Samir; Vassilevska Williams, Virginia
%P 1670 - 1683
%I ACM
%@ 9781450380539

Endnote

%0 Journal Article
%A Nittala, Aditya Shekhar
%A Karrenbauer, Andreas
%A Khan, Arshad
%A Kraus, Tobias
%A Steimle, Jürgen
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Computational Design and Optimization of Electro-physiological Sensors : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-7E62-C
%R 10.1038/s41467-021-26442-1
%7 2021
%D 2021
%J Nature Communications
%O Nat. Commun.
%V 12
%N 1
%Z sequence number: 6351
%I Nature Publishing Group
%C London
%@ false

Endnote

%0 Thesis
%A Pandey, Anurag
%Y Bläser, Markus
%A referee: Ikenmeyer, Christian
%A referee: Mahajan, Meena
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Variety Membership Testing in Algebraic Complexity Theory : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-E9F5-D
%R 10.22028/D291-34244
%F OTHER: hdl:20.500.11880/31479
%U urn:nbn:de:bsz:291--ds-342440
%I Universität des Saarlandes
%C Saarbrücken
%D 2021
%P 128 p.
%V phd
%9 phd
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/31479

Endnote

%0 Conference Proceedings
%A Polak, Adam
%A Rohwedder, Lars
%A Węgrzycki, Karol
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Knapsack and Subset Sum with Small Items : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1EEF-7
%R 10.4230/LIPIcs.ICALP.2021.106
%U urn:nbn:de:0030-drops-141752
%U https://drops.dagstuhl.de/opus/volltexte/2021/14175/
%D 2021
%B 48th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2021-07-12 - 2020-07-16
%C Glasgow, UK (Virtual Conference)
%B 48th International Colloquium on Automata, Languages, and Programming
%E Bansal, Nikhil; Merelli, Emanuela; Worrell, James
%P 1 - 19
%Z sequence number: 106
%I Schloss Dagstuhl
%@ 978-3-95977-195-5
%B Leibniz International Proceedings in Informatics
%N 198
%@ false

Endnote

%0 Conference Proceedings
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Fair and Efficient Allocations under Subadditive Valuations : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9370-4
%U  https://ojs.aaai.org/index.php/AAAI/article/view/16665
%D 2021
%B Thirty-Fifth AAAI Conference on Artificial Intelligence
%Z date of event: 2021-02-02 - 2021-02-09
%C Virtual Conference
%B AAAI Technical Track on Game Theory and Economic Paradigms
%P 5269 - 5276
%I AAAI
%@ 978-1-57735-866-4
%U https://ojs.aaai.org/index.php/AAAI/article/view/16665

Endnote

%0 Report
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A Mehlhorn, Kurt
%A Mehta, Ruta
%A Misra, Pranabendu
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Improving EFX Guarantees through Rainbow Cycle Number : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-DB40-9
%U https://arxiv.org/abs/2103.01628
%D 2021
%X We study the problem of fairly allocating a set of indivisible goods among<br>$n$ agents with additive valuations. Envy-freeness up to any good (EFX) is<br>arguably the most compelling fairness notion in this context. However, the<br>existence of EFX allocations has not been settled and is one of the most<br>important problems in fair division. Towards resolving this problem, many<br>impressive results show the existence of its relaxations, e.g., the existence<br>of $0.618$-EFX allocations, and the existence of EFX at most $n-1$ unallocated<br>goods. The latter result was recently improved for three agents, in which the<br>two unallocated goods are allocated through an involved procedure. Reducing the<br>number of unallocated goods for arbitrary number of agents is a systematic way<br>to settle the big question. In this paper, we develop a new approach, and show<br>that for every $\varepsilon \in (0,1/2]$, there always exists a<br>$(1-\varepsilon)$-EFX allocation with sublinear number of unallocated goods and<br>high Nash welfare.<br>  For this, we reduce the EFX problem to a novel problem in extremal graph<br>theory. We introduce the notion of rainbow cycle number $R(\cdot)$. For all $d<br>\in \mathbb{N}$, $R(d)$ is the largest $k$ such that there exists a $k$-partite<br>digraph $G =(\cup_{i \in [k]} V_i, E)$, in which<br>  1) each part has at most $d$ vertices, i.e., $\lvert V_i \rvert \leq d$ for<br>all $i \in [k]$,<br>  2) for any two parts $V_i$ and $V_j$, each vertex in $V_i$ has an incoming<br>edge from some vertex in $V_j$ and vice-versa, and<br>  3) there exists no cycle in $G$ that contains at most one vertex from each<br>part.<br>  We show that any upper bound on $R(d)$ directly translates to a sublinear<br>bound on the number of unallocated goods. We establish a polynomial upper bound<br>on $R(d)$, yielding our main result. Furthermore, our approach is constructive,<br>which also gives a polynomial-time algorithm for finding such an allocation.<br>
%K Computer Science, Computer Science and Game Theory, cs.GT,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Ray Chaudhury, Bhaskar
%A Garg, Jugal
%A McGlaughlin, Peter
%A Mehta, Ruta
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Competitive Allocation of a Mixed Manna : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9365-1
%R 10.1137/1.9781611976465.85
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 1405 - 1424
%I SIAM
%@ 978-1-61197-646-5

Endnote

%0 Journal Article
%A Ray Chaudhury, Bhaskar
%A Kavitha, Telikepalli
%A Mehlhorn, Kurt
%A Sgouritsa, Alkmini
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T A Little Charity Guarantees Almost Envy-Freeness : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-2B38-9
%R 10.1137/20M1359134
%7 2021
%D 2021
%J SIAM Journal on Computing
%V 50
%N 4
%& 1336
%P 1336 - 1358
%I SIAM
%C Philadelphia, PA
%@ false

Endnote

%0 Conference Proceedings
%A Roth, Marc
%A Schmitt, Johannes
%A Wellnitz, Philip
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0009-AFBF-C
%R 10.4230/LIPIcs.ICALP.2021.108
%U urn:nbn:de:0030-drops-141778
%D 2021
%B 48th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2021-07-12 - 2020-07-16
%C Glasgow, UK (Virtual Conference)
%B 48th International Colloquium on Automata, Languages, and Programming
%E Bansal, Nikhil; Merelli, Emanuela; Worrell, James
%P 1 - 16
%Z sequence number: 108
%I Schloss Dagstuhl
%@ 978-3-95977-195-5
%B Leibniz International Proceedings in Informatics
%N 198
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2021/14177/

Endnote

%0 Conference Proceedings
%A Roth, Marc
%A Schmitt, Johannes
%A Wellnitz, Philip
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Counting Small Induced Subgraphs Satisfying Monotone Properties : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8C5E-3
%R 10.1109/FOCS46700.2020
%D 2021
%B 61st Annual IEEE Symposium on Foundations of Computer Science
%Z date of event: 2020-11-16 - 2020-11-19
%C Durham, NC, USA (Virtual Conference)
%B FOCS 2020
%P 1356 - 1367
%I IEEE
%@ 978-1-7281-9621-3

Endnote

%0 Conference Proceedings
%A Vitting Klinkby, Kristine
%A Misra, Pranabendu
%A Saurabh, Saket
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Strong Connectivity Augmentation is FPT : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-D2A6-0
%R 10.1137/1.9781611976465.15
%D 2021
%B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2021-01-10 - 2021-01-13
%C Alexandria, VA, USA (Virtual Conference)
%B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms
%E Marx, Dániel
%P 219 - 234
%I SIAM
%@ 978-1-61197-646-5

Endnote

%0 Thesis
%A Wellnitz, Philip
%Y Mehlhorn, Kurt
%A referee: Landau, Gad M.
%A referee: Grohe, Martin
%A referee: Bringmann, Karl
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
International Max Planck Research School, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Counting Patterns in Strings and Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-1ED8-0
%R 10.22028/D291-35098
%U urn:nbn:de:bsz:291--ds-350981
%F OTHER: hdl:20.500.11880/32103
%I Universität des Saarlandes
%C Saarbrücken
%D 2021
%P 253 p.
%V phd
%9 phd
%U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/32103

Endnote

%0 Conference Proceedings
%A Zandieh, Amir
%A Han, Insu
%A Avron, Haim
%A Shoham, Neta
%A Kim, Chaewon
%A Shin, Jinwoo
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
External Organizations
%T Scaling Neural Tangent Kernels via Sketching and Random Features : 
%G eng
%U http://hdl.handle.net/21.11116/0000-000C-90E3-0
%D 2021
%B 35th Conference on Neural Information Processing Systems
%Z date of event: 2021-12-06 - 2021-12-14
%C Virtual
%B Advances in Neural Information Processing Systems 34
%E Ranzato, M.; Beygelzimer, A.; Dauphin, Y.; Liang, P. S.; Wortman Vaughan, J.
%P 1062 - 1073
%I Curran Assoicates, Inc.

Endnote

%0 Conference Proceedings
%A Abboud, Amir
%A Backurs, Arturs
%A Bringmann, Karl
%A Künnemann, Marvin
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Impossibility Results for Grammar-Compressed Linear Algebra : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-90DF-B
%D 2020
%B 34th Conference on Neural Information Processing Systems
%Z date of event: 2020-12-06 - 2020-12-12
%C Virtual Event
%B Advances in Neural Information Processing Systems 33
%E Larochelle, H.; Ranzato, M.; Hadsell, R.; Balcan, M. F.; Lin, H.
%P 8810 - 8823
%I Curran Associates, Inc.
%@ 9781713829546
%U https://proceedings.neurips.cc/paper/2020/hash/645e6bfdd05d1a69c5e47b20f0a91d46-Abstract.html

Endnote

%0 Conference Proceedings
%A Abboud, Amir
%A Bringmann, Karl
%A Hermelin, Danny
%A Shabtay, Dvir
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Scheduling Lower Bounds via AND Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-2826-2
%R 10.4230/LIPIcs.ICALP.2020.4
%U urn:nbn:de:0030-drops-124119
%D 2020
%B 47th International Colloquium on Automata, Languages, and Programming
%Z date of event: 2020-07-08 - 2020-07-11
%C Saarbrücken, Germany (Virtual Conference)
%B 47th International Colloquium on Automata, Languages, and Programming
%E Czumaj, Artur; Dawa, Anuj; Merelli, Emanuela
%Z sequence number: 4
%I Schloss Dagstuhl
%@ 978-3-95977-138-2
%B Leibniz International Proceedings in Informatics
%N 168
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2020/12411/https://creativecommons.org/licenses/by/3.0/legalcode

Endnote

%0 Journal Article
%A Abboud, Amir
%A Censor-Hillel, Keren
%A Khoury, Seri
%A Lenzen, Christoph
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0006-F28E-9
%R 10.1007/s00446-020-00373-4
%7 2020
%D 2020
%J Distributed Computing
%V 33
%& 545
%P 545 - 559
%I Springer
%C New York, NY
%@ false

Endnote

%0 Report
%A Abboud, Amir
%A Bringmann, Karl
%A Hermelin, Danny
%A Shabtay, Dvir
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Scheduling Lower Bounds via AND Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-2A52-E
%U https://arxiv.org/abs/2003.07113
%D 2020
%X   Given $N$ instances $(X_1,t_1),\ldots,(X_N,t_N)$ of Subset Sum, the AND<br>Subset Sum problem asks to determine whether all of these instances are<br>yes-instances; that is, whether each set of integers $X_i$ has a subset that<br>sums up to the target integer $t_i$. We prove that this problem cannot be<br>solved in time $\tilde{O}((N \cdot t_{max})^{1-\epsilon})$, for $t_{max}=\max_i<br>t_i$ and any $\epsilon > 0$, assuming the $\forall \exists$ Strong Exponential<br>Time Hypothesis ($\forall \exists$-SETH). We then use this result to exclude<br>$\tilde{O}(n+P_{max} \cdot n^{1-\epsilon})$-time algorithms for several<br>scheduling problems on $n$ jobs with maximum processing time $P_{max}$, based<br>on $\forall \exists$-SETH. These include classical problems such as $1||\sum<br>w_jU_j$, the problem of minimizing the total weight of tardy jobs on a single<br>machine, and $P_2||\sum U_j$, the problem of minimizing the number of tardy<br>jobs on two identical parallel machines.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Achlioptas, Dimitris
%A Gouleakis, Themis
%A Iliopoulos, Fotis
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Simple Local Computation Algorithms for the General Lovász Local Lemma : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8B6D-3
%R 10.1145/3350755.3400250
%D 2020
%B 32nd ACM Symposium on Parallelism in Algorithms and Architectures
%Z date of event: 2020-07-15 - 2020-07-17
%C Virtual Event, USA
%B SPAA '20
%P 1 - 10
%I ACM
%@ 9781450369350

Endnote

%0 Journal Article
%A Agrawal, Akanksha
%A Lokshtanov, Daniel
%A Misra, Pranabendu
%A Saurabh, Saket
%A Zehavi, Meirav
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-4903-4
%R 10.1145/3389338
%7 2020
%D 2020
%J ACM Transactions on Algorithms
%V 16
%N 4
%Z sequence number: 51
%I ACM
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Agrawal, Akanksha
%A Kundu, Madhumita
%A Sahu, Abhishek
%A Saurabh, Saket
%A Tale, Prafullkumar
%+ External Organizations
External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPH : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-D2A4-2
%R 10.1007/978-3-030-58150-3_50
%D 2020
%B 26th International Conference on Computing and Combinatorics
%Z date of event: 2020-08-29 - 2020-08-31
%C Atlanta, GA, USA
%B Computing and Combinatorics
%E Kim, Donghyun; Uma, R. N.; Cai, Zhipeng; Lee, Dong Hoon
%P 615 - 626
%I Springer
%@ 978-3-030-58149-7
%B Lecture Notes in Computer Science
%N 12273

Endnote

%0 Conference Proceedings
%A Alkema, Henk
%A de Berg, Mark
%A Kisfaludi-Bak, Sándor
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Euclidean TSP in Narrow Strips : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-76E5-2
%R 10.4230/LIPIcs.SoCG.2020.4
%U urn:nbn:de:0030-drops-121628
%D 2020
%B 36th International Symposium on Computational Geometry
%Z date of event: 2020-06-23 - 2020-06-26
%C Zürich, Switzerland (Virtual Conference)
%B 36th International Symposium on Computational Geometry
%E Cabello, Sergio; Chen, Danny Z.
%P 1 - 16
%Z sequence number: 4
%I Schloss Dagstuhl
%@ 978-3-95977-143-6
%B Leibniz International Proceedings in Informatics
%N 164
%U https://drops.dagstuhl.de/opus/volltexte/2020/12162/https://creativecommons.org/licenses/by/3.0/legalcode

Endnote

%0 Report
%A Alkema, Henk
%A de Berg, Mark
%A Kisfaludi-Bak, Sándor
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Euclidean TSP in Narrow Strips : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-77A3-B
%U https://arxiv.org/abs/2003.09948
%D 2020
%X   We investigate how the complexity of Euclidean TSP for point sets $P$ inside<br>the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width<br>$\delta$. We obtain two main results. First, for the case where the points have<br>distinct integer $x$-coordinates, we prove that a shortest bitonic tour (which<br>can be computed in $O(n\log^2 n)$ time using an existing algorithm) is<br>guaranteed to be a shortest tour overall when $\delta\leq 2\sqrt{2}$, a bound<br>which is best possible. Second, we present an algorithm that is fixed-parameter<br>tractable with respect to $\delta$. More precisely, our algorithm has running<br>time $2^{O(\sqrt{\delta})} n^2$ for sparse point sets, where each<br>$1\times\delta$ rectangle inside the strip contains $O(1)$ points. For random<br>point sets, where the points are chosen uniformly at random from the<br>rectangle~$[0,n]\times [0,\delta]$, it has an expected running time of<br>$2^{O(\sqrt{\delta})} n^2 + O(n^3)$.<br>
%K Computer Science, Computational Geometry, cs.CG

Endnote

%0 Journal Article
%A Amanatidis, Georgios
%A Kleer, Pieter
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0006-DC7A-A
%R 10.1002/rsa.20949
%7 2020
%D 2020
%J Random Structures and Algorithms
%V 57
%N 3
%& 637
%P 637 - 657
%I Wiley
%C New York, N.Y.
%@ false

Endnote

%0 Conference Proceedings
%A Amiri, Saeed Akhoondian
%A Popa, Alexandru
%A Roghani, Mohammad
%A Shahkarami, Golnoosh
%A Soltani, Reza
%A Vahidi, Hossein
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Complexity of Computing the Anti-Ramsey Numbers for Paths : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9422-B
%R 10.4230/LIPIcs.MFCS.2020.6
%U urn:nbn:de:0030-drops-126781
%D 2020
%B 45th International Symposium on Mathematical Foundations of Computer Science
%Z date of event: 2020-08-25 - 2020-08-26
%C Prague, Czech Republic (Virtual Event)
%B 45th International Symposium on Mathematical Foundations of Computer Science
%E Esparza, Javier; Kràl', Daniel
%Z sequence number: 6
%I Schloss Dagstuhl
%@ 978-3-95977-159-7
%B Leibniz International Proceedings in Informatics 
%N 170
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2020/12678/https://creativecommons.org/licenses/by/3.0/legalcode

Endnote

%0 Report
%A Amiri, Saeed Akhoondian
%A Wiederhake, Ben
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Distributed Distance-r Dominating Set on Sparse High-Girth Graphs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-905B-0
%U https://arxiv.org/abs/1910.02794
%D 2020
%X   The dominating set problem and its generalization, the distance-$r$<br>dominating set problem, are among the well-studied problems in the sequential<br>settings. In distributed models of computation, unlike for domination, not much<br>is known about distance-r domination. This is actually the case for other<br>important closely-related covering problem, namely, the distance-$r$<br>independent set problem. By result of Kuhn et al. we know the distributed<br>domination problem is hard on high girth graphs; we study the problem on a<br>slightly restricted subclass of these graphs: graphs of bounded expansion with<br>high girth, i.e. their girth should be at least $4r + 3$. We show that in such<br>graphs, for every constant $r$, a simple greedy CONGEST algorithm provides a<br>constant-factor approximation of the minimum distance-$r$ dominating set<br>problem, in a constant number of rounds. More precisely, our constants are<br>dependent to $r$, not to the size of the graph. This is the first algorithm<br>that shows there are non-trivial constant factor approximations in constant<br>number of rounds for any distance $r$-covering problem in distributed settings.<br>To show the dependency on r is inevitable, we provide an unconditional lower<br>bound showing the same problem is hard already on rings. We also show that our<br>analysis of the algorithm is relatively tight, that is any significant<br>improvement to the approximation factor requires new algorithmic ideas.<br>
%K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Discrete Mathematics, cs.DM,Mathematics, Combinatorics, math.CO

Endnote

%0 Journal Article
%A Amiri, Saeed Akhoondian
%A Foerster, Klaus-Tycho
%A Schmid, Stefan
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Walking Through Waypoints : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-EDEF-2
%R 10.1007/s00453-020-00672-z
%7 2020
%D 2020
%J Algorithmica
%V 82
%N 7
%& 1784
%P 1784 - 1812
%I Springer-Verlag
%C New York
%@ false

Endnote

%0 Report
%A Anagnostides, Ioannis
%A Gouleakis, Themis
%A Marashian, Ali
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Robust Learning under Strong Noise via SQs : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8B5D-5
%U https://arxiv.org/abs/2010.09106
%D 2020
%X   This work provides several new insights on the robustness of Kearns'<br>statistical query framework against challenging label-noise models. First, we<br>build on a recent result by \cite{DBLP:journals/corr/abs-2006-04787} that<br>showed noise tolerance of distribution-independently evolvable concept classes<br>under Massart noise. Specifically, we extend their characterization to more<br>general noise models, including the Tsybakov model which considerably<br>generalizes the Massart condition by allowing the flipping probability to be<br>arbitrarily close to $\frac{1}{2}$ for a subset of the domain. As a corollary,<br>we employ an evolutionary algorithm by \cite{DBLP:conf/colt/KanadeVV10} to<br>obtain the first polynomial time algorithm with arbitrarily small excess error<br>for learning linear threshold functions over any spherically symmetric<br>distribution in the presence of spherically symmetric Tsybakov noise. Moreover,<br>we posit access to a stronger oracle, in which for every labeled example we<br>additionally obtain its flipping probability. In this model, we show that every<br>SQ learnable class admits an efficient learning algorithm with OPT + $\epsilon$<br>misclassification error for a broad class of noise models. This setting<br>substantially generalizes the widely-studied problem of classification under<br>RCN with known noise rate, and corresponds to a non-convex optimization problem<br>even when the noise function -- i.e. the flipping probabilities of all points<br>-- is known in advance.<br>
%K Statistics, Machine Learning, stat.ML,Computer Science, Learning, cs.LG

Endnote

%0 Conference Proceedings
%A Antoniadis, Antonios
%A Gouleakis, Themis
%A Kleer, Pieter
%A Kolev, Pavel
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Secretary and Online Matching Problems with Machine Learned Advice : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-93CA-F
%D 2020
%B 34th Conference on Neural Information Processing Systems
%Z date of event: 2020-12-06 - 2020-12-12
%C Virtual Event
%B Advances in Neural Information Processing Systems 33
%E Larochelle, H.; Ranzato, M.; Hadsell, R.; Balcan, M. F.; Lin, H.
%P 7933 - 7944
%I Curran Associates, Inc.
%@ 9781713829546

Endnote

%0 Report
%A Antoniadis, Antonios
%A Kisfaludi-Bak, Sándor
%A Laekhanukit, Bundit
%A Vaz, Daniel
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T On the Approximability of the Traveling Salesman Problem with Line
  Neighborhoods : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-77AD-1
%U https://arxiv.org/abs/2008.12075
%D 2020
%X   We study the variant of the Euclidean Traveling Salesman problem where<br>instead of a set of points, we are given a set of lines as input, and the goal<br>is to find the shortest tour that visits each line. The best known upper and<br>lower bounds for the problem in $\mathbb{R}^d$, with $d\ge 3$, are<br>$\mathrm{NP}$-hardness and an $O(\log^3 n)$-approximation algorithm which is<br>based on a reduction to the group Steiner tree problem.<br>  We show that TSP with lines in $\mathbb{R}^d$ is APX-hard for any $d\ge 3$.<br>More generally, this implies that TSP with $k$-dimensional flats does not admit<br>a PTAS for any $1\le k \leq d-2$ unless $\mathrm{P}=\mathrm{NP}$, which gives a<br>complete classification of the approximability of these problems, as there are<br>known PTASes for $k=0$ (i.e., points) and $k=d-1$ (hyperplanes). We are able to<br>give a stronger inapproximability factor for $d=O(\log n)$ by showing that TSP<br>with lines does not admit a $(2-\epsilon)$-approximation in $d$ dimensions<br>under the unique games conjecture. On the positive side, we leverage recent<br>results on restricted variants of the group Steiner tree problem in order to<br>give an $O(\log^2 n)$-approximation algorithm for the problem, albeit with a<br>running time of $n^{O(\log\log n)}$.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Journal Article
%A Antoniadis, Antonios
%A Fleszar, Krzysztof
%A Hoeksma, Ruben
%A Schewior, Kevin
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T A PTAS for Euclidean TSP with Hyperplane Neighborhoods : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0008-0723-9
%R 10.1145/3383466
%7 2020
%D 2020
%J ACM Transactions on Algorithms
%V 16
%N 3
%Z sequence number: 38
%I ACM
%C New York, NY
%@ false

Endnote

%0 Conference Proceedings
%A Antoniadis, Antonios
%A Garg, Naveen
%A Kumar, Gunjan
%A Kumar, Nikhil
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T Parallel Machine Scheduling to Minimize Energy Consumption : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0006-F26A-2
%R 10.5555/3381089.3381257
%D 2020
%B 31st Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2020-01-05 - 2020-01-08
%C Salt Lake City, UT, USA
%B Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms
%E Chawla, Shuchi
%P 2758 - 2769
%I SIAM
%@ 978-1-61197-599-4

Endnote

%0 Conference Proceedings
%A Antoniadis, Antonios
%A Coester, Christian
%A Elias, Marek
%A Polak, Adam
%A Simon, Bertrand
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
External Organizations
%T Online Metric Algorithms with Untrusted Predictions : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-93BF-C
%D 2020
%B 37th International Conference on Machine Learning
%Z date of event: 2020-07-13 - 2020-07-18
%C Virtual Conference
%B Proceedings of the 37th International Conference on Machine Learning
%E Daumé, Hal; Singh, Aarti
%P 345 - 355
%I MLResearchPress
%B Proceedings of Machine Learning Research
%N 119
%@ false
%U http://proceedings.mlr.press/v119/antoniadis20a/antoniadis20a.pdf

Endnote

%0 Conference Proceedings
%A Antoniadis, Antonios
%A Cristi, Andrés
%A Oosterwijk, Tim
%A Sgouritsa, Alkmini
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T A General Framework for Energy-Efficient Cloud Computing Mechanisms : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-93A5-8
%U https://dl.acm.org/doi/10.5555/3398761.3398775
%D 2020
%B 19th International Conference on Autonomous Agents and MultiAgent Systems
%Z date of event: 2020-05-09 - 2020-05-13
%C Auckland, New Zealand (Virtual)
%B AAMAS'20
%E El Fallah Seghruchni, Amal; Sukthankr, Gita; An, Bo; Yorke-Smith, Neil
%P 70 - 78
%I ACM
%@ 978-1-4503-7518-4

Endnote

%0 Report
%A Antoniadis, Antonios
%A Gouleakis, Themis
%A Kleer, Pieter
%A Kolev, Pavel
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Secretary and Online Matching Problems with Machine Learned Advice : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-8B7A-4
%U https://arxiv.org/abs/2006.01026
%D 2020
%X   The classical analysis of online algorithms, due to its worst-case nature,<br>can be quite pessimistic when the input instance at hand is far from<br>worst-case. Often this is not an issue with machine learning approaches, which<br>shine in exploiting patterns in past inputs in order to predict the future.<br>However, such predictions, although usually accurate, can be arbitrarily poor.<br>Inspired by a recent line of work, we augment three well-known online settings<br>with machine learned predictions about the future, and develop algorithms that<br>take them into account. In particular, we study the following online selection<br>problems: (i) the classical secretary problem, (ii) online bipartite matching<br>and (iii) the graphic matroid secretary problem. Our algorithms still come with<br>a worst-case performance guarantee in the case that predictions are subpar<br>while obtaining an improved competitive ratio (over the best-known classical<br>online algorithm for each problem) when the predictions are sufficiently<br>accurate. For each algorithm, we establish a trade-off between the competitive<br>ratios obtained in the two respective cases.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Arunachalam, Srinivasan
%A Chakraborty, Sourav
%A Koucký, Michal
%A Saurabh, Nitin
%A de Wolf, Ronald
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Improved Bounds on Fourier Entropy and Min-entropy : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0006-97AB-F
%R 10.4230/LIPIcs.STACS.2020.45
%U urn:nbn:de:0030-drops-119062
%D 2020
%B 37th International Symposium on Theoretical Aspects of Computer Science
%Z date of event: 2020-03-10 - 2020-03-13
%C Montpellier, France
%B 37th International Symposium on Theoretical Aspects of Computer Science
%E Paul, Christophe; Bläser, Markus
%P 1 - 19
%Z sequence number: 45
%I Schloss Dagstuhl
%@ 978-3-95977-140-5
%B Leibniz International Proceedings in Informatics
%N 154
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2020/11906/

Endnote

%0 Report
%A Axiotis, Kyriakos
%A Backurs, Arturs
%A Bringmann, Karl
%A Jin, Ce
%A Nakos, Vasileios
%A Tzamos, Christos
%A Wu, Hongxun
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T Fast and Simple Modular Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-2A5B-5
%U https://arxiv.org/abs/2008.10577
%D 2020
%X   We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$<br>for some given integer $m$. A series of recent works has provided<br>asymptotically optimal algorithms for this problem under the Strong Exponential<br>Time Hypothesis. Koiliaris and Xu (SODA'17, TALG'19) gave a deterministic<br>algorithm running in time $\tilde{O}(m^{5/4})$, which was later improved to<br>$O(m \log^7 m)$ randomized time by Axiotis et al. (SODA'19). In this work, we<br>present two simple algorithms for the Modular Subset Sum problem running in<br>near-linear time in $m$, both efficiently implementing Bellman's iteration over<br>$\mathbb{Z}_m$. The first one is a randomized algorithm running in time<br>$O(m\log^2 m)$, that is based solely on rolling hash and an elementary<br>data-structure for prefix sums; to illustrate its simplicity we provide a short<br>and efficient implementation of the algorithm in Python. Our second solution is<br>a deterministic algorithm running in time $O(m\ \mathrm{polylog}\ m)$, that<br>uses dynamic data structures for string manipulation. We further show that the<br>techniques developed in this work can also lead to simple algorithms for the<br>All Pairs Non-Decreasing Paths Problem (APNP) on undirected graphs, matching<br>the asymptotically optimal running time of $\tilde{O}(n^2)$ provided in the<br>recent work of Duan et al. (ICALP'19).<br>
%K Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Becker, Ruben
%A Emek, Yuval
%A Lenzen, Christoph
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Low Diameter Graph Decompositions by Approximate Distance Computation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0005-A7A7-2
%R 10.4230/LIPIcs.ITCS.2020.50
%U urn:nbn:de:0030-drops-117355
%D 2020
%B 11th Innovations in Theoretical Computer Science Conference
%Z date of event: 2020-01-12 - 2020-01-14
%C Seattle, WA, USA
%B 11th Innovations in Theoretical Computer Science Conference
%E Vidick, Thomas
%Z sequence number: 50
%I Schloss Dagstuhl
%@ 978-3-95977-134-4
%B Leibniz International Proceedings in Informatics
%N 151
%@ false
%U https://drops.dagstuhl.de/opus/volltexte/2020/11735/https://drops.dagstuhl.de/doku/urheberrecht1.html

Endnote

%0 Journal Article
%A Bilò, Davide
%A Gualà, Luciano
%A Leucci, Stefano
%A Proietti, Guido
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Tracking Routes in Communication Networks : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-72EF-C
%R 10.1016/j.tcs.2020.07.012
%7 2020
%D 2020
%J Theoretical Computer Science
%V 844
%& 1
%P 1 - 15
%I Elsevier
%C Amsterdam
%@ false

Endnote

%0 Report
%A Bonifaci, Vincenzo
%A Facca, Enrico
%A Folz, Frederic
%A Karrenbauer, Andreas
%A Kolev, Pavel
%A Mehlhorn, Kurt
%A Morigi, Giovanna
%A Shahkarami, Golnoosh
%A Vermande, Quentin
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Physarum Multi-Commodity Flow Dynamics : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-2312-D
%U https://arxiv.org/abs/2009.01498
%D 2020
%X   In wet-lab experiments \cite{Nakagaki-Yamada-Toth,Tero-Takagi-etal}, the<br>slime mold Physarum polycephalum has demonstrated its ability to solve shortest<br>path problems and to design efficient networks, see Figure \ref{Wet-Lab<br>Experiments} for illustrations. Physarum polycephalum is a slime mold in the<br>Mycetozoa group. For the shortest path problem, a mathematical model for the<br>evolution of the slime was proposed in \cite{Tero-Kobayashi-Nakagaki} and its<br>biological relevance was argued. The model was shown to solve shortest path<br>problems, first in computer simulations and then by mathematical proof. It was<br>later shown that the slime mold dynamics can solve more general linear programs<br>and that many variants of the dynamics have similar convergence behavior. In<br>this paper, we introduce a dynamics for the network design problem. We<br>formulate network design as the problem of constructing a network that<br>efficiently supports a multi-commodity flow problem. We investigate the<br>dynamics in computer simulations and analytically. The simulations show that<br>the dynamics is able to construct efficient and elegant networks. In the<br>theoretical part we show that the dynamics minimizes an objective combining the<br>cost of the network and the cost of routing the demands through the network. We<br>also give alternative characterization of the optimum solution.<br>
%K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Neural and Evolutionary Computing, cs.NE

Endnote

%0 Conference Proceedings
%A Brankovic, Milutin
%A Buchin, Kevin
%A Klaren, Koen
%A Nusser, André
%A Popov, Aleksandr
%A Wong, Sampson
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
%T (k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warpin : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-9068-1
%R 0.1145/3397536.3422245
%D 2020
%B 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
%Z date of event: 2020-11-03 - 2020-11-06
%C Seattle, WA, USA (Online)
%B 28th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 
%E Lu, Chang-Tien; Wag, Fusheng; Trajcevski, Goce; Huang, Yan; Newsam, Shawn; Xiong, Li
%P 99 - 110
%I ACM
%@ 9781450380195

Endnote

%0 Report
%A Bringmann, Karl
%A Künnemann, Marvin
%A Nusser, André
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-2A56-A
%U https://arxiv.org/abs/2008.07510
%D 2020
%X   Consider the natural question of how to measure the similarity of curves in<br>the plane by a quantity that is invariant under translations of the curves.<br>Such a measure is justified whenever we aim to quantify the similarity of the<br>curves' shapes rather than their positioning in the plane, e.g., to compare the<br>similarity of handwritten characters. Perhaps the most natural such notion is<br>the (discrete) Fr\'echet distance under translation. Unfortunately, the<br>algorithmic literature on this problem yields a very pessimistic view: On<br>polygonal curves with $n$ vertices, the fastest algorithm runs in time<br>$O(n^{4.667})$ and cannot be improved below $n^{4-o(1)}$ unless the Strong<br>Exponential Time Hypothesis fails. Can we still obtain an implementation that<br>is efficient on realistic datasets?<br>  Spurred by the surprising performance of recent implementations for the<br>Fr\'echet distance, we perform algorithm engineering for the Fr\'echet distance<br>under translation. Our solution combines fast, but inexact tools from<br>continuous optimization (specifically, branch-and-bound algorithms for global<br>Lipschitz optimization) with exact, but expensive algorithms from computational<br>geometry (specifically, problem-specific algorithms based on an arrangement<br>construction). We combine these two ingredients to obtain an exact decision<br>algorithm for the Fr\'echet distance under translation. For the related task of<br>computing the distance value up to a desired precision, we engineer and compare<br>different methods. On a benchmark set involving handwritten characters and<br>route trajectories, our implementation answers a typical query for either task<br>in the range of a few milliseconds up to a second on standard desktop hardware.<br>  We believe that our implementation will enable the use of the Fr\'echet<br>distance under translation in applications, whereas previous approaches would<br>have been computationally infeasible.<br>
%K Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS

Endnote

%0 Conference Proceedings
%A Bringmann, Karl
%A Nakos, Vasileios
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Top-k-convolution and the Quest for Near-linear Output-sensitive Subset Sum : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0007-299D-B
%R 10.1145/3357713.3384308
%D 2020
%B 52nd Annual ACM SIGACT Symposium on Theory of Computing
%Z date of event: 2020-06-22 - 2020-06-26
%C Chicago, IL, USA
%B STOC '20
%E Makarychev, Konstantin; Makarychev, Yury; Tulsiani, Madhur; Kamath, Gautam; Chuzhoy, Julia
%P 982 - 995
%I ACM
%@ 978-1-4503-6979-4

Endnote