15 citations · 21 across the 8 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DM2017
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for s…
cs.CG2017★ 15 cited
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
Oswin Aichholzer, Thomas Hackl, Matias Korman +5
We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph on any set of points in general position…
cs.RO2017
Lower Bounds for Searching Robots, some Faulty
Andrey Kupavskii, Emo Welzl
Suppose we are sending out robots from to search the real line at constant speed (with turns) to find a target at an unknown location; of the robots are faulty, meaning…