Debmalya Panigrahi

From MaRDI portal
Person:541659

Available identifiers

zbMath Open panigrahi.debmalyaMaRDI QIDQ541659

List of research outcomes





PublicationDate of PublicationType
Online paging with heterogeneous cache slots2025-01-24Paper
Efficient algorithms and hardness results for the weighted \(k\)-server problem2025-01-14Paper
Beyond the quadratic time barrier for network unreliability2024-11-28Paper
Poly-logarithmic competitiveness for the \(k\)-taxi problem2024-11-28Paper
A general framework for learning-augmented online allocation2024-11-14Paper
Online paging with heterogeneous cache slots2024-10-08Paper
Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows2024-08-27Paper
Online graph algorithms with predictions2024-07-19Paper
Augmenting edge connectivity via isolating cuts2024-07-19Paper
Near-linear time approximations for cut problems via fair cuts2024-05-14Paper
Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61473222024-01-15Paper
Edge connectivity augmentation in near-linear time2023-12-08Paper
Vertex connectivity in poly-logarithmic max-flows2023-11-14Paper
Approximate Gomory–Hu tree is faster than n – 1 max-flows2023-11-14Paper
Online Algorithms for Weighted Paging with Predictions2023-10-31Paper
Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions2023-10-23Paper
Robust Algorithms for TSP and Steiner Tree2023-10-23Paper
Universal Algorithms for Clustering Problems2023-10-23Paper
Caching with Time Windows and Delays2022-07-22Paper
Retracting Graphs to Cycles2022-07-21Paper
Online Service with Delay2022-02-16Paper
https://portal.mardi4nfdi.de/entity/Q50026122021-07-28Paper
Caching with time windows2021-01-19Paper
Timing matters: online dynamics in broadcast games2020-06-18Paper
https://portal.mardi4nfdi.de/entity/Q51117322020-05-27Paper
Dynamic set cover: improved algorithms and lower bounds2020-01-30Paper
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions2019-10-15Paper
Elastic Caching2019-10-15Paper
Multi-unit Supply-monotone Auctions with Bayesian Valuations2019-10-15Paper
A General Framework for Graph Sparsification2019-09-02Paper
Online load balancing on related machines2019-08-22Paper
Online Mixed Packing and Covering2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46338322019-05-06Paper
Tight Bounds for Online Vector Scheduling2019-02-08Paper
https://portal.mardi4nfdi.de/entity/Q45800792018-08-13Paper
Online Buy-at-Bulk Network Design2018-08-03Paper
Random Contractions and Sampling for Hypergraph and Hedge Connectivity2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46079462018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q53650972017-09-29Paper
Online and dynamic algorithms for set cover2017-08-17Paper
Online service with delay2017-08-17Paper
Online Node-weighted Steiner Forest and Extensions via Disk Paintings2017-05-30Paper
https://portal.mardi4nfdi.de/entity/Q29696092017-03-22Paper
On the Price of Stability of Undirected Multicast Games2017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q29345902014-12-18Paper
Online Node-Weighted Steiner Tree and Related Problems2014-07-30Paper
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems2014-07-01Paper
Precedence-Constrained Scheduling of Malleable Jobs with Preemption2014-07-01Paper
A general framework for graph sparsification2014-06-05Paper
The semi-stochastic ski-rental problem2012-08-31Paper
Maximum bipartite flow in networks with adaptive channel width2011-06-07Paper
https://portal.mardi4nfdi.de/entity/Q35794862010-08-06Paper
Maximum Bipartite Flow in Networks with Adaptive Channel Width2009-07-14Paper
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs2009-01-05Paper

Research outcomes over time

This page was built for person: Debmalya Panigrahi