302 citations · 303 across the 3 of their papers we have counts for
4 papers · 1 filter
Minimum-Error Triangulations for Sea Surface Reconstruction
Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert +6
We apply state-of-the-art computational geometry methods to the problem of reconstructing a time-varying sea surface from tide gauge records. Our work builds on a recent article by…
The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs
Petra Mutzel, Lutz Oettershagen
The Harary-Hill Conjecture states that for every drawing of has at least \begin{align*} H(n) := \frac{1}{4}\Big\lfloor\frac{n}{2}\Big\rfloor\Big\lfloor\frac{n-1}{2}…
The Crossing Number of Seq-Shellable Drawings of Complete Graphs
Petra Mutzel, Lutz Oettershagen
The Harary-Hill conjecture states that for every the complete graph on vertices , the minimum number of crossings over all its possible drawings equals \begin{align*…
New Integer Linear Programming Models for the Vertex Coloring Problem
Adalat Jabrayilov, Petra Mutzel
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different fro…