activity
20032023
most citedMinimum-weight triangulation is NP-hard

182 citations · 549 across the 43 of their papers we have counts for

collaborators

49 papers

math.CO2023

The Generalized Combinatorial Lason-Alon-Zippel-Schwartz Nullstellensatz Lemma

Günter Rote

We survey a few strengthenings and generalizations of the Combinatorial Nullstellensatz of Alon and the Schwartz-Zippel Lemma. These lemmas guarantee the existence of (a certain nu…

cs.CG2023

The Two-Squirrel Problem and Its Relatives

Sergey Bereg, Yuya Higashikawa, Naoki Katoh +3

In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set of points in the plane, and two sites and , comp…

math.MG2022

Towards a Geometric Understanding of the 4-Dimensional Point Groups

Laith Rastanawi, Günter Rote

We classify the finite groups of orthogonal transformations in 4-space, and we study these groups from the viewpoint of their geometric action, using polar orbit polytopes. For one…

cs.CG2022

Removing Popular Faces in Curve Arrangements

Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger +4

A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate…

math.CO2021

Optimal strategies in fractional games: vertex cover and domination

Csilla Bujtás, Günter Rote, Zsolt Tuza

In a hypergraph with vertex set and edge set , a real-valued function is a fractional transversal if for every edge . I…

math.CO2020

An almost optimal bound on the number of intersections of two simple polygons

Eyal Ackerman, Balázs Keszegh, Günter Rote

What is the maximum number of intersections of the boundaries of a simple -gon and a simple -gon, assuming general position? This is a basic question in combinatorial geometr…