The following pages link to Algorithms – ESA 2004 (Q5464616):
Displaying 31 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights (Q528469) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- Average-case analysis of incremental topological ordering (Q968137) (← links)
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- New pairwise spanners (Q1693988) (← links)
- The dynamic bowser routing problem (Q1711454) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Speeding up dynamic shortest-path algorithms (Q2901004) (← links)
- Dynamic approximate all-pairs shortest paths in undirected graphs (Q2910856) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- Two-phase algorithms for the parametric shortest path problem (Q3113746) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs (Q3467869) (← links)
- On the dynamic shortest path problem (Q3985351) (← links)
- Cheapest paths in dynamic networks (Q4565769) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (Q4575632) (← links)
- (Q5009588) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- (Q5091170) (← links)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139) (← links)
- Average-Case Analysis of Online Topological Ordering (Q5387779) (← links)
- Light Spanners (Q5499739) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
