The following pages link to Monika R. Henzinger (Q1370851):
Displaying 50 items.
- Online Stochastic Packing Applied to Display Ad Allocation (Q3586461) (← links)
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time (Q4027854) (← links)
- (Q4230326) (← links)
- (Q4234100) (← links)
- (Q4250170) (← links)
- (Q4252318) (← links)
- (Q4252730) (← links)
- (Q4252752) (← links)
- A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity (Q4349705) (← links)
- Sampling to provide or to bound: With applications to fully dynamic graph algorithms (Q4372787) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q4458883) (← links)
- Improved Data Structures for Fully Dynamic Biconnectivity (Q4507325) (← links)
- (Q4527009) (← links)
- (Q4552037) (← links)
- Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time (Q4554344) (← links)
- Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks (Q4554941) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
- Maintaining minimum spanning trees in dynamic graphs (Q4571989) (← links)
- Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time (Q4575767) (← links)
- Local Flow Partitioning for Faster Edge Connectivity (Q4575872) (← links)
- Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds (Q4598273) (← links)
- (Q4606317) (← links)
- (Q4606319) (← links)
- (Q4607872) (← links)
- (Q4608046) (← links)
- Conditionally Optimal Algorithms for Generalized B\"uchi Games (Q4608584) (← links)
- Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time (Q4625657) (← links)
- Practical Minimum Cut Algorithms (Q4629534) (← links)
- Improved Algorithms for One-Pair and k-Pair Streett Objectives (Q4635810) (← links)
- Model and Objective Separation with Conditional Lower Bounds (Q4635875) (← links)
- (Q4638076) (← links)
- (Q4643877) (← links)
- Approximating minimum cuts under insertions (Q4645185) (← links)
- Algorithmic Challenges in Web Search Engines (Q4673816) (← links)
- An online throughput-competitive algorithm for multicast routing and admission control (Q4675485) (← links)
- (Q4818842) (← links)
- (Q4875203) (← links)
- (Q4886061) (← links)
- Computing Vertex Connectivity: New Bounds from Old Techniques (Q4943077) (← links)
- Exploring Unknown Environments (Q4943862) (← links)
- (Q4945538) (← links)
- (Q4992512) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- (Q5009599) (← links)
- (Q5009600) (← links)
- A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching (Q5035873) (← links)
- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning (Q5054804) (← links)
- Fully dynamic 2-edge-connectivity in planar graphs (Q5056144) (← links)
- An algorithm for finding predecessors in integer sets (Q5060139) (← links)
- (Q5091161) (← links)
