E-LIB Suche - Ergebnisse für: Panigrahi, Debmalya

1

Hypergraph Unreliability in Quasi-Polynomial Time:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Cen, Ruoxu ; Li, Jason ; Panigrahi, Debmalya - p. 1700-1711 , 2024

Link: https://dl.acm.org/doi/1..

2

Robust Algorithms for TSP and Steiner Tree:

Ganesh, Arun ; Maggs, Bruce M. ; Panigrahi, Debmalya
ACM Transactions on Algorithms. 19 (2023) 2 - p. 1-37 , 2023

Link: https://doi.org/10.1145/..

3

Minimum Cut and Minimumk-Cut in Hypergraphs via Branching C..:

Fox, Kyle ; Panigrahi, Debmalya ; Zhang, Fred
ACM Transactions on Algorithms. 19 (2023) 2 - p. 1-22 , 2023

Link: https://doi.org/10.1145/..

4

Universal Algorithms for Clustering Problems:

Ganesh, Arun ; Maggs, Bruce M. ; Panigrahi, Debmalya
ACM Transactions on Algorithms. 19 (2023) 2 - p. 1-46 , 2023

Link: https://doi.org/10.1145/..

5

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: ..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Abboud, Amir ; Li, Jason ; Panigrahi, Debmalya. - p. 2204-2212 , 2023

Link: https://doi.org/10.1109/..

6

Selectivity Functions of Range Queries are Learnable:

, In: Proceedings of the 2022 International Conference on Management of Data,

Hu, Xiao ; Liu, Yuxi ; Xiu, Haibo... - p. 959-972 , 2022

Link: https://dl.acm.org/doi/1..

7

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-H..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Abboud, Amir ; Krauthgamer, Robert ; Li, Jason... - p. 884-895 , 2022

Link: https://doi.org/10.1109/..

8

A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Gra..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Li, Jason ; Panigrahi, Debmalya ; Saranurak, Thatchaphol - p. 1124-1134 , 2022

Link: https://doi.org/10.1109/..

9

Minimum Cuts in Directed Graphs via Partial Sparsification:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Cen, Ruoxu ; Li, Jason ; Nanongkai, Danupon... - p. 1147-1158 , 2022

Link: https://doi.org/10.1109/..

10

Caching with Time Windows and Delays:

Gupta, Anupam ; Kumar, Amit ; Panigrahi, Debmalya
SIAM Journal on Computing. 51 (2022) 4 - p. 975-1017 , 2022

Link: https://doi.org/10.1137/..

11

Online Algorithms for Weighted Paging with Predictions:

Jiang, Zhihao ; Panigrahi, Debmalya ; Sun, Kevin
ACM Transactions on Algorithms. 18 (2022) 4 - p. 1-27 , 2022

Link: https://doi.org/10.1145/..

12

Edge connectivity augmentation in near-linear time:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,

Cen, Ruoxu ; Li, Jason ; Panigrahi, Debmalya - p. 137-150 , 2022

Link: https://dl.acm.org/doi/1..

13

A Hitting Set Relaxation for $k$-Server and an Extension to..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Gupta, Anupam ; Kumar, Amit ; Panigrahi, Debmalya - p. 504-515 , 2022

Link: https://doi.org/10.1109/..

14

The pit stop problem : how to plan your next road trip:

, In: Proceedings of the 30th International Conference on Advances in Geographic Information Systems,

Gollapudi, Sreenivas ; Kollias, Kostas ; Panigrahi, Debmalya - p. 1-9 , 2022

Link: https://dl.acm.org/doi/1..

15

Timing Matters : Online Dynamics in Broadcast Games:

Chawla, Shuchi ; Naor, Joseph (Seffi) ; Panigrahi, Debmalya..
ACM Transactions on Economics and Computation (TEAC). 9 (2021) 2 - p. 1-22 , 2021

Link: https://dl.acm.org/doi/1..