Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJesper Nederlof
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c34]Jesper Nederlof
:
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. Treewidth, Kernels, and Algorithms 2020: 145-164- [c33]Jason Li, Jesper Nederlof:
Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time. SODA 2020: 971-989 - [i27]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)
2010 – 2019
- 2019
- [j14]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81(10): 3993-4009 (2019) - [j13]Bart M. P. Jansen, Jesper Nederlof:
Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. 795: 520-539 (2019) - [c32]Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA 2019: 73:1-73:16 - [c31]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA 2019: 1015-1034 - [c30]Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity Below Dirac's Condition. WG 2019: 27-39 - [i26]Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity below Dirac's condition. CoRR abs/1902.01745 (2019) - [i25]Jesper Nederlof:
Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time. CoRR abs/1904.11285 (2019) - [i24]Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR abs/1905.02424 (2019) - [i23]Jason Li, Jesper Nederlof:
Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time. CoRR abs/1906.12298 (2019) - [i22]Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Complexity of Partial Scheduling. CoRR abs/1912.03185 (2019) - 2018
- [j12]Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Fast Hamiltonicity Checking Via Bases of Perfect Matchings. J. ACM 65(3): 12:1-12:46 (2018) - [j11]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. SIAM J. Comput. 47(5): 1755-1777 (2018) - [j10]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Trans. Inf. Theory 64(2): 1368-1373 (2018) - [c29]Bart M. P. Jansen, Jesper Nederlof:
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. ESA 2018: 47:1-47:15 - [c28]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. SODA 2018: 992-1001 - [c27]Radu Curticapean, Nathan Lindzey, Jesper Nederlof:
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. SODA 2018: 1080-1099 - [c26]Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof:
More consequences of falsifying SETH and the orthogonal vectors conjecture. STOC 2018: 253-266 - [c25]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - [i21]Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof:
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture. CoRR abs/1805.08554 (2018) - [i20]Bart M. P. Jansen, Jesper Nederlof:
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. CoRR abs/1806.10501 (2018) - [i19]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR abs/1811.06871 (2018) - 2017
- [j9]Jesper Nederlof:
A short note on Merlin-Arthur protocols for subset sum. Inf. Process. Lett. 118: 15-16 (2017) - [c24]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster space-efficient algorithms for subset sum and k-sum. STOC 2017: 198-209 - [i18]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set parameterized by treewidth. CoRR abs/1707.01470 (2017) - [i17]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. CoRR abs/1707.04519 (2017) - [i16]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-time Approximation. CoRR abs/1708.03515 (2017) - [i15]Radu Curticapean, Nathan Lindzey, Jesper Nederlof:
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. CoRR abs/1709.02311 (2017) - 2016
- [j8]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen:
Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms 12(1): 4:1-4:19 (2016) - [j7]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12(3): 41:1-41:24 (2016) - [c23]Andrew Drucker, Jesper Nederlof, Rahul Santhanam:
Exponential Time Paradigms Through the Polynomial Time Lens. ESA 2016: 36:1-36:14 - [c22]Jesper Nederlof:
Finding Large Set Covers Faster via the Representation Method. ESA 2016: 69:1-69:15 - [c21]Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden:
Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP 2016: 9:1-9:14 - [c20]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. ISIT 2016: 335-339 - [c19]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Dense Subset Sum May Be the Hardest. STACS 2016: 13:1-13:14 - [r1]Jesper Nederlof:
Exact Algorithms and Time/Space Tradeoffs. Encyclopedia of Algorithms 2016: 661-664 - [i14]Hans L. Bodlaender, Jesper Nederlof:
Subexponential time algorithms for finding small tree and path decompositions. CoRR abs/1601.02415 (2016) - [i13]Jesper Nederlof:
A short note on Merlin-Arthur protocols for subset sum. CoRR abs/1602.01819 (2016) - [i12]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. CoRR abs/1605.00462 (2016) - [i11]Jesper Nederlof:
Finding Large Set Covers Faster via the Representation Method. CoRR abs/1608.03439 (2016) - [i10]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. CoRR abs/1612.02788 (2016) - 2015
- [j6]Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica 71(3): 636-660 (2015) - [j5]Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243: 86-111 (2015) - [j4]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. 57(1): 81-96 (2015) - [c18]Hans L. Bodlaender, Jesper Nederlof:
Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. ESA 2015: 179-190 - [c17]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Subset Sum in the Absence of Concentration. STACS 2015: 48-61 - [i9]Per Austrin, Mikko Koivisto, Petteri Kaski, Jesper Nederlof:
Dense Subset Sum may be the hardest. CoRR abs/1508.06019 (2015) - 2014
- [j3]Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. Algorithmica 69(3): 685-740 (2014) - 2013
- [j2]Jesper Nederlof:
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. Algorithmica 65(4): 868-884 (2013) - [c16]Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. ICALP (1) 2013: 196-207 - [c15]Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. IPEC 2013: 321-334 - [c14]Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Fast hamiltonicity checking via bases of perfect matchings. STOC 2013: 301-310 - [i8]Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. CoRR abs/1305.7448 (2013) - [i7]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. CoRR abs/1309.6797 (2013) - 2012
- [j1]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. 26(3): 1008-1021 (2012) - [c13]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNF-SAT. Computational Complexity Conference 2012: 74-84 - [c12]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536 - [c11]Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Homomorphic Hashing for Sparse Coefficient Extraction. IPEC 2012: 147-158 - [c10]Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan:
Reducing a Target Interval to a Few Exact Queries. MFCS 2012: 718-727 - [c9]Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen:
Fast zeta transforms for lattices with few irreducibles. SODA 2012: 1436-1444 - [i6]Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Homomorphic Hashing for Sparse Coefficient Extraction. CoRR abs/1203.4063 (2012) - [i5]Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan:
Reducing a Target Interval to a Few Exact Queries. CoRR abs/1208.4225 (2012) - [i4]Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. CoRR abs/1211.1505 (2012) - [i3]Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Fast Hamiltonicity checking via bases of perfect matchings. CoRR abs/1211.1506 (2012) - 2011
- [c8]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk:
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. FOCS 2011: 150-159 - [i2]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk:
Solving connectivity problems parameterized by treewidth in single exponential time. CoRR abs/1103.0534 (2011) - [i1]Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström:
On Problems as Hard as CNFSAT. CoRR abs/1112.2275 (2011) - 2010
- [c7]Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger:
A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130 - [c6]Jesper Nederlof, Johan M. M. van Rooij:
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. IPEC 2010: 204-215 - [c5]Daniel Lokshtanov, Jesper Nederlof:
Saving space by algebraization. STOC 2010: 321-330 - [c4]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87 - [c3]Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle:
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183
2000 – 2009
- 2009
- [c2]Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. ESA 2009: 554-565 - [c1]Jesper Nederlof:
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. ICALP (1) 2009: 713-725
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-05-05 22:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
