Jesper Nederlof

134 papers A* 21A 14B 17C 1Journal 76Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An Invitation to "Fine-grained Complexity of NP-Complete Problems". CoRR Jesper Nederlof
2026	J	`jnl`	An invitation to "Fine-grained complexity of NP -complete problems". Comput. Sci. Rev. Jesper Nederlof
2025	J	`jnl`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. J. ACM Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2025	A*	`conf`	A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. SODA Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
2025	J	`jnl`	Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs. J. Comput. Syst. Sci. Jesper Nederlof, Krisztina Szilágyi
2025	J	`jnl`	Exact and parameterized algorithms for choosability. Acta Informatica Ivan Bliznets, Jesper Nederlof
2025	J	`jnl`	Kronecker scaling of tensors with applications to arithmetic circuits and algorithms. CoRR Andreas Björklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof
2025	J	`jnl`	Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width. CoRR Kacper Kluk, Jesper Nederlof
2025	J	`jnl`	Weighted CoRR Jesper Nederlof
2025	A*	`conf`	Weighted k-Path and Other Problems in Almost O FOCS Jesper Nederlof
2024	B	`conf`	A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor. IPEC Carla Groenland, Jesper Nederlof, Tomohiro Koana
2024	J	`jnl`	A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K CoRR Carla Groenland, Jesper Nederlof, Tomohiro Koana
2024	B	`conf`	Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. SOFSEM Jesper Nederlof, Krisztina Szilágyi
2024	A*	`conf`	Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. ICALP Andreas Björklund, Petteri Kaski, Jesper Nederlof
2024	B	`conf`	Exact and Parameterized Algorithms for Choosability. SOFSEM Ivan Bliznets, Jesper Nederlof
2024	B	`conf`	Parameterized Algorithms for Covering by Arithmetic Progressions. SOFSEM Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
2024	J	`jnl`	Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
2024	A*	`conf`	Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
2023	J	`jnl`	A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM J. Comput. Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
2023	A	`conf`	A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. ESA Isja Mannens, Jesper Nederlof
2023	J	`jnl`	A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. CoRR Isja Mannens, Jesper Nederlof
2023	J	`jnl`	A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. CoRR Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
2023	J	`jnl`	Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. CoRR Jesper Nederlof, Krisztina Szilágyi
2023	J	`jnl`	Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. CoRR Andreas Björklund, Petteri Kaski, Jesper Nederlof
2023	J	`jnl`	Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
2023	J	`jnl`	Competitive Algorithms for Generalized ACM Trans. Algorithms Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2023	J	`jnl`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2023	J	`jnl`	Parameterized Algorithms for Covering by Arithmetic Progressions. CoRR Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
2023	A	`conf`	Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
2023	J	`jnl`	Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
2023	A	`conf`	Tight Lower Bounds for Problems Parameterized by Rank-Width. STACS Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
2023	J	`jnl`	Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
2022	B	`ed.`	17th International Symposium on Parameterized and Exact Computation, IPEC 2022, Potsdam, Germany, September 7-9, 2022 IPEC Holger Dell, Jesper Nederlof
2022	J	`jnl`	Bounding generalized coloring numbers of planar graphs using coin models. CoRR Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
2022	J	`jnl`	Detecting Feedback Vertex Sets of Size ACM Trans. Algorithms Jason Li, Jesper Nederlof
2022	A	`conf`	Isolation Schemes for Problems on Decomposable Graphs. STACS Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2022	J	`jnl`	Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995 CoRR Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
2022	J	`jnl`	On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Algorithmica Jesper Nederlof, Céline M. F. Swennenhuis
2022	J	`jnl`	Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. ACM Trans. Algorithms Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2022	A	`conf`	Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. STACS Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi
2022	J	`jnl`	Tight Lower Bounds for Problems Parameterized by Rank-width. CoRR Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
2021	A*	`conf`	A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SODA Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
2021	A*	`conf`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2021	A*	`conf`	Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. STOC Jesper Nederlof, Karol Wegrzycki
2021	J	`jnl`	Isolation schemes for problems on decomposable graphs. CoRR Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2021	B	`conf`	On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
2021	J	`jnl`	On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. CoRR Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
2021	A*	`conf`	Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
2021	J	`jnl`	Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
2021	J	`jnl`	Tight bounds for counting colorings and connected edge sets parameterized by cutwidth. CoRR Carla Groenland, Jesper Nederlof, Isja Mannens, Krisztina Szilágyi
2020	J	`jnl`	A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. CoRR Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2020	—	`conf`	Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. Treewidth, Kernels, and Algorithms Jesper Nederlof
2020	A*	`conf`	Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication. STOC Jesper Nederlof
2020	A*	`conf`	Detecting Feedback Vertex Sets of Size SODA Jason Li, Jesper Nederlof
2020	A*	`conf`	Detecting and counting small patterns in planar graphs in subexponential parameterized time. STOC Jesper Nederlof
2020	B	`conf`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors. CoRR Jesper Nederlof, Karol Wegrzycki
2020	J	`jnl`	Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2020	B	`conf`	On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. IPEC Jesper Nederlof, Céline M. F. Swennenhuis
2019	J	`jnl`	Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. Bart M. P. Jansen, Jesper Nederlof
2019	J	`jnl`	Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time. CoRR Jason Li, Jesper Nederlof
2019	J	`jnl`	Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time. CoRR Jesper Nederlof
2019	A	`conf`	Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
2019	J	`jnl`	Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
2019	B	`conf`	Hamiltonicity Below Dirac's Condition. WG Bart M. P. Jansen, László Kozma, Jesper Nederlof
2019	J	`jnl`	Hamiltonicity below Dirac's condition. CoRR Bart M. P. Jansen, László Kozma, Jesper Nederlof
2019	A*	`conf`	Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2019	J	`jnl`	New Tools and Connections for Exponential-Time Approximation. Algorithmica Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
2019	J	`jnl`	Parameterized Complexity of Partial Scheduling. CoRR Jesper Nederlof, Céline M. F. Swennenhuis
2018	A*	`conf`	A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. SODA Radu Curticapean, Nathan Lindzey, Jesper Nederlof
2018	A*	`conf`	Competitive Algorithms for Generalized SODA Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2018	A	`conf`	Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. ESA Bart M. P. Jansen, Jesper Nederlof
2018	J	`jnl`	Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. CoRR Bart M. P. Jansen, Jesper Nederlof
2018	J	`jnl`	Fast Hamiltonicity Checking Via Bases of Perfect Matchings. J. ACM Marek Cygan, Stefan Kratsch, Jesper Nederlof
2018	J	`jnl`	Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. SIAM J. Comput. Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
2018	J	`jnl`	More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture. CoRR Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof
2018	A*	`conf`	More consequences of falsifying SETH and the orthogonal vectors conjecture. STOC Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof
2018	J	`jnl`	Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2018	B	`conf`	On Directed Feedback Vertex Set Parameterized by Treewidth. WG Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018	J	`jnl`	Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Trans. Inf. Theory Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2017	J	`jnl`	A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. CoRR Radu Curticapean, Nathan Lindzey, Jesper Nederlof
2017	J	`jnl`	A short note on Merlin-Arthur protocols for subset sum. Inf. Process. Lett. Jesper Nederlof
2017	J	`jnl`	Competitive Algorithms for Generalized k-Server in Uniform Metrics. CoRR Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2017	A*	`conf`	Faster space-efficient algorithms for subset sum and k-sum. STOC Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
2017	J	`jnl`	New Tools and Connections for Exponential-time Approximation. CoRR Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
2017	J	`jnl`	On Directed Feedback Vertex Set parameterized by treewidth. CoRR Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2016	J	`jnl`	A short note on Merlin-Arthur protocols for subset sum. CoRR Jesper Nederlof
2016	A	`conf`	Dense Subset Sum May Be the Hardest. STACS Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2016	—	`ch.`	Exact Algorithms and Time/Space Tradeoffs. Encyclopedia of Algorithms Jesper Nederlof
2016	A	`conf`	Exponential Time Paradigms Through the Polynomial Time Lens. ESA Andrew Drucker, Jesper Nederlof, Rahul Santhanam
2016	J	`jnl`	Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen
2016	J	`jnl`	Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. CoRR Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
2016	A	`conf`	Finding Large Set Covers Faster via the Representation Method. ESA Jesper Nederlof
2016	J	`jnl`	Finding Large Set Covers Faster via the Representation Method. CoRR Jesper Nederlof
2016	J	`jnl`	On Problems as Hard as CNF-SAT. ACM Trans. Algorithms Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2016	J	`jnl`	Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. CoRR Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2016	B	`conf`	Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. ISIT Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2016	A*	`conf`	Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden
2016	J	`jnl`	Subexponential time algorithms for finding small tree and path decompositions. CoRR Hans L. Bodlaender, Jesper Nederlof
2015	J	`jnl`	Dense Subset Sum may be the hardest. CoRR Per Austrin, Mikko Koivisto, Petteri Kaski, Jesper Nederlof
2015	J	`jnl`	Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
2015	J	`jnl`	Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2015	J	`jnl`	Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
2015	A	`conf`	Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. ESA Hans L. Bodlaender, Jesper Nederlof
2015	A	`conf`	Subset Sum in the Absence of Concentration. STACS Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2014	J	`jnl`	Inclusion/Exclusion Meets Measure and Conquer. Algorithmica Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk
2013	—	`conf`	Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. ICALP (1) Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
2013	J	`jnl`	Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. Algorithmica Jesper Nederlof
2013	A*	`conf`	Fast hamiltonicity checking via bases of perfect matchings. STOC Marek Cygan, Stefan Kratsch, Jesper Nederlof
2013	J	`jnl`	Minimizing Rosenthal Potential in Multicast Games. CoRR Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2013	B	`conf`	Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. IPEC Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
2013	J	`jnl`	Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. CoRR Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
2012	J	`jnl`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2012	J	`jnl`	Fast Hamiltonicity checking via bases of perfect matchings CoRR Marek Cygan, Stefan Kratsch, Jesper Nederlof
2012	A*	`conf`	Fast zeta transforms for lattices with few irreducibles. SODA Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen
2012	J	`jnl`	Homomorphic Hashing for Sparse Coefficient Extraction CoRR Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2012	B	`conf`	Homomorphic Hashing for Sparse Coefficient Extraction. IPEC Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2012	—	`conf`	Minimizing Rosenthal Potential in Multicast Games. ICALP (2) Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2012	A	`conf`	On Problems as Hard as CNF-SAT. CCC Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2012	J	`jnl`	Reducing a Target Interval to a Few Exact Queries CoRR Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan
2012	B	`conf`	Reducing a Target Interval to a Few Exact Queries. MFCS Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan
2012	J	`jnl`	Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time CoRR Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
2011	J	`jnl`	On Problems as Hard as CNFSAT CoRR Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2011	A*	`conf`	Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. FOCS Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2011	J	`jnl`	Solving connectivity problems parameterized by treewidth in single exponential time CoRR Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2010	C	`conf`	A Parameterized Algorithm for Chordal Sandwich. CIAC Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger
2010	B	`conf`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2010	B	`conf`	Generalized Graph Clustering: Recognizing ( WG Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
2010	B	`conf`	Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. IPEC Jesper Nederlof, Johan M. M. van Rooij
2010	A*	`conf`	Saving space by algebraization. STOC Daniel Lokshtanov, Jesper Nederlof
2009	—	`conf`	Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. ICALP (1) Jesper Nederlof
2009	A	`conf`	Inclusion/Exclusion Meets Measure and Conquer. ESA Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk