73 citations · 178 across the 49 of their papers we have counts for
4 papers · 1 filter
Making Triangles Colorful
Jean Cardinal, Kolja Knauer, Piotr Micek +1
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at…
Combinatorial and Geometric Properties of Planar Laman Graphs
Stephen Kobourov, Torsten Ueckerdt, Kevin Verbeek
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed i…
Three ways to cover a graph
Kolja Knauer, Torsten Ueckerdt
We consider the problem of covering an input graph with graphs from a fixed covering class . The classical covering number of with respect to is the minimum number o…
Non-crossing Connectors in the Plane
Jan Kratochvíl, Torsten Ueckerdt
We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i…