1 citations · 2 across the 8 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CC2018★ 1 cited
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-p…
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 is the minimal number of linear extensions of such that is the intersection of $\le_1, \ldots…