The following pages link to Monika R. Henzinger (Q1370851):
Displaying 50 items.
- (Q5091161) (← links)
- Improved Set-Based Symbolic Algorithms for Parity Games (Q5111185) (← links)
- (Q5111253) (← links)
- (Q5111733) (← links)
- (Q5111734) (← links)
- (Q5111737) (← links)
- The State of the Art in Dynamic Graph Algorithms (Q5127173) (← links)
- Memetic Graph Clustering (Q5140709) (← links)
- Shared-Memory Branch-and-Reduce for Multiterminal Cuts (Q5147492) (← links)
- Fully Dynamic Single-Source Reachability in Practice: An Experimental Study (Q5147502) (← links)
- Fully Dynamic <i>k</i>-Center Clustering in Low Dimensional Metrics (Q5147535) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- Local Flow Partitioning for Faster Edge Connectivity (Q5210551) (← links)
- Distributed edge connectivity in sublinear time (Q5212776) (← links)
- Quasipolynomial Set-Based Symbolic Algorithms for Parity Games (Q5222958) (← links)
- Practical Minimum Cut Algorithms (Q5232722) (← links)
- A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching (Q5236301) (← links)
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (Q5259603) (← links)
- New deterministic approximation algorithms for fully dynamic matching (Q5361847) (← links)
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths (Q5361854) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q5362993) (← links)
- (Q5365120) (← links)
- (Q5367065) (← links)
- A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths (Q5384041) (← links)
- Automata, Languages and Programming (Q5466462) (← links)
- (Q5743484) (← links)
- (Q5874328) (← links)
- (Q5874528) (← links)
- (Q5874530) (← links)
- (Q5875368) (← links)
- Faster shortest-path algorithms for planar graphs (Q5890838) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- (Q6060002) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
- (Q6075931) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs (Q6102299) (← links)
- Faster Parallel Multiterminal Cuts (Q6339357) (← links)
- Faster fully dynamic transitive closure in practice (Q6487607) (← links)
- Fully dynamic exact edge connectivity in sublinear time (Q6538528) (← links)
- Online min-max paging (Q6538588) (← links)
- Optimal fully dynamic \(k\)-center clustering for adaptive and oblivious adversaries (Q6538631) (← links)
- Almost tight error bounds on differentially private continual counting (Q6538713) (← links)
- Practical fully dynamic minimum cut algorithms (Q6543122) (← links)
- Experimental evaluation of fully dynamic \(k\)-means via coresets (Q6545403) (← links)
- The complexity of average-case dynamic subgraph counting (Q6575095) (← links)
- Modern dynamic data structures (invited talk) (Q6583992) (← links)
- Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks (Q6610313) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6610339) (← links)
- Dynamic maintenance of monotone dynamic programs and applications (Q6615144) (← links)
