The following pages link to Enrico Nardelli (Q287113):
Displaying 31 items.
- On building the transitive reduction of a two-dimensional poset (Q287116) (← links)
- Computing a poset from its realizer (Q287260) (← links)
- Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
- Distributed searching of multi-dimensional data: A performance evaluation study (Q1130324) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Finding the most vital node of a shortest path. (Q1401266) (← links)
- Swapping a failing edge of a single source shortest paths tree is good and fast (Q1566374) (← links)
- (Q1603440) (redirect page) (← links)
- A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
- Intersection reporting on two collections of disjoint sets (Q1818976) (← links)
- An efficient spatial access method for spatial images containing multiple non-overlapping features (Q1859999) (← links)
- Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time. (Q1872689) (← links)
- Nearly linear time minimum spanning tree maintenance for transient node failures (Q1882530) (← links)
- How to survive while visiting a graph (Q1962049) (← links)
- Efficient unbalanced merge-sort (Q2489231) (← links)
- A generalized comparison of linear representations of thematic layers (Q2734626) (← links)
- (Q2753951) (← links)
- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures (Q2755058) (← links)
- (Q3785966) (← links)
- Hierarchies and planarity theory (Q3822202) (← links)
- (Q4247681) (← links)
- (Q4252023) (← links)
- (Q4473987) (← links)
- (Q4485187) (← links)
- (Q4535443) (← links)
- (Q4551366) (← links)
- (Q4792540) (← links)
- Algorithms for Moving Objects Databases (Q4811516) (← links)
- (Q4938662) (← links)
- ATM layouts with bounded hop count and congestion (Q5138350) (← links)
- An output sensitive solution to the set union and intersection problem (Q6560190) (← links)
