Publications

See also DBLP

Book Chapters and Book Editing

  1. D’Angelo G., Di Stefano G., Navarra A. Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model. Search Theory: A Game Theoretic Perspective, Springer, Part 3, pp. 197-222, 2013.
  2. Navarra A., D’Angelo G., Di Stefano G. Multi-Interface Wireless Networks: Complexity and Algorithm. Wireless Sensor Networks: From Theory to Applications, CRC Press, Taylor & Francis Group, USA, Part 3, pp. 119-155, 2013.
  3. J. Clausen, G. Di Stefano (Eds.). Proceedings of ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems IT University of Copenhagen, Denmark, September 10, 2009 Schloss Dagstuhl. Leibniz-Zentrum fuer Informatik, Germany, 2009. ISBN 978-3-939897-11-8.
  4. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, and A. Schöbel. Recoverable robustness in shunting and timetabling. Robust and Online Large-Scale Optimization. In Volume 5868 of State of the Art Lecture Notes in Computer Science, pages 28-60. Springer, 2009.
  5. M. Demange, G. Di Stefano, B. Leroy-Beaulieu. The Online Track Assignment Problem. In: Combinatorial Optimization and Theoretical Computer Science. Hoboken (USA) : WILEY, Vangelis Th. Paschos. 2008. ISBN 978-1-84821-021-9
  6. A. D’Atri, G. Di Stefano, G. Fabrizi, A. Montesanti, L. Tarantino, and B. Zobel. Milord: Project result and future work. In Health in the New Communication Age , volume 24, pages 167--173. IOS Press, 1995.

International Journals

  1. D’Angelo G., Di Stefano G., Klasing R., Navarra A. Gathering of Robots on Anonymous Grids and Trees without Multiplicity Detection. Theoretical Computer Science, to appear.
  2. D’Angelo G., Di Stefano G., Navarra A., Nisse N., Suchan K. Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica, to appear.
  3. Di Stefano G., Navarra A. The game of Scintillae: From cellular automata to computing and cryptography systems. Journal of Cellular Automata. Vol. 9(2-3), pp. 167-181, 2014.
  4. D’Angelo G., Di Stefano G., Navarra A. Gathering on rings under the Look-Compute-Move model. Distributed Computing. Vol.27(4), pp. 255-285, 2014.
  5. D’Angelo G., Di Stefano G., Navarra A. Gathering Six Oblivious Robots on Anonymous Symmetric Rings. Journal of Discrete Algorithms. Vol.26, pp. 16-27, 2014.
  6. D’Angelo G., Di Stefano G., Navarra A. Flow problems in Multi-Interface Networks. IEEE Transactions on Computers. Vol. 63(2), pp. 361-374, 2014.
  7. Baldassarre G., Di Stefano G., Ferrauto T., Parisi D. Different Genetic Algorithms and the Evolution of Specialisation: A Study with Groups of Simulated Neural Robots. Artificial Life. Vol. 19, p. 221-253, 2013.
  8. Cicerone S., D’Angelo G., Di Stefano G., Frigioni D., Maurizio V. Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica, vol. 66, p. 51-86, ISSN: 0178-4617
  9. G. Di Stefano. Distance-Hereditary Comparability Graphs. Discrete Applied Mathematics . 160(18): 2669-2680, Elsevier, 2012.
  10. S. Cicerone, G. Di Stefano, M. Schachtebeck, A. Schoebel. Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Information Sciences, 190:107-126, 2012.
  11. G. D’Angelo, G. Di Stefano, and A. Navarra. Minimize the Maximum Duty in Multi-Interface Networks. Algorithmica, 63:274-295, Springer, 2012.
  12. M. Demange, G. Di Stefano, B. Leroy-Beaulieu. On the online track assignment problem. Discrete Applied Mathematics, 160:1072-1093, Elsevier, 2012
  13. G. D’Angelo, G. Di Stefano, A. Navarra, and Cristina M. Pinotti. Recoverable Robust Timetables: an Algorithmic Approach on Trees. IEEE Transactions on Computers, 60(3):433-446, 2011.
  14. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni. Partially Dynamic Efficient Algorithms for Distributed Shortest Paths. Theoretical Computer Science, 411:1013-1037, Elsevier, 2010.
  15. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, A. Navarra. Recoverable Robustness for Train Shunting Problems. Algorithmic Operations Research, 4(2):102-116, 2009.
  16. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, A. Navarra. Recoverable Robust Timetabling for Single Delay: Complexity and Polynomial Algorithms for Special Cases. Journal of Combinatorial Optimization, 18(3):229-257, Springer, 2009.
  17. S. Cornelsen and G. Di Stefano. Treelike comparability graphs. Discrete Applied Mathematics , 157(8):1711--1722, April 2009.
  18. G. Di Stefano, S. Krause, M. Luebekke, and U. Zimmermann. On minimum k-modal partition of permutations. Journal of Discrete Algorithms , 6(3):381--392, 2008.
  19. G. Di Stefano and A. Petricola. A distributed AOA based localization algorithm for wireless sensor networks. Journal of Computers , 3(4):1--8, April 2008.
  20. F. Bruera, S. Cicerone, G. D’Angelo, G. Di Stefano, and D. Frigioni. Dynamic multi-level overlay graphs for shortest paths. Mathematics in Computer Science , 1(4):709--736, 2008.
  21. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, and A. Petricola. Partially dynamic algorithms for distributed shortest paths and their experimental evaluation. Journal of Computers , 2(9):16--26, November 2007.
  22. S. Cornelsen and G. Di Stefano. Track assignment. Journal of Discrete Algorithms , 5(2):250--261, June 2007.
  23. S. Cicerone, G. Di Stefano, and Dagmar Handke. Self-spanner graphs. Discrete Applied Mathematics , 150(1):99--120, October 2005.
  24. S. Cicerone and G. Di Stefano. Networks with small stretch number. Journal of Discrete Algorithms , 2(4):383--405, December 2004.
  25. S. Cicerone and G. Di Stefano. (k,+)-distance hereditary graphs. Journal of Discrete Algorithms , 1(3-4):281--302, 2003.
  26. S. Cicerone, G. Di Stefano, D. Frigioni, and U. Nanni. A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science , 297(1-3):83--102, 2003.
  27. S. Cicerone, G. Di Stefano, and M. Flammini. Static and dynamic low-congested interval routing schemes. Theoretical Computer Science , 276(1-2):315--354, April 2002.
  28. S. Cicerone, G. Di Stefano, and M. Flammini. Compact-port routing models and applications to distance-hereditary graphs. Journal of Parallel and Distributed Computing , 61:1472--1488, 2001.
  29. S. Cicerone and G. Di Stefano. Graphs with bounded induced distance. Discrete Applied Mathematics , 108(1-2):3--21, January 2001.
  30. S. Cicerone, G. Di Stefano, and M. Flammini. Low congested interval routing schemes for hypercube-like networks. Networks , 36(3):191--201, September 2000.
  31. S. Cicerone and G. Di Stefano. Graph classes between parity and distance-hereditary graphs. Discrete Applied Mathematics , 95(1-3):197--216, August 1999.
  32. S. Cicerone and G. Di Stefano. On the extension of bipartite to parity graphs. Discrete Applied Mathematics , 95(1-3):181--195, August 1999.
  33. A. D’Atri, G. Di Stefano, and L. Tarantino. On the representation and management of medical records in a knowledge based systems. Expert Systems with Applications , 6:479--472, 1993.
  34. G. Di Stefano. An Extension to the Back-Propagation Algorithm. Communications and Cognition - Artificial Intelligence , 10:7--22, 1993.
  35. H. Schiff and G. Di Stefano. Target localization in different luminous environments. Comp. Biochem. Phisiol. , 103A(3):479--486, 1992.
  36. L. Iacino, G. Di Stefano, and H. Schiff. A neural model for localizing targets in space accomplished by the eye of a Mantis shrimp. Biological Cybernetics , 63:383--391, 1990.
  37. G. Di Stefano, L. Iacino, and H. Schiff. What the Mantis shrimp’s eye (possibly) tells its raptorial appendages. Biological Cybernetics, 63:393--401, 1990.
  38. H. Schiff, G. Castelletti, G. Di Stefano, and L. Iacino. A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - I matematical description. Comp. Biochem. Physiol. , 92A(3):331--341, 1989.
  39. H. Schiff, G. Castelletti, G. Di Stefano, and L. Iacino. A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - II computer simulation. Comp. Biochem. Physiol. , 92A(3):343--354, 1989.

International Conferences

  1. Cicerone S., Di Stefano G., Navarra A. MinMax-Distance Gathering on given Meeting Points. Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), Lecture Notes in Computer Science, Springer, to appear.
  2. Cicerone S., Di Stefano G., Navarra A. Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points. Proceedings of the 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Algosensors), Lecture Notes in Computer Science 8847, Springer, pp. 57-72, 2014.
  3. Di Stefano G., Navarra A. Optimal Gathering on Infinite Grids. Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science, 8756, Springer, pp. 211-225, 2014.
  4. Cicerone S., Di Stefano G. Decomposing Octilinear Polygons into Triangles and Rectangles. Proceeedings of Discrete and Computational Geometry and Graphs (JCDCG). Lecture notes in Computer Science, vol. 8845, p. 18-30, Springer, 2013.
  5. Di Stefano G., Navarra A. Optimal Gathering of Oblivious Robots in Anonymous Graphs. Proceedings of the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, 8179, Springer, pp. 213-224, 2013.
  6. D’Angelo G., Di Stefano G., Navarra A., Nisse N., Suchan K. A unified approach for different tasks on rings in robot-based computing systems. Proceedings of the 15th IEEE IPDPS Workshop on Advances in Parallel and Distributed Computing Models (APDCM), pp. 667-676, 2013.
  7. D’Angelo G., Di Stefano G., Navarra A. How to Gather Asynchronous Oblivious Robots on Anonymous Rings. Proceedings of the 26th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, 7611, Springer, pp. 330-344, 2012.
  8. Di Stefano G., Navarra A.: Scintillae: how to approach computing systems by means of cellular automata. Proceedings of the 10th International Conference on Cellular Automata for Research and Industry (ACRI), Lecture Notes in Computer Science 7495, Springer, pp. 534-543, 2012.
  9. G. D’Angelo, G. Di Stefano, R. Klasing, Alfredo Navarra. Gathering of Robots on Anonymous Grids without Multiplicity Detection. In 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012) Volume 7355 of Lecture Notes in Computer Science, pages 327-338. Springer, 2012.
  10. G. D’Angelo, G. Di Stefano, and A. Navarra. Gathering of Six Robots on Anonymous Symmetric Rings. In 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2011). Volume 6796 of Lecture Notes in Computer Science, pages 174-185. Springer, 2011.
  11. G. D’Angelo, G. Di Stefano, and A. Navarra. Maximum Flow and Minimum-Cost Flow in Multi-Interfacei Networks. In 5th ACM International Conference on Ubiquitous Information Management and Communication i (ACM ICUIMC’11). Article 19, 9 pages. ACM Press, 2011.
  12. G. D’Angelo, G. Di Stefano, and A. Navarra. Min-Max Coverage in Multi-Interface Networks. In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’11). Volume 6543 of Lecture Notes in Computer Science, pages 190-201. Springer, 2011.
  13. G. D’Angelo, G. Di Stefano, and A. Navarra. Bandwidth constrained multi-interface networks. In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’11). Volume 6543 of Lecture Notes in Computer Science, pages 202-213. Springer, 2011.
  14. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, V. Maurizio. A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. In 9th International Symposium on Experimetal Algorithms, Ischia, Italiy (SEA 2010) Volume 6046 of Lecture Notes in Computer Science, pages 59-70. Springer, 2010.
  15. G. Di Stefano. Distance-Hereditary Comparability Graphs. In V Latin-American Algorithms, Graphs and Optimization Symposium, Gramado, Brazil (LAGOS’09) Volume 35 of Lecture Notes in Discrete Mathematics, pages 1-364. Elsevier, 2009.
  16. J. Clausen and G. Di Stefano. ATMOS 2009 Preface. In 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Dagstuhl, Germany (ATMOS 2009). ISBN 978-3-939897-11-8
  17. G. D’Angelo, G. Di Stefano, and A. Navarra. Evaluation of recoverable-robust timetables on tree networks. In 20th International Workshop on Combinatorial Algorithms (IWOCA 2009). Volume 5874 of Lecture Notes in Computer Science, pages 24-35. Springer, 2009.
  18. G. D’Angelo, G. Di Stefano, A. Navarra, and Cristina M. Pinotti. Recoverable robust timetables on trees. In 3rd International Conference on Combinatorial Optimization and Applications 2009 (COCOA’09). Volume 5573 of Lecture Notes in Computer Science, pages 451-462. Springer, 2009.
  19. G. D’Angelo, G. Di Stefano, and A. Navarra. Recoverable-Robust Timetables for Trains on Single-Line Corridors. In International Seminar on Railway Operations Modelling and Analysis - Engineering and Optimisation Approaches (RailZurich2009). 2009.
  20. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Delay management problem: Complexity results and robust algorithms. In Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA) , volume 5165 of Lecture Notes in Computer Science , pages 458--468. Springer-verlag, 2008.
  21. G. Di Stefano. On the online track assignment problem (invited talk - abstract). In Proceedings of the 18th International Federation of Operational Research Societies Conference , July 2008.
  22. S. Cicerone, G. Di Stefano, M. Schachtebeck, and A. Sch\"obel. Dynamic algorithms for recoverable robustness problems. Proceedings or ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems , Dagstuhl, Germany, 2008. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
  23. M. Demange, G. Di Stefano, and B. Leroy-Beaulieu. Online bounded coloring of permutations and overlap graphs. In Proceedings of IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS’07) , volume 30 of Electronic Notes in Discrete Matematics , pages 213--218, February 2008.
  24. S. Cornelsen and G. Di Stefano. Platform assignment. In Proocedings of 4th International Workshop on Algorithmic MeThods and Models for Optimization of RailwayS (ATMOS’04) , volume 4359 of Lecture Notes in Computer Science , pages 233--245. Springer-Verlag, December 2007.
  25. S. Cicerone, G. D’Angelo, G. Di Stefano, and D. Frigioni. Partially dynamic efficient algorithms for distributed shortest paths. In Proceedings of IEEE International Conference on Computing: Theory and Application (ICCTA’07) , pages 32--38. IEEE Computer Society Press, March 2007.
  26. F. Bruera, S. Cicerone, G. D’Angelo, G. Di Stefano, and D. Frigioni. Maintenance of multi-level overlay graphs for timetable queries. In Proceedings of ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems , Dagstuhl, Germany, 2007. IBFI, Schloss Dagstuhl, Germany.
  27. S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Robust algorithms and price of robustness in shunting problems. In Christian Liebchen, Ravindra K. Ahuja, and Juan A. Mesa, editors, ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems , Dagstuhl, Germany, 2007. IBFI, Schloss Dagstuhl, Germany.
  28. G. Di Stefano, A. Petricola, and C. Zaroliagis. On the implementation of parallel shortest path algorithms on a supercomputer. In Parallel and Distributed Processing and Applications -- ISPA 2006 , volume 4330 of Lecture Notes in Computer Science , pages 406--417. Springer, 2006.
  29. G. Di Stefano. How to assign tracks to trains (invited talk - abstract). In Proceedings of 19th International Symosium on Mathematical Programming (ISMP’06) , page 98. COPPE/UFRJ, July 2006.
  30. G. Di Stefano, S. Krause, M. Luebekke, and U. Zimmermann. On minimum $k$-modal partition of permutations. In 7th Latin American Theoretical Informatics (LATIN’06) , volume 3887 of Lecture Notes in Computer Science , pages 374--385. Springer-Verlag, March 2006.
  31. S. Cornelsen and G. Di Stefano. Treelike comparability graphs: Characterization, recognition and applications. In Proceeding of 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’04) , volume 3353 of Lecture Notes in Computer Science , pages 46--57, January 2005.
  32. G. Di Stefano and M. L. Koci. A graph theoretical approach to the shunting problem. In Proocedings of Algorithmic MeThods and Models for Optimization of RailwayS, , volume 92 of Electronic Notes in Theoretical Computer Science , pages 16--33, September 2003.
  33. G. Di Stefano, F. Graziosi, and F. Santucci. Distributed positioning algorithm for ad-hoc networks. In Proceedings of 2003 International Workshop on Ultra Wideband Systems (IWUWBS) , June 2003.
  34. A. Caputo, G. Cardarelli, G. Di Stefano, and E. Ippoliti. Implementing a hla-based distributed simulation for supply chain management: development of an arena based federate. In Proceedings of 2001 Summer Computer Simulation Conference , July 2001.
  35. S. Cicerone, G. D’Ermiliis, and G. Di Stefano. (k,+)-distance hereditary graphs (extended abstract). In 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’01) , Lecture Notes in Computer Science. Springer-Verlag, June 2001.
  36. S. Cicerone, G. Di Stefano, D. Frigioni, and U. Nanni. A fully dynamic algorithm for distributed shortest paths. In 4th Latin American Theoretical Informatics (LATIN’00) , volume 1776 of Lecture Notes in Computer Science , pages 247--257. Springer-Verlag, December 2000.
  37. S. Cicerone and G. Di Stefano. Networks with small stretch number. In 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’00) , volume 1928 of Lecture Notes in Computer Science , pages 95--106. Springer-Verlag, June 2000.
  38. S. Cicerone, G. Di Stefano, and D. Handke. Survivable networks with bounded delay: the edge failure case. In 10th International Symposium on Algorithms and Computation (ISAAC’99) , volume 1741 of Lecture Notes in Computer Science , pages 205--214. Springer-Verlag, December 1999.
  39. S. Cicerone, G. Di Stefano, and M. Flammini. Compact-port routing models and applications to distance-hereditary graphs. In 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO’99) , pages 62--77. Carleton Scientific, 1999.
  40. S. Cicerone, G. Di Stefano, and M. Flammini. Static and dynamic low congested interval routing schemes. In 25th International Colloquium on Automata, Languages, and Programming (ICALP’98) , volume 1443 of Lecture Notes in Computer Science , pages 592--603. Springer-Verlag, July 1998.
  41. S. Cicerone and G. Di Stefano. Graphs with bounded induced distance. In 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’98) , volume 1517 of Lecture Notes in Computer Science , pages 177--191. Springer-Verlag, 1998.
  42. S. Cicerone and G. Di Stefano. On the equivalence in complexity among basic problems on bipartite and parity graphs. In 8th International Symposium on Algorithms and Computation (ISAAC’97) , volume 1350 of Lecture Notes in Computer Science , pages 354--363. Springer-Verlag, December 1997.
  43. G. Di Stefano. A routing algorithm for networks based on distance-hereditary topologies. In Proceedings of SIROCCO ’96 - 3rd International Colloquium on Structural Information and Communication Complexity , Siena - Italy, 1996.
  44. G. Califano, G. Di Stefano, G. Fabrizi, G. Russo, and L. Sponta. Performance analysis of threshold neurons with discrete weights. In Proceedings of TAINN ’96 - 5th Turkish Symposium on Artificial Intelligence and Neural Networks , pages 24--33, Istanbul, Turkey, 1996.
  45. S. Cicerone and G. Di Stefano. Graph classes between parity and distance-hereditary graphs. In 1st Discrete Mathematics and Theoretical Computer Science (DMTCS’96) , Combinatorics, Complexity, and Logic, pages 168--181. Springer-Verlag, 1996.
  46. G. Di Stefano, G. Fabrizi, and L. Sponta. Consequences of limitation on weights in feed-forward multi-layer neural networks. In Proceedings of ANNIE’95 - Artificial Neural Networks in Engineering , St. Louis, 1995.
  47. G.C. Cardarilli, G. Di Stefano, G. Fabrizi, and P. Marinucci. Analysis and implementation of a vlsi neural network. In Proceedings of ICNN’95 - IEEE International Conference on Neural Networks , Perth, Australia, 1995.
  48. G. Di Stefano. New results for neural networks and genetic algorithms in visual field diagnosis. In Proceedings of ANNIE’94 - Artificial Neural Networks in Engineering , St. Louis, 1994.
  49. G. Di Stefano, M.V. Marabello, and A. D’Atri. An application of the MILORD system to handle radiological data. Advances in Database Systems, Implementations and Applications . Springer, 1994.
  50. A. Bernabei, A. D’Atri, and G. Di Stefano. A multimodal interface for a medical workstation. In Proceedings of Interface to Real \& Virtual Worlds - International Conference , Montpellier, 1994.
  51. A. D’Atri, G. Di Stefano, L. Tarantino, N. Ailamaki, D. Anestopoulos, S. Argyropoulos, F. Staes, and D. Vermeir. Milord: Advanced database technology for implementing a multimedia medical workstation. In Proceedings of IMAC - Annual International Conference , Berlin, 1993.
  52. G. Di Stefano. An Extension to the Back-Propagation Algorithm. In Proceedings of New Trends in Neural Networks - International Symposium , Ghent, Belgium, 1992.
  53. G. Di Stefano, M. Capozza, and N. Accornero. Neural Networks Trained by a Genetic Algorithm for Visual Field Diagnosis. In Proceedings of 14th Annual International Conference of the IEEE Engeneering in Medicine \& Biology Society , Paris, 1992.
  54. A. Agnifili, G. Di Stefano, P. Pavone, C. Buoni, and R. Passariello. An electronic system for integrated management of patients’ data and radiological images. In Proceedings of IEEE Engineering in Medicine \& Biology Society - 11th Annual International Conference , pages 1916--1917, Seattle, Washington, 1989. IEEE-EMBS Press.
  55. A. Agnifili, G. Di Stefano, G. Salcito, M. Ardito, and R. Passariello. A workstation for image processing and digitalization of conventional films. In Proceedings of RSNA ’89 , Chicago, 1989. Radiologic Society North America.
  56. A. Agnifili, G. Di Stefano, G. Salcito, and R. Passariello. Functional integration of digital radiological equipment. In Proceedings of RSNA ’89 , Chicago, 1989. Radiologic Society North America.

Tesi di Dottorato

  1. G. Di Stefano. Reti Neurali per Diagnosi Automatica di Campi Visivi . PhD thesis, Università La Sapienza - Roma, 1993.