Author of the publication

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem.

, , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 248-260. Springer, (2019)

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

Interval Query Problem on Cube-Free Median Graphs.. ISAAC, volume 212 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Average Sensitivity of the Knapsack Problem., and . ESA, volume 244 of LIPIcs, page 75:1-75:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Convexity of b-matching Games., and . IJCAI, page 261-267. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem., , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 248-260. Springer, (2019)Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property., and . IWOCA, volume 12757 of Lecture Notes in Computer Science, page 428-441. Springer, (2021)r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes., and . CoRR, (2020)Average Sensitivity of Dynamic Programming., and . SODA, page 1925-1961. SIAM, (2022)Average sensitivity of the Knapsack Problem., and . CoRR, (2024)Incorrect implementations of the Floyd-Warshall algorithm give correct solutions after three repeats., , and . CoRR, (2019)Dichotomies for Tree Minor Containment with Structural Parameters., , , , and . WALCOM, volume 14549 of Lecture Notes in Computer Science, page 392-405. Springer, (2024)