Author of the publication

Dense Subset Sum May Be the Hardest.

, , , and . STACS, volume 47 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

 

Other publications of authors with the same name

Saving space by algebraization., and . STOC, page 321-330. ACM, (2010)Reducing a Target Interval to a Few Exact Queries., , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 718-727. Springer, (2012)Inclusion/Exclusion Meets Measure and Conquer., , and . Algorithmica, 69 (3): 685-740 (2014)Tight bounds for counting colorings and connected edge sets parameterized by cutwidth., , , and . CoRR, (2021)A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints., , and . CoRR, (2023)Competitive Algorithms for Generalized k-Server in Uniform Metrics., , , and . SODA, page 992-1001. SIAM, (2018)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)Computing the Chromatic Number Using Graph Decompositions via Matrix Rank., and . ESA, volume 112 of LIPIcs, page 47:1-47:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan., and . IPEC, volume 180 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)