Miscelâneas

Y. Wakabayashi, The complexity of computing medians of relations. Resenhas, 3 (3) (1998), 323-349.

O. Lee and Y. Wakabayashi, Circuit Covers in Series-parallel Mixed Graphs. Proceedings of the XVI International Symposium on Mathematical Programming, pp. 276, Lausanne, Suiça, 1997 (abstract).

F.K. Miyazawa and Y. Wakabayashi, Approximation Algorithms for Packing Problems with Orthogonal Rotations. Proceedings of the XVI International Symposium on Mathematical Programming, pp. 182, Lausanne, Suiça, 1997 (abstract).

C.E. Ferreira, C.C. de Souza and Y. Wakabayashi, A Polyhedral Approach for DNA Fragments Arrangement . Proceedings of the XVI International Symposium on Mathematical Programming, pp. 88, Lausanne, Suiça, 1997 (abstract).

F.K. Miyazawa and Y. Wakabayashi, Approximation Algorithms for Packing Small Itens, Anais da II Oficina Nacional de Problemas de Cortes e Empacotamento, 1997, 7-14 - XX Congresso de Matemática Aplicada e Computacional.

C.E. Ferreira and C.C. de Souza and Y. Wakabayashi, Rearrangement of DNA fragments: a branch-and-cut algorithm, Proceedings of the Second Workshop on Solving Practical Combinatorial Optimization Problems, Valparaíso, Chile, nov/96.

C.E. Ferreira, C.C. de Souza and Y. Wakakabayashi, Reconstruction of DNA Fragments: a graph model, Anais do XVIII Congresso de Matemática Aplicada e Computacional, 1995, 90-94.

O. Lee and Y. Wakakabayashi, Caminhos Mínimos em Grafos Mistos , Anais do XVIII Congresso de Matemática Aplicada e Computacional, 1995, 329-333.

C.E. Ferreira and Y. Wakabayashi (eds) Anais da I Oficina Nacional em Problemas Combinatórios, Algoritmos e Aplicações, USP, fevereiro de 1995, Relatório Técnico RT-MAC-9515

F.K. Miyazawa and Y. Wakabayashi, Algorithms for 3-dimensional Packing Problems with Asymptotic Performance Analysis. Proceedings of the XV International Symposium on Mathematical Programming, Ann Arbor, Michigan, 1994 (abstract).

M.A.C.M. Gurgel and Y. Wakabayashi, The Complete Pre-order Polytope . Proceedings of the XV International Symposium on Mathematical Programming, Ann Arbor, Michigan, 1994 (abstract).

Y. Wakabayashi, Medians of Binary Relations: Computational Complexity Technical Report SC/1992 - Konrad Zuse Zentrum für Informationstechnik Berlin.

Y. Wakakabayashi, Partição de um Conjunto em Classes Homogêneas: Algoritmo e Aplicações. Anais do X Congresso de Matemática Aplicada e Computacional, Gramado, 1987.

Y. Wakabayashi, Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations, Tese de Doutorado, Universität Augsburg, Alemanha, 1986.

M.A.C.M. Gurgel and Y. Wakabayashi, A Result on Hamilton-connected Graphs, Tech. Report 83309-OR, Institut für Operations Research, Universität Bonn, 1983.

Y. Wakabayashi, Sobre Grafos Hamiltonianos, dissertação de mestrado, Instituto de Matemática e Estatística da Universidade de São Paulo, 1977.