AAAAAA

   
Results: 1-8 |
Results: 8
MULTIDIMENSIONAL INTERVAL ROUTING SCHEMES
Authors: FLAMMINI M GAMBOSI G NANNI U TAN RB
Citation: M. Flammini et al., MULTIDIMENSIONAL INTERVAL ROUTING SCHEMES, Theoretical computer science, 205(1-2), 1998, pp. 115-133
PRESERVING APPROXIMATION IN THE MIN-WEIGHTED SET COVER PROBLEM
Authors: GAMBOSI G PROTASI M TALAMO M
Citation: G. Gambosi et al., PRESERVING APPROXIMATION IN THE MIN-WEIGHTED SET COVER PROBLEM, Discrete applied mathematics, 73(1), 1997, pp. 13-22
ON DEVISING BOOLEAN ROUTING SCHEMES
Authors: FLAMMINI M GAMBOSI G
Citation: M. Flammini et G. Gambosi, ON DEVISING BOOLEAN ROUTING SCHEMES, Theoretical computer science, 186(1-2), 1997, pp. 171-198
THE INCREMENTAL MAINTENANCE OF A DEPTH-FIRST-SEARCH TREE IN DIRECTED ACYCLIC GRAPHS
Authors: FRANCIOSA PG GAMBOSI G NANNI U
Citation: Pg. Franciosa et al., THE INCREMENTAL MAINTENANCE OF A DEPTH-FIRST-SEARCH TREE IN DIRECTED ACYCLIC GRAPHS, Information processing letters, 61(2), 1997, pp. 113-120
INTERVAL ROUTING SCHEMES
Authors: FLAMMINI M GAMBOSI G SALOMONE S
Citation: M. Flammini et al., INTERVAL ROUTING SCHEMES, Algorithmica, 16(6), 1996, pp. 549-568
THE SET UNION PROBLEM WITH UNLIMITED BACKTRACKING
Authors: APOSTOLICO A ITALIANO GF GAMBOSI G TALAMO M
Citation: A. Apostolico et al., THE SET UNION PROBLEM WITH UNLIMITED BACKTRACKING, SIAM journal on computing, 23(1), 1994, pp. 50-70
OPTIMAL CENTRALIZED ALGORITHMS FOR STORE-AND-FORWARD DEADLOCK-AVOIDANCE
Authors: BLAZEWICZ J BOVET DP BRZEZINSKI J GAMBOSI G TALAMO M
Citation: J. Blazewicz et al., OPTIMAL CENTRALIZED ALGORITHMS FOR STORE-AND-FORWARD DEADLOCK-AVOIDANCE, I.E.E.E. transactions on computers, 43(11), 1994, pp. 1333-1338
GRAPH-THEORETICAL ISSUES IN COMPUTER-NETWORKS
Authors: BLAZEWICZ J BRZEZINSKI J GAMBOSI G
Citation: J. Blazewicz et al., GRAPH-THEORETICAL ISSUES IN COMPUTER-NETWORKS, European journal of operational research, 71(1), 1993, pp. 1-16
Risultati: 1-8 |