default search action
Isja Mannens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]Isja Mannens:
Parameterized Graph Problems: Counting, the Tutte Polynomial and Logarithmic Space. Utrecht University, Netherlands, 2024 - [c6]Carla Groenland
, Isja Mannens, Jesper Nederlof, Marta Piecyk
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP 2024: 77:1-77:21 - 2023
- [c5]Isja Mannens
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. ESA 2023: 82:1-82:17 - [c4]Hans L. Bodlaender
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC 2023: 6:1-6:19 - [c3]Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen:
Reconstructing Graphs from Connected Triples. WG 2023: 16-29 - [i6]Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland
Reconstructing Graphs from Connected Triples. CoRR abs/2303.06609 (2023) - [i5]Isja Mannens, Jesper Nederlof:
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. CoRR abs/2307.01046 (2023) - [i4]Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen:
The Parameterised Complexity of Integer Multicommodity Flow. CoRR abs/2310.05784 (2023) - [i3]Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR abs/2312.03859 (2023) - 2022
- [c2]Carla Groenland
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. STACS 2022: 36:1-36:20 - 2021
- [c1]Isja Mannens
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG 2021: 52-79 - [i2]Isja Mannens
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. CoRR abs/2106.11689 (2021) - [i1]Carla Groenland, Jesper Nederlof, Isja Mannens, Krisztina Szilágyi:
Tight bounds for counting colorings and connected edge sets parameterized by cutwidth. CoRR abs/2110.02730 (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 2024-11-11 22:27 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: