( en | de | ru )

 

Disambiguation of "Nederlof, Jesper"

Author of the publication

copydeleteadd this publication to your clipboard
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs.

, , , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jesper Dieckmann

Zur (Psycho-)Pharmakologie halluzinogener Tryptamin-Derivate: eine Literaturübersicht mit besonderer Berücksichtigung der Schizophrenieforschung. MedH Hannover, (2009)

Jesper Hansen

Jesper Mortensen

Andreas Jesper

Jesper Heide

 

Other publications of authors with the same name

Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions., , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 321-334. Springer, (2013)A Parameterized Algorithm for Chordal Sandwich., , , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 120-130. Springer, (2010)Inclusion/Exclusion Meets Measure and Conquer., , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 554-565. Springer, (2009)A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics., , , and . SODA, page 1682-1701. SIAM, (2021)Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space., , , and . FOCS, page 193-204. IEEE, (2021)Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems.. ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 713-725. Springer, (2009)Parameterized problems complete for nondeterministic FPT time and logarithmic space., , , and . Inf. Comput., (2024)Tight Lower Bounds for Problems Parameterized by Rank-Width., , and . STACS, volume 254 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces., , and . SODA, page 1015-1034. SIAM, (2019)Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time., and . SODA, page 971-989. SIAM, (2020)