Lucas Isenmann

21 papers A* 1B 2C 1Misc 1Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the Complexity of Vertex-Splitting Into an Interval Graph.
CoRR
Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann, Nacim Oijid
2025 C conf
Bicluster Editing with Overlaps: A Vertex Splitting Approach.
IWOCA
Faisal N. Abu-Khzam, Lucas Isenmann, Zeina Merchad
2025 J jnl
Bicluster Editing with Overlaps: A Vertex Splitting Approach.
CoRR
Faisal N. Abu-Khzam, Lucas Isenmann, Zeina Merchad
2025 — conf
Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter.
IJTCS-FAW
Faisal N. Abu-Khzam, Lucas Isenmann
2025 — conf
On the Complexity of 2-Club Cluster Editing with Vertex Splitting.
COCOON (2)
Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann, Sergio Thoumi
2024 J jnl
Correlation Clustering with Overlap: a Heuristic Graph Editing Approach.
CoRR
Faisal N. Abu-Khzam, Lucas Isenmann, Sergio Thoumi
2024 J jnl
Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter.
CoRR
Faisal N. Abu-Khzam, Lucas Isenmann
2024 J jnl
On the Complexity of 2-club Cluster Editing with Vertex Splitting.
CoRR
Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann, Sergio Thoumi
2023 B conf
Degreewidth: A New Parameter for Solving Problems on Tournaments.
WG
Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut
2022 J jnl
Degreewidth: a New Parameter for Solving Problems on Tournaments.
CoRR
Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut
2021 Misc conf
On the Approximation Hardness of Geodetic Set and Its Variants.
COCOON
Tom Davot, Lucas Isenmann, Jocelyn Thiebaut
2020 J jnl
Dushnik-Miller dimension of TD-Delaunay complexes.
Eur. J. Comb.
Daniel Gonçalves, Lucas Isenmann
2020 J jnl
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs.
Algorithmica
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
2019 — —
From planar graphs to higher dimension. (Des graphes planaires vers des dimensions supérieures).
Lucas Isenmann
2018 J jnl
Discrete Morse theory for the collapsibility of supremum sections.
CoRR
Balthazar Bauer, Lucas Isenmann
2018 J jnl
Dushnik-Miller dimension of TD-Delaunay complexes.
CoRR
Daniel Gonçalves, Lucas Isenmann
2018 B conf
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs.
IPEC
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
2018 J jnl
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs.
CoRR
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
2018 A* conf
Planar Graphs as L-intersection or L-contact graphs.
SODA
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
2017 J jnl
Möbius Stanchion Systems.
Electron. Notes Discret. Math.
Lucas Isenmann, Timothée Pecatte
2017 J jnl
Planar graphs as L-intersection or L-contact graphs.
CoRR
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun