Publications of year 1985

1. B. Reed. A note on the semistrong perfect graph conjecture. Discrete Math., 54(1):111--112, 1985.
   

   @article {MR787499,
   AUTHOR = {Reed, B.},
   TITLE = {A note on the semistrong perfect graph conjecture},
   JOURNAL = {Discrete Math.},
   VOLUME = {54},
   YEAR = {1985},
   NUMBER = {1},
   PAGES = {111--112},
   
   }
   

1. J.-C. Bermond and G. Memmi. A graph theoretical characterization of minimal deadlocks in Petri nets. In Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), Wiley-Intersci. Publ., New York, pages 73--87, 1985. Wiley.
   

   @inproceedings{MR812658,
   AUTHOR = {Bermond, J.-C. and Memmi, G.},
   TITLE = {A graph theoretical characterization of minimal deadlocks in {P}etri nets},
   BOOKTITLE = {Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984)},
   SERIES = {Wiley-Intersci. Publ.},
   PAGES = {73--87},
   PUBLISHER = {Wiley},
   ADDRESS = {New York},
   YEAR = {1985},
   
   }
   



2. A. Ferreira. Algoritmos heurìsticos para otimização de PLA's. In Proceedings of the 5th Brazilian Symposium of Microelectronics, 1985. University of São Paulo Press.
   

   @INPROCEEDINGS{pla1:cn,
   AUTHOR = {A. Ferreira},
   BOOKTITLE = {Proceedings of the 5th Brazilian Symposium of Microelectronics},
   KEY = {qf-congnat},
   PUBLISHER = {University of S\~ao Paulo Press},
   TITLE = {{Algoritmos heur{\'\i}sticos para otimiza{\c c\~ao} de {PLA's}}},
   YEAR = {1985},
   
   }
   



3. W. Jalby, J. Maillard, and P. Mussi. Evaluation of Parallel Execution of Program Tree Structures. In Parallel Computing 85, pages 279--285, 1985.
   

   @inproceedings{JaMaMu85,
   author = {W. Jalby and J. Maillard and P. Mussi},
   booktitle = {Parallel Computing 85},
   pages = 279--285,
   title = {Evaluation of Parallel Execution of Program Tree Structures},
   year = {1985},
   
   }
   

This document was translated from BibT_EX by bibtex2html