pith. sign in

Jesper Nederlof

Identifiers

  • name variant Jesper Nederlof 0.60 · backfill

Papers (26)

  1. New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph cs.DS · 2026 · author #3
  2. Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics cs.DS · 2026 · author #2
  3. Equal-Subset-Sum Faster Than the Meet-in-the-Middle cs.DS · 2019 · author #2
  4. Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time cs.DS · 2019 · author #1
  5. Hamiltonicity below Dirac's condition cs.DS · 2019 · author #3
  6. Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces cs.DS · 2018 · author #2
  7. Computing the Chromatic Number Using Graph Decompositions via Matrix Rank cs.DS · 2018 · author #2
  8. More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture cs.CC · 2018 · author #4
  9. A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank cs.DS · 2017 · author #3
  10. New Tools and Connections for Exponential-time Approximation cs.DS · 2017 · author #5
  11. Competitive Algorithms for Generalized k-Server in Uniform Metrics cs.DS · 2017 · author #4
  12. On Directed Feedback Vertex Set parameterized by treewidth cs.DS · 2017 · author #3
  13. Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems cs.DS · 2016 · author #3
  14. Finding Large Set Covers Faster via the Representation Method cs.DS · 2016 · author #1
  15. Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs cs.IT · 2016 · author #4
  16. A short note on Merlin-Arthur protocols for subset sum cs.CC · 2016 · author #1
  17. Subexponential time algorithms for finding small tree and path decompositions cs.DS · 2016 · author #2
  18. Dense Subset Sum may be the hardest cs.DS · 2015 · author #4
  19. Minimizing Rosenthal Potential in Multicast Games cs.GT · 2013 · author #3
  20. Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions cs.DS · 2013 · author #3
  21. Fast Hamiltonicity checking via bases of perfect matchings cs.DS · 2012 · author #3
  22. Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time cs.DS · 2012 · author #4
  23. Reducing a Target Interval to a Few Exact Queries cs.DS · 2012 · author #1
  24. Homomorphic Hashing for Sparse Coefficient Extraction cs.CC · 2012 · author #3
  25. On Problems as Hard as CNFSAT cs.DS · 2011 · author #5
  26. Solving connectivity problems parameterized by treewidth in single exponential time cs.DS · 2011 · author #2

Mentions

  • 1508.06019 #4 · backfill · confidence 0.70 Jesper Nederlof
  • 1309.6797 #3 · backfill · confidence 0.70 Jesper Nederlof
  • 1305.7448 #3 · backfill · confidence 0.70 Jesper Nederlof
  • 1211.1506 #3 · backfill · confidence 0.70 Jesper Nederlof
  • 1211.1505 #4 · backfill · confidence 0.70 Jesper Nederlof
  • 1208.4225 #1 · backfill · confidence 0.70 Jesper Nederlof
  • 1203.4063 #3 · backfill · confidence 0.70 Jesper Nederlof
  • 1112.2275 #5 · backfill · confidence 0.70 Jesper Nederlof
  • 1103.0534 #2 · backfill · confidence 0.70 Jesper Nederlof

Frequent Coauthors