29 citations · 74 across the 56 of their papers we have counts for
4 papers · 1 filter
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms
Rinat Ben-Avraham, Matthias Henze, Rafel Jaume +4
We consider the RMS distance (sum of squared distances between pairs of points) under translation between two point sets in the plane, in two different setups. In the partial-match…
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
Balázs Keszegh, Dömötör Pálvölgyi
The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract ver…
On the Tree Search Problem with Non-uniform Costs
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický +2
Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge repre…
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem
Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow
Let with and be two sets. We assume that every element has a reference list over all elements from . We call an injective mapping fro…