2008 |
24 | EE | Luis A. A. Meira,
Flávio Keidi Miyazawa:
A continuous facility location problem and its application to a clustering problem.
SAC 2008: 1826-1831 |
23 | EE | Daniel M. Batista,
Nelson L. S. Da Fonseca,
Flávio Keidi Miyazawa,
Fabrizio Granelli:
Self-adjustment of resource allocation for grid applications.
Computer Networks 52(9): 1762-1781 (2008) |
22 | EE | E. C. Xavier,
Flávio Keidi Miyazawa:
A one-dimensional bin packing problem with shelf divisions.
Discrete Applied Mathematics 156(7): 1083-1096 (2008) |
21 | EE | G. F. Cintra,
Flávio Keidi Miyazawa,
Yoshiko Wakabayashi,
E. C. Xavier:
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation.
European Journal of Operational Research 191(1): 61-85 (2008) |
20 | EE | E. C. Xavier,
Flávio Keidi Miyazawa:
The class constrained bin packing problem with applications to video-on-demand.
Theor. Comput. Sci. 393(1-3): 240-259 (2008) |
2007 |
19 | EE | Daniel M. Batista,
Nelson L. S. Da Fonseca,
Flávio Keidi Miyazawa:
A set of schedulers for grid networks.
SAC 2007: 209-213 |
18 | EE | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
Two- and three-dimensional parametric packing.
Computers & OR 34(9): 2589-2603 (2007) |
17 | EE | G. F. Cintra,
Flávio Keidi Miyazawa,
Yoshiko Wakabayashi,
E. C. Xavier:
A note on the approximability of cutting stock problems.
European Journal of Operational Research 183(3): 1328-1332 (2007) |
2006 |
16 | EE | E. C. Xavier,
Flávio Keidi Miyazawa:
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand.
COCOON 2006: 439-448 |
15 | EE | E. C. Xavier,
Flávio Keidi Miyazawa:
Approximation schemes for knapsack problems with shelf divisions.
Theor. Comput. Sci. 352(1-3): 71-84 (2006) |
2005 |
14 | EE | Evandro C. Bracht,
Luis A. A. Meira,
Flávio Keidi Miyazawa:
A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique.
ACM Journal of Experimental Algorithmics 10: (2005) |
13 | EE | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
Two- and three-dimensional parametric packing.
Electronic Notes in Discrete Mathematics 19: 313-319 (2005) |
12 | EE | E. C. Xavier,
Flávio Keidi Miyazawa:
A one-dimensional bin packing problem with shelf divisions.
Electronic Notes in Discrete Mathematics 19: 329-335 (2005) |
2004 |
11 | EE | Silvana Livramento,
Arnaldo V. Moura,
Flavio Keidi Miyazawa,
Mário M. Harada,
Rogério A. Miranda:
A Genetic Algorithm for Telecommunication Network Design.
EvoWorkshops 2004: 140-149 |
10 | EE | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
Packing Problems with Orthogonal Rotations.
LATIN 2004: 359-368 |
9 | EE | Evandro C. Bracht,
Luis A. A. Meira,
Flavio Keidi Miyazawa:
A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique.
WEA 2004: 145-158 |
8 | EE | Yoshiharu Kohayakawa,
Flávio Keidi Miyazawa,
Prabhakar Raghavan,
Yoshiko Wakabayashi:
Multidimensional Cube Packing.
Algorithmica 40(3): 173-187 (2004) |
2003 |
7 | EE | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
Parametric on-line algorithms for packing rectangles and boxes.
European Journal of Operational Research 150(2): 281-292 (2003) |
6 | EE | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
Cube packing.
Theor. Comput. Sci. 297(1-3): 355-366 (2003) |
2001 |
5 | EE | Yoshiharu Kohayakawa,
Flávio Keidi Miyazawa,
Prabhakar Raghavan,
Yoshiko Wakabayashi:
Multidimensional Cube Packing.
Electronic Notes in Discrete Mathematics 7: 110-113 (2001) |
2000 |
4 | | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
Cube Packing.
LATIN 2000: 58-67 |
3 | | Alexandre X. Falcão,
Jayaram K. Udupa,
Flávio Keidi Miyazawa:
An Ultra-Fast User-Steered Image Segementation Paradigm: Live-Wire-On-The-Fly.
IEEE Trans. Med. Imaging 19(1): 55-62 (2000) |
1999 |
2 | | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.
SIAM J. Comput. 29(3): 1008-1029 (1999) |
1997 |
1 | | Flávio Keidi Miyazawa,
Yoshiko Wakabayashi:
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.
Algorithmica 18(1): 122-144 (1997) |