![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Debmalya Panigrahi
Duke University, NC, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 162 matches
- 2024
- Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. SODA 2024: 1542-1567 - Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Poly-logarithmic Competitiveness for the k-Taxi Problem. SODA 2024: 4220-4246 - Ruoxu Cen
, Jason Li
, Debmalya Panigrahi
:
Hypergraph Unreliability in Quasi-Polynomial Time. STOC 2024: 1700-1711 - Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi:
Max-Cut with ε-Accurate Predictions. CoRR abs/2402.18263 (2024) - Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Hypergraph Unreliability in Quasi-Polynomial Time. CoRR abs/2403.18781 (2024) - 2023
- 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) - Arun Ganesh
, Bruce M. Maggs
, Debmalya Panigrahi
:
Robust Algorithms for TSP and Steiner Tree. ACM Trans. Algorithms 19(2): 12:1-12:37 (2023) - Arun Ganesh
, Bruce M. Maggs
, Debmalya Panigrahi
:
Universal Algorithms for Clustering Problems. ACM Trans. Algorithms 19(2): 15:1-15:46 (2023) - Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM 2023: 12:1-12:19 - 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 - Ilan Reuven Cohen, Debmalya Panigrahi:
A General Framework for Learning-Augmented Online Allocation. ICALP 2023: 43:1-43:21 - Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Discrete-Smoothness in Online Algorithms with Predictions. NeurIPS 2023 - Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275 - Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. SODA 2023: 2449-2488 - 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 - Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. CoRR abs/2304.06552 (2023) - Ilan Reuven Cohen, Debmalya Panigrahi:
A General Framework for Learning-Augmented Online Allocation. CoRR abs/2305.18861 (2023) - Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. CoRR abs/2307.11913 (2023) - 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
- 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) - Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Caching with Time Windows and Delays. SIAM J. Comput. 51(4): 975-1017 (2022) - Zhihao Jiang
, Debmalya Panigrahi
, Kevin Sun
:
Online Algorithms for Weighted Paging with Predictions. ACM Trans. Algorithms 18(4): 39:1-39:27 (2022) - Vincent Conitzer, Debmalya Panigrahi, Hanrui Zhang:
Learning Influence Adoption in Heterogeneous Networks. AAAI 2022: 6411-6419 - 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 - Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi:
The pit stop problem: how to plan your next road trip. SIGSPATIAL/GIS 2022: 47:1-47:9 - Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi:
Online Algorithms with Multiple Predictions. ICML 2022: 582-598 - Anupam Gupta, Debmalya Panigrahi, Bernardo Subercaseaux, Kevin Sun:
Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions. NeurIPS 2022 - Max Springer, MohammadTaghi Hajiaghayi, Debmalya Panigrahi, Mohammad Reza Khani:
Online Algorithms for the Santa Claus Problem. NeurIPS 2022 - 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 - Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Online Graph Algorithms with Predictions. SODA 2022: 35-66
skipping 132 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 05:39 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint