activity
20032023
most citedMinimum-weight triangulation is NP-hard

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

collaborators
Showing 2019Show all

8 papers · 1 filter

math.GT2019★ 4 cited

PL Morse theory in low dimensions

Romain Grunert, Wolfgang Kühnel, Günter Rote

We discuss a PL analogue of Morse theory for PL manifolds. There are several notions of regular and critical points. A point is homologically regular if the homology does not chang…

cs.DS2019★ 13 cited

FPT Algorithms for Diverse Collections of Hitting Sets

Julien Baste, Lars Jaffke, Tomáš Masařík +2

In this work, we study the -Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of solutions of size at most each, which has…

cs.CG2019★ 3 cited

The Largest Contained Quadrilateral and the Smallest Enclosing Parallelogram of a Convex Polygon

Günter Rote

We present a linear-time algorithm for finding the quadrilateral of largest area contained in a convex polygon, and we show that it is closely related to an old algorithm for the s…

math.CO2019★ 1 cited

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…

cs.DM2019

Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results

Günter Rote

A tree with vertices has at most minimal dominating sets. The growth constant is best possible. It is obtained in a semi-automa…

math.CO2019★ 1 cited

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…