default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesper Nederlof
Person information
- affiliation: Utrecht University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j23]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)- [c53]Andreas Björklund, Petteri Kaski, Jesper Nederlof:
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. ICALP 2024: 26:1-26:20 - [c52]Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski:
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP 2024: 77:1-77:21 - [c51]Ivan Bliznets, Jesper Nederlof:
Exact and Parameterized Algorithms for Choosability. SOFSEM 2024: 111-124 - [c50]Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi:
Parameterized Algorithms for Covering by Arithmetic Progressions. SOFSEM 2024: 125-138 - [c49]Jesper Nederlof, Krisztina Szilágyi:
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. SOFSEM 2024: 413-426 - 2023
- [j22]Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki:
Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. 30(3) (2023) - [j21]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) - [j20]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) - [j19]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. ACM Trans. Algorithms 19(1): 8:1-8:15 (2023) - [c48]Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA 2023: 33:1-33:13 - [c47]Isja Mannens, Jesper Nederlof:
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 - [c46]Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof:
Tight Lower Bounds for Problems Parameterized by Rank-Width. STACS 2023: 11:1-11:17 - [i44]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) - [i43]Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR abs/2307.01341 (2023) - [i42]Andreas Björklund, Petteri Kaski, Jesper Nederlof:
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. CoRR abs/2308.01574 (2023) - [i41]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) - [i40]Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski:
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR abs/2312.03859 (2023) - [i39]Jesper Nederlof, Krisztina Szilágyi:
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. CoRR abs/2312.06377 (2023) - [i38]Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi:
Parameterized Algorithms for Covering by Arithmetic Progressions. CoRR abs/2312.06393 (2023) - 2022
- [j18]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) - [j17]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. ACM Trans. Algorithms 18(2): 17:1-17:31 (2022) - [j16]Jason Li, Jesper Nederlof:
Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) Time. ACM Trans. Algorithms 18(4): 34:1-34:26 (2022) - [c45]Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi:
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. STACS 2022: 36:1-36:20 - [c44]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Isolation Schemes for Problems on Decomposable Graphs. STACS 2022: 50:1-50:20 - [e1]Holger Dell, Jesper Nederlof:
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany. LIPIcs 249, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-260-0 [contents] - [i37]Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki:
Bounding generalized coloring numbers of planar graphs using coin models. CoRR abs/2201.09340 (2022) - [i36]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) - [i35]Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof:
Tight Lower Bounds for Problems Parameterized by Rank-width. CoRR abs/2210.02117 (2022) - 2021
- [c43]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 - [c42]Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki:
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS 2021: 351-362 - [c41]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 - [c40]Jesper Nederlof, Karol Wegrzycki:
Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. STOC 2021: 1670-1683 - [c39]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 - [i34]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Isolation schemes for problems on decomposable graphs. CoRR abs/2105.01465 (2021) - [i33]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) - [i32]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) - [i31]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) - 2020
- [j15]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms 16(3): 28:1-28:30 (2020) - [c38]Jesper Nederlof:
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. Treewidth, Kernels, and Algorithms 2020: 145-164 - [c37]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 - [c36]Jason Li, Jesper Nederlof:
Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time. SODA 2020: 971-989 - [c35]Jesper Nederlof:
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication. STOC 2020: 40-53 - [c34]Jesper Nederlof:
Detecting and counting small patterns in planar graphs in subexponential parameterized time. STOC 2020: 1293-1306 - [c33]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 - [i30]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) - [i29]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) - [i28]Jesper Nederlof, Karol Wegrzycki:
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors. CoRR abs/2010.08576 (2020) - [i27]Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki:
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR abs/2011.03778 (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. CCC 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).
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-10-07 22:18 CEST 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:
