5 citations · 8 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
More bisections by hyperplane arrangements
Pavle V. M. Blagojević, Aleksandra Dimitrijević Blagojević, Roman Karasev +1
A union of an arrangement of affine hyperplanes in is the real algebraic variety associated to the principal ideal generated by the polynomial given as the produc…