Enrico Nardelli

From MaRDI portal
Person:287113

Available identifiers

zbMath Open nardelli.enricoDBLPn/EnricoNardelliWikidataQ102765912 ScholiaQ102765912MaRDI QIDQ287113

List of research outcomes





PublicationDate of PublicationType
An output sensitive solution to the set union and intersection problem2024-06-21Paper
ATM layouts with bounded hop count and congestion2020-12-03Paper
Finding the detour-critical edge of a shortest path between two nodes2016-06-09Paper
On building the transitive reduction of a two-dimensional poset2016-05-26Paper
Computing a poset from its realizer2016-05-26Paper
Efficient unbalanced merge-sort2006-05-16Paper
Nearly linear time minimum spanning tree maintenance for transient node failures2004-10-01Paper
Algorithms for Moving Objects Databases2004-09-06Paper
https://portal.mardi4nfdi.de/entity/Q44739872004-08-04Paper
Finding the most vital node of a shortest path.2003-08-17Paper
Swapping a failing edge of a single source shortest paths tree is good and fast2003-06-02Paper
Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.2003-05-14Paper
An efficient spatial access method for spatial images containing multiple non-overlapping features2003-02-20Paper
https://portal.mardi4nfdi.de/entity/Q47925402003-02-17Paper
https://portal.mardi4nfdi.de/entity/Q45513662002-09-05Paper
A faster computation of the most vital edge of a shortest path2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q45354432002-06-16Paper
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures2002-01-07Paper
https://portal.mardi4nfdi.de/entity/Q27539512001-11-11Paper
A generalized comparison of linear representations of thematic layers2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q49386622001-02-18Paper
How to survive while visiting a graph2000-07-13Paper
https://portal.mardi4nfdi.de/entity/Q42520232000-03-13Paper
Intersection reporting on two collections of disjoint sets2000-01-05Paper
https://portal.mardi4nfdi.de/entity/Q44851872000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42476811999-06-16Paper
Distributed searching of multi-dimensional data: A performance evaluation study1998-11-05Paper
A pointer-free data structure for merging heaps and min-max heaps1992-06-26Paper
Hierarchies and planarity theory1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859661987-01-01Paper

Research outcomes over time

This page was built for person: Enrico Nardelli