I agree that this site is using cookies. You can find further informations here.
X
Henzinger, Monika
360  results:
Search for persons X
?
1

Multiplicative auction algorithm for approximate maximum we..:

Zheng, Da Wei ; Henzinger, Monika
Mathematical Programming.  , 2024
Link: https://doi.org/10.1007/..
 
?
2

Dynamic Demand-Aware Link Scheduling for Reconfigurable Dat..:

, In: IEEE INFOCOM 2023 - IEEE Conference on Computer Communications,
Hanauer, Kathrin ; Henzinger, Monika ; Ost, Lara. - p. 1-10 , 2023
Link: https://doi.org/10.1109/..
 
?
3

Multiplicative Auction Algorithm for Approximate Maximum We..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Zheng, Da Wei ; Henzinger, Monika - p. 453-465 , 2023
Link: https://doi.org/10.1007/..
 
?
4

A Combinatorial Cut-Toggling Algorithm for Solving Laplacia..:

Henzinger, Monika ; Jin, Billy ; Peng, Richard.
Algorithmica.  85 (2023)  12 - p. 3680-3716 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Deterministic Near-Optimal Approximation Algorithms for Dyn..:

Bhattacharya, Sayan ; Henzinger, Monika ; Nanongkai, Danupon.
SIAM Journal on Computing.  52 (2023)  5 - p. 1132-1192 , 2023
Link: https://doi.org/10.1137/..
 
?
6

The augmentation-speed tradeoff for consistent network upda..:

, In: Proceedings of the Symposium on SDN Research,
Henzinger, Monika ; Paz, Ami ; Pourdamghani, Arash. - p. 67-80 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

Brief Announcement: Broadcasting Time in Dynamic Rooted Tre..:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
El-Hayek, Antoine ; Henzinger, Monika ; Schmid, Stefan - p. 54-56 , 2022
Link: https://dl.acm.org/doi/1..
 
?
8

Recent Advances in Fully Dynamic Graph Algorithms – A Quick..:

Hanauer, Kathrin ; Henzinger, Monika ; Schulz, Christian
ACM Journal of Experimental Algorithmics.  27 (2022)  - p. 1-45 , 2022
Link: https://doi.org/10.1145/..
 
?
9

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware..:

, In: IEEE INFOCOM 2022 - IEEE Conference on Computer Communications,
Hanauer, Kathrin ; Henzinger, Monika ; Schmid, Stefan. - p. 1649-1658 , 2022
Link: https://doi.org/10.1109/..
 
?
10

Constant-time Dynamic (Δ +1)-Coloring:

Henzinger, Monika ; Peng, Pan
ACM Transactions on Algorithms.  18 (2022)  2 - p. 1-21 , 2022
Link: https://doi.org/10.1145/..
 
?
11

Fine-Grained Complexity Lower Bounds for Problems in Comput..:

, In: Lecture Notes in Computer Science; Principles of Systems Design,
Henzinger, Monika - p. 292-305 , 2022
Link: https://doi.org/10.1007/..
 
?
12

Symbolic time and space tradeoffs for probabilistic verific..:

, In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
Chatterjee, Krishnendu ; Dvořák, Wolfgang ; Henzinger, Monika. - p. 1-13 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

A Deamortization Approach for Dynamic Spanner and Dynamic M..:

Bernstein, Aaron ; Forster, Sebastian ; Henzinger, Monika
ACM Transactions on Algorithms.  17 (2021)  4 - p. 1-51 , 2021
Link: https://doi.org/10.1145/..
 
?
14

Tight Bounds for Online Graph Partitioning:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Henzinger, Monika ; Neumann, Stefan ; Räcke, Harald. - p. 2799-2818 , 2021
Link: https://doi.org/10.1137/..
 
?
15

Dynamic maintenance of low-stretch probabilistic tree embed..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Forster, Sebastian ; Goranci, Gramoz ; Henzinger, Monika - p. 1226-1245 , 2021
Link: https://dl.acm.org/doi/1..
 
1-15