Debmalya Panigrahi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
89
Venues
18
Active years
2007–2026
Best venue rank
A*
Where they publish
Papers
89 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Learning-Augmented Online Sorting and TSP. | Ioana O. Bercea, Gerth Stlting Brodal, John Iacono, Lszl Kozma, Debmalya Panigrahi |
| 2026 | ICALP | Online Metric TSP: Beyond the √n Barrier. | Yossi Azar, Debmalya Panigrahi, Or Vardi |
| 2026 | SODA | An Optimal Online Algorithm for Robust Flow Time Scheduling. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi, Zhaozi Wang |
| 2026 | SODA | Nearly Tight Bounds for the Online Sorting Problem. | Yossi Azar, Debmalya Panigrahi, Or Vardi |
| 2026 | SODA | Language Generation in the Limit: Noise, Loss, and Feedback. | Yannan Bai, Debmalya Panigrahi, Ian Zhang |
| 2026 | STOC | Fully Dynamic Set Cover: Worst-Case Recourse and Update Time. | Sayan Bhattacharya, Ruoxu Cen, Debmalya Panigrahi |
| 2026 | STOC | An Optimal Algorithm for Stochastic Vertex Cover. | Jan van den Brand, Inge Li Grtz, Chirag Pabbaraju, Debmalya Panigrahi, Clifford Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian |
| 2026 | STOC | Combinatorial Optimization using Comparison Oracles. | Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Renato Paes Leme, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff |
| 2025 | FOCS | Deterministic Almost-Linear-Time Gomory-Hu Trees. | Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan |
| 2025 | FOCS | Fast Algorithms for Graph Arboricity and Related Problems. | Ruoxu Cen, Henry L. Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi |
| 2025 | STOC | Tight Results for Online Convex Paging. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2025 | STOC | Network Unreliability in Almost-Linear Time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2024 | SODA | Beyond the Quadratic Time Barrier for Network Unreliability. | Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi |
| 2024 | SODA | Poly-logarithmic Competitiveness for the | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2024 | STOC | Hypergraph Unreliability in Quasi-Polynomial Time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2023 | FOCS | 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 | ICALP | A General Framework for Learning-Augmented Online Allocation. | Ilan Reuven Cohen, Debmalya Panigrahi |
| 2023 | SODA | Near-Linear Time Approximations for Cut Problems via Fair Cuts. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2023 | SODA | Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. | Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi |
| 2023 | STACS | Online Paging with Heterogeneous Cache Slots. | Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young |
| 2022 | AAAI | Learning Influence Adoption in Heterogeneous Networks. | Vincent Conitzer, Debmalya Panigrahi, Hanrui Zhang |
| 2022 | FOCS | Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. | Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi |
| 2022 | ICML | Online Algorithms with Multiple Predictions. | Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi |
| 2022 | SIGMOD | Selectivity Functions of Range Queries are Learnable. | Xiao Hu, Yuxi Liu, Haibo Xiu, Pankaj K. Agarwal, Debmalya Panigrahi, Sudeepa Roy, Jun Yang |
| 2022 | SODA | Online Graph Algorithms with Predictions. | Yossi Azar, Debmalya Panigrahi, Noam Touitou |
| 2022 | SODA | Augmenting Edge Connectivity via Isolating Cuts. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2022 | STOC | Edge connectivity augmentation in near-linear time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2021 | FOCS | A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2021 | FOCS | A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. | Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2021 | FOCS | Minimum Cuts in Directed Graphs via Partial Sparsification. | Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud |
| 2021 | ICALP | Sparsification of Directed Graphs via Cut Balance. | Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun |
| 2021 | ICALP | Universal Algorithms for Clustering Problems. | Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi |
| 2021 | SODA | Online Combinatorial Auctions. | Yuan Deng, Debmalya Panigrahi, Hanrui Zhang |
| 2021 | STOC | Vertex connectivity in poly-logarithmic max-flows. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2021 | STOC | Approximate Gomory-Hu tree is faster than | Jason Li, Debmalya Panigrahi |
| 2020 | FOCS | Deterministic Min-cut in Poly-logarithmic Max-flows. | Jason Li, Debmalya Panigrahi |
| 2020 | ICALP | Online Two-Dimensional Load Balancing. | Ilan Reuven Cohen, Sungjin Im, Debmalya Panigrahi |
| 2020 | ICALP | Robust Algorithms for TSP and Steiner Tree. | Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi |
| 2020 | ICALP | Online Algorithms for Weighted Paging with Predictions. | Zhihao Jiang, Debmalya Panigrahi, Kevin Sun |
| 2020 | ICML | Customizing ML Predictions for Online Algorithms. | Keerti Anand, Rong Ge, Debmalya Panigrahi |
| 2020 | ICML | Learning Opinions in Social Networks. | Vincent Conitzer, Debmalya Panigrahi, Hanrui Zhang |
| 2020 | STOC | Caching with time windows. | Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2019 | AAAI | You Get What You Share: Incentives for a Sharing Economy. | Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi |
| 2019 | EC | Pacing Equilibrium in First-Price Auction Markets. | Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Eric Sodomka, Nicols E. Stier Moses, Chris Wilkens |
| 2019 | ICALP | Retracting Graphs to Cycles. | Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram |
| 2019 | ICML | Online Algorithms for Rent-Or-Buy with Expert Advice. | Sreenivas Gollapudi, Debmalya Panigrahi |
| 2019 | SODA | Multi-unit Supply-monotone Auctions with Bayesian Valuations. | Yuan Deng, Debmalya Panigrahi |
| 2019 | SODA | Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. | Kyle Fox, Debmalya Panigrahi, Fred Zhang |
| 2019 | SODA | Elastic Caching. | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi |
| 2019 | STOC | Dynamic set cover: improved algorithms and lower bounds. | Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni, Debmalya Panigrahi, Barna Saha |
| 2018 | WWW | Minimizing Latency in Online Ride and Delivery Services. | Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy |
| 2018 | SODA | Randomized Algorithms for Online Vector Load Balancing. | Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi |
| 2018 | STOC | Online load balancing on related machines. | Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo |
| 2017 | AAAI | The Complexity of Stable Matchings under Substitutable Preferences. | Yuan Deng, Debmalya Panigrahi, Bo Waggoner |
| 2017 | CIKM | Partitioning Orders in Online Shopping Services. | Sreenivas Gollapudi, Ravi Kumar, Debmalya Panigrahi, Rina Panigrahy |
| 2017 | ESA | Profit Sharing and Efficiency in Utility Games. | Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika |
| 2017 | SODA | Random Contractions and Sampling for Hypergraph and Hedge Connectivity. | Mohsen Ghaffari, David R. Karger, Debmalya Panigrahi |
| 2017 | STOC | Online service with delay. | Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi |
| 2017 | STOC | Online and dynamic algorithms for set cover. | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi |
| 2016 | FOCS | Online Algorithms for Covering and Packing Problems with Convex Objectives. | Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi |
| 2015 | FOCS | Online Buy-at-Bulk Network Design. | Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi |
| 2015 | FOCS | Tight Bounds for Online Vector Scheduling. | Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi |
| 2015 | SPAA | Speed Scaling in the Non-clairvoyant Model. | Yossi Azar, Nikhil R. Devanur, Zhiyi Huang, Debmalya Panigrahi |
| 2014 | CIKM | Fair Allocation in Online Markets. | Sreenivas Gollapudi, Debmalya Panigrahi |
| 2014 | ICALP | Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems. | MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi |
| 2014 | ICALP | Precedence-Constrained Scheduling of Malleable Jobs with Preemption. | Konstantin Makarychev, Debmalya Panigrahi |
| 2013 | FOCS | Online Node-Weighted Steiner Forest and Extensions via Disk Paintings. | Mohammad Taghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi |
| 2013 | SODA | Online Mixed Packing and Covering. | Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi |
| 2013 | WSDM | Document selection for tiered indexing in commerce search. | Debmalya Panigrahi, Sreenivas Gollapudi |
| 2012 | FOCS | Online Matching with Stochastic Rewards. | Aranyak Mehta, Debmalya Panigrahi |
| 2012 | WSDM | Online selection of diverse results. | Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwal, Andrew Tomkins |
| 2011 | FOCS | Online Node-Weighted Steiner Tree and Related Problems. | Joseph Naor, Debmalya Panigrahi, Mohit Singh |
| 2011 | PODS | Provenance views for module privacy. | Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debmalya Panigrahi, Sudeepa Roy |
| 2011 | SODA | Survivable Network Design Problems in Wireless Networks. | Debmalya Panigrahi |
| 2011 | STOC | A general framework for graph sparsification. | Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi |
| 2011 | WSDM | Result enrichment in commerce search using browse trails. | Debmalya Panigrahi, Sreenivas Gollapudi |
| 2010 | INFOCOM | Collaborative Measurements of Upload Speeds in P2P Systems. | John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi |
| 2010 | INFOCOM | Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas. | Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Rajeev Rastogi |
| 2009 | CoNEXT | ThunderDome: discovering upload constraints using decentralized bandwidth tournaments. | John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi |
| 2009 | ICALP | Maximum Bipartite Flow in Networks with Adaptive Channel Width. | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan |
| 2009 | INFOCOM | TDMA Scheduling in Long-Distance WiFi Networks. | Debmalya Panigrahi, Bhaskaran Raman |
| 2009 | PODC | Brief announcement: collaborative measurement of upload speeds in P2P systems. | John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi |
| 2009 | SODA | A near-linear time algorithm for constructing a cactus representation of minimum cuts. | David R. Karger, Debmalya Panigrahi |
| 2008 | INFOCOM | A New Channel Assignment Mechanism for Rural Wireless Mesh Networks. | Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi |
| 2008 | INFOCOM | Detecting Anomalies Using End-to-End Path Measurements. | K. V. M. Naidu, Debmalya Panigrahi, Rajeev Rastogi |
| 2008 | INFOCOM | Minimum Cost Topology Construction for Rural Wireless Mesh Networks. | Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, K. V. M. Naidu, Rajeev Rastogi |
| 2008 | SODA | Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
| 2007 | SODA | Efficient algorithms for computing all low | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
| 2007 | STOC | An (mn) Gomory-Hu tree construction algorithm for unweighted graphs. | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |