4 papers
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…
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.…
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…
Planar graphs as L-intersection or L-contact graphs
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact…