default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHugo Jacob 0001
Person information
- affiliation: University of Montpellier, LIRMM, Montpellier, France
- affiliation (former): ENS Paris-Saclay, Computer Science Department, France
Other persons with the same name
- Hugo Jacob 0002 — Department of Computing, Piim-Lab, CEFET-MG, Belo Horizonte, Minas Gerais, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j2]Paul Bastide, Carla Groenland, Hugo Jacob, Tom Johnston:
Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron. Comb. Theory 4(1) (2024)- [j1]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the parameterized complexity of computing tree-partitions. Discret. Math. Theor. Comput. Sci. 26(3) (2024)
Conference and Workshop Papers
- 2025
- [c7]Jungho Ahn, Hugo Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald, Sebastian Wiederrecht:
Twin-Width One. STACS 2025: 6:1-6:19 - 2022
- [c6]Hans L. Bodlaender
, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. ESA 2022: 24:1-24:15 - [c5]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-Structured Graphs. IPEC 2022: 6:1-6:17 - [c4]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the Parameterized Complexity of Computing Tree-Partitions. IPEC 2022: 7:1-7:20 - [c3]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima:
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC 2022: 8:1-8:18 - [c2]Hugo Jacob, Marcin Pilipczuk:
Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. WG 2022: 287-299 - 2021
- [c1]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close Relatives (Of Feedback Vertex Set), Revisited. IPEC 2021: 21:1-21:15
Informal and Other Publications
- 2025
- [i7]Jungho Ahn, Hugo Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald, Sebastian Wiederrecht:
Twin-width one. CoRR abs/2501.00991 (2025) - 2022
- [i6]Hugo Jacob, Marcin Pilipczuk:
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs. CoRR abs/2201.09749 (2022) - [i5]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure. CoRR abs/2201.13119 (2022) - [i4]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. CoRR abs/2206.09750 (2022) - [i3]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-structured Graphs. CoRR abs/2206.11828 (2022) - [i2]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the parameterized complexity of computing tree-partitions. CoRR abs/2206.11832 (2022) - 2021
- [i1]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close relatives (of Feedback Vertex Set), revisited. CoRR abs/2106.16015 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-26 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
