Most of my publications are listed at Google Scholar and DBLP. Many preprints can be found at arXiv. If you like to read an article but don't have access feel free to contact me.
List
@article{doi:10.1137/22M1478112,
author = {Nederlof, Jesper and Pawlewicz, Jakub and Swennenhuis, C\'{e}line M. F. and Węgrzycki, Karol},
title = {A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics},
journal = {SIAM Journal on Computing},
volume = {52},
number = {6},
pages = {1369-1412},
year = {2023},
doi = {10.1137/22M1478112},
URL = {https://doi.org/10.1137/22M1478112},
eprint = {https://doi.org/10.1137/22M1478112},
}
@inproceedings{groenland2023tight,
title={Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters},
author={Carla Groenland and Isja Mannens and Jesper Nederlof and Marta Piecyk and Paweł Rzążewski},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024},
series = {LIPIcs},
volume = {??},
pages = {??},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024}
}
@inproceedings{nederlof2023subexponential,
title={A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints},
author={Jesper Nederlof and Céline M. F. Swennenhuis and Karol Węgrzycki},
url={https://arxiv.org/abs/2312.03495},
booktitle = {Proceedings of SODA 2025},
series = {},
volume = {??},
pages = {to appear},
publisher = {},
year = {2025}
}
@inproceedings{PfaffICALP24,
author = {Andreas Bj{\"{o}}rklund and
Petteri Kaski and
Jesper Nederlof},
editor = {Karl Bringmann and Ola Svensson},
title = {Another Hamiltonian Cycle in Bipartite Pfaffian Graphs},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024},
series = {LIPIcs},
volume = {??},
pages = {??},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024}
}
@inproceedings{SteinerIPEC,
author = {Carla Groenland, Jesper Nederlof, and Tomohiro Koana},
editor = {Edouard Bonnet and Pawel Rzazewski},
title = {Another Hamiltonian Cycle in Bipartite Pfaffian Graphs},
booktitle = {Proceedings of the 19th International Symposium on Parameterized and Exact Computation},
series = {LIPIcs},
volume = {??},
pages = {??},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024}
}
@inproceedings{DBLP:conf/sofsem/BliznetsN24,
author = {Ivan Bliznets and
Jesper Nederlof},
editor = {Henning Fernau and
Serge Gaspers and
Ralf Klasing},
title = {Exact and Parameterized Algorithms for Choosability},
booktitle = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14519},
pages = {111--124},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-52113-3\_8},
doi = {10.1007/978-3-031-52113-3\_8},
timestamp = {Thu, 29 Feb 2024 20:52:57 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BliznetsN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BliznetsNS24,
author = {Ivan Bliznets and
Jesper Nederlof and
Krisztina Szil{\'{a}}gyi},
editor = {Henning Fernau and
Serge Gaspers and
Ralf Klasing},
title = {Parameterized Algorithms for Covering by Arithmetic Progressions},
booktitle = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14519},
pages = {125--138},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-52113-3\_9},
doi = {10.1007/978-3-031-52113-3\_9},
timestamp = {Thu, 21 Mar 2024 08:35:46 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BliznetsNS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/NederlofS24,
author = {Jesper Nederlof and
Krisztina Szil{\'{a}}gyi},
editor = {Henning Fernau and
Serge Gaspers and
Ralf Klasing},
title = {Algorithms and Turing Kernels for Detecting and Counting Small Patterns
in Unit Disk Graphs},
booktitle = {{SOFSEM} 2024: Theory and Practice of Computer Science - 49th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2024, Cochem, Germany, February 19-23, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14519},
pages = {413--426},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-52113-3\_29},
doi = {10.1007/978-3-031-52113-3\_29},
timestamp = {Thu, 29 Feb 2024 20:52:58 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/NederlofS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BergougnouxKN23,
author = {Benjamin Bergougnoux and
Tuukka Korhonen and
Jesper Nederlof},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {Tight Lower Bounds for Problems Parameterized by Rank-Width},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {11:1--11:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.11},
doi = {10.4230/LIPICS.STACS.2023.11},
timestamp = {Sat, 30 Sep 2023 09:57:28 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BergougnouxKN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MannensN23,
author = {Isja Mannens and
Jesper Nederlof},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {A Fine-Grained Classification of the Complexity of Evaluating the
Tutte Polynomial on Integer Points Parameterized by Treewidth and
Cutwidth},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {82:1--82:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.82},
doi = {10.4230/LIPICS.ESA.2023.82},
timestamp = {Sat, 30 Sep 2023 09:40:23 +0200},
biburl = {https://dblp.org/rec/conf/esa/MannensN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChalermsookFHKN23,
author = {Parinya Chalermsook and
Fedor V. Fomin and
Thekla Hamm and
Tuukka Korhonen and
Jesper Nederlof and
Ly Orgo},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Polynomial-Time Approximation of Independent Set Parameterized by
Treewidth},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {33:1--33:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.33},
doi = {10.4230/LIPICS.ESA.2023.33},
timestamp = {Sun, 12 Nov 2023 02:09:03 +0100},
biburl = {https://dblp.org/rec/conf/esa/ChalermsookFHKN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalEKN23,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Jesper Nederlof},
title = {Competitive Algorithms for Generalized k-Server in Uniform
Metrics},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {1},
pages = {8:1--8:15},
year = {2023},
url = {https://doi.org/10.1145/3568677},
doi = {10.1145/3568677},
timestamp = {Sat, 29 Apr 2023 19:27:48 +0200},
biburl = {https://dblp.org/rec/journals/talg/BansalEKN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/NederlofPSW23,
author = {Jesper Nederlof and
Michal Pilipczuk and
C{\'{e}}line M. F. Swennenhuis and
Karol Wegrzycki},
title = {Hamiltonian Cycle Parameterized by Treedepth in Single Exponential
Time and Polynomial Space},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {3},
pages = {1566--1586},
year = {2023},
url = {https://doi.org/10.1137/22m1518943},
doi = {10.1137/22M1518943},
timestamp = {Sun, 12 Nov 2023 02:17:55 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/NederlofPSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/NederlofPW23,
author = {Jesper Nederlof and
Michal Pilipczuk and
Karol Wegrzycki},
title = {Bounding Generalized Coloring Numbers of Planar Graphs Using Coin
Models},
journal = {Electron. J. Comb.},
volume = {30},
number = {3},
pages = {N/A},
year = {2023},
url = {https://doi.org/10.37236/11095},
doi = {10.37236/11095},
timestamp = {Sun, 12 Nov 2023 02:20:22 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/NederlofPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NederlofS22,
author = {Jesper Nederlof and
C{\'{e}}line M. F. Swennenhuis},
title = {On the Fine-grained Parameterized Complexity of Partial Scheduling
to Minimize the Makespan},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2309--2334},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00970-8},
doi = {10.1007/S00453-022-00970-8},
timestamp = {Mon, 08 Aug 2022 21:23:56 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NederlofS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{FVSjournal,
year = {2022},
journal = {{ACM} Trans. Algorithms},
volume = {??},
number = {??},
pages = {?? (to appear)},
title = {Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time },
author = {Jason Li and Jesper Nederlof}
}
@article{cutCountJournal,
year = {2022},
journal = {{ACM} Trans. Algorithms},
volume = {??},
number = {??},
pages = {?? (to appear)},
title = { Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time },
author = { Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk }
}
@inproceedings{DBLP:conf/soda/NederlofPSW21,
author = {Jesper Nederlof and
Jakub Pawlewicz and
C{\'{e}}line M. F. Swennenhuis and
Karol Wegrzycki},
editor = {D{\'{a}}niel Marx},
title = {A Faster Exponential Time Algorithm for Bin Packing With a Constant
Number of Bins via Additive Combinatorics},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1682--1701},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.102},
doi = {10.1137/1.9781611976465.102},
timestamp = {Fri, 09 Apr 2021 18:35:35 +0200},
biburl = {https://dblp.org/rec/conf/soda/NederlofPSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{XNLP,
author = {Hans L. Bodlaender and Carla Groenland and Jesper Nederlof and Céline M. F. Swennenhuis},
editor = {Nisheeth Vishnoi},
title = {Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space},
booktitle = {Proceedings of 62nd annual IEEE symposium on Foundations of Computer Science (FOCS'21)},
pages = {??},
publisher = {{IEEE}},
year = {2021},
url = {https://arxiv.org/abs/2105.14882},
}
@inproceedings{apxETSP,
author = {S{\'{a}}ndor Kisfaludi{-}Bak and Jesper Nederlof and Karol Węgrzycki},
editor = {Nisheeth Vishnoi},
title = {A Gap-ETH-Tight Approximation Scheme for Euclidean TSP},
booktitle = {Proceedings of 62nd annual IEEE symposium on Foundations of Computer Science (FOCS'21)},
pages = {??},
publisher = {{IEEE}},
year = {2021},
url = {https://arxiv.org/abs/2011.03778},
}
@inproceedings{isolationscheme,
author = {Jesper Nederlof and Michal Pilipczuk and C{\'{e}}line M. F. Swennenhuis and Karol Wegrzycki},
title = {Isolation schemes for problems on decomposable graphs},
booktitle = {Proceedings of 39th International Symposium on Theoretical Aspects of Computer Science (STACS'22)},
volume = {abs/2105.01465},
year = {2022},
pages = {??},
url = {https://arxiv.org/abs/2105.01465}
}
@inproceedings{countingcoloringscutwidth,
author = {Carla Groenland and Jesper Nederlof and Isja Mannens and Krisztina Szil{\'{a}}gyi},
title = {Tight bounds for counting colorings and connected edge sets parameterized by cutwidth},
booktitle = {Proceedings of 39th International Symposium on Theoretical Aspects of Computer Science (STACS'22)},
volume = {abs/2110.02730},
year = {2022},
pages = {??},
url = {https://arxiv.org/abs/2110.02730}
}
@inproceedings{DBLP:conf/wg/MannensNSS21,
author = {Isja Mannens and
Jesper Nederlof and
C{\'{e}}line M. F. Swennenhuis and
Krisztina Szil{\'{a}}gyi},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {On the Parameterized Complexity of the Connected Flow and Many Visits
{TSP} Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {52--79},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_5},
doi = {10.1007/978-3-030-86838-3\_5},
timestamp = {Wed, 03 Nov 2021 08:28:37 +0100},
biburl = {https://dblp.org/rec/conf/wg/MannensNSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NederlofW21,
author = {Jesper Nederlof and
Karol Wegrzycki},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal
vectors},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1670--1683},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451024},
doi = {10.1145/3406325.3451024},
timestamp = {Tue, 22 Jun 2021 20:03:56 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NederlofW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Nederlof20,
author = {Jesper Nederlof},
editor = {Fedor V. Fomin and
Stefan Kratsch and
Erik Jan van Leeuwen},
title = {Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices},
booktitle = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {12160},
pages = {145--164},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42071-0\_11},
doi = {10.1007/978-3-030-42071-0\_11},
timestamp = {Mon, 04 May 2020 13:23:23 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Nederlof20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/NederlofPSW20,
author = {Jesper Nederlof and
Michal Pilipczuk and
C{\'{e}}line M. F. Swennenhuis and
Karol Wegrzycki},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Hamiltonian Cycle Parameterized by Treedepth in Single Exponential
Time and Polynomial Space},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
note = {Best paper award},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {27--39},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_3},
doi = {10.1007/978-3-030-60440-0\_3},
timestamp = {Sat, 14 Nov 2020 00:57:16 +0100},
biburl = {https://dblp.org/rec/conf/wg/NederlofPSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/NederlofS20,
author = {Jesper Nederlof and
C{\'{e}}line M. F. Swennenhuis},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {On the Fine-Grained Parameterized Complexity of Partial Scheduling
to Minimize the Makespan},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.25},
doi = {10.4230/LIPIcs.IPEC.2020.25},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/NederlofS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{Kisfaludi-BakNL20,
author = {S{\'{a}}ndor Kisfaludi{-}Bak and
Jesper Nederlof and
Erik Jan van Leeuwen},
title = {Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals
on Few Faces},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {3},
pages = {28:1--28:30},
year = {2020},
url = {https://doi.org/10.1145/3371389},
doi = {10.1145/3371389},
timestamp = {Wed, 29 Jul 2020 11:29:01 +0200},
biburl = {https://dblp.org/rec/journals/talg/Kisfaludi-BakNL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{LiNsoda20,
author = {Jason Li and
Jesper Nederlof},
title = {Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
note = {Invited to Special Issue of SODA'20},
pages = {971--989},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.58},
doi = {10.1137/1.9781611975994.58}
}
@inproceedings{bipartitetsp,
author = {Jesper Nederlof},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Bipartite {TSP} in $O(1.9999^n)$ time, assuming quadratic
time matrix multiplication},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {40--53},
publisher = {{ACM}},
year = {2020}
}
@inproceedings{planarpatterns,
author = {Jesper Nederlof},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Detecting and counting small patterns in planar graphs in subexponential
parameterized time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1293--1306},
publisher = {{ACM}},
year = {2020}
}
@article{cutwidthColoring,
author = {Bart M. P. Jansen and Jesper Nederlof},
title = {Computing the chromatic number using graph decompositions via matrix rank},
journal = {Theoretical Computer Science},
volume = {795},
pages = {520--539},
url = {https://www.sciencedirect.com/science/article/pii/S0304397519304955},
year = {2019}
}
@inproceedings{DBLP:conf/wg/Jansen0N19,
author = {Bart M. P. Jansen and
L{\'{a}}szl{\'{o}} Kozma and
Jesper Nederlof},
title = {Hamiltonicity Below Dirac's Condition},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
pages = {27--39},
year = {2019},
timestamp = {Tue, 17 Sep 2019 13:02:56 +0200},
volume = {11789}
}
@inproceedings{DBLP:conf/esa/MuchaNPW19,
author = {Marcin Mucha and
Jesper Nederlof and
Jakub Pawlewicz and
Karol Wegrzycki},
title = {Equal-Subset-Sum Faster Than the Meet-in-the-Middle},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
pages = {73:1--73:16},
volume = {144},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.73},
doi = {10.4230/LIPIcs.ESA.2019.73},
timestamp = {Mon, 23 Sep 2019 17:27:06 +0200},
biburl = {https://dblp.org/rec/bib/conf/esa/MuchaNPW19},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JansenN18,
author = {Bart M. P. Jansen and
Jesper Nederlof},
title = {Computing the Chromatic Number Using Graph Decompositions via Matrix Rank},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
pages = {47:1--47:15},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.47},
doi = {10.4230/LIPIcs.ESA.2018.47},
timestamp = {Thu, 23 Aug 2018 15:56:06 +0200},
biburl = {https://dblp.org/rec/bib/conf/esa/JansenN18},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BonamyKNPSW18,
author = {Marthe Bonamy and
Lukasz Kowalik and
Jesper Nederlof and
Michal Pilipczuk and
Arkadiusz Socala and
Marcin Wrochna},
title = {On Directed Feedback Vertex Set Parameterized by Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
pages = {65--78},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_6},
doi = {10.1007/978-3-030-00256-5\_6},
timestamp = {Mon, 03 Sep 2018 16:26:41 +0200},
biburl = {https://dblp.org/rec/bib/conf/wg/BonamyKNPSW18},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{SteinerTreeFewFaces,
author = {S{\'{a}}ndor Kisfaludi{-}Bak and
Jesper Nederlof and
Erik Jan van Leeuwen},
title = {Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals
on Few Faces},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1015--1034},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.63},
doi = {10.1137/1.9781611975482.63},
timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
biburl = {https://dblp.org/rec/bib/conf/soda/Kisfaludi-BakNL19},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{moreconsequences,
author = {Amir Abboud and
Karl Bringmann and
Holger Dell and
Jesper Nederlof},
title = {More consequences of falsifying {SETH} and the orthogonal vectors
conjecture},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {253--266},
year = {2018},
crossref = {DBLP:conf/stoc/2018},
url = {http://doi.acm.org/10.1145/3188745.3188938},
doi = {10.1145/3188745.3188938},
timestamp = {Thu, 21 Jun 2018 08:27:49 +0200},
biburl = {https://dblp.org/rec/bib/conf/stoc/AbboudBDN18},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{CyganKratschNederlof,
author = {Marek Cygan and Stefan Kratsch and Jesper Nederlof},
title = {Fast Hamiltonicity Checking Via Bases of Perfect Matchings},
journal = {J. ACM},
issue_date = {March 2018},
volume = {65},
number = {3},
month = mar,
year = {2018},
issn = {0004-5411},
pages = {12:1--12:46},
articleno = {12},
numpages = {46},
url = {http://doi.acm.org/10.1145/3148227},
doi = {10.1145/3148227},
acmid = {3148227},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Hamiltonicity, bounded treewidth, matchings, parameterized complexity},
}
@article{doi:10.1137/17M1158203,
author = {Bansal, N. and Garg, S. and Nederlof, J. and Vyas, N.},
title = {Faster Space-Efficient Algorithms for Subset Sum, \$k\$-Sum, and Related Problems},
journal = {SIAM Journal on Computing},
volume = {47},
number = {5},
pages = {1755-1777},
year = {2018},
doi = {10.1137/17M1158203},
URL = { https://doi.org/10.1137/17M1158203},
eprint = { https://doi.org/10.1137/17M1158203}
}
@article{BansalCLNN19,
author = {Nikhil Bansal and
Parinya Chalermsook and
Bundit Laekhanukit and
Danupon Nanongkai and
Jesper Nederlof},
title = {New Tools and Connections for Exponential-Time Approximation},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3993--4009},
year = {2019}
}
@inproceedings{DBLP:conf/soda/Bansal0KN18,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Jesper Nederlof},
title = {Competitive Algorithms for Generalized k-Server in Uniform
Metrics},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {992--1001},
year = {2018},
crossref = {DBLP:conf/soda/2018},
url = {https://doi.org/10.1137/1.9781611975031.64},
doi = {10.1137/1.9781611975031.64},
timestamp = {Thu, 04 Jan 2018 13:55:11 +0100},
biburl = {http://dblp.org/rec/bib/conf/soda/Bansal0KN18},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{rankcounts,
author = {Radu Curticapean and
Nathan Lindzey and
Jesper Nederlof},
title = {A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1080--1099},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.70},
doi = {10.1137/1.9781611975031.70},
timestamp = {Thu, 04 Jan 2018 13:55:11 +0100},
biburl = {http://dblp.org/rec/bib/conf/soda/CurticapeanLN18},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{Nederlof201715,
author = {Jesper Nederlof},
title = {A short note on Merlin-Arthur protocols for subset sum},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {15--16},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.002},
doi = {10.1016/j.ipl.2016.09.002},
timestamp = {Fri, 26 May 2017 22:54:41 +0200},
biburl = {http://dblp.dagstuhl.de/rec/bib/journals/ipl/Nederlof17},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@ARTICLE{Austrin17,
author={Per Austrin and Petteri Kaski and Mikko Koivisto and Jesper Nederlof},
journal={IEEE Transactions on Information Theory},
title={Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs},
year={2018},
volume={64},
number={2},
pages={1368-1373},
keywords={Adders;Computer science;Electronic mail;Entropy;Hypercubes;Information technology;Upper bound;Additive combinatorics;binary adder channel;isoperimetric inequality;uniquely decodeable code pair;zero-error capacity},
doi={10.1109/TIT.2017.2688378},
ISSN={0018-9448},
month={Feb},}
@PhdThesis{phd,
author = {Jesper Nederlof},
title = {Space and time efficient structural improvements of dynamic programming algorithms},
organization = {Department of Informatics},
school = {University of Bergen},
year = {2011},
month = {December},
type = {Doctoral Dissertation},
url = {PhDThesis.pdf},
OPTnote = {Supervised by Pinar Heggernes}
}
@MastersThesis{Karavirta:Licentiates,
author = {Jesper Nederlof},
title = {Inclusion exclusion for hard problems},
type = {Master's Thesis},
organization = {Department of Information and Computing Sciences},
school = {Utrecht University},
year = {2008},
month = {October},
url = {MScThesis.pdf}
}
@article{DBLP:journals/talg/BjorklundHKKNP16,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Petteri Kaski and
Mikko Koivisto and
Jesper Nederlof and
Pekka Parviainen},
title = {Fast Zeta Transforms for Lattices with Few Irreducibles},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {1},
pages = {4},
year = {2016},
url = {http://doi.acm.org/10.1145/2629429},
doi = {10.1145/2629429},
timestamp = {Wed, 09 Mar 2016 00:00:00 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/talg/BjorklundHKKNP16},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/CyganDLMNOPSW16,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNF-SAT}},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {3},
pages = {41},
year = {2016},
url = {http://doi.acm.org/10.1145/2925416},
doi = {10.1145/2925416},
timestamp = {Mon, 11 Jul 2016 01:00:00 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/talg/CyganDLMNOPSW16},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:polyspacesss,
author = {Nikhil Bansal and
Shashwat Garg and
Jesper Nederlof and
Nikhil Vyas},
title = {Faster space-efficient algorithms for subset sum and k-sum},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {198--209},
year = {2017},
url = {http://doi.acm.org/10.1145/3055399.3055467},
doi = {10.1145/3055399.3055467},
timestamp = {Sat, 17 Jun 2017 18:46:57 +0200},
biburl = {http://dblp.dagstuhl.de/rec/bib/conf/stoc/BansalGNV17},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/esa/DruckerNS16,
author = {Andrew Drucker and
Jesper Nederlof and
Rahul Santhanam},
title = {Exponential Time Paradigms Through the Polynomial Time Lens},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
pages = {36:1--36:14},
year = {2016},
url = {http://dx.doi.org/10.4230/LIPIcs.ESA.2016.36},
doi = {10.4230/LIPIcs.ESA.2016.36},
timestamp = {Tue, 30 Aug 2016 15:32:43 +0200},
}
@inproceedings{DBLP:conf/esa/Nederlof16,
author = {Jesper Nederlof},
title = {Finding Large Set Covers Faster via the Representation Method},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
pages = {69:1--69:15},
year = {2016},
url = {http://dx.doi.org/10.4230/LIPIcs.ESA.2016.69},
doi = {10.4230/LIPIcs.ESA.2016.69},
timestamp = {Tue, 30 Aug 2016 15:32:43 +0200},
}
@inproceedings{DBLP:conf/icalp/BodlaenderNZ16,
author = {Hans L. Bodlaender and
Jesper Nederlof and
Tom C. van der Zanden},
title = {Subexponential Time Algorithms for Embedding H-Minor Free Graphs},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
pages = {9:1--9:14},
year = {2016},
url = {http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.9},
doi = {10.4230/LIPIcs.ICALP.2016.9},
timestamp = {Tue, 30 Aug 2016 15:33:07 +0200},
}
@inproceedings{DBLP:conf/isit/AustrinKKN16,
author = {Per Austrin and
Petteri Kaski and
Mikko Koivisto and
Jesper Nederlof},
title = {Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
Barcelona, Spain, July 10-15, 2016},
pages = {335--339},
year = {2016},
url = {http://dx.doi.org/10.1109/ISIT.2016.7541316},
doi = {10.1109/ISIT.2016.7541316},
timestamp = {Tue, 16 Aug 2016 12:58:01 +0200},
}
@inproceedings{DBLP:conf/stacs/AustrinKKN16,
author = {Per Austrin and
Petteri Kaski and
Mikko Koivisto and
Jesper Nederlof},
title = {Dense Subset Sum May Be the Hardest},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
pages = {13:1--13:14},
year = {2016},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2016.13},
doi = {10.4230/LIPIcs.STACS.2016.13},
timestamp = {Mon, 22 Feb 2016 12:53:16 +0100},
}
@incollection{DBLP:reference/algo/Nederlof16,
author = {Jesper Nederlof},
title = {Exact Algorithms and Time/Space Tradeoffs},
booktitle = {Encyclopedia of Algorithms},
pages = {661--664},
year = {2016},
url = {http://dx.doi.org/10.1007/978-1-4939-2864-4_517},
doi = {10.1007/978-1-4939-2864-4_517},
timestamp = {Thu, 28 Apr 2016 01:00:00 +0200},
}
@article{DBLP:journals/algorithmica/FafianieBN15,
author = {Stefan Fafianie and
Hans L. Bodlaender and
Jesper Nederlof},
title = {Speeding Up Dynamic Programming with Representative Sets: An Experimental
Evaluation of Algorithms for Steiner Tree on Tree Decompositions},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {636--660},
year = {2015},
url = {http://dx.doi.org/10.1007/s00453-014-9934-0},
doi = {10.1007/s00453-014-9934-0},
timestamp = {Sun, 01 Mar 2015 00:00:00 +0100},
}
@article{DBLP:journals/iandc/BodlaenderCKN15,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Deterministic single exponential time algorithms for connectivity
problems parameterized by treewidth},
journal = {Inf. Comput.},
volume = {243},
pages = {86--111},
year = {2015},
url = {http://dx.doi.org/10.1016/j.ic.2014.12.008},
doi = {10.1016/j.ic.2014.12.008},
timestamp = {Mon, 15 Jun 2015 01:00:00 +0200},
}
@article{DBLP:journals/mst/FominGNP15,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jesper Nederlof and
Michal Pilipczuk},
title = {Minimizing Rosenthal Potential in Multicast Games},
journal = {Theory Comput. Syst.},
volume = {57},
number = {1},
pages = {81--96},
year = {2015},
url = {http://dx.doi.org/10.1007/s00224-014-9573-5},
doi = {10.1007/s00224-014-9573-5},
timestamp = {Thu, 11 Jun 2015 01:00:00 +0200},
}
@inproceedings{DBLP:conf/esa/BodlaenderN15,
author = {Hans L. Bodlaender and
Jesper Nederlof},
title = {Subexponential Time Algorithms for Finding Small Tree and Path Decompositions},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
pages = {179--190},
year = {2015},
url = {http://dx.doi.org/10.1007/978-3-662-48350-3_16},
doi = {10.1007/978-3-662-48350-3_16},
timestamp = {Wed, 02 Sep 2015 16:08:20 +0200},
}
@inproceedings{DBLP:conf/stacs/AustrinKKN15,
author = {Per Austrin and
Petteri Kaski and
Mikko Koivisto and
Jesper Nederlof},
title = {Subset Sum in the Absence of Concentration},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
pages = {48--61},
year = {2015},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2015.48},
doi = {10.4230/LIPIcs.STACS.2015.48},
timestamp = {Mon, 09 Mar 2015 12:14:01 +0100},
}
@article{DBLP:journals/algorithmica/NederlofRD14,
author = {Jesper Nederlof and
Johan M. M. van Rooij and
Thomas C. van Dijk},
title = {Inclusion/Exclusion Meets Measure and Conquer},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {685--740},
year = {2014},
url = {http://dx.doi.org/10.1007/s00453-013-9759-2},
doi = {10.1007/s00453-013-9759-2},
timestamp = {Fri, 09 May 2014 01:00:00 +0200},
}
@article{DBLP:journals/algorithmica/Nederlof13,
author = {Jesper Nederlof},
title = {Fast Polynomial-Space Algorithms Using Inclusion-Exclusion},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {868--884},
year = {2013},
url = {http://dx.doi.org/10.1007/s00453-012-9630-x},
doi = {10.1007/s00453-012-9630-x},
timestamp = {Mon, 25 Feb 2013 00:00:00 +0100},
}
@inproceedings{DBLP:conf/icalp/BodlaenderCKN13,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Deterministic Single Exponential Time Algorithms for Connectivity
Problems Parameterized by Treewidth},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
pages = {196--207},
year = {2013},
url = {http://dx.doi.org/10.1007/978-3-642-39206-1_17},
doi = {10.1007/978-3-642-39206-1_17},
timestamp = {Mon, 08 Jul 2013 14:02:05 +0200},
}
@inproceedings{DBLP:conf/iwpec/FafianieBN13,
author = {Stefan Fafianie and
Hans L. Bodlaender and
Jesper Nederlof},
title = {Speeding Up Dynamic Programming with Representative Sets - An Experimental
Evaluation of Algorithms for Steiner Tree on Tree Decompositions},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
pages = {321--334},
year = {2013},
url = {http://dx.doi.org/10.1007/978-3-319-03898-8_27},
doi = {10.1007/978-3-319-03898-8_27},
timestamp = {Sun, 08 Dec 2013 12:48:36 +0100},
}
@inproceedings{DBLP:conf/stoc/CyganKN13,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Fast hamiltonicity checking via bases of perfect matchings},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {301--310},
year = {2013},
url = {http://doi.acm.org/10.1145/2488608.2488646},
doi = {10.1145/2488608.2488646},
timestamp = {Sun, 26 May 2013 10:30:47 +0200},
}
@article{DBLP:journals/siamdm/HeggernesHLN12,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Jesper Nederlof},
title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},
journal = {{SIAM} J. Discrete Math.},
volume = {26},
number = {3},
pages = {1008--1021},
year = {2012},
url = {http://dx.doi.org/10.1137/110830514},
doi = {10.1137/110830514},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
}
@inproceedings{DBLP:conf/coco/CyganDLMNOPSW12,
author = {Marek Cygan and
Holger Dell and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Jesper Nederlof and
Yoshio Okamoto and
Ramamohan Paturi and
Saket Saurabh and
Magnus Wahlstr{\"{o}}m},
title = {On Problems as Hard as {CNF-SAT}},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {74--84},
year = {2012},
url = {http://dx.doi.org/10.1109/CCC.2012.36},
doi = {10.1109/CCC.2012.36},
timestamp = {Fri, 13 May 2016 10:26:14 +0200},
}
@inproceedings{DBLP:conf/icalp/FominGNP12,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jesper Nederlof and
Michal Pilipczuk},
title = {Minimizing Rosenthal Potential in Multicast Games},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}},
pages = {525--536},
year = {2012},
url = {http://dx.doi.org/10.1007/978-3-642-31585-5_47},
doi = {10.1007/978-3-642-31585-5_47},
timestamp = {Tue, 03 Jul 2012 08:00:29 +0200},
}
@inproceedings{DBLP:conf/iwpec/KaskiKN12,
author = {Petteri Kaski and
Mikko Koivisto and
Jesper Nederlof},
title = {Homomorphic Hashing for Sparse Coefficient Extraction},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
pages = {147--158},
year = {2012},
url = {http://dx.doi.org/10.1007/978-3-642-33293-7_15},
doi = {10.1007/978-3-642-33293-7_15},
timestamp = {Tue, 18 Sep 2012 10:38:14 +0200},
}
@inproceedings{DBLP:conf/mfcs/NederlofLZ12,
author = {Jesper Nederlof and
Erik Jan van Leeuwen and
Ruben van der Zwaan},
title = {Reducing a Target Interval to a Few Exact Queries},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
pages = {718--727},
year = {2012},
url = {http://dx.doi.org/10.1007/978-3-642-32589-2_62},
doi = {10.1007/978-3-642-32589-2_62},
timestamp = {Sun, 12 Aug 2012 18:04:42 +0200},
}
@inproceedings{DBLP:conf/soda/BjorklundKHNKP12,
author = {Andreas Bj{\"{o}}rklund and
Mikko Koivisto and
Thore Husfeldt and
Jesper Nederlof and
Petteri Kaski and
Pekka Parviainen},
title = {Fast zeta transforms for lattices with few irreducibles},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1436--1444},
year = {2012},
url = {http://portal.acm.org/citation.cfm?id=2095229&CFID=63838676&CFTOKEN=79617016},
timestamp = {Wed, 12 Feb 2014 17:08:16 +0100}
}
@inproceedings{DBLP:conf/focs/CyganNPPRW11,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
title = {Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {150--159},
year = {2011},
url = {http://dx.doi.org/10.1109/FOCS.2011.23},
doi = {10.1109/FOCS.2011.23},
timestamp = {Tue, 16 Dec 2014 00:00:00 +0100},
}
@inproceedings{DBLP:conf/ciac/HeggernesMNV10,
author = {Pinar Heggernes and
Federico Mancini and
Jesper Nederlof and
Yngve Villanger},
title = {A Parameterized Algorithm for Chordal Sandwich},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
pages = {120--130},
year = {2010},
url = {http://dx.doi.org/10.1007/978-3-642-13073-1_12},
doi = {10.1007/978-3-642-13073-1_12},
timestamp = {Sun, 16 May 2010 21:45:07 +0200},
}
@inproceedings{DBLP:conf/iwpec/NederlofR10,
author = {Jesper Nederlof and
Johan M. M. van Rooij},
title = {Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting},
booktitle = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
pages = {204--215},
year = {2010},
url = {http://dx.doi.org/10.1007/978-3-642-17493-3_20},
doi = {10.1007/978-3-642-17493-3_20},
timestamp = {Fri, 27 May 2016 10:03:52 +0200},
}
@inproceedings{DBLP:conf/stoc/LokshtanovN10,
author = {Daniel Lokshtanov and
Jesper Nederlof},
title = {Saving space by algebraization},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {321--330},
year = {2010},
url = {http://doi.acm.org/10.1145/1806689.1806735},
doi = {10.1145/1806689.1806735},
timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
}
@inproceedings{DBLP:conf/wg/HeggernesHLN10,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Jesper Nederlof},
title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30, 2010
Revised Papers},
pages = {75--87},
year = {2010},
url = {http://dx.doi.org/10.1007/978-3-642-16926-7_9},
doi = {10.1007/978-3-642-16926-7_9},
timestamp = {Sat, 20 Nov 2010 19:12:31 +0100},
}
@inproceedings{DBLP:conf/wg/HeggernesLNPT10,
author = {Pinar Heggernes and
Daniel Lokshtanov and
Jesper Nederlof and
Christophe Paul and
Jan Arne Telle},
title = {Generalized Graph Clustering: Recognizing (p, q)-Cluster
Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zaros, Crete, Greece, June 28-30, 2010
Revised Papers},
pages = {171--183},
year = {2010},
url = {http://dx.doi.org/10.1007/978-3-642-16926-7_17},
doi = {10.1007/978-3-642-16926-7_17},
timestamp = {Sat, 20 Nov 2010 19:12:31 +0100},
}
@inproceedings{DBLP:conf/esa/RooijND09,
author = {Johan M. M. van Rooij and
Jesper Nederlof and
Thomas C. van Dijk},
title = {Inclusion/Exclusion Meets Measure and Conquer},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
pages = {554--565},
year = {2009},
url = {http://dx.doi.org/10.1007/978-3-642-04128-0_50},
doi = {10.1007/978-3-642-04128-0_50},
timestamp = {Mon, 21 Sep 2009 15:35:53 +0200},
}
@inproceedings{DBLP:conf/icalp/Nederlof09,
author = {Jesper Nederlof},
title = {Fast Polynomial-Space Algorithms Using M{\"{o}}bius Inversion: Improving
on Steiner Tree and Related Problems},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
pages = {713--725},
year = {2009},
url = {http://dx.doi.org/10.1007/978-3-642-02927-1_59},
doi = {10.1007/978-3-642-02927-1_59},
timestamp = {Mon, 27 Jul 2009 19:02:48 +0200},
}
Note: If you don't see a list of publications, make sure to activate javascript.