5 citations · 8 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2021
A new -partite graph -clique iterator and the optimal colored Tverberg problem for ten colored points
Jonathan Kliem
We provide an algorithm that verifies the optimal colored Tverberg problem for points in the plane: Every points in the plane in color classes of size at most can be…
math.CO2021
Counting Gray codes for an improved upper bound of the Grünbaum-Hadwiger-Ramos problem
Jonathan Kliem
We give an improved upper bound for the Grünbaum--Hadwiger--Ramos problem: Let such that . Given masses on , t…
math.CO2019★ 3 cited
A new face iterator for polyhedra and more general finite locally branched lattices
Jonathan Kliem, Christian Stump
We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied t…