The SCEAS System
| |||||||

## Search the dblp DataBase
Yoshiko Wakabayashi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Orlando Lee, Yoshiko Wakabayashi
**Circuit Covers in Series-Parallel Mixed Graphs.**[Citation Graph (0, 0)][DBLP] LATIN, 1998, pp:226-238 [Conf] - Flávio Keidi Miyazawa, Yoshiko Wakabayashi
**Cube Packing.**[Citation Graph (0, 0)][DBLP] LATIN, 2000, pp:58-67 [Conf] - Flávio Keidi Miyazawa, Yoshiko Wakabayashi
**Packing Problems with Orthogonal Rotations.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:359-368 [Conf] - Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
**Some Approximation Results for the Maximum Agreement Forest Problem.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2001, pp:159-169 [Conf] - José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
**Approximating Rational Objectives Is as Easy as Approximating Linear Ones.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:351-362 [Conf] - Glauber Cintra, Yoshiko Wakabayashi
**Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems.**[Citation Graph (0, 0)][DBLP] WEA, 2004, pp:175-190 [Conf] - Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi
**Multidimensional Cube Packing.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:3, pp:173-187 [Journal] - Flávio Keidi Miyazawa, Yoshiko Wakabayashi
**An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:18, n:1, pp:122-144 [Journal] - Orlando Lee, Yoshiko Wakabayashi
**On The Circuit Cover Problemfor Mixed Graphs**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2002, v:11, n:1, pp:- [Journal] - C. E. Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi
**Rearrangement of DNA fragments: a branch-and-cut algorithm.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:161-177 [Journal] - Martin Grötschel, Yoshiko Wakabayashi
**Facets of the Clique Partitioning Polytope.**[Citation Graph (0, 0)][DBLP] Math. Program., 1990, v:47, n:, pp:367-387 [Journal] - Flávio Keidi Miyazawa, Yoshiko Wakabayashi
**Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:3, pp:1008-1029 [Journal] - Flávio Keidi Miyazawa, Yoshiko Wakabayashi
**Cube packing.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:297, pp:355-366 [Journal] - Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
**The maximum agreement forest problem: Approximation algorithms and computational experiments.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:91-110 [Journal] - Flávio Keidi Miyazawa, Yoshiko Wakabayashi
**Parametric on-line algorithms for packing rectangles and boxes.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:150, n:2, pp:281-292 [Journal] - Martin Grötschel, Yoshiko Wakabayashi
**On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:34, n:1, pp:43-59 [Journal] - Maria Angela C. M. Gurgel, Yoshiko Wakabayashi
**Adjacency of vertices of the complete pre-order polytope.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:175, n:1-3, pp:163-172 [Journal] **A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.**[Citation Graph (, )][DBLP]**A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.**[Citation Graph (, )][DBLP]**Two- and three-dimensional parametric packing.**[Citation Graph (, )][DBLP]**Three-dimensional packings with rotations.**[Citation Graph (, )][DBLP]**Preface.**[Citation Graph (, )][DBLP]**Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.**[Citation Graph (, )][DBLP]**Approximation algorithms and hardness results for the clique packing problem.**[Citation Graph (, )][DBLP]**Repetition-free longest common subsequence.**[Citation Graph (, )][DBLP]**Packing triangles in low degree graphs and indifference graphs.**[Citation Graph (, )][DBLP]**Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs.**[Citation Graph (, )][DBLP]
Search in 0.041secs, Finished in 0.043secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |