( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.

, и . IPEC, том 180 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

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

 

Другие публикации лиц с тем же именем

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