italiano | contact
PUBLICATIONS

Special Issues/Journals/Books Proceedings Chapter Technical Report

«      1   |   2   |   3   |   4      »      

2003

M.Flammini, G.Gambosi, A.Gasparini, A.Navarra. Dynamic layouts for Wireless ATM, 9th International Conference on Parallel and Distributed Computing (EUROPAR), Lecture Notes in Computer Science

C. Arbib, M. Flammini, F. Marinelli. Minimum Flow Time Graph Ordering, Proc. of the WG’02: Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science n. 2880, Springer-Verlag (2003) 23-33

2002

S.Cicerone, G.Di Stefano, M.Flammini. Static and Dynamic Low-Congested Interval Routing Schemes, Theoretical Computer Science (276):1-2, pagg. 315-354

C.Arbib, M.Flammini. On the upper chromatic number of (v3,b2)-configurations, Discrete Applied Mathematics (120):1-3, pagg. 3-12

M. Flammini, G.Nicosia. Competitive Algorithms for the Bicriteria k-Server Problem, International Symposium on Combinatorial Optimization (CO)

A. Di Pasquale, M.Flammini, E.Nardelli. Allocation Problems in Scalable Distributed Data Structures, Workshop on Distributed Data & Structures (WDAS)

V.Bilò, M.Flammini. On Multiprocessor Scheduling under Multiple Objectives, International Conference on Operations Research (OR)

V.Bilò, M.Flammini. Time vs Memory Tradeoffs for Multiprocessor Scheduling, 3rd Annual Conference of the Italian Operations Research Society (AIRO)

C.Arbib, M.Flammini, F.Marinelli. Problems with a Slanting Hat, 33rd Annual Conference of the Italian Operations Research Society (AIRO)

C. Arbib, M. Flammini. On the Upper Chromatic Number of (v3, b2)-Configurations, Discrete Applied Mathematics 120 (2002) 3-12

2001

S.Cicerone, G.Di Stefano, M.Flammini. Compact-Port Routing Models and Applications to Distance-Hereditary Graphs, Journal of Parallel and Distributed Computing (61):10, pagg. 1472-1488

M. Flammini, E.Nardelli, G.Proietti. ATM Layouts with Bounded Hop Count and Congestion, Distributed Computing (14):2, pagg. 65-73

M. Flammini, G.Gambosi, U.Nanni, R.B.Tan. Characterization Results of All Shortest Paths Interval Routing Schemes, Networks (37):4, pagg. 225-232

M. Flammini, S.Perennes. On the Optimality of General Lower Bounds for Broadcasting and Gossiping, SIAM Journal of Discrete Mathematics (14):2, pagg. 267-282

M. Flammini, G.Nicosia. On the bicriteria k-server problem, 32nd Annual Conference of the Italian Operations Research Society (AIRO)

2000

C.Arbib, M.Flammini, E.Nardelli. How to Survive while Visiting a Graph, Discrete Applied Mathematics (99):1-3, pagg. 279-293

S.Cicerone, G.Di Stefano, M.Flammini. Low-Congested Interval Routing Schemes for Hypercube-Like Networks, Networks (36):3, pagg. 191-201

M. Flammini, G.Nicosia. On On-line Multicriteria Problems, 8th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science

C. Arbib, M. Flammini, E. Nardelli. How to Survive while Visiting a Graph, Discrete Applied Mathematics 99 (2000) 279-293

1999

M. Flammini, C.Scheideler. Simple, Efficient Routing Schemes for All-Optical Networks, Theory of Computing Systems (formerly Mathematical Systems Theory) (32):3, pagg. 387-420

 
 
 
 

Organization

Head of the department is Prof. Claudio Arbib (since March 1, 2008). The ...

continua ›
 
 
 
 

Publications

Numerous articles published in international scientific journals, books, and ...

continua ›
 
 
 
 

Job Postings

Consulta le offerte di lavoro pervenute dalle aziende, potrai entrare in ...

continua ›