The following pages link to Monika R. Henzinger (Q1370851):
Displaying 50 items.
- (Q487009) (redirect page) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Maximizing a submodular function with viability constraints (Q513299) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- (Q1273939) (redirect page) (← links)
- Lower bounds for fully dynamic connectivity problems in graphs (Q1273940) (← links)
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology (Q1293865) (← links)
- (Q1331952) (redirect page) (← links)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- Average-case analysis of dynamic graph algorithms (Q1386353) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- Welfare maximization with friends-of-friends network externalities (Q1693985) (← links)
- On the number of small cut in a graph (Q1847367) (← links)
- Fully dynamic biconnectivity in graphs (Q1892579) (← links)
- Sponsored search, market equilibria, and the Hungarian method (Q1943611) (← links)
- Offline file assignments for online load balancing (Q1944067) (← links)
- Bidder optimal assignments for general utilities (Q1951556) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (Q2248060) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- Truthful unit-demand auctions with budgets revisited (Q2257295) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time (Q2401147) (← links)
- New amortized cell-probe lower bounds for dynamic problems (Q2420582) (← links)
- (Q2753917) (← links)
- Maintaining Minimum Spanning Forests in Dynamic Graphs (Q2784458) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Improved data structures for fully dynamic biconnectivity (Q2817663) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q2819545) (← links)
- (Q2934695) (← links)
- Limiting Price Discrimination when Selling Products with Positive Network Externalities (Q2936975) (← links)
- Valuation Compressions in VCG-Based Combinatorial Auctions (Q2937754) (← links)
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (Q2941485) (← links)
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505) (← links)
- Welfare Maximization with Friends-of-Friends Network Externalities (Q2954986) (← links)
- Multi-parameter Mechanism Design under Budget and Matroid Constraints (Q3092228) (← links)
- Sponsored Search, Market Equilibria, and the Hungarian Method (Q3113757) (← links)
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation (Q3158547) (← links)
- On Multiple Keyword Sponsored Search Auctions with Budgets (Q3166992) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830) (← links)
- Online Ad Assignment with an Ad Exchange (Q3453291) (← links)
- Ad Exchange: Envy-Free Auctions with Mediators (Q3460780) (← links)
- Combinatorial Auctions with Conflict-Based Externalities (Q3460791) (← links)
- Mechanisms for the Marriage and the Assignment Game (Q3562987) (← links)
