Online Metric TSP: Beyond the √n Barrier.

Debmalya Panigrahi Duke University, NC, USA https://orcid.org/0000-0003-1799-6660 https://www.wikidata.org/entity/Q135685449 Yossi Azar Debmalya Panigrahi Or Vardi Online Metric TSP: Beyond the √n Barrier. 18:1-18:18 2026 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2026.18 conf/icalp/2026 db/conf/icalp/icalp2026.html#AzarPV26 Yannan Bai Debmalya Panigrahi Ian Zhang 0003 Language Generation in the Limit: Noise, Loss, and Feedback. 794-816 2026 SODA https://doi.org/10.1137/1.9781611978971.31 conf/soda/2026 db/conf/soda/soda2026.html#BaiP026 Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Zhaozi Wang An Optimal Online Algorithm for Robust Flow Time Scheduling. 1214-1238 2026 SODA https://doi.org/10.1137/1.9781611978971.47 conf/soda/2026 db/conf/soda/soda2026.html#00010PW26 Yossi Azar Debmalya Panigrahi Or Vardi Nearly Tight Bounds for the Online Sorting Problem. 6642-6658 2026 SODA https://doi.org/10.1137/1.9781611978971.237 conf/soda/2026 db/conf/soda/soda2026.html#AzarPV26 Sayan Bhattacharya Ruoxu Cen Debmalya Panigrahi Fully Dynamic Set Cover: Worst-Case Recourse and Update Time. 910-921 2026 STOC https://doi.org/10.1145/3798129.3800805 conf/stoc/2026 db/conf/stoc/stoc2026.html#BhattacharyaCP26 Jan van den Brand Inge Li Gørtz Chirag Pabbaraju Debmalya Panigrahi Clifford Stein 0001 Miltiadis Stouras Ola Svensson Ali Vakilian An Optimal Algorithm for Stochastic Vertex Cover. 1548-1557 2026 STOC https://doi.org/10.1145/3798129.3800863 conf/stoc/2026 db/conf/stoc/stoc2026.html#BrandGPPSSSV26 Vincent Cohen-Addad Tommaso d'Orsi Anupam Gupta 0001 Guru Guruganesh Euiwoong Lee Renato Paes Leme Debmalya Panigrahi Madhusudhan Reddy Pittu Jon Schneider David P. Woodruff Combinatorial Optimization using Comparison Oracles. 1995-2006 2026 STOC https://doi.org/10.1145/3798129.3800904 conf/stoc/2026 db/conf/stoc/stoc2026.html#Cohen-AddaddGGL26

Anish Hebbar Rong Ge 0001 Amit Kumar 0001 Debmalya Panigrahi Learning-Augmented Algorithms for k-median via Online Learning. 2026 March abs/2603.18157 CoRR https://doi.org/10.48550/arXiv.2603.18157 db/journals/corr/corr2603.html#abs-2603-18157 streams/journals/corr

Jan van den Brand Inge Li Gørtz Chirag Pabbaraju Debmalya Panigrahi Clifford Stein 0001 Miltiadis Stouras Ola Svensson Ali Vakilian An Optimal Algorithm for Stochastic Vertex Cover. 2026 March abs/2603.27795 CoRR https://doi.org/10.48550/arXiv.2603.27795 db/journals/corr/corr2603.html#abs-2603-27795 streams/journals/corr

Marek Chrobak Samuel Haney Mehraneh Liaee Debmalya Panigrahi Rajmohan Rajaraman Ravi Sundaram Neal E. Young Online Paging with Heterogeneous Cache Slots. 89-131 2025 January 87 Algorithmica 1 https://doi.org/10.1007/s00453-024-01270-z db/journals/algorithmica/algorithmica87.html#ChrobakHLPRSY25 streams/journals/algorithmica

Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Sorrachai Yingchareonthawornchai Vertex Connectivity in Poly-logarithmic Max-Flows. 28:1-28:34 2025 August 72 J. ACM 4 https://doi.org/10.1145/3743670 db/journals/jacm/jacm72.html#LiNPSY25 streams/journals/jacm

Jason Li 0006 Debmalya Panigrahi Deterministic Minimum Cut in Poly-logarithmic Maximum Flows. 29:1-29:18 2025 August 72 J. ACM 4 https://doi.org/10.1145/3744737 db/journals/jacm/jacm72.html#LiP25 streams/journals/jacm

Yuval Filmus Debmalya Panigrahi Daniel Stefankovic Avishay Tal Special Section on the Sixtieth Annual Symposium on Foundations of Computer Science (FOCS 2019). S19- 2025 54 SIAM J. Comput. 4 https://doi.org/10.1137/25m176249x db/journals/siamcomp/siamcomp54.html#FilmusPST25 streams/journals/siamcomp

Amir Abboud Rasmus Kyng Jason Li 0006 Debmalya Panigrahi Maximilian Probst Gutenberg Thatchaphol Saranurak Weixuan Yuan Wuwei Yuan Deterministic Almost-Linear-Time Gomory-Hu Trees. FOCS 2025 659-666 conf/focs/2025 https://doi.org/10.1109/FOCS63196.2025.00035 db/conf/focs/focs2025.html#AbboudKLPGSYY25 streams/conf/focs Ruoxu Cen Henry L. Fleischmann George Z. Li Jason Li 0006 Debmalya Panigrahi Fast Algorithms for Graph Arboricity and Related Problems. FOCS 2025 964-982 conf/focs/2025 https://doi.org/10.1109/FOCS63196.2025.00050 db/conf/focs/focs2025.html#CenFLLP25 streams/conf/focs Aditya Anand 0001 Vincent Cohen-Addad Tommaso d'Orsi Anupam Gupta 0001 Euiwoong Lee Debmalya Panigrahi Sijin Peng Complexity of Local Search for CSPs Parameterized by Constraint Difference. 26:1-26:17 2025 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2025.26 conf/iwpec/2025 db/conf/iwpec/ipec2025.html#0001Cd0LPP25 Ilan Reuven Cohen Debmalya Panigrahi A Learning-Augmented Approach to Online Allocation Problems. 2025 NeurIPS http://papers.nips.cc/paper_files/paper/2025/hash/eded464db02ad5b5138970efe194050a-Abstract-Conference.html conf/nips/2025 db/conf/nips/neurips2025.html#CohenP25 Anish Hebbar Rong Ge 0001 Amit Kumar 0001 Debmalya Panigrahi Learning-Augmented Algorithms for $k$-median via Online Learning. 2025 NeurIPS http://papers.nips.cc/paper_files/paper/2025/hash/b8e2046160a568145af6d42eeef199f4-Abstract-Conference.html conf/nips/2025 db/conf/nips/neurips2025.html#HebbarGKP25 Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Network Unreliability in Almost-Linear Time. 120-131 2025 STOC https://doi.org/10.1145/3717823.3718140 https://www.wikidata.org/entity/Q135685450 conf/stoc/2025 db/conf/stoc/stoc2025.html#CenLP25 Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Tight Results for Online Convex Paging. 1418-1429 2025 STOC https://doi.org/10.1145/3717823.3718217 https://www.wikidata.org/entity/Q135685687 conf/stoc/2025 db/conf/stoc/stoc2025.html#00010P25 Yossi Azar Debmalya Panigrahi Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025 SODA SIAM 2025 978-1-61197-832-2 https://doi.org/10.1137/1.9781611978322 db/conf/soda/soda2025.html

Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Network Unreliability in Almost-Linear Time. 2025 March abs/2503.23526 CoRR https://doi.org/10.48550/arXiv.2503.23526 db/journals/corr/corr2503.html#abs-2503-23526 streams/journals/corr

Yannan Bai Debmalya Panigrahi Ian Zhang 0003 Language Generation in the Limit: Noise, Loss, and Feedback. 2025 July abs/2507.15319 CoRR https://doi.org/10.48550/arXiv.2507.15319 db/journals/corr/corr2507.html#abs-2507-15319 streams/journals/corr

Ruoxu Cen Henry L. Fleischmann George Z. Li Jason Li 0006 Debmalya Panigrahi Fast Algorithms for Graph Arboricity and Related Problems. 2025 July abs/2507.15598 CoRR https://doi.org/10.48550/arXiv.2507.15598 db/journals/corr/corr2507.html#abs-2507-15598 streams/journals/corr

Amir Abboud Rasmus Kyng Jason Li 0006 Debmalya Panigrahi Maximilian Probst Gutenberg Thatchaphol Saranurak Weixuan Yuan Wuwei Yuan Deterministic Almost-Linear-Time Gomory-Hu Trees. 2025 July abs/2507.20354 CoRR https://doi.org/10.48550/arXiv.2507.20354 db/journals/corr/corr2507.html#abs-2507-20354 streams/journals/corr

Yossi Azar Debmalya Panigrahi Or Vardi Nearly Tight Bounds for the Online Sorting Problem. 2025 August abs/2508.14287 CoRR https://doi.org/10.48550/arXiv.2508.14287 db/journals/corr/corr2508.html#abs-2508-14287 streams/journals/corr

Sayan Bhattacharya Ruoxu Cen Debmalya Panigrahi Fully Dynamic Set Cover: Worst-Case Recourse and Update Time. 2025 November abs/2511.08485 CoRR https://doi.org/10.48550/arXiv.2511.08485 db/journals/corr/corr2511.html#abs-2511-08485 streams/journals/corr

Vincent Cohen-Addad Tommaso d'Orsi Anupam Gupta 0001 Guru Guruganesh Euiwoong Lee Debmalya Panigrahi Madhusudhan Reddy Pittu Jon Schneider David P. Woodruff Combinatorial Optimization using Comparison Oracles. 2025 November abs/2511.15142 CoRR https://doi.org/10.48550/arXiv.2511.15142 db/journals/corr/corr2511.html#abs-2511-15142 streams/journals/corr

Aditya Anand 0001 Vincent Cohen-Addad Tommaso d'Orsi Anupam Gupta 0001 Euiwoong Lee Debmalya Panigrahi Sijin Peng Complexity of Local Search for CSPs Parameterized by Constraint Difference. 2025 December abs/2512.03275 CoRR https://doi.org/10.48550/arXiv.2512.03275 db/journals/corr/corr2512.html#abs-2512-03275 streams/journals/corr

Jason Li 0006 Debmalya Panigrahi Approximate Gomory-Hu Tree is Faster than $\boldsymbol{n}\,\boldsymbol{-\, 1}$ Maximum Flows. 1162-1180 2024 53 SIAM J. Comput. 4 https://doi.org/10.1137/21m1463379 db/journals/siamcomp/siamcomp53.html#LiP24 streams/journals/siamcomp

Vincent Cohen-Addad Tommaso d'Orsi Anupam Gupta 0001 Euiwoong Lee Debmalya Panigrahi Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems. 2024 NeurIPS http://papers.nips.cc/paper_files/paper/2024/hash/2db08b94565c0d582cc53de6cee5fd47-Abstract-Conference.html conf/nips/2024 db/conf/nips/neurips2024.html#Cohen-Addadd0LP24 Ruoxu Cen William He Jason Li 0006 Debmalya Panigrahi Beyond the Quadratic Time Barrier for Network Unreliability. 1542-1567 2024 SODA https://doi.org/10.1137/1.9781611977912.62 conf/soda/2024 db/conf/soda/soda2024.html#CenHLP24 Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Poly-logarithmic Competitiveness for the k-Taxi Problem. 4220-4246 2024 SODA https://doi.org/10.1137/1.9781611977912.146 conf/soda/2024 db/conf/soda/soda2024.html#GuptaKP24 Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Hypergraph Unreliability in Quasi-Polynomial Time. 1700-1711 2024 STOC https://doi.org/10.1145/3618260.3649753 conf/stoc/2024 db/conf/stoc/stoc2024.html#Cen0P24

Vincent Cohen-Addad Tommaso d'Orsi Anupam Gupta 0001 Euiwoong Lee Debmalya Panigrahi Max-Cut with ε-Accurate Predictions. 2024 abs/2402.18263 CoRR https://doi.org/10.48550/arXiv.2402.18263 db/journals/corr/corr2402.html#abs-2402-18263

Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Hypergraph Unreliability in Quasi-Polynomial Time. 2024 abs/2403.18781 CoRR https://doi.org/10.48550/arXiv.2403.18781 db/journals/corr/corr2403.html#abs-2403-18781

Arun Ganesh Bruce M. Maggs Debmalya Panigrahi Robust Algorithms for TSP and Steiner Tree. 12:1-12:37 2023 April 19 ACM Trans. Algorithms 2 https://doi.org/10.1145/3570957 db/journals/talg/talg19.html#GaneshMP23

Kyle Fox Debmalya Panigrahi Fred Zhang Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. 13:1-13:22 2023 April 19 ACM Trans. Algorithms 2 https://doi.org/10.1145/3570162 db/journals/talg/talg19.html#FoxPZ23

Arun Ganesh Bruce M. Maggs Debmalya Panigrahi Universal Algorithms for Clustering Problems. 15:1-15:46 2023 April 19 ACM Trans. Algorithms 2 https://doi.org/10.1145/3572840 db/journals/talg/talg19.html#GaneshMP23a

Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. 12:1-12:19 2023 APPROX/RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.12 conf/approx/2023 db/conf/approx/approx2023.html#00010P23 Amir Abboud Jason Li 0006 Debmalya Panigrahi Thatchaphol Saranurak All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. 2204-2212 2023 FOCS https://doi.org/10.1109/FOCS57990.2023.00137 conf/focs/2023 db/conf/focs/focs2023.html#Abboud0PS23 Ilan Reuven Cohen Debmalya Panigrahi A General Framework for Learning-Augmented Online Allocation. 43:1-43:21 2023 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2023.43 conf/icalp/2023 db/conf/icalp/icalp2023.html#CohenP23 Yossi Azar Debmalya Panigrahi Noam Touitou Discrete-Smoothness in Online Algorithms with Predictions. 2023 NeurIPS http://papers.nips.cc/paper_files/paper/2023/hash/82f0dae85424eb743017c90380e7ab9b-Abstract-Conference.html conf/nips/2023 db/conf/nips/neurips2023.html#AzarPT23 Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Near-Linear Time Approximations for Cut Problems via Fair Cuts. 240-275 2023 SODA https://doi.org/10.1137/1.9781611977554.ch10 conf/soda/2023 db/conf/soda/soda2023.html#0006NPS23 Ruoxu Cen William He Jason Li 0006 Debmalya Panigrahi Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. 2449-2488 2023 SODA https://doi.org/10.1137/1.9781611977554.ch95 conf/soda/2023 db/conf/soda/soda2023.html#CenH0P23 Marek Chrobak Samuel Haney Mehraneh Liaee Debmalya Panigrahi Rajmohan Rajaraman Ravi Sundaram Neal E. Young Online Paging with Heterogeneous Cache Slots. 23:1-23:24 2023 STACS https://doi.org/10.4230/LIPIcs.STACS.2023.23 conf/stacs/2023 db/conf/stacs/stacs2023.html#ChrobakHLPRSY23

Ruoxu Cen William He Jason Li 0006 Debmalya Panigrahi Beyond the Quadratic Time Barrier for Network Unreliability. 2023 abs/2304.06552 CoRR https://doi.org/10.48550/arXiv.2304.06552 db/journals/corr/corr2304.html#abs-2304-06552

Ilan Reuven Cohen Debmalya Panigrahi A General Framework for Learning-Augmented Online Allocation. 2023 abs/2305.18861 CoRR https://doi.org/10.48550/arXiv.2305.18861 db/journals/corr/corr2305.html#abs-2305-18861

Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. 2023 abs/2307.11913 CoRR https://doi.org/10.48550/arXiv.2307.11913 db/journals/corr/corr2307.html#abs-2307-11913

Jason Li 0006 Debmalya Panigrahi Laura Sanità Thatchaphol Saranurak Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). 76-89 2023 13 Dagstuhl Reports 10 https://doi.org/10.4230/DagRep.13.10.76 db/journals/dagstuhl-reports/dagstuhl-reports13.html#0006PSS23

Vincent Conitzer Christian Kroer Debmalya Panigrahi Okke Schrijvers Nicolás E. Stier Moses Eric Sodomka Christopher A. Wilkens Pacing Equilibrium in First Price Auction Markets. 8515-8535 2022 December 68 Manag. Sci. 12 https://doi.org/10.1287/mnsc.2022.4310 db/journals/mansci/mansci68.html#ConitzerKPSMSW22

Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Caching with Time Windows and Delays. 975-1017 2022 51 SIAM J. Comput. 4 https://doi.org/10.1137/20m1346286 db/journals/siamcomp/siamcomp51.html#GuptaKP22

Zhihao Jiang Debmalya Panigrahi Kevin Sun 0001 Online Algorithms for Weighted Paging with Predictions. 39:1-39:27 2022 18 ACM Trans. Algorithms 4 https://doi.org/10.1145/3548774 db/journals/talg/talg18.html#JiangPS22

Vincent Conitzer Debmalya Panigrahi Hanrui Zhang 0001 Learning Influence Adoption in Heterogeneous Networks. 6411-6419 2022 AAAI https://doi.org/10.1609/aaai.v36i6.20592 conf/aaai/2022 db/conf/aaai/aaai2022.html#ConitzerPZ22 Amir Abboud Robert Krauthgamer Jason Li 0006 Debmalya Panigrahi Thatchaphol Saranurak Ohad Trabelsi Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. 884-895 2022 conf/focs/2022 FOCS https://doi.org/10.1109/FOCS54457.2022.00088 db/conf/focs/focs2022.html#AbboudK0PST22 Sreenivas Gollapudi Kostas Kollias Debmalya Panigrahi The pit stop problem: how to plan your next road trip. 47:1-47:9 2022 SIGSPATIAL/GIS https://doi.org/10.1145/3557915.3560982 conf/gis/2022 db/conf/gis/gis2022.html#GollapudiKP22 Keerti Anand Rong Ge 0001 Amit Kumar 0001 Debmalya Panigrahi Online Algorithms with Multiple Predictions. 582-598 2022 ICML https://proceedings.mlr.press/v162/anand22a.html conf/icml/2022 db/conf/icml/icml2022.html#Anand0KP22 Anupam Gupta 0001 Debmalya Panigrahi Bernardo Subercaseaux Kevin Sun 0001 Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions. 2022 conf/nips/2022 NeurIPS http://papers.nips.cc/paper_files/paper/2022/hash/0ea048312aa812b2711fe765a9e9ef05-Abstract-Conference.html db/conf/nips/neurips2022.html#0001PS022 Max Springer MohammadTaghi Hajiaghayi Debmalya Panigrahi Mohammad Reza Khani Online Algorithms for the Santa Claus Problem. 2022 conf/nips/2022 NeurIPS http://papers.nips.cc/paper_files/paper/2022/hash/c681fb2bf1d785fbc766f3ea14758aab-Abstract-Conference.html db/conf/nips/neurips2022.html#SpringerHPK22 Xiao Hu 0005 Yuxi Liu 0015 Haibo Xiu Pankaj K. Agarwal Debmalya Panigrahi Sudeepa Roy 0001 Jun Yang 0001 Selectivity Functions of Range Queries are Learnable. 959-972 2022 SIGMOD Conference https://doi.org/10.1145/3514221.3517896 conf/sigmod/2022 db/conf/sigmod/sigmod2022.html#HuLXAPRY22 Yossi Azar Debmalya Panigrahi Noam Touitou Online Graph Algorithms with Predictions. 35-66 2022 SODA https://doi.org/10.1137/1.9781611977073.3 conf/soda/2022 db/conf/soda/soda2022.html#AzarPT22 Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Augmenting Edge Connectivity via Isolating Cuts. 3237-3252 2022 SODA https://doi.org/10.1137/1.9781611977073.127 conf/soda/2022 db/conf/soda/soda2022.html#CenLP22 Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Edge connectivity augmentation in near-linear time. 137-150 2022 STOC https://doi.org/10.1145/3519935.3520038 conf/stoc/2022 db/conf/stoc/stoc2022.html#CenLP22

Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. 2022 abs/2203.00751 CoRR https://doi.org/10.48550/arXiv.2203.00751 db/journals/corr/corr2203.html#abs-2203-00751

Keerti Anand Rong Ge 0001 Amit Kumar 0001 Debmalya Panigrahi Online Algorithms with Multiple Predictions. 2022 abs/2205.03921 CoRR https://doi.org/10.48550/arXiv.2205.03921 db/journals/corr/corr2205.html#abs-2205-03921

Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Edge Connectivity Augmentation in Near-Linear Time. 2022 abs/2205.04636 CoRR https://doi.org/10.48550/arXiv.2205.04636 db/journals/corr/corr2205.html#abs-2205-04636

Keerti Anand Rong Ge 0001 Debmalya Panigrahi Customizing ML Predictions for Online Algorithms. 2022 abs/2205.08715 CoRR https://doi.org/10.48550/arXiv.2205.08715 db/journals/corr/corr2205.html#abs-2205-08715

Keerti Anand Rong Ge 0001 Amit Kumar 0001 Debmalya Panigrahi A Regression Approach to Learning-Augmented Online Algorithms. 2022 abs/2205.08717 CoRR https://doi.org/10.48550/arXiv.2205.08717 db/journals/corr/corr2205.html#abs-2205-08717

Marek Chrobak Samuel Haney Mehraneh Liaee Debmalya Panigrahi Rajmohan Rajaraman Ravi Sundaram Neal E. Young Online Paging with Heterogeneous Cache Slots. 2022 abs/2206.05579 CoRR https://doi.org/10.48550/arXiv.2206.05579 db/journals/corr/corr2206.html#abs-2206-05579

MohammadTaghi Hajiaghayi Mohammad Reza Khani Debmalya Panigrahi Max Springer Online Algorithms for the Santa Claus Problem. 2022 abs/2210.07333 CoRR https://doi.org/10.48550/arXiv.2210.07333 db/journals/corr/corr2210.html#abs-2210-07333

Ruoxu Cen William He Jason Li 0006 Debmalya Panigrahi Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. 2022 abs/2211.05769 CoRR https://doi.org/10.48550/arXiv.2211.05769 db/journals/corr/corr2211.html#abs-2211-05769

Alexandr Andoni Keren Censor-Hillel Jing Chen Debmalya Panigrahi Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016). 2021 50 SIAM J. Comput. 3 https://doi.org/10.1137/21N974881 db/journals/siamcomp/siamcomp50.html#AndoniCCP21

Yossi Azar Arun Ganesh Rong Ge 0001 Debmalya Panigrahi Online Service with Delay. 23:1-23:31 2021 17 ACM Trans. Algorithms 3 https://doi.org/10.1145/3459925 db/journals/talg/talg17.html#AzarGGP21

Shuchi Chawla 0001 Joseph (Seffi) Naor Debmalya Panigrahi Mohit Singh Seeun William Umboh Timing Matters: Online Dynamics in Broadcast Games. 11:1-11:22 2021 9 ACM Trans. Economics and Comput. 2 https://doi.org/10.1145/3434425 db/journals/teco/teco9.html#ChawlaNPSU21

Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. 504-515 2021 FOCS https://doi.org/10.1109/FOCS52979.2021.00057 conf/focs/2021 db/conf/focs/focs2021.html#00010P21 Jason Li 0006 Debmalya Panigrahi Thatchaphol Saranurak A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. 1124-1134 2021 FOCS https://doi.org/10.1109/FOCS52979.2021.00111 conf/focs/2021 db/conf/focs/focs2021.html#0006PS21 Ruoxu Cen Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Kent Quanrud Minimum Cuts in Directed Graphs via Partial Sparsification. 1147-1158 2021 FOCS https://doi.org/10.1109/FOCS52979.2021.00113 conf/focs/2021 db/conf/focs/focs2021.html#Cen0NPSQ21 Ruoxu Cen Yu Cheng 0002 Debmalya Panigrahi Kevin Sun 0001 Sparsification of Directed Graphs via Cut Balance. 45:1-45:21 2021 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2021.45 conf/icalp/2021 db/conf/icalp/icalp2021.html#CenCP021 Arun Ganesh Bruce M. Maggs Debmalya Panigrahi Universal Algorithms for Clustering Problems. 70:1-70:20 2021 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2021.70 conf/icalp/2021 db/conf/icalp/icalp2021.html#GaneshMP21 Keerti Anand Rong Ge 0001 Amit Kumar 0001 Debmalya Panigrahi A Regression Approach to Learning-Augmented Online Algorithms. 30504-30517 2021 NeurIPS https://proceedings.neurips.cc/paper/2021/hash/ffeed84c7cb1ae7bf4ec4bd78275bb98-Abstract.html conf/nips/2021 db/conf/nips/neurips2021.html#AnandGKP21 Yuan Deng Debmalya Panigrahi Hanrui Zhang 0001 Online Combinatorial Auctions. 1131-1149 2021 SODA https://doi.org/10.1137/1.9781611976465.70 conf/soda/2021 db/conf/soda/soda2021.html#DengPZ21 Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Sorrachai Yingchareonthawornchai Vertex connectivity in poly-logarithmic max-flows. 317-329 2021 STOC https://doi.org/10.1145/3406325.3451088 conf/stoc/2021 db/conf/stoc/stoc2021.html#LiNPSY21 Jason Li 0006 Debmalya Panigrahi Approximate Gomory-Hu tree is faster than n - 1 max-flows. 1738-1748 2021 STOC https://doi.org/10.1145/3406325.3451112 conf/stoc/2021 db/conf/stoc/stoc2021.html#LiP21

Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Sorrachai Yingchareonthawornchai Vertex Connectivity in Poly-logarithmic Max-flows. 2021 abs/2104.00104 CoRR https://arxiv.org/abs/2104.00104 db/journals/corr/corr2104.html#abs-2104-00104

Ruoxu Cen Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Thatchaphol Saranurak Minimum Cuts in Directed Graphs via √n Max-Flows. 2021 abs/2104.07898 CoRR https://arxiv.org/abs/2104.07898 db/journals/corr/corr2104.html#abs-2104-07898

Arun Ganesh Bruce M. Maggs Debmalya Panigrahi Universal Algorithms for Clustering. 2021 abs/2105.02363 CoRR https://arxiv.org/abs/2105.02363 db/journals/corr/corr2105.html#abs-2105-02363

Jason Li 0006 Debmalya Panigrahi Thatchaphol Saranurak A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. 2021 abs/2106.02233 CoRR https://arxiv.org/abs/2106.02233 db/journals/corr/corr2106.html#abs-2106-02233

Jason Li 0006 Debmalya Panigrahi Deterministic Min-cut in Poly-logarithmic Max-flows. 2021 abs/2111.02008 CoRR https://arxiv.org/abs/2111.02008 db/journals/corr/corr2111.html#abs-2111-02008

Jason Li 0006 Debmalya Panigrahi Approximate Gomory-Hu Tree Is Faster Than n-1 Max-Flows. 2021 abs/2111.02022 CoRR https://arxiv.org/abs/2111.02022 db/journals/corr/corr2111.html#abs-2111-02022

Ruoxu Cen Jason Li 0006 Debmalya Panigrahi Augmenting Edge Connectivity via Isolating Cuts. 2021 abs/2111.02361 CoRR https://arxiv.org/abs/2111.02361 db/journals/corr/corr2111.html#abs-2111-02361

Amir Abboud Robert Krauthgamer Jason Li 0006 Debmalya Panigrahi Thatchaphol Saranurak Ohad Trabelsi Gomory-Hu Tree in Subcubic Time. 2021 abs/2111.04958 CoRR https://arxiv.org/abs/2111.04958 db/journals/corr/corr2111.html#abs-2111-04958

Ruoxu Cen Jason Li 0006 Danupon Nanongkai Debmalya Panigrahi Kent Quanrud Thatchaphol Saranurak Minimum Cuts in Directed Graphs via Partial Sparsification. 2021 abs/2111.08959 CoRR https://arxiv.org/abs/2111.08959 db/journals/corr/corr2111.html#abs-2111-08959

Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi A Hitting Set Relaxation for k-Server and an Extension to Time-Windows. 2021 abs/2111.09255 CoRR https://arxiv.org/abs/2111.09255 db/journals/corr/corr2111.html#abs-2111-09255

Yossi Azar Debmalya Panigrahi Noam Touitou Online Graph Algorithms with Predictions. 2021 abs/2112.11831 CoRR https://arxiv.org/abs/2112.11831 db/journals/corr/corr2112.html#abs-2112-11831

Xiao Hu 0005 Shouzhuo Sun Shweta Patwa Debmalya Panigrahi Sudeepa Roy 0001 Aggregated Deletion Propagation for Counting Conjunctive Query Answers. 228-240 2020 14 Proc. VLDB Endow. 2 http://www.vldb.org/pvldb/vol14/p228-hu.pdf https://doi.org/10.14778/3425879.3425892 db/journals/pvldb/pvldb14.html#HuSPPR20

Jason Li 0006 Debmalya Panigrahi Deterministic Min-cut in Poly-logarithmic Max-flows. 85-92 2020 FOCS https://doi.org/10.1109/FOCS46700.2020.00017 conf/focs/2020 db/conf/focs/focs2020.html#LiP20 Ilan Reuven Cohen Sungjin Im Debmalya Panigrahi Online Two-Dimensional Load Balancing. 34:1-34:21 2020 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2020.34 conf/icalp/2020 db/conf/icalp/icalp2020.html#CohenIP20 Arun Ganesh Bruce M. Maggs Debmalya Panigrahi Robust Algorithms for TSP and Steiner Tree. 54:1-54:18 2020 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2020.54 conf/icalp/2020 db/conf/icalp/icalp2020.html#GaneshMP20 Zhihao Jiang Debmalya Panigrahi Kevin Sun 0001 Online Algorithms for Weighted Paging with Predictions. 69:1-69:18 2020 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2020.69 conf/icalp/2020 db/conf/icalp/icalp2020.html#JiangP020 Keerti Anand Rong Ge 0001 Debmalya Panigrahi Customizing ML Predictions for Online Algorithms. 303-313 2020 ICML http://proceedings.mlr.press/v119/anand20a.html conf/icml/2020 db/conf/icml/icml2020.html#AnandGP20 Vincent Conitzer Debmalya Panigrahi Hanrui Zhang 0001 Learning Opinions in Social Networks. 2122-2132 2020 ICML http://proceedings.mlr.press/v119/conitzer20a.html conf/icml/2020 db/conf/icml/icml2020.html#ConitzerPZ20 Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Caching with time windows. 1125-1138 2020 STOC https://doi.org/10.1145/3357713.3384277 conf/stoc/2020 db/conf/stoc/stoc2020.html#Gupta0P20

Arun Ganesh Bruce M. Maggs Debmalya Panigrahi Robust Algorithms for TSP and Steiner Tree. 2020 abs/2005.08137 CoRR https://arxiv.org/abs/2005.08137 db/journals/corr/corr2005.html#abs-2005-08137

