364 citations
- Saarland UniversityDE22 papers
- Max Planck Institute for InformaticsDE20 papers
- Ruhr University BochumDE12 papers
- Max Planck Institute for Security and PrivacyDE7 papers
- Purdue University West LafayetteUS7 papers
- Leibniz University HannoverDE6 papers
- Max Planck SocietyDE6 papers
- Stanford UniversityUS6 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Max Planck Institute for Software SystemsDE5 papers
- Technical University of MunichDE5 papers
- Technische Universität BerlinDE5 papers
5 papers · 1 filter
Faster Exponential Algorithms for Multi-Machine Scheduling Problems
Anubhav Dhar, Anita Dürr, Ahmed Ghazy +2
Minimizing the weighted completion times () and weighted number of tardy jobs () on multiple identical machines are two classical NP-har…
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6
We consider the well-studied Robust -Clustering problem, which generalizes the classic -Median, -Means, and -Center problems. Given a constant , the input…
Computing Generalized Convolutions Faster Than Brute Force
Barış Can Esmer, Ariel Kulik, Dániel Marx +2
In this paper, we consider a general notion of convolution. Let be a finite domain and let be the set of -length vectors (tuples) of . Let be…
Hypergraph Isomorphism for Groups with Restricted Composition Factors
Daniel Neuen
We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices and a permutation group over domain , and asking whethe…
A subexponential parameterized algorithm for Directed Subset Traveling Salesman Problem on planar graphs
Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk
There are numerous examples of the so-called ``square root phenomenon'' in the field of parameterized algorithms: many of the most fundamental graph problems, parameterized by some…