The following pages link to Daniele Frigioni (Q385950):
Displayed 47 items.
- (Q198214) (redirect page) (← links)
- A loop-free shortest-path routing algorithm for dynamic networks (Q385951) (← links)
- Synchronous robots vs asynchronous lights-enhanced robots on graphs (Q737100) (← links)
- Dynamically switching vertices in planar graphs (extended abstract) (Q826087) (← links)
- Explore and repair graphs with black holes using mobile entities (Q888441) (← links)
- Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios (Q905697) (← links)
- Dynamic multi-level overlay graphs for shortest paths (Q943005) (← links)
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435) (← links)
- Semidynamic algorithms for maintaining single-source shortest path trees (Q1273931) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- A fully dynamic algorithm for distributed shortest paths. (Q1401293) (← links)
- Dynamically switching vertices in planar graphs (Q1578392) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Engineering graph-based models for dynamic timetable information systems (Q1679616) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Engineering a new algorithm for distributed shortest paths on dynamic networks (Q1949761) (← links)
- Partially dynamic efficient algorithms for distributed shortest paths (Q2268860) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- Distance Queries in Large-Scale Fully Dynamic Complex Networks (Q2819495) (← links)
- Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates (Q2828206) (← links)
- (Q2867368) (← links)
- Dynamically Maintaining Shortest Path Trees under Batches of Updates (Q2868652) (← links)
- (Q2917368) (← links)
- (Q2917373) (← links)
- Path-Fault-Tolerant Approximate Shortest-Path Trees (Q3460718) (← links)
- Recoverable Robustness in Shunting and Timetabling (Q3649158) (← links)
- (Q4252034) (← links)
- (Q4370204) (← links)
- (Q4409366) (← links)
- (Q4448373) (← links)
- (Q4470497) (← links)
- (Q4508381) (← links)
- A general strategy for decomposing topological invariants of spatial databases and an application (Q4538725) (← links)
- Fully Dynamic 2-Hop Cover Labeling (Q4629540) (← links)
- Fully dynamic update of arc-flags (Q4642489) (← links)
- Fully dynamic shortest paths in digraphs with arbitrary arc weights (Q4820906) (← links)
- (Q4875188) (← links)
- Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks (Q4916040) (← links)
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees (Q4943078) (← links)
- Rigorous DC Solution of Partial Element Equivalent Circuit Models (Q5007449) (← links)
- Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
- (Q5240129) (← links)
- An Experimental Study of Dynamic Algorithms for Transitive Closure (Q5269373) (← links)
- Power balance and apportionment algorithms for the United States Congress (Q5463379) (← links)
- Delay Management Problem: Complexity Results and Robust Algorithms (Q5505683) (← links)
- Dynamic algorithms for classes of constraint satisfaction problems (Q5941281) (← links)