Lucas Isenmann

According to our database, Lucas Isenmann authored at least 9 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter.

Faisal N. Abu-Khzam, Lucas Isenmann

CoRR, 2024

2023

Degreewidth: A New Parameter for Solving Problems on Tournaments.

Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2021

On the Approximation Hardness of Geodetic Set and Its Variants.

Tom Davot, Lucas Isenmann, Jocelyn Thiebaut

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Dushnik-Miller dimension of TD-Delaunay complexes.

Daniel Gonçalves, Lucas Isenmann

Eur. J. Comb., 2020

On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs.

Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut

Algorithmica, 2020

2019

From planar graphs to higher dimension. (Des graphes planaires vers des dimensions supérieures).

Lucas Isenmann

PhD thesis, 2019

2018

Discrete Morse theory for the collapsibility of supremum sections.

Balthazar Bauer, Lucas Isenmann

CoRR, 2018

Planar Graphs as L-intersection or L-contact graphs.

Daniel Gonçalves, Lucas Isenmann, Claire Pennarun

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Möbius Stanchion Systems.

Lucas Isenmann, Timothée Pecatte

Electron. Notes Discret. Math., 2017