Lucas Isenmann

activity

20172026

most citedOn the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs

1 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing 2018 · cs.DMShow all

2 papers · 2 filters

cs.DM2018

Dushnik-Miller dimension of TD-Delaunay complexes

Daniel Gonçalves, Lucas Isenmann

TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et.…

cs.DM2018

Discrete Morse theory for the collapsibility of supremum sections

Balthazar Bauer, Lucas Isenmann

The Dushnik-Miller dimension of a poset $\leq$ is the minimal number $d$ of linear extensions $\leq_{1}, \dots, \leq_{d}$ of $\leq$ such that $\leq$ is the intersection of $\le_1, \ldots…