Lasse Wulf

activity

20232026

most citedRecognition of Unit Segment and Polyline Graphs is

\exists R

-Complete

2 citations · 4 across the 7 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DM2026

The Gallai Vertex Problem is $Θ_{2}^{p}$ -Complete

Amir Nikabadi, Eva Rotenberg, Lasse Wulf

When a graph $G$ admits a vertex $v$ that is contained in all its longest paths, we call $v$ a Gallai vertex. These are named after Gallai, who in 1966 asked the question if it is…

cs.CC2026

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP

Christoph Grüne, Berit Johannes, James B. Orlin +1

Many natural optimization problems derived from $NP$ admit bilevel and multilevel extensions in which decisions are made sequentially by multiple players with conflicting objec…

cs.CG2026

The Presort Hierarchy for Geometric Problems

Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson +1

Many fundamental problems in computational geometry admit no algorithm running in $o (n lo g n)$ time for $n$ planar input points, via classical reductions from sorting. Prominent e…

The Gallai Vertex Problem is Θ2p​-Complete

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP

The Presort Hierarchy for Geometric Problems

The Gallai Vertex Problem is $Θ_{2}^{p}$ -Complete