Result 41 to 60 of 71 total
Advanced environments for parallel and distributed computing. (English)
Parallel Comput. 28, No. 12, 1635-1636 (2002).
41
Static and dynamic low-congested interval routing schemes. (English)
Theor. Comput. Sci. 276, No.1-2, 315-354 (2002).
42
$(k,+)$-distance-hereditary graphs. (English)
Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 27th international workshop, WG 2001, Boltenhagen, Germany, June 14‒16, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42707-4). Lect. Notes Comput. Sci. 2204, 66-77 (2001).
43
Compact-port routing models and applications to distance-hereditary graphs. (English)
J. Parallel Distrib. Comput. 61, No.10, 1472-1488 (2001).
44
Graphs with bounded induced distance. (English)
Discrete Appl. Math. 108, No.1-2, 3-21 (2001).
45
(k, +)-distance-hereditary graphs (English)
WG, 66-77 (2001).
46
Networks with small stretch number (Extended abstract). (English)
Brandes, Ulrik (ed.) et al., Graph-theoretic concepts in computer science. 26th international workshop, WG 2000, Konstanz, Germany, June 15-17, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1928, 95-106 (2000).
47
A parallel software system for the numerical simulation of air pollution. (English)
Ann. Univ. Ferrara, Nuova Ser., Sez. VII 46, Suppl., 279-291 (2000).
48
Low-congested interval routing schemes for hypercubelike networks. (English)
Networks 36, No.3, 191-201 (2000).
49
A fully dynamic algorithm for distributed shortest paths. (English)
Gonnet, Gastón H. (ed.) et al., LATIN 2000: Theoretical informatics. 4th Latin American symposium, Punta del Este, Uruguay, April 10-14, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1776, 247-257 (2000).
50
Application of a parallel photochemical air quality model to the campania region (southern Italy) (English)
Environmental Modelling and Software 15, No. 6-7, 503-511 (2000).
51
Networks with small stretch number (English)
WG, 95-106 (2000).
52
A fully dynamic algorithm for distributed shortest paths (English)
LATIN, 247-257 (2000).
53
Cardinal relations between regions with a broad boundary (English)
ACM-GIS, 15-20 (2000).
54
Survivable networks with bounded delay: The edge failure case. (Extended abstract). (English)
Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 205-214 (1999).
55
Graph classes between parity and distance-hereditary graphs. (English)
Discrete Appl. Math. 95, No.1-3, 197-216 (1999).
56
On the extension of bipartite to parity graphs. (English)
Discrete Appl. Math. 95, No.1-3, 181-195 (1999).
57
Compact-port routing models and applications to distance-hereditary graphs (English)
SIROCCO, 62-77 (1999).
58
Survivable networks with bounded delay: the edge failure case (English)
ISAAC, 205-214 (1999).
59
Some perspectives on high-performance mathematical software. (English)
De Leone, Renato (ed.) et al., High performance algorithms and software in nonlinear optimization. Conference, HPSNO 97, Ischia, Italy, June 1997. Dordrecht: Kluwer Academic Publishers. Appl. Optim. 24, 1-23 (1998).
60
Result 41 to 60 of 71 total
Start
Contact
Print
General Help
