The following pages link to Jacob Holm (Q1693991):
Displaying 22 items.
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- (Q2721967) (← links)
- (Q2754135) (← links)
- Maintaining information in fully dynamic trees with top trees (Q2944498) (← links)
- Dynamic Planar Embeddings of Dynamic Graphs (Q2955014) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- (Q4250200) (← links)
- (Q4542523) (← links)
- Minimizing diameters of dynamic trees (Q4571959) (← links)
- Best Laid Plans of Lions and Men. (Q4580077) (← links)
- (Q4607874) (← links)
- (Q4607943) (← links)
- (Q5002671) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs (Q5111460) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Escaping an Infinitude of Lions (Q5140824) (← links)
- Fully-dynamic planarity testing in polylogarithmic time (Q5144906) (← links)
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity (Q5146936) (← links)
- Online Bipartite Matching with Amortized <i>O</i> (log <sup>2</sup> <i>n</i> ) Replacements (Q5215466) (← links)
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357) (← links)