Hugo Jacob

Orcid: 0000-0003-1350-3240

Affiliations:
  • University of Montpellier, LIRMM, Montpellier, France
  • ENS Paris-Saclay, Computer Science Department, France (former)


According to our database1, Hugo Jacob authored at least 11 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A note on distance-hereditary graphs whose complement is also distance-hereditary.
CoRR, April, 2025

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure.
Algorithmica, April, 2025

On a tree-based variant of bandwidth and forbidding simple topological minors.
CoRR, February, 2025

Twin-Width One.
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024
On the parameterized complexity of computing tree-partitions.
Discret. Math. Theor. Comput. Sci., 2024

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron.
Comb. Theory, 2024

2022
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure.
CoRR, 2022

Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

On the Complexity of Problems on Tree-Structured Graphs.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

List Colouring Trees in Logarithmic Space.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Close Relatives (Of Feedback Vertex Set), Revisited.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021


  Loading...