Umberto Nanni - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2021

Non-isomorphic CNF GenerationPaolo Fantozzi, Luigi Laura, Umberto Nanni, Alessandro Villa. dcai 2022: 98-107 [doi]

2019

Recommending Tasks in Online JudgesGiorgio Audrito, Tania Di Mascio, Paolo Fantozzi, Luigi Laura, Gemma Martini, Umberto Nanni, Marco Temperini. mis4tel 2020: 129-136 [doi]

2018

Visual Analysis of Vertex-Disjoint Path Connectivity in NetworksPaolo Fantozzi, Luigi Laura, Umberto Nanni, Marco Temperini. IV 2018: 260-265 [doi]

2014

Visual Analysis Based on Dominator Trees with Application to Personalized eLearningLuigi Laura, Umberto Nanni, Marco Temperini. icwl 2014: 207-212 [doi]

The Organization of Large-Scale Repositories of Learning Objects with Directed HypergraphsLuigi Laura, Umberto Nanni, Marco Temperini. icwl 2014: 23-33 [doi]

2012

Structure Theorems for Optimum Hyperpaths in Directed HypergraphsGiorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco. iscopt 2012: 1-14 [doi]

2011

Linear time analysis of properties of conflict-free and general Petri netsPaola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni. TCS, 412(4-5):320-338, 2011. [doi]

2003

A fully dynamic algorithm for distributed shortest pathsSerafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni. TCS, 297(1-3):83-102, 2003. [doi]

Fully dynamic shortest paths in digraphs with arbitrary arc weightsDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. jal, 49(1):86-113, 2003. [doi]

2001

Characterization results of all shortest paths interval routing schemesMichele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan. networks, 37(4):225-232, 2001. [doi]

An Experimental Study of Dynamic Algorithms for Transitive ClosureDaniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis. jea, 6:9, 2001.

Dynamic algorithms for classes of constraint satisfaction problemsDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. TCS, 259(1-2):287-305, 2001. [doi]

2000

A Fully Dynamic Algorithm for Distributed Shortest PathsSerafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni. latin 2000: 247-257

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental StudyCamil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. wae 2001: 218-229 [doi]

Fully Dynamic Algorithms for Maintaining Shortest Paths TreesDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. jal, 34(2):251-281, 2000.

1998

Hypergraph Traversal Revisited: Cost Measures and Dynamic AlgorithmsGiorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni. mfcs 1998: 1-16 [doi]

A Uniform Approach to Semi-Dynamic Problems on DigraphsSerafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese. TCS, 203(1):69-90, 1998. [doi]

Characterization results of all shortest paths interval routing schemesMichele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan. sirocco 1998: 201-213

Multidimensional Interval Routing SchemesMichele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan. TCS, 205(1-2):115-133, 1998. [doi]

Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path ProblemDaniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasquale. jea, 3:5, 1998. [doi]

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc WeightsDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. esa 1998: 320-331 [doi]

Semidynamic Algorithms for Maintaining Single-Source Shortest Path TreesDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. algorithmica, 22(3):250-274, 1998. [doi]

An Experimental Study of Dynamic Algorithms for Directed GraphsDaniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis. esa 1998: 368-380 [doi]

1997

The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic GraphsPaolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni. ipl, 61(2):113-120, 1997. [doi]

Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path ProblemDaniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone. wae 1997: 54-63

1996

Counting Edges in a DagSerafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese. criwg 1997: 85-100

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. soda 1996: 212-221

Maintaining a Topological Order Under Edge InsertionsAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert. ipl, 59(1):53-58, 1996. [doi]

1995

Multi-Dimensional Interval Routing SchemesMichele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan. wdag 1995: 131-144

1994

On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG sPaolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni. esa 1994: 343-353

Incremental Algorithms for the Single-Source Shortest Path ProblemDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. fsttcs 1994: 113-124

Dynamization of Backtrack-Free Search for the Constraint Satisfaction ProblemDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. ciac 1994: 136-151

1993

The Weighted List Update Problem and the Lazy AdversaryFabrizio d Amore, Alberto Marchetti-Spaccamela, Umberto Nanni. TCS, 108(2):371-384, 1993.

On-line Graph Algorithms for Incremental CompilationAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert. criwg 1994: 70-86

LOA: The LOGIDATA+ Object AlgebraUmberto Nanni, Silvio Salza, Mario Terranova. In Paolo Atzeni, editor, LOGIDATA+: Deductive Databases with Complex Objects. Volume 701 of Lecture Notes in Computer Science, pages 195-210, Springer, 1993.

The LOGIDATA+ Prototype SystemUmberto Nanni, Silvio Salza, Mario Terranova. In Paolo Atzeni, editor, LOGIDATA+: Deductive Databases with Complex Objects. Volume 701 of Lecture Notes in Computer Science, pages 211-232, Springer, 1993.

1992

Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri NetsPaola Alimonti, Esteban Feuerstein, Umberto Nanni. latin 1992: 1-14

On-Line Computation of Minimal and Maximal Length PathsGiorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. TCS, 95(2):245-261, 1992.

1991

Incremental Algorithms for Minimal Length PathsGiorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. jal, 12(4):615-638, 1991.

Competitive Algorithms for the Weighted List Update ProblemFabrizio d Amore, Alberto Marchetti-Spaccamela, Umberto Nanni. wads 1991: 240-248

1990

Dynamic Maintenance of Directed HypergraphsGiorgio Ausiello, Umberto Nanni. TCS, 72(2&3):97-117, 1990.

Incremental Algorithms for Minimal Length PathsGiorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. soda 1990: 12-21

1989

Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version)Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. wads 1989: 352-372

1988

Dynamic Maintenance of Paths and Path Expressions on GraphsGiorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni. issac 1989: 1-12

Sign in or sign up to see more results.

runs on WebDSL