Daniele Frigioni

Available identifiers

zbMath Open frigioni.danieleMaRDI QIDQ385950

List of research outcomes

Publication	Date of Publication	Type
Semi-dynamic shortest paths and breadth-first search in digraphs	2022-11-09	Paper
Dynamically switching vertices in planar graphs (extended abstract)	2021-12-20	Paper
Rigorous DC Solution of Partial Element Equivalent Circuit Models	2021-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q5240129	2019-10-24	Paper
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem	2019-06-25	Paper
Fully Dynamic 2-Hop Cover Labeling	2019-03-27	Paper
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane	2018-12-03	Paper
Fully dynamic update of arc-flags	2018-05-23	Paper
Engineering graph-based models for dynamic timetable information systems	2017-11-09	Paper
An Experimental Study of Dynamic Algorithms for Transitive Closure	2017-06-15	Paper
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates	2016-10-24	Paper
Distance Queries in Large-Scale Fully Dynamic Complex Networks	2016-09-29	Paper
Synchronous robots vs asynchronous lights-enhanced robots on graphs	2016-08-05	Paper
Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios	2016-01-28	Paper
Path-Fault-Tolerant Approximate Shortest-Path Trees	2016-01-08	Paper
Explore and repair graphs with black holes using mobile entities	2015-10-30	Paper
Dynamically Maintaining Shortest Path Trees under Batches of Updates	2013-12-17	Paper
A loop-free shortest-path routing algorithm for dynamic networks	2013-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q2867368	2013-12-11	Paper
Engineering a new algorithm for distributed shortest paths on dynamic networks	2013-05-16	Paper
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks	2013-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q2917368	2012-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q2917373	2012-09-28	Paper
Partially dynamic efficient algorithms for distributed shortest paths	2010-03-09	Paper
Recoverable Robustness in Shunting and Timetabling	2009-12-03	Paper
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases	2009-12-02	Paper
Delay Management Problem: Complexity Results and Robust Algorithms	2009-01-27	Paper
Dynamic multi-level overlay graphs for shortest paths	2008-09-08	Paper
Power balance and apportionment algorithms for the United States Congress	2005-08-04	Paper
Partially dynamic maintenance of minimum weight hyperpaths	2005-05-04	Paper
Fully dynamic shortest paths in digraphs with arbitrary arc weights	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q4470497	2004-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4448373	2004-02-18	Paper
A fully dynamic algorithm for distributed shortest paths.	2003-08-17	Paper
A general strategy for decomposing topological invariants of spatial databases and an application	2002-07-15	Paper
https://portal.mardi4nfdi.de/entity/Q4409366	2002-01-01	Paper
Dynamic algorithms for classes of constraint satisfaction problems	2001-08-20	Paper
Dynamically switching vertices in planar graphs	2001-04-26	Paper
Semi-dynamic breadth-first search in digraphs	2000-12-12	Paper
https://portal.mardi4nfdi.de/entity/Q4508381	2000-10-03	Paper
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees	2000-08-28	Paper
https://portal.mardi4nfdi.de/entity/Q4252034	2000-03-13	Paper
Semidynamic algorithms for maintaining single-source shortest path trees	1999-06-22	Paper
A uniform approach to semi-dynamic problems on digraphs	1999-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4370204	1998-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q4875188	1996-04-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Daniele Frigioni