Artigos Arbitrados

F.K. Miyazawa and Y. Wakabayashi, Cube Packing, Theoretical Computer Science, to appear.

O. Lee and Y. Wakabayashi, On the Circuit Cover Problem for Mixed Graphs, Combinatorics, Probability and Computing, to appear.

C.E. Ferreira and C.C. Souza and Y. Wakabayashi, Rearrangement of DNA fragments: a branch-and-cut algorithm. Discrete Applied Mathematics, to appear.

F.K. Miyazawa and Y. Wakabayashi, Cube packing. Proceedings of LATIN'2000: theoretical informatics (Punta del Este, Uruguay. April, 2000), Lecture Notes in Computer Science, vol. 1776 (2000), 58-67.

F.K. Miyazawa and Y. Wakabayashi, Approximation Algorithms for the Orthogonal z-oriented 3-D Packing Problem, SIAM Journal on Computing, 29(3) (2000) 1008-1029.

C.E. Ferreira and F.K. Miyazawa and Y. Wakabayashi, Packing Squares into Squares, Pesquisa Operacional, 19(2) (1999), to appear.

O. Lee and Y. Wakabayashi, Circuit Covers in Series-Parallel Mixed Graphs, Proceedings of LATIN'98. Lecture Notes in Computer Science, vol. 1380 (1998), 226-238.

M.A.C.M. Gurgel and Y. Wakabayashi, Adjacency of vertices of the complete pre-order polytope, Discrete Mathematics 175 (1997), no. 1-3, 163-172.

F.K. Miyazawa and Y. Wakabayashi, An algorithm for the three-dimensional packing problem with asymptotic performance analysis, Algorithmica 18 (1997), no. 1, 122-144.

M. Grötschel and Y. Wakabayashi, Facets of the Clique Partitioning Polytope, Mathematical Programming A, 47(1990) 367-387.

M. Grötschel and Y. Wakabayashi, Composition of Facets of the Clique Partitioning Polytope, in: Topics in Combinatorics and Graph Theory R. Bodendieck, R. Henn (eds.), Physica-Verlag, Heidelberg (1990), 271-284.

Y. Wakabayashi, Adjacency of vertices on the Clique Partitioning Polytope, SCIENTIA, Series A : Mathematical Sciences Vol. 3 (1989), 111-119 - Univ. Técnica Federico Santa Maria, Valparaíso, Chile.

M. Grötschel and Y. Wakabayashi, A Cutting Plane Algorithm for a Clustering Problem, Mathematical Programming B, 45(1989) 52-96.

M.A.C.M. Gurgel and Y. Wakabayashi, On k-leaf-connected Graphs, Journal of Combinatorial Theory, Series B, 41(1986) 1-16.

M.A.C.M. Gurgel and Y. Wakabayashi, Embedding of Trees, in: Mathematical Programming, R.W. Cottle et al (eds.), North-Holland, Amsterdam, 1984, pp. 177-184.

M. Grötschel and Y. Wakabayashi, Constructions of Hypotraceable Digraphs, in: Mathematical Programming, R.W. Cottle et al (eds.), North-Holland, Amsterdam, 1984, pp. 147-175.

M. Grötschel and Y. Wakabayashi, On the Structure of the Monotone Asymmetric Travelling Salesman Polytope I: Hypohamiltonian Facets, Discrete Mathematics 34(1981) 43-59.

M. Grötschel and Y. Wakabayashi, On the Structure of the Monotone Asymmetric Travelling Salesman Polytope II: Hypotraceable Facets, Mathematical Programming Study 14(1981) 77-97.

M. Grötschel and Y. Wakabayashi, Hypohamiltonian Digraphs, Methods of Operations Research 36(1980) 99-119.

M. Grötschel, C. Thomassen and Y. Wakabayashi, Hypotraceable Digraphs, Journal of Graph Theory 4(1980) 377-381.