Author of the publication

Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms.

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

Decomposable Submodular Function Minimization via Maximum Flow., , , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 446-456. PMLR, (2021)Sparse Convex Optimization via Adaptively Regularized Hard Thresholding., and . ICML, volume 119 of Proceedings of Machine Learning Research, page 452-462. PMLR, (2020)On the Size and the Approximability of Minimum Temporally Connected Subgraphs., and . ICALP, volume 55 of LIPIcs, page 149:1-149:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Greedy PIG: Adaptive Integrated Gradients., , , , and . CoRR, (2023)Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond., , , , , , , and . CoRR, (2024)SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization., , , , and . CoRR, (2024)Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs., , and . FOCS, page 93-104. IEEE, (2020)Local Search Algorithms for Rank-Constrained Convex Optimization., and . ICLR, OpenReview.net, (2021)Fast Modular Subset Sum using Linear Sketching., , , , and . SODA, page 58-69. SIAM, (2019)SubMix: Learning to Mix Graph Sampling Heuristics., , , , , , , and . UAI, volume 216 of Proceedings of Machine Learning Research, page 1-10. PMLR, (2023)