The following pages link to Camil Demetrescu (Q410725):
Displaying 26 items.
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
- Experimental analysis of dynamic all pairs shortest path algorithms (Q2944531) (← links)
- Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems (Q3525568) (← links)
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments (Q3527251) (← links)
- Oracles for Distances Avoiding a Failed Node or Link (Q3532564) (← links)
- Trade-offs for fully dynamic transitive closure on DAGs: breaking through the <i>O</i> ( <i>n</i> <sup>2</sup> barrier (Q3546293) (← links)
- A new approach to dynamic all pairs shortest paths (Q3581293) (← links)
- (Q4417670) (← links)
- (Q4471631) (← links)
- (Q4536342) (← links)
- (Q4643862) (← links)
- (Q4643863) (← links)
- (Q4668725) (← links)
- (Q4737195) (← links)
- (Q4829020) (← links)
- A new approach to dynamic all pairs shortest paths (Q5435671) (← links)
- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? (Q5449576) (← links)
- (Q5501281) (← links)
- Trading off space for passes in graph streaming problems (Q5891890) (← links)
- Trading off space for passes in graph streaming problems (Q5901127) (← links)
