default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCéline M. F. Swennenhuis
Person information
- affiliation: Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Hans L. Bodlaender
, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. 300: 105195 (2024)- [c8]Bart M. P. Jansen, Céline M. F. Swennenhuis:
Steiner Tree Parameterized by Multiway Cut and Even Less. ESA 2024: 76:1-76:16 - [i11]Bart M. P. Jansen, Céline M. F. Swennenhuis:
Steiner Tree Parameterized by Multiway Cut and Even Less. CoRR abs/2406.19819 (2024) - 2023
- [j3]Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM J. Comput. 52(6): 1369-1412 (2023) - [j2]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. 37(3): 1566-1586 (2023) - [i10]Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. CoRR abs/2312.03495 (2023) - 2022
- [j1]Jesper Nederlof, Céline M. F. Swennenhuis:
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Algorithmica 84(8): 2309-2334 (2022) - [c7]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Isolation Schemes for Problems on Decomposable Graphs. STACS 2022: 50:1-50:20 - [i9]Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki:
Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995n) time. CoRR abs/2208.02664 (2022) - 2021
- [c6]Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS 2021: 193-204 - [c5]Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. IPEC 2021: 9:1-9:16 - [c4]Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SODA 2021: 1682-1701 - [c3]Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi:
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG 2021: 52-79 - [i8]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Isolation schemes for problems on decomposable graphs. CoRR abs/2105.01465 (2021) - [i7]Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR abs/2105.14882 (2021) - [i6]Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi:
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. CoRR abs/2106.11689 (2021) - [i5]Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. CoRR abs/2106.15907 (2021) - 2020
- [c2]Jesper Nederlof, Céline M. F. Swennenhuis:
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. IPEC 2020: 25:1-25:17 - [c1]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG 2020: 27-39 - [i4]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR abs/2002.04368 (2020) - [i3]Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. CoRR abs/2007.08204 (2020)
2010 – 2019
- 2019
- [i2]Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Complexity of Partial Scheduling. CoRR abs/1912.03185 (2019) - 2018
- [i1]Teun Janssen, Céline M. F. Swennenhuis, Abdoul Bitar, Thomas Bosman, Dion Gijswijt, Leo van Iersel, Stéphane Dauzère-Pérès, Claude Yugma:
Parallel Machine Scheduling with a Single Resource per Job. CoRR abs/1809.05009 (2018)
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-12-10 21:47 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:
