The following pages link to Algorithm Theory - SWAT 2004 (Q5315390):
Displaying 18 items.
- The impact of dynamic events on the number of errors in networks (Q265066) (← 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)
- On dynamic shortest paths problems (Q639278) (← links)
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- Algorithmic techniques for maintaining shortest routes in dynamic networks (Q2864176) (← links)
- Parameterized Weighted Containment (Q2946752) (← links)
- Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs (Q3467869) (← links)
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited (Q4575765) (← links)
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms (Q5002673) (← links)
- Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds (Q5146947) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Distance queries over dynamic interval graphs (Q6577442) (← links)
