default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDebmalya Panigrahi
Person information
- affiliation: Duke University, NC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]Jason Li, Debmalya Panigrahi
:
Approximate Gomory-Hu Tree is Faster than \(\boldsymbol{n}\,\boldsymbol{-\, 1}\) Maximum Flows. SIAM J. Comput. 53(4): 1162-1180 (2024)- [c91]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. SODA 2024: 1542-1567 - [c90]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Poly-logarithmic Competitiveness for the k-Taxi Problem. SODA 2024: 4220-4246 - [c89]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Hypergraph Unreliability in Quasi-Polynomial Time. STOC 2024: 1700-1711 - [i51]Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi:
Max-Cut with ε-Accurate Predictions. CoRR abs/2402.18263 (2024) - [i50]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Hypergraph Unreliability in Quasi-Polynomial Time. CoRR abs/2403.18781 (2024) - 2023
- [j16]Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Robust Algorithms for TSP and Steiner Tree. ACM Trans. Algorithms 19(2): 12:1-12:37 (2023) - [j15]Kyle Fox, Debmalya Panigrahi, Fred Zhang:
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. ACM Trans. Algorithms 19(2): 13:1-13:22 (2023) - [j14]Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Universal Algorithms for Clustering Problems. ACM Trans. Algorithms 19(2): 15:1-15:46 (2023) - [c88]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM 2023: 12:1-12:19 - [c87]Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. FOCS 2023: 2204-2212 - [c86]Ilan Reuven Cohen, Debmalya Panigrahi:
A General Framework for Learning-Augmented Online Allocation. ICALP 2023: 43:1-43:21 - [c85]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Discrete-Smoothness in Online Algorithms with Predictions. NeurIPS 2023 - [c84]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275 - [c83]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. SODA 2023: 2449-2488 - [c82]Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. STACS 2023: 23:1-23:24 - [i49]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. CoRR abs/2304.06552 (2023) - [i48]Ilan Reuven Cohen, Debmalya Panigrahi:
A General Framework for Learning-Augmented Online Allocation. CoRR abs/2305.18861 (2023) - [i47]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. CoRR abs/2307.11913 (2023) - [i46]Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak:
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). Dagstuhl Reports 13(10): 76-89 (2023) - 2022
- [j13]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. Manag. Sci. 68(12): 8515-8535 (2022) - [j12]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Caching with Time Windows and Delays. SIAM J. Comput. 51(4): 975-1017 (2022) - [j11]Zhihao Jiang, Debmalya Panigrahi, Kevin Sun:
Online Algorithms for Weighted Paging with Predictions. ACM Trans. Algorithms 18(4): 39:1-39:27 (2022) - [c81]Vincent Conitzer, Debmalya Panigrahi, Hanrui Zhang:
Learning Influence Adoption in Heterogeneous Networks. AAAI 2022: 6411-6419 - [c80]Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi:
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. FOCS 2022: 884-895 - [c79]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi:
The pit stop problem: how to plan your next road trip. SIGSPATIAL/GIS 2022: 47:1-47:9 - [c78]Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi:
Online Algorithms with Multiple Predictions. ICML 2022: 582-598 - [c77]Anupam Gupta, Debmalya Panigrahi, Bernardo Subercaseaux, Kevin Sun:
Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions. NeurIPS 2022 - [c76]Max Springer, MohammadTaghi Hajiaghayi, Debmalya Panigrahi, Mohammad Reza Khani:
Online Algorithms for the Santa Claus Problem. NeurIPS 2022 - [c75]Xiao Hu, Yuxi Liu, Haibo Xiu, Pankaj K. Agarwal, Debmalya Panigrahi, Sudeepa Roy, Jun Yang:
Selectivity Functions of Range Queries are Learnable. SIGMOD Conference 2022: 959-972 - [c74]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Online Graph Algorithms with Predictions. SODA 2022: 35-66 - [c73]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Augmenting Edge Connectivity via Isolating Cuts. SODA 2022: 3237-3252 - [c72]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Edge connectivity augmentation in near-linear time. STOC 2022: 137-150 - [i45]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. CoRR abs/2203.00751 (2022) - [i44]Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi:
Online Algorithms with Multiple Predictions. CoRR abs/2205.03921 (2022) - [i43]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Edge Connectivity Augmentation in Near-Linear Time. CoRR abs/2205.04636 (2022) - [i42]Keerti Anand, Rong Ge, Debmalya Panigrahi:
Customizing ML Predictions for Online Algorithms. CoRR abs/2205.08715 (2022) - [i41]Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi:
A Regression Approach to Learning-Augmented Online Algorithms. CoRR abs/2205.08717 (2022) - [i40]Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. CoRR abs/2206.05579 (2022) - [i39]MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Debmalya Panigrahi, Max Springer:
Online Algorithms for the Santa Claus Problem. CoRR abs/2210.07333 (2022) - [i38]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. CoRR abs/2211.05769 (2022) - 2021
- [j10]Alexandr Andoni, Keren Censor-Hillel, Jing Chen, Debmalya Panigrahi:
Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016). SIAM J. Comput. 50(3) (2021) - [j9]Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi:
Online Service with Delay. ACM Trans. Algorithms 17(3): 23:1-23:31 (2021) - [j8]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. ACM Trans. Economics and Comput. 9(2): 11:1-11:22 (2021) - [c71]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS 2021: 504-515 - [c70]Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. FOCS 2021: 1124-1134 - [c69]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud:
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS 2021: 1147-1158 - [c68]Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun:
Sparsification of Directed Graphs via Cut Balance. ICALP 2021: 45:1-45:21 - [c67]Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Universal Algorithms for Clustering Problems. ICALP 2021: 70:1-70:20 - [c66]Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi:
A Regression Approach to Learning-Augmented Online Algorithms. NeurIPS 2021: 30504-30517 - [c65]Yuan Deng, Debmalya Panigrahi, Hanrui Zhang:
Online Combinatorial Auctions. SODA 2021: 1131-1149 - [c64]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex connectivity in poly-logarithmic max-flows. STOC 2021: 317-329 - [c63]Jason Li, Debmalya Panigrahi:
Approximate Gomory-Hu tree is faster than n - 1 max-flows. STOC 2021: 1738-1748 - [i37]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex Connectivity in Poly-logarithmic Max-flows. CoRR abs/2104.00104 (2021) - [i36]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR abs/2104.07898 (2021) - [i35]Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Universal Algorithms for Clustering. CoRR abs/2105.02363 (2021) - [i34]Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. CoRR abs/2106.02233 (2021) - [i33]Jason Li, Debmalya Panigrahi:
Deterministic Min-cut in Poly-logarithmic Max-flows. CoRR abs/2111.02008 (2021) - [i32]Jason Li, Debmalya Panigrahi:
Approximate Gomory-Hu Tree Is Faster Than n-1 Max-Flows. CoRR abs/2111.02022 (2021) - [i31]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Augmenting Edge Connectivity via Isolating Cuts. CoRR abs/2111.02361 (2021) - [i30]Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi:
Gomory-Hu Tree in Subcubic Time. CoRR abs/2111.04958 (2021) - [i29]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR abs/2111.08959 (2021) - [i28]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
A Hitting Set Relaxation for k-Server and an Extension to Time-Windows. CoRR abs/2111.09255 (2021) - [i27]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Online Graph Algorithms with Predictions. CoRR abs/2112.11831 (2021) - 2020
- [j7]Xiao Hu, Shouzhuo Sun, Shweta Patwa, Debmalya Panigrahi, Sudeepa Roy:
Aggregated Deletion Propagation for Counting Conjunctive Query Answers. Proc. VLDB Endow. 14(2): 228-240 (2020) - [c62]Jason Li, Debmalya Panigrahi:
Deterministic Min-cut in Poly-logarithmic Max-flows. FOCS 2020: 85-92 - [c61]Ilan Reuven Cohen, Sungjin Im, Debmalya Panigrahi:
Online Two-Dimensional Load Balancing. ICALP 2020: 34:1-34:21 - [c60]Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Robust Algorithms for TSP and Steiner Tree. ICALP 2020: 54:1-54:18 - [c59]Zhihao Jiang, Debmalya Panigrahi, Kevin Sun:
Online Algorithms for Weighted Paging with Predictions. ICALP 2020: 69:1-69:18 - [c58]Keerti Anand, Rong Ge, Debmalya Panigrahi:
Customizing ML Predictions for Online Algorithms. ICML 2020: 303-313 - [c57]Vincent Conitzer, Debmalya Panigrahi, Hanrui Zhang:
Learning Opinions in Social Networks. ICML 2020: 2122-2132 - [c56]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Caching with time windows. STOC 2020: 1125-1138 - [i26]Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Robust Algorithms for TSP and Steiner Tree. CoRR abs/2005.08137 (2020) - [i25]Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun:
Sparsification of Directed Graphs via Cut Balance. CoRR abs/2006.01975 (2020) - [i24]Zhihao Jiang, Debmalya Panigrahi, Kevin Sun:
Online Algorithms for Weighted Paging with Predictions. CoRR abs/2006.09509 (2020) - [i23]Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Caching with Time Windows and Delays. CoRR abs/2006.09665 (2020) - [i22]Xiao Hu, Shouzhuo Sun, Shweta Patwa, Debmalya Panigrahi, Sudeepa Roy:
Aggregated Deletion Propagation for Counting Conjunctive Query Answers. CoRR abs/2010.08694 (2020)
2010 – 2019
- 2019
- [j6]Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi:
Tight Bounds for Online Vector Scheduling. SIAM J. Comput. 48(1): 93-121 (2019) - [j5]Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi:
A General Framework for Graph Sparsification. SIAM J. Comput. 48(4): 1196-1223 (2019) - [c55]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi:
You Get What You Share: Incentives for a Sharing Economy. AAAI 2019: 2004-2011 - [c54]Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Eric Sodomka, Nicolás E. Stier Moses, Chris Wilkens:
Pacing Equilibrium in First-Price Auction Markets. EC 2019: 587 - [c53]Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram:
Retracting Graphs to Cycles. ICALP 2019: 70:1-70:15 - [c52]Sreenivas Gollapudi, Debmalya Panigrahi:
Online Algorithms for Rent-Or-Buy with Expert Advice. ICML 2019: 2319-2327 - [c51]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi:
Elastic Caching. SODA 2019: 143-156 - [c50]Yuan Deng, Debmalya Panigrahi:
Multi-unit Supply-monotone Auctions with Bayesian Valuations. SODA 2019: 173-192 - [c49]Kyle Fox, Debmalya Panigrahi, Fred Zhang:
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. SODA 2019: 881-896 - [c48]Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni, Debmalya Panigrahi, Barna Saha:
Dynamic set cover: improved algorithms and lower bounds. STOC 2019: 114-125 - [i21]Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. CoRR abs/1903.08263 (2019) - [i20]Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram:
Retracting Graphs to Cycles. CoRR abs/1904.11946 (2019) - [i19]Debmalya Panigrahi, Shweta Patwa, Sudeepa Roy:
Generalized Deletion Propagation on Counting Conjunctive Query Answers. CoRR abs/1907.10125 (2019) - 2018
- [j4]Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. SIAM J. Comput. 47(4): 1505-1528 (2018) - [c47]Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Randomized Algorithms for Online Vector Load Balancing. SODA 2018: 980-991 - [c46]Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo:
Online load balancing on related machines. STOC 2018: 30-43 - [c45]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. WINE 2018: 80-95 - [c44]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy:
Minimizing Latency in Online Ride and Delivery Services. WWW 2018: 379-388 - [i18]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy:
Minimizing Latency in Online Ride and Delivery Services. CoRR abs/1802.02744 (2018) - [i17]Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Eric Sodomka, Nicolás E. Stier Moses, Chris Wilkens:
Pacing Equilibrium in First-Price Auction Markets. CoRR abs/1811.07166 (2018) - 2017
- [j3]MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Online Node-weighted Steiner Forest and Extensions via Disk Paintings. SIAM J. Comput. 46(3): 911-935 (2017) - [j2]Alexandr Andoni, Debmalya Panigrahi, Marcin Pilipczuk:
Editorial. ACM Trans. Algorithms 13(2): 18:1 (2017) - [c43]Yuan Deng, Debmalya Panigrahi, Bo Waggoner:
The Complexity of Stable Matchings under Substitutable Preferences. AAAI 2017: 480-486 - [c42]Samuel Haney, Bruce M. Maggs, Biswaroop Maiti, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram:
Symmetric Interdiction for Matching Problems. APPROX-RANDOM 2017: 9:1-9:19 - [c41]Sreenivas Gollapudi, Ravi Kumar, Debmalya Panigrahi, Rina Panigrahy:
Partitioning Orders in Online Shopping Services. CIKM 2017: 1319-1328 - [c40]Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. SoCG 2017: 7:1-7:16 - [c39]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika:
Profit Sharing and Efficiency in Utility Games. ESA 2017: 43:1-43:14 - [c38]Mohsen Ghaffari, David R. Karger, Debmalya Panigrahi:
Random Contractions and Sampling for Hypergraph and Hedge Connectivity. SODA 2017: 1101-1114 - [c37]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi:
Online and dynamic algorithms for set cover. STOC 2017: 537-550 - [c36]Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi:
Online service with delay. STOC 2017: 551-563 - [i16]Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi:
Online Service with Delay. CoRR abs/1708.05611 (2017) - [i15]Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo:
Online Load Balancing for Related Machines. CoRR abs/1709.10455 (2017) - [i14]Niv Buchbinder, Nikhil R. Devanur, Debmalya Panigrahi:
Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [c35]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:
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157 - [c34]Nathaniel Kell, Debmalya Panigrahi:
Online Budgeted Allocation with General Budgets. EC 2016: 419-436 - [c33]Rupert Freeman, Samuel Haney, Debmalya Panigrahi:
On the Price of Stability of Undirected Multicast Games. WINE 2016: 354-368 - [r3]Debmalya Panigrahi:
Gomory-Hu Trees. Encyclopedia of Algorithms 2016: 858-861 - [r2]Debmalya Panigrahi:
Online Node-Weighted Problems. Encyclopedia of Algorithms 2016: 1455-1457 - [i13]Nathaniel Kell, Debmalya Panigrahi:
Online Budgeted Allocation with General Budgets. CoRR abs/1603.07768 (2016) - [i12]Rupert Freeman, Samuel Haney, Debmalya Panigrahi:
On the Price of Stability of Undirected Multicast Games. CoRR abs/1610.06515 (2016) - [i11]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi:
Online and Dynamic Algorithms for Set Cover. CoRR abs/1611.05646 (2016) - [i10]Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. CoRR abs/1611.07745 (2016) - 2015
- [c32]Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi:
Tight Bounds for Online Vector Scheduling. FOCS 2015: 525-544 - [c31]Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. FOCS 2015: 545-562 - [c30]Yossi Azar, Nikhil R. Devanur, Zhiyi Huang, Debmalya Panigrahi:
Speed Scaling in the Non-clairvoyant Model. SPAA 2015: 133-142 - [i9]Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. CoRR abs/1509.03212 (2015) - 2014
- [c29]Kshipra Bhawalkar, Sreenivas Gollapudi, Debmalya Panigrahi:
Online Set Cover with Set Requests. APPROX-RANDOM 2014: 64-79 - [c28]Sreenivas Gollapudi, Debmalya Panigrahi:
Fair Allocation in Online Markets. CIKM 2014: 1179-1188 - [c27]MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems. ICALP (1) 2014: 576-587 - [c26]Konstantin Makarychev, Debmalya Panigrahi:
Precedence-Constrained Scheduling of Malleable Jobs with Preemption. ICALP (1) 2014: 823-834 - [i8]Nikhil R. Devanur, Konstantin Makarychev, Debmalya Panigrahi, Grigory Yaroslavtsev:
Online Algorithms for Machine Minimization. CoRR abs/1403.0486 (2014) - [i7]Konstantin Makarychev, Debmalya Panigrahi:
Precedence-constrained Scheduling of Malleable Jobs with Preemption. CoRR abs/1404.6850 (2014) - [i6]Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi:
Tight Bounds for Online Vector Scheduling. CoRR abs/1411.3887 (2014) - [i5]Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Online Covering with Convex Objectives and Applications. CoRR abs/1412.3507 (2014) - 2013
- [c25]Mohammad Taghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Online Node-Weighted Steiner Forest and Extensions via Disk Paintings. FOCS 2013: 558-567 - [c24]Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi:
Online Mixed Packing and Covering. SODA 2013: 85-100 - [c23]Debmalya Panigrahi, Sreenivas Gollapudi:
Document selection for tiered indexing in commerce search. WSDM 2013: 73-82 - 2012
- [b1]Debmalya Panigrahi:
Optimization problems in network connectivity. Massachusetts Institute of Technology, Cambridge, MA, USA, 2012 - [c22]Aranyak Mehta, Debmalya Panigrahi:
Online Matching with Stochastic Rewards. FOCS 2012: 728-737 - [c21]Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwal, Andrew Tomkins:
Online selection of diverse results. WSDM 2012: 263-272 - [i4]Yossi Azar, Debmalya Panigrahi:
Online Load Balancing on Unrelated Machines with Startup Costs. CoRR abs/1203.4619 (2012) - 2011
- [j1]Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan:
Maximum bipartite flow in networks with adaptive channel width. Theor. Comput. Sci. 412(24): 2577-2587 (2011) - [c20]Joseph Naor, Debmalya Panigrahi, Mohit Singh:
Online Node-Weighted Steiner Tree and Related Problems. FOCS 2011: 210-219 - [c19]Aleksander Madry, Debmalya Panigrahi:
The Semi-stochastic Ski-rental Problem. FSTTCS 2011: 300-311 - [c18]Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debmalya Panigrahi, Sudeepa Roy:
Provenance views for module privacy. PODS 2011: 175-186 - [c17]Debmalya Panigrahi:
Survivable Network Design Problems in Wireless Networks. SODA 2011: 1014-1027 - [c16]Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi:
A general framework for graph sparsification. STOC 2011: 71-80 - [c15]Debmalya Panigrahi, Sreenivas Gollapudi:
Result enrichment in commerce search using browse trails. WSDM 2011: 267-276 - 2010
- [c14]Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Rajeev Rastogi:
Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas. INFOCOM 2010: 491-495 - [c13]John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi:
Collaborative Measurements of Upload Speeds in P2P Systems. INFOCOM 2010: 1082-1090 - [i3]Ramesh Hariharan, Debmalya Panigrahi:
A General Framework for Graph Sparsification. CoRR abs/1004.4080 (2010) - [i2]Ramesh Hariharan, Debmalya Panigrahi:
A Linear-time Algorithm for Sparsification of Unweighted Graphs. CoRR abs/1005.0670 (2010) - [i1]Susan B. Davidson, Sanjeev Khanna, Debmalya Panigrahi, Sudeepa Roy:
Preserving Module Privacy in Workflow Provenance. CoRR abs/1005.5543 (2010)
2000 – 2009
- 2009
- [c12]John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi:
ThunderDome: discovering upload constraints using decentralized bandwidth tournaments. CoNEXT 2009: 193-204 - [c11]Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan:
Maximum Bipartite Flow in Networks with Adaptive Channel Width. ICALP (2) 2009: 351-362 - [c10]Debmalya Panigrahi, Bhaskaran Raman:
TDMA Scheduling in Long-Distance WiFi Networks. INFOCOM 2009: 2931-2935 - [c9]John R. Douceur, James W. Mickens, Thomas Moscibroda, Debmalya Panigrahi:
Brief announcement: collaborative measurement of upload speeds in P2P systems. PODC 2009: 338-339 - [c8]David R. Karger, Debmalya Panigrahi:
A near-linear time algorithm for constructing a cactus representation of minimum cuts. SODA 2009: 246-255 - 2008
- [c7]Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, K. V. M. Naidu, Rajeev Rastogi:
Minimum Cost Topology Construction for Rural Wireless Mesh Networks. INFOCOM 2008: 771-779 - [c6]K. V. M. Naidu, Debmalya Panigrahi, Rajeev Rastogi:
Detecting Anomalies Using End-to-End Path Measurements. INFOCOM 2008: 1849-1857 - [c5]Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi:
A New Channel Assignment Mechanism for Rural Wireless Mesh Networks. INFOCOM 2008: 2261-2269 - [c4]Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464 - [r1]Debmalya Panigrahi:
Gomory-Hu Trees. Encyclopedia of Algorithms 2008 - 2007
- [c3]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. COMSWARE 2007 - [c2]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Efficient algorithms for computing all low s-t edge connectivities and related problems. SODA 2007: 127-136 - [c1]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat:
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
