@techreport{TR-DCC-95-17, number = {DCC-95-17}, author = {Poggi de Aragão, Marcus V. S. and de Souza (eds.), Cid C.}, title = {Anais da {II} {O}ficina {N}acional em {P}roblemas {C}ombinatórios: {T}eoria, {A}lgoritmos e {A}plicações}, month = {November}, year = {1995}, institution = {Department of Computer Science, University of Campinas}, note = {Partly in English, partly in Portuguese, 58 pages. \par\selectlanguage{english}\textbf{Abstract} This report contains the Proceedings of the II National Workshop on Combinatorial Problems: Theory, Algorithms and Applications (II ON ProComb). The workshop was held November 15--17, 1995 at the Computer Science Department (DCC-IMECC) of the State University of Campinas (UNICAMP), Campinas, SP, Brazil. \par The event was part of the ProComb project, comprising combinatorics researchers from USP (DCC-IME), UNICAMP (DCC-IMECC), PUC-RJ and UFRJ (DI and DEE). The project is sponsored by CNPq though its Multi-institutional Thematic Program in Computer Science (ProTeM-CC-II). \par \begin{itemize} \item {\em A pretty class of perfect graphs.} Frédéric Maffray, Oscar Porto, and Myriam Preissman. \item {\em A scalable parallel algorithm for list ranking.} Frank Dehne and Siang W.~Song. \item {\em The homogeneous set sandwich problem.} Hazel Everett, Celina M.~H.~Figueiredo, Sulamita Klein, and Márcia Cerioli. \item {\em Local conditions for edge-coloring.} Celina M.~H.~Figueiredo, João Meidanis, and Célia P.~de Mello. \item {\em Uma adaptação do algoritmo de emparelhamento de Edmonds para execução em paralelo.} Carlos F.~Bella Cruz and João Carlos Setubal. \item {\em Upper bounds for minimum covering codes by tabu-search.} Walter A.~Carnielli, Emerson L.~do Monte Carmelo, Marcus V.~S.~Poggi de Aragão and Cid C.~de Souza. \end{itemize} } }