A cutting plane algorithm for a clustering problem M Grötschel, Y Wakabayashi Mathematical Programming 45, 59-96, 1989 | 456 | 1989 |
Facets of the clique partitioning polytope M Grötschel, Y Wakabayashi Mathematical Programming 47, 367-387, 1990 | 251 | 1990 |
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation GF Cintra, FK Miyazawa, Y Wakabayashi, EC Xavier European Journal of Operational Research 191 (1), 61-85, 2008 | 193 | 2008 |
Aggregation of binary relations: algorithmic and polyhedral investigations Y Wakabayashi PhD thesis, Universität Augsburg, 1986 | 108 | 1986 |
Uma introdução sucinta à teoria dos grafos P Feofiloff, Y Kohayakawa, Y Wakabayashi | 98 | 2011 |
The complexity of computing medians of relations Y Wakabayashi Resenhas do Instituto de Matemática e Estatística da Universidade de São …, 1998 | 96 | 1998 |
An algorithm for the three-dimensional packing problem with asymptotic performance analysis FK Miyazawa, Y Wakabayashi Algorithmica 18 (1), 122-144, 1997 | 77 | 1997 |
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing TA De Queiroz, FK Miyazawa, Y Wakabayashi, EC Xavier Computers & Operations Research 39 (2), 200-212, 2012 | 65 | 2012 |
On dominating sets of maximal outerplanar graphs CN Campos, Y Wakabayashi Discrete Applied Mathematics 161 (3), 330-335, 2013 | 63 | 2013 |
Approximation algorithms for the orthogonal z-oriented three-dimensional packing problem FK Miyazawa, Y Wakabayashi SIAM Journal on Computing 29 (3), 1008-1029, 2000 | 60 | 2000 |
Approximation and inapproximability results on balanced connected partitions of graphs F Chataigner, LRB Salgado, Y Wakabayashi Discrete Mathematics & Theoretical Computer Science 9 (Graph and Algorithms), 2007 | 56 | 2007 |
Repetition-free longest common subsequence SS Adi, MDV Braga, CG Fernandes, CE Ferreira, FV Martinez, MF Sagot, ... Discrete Applied Mathematics 158 (12), 1315-1324, 2010 | 50 | 2010 |
The maximum agreement forest problem: Approximation algorithms and computational experiments EM Rodrigues, MF Sagot, Y Wakabayashi Theoretical Computer Science 374 (1-3), 91-110, 2007 | 49 | 2007 |
Packing squares into squares CE Ferreira, FK Miyazawa, Y Wakabayashi Pesquisa Operacional 19 (2), 223-237, 1999 | 47 | 1999 |
Packing problems with orthogonal rotations FK Miyazawa, Y Wakabayashi Latin American Symposium on Theoretical Informatics, 359-368, 2004 | 44 | 2004 |
Three-dimensional packings with rotations FK Miyazawa, Y Wakabayashi Computers & Operations Research 36 (10), 2801-2815, 2009 | 42 | 2009 |
Combinatória poliédrica e planos-de-corte faciais CE Ferreira, Y Wakabayashi UNICAMP-Instituto de Computacao, 1996 | 42 | 1996 |
Intersecting longest paths SF De Rezende, CG Fernandes, DM Martin, Y Wakabayashi Discrete Mathematics 313 (12), 1401-1408, 2013 | 35* | 2013 |
Uma introduçao sucinta a algoritmos de aproximaçao MH Carvalho, MR Cerioli, R Dahab, P Feofiloff, CG Fernandes, ... Publicações Matemáticas do IMPA, 2001 | 34* | 2001 |
Some approximation results for the maximum agreement forest problem EM Rodrigues, MF Sagot, Y Wakabayashi International Workshop on Randomization and Approximation Techniques in …, 2001 | 32 | 2001 |