The following pages link to Eva Rotenberg (Q1693992):
Displaying 35 items.
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- String indexing for top-\(k\) close consecutive occurrences (Q2163391) (← links)
- Strength of the Reversible, Garbage-Free 2 k ±1 Multiplier (Q2868436) (← links)
- Dynamic Planar Embeddings of Dynamic Graphs (Q2955014) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- The Power of Two Choices with Simple Tabulation (Q4575695) (← links)
- Best Laid Plans of Lions and Men. (Q4580077) (← links)
- Graph reconstruction with a betweenness oracle (Q4601854) (← links)
- (Q4607874) (← links)
- (Q4607908) (← links)
- (Q4607943) (← links)
- (Q4607996) (← links)
- (Q5002671) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- (Q5009616) (← 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)
- Fast fencing (Q5230320) (← links)
- On Dynamic Graphs (Invited Talk). (Q6168411) (← links)
- Splay top trees (Q6539134) (← links)
- On the discrete Fréchet distance in a graph (Q6539545) (← links)
- Simple and robust dynamic two-dimensional convex hull (Q6545395) (← links)
- Fully-dynamic \(\alpha + 2\) Arboricity decompositions and implicit colouring (Q6560831) (← links)
- On dynamic \(\alpha+1\) Arboricity decomposition and out-orientation (Q6584030) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
- Amortised analysis of dynamic data structures (invited talk) (Q6615100) (← links)
- Multilevel skeletonization using local separators (Q6620500) (← links)
- Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings (Q6620532) (← links)
- Dynamic dynamic time warping (Q6645354) (← links)
- Triangulations admit dominating sets of size \(2n/7\). (Q6645400) (← links)
- Adaptive out-orientations with applications (Q6645472) (← links)
- Edge-connectivity augmentation of simple graphs (Q6668353) (← links)