Ruoxu Cen Yu Cheng 0002 Debmalya Panigrahi Kevin Sun 0001 Sparsification of Directed Graphs via Cut Balance. 2020 abs/2006.01975 CoRR https://arxiv.org/abs/2006.01975 db/journals/corr/corr2006.html#abs-2006-01975

Zhihao Jiang Debmalya Panigrahi Kevin Sun 0001 Online Algorithms for Weighted Paging with Predictions. 2020 abs/2006.09509 CoRR https://arxiv.org/abs/2006.09509 db/journals/corr/corr2006.html#abs-2006-09509

Anupam Gupta 0001 Amit Kumar 0001 Debmalya Panigrahi Caching with Time Windows and Delays. 2020 abs/2006.09665 CoRR https://arxiv.org/abs/2006.09665 db/journals/corr/corr2006.html#abs-2006-09665

Xiao Hu 0005 Shouzhuo Sun Shweta Patwa Debmalya Panigrahi Sudeepa Roy 0001 Aggregated Deletion Propagation for Counting Conjunctive Query Answers. 2020 abs/2010.08694 CoRR https://arxiv.org/abs/2010.08694 db/journals/corr/corr2010.html#abs-2010-08694

Sungjin Im Nathaniel Kell Janardhan Kulkarni Debmalya Panigrahi Tight Bounds for Online Vector Scheduling. 93-121 2019 48 SIAM J. Comput. 1 https://doi.org/10.1137/17M111835X https://www.wikidata.org/entity/Q128593541 db/journals/siamcomp/siamcomp48.html#ImKKP19

Wai Shing Fung Ramesh Hariharan Nicholas J. A. Harvey Debmalya Panigrahi A General Framework for Graph Sparsification. 1196-1223 2019 48 SIAM J. Comput. 4 https://doi.org/10.1137/16M1091666 db/journals/siamcomp/siamcomp48.html#FungHHP19

Sreenivas Gollapudi Kostas Kollias Debmalya Panigrahi You Get What You Share: Incentives for a Sharing Economy. 2004-2011 2019 AAAI https://doi.org/10.1609/aaai.v33i01.33012004 conf/aaai/2019 db/conf/aaai/aaai2019.html#GollapudiKP19 Vincent Conitzer Christian Kroer Debmalya Panigrahi Okke Schrijvers Eric Sodomka Nicolás E. Stier Moses Chris Wilkens Pacing Equilibrium in First-Price Auction Markets. 587 2019 EC https://doi.org/10.1145/3328526.3329600 conf/sigecom/2019 db/conf/sigecom/sigecom2019.html#ConitzerKPSSMW19 Samuel Haney Mehraneh Liaee Bruce M. Maggs Debmalya Panigrahi Rajmohan Rajaraman Ravi Sundaram Retracting Graphs to Cycles. 70:1-70:15 2019 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2019.70 conf/icalp/2019 db/conf/icalp/icalp2019.html#HaneyLMPRS19 Sreenivas Gollapudi Debmalya Panigrahi Online Algorithms for Rent-Or-Buy with Expert Advice. 2319-2327 2019 ICML http://proceedings.mlr.press/v97/gollapudi19a.html conf/icml/2019 db/conf/icml/icml2019.html#GollapudiP19 Anupam Gupta 0001 Ravishankar Krishnaswamy Amit Kumar 0001 Debmalya Panigrahi Elastic Caching. 143-156 2019 SODA https://doi.org/10.1137/1.9781611975482.10 https://dl.acm.org/citation.cfm?id=3310445 conf/soda/2019 db/conf/soda/soda2019.html#GuptaK0P19 Yuan Deng Debmalya Panigrahi Multi-unit Supply-monotone Auctions with Bayesian Valuations. 173-192 2019 SODA https://doi.org/10.1137/1.9781611975482.12 https://dl.acm.org/citation.cfm?id=3310447 conf/soda/2019 db/conf/soda/soda2019.html#DengP19 Kyle Fox Debmalya Panigrahi Fred Zhang Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. 881-896 2019 SODA https://doi.org/10.1137/1.9781611975482.54 https://dl.acm.org/citation.cfm?id=3310489 conf/soda/2019 db/conf/soda/soda2019.html#FoxPZ19 Amir Abboud Raghavendra Addanki Fabrizio Grandoni 0001 Debmalya Panigrahi Barna Saha Dynamic set cover: improved algorithms and lower bounds. 114-125 2019 STOC https://doi.org/10.1145/3313276.3316376 conf/stoc/2019 db/conf/stoc/stoc2019.html#AbboudA0PS19

Pankaj K. Agarwal Kyle Fox Debmalya Panigrahi Kasturi R. Varadarajan Allen Xiao Faster Algorithms for the Geometric Transportation Problem. 2019 abs/1903.08263 CoRR http://arxiv.org/abs/1903.08263 db/journals/corr/corr1903.html#abs-1903-08263

Samuel Haney Mehraneh Liaee Bruce M. Maggs Debmalya Panigrahi Rajmohan Rajaraman Ravi Sundaram Retracting Graphs to Cycles. 2019 abs/1904.11946 CoRR http://arxiv.org/abs/1904.11946 db/journals/corr/corr1904.html#abs-1904-11946

Debmalya Panigrahi Shweta Patwa Sudeepa Roy 0001 Generalized Deletion Propagation on Counting Conjunctive Query Answers. 2019 abs/1907.10125 CoRR http://arxiv.org/abs/1907.10125 db/journals/corr/corr1907.html#abs-1907-10125

Deeparnab Chakrabarty Alina Ene Ravishankar Krishnaswamy Debmalya Panigrahi Online Buy-at-Bulk Network Design. 1505-1528 2018 47 SIAM J. Comput. 4 https://doi.org/10.1137/16M1117317 https://www.wikidata.org/entity/Q129456023 db/journals/siamcomp/siamcomp47.html#ChakrabartyEKP18

Yossi Azar Ilan Reuven Cohen Debmalya Panigrahi Randomized Algorithms for Online Vector Load Balancing. 980-991 2018 SODA https://doi.org/10.1137/1.9781611975031.63 conf/soda/2018 db/conf/soda/soda2018.html#AzarCP18 Sungjin Im Nathaniel Kell Debmalya Panigrahi Maryam Shadloo Online load balancing on related machines. 30-43 2018 STOC https://doi.org/10.1145/3188745.3188966 conf/stoc/2018 db/conf/stoc/stoc2018.html#ImKPS18 Shuchi Chawla 0001 Joseph (Seffi) Naor Debmalya Panigrahi Mohit Singh Seeun William Umboh Timing Matters: Online Dynamics in Broadcast Games. 80-95 2018 WINE https://doi.org/10.1007/978-3-030-04612-5_6 conf/wine/2018 db/conf/wine/wine2018.html#0001NPSU18 Abhimanyu Das Sreenivas Gollapudi Anthony Kim Debmalya Panigrahi Chaitanya Swamy Minimizing Latency in Online Ride and Delivery Services. 379-388 2018 WWW https://doi.org/10.1145/3178876.3186104 conf/www/2018 db/conf/www/www2018.html#DasGKPS18

Abhimanyu Das Sreenivas Gollapudi Anthony Kim Debmalya Panigrahi Chaitanya Swamy Minimizing Latency in Online Ride and Delivery Services. 2018 abs/1802.02744 CoRR http://arxiv.org/abs/1802.02744 db/journals/corr/corr1802.html#abs-1802-02744

Vincent Conitzer Christian Kroer Debmalya Panigrahi Okke Schrijvers Eric Sodomka Nicolás E. Stier Moses Chris Wilkens Pacing Equilibrium in First-Price Auction Markets. 2018 abs/1811.07166 CoRR http://arxiv.org/abs/1811.07166 db/journals/corr/corr1811.html#abs-1811-07166

MohammadTaghi Hajiaghayi Vahid Liaghat Debmalya Panigrahi Online Node-weighted Steiner Forest and Extensions via Disk Paintings. 911-935 2017 46 SIAM J. Comput. 3 https://doi.org/10.1137/14098692X db/journals/siamcomp/siamcomp46.html#HajiaghayiLP17

Alexandr Andoni Debmalya Panigrahi Marcin Pilipczuk Editorial. 18:1 2017 13 ACM Trans. Algorithms 2 https://doi.org/10.1145/3038922 db/journals/talg/talg13.html#AndoniPP17

Yuan Deng Debmalya Panigrahi Bo Waggoner The Complexity of Stable Matchings under Substitutable Preferences. 480-486 2017 AAAI https://doi.org/10.1609/aaai.v31i1.10595 conf/aaai/2017 db/conf/aaai/aaai2017.html#DengPW17 Samuel Haney Bruce M. Maggs Biswaroop Maiti Debmalya Panigrahi Rajmohan Rajaraman Ravi Sundaram Symmetric Interdiction for Matching Problems. 9:1-9:19 2017 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.9 conf/approx/2017 db/conf/approx/approx2017.html#HaneyMMPRS17 Sreenivas Gollapudi Ravi Kumar 0001 Debmalya Panigrahi Rina Panigrahy Partitioning Orders in Online Shopping Services. 1319-1328 2017 CIKM https://doi.org/10.1145/3132847.3132903 conf/cikm/2017 db/conf/cikm/cikm2017.html#Gollapudi0PP17 Pankaj K. Agarwal Kyle Fox Debmalya Panigrahi Kasturi R. Varadarajan Allen Xiao Faster Algorithms for the Geometric Transportation Problem. 7:1-7:16 2017 SoCG https://doi.org/10.4230/LIPIcs.SoCG.2017.7 conf/compgeom/2017 db/conf/compgeom/compgeom2017.html#AgarwalFPVX17 Sreenivas Gollapudi Kostas Kollias Debmalya Panigrahi Venetia Pliatsika Profit Sharing and Efficiency in Utility Games. 43:1-43:14 2017 ESA https://doi.org/10.4230/LIPIcs.ESA.2017.43 conf/esa/2017 db/conf/esa/esa2017.html#GollapudiKPP17 Mohsen Ghaffari 0001 David R. Karger Debmalya Panigrahi Random Contractions and Sampling for Hypergraph and Hedge Connectivity. 1101-1114 2017 SODA https://doi.org/10.1137/1.9781611974782.71 http://dl.acm.org/citation.cfm?id=3039757 conf/soda/2017 db/conf/soda/soda2017.html#GhaffariKP17 Anupam Gupta 0001 Ravishankar Krishnaswamy Amit Kumar 0001 Debmalya Panigrahi Online and dynamic algorithms for set cover. 537-550 2017 STOC https://doi.org/10.1145/3055399.3055493 conf/stoc/2017 db/conf/stoc/stoc2017.html#GuptaK0P17 Yossi Azar Arun Ganesh Rong Ge 0001 Debmalya Panigrahi Online service with delay. 551-563 2017 STOC https://doi.org/10.1145/3055399.3055475 conf/stoc/2017 db/conf/stoc/stoc2017.html#AzarGGP17

Yossi Azar Arun Ganesh Rong Ge 0001 Debmalya Panigrahi Online Service with Delay. 2017 abs/1708.05611 CoRR http://arxiv.org/abs/1708.05611 db/journals/corr/corr1708.html#abs-1708-05611

Sungjin Im Nathaniel Kell Debmalya Panigrahi Maryam Shadloo Online Load Balancing for Related Machines. 2017 abs/1709.10455 CoRR http://arxiv.org/abs/1709.10455 db/journals/corr/corr1709.html#abs-1709-10455

Niv Buchbinder Nikhil R. Devanur Debmalya Panigrahi Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). 2017 2017 NII Shonan Meet. Rep. https://shonan.nii.ac.jp/seminars/094/ db/journals/shonan-reports/shonan-reports2017.html#BuchbinderDP17

Yossi Azar Niv Buchbinder T.-H. Hubert Chan Shahar Chen Ilan Reuven Cohen Anupam Gupta 0001 Zhiyi Huang 0002 Ning Kang 0001 Viswanath Nagarajan Joseph Naor Debmalya Panigrahi Online Algorithms for Covering and Packing Problems with Convex Objectives. 148-157 2016 FOCS https://doi.org/10.1109/FOCS.2016.24 https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.24 conf/focs/2016 db/conf/focs/focs2016.html#AzarBCCCG0KNNP16 Nathaniel Kell Debmalya Panigrahi Online Budgeted Allocation with General Budgets. 419-436 2016 EC https://doi.org/10.1145/2940716.2940770 conf/sigecom/2016 db/conf/sigecom/sigecom2016.html#KellP16 Rupert Freeman Samuel Haney Debmalya Panigrahi On the Price of Stability of Undirected Multicast Games. 354-368 2016 WINE https://doi.org/10.1007/978-3-662-54110-4_25 conf/wine/2016 db/conf/wine/wine2016.html#FreemanHP16 Debmalya Panigrahi Gomory-Hu Trees. 858-861 2016 Encyclopedia of Algorithms https://doi.org/10.1007/978-1-4939-2864-4_168 db/reference/algo/algo2016.html#Panigrahi16 Debmalya Panigrahi Online Node-Weighted Problems. 1455-1457 2016 Encyclopedia of Algorithms https://doi.org/10.1007/978-1-4939-2864-4_761 db/reference/algo/algo2016.html#Panigrahi16a

Nathaniel Kell Debmalya Panigrahi Online Budgeted Allocation with General Budgets. 2016 abs/1603.07768 CoRR http://arxiv.org/abs/1603.07768 db/journals/corr/corr1603.html#KellP16

Rupert Freeman Samuel Haney Debmalya Panigrahi On the Price of Stability of Undirected Multicast Games. 2016 abs/1610.06515 CoRR http://arxiv.org/abs/1610.06515 db/journals/corr/corr1610.html#FreemanHP16

Anupam Gupta 0001 Ravishankar Krishnaswamy Amit Kumar 0001 Debmalya Panigrahi Online and Dynamic Algorithms for Set Cover. 2016 abs/1611.05646 CoRR http://arxiv.org/abs/1611.05646 db/journals/corr/corr1611.html#GuptaK0P16

Shuchi Chawla 0001 Joseph Naor Debmalya Panigrahi Mohit Singh Seeun William Umboh Timing Matters: Online Dynamics in Broadcast Games. 2016 abs/1611.07745 CoRR http://arxiv.org/abs/1611.07745 db/journals/corr/corr1611.html#ChawlaNPSU16

Sungjin Im Nathaniel Kell Janardhan Kulkarni Debmalya Panigrahi Tight Bounds for Online Vector Scheduling. 525-544 2015 FOCS https://doi.org/10.1109/FOCS.2015.39 https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.39 conf/focs/2015 db/conf/focs/focs2015.html#ImKKP15 Alina Ene Deeparnab Chakrabarty Ravishankar Krishnaswamy Debmalya Panigrahi Online Buy-at-Bulk Network Design. 545-562 2015 FOCS https://doi.org/10.1109/FOCS.2015.40 https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.40 conf/focs/2015 db/conf/focs/focs2015.html#EneCKP15 Yossi Azar Nikhil R. Devanur Zhiyi Huang 0002 Debmalya Panigrahi Speed Scaling in the Non-clairvoyant Model. 133-142 2015 SPAA https://doi.org/10.1145/2755573.2755582 conf/spaa/2015 db/conf/spaa/spaa2015.html#AzarD0P15

Deeparnab Chakrabarty Alina Ene Ravishankar Krishnaswamy Debmalya Panigrahi Online Buy-at-Bulk Network Design. 2015 abs/1509.03212 CoRR http://arxiv.org/abs/1509.03212 db/journals/corr/corr1509.html#ChakrabartyEKP15

Kshipra Bhawalkar Sreenivas Gollapudi Debmalya Panigrahi Online Set Cover with Set Requests. 64-79 2014 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.64 conf/approx/2014 db/conf/approx/approx2014.html#BhawalkarGP14 Sreenivas Gollapudi Debmalya Panigrahi Fair Allocation in Online Markets. 1179-1188 2014 CIKM https://doi.org/10.1145/2661829.2662011 conf/cikm/2014 db/conf/cikm/cikm2014.html#GollapudiP14 MohammadTaghi Hajiaghayi Vahid Liaghat Debmalya Panigrahi Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems. 576-587 2014 ICALP (1) https://doi.org/10.1007/978-3-662-43948-7_48 conf/icalp/2014-1 db/conf/icalp/icalp2014-1.html#HajiaghayiLP14 Konstantin Makarychev Debmalya Panigrahi Precedence-Constrained Scheduling of Malleable Jobs with Preemption. 823-834 2014 ICALP (1) https://doi.org/10.1007/978-3-662-43948-7_68 conf/icalp/2014-1 db/conf/icalp/icalp2014-1.html#MakarychevP14

Nikhil R. Devanur Konstantin Makarychev Debmalya Panigrahi Grigory Yaroslavtsev Online Algorithms for Machine Minimization. 2014 abs/1403.0486 CoRR http://arxiv.org/abs/1403.0486 db/journals/corr/corr1403.html#DevanurMPY14

Konstantin Makarychev Debmalya Panigrahi Precedence-constrained Scheduling of Malleable Jobs with Preemption. 2014 abs/1404.6850 CoRR http://arxiv.org/abs/1404.6850 db/journals/corr/corr1404.html#MakarychevP14

Sungjin Im Nathaniel Kell Janardhan Kulkarni Debmalya Panigrahi Tight Bounds for Online Vector Scheduling. 2014 abs/1411.3887 CoRR http://arxiv.org/abs/1411.3887 db/journals/corr/corr1411.html#ImKKP14

Yossi Azar Ilan Reuven Cohen Debmalya Panigrahi Online Covering with Convex Objectives and Applications. 2014 abs/1412.3507 CoRR http://arxiv.org/abs/1412.3507 db/journals/corr/corr1412.html#AzarCP14

Mohammad Taghi Hajiaghayi Vahid Liaghat Debmalya Panigrahi Online Node-Weighted Steiner Forest and Extensions via Disk Paintings. 558-567 2013 FOCS https://doi.org/10.1109/FOCS.2013.66 https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.66 conf/focs/2013 db/conf/focs/focs2013.html#HajiaghayiLP13 Yossi Azar Umang Bhaskar Lisa Fleischer Debmalya Panigrahi Online Mixed Packing and Covering. 85-100 2013 SODA https://doi.org/10.1137/1.9781611973105.6 conf/soda/2013 db/conf/soda/soda2013.html#AzarBFP13 Debmalya Panigrahi Sreenivas Gollapudi Document selection for tiered indexing in commerce search. 73-82 2013 WSDM https://doi.org/10.1145/2433396.2433408 conf/wsdm/2013 db/conf/wsdm/wsdm2013.html#PanigrahiG13 Debmalya Panigrahi Optimization problems in network connectivity. 2012 Massachusetts Institute of Technology, Cambridge, MA, USA https://hdl.handle.net/1721.1/78362 ndltd.org (oai:dspace.mit.edu:1721.1/78362) Aranyak Mehta Debmalya Panigrahi Online Matching with Stochastic Rewards. 728-737 2012 FOCS https://doi.org/10.1109/FOCS.2012.65 https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.65 conf/focs/2012 db/conf/focs/focs2012.html#MehtaP12 Debmalya Panigrahi Atish Das Sarma Gagan Aggarwal Andrew Tomkins Online selection of diverse results. 263-272 2012 WSDM https://doi.org/10.1145/2124295.2124329 conf/wsdm/2012 db/conf/wsdm/wsdm2012.html#PanigrahiSAT12

Yossi Azar Debmalya Panigrahi Online Load Balancing on Unrelated Machines with Startup Costs http://arxiv.org/abs/1203.4619 2012 CoRR abs/1203.4619 db/journals/corr/corr1203.html#abs-1203-4619

Yossi Azar Aleksander Madry Thomas Moscibroda Debmalya Panigrahi Aravind Srinivasan Maximum bipartite flow in networks with adaptive channel width. 2577-2587 2011 412 Theor. Comput. Sci. 24 https://doi.org/10.1016/j.tcs.2010.10.023 db/journals/tcs/tcs412.html#AzarMMPS11

Joseph Naor Debmalya Panigrahi Mohit Singh Online Node-Weighted Steiner Tree and Related Problems. 210-219 2011 FOCS https://doi.org/10.1109/FOCS.2011.65 https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.65 conf/focs/2011 db/conf/focs/focs2011.html#NaorPS11 Aleksander Madry Debmalya Panigrahi The Semi-stochastic Ski-rental Problem. 300-311 2011 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2011.300 conf/fsttcs/2011 db/conf/fsttcs/fsttcs2011.html#MadryP11 Susan B. Davidson Sanjeev Khanna Tova Milo Debmalya Panigrahi Sudeepa Roy 0001 Provenance views for module privacy. 175-186 2011 PODS https://doi.org/10.1145/1989284.1989305 conf/pods/2011 db/conf/pods/pods2011.html#DavidsonKMPR11 Debmalya Panigrahi Survivable Network Design Problems in Wireless Networks. 1014-1027 2011 SODA https://doi.org/10.1137/1.9781611973082.78 http://dl.acm.org/citation.cfm?id=2133114 conf/soda/2011 db/conf/soda/soda2011.html#Panigrahi11 Wai Shing Fung Ramesh Hariharan Nicholas J. A. Harvey Debmalya Panigrahi A general framework for graph sparsification. 71-80 2011 STOC https://doi.org/10.1145/1993636.1993647 conf/stoc/2011 db/conf/stoc/stoc2011.html#FungHHP11 Debmalya Panigrahi Sreenivas Gollapudi Result enrichment in commerce search using browse trails. 267-276 2011 WSDM https://doi.org/10.1145/1935826.1935874 conf/wsdm/2011 db/conf/wsdm/wsdm2011.html#PanigrahiG11 Partha Dutta Vivek Mhatre Debmalya Panigrahi Rajeev Rastogi Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas. 491-495 2010 INFOCOM https://doi.org/10.1109/INFCOM.2010.5462186 conf/infocom/2010 db/conf/infocom/infocom2010.html#DuttaMPR10 John R. Douceur James W. Mickens Thomas Moscibroda Debmalya Panigrahi Collaborative Measurements of Upload Speeds in P2P Systems. 1082-1090 2010 INFOCOM https://doi.org/10.1109/INFCOM.2010.5461938 conf/infocom/2010 db/conf/infocom/infocom2010.html#DouceurMMP10

Ramesh Hariharan Debmalya Panigrahi A General Framework for Graph Sparsification http://arxiv.org/abs/1004.4080 2010 CoRR abs/1004.4080 db/journals/corr/corr1004.html#abs-1004-4080

Ramesh Hariharan Debmalya Panigrahi A Linear-time Algorithm for Sparsification of Unweighted Graphs http://arxiv.org/abs/1005.0670 2010 CoRR abs/1005.0670 db/journals/corr/corr1005.html#abs-1005-0670

Susan B. Davidson Sanjeev Khanna Debmalya Panigrahi Sudeepa Roy 0001 Preserving Module Privacy in Workflow Provenance http://arxiv.org/abs/1005.5543 2010 CoRR abs/1005.5543 db/journals/corr/corr1005.html#abs-1005-5543

John R. Douceur James W. Mickens Thomas Moscibroda Debmalya Panigrahi ThunderDome: discovering upload constraints using decentralized bandwidth tournaments. 193-204 2009 CoNEXT https://doi.org/10.1145/1658939.1658962 conf/conext/2009 db/conf/conext/conext2009.html#DouceurMMP09 Yossi Azar Aleksander Madry Thomas Moscibroda Debmalya Panigrahi Aravind Srinivasan Maximum Bipartite Flow in Networks with Adaptive Channel Width. 351-362 2009 ICALP (2) https://doi.org/10.1007/978-3-642-02930-1_29 conf/icalp/2009-2 db/conf/icalp/icalp2009-2.html#AzarMMPS09 Debmalya Panigrahi Bhaskaran Raman TDMA Scheduling in Long-Distance WiFi Networks. 2931-2935 2009 INFOCOM https://doi.org/10.1109/INFCOM.2009.5062261 conf/infocom/2009 db/conf/infocom/infocom2009.html#PanigrahiR09 John R. Douceur James W. Mickens Thomas Moscibroda Debmalya Panigrahi Brief announcement: collaborative measurement of upload speeds in P2P systems. 338-339 2009 PODC https://doi.org/10.1145/1582716.1582798 conf/podc/2009 db/conf/podc/podc2009.html#DouceurMP09 David R. Karger Debmalya Panigrahi A near-linear time algorithm for constructing a cactus representation of minimum cuts. 246-255 2009 SODA https://doi.org/10.1137/1.9781611973068.28 http://dl.acm.org/citation.cfm?id=1496770.1496798 conf/soda/2009 db/conf/soda/soda2009.html#KargerP09 Debmalya Panigrahi Partha Dutta Sharad Jaiswal K. V. M. Naidu Rajeev Rastogi Minimum Cost Topology Construction for Rural Wireless Mesh Networks. 771-779 2008 INFOCOM https://doi.org/10.1109/INFOCOM.2008.128 conf/infocom/2008 db/conf/infocom/infocom2008.html#PanigrahiDJNR08 K. V. M. Naidu Debmalya Panigrahi Rajeev Rastogi Detecting Anomalies Using End-to-End Path Measurements. 1849-1857 2008 INFOCOM https://doi.org/10.1109/INFOCOM.2008.248 conf/infocom/2008 db/conf/infocom/infocom2008.html#NaiduPR08 Partha Dutta Sharad Jaiswal Debmalya Panigrahi Rajeev Rastogi A New Channel Assignment Mechanism for Rural Wireless Mesh Networks. 2261-2269 2008 INFOCOM https://doi.org/10.1109/INFOCOM.2008.294 conf/infocom/2008 db/conf/infocom/infocom2008.html#DuttaJPR08 Anand Bhalgat Ramesh Hariharan Telikepalli Kavitha Debmalya Panigrahi Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. 455-464 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347132 conf/soda/2008 db/conf/soda/soda2008.html#BhalgatHKP08 Debmalya Panigrahi Gomory-Hu Trees. 2008 Encyclopedia of Algorithms https://doi.org/10.1007/978-0-387-30162-4_168 reference/algo/2008 db/reference/algo/algo2008.html#Panigrahi08 Partha Dutta Sharad Jaiswal Debmalya Panigrahi K. V. M. Naidu Rajeev Rastogi Ajay Kumar Todimala VillageNet: A low-cost, 802.11-based mesh network for rural regions. 2007 conf/comsware/2007 COMSWARE https://doi.org/10.1109/COMSWA.2007.382461 http://eudl.eu/doi/10.1109/COMSWA.2007.382461 db/conf/comsware/comsware2007.html#DuttaJPNRT07 Ramesh Hariharan Telikepalli Kavitha Debmalya Panigrahi Efficient algorithms for computing all low s-t edge connectivities and related problems. 127-136 2007 conf/soda/2007 SODA http://dl.acm.org/citation.cfm?id=1283383.1283398 db/conf/soda/soda2007.html#HariharanKP07 Ramesh Hariharan Telikepalli Kavitha Debmalya Panigrahi Anand Bhalgat An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. 605-614 2007 conf/stoc/2007 STOC https://doi.org/10.1145/1250790.1250879 db/conf/stoc/stoc2007.html#HariharanKPB07 Amir Abboud Raghavendra Addanki Pankaj K. Agarwal Gagan Aggarwal Aditya Anand 0001 Keerti Anand Alexandr Andoni Yossi Azar Yannan Bai Anand Bhalgat Umang Bhaskar Sayan Bhattacharya Kshipra Bhawalkar Jan van den Brand Niv Buchbinder Ruoxu Cen Keren Censor-Hillel Deeparnab Chakrabarty T.-H. Hubert Chan Shuchi Chawla 0001 Jing Chen Shahar Chen Yu Cheng 0002 Marek Chrobak Ilan Reuven Cohen Vincent Cohen-Addad Vincent Conitzer Abhimanyu Das Susan B. Davidson Yuan Deng Nikhil R. Devanur Tommaso d'Orsi John R. Douceur Partha Dutta Alina Ene Yuval Filmus Lisa Fleischer Henry L. Fleischmann Kyle Fox Rupert Freeman Wai Shing Fung Arun Ganesh Rong Ge 0001 Mohsen Ghaffari 0001 Sreenivas Gollapudi Inge Li Gørtz Fabrizio Grandoni 0001 Anupam Gupta 0001 Guru Guruganesh Maximilian Probst Gutenberg Mohammad HajiaghayiMohammadTaghi HajiaghayiMohammad Taghi Hajiaghayi Samuel Haney Ramesh Hariharan Nicholas J. A. Harvey William He Anish Hebbar Xiao Hu 0005 Zhiyi Huang 0002 Sungjin Im Sharad Jaiswal Zhihao Jiang Ning Kang 0001 David R. Karger Telikepalli Kavitha Nathaniel Kell M. Reza KhaniMohammad Reza Khani Sanjeev Khanna Anthony Kim Kostas Kollias Robert Krauthgamer Ravishankar Krishnaswamy Christian Kroer Janardhan Kulkarni Amit Kumar 0001 Ravi Kumar 0001 Rasmus Kyng Euiwoong Lee Renato Paes Leme George Z. Li Jason Li 0006 Mehraneh Liaee Vahid Liaghat Yuxi Liu 0015 Aleksander Madry Bruce M. Maggs Biswaroop Maiti Konstantin Makarychev Aranyak Mehta Vivek P. MhatreVivek Mhatre James W. Mickens Tova Milo Thomas Moscibroda Nicolás E. Stier Moses Viswanath Nagarajan K. V. M. Naidu Danupon Nanongkai Joseph NaorJoseph (Seffi) Naor Chirag Pabbaraju Rina Panigrahy Shweta Patwa Sijin Peng Marcin Pilipczuk Madhusudhan Reddy Pittu Venetia Pliatsika Kent Quanrud Rajmohan Rajaraman Bhaskaran Raman Rajeev Rastogi Sudeepa Roy 0001 Barna Saha Laura Sanità Thatchaphol Saranurak Atish Das Sarma Jon Schneider Okke Schrijvers Maryam Shadloo Mohit Singh Eric Sodomka Max Springer Aravind Srinivasan Daniel Stefankovic Clifford Stein 0001 Miltiadis Stouras Bernardo Subercaseaux Kevin Sun 0001 Shouzhuo Sun Ravi Sundaram Ola Svensson Chaitanya Swamy Avishay Tal Ajay Kumar Todimala Andrew Tomkins Noam Touitou Ohad Trabelsi Seeun William Umboh Ali Vakilian Kasturi R. Varadarajan Or Vardi Bo Waggoner Zhaozi Wang Christopher A. WilkensChris Wilkens David P. Woodruff Allen Xiao Haibo Xiu Jun Yang 0001 Grigory Yaroslavtsev Sorrachai Yingchareonthawornchai Neal E. Young Weixuan Yuan Wuwei Yuan Fred Zhang Hanrui Zhang 0001 Ian Zhang 0003