From post

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.

 

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

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)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)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)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)Parameterized problems complete for nondeterministic FPT time and logarithmic space., , , и . Inf. Comput., (2024)Saving space by algebraization., и . STOC, стр. 321-330. ACM, (2010)Reducing a Target Interval to a Few Exact Queries., , и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 718-727. Springer, (2012)