Möbius Stanchion Systems. - Lucas Isenmann; Timothée Pecatte (Electron. Notes Discret. Math., 2017)

Planar Graphs as L-intersection or L-contact graphs. - Daniel Gonçalves 001; Lucas Isenmann; Claire Pennarun (SODA, 2018)

Discrete Morse theory for the collapsibility of supremum sections. - Balthazar Bauer; Lucas Isenmann (CoRR, 2018)

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

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)

Dushnik-Miller dimension of TD-Delaunay complexes. - Daniel Gonçalves 001; Lucas Isenmann (Eur. J. Comb., 2020)

On the Approximation Hardness of Geodetic Set and Its Variants. - Tom Davot; Lucas Isenmann; Jocelyn Thiebaut (COCOON, 2021)

Degreewidth: A New Parameter for Solving Problems on Tournaments. - Tom Davot; Lucas Isenmann; Sanjukta Roy 001; Jocelyn Thiebaut (WG, 2023)

Correlation Clustering with Overlap: a Heuristic Graph Editing Approach. - Faisal N. Abu-Khzam; Lucas Isenmann; Sergio Thoumi (CoRR, 2024)

On the Complexity of 2-Club Cluster Editing with Vertex Splitting. - Faisal N. Abu-Khzam; Tom Davot; Lucas Isenmann; Sergio Thoumi (COCOON (2), 2025)

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter. - Faisal N. Abu-Khzam; Lucas Isenmann (IJTCS-FAW, 2025)

Bicluster Editing with Overlaps: A Vertex Splitting Approach. - Faisal N. Abu-Khzam; Lucas Isenmann; Zeina Merchad (IWOCA, 2025)