182 citations · 549 across the 43 of their papers we have counts for
10 papers · 1 filter
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…
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…
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…
Characterization of the response maps of alternating-current networks
Günter Rote
In an alternating-current network, each edge has a complex "conductance" with positive real part. The response map is the linear map from the vector of voltages at a subset of "bou…
The Number of Convex Polyominoes with Given Height and Width
Kevin Buchin, Man-Kwun Chiu, Stefan Felsner +2
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that…
Every Collinear Set in a Planar Graph Is Free
Vida Dujmović, Fabrizio Frati, Daniel Gonçalves +2
We show that if a planar graph has a plane straight-line drawing in which a subset of its vertices are collinear, then for any set of points, , in the plane with $|X|=|S…