# Debmalya Panigrahi

According to our database

Collaborative distances:

^{1}, Debmalya Panigrahi authored at least 61 papers between 2007 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Dynamic set cover: improved algorithms and lower bounds.

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Elastic Caching.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Multi-unit Supply-monotone Auctions with Bayesian Valuations.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Online Algorithms for Rent-Or-Buy with Expert Advice.

Proceedings of the 36th International Conference on Machine Learning, 2019

Retracting Graphs to Cycles.

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Pacing Equilibrium in First-Price Auction Markets.

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Online Buy-at-Bulk Network Design.

SIAM J. Comput., 2018

Minimizing Latency in Online Ride and Delivery Services.

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Timing Matters: Online Dynamics in Broadcast Games.

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Online load balancing on related machines.

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Randomized Algorithms for Online Vector Load Balancing.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Editorial.

ACM Trans. Algorithms, 2017

Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5).

NII Shonan Meet. Rep., 2017

Online and dynamic algorithms for set cover.

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Online service with delay.

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Random Contractions and Sampling for Hypergraph and Hedge Connectivity.

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Profit Sharing and Efficiency in Utility Games.

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Faster Algorithms for the Geometric Transportation Problem.

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Partitioning Orders in Online Shopping Services.

Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

Symmetric Interdiction for Matching Problems.

Proceedings of the Approximation, 2017

The Complexity of Stable Matchings under Substitutable Preferences.

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Online Node-Weighted Problems.

Encyclopedia of Algorithms, 2016

Gomory-Hu Trees.

Encyclopedia of Algorithms, 2016

On the Price of Stability of Undirected Multicast Games.

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Online Budgeted Allocation with General Budgets.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Speed Scaling in the Non-clairvoyant Model.

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Tight Bounds for Online Vector Scheduling.

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Online Buy-at-Bulk Network Design.

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Precedence-Constrained Scheduling of Malleable Jobs with Preemption.

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems.

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Fair Allocation in Online Markets.

Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Online Set Cover with Set Requests.

Proceedings of the Approximation, 2014

2013

Document selection for tiered indexing in commerce search.

Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Online Mixed Packing and Covering.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Online Node-Weighted Steiner Forest and Extensions via Disk Paintings.

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Optimization problems in network connectivity.

PhD thesis, 2012

Online selection of diverse results.

Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Online Matching with Stochastic Rewards.

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Result enrichment in commerce search using browse trails.

Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

A general framework for graph sparsification.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Survivable Network Design Problems in Wireless Networks.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Provenance views for module privacy.

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

The Semi-stochastic Ski-rental Problem.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Online Node-Weighted Steiner Tree and Related Problems.

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas.

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Collaborative Measurements of Upload Speeds in P2P Systems.

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

A near-linear time algorithm for constructing a cactus representation of minimum cuts.

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Brief announcement: collaborative measurement of upload speeds in P2P systems.

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

TDMA Scheduling in Long-Distance WiFi Networks.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Maximum Bipartite Flow in Networks with Adaptive Channel Width.

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

ThunderDome: discovering upload constraints using decentralized bandwidth tournaments.

Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technology, 2009

2008

Gomory-Hu Trees.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Minimum Cost Topology Construction for Rural Wireless Mesh Networks.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Detecting Anomalies Using End-to-End Path Measurements.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

A New Channel Assignment Mechanism for Rural Wireless Mesh Networks.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Efficient algorithms for computing all low

*s-t*edge connectivities and related problems.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

VillageNet: A low-cost, 802.11-based mesh network for rural regions.

Proceedings of the Second International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2007), 2007