Mattia D'Emidio

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Rigorous DC Solution of Partial Element Equivalent Circuit Models IEEE Transactions on Circuits and Systems I: Regular Papers	2021-08-26	Paper
On the effectiveness of the genetic paradigm for polygonization Information Processing Letters	2021-06-16	Paper
Priority scheduling in the bamboo garden trimming problem	2020-10-22	Paper
Engineering graph-based models for dynamic timetable information systems	2019-10-24	Paper
Bamboo garden trimming problem: priority schedulings Algorithms	2019-07-08	Paper
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem Journal of Combinatorial Optimization	2019-06-25	Paper
Fully Dynamic 2-Hop Cover Labeling ACM Journal of Experimental Algorithmics	2019-03-27	Paper
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane Information and Computation	2018-12-03	Paper
Fully dynamic update of arc-flags Networks	2018-05-23	Paper
Engineering graph-based models for dynamic timetable information systems Journal of Discrete Algorithms	2017-11-09	Paper
Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments ACM Journal of Experimental Algorithmics	2016-10-24	Paper
Distance Queries in Large-Scale Fully Dynamic Complex Networks Lecture Notes in Computer Science	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 Theory of Computing Systems	2016-01-28	Paper
Path-fault-tolerant approximate shortest-path trees Structural Information and Communication Complexity	2016-01-08	Paper
Explore and repair graphs with black holes using mobile entities Theoretical Computer Science	2015-10-30	Paper
Dynamically maintaining shortest path trees under batches of updates Structural Information and Communication Complexity	2013-12-17	Paper
A loop-free shortest-path routing algorithm for dynamic networks Theoretical Computer Science	2013-12-13	Paper
Enhancing the computation of distributed shortest paths on real dynamic networks Lecture Notes in Computer Science	2013-04-19	Paper

Research outcomes over time

This page was built for person: Mattia D'Emidio