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
4 papers · 1 filter
On Approximate MMS Allocations on Restricted Graph Classes
Václav Blažej, Michał Dębski, Zbigniew Lonc +2
We study the problem of fair division of a set of indivisible goods with connectivity constraints. Specifically, we assume that the goods are represented as vertices of a connected…
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
Jacob Focke, Leslie Ann Goldberg, Marc Roth +1
We study the problem of counting answers to unions of conjunctive queries (UCQs) under structural restrictions on the input query. Concretely, given a class C of UCQs, the problem…
Sample compression schemes for balls in graphs
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney +2
One of the open problems in machine learning is whether any set-family of VC-dimension admits a sample compression scheme of size . In this paper, we study this problem f…
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Mean…