Debmalya Panigrahi
Duke University
H-index: 30
North America-United States
Top articles of Debmalya Panigrahi
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Discrete-Smoothness in Online Algorithms with Predictions | Advances in Neural Information Processing Systems | Yossi Azar Debmalya Panigrahi Noam Touitou | 2024/2/13 |
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422) | Jason Li Debmalya Panigrahi Laura Sanita Thatchaphol Saranurak | 2024 | |
Poly-logarithmic Competitiveness for the k-Taxi Problem | Anupam Gupta Amit Kumar Debmalya Panigrahi | 2024 | |
Beyond the quadratic time barrier for network unreliability | Ruoxu Cen William He Jason Li Debmalya Panigrahi | 2024 | |
Hypergraph Unreliability in Quasi-Polynomial Time | arXiv preprint arXiv:2403.18781 | Ruoxu Cen Jason Li Debmalya Panigrahi | 2024/3/27 |
Max-Cut with -Accurate Predictions | arXiv preprint arXiv:2402.18263 | Vincent Cohen-Addad Tommaso d'Orsi Anupam Gupta Euiwoong Lee Debmalya Panigrahi | 2024/2/28 |
ACM Transactions on | ACM Transactions on | Edith Cohen Susanne Albers Glencora Borradaile Andrei A Bulatov Keren Censor-Hillel | 2023 |
Efficient Algorithms and Hardness Results for the Weighted -Server Problem | arXiv preprint arXiv:2307.11913 | Anupam Gupta Amit Kumar Debmalya Panigrahi | 2023/7/21 |
Near-linear time approximations for cut problems via fair cuts | Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak | 2023 | |
A general framework for learning-augmented online allocation | arXiv preprint arXiv:2305.18861 | Ilan Reuven Cohen Debmalya Panigrahi | 2023/5/30 |
Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows | Ruoxu Cen William He Jason Li Debmalya Panigrahi | 2023 | |
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions | Kyle Fox Debmalya Panigrahi Fred Zhang | 2019 | |
Universal algorithms for clustering problems | ACM Transactions on Algorithms | Arun Ganesh Bruce M Maggs Debmalya Panigrahi | 2023/3/9 |
Robust algorithms for TSP and Steiner tree | ACM Transactions on Algorithms | Arun Ganesh Bruce M Maggs Debmalya Panigrahi | 2023/3/9 |
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time | Amir Abboud Jason Li Debmalya Panigrahi Thatchaphol Saranurak | 2023/11/6 | |
Minimum cuts in directed graphs via partial sparsification | Ruoxu Cen Jason Li Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak | 2022/2/7 | |
Learning Influence Adoption in Heterogeneous Networks | Proceedings of the AAAI Conference on Artificial Intelligence | Vincent Conitzer Debmalya Panigrahi Hanrui Zhang | 2022/6/28 |
The pit stop problem: how to plan your next road trip | Sreenivas Gollapudi Kostas Kollias Debmalya Panigrahi | 2022/11/1 | |
A nearly optimal all-pairs min-cuts algorithm in simple graphs | Jason Li Debmalya Panigrahi Thatchaphol Saranurak | 2022/2/7 | |
Online paging with heterogeneous cache slots | arXiv preprint arXiv:2206.05579 | Marek Chrobak Samuel Haney Mehraneh Liaee Debmalya Panigrahi Rajmohan Rajaraman | 2022/6/11 |
Co-Authors
