University of São Paulo (USP), Institute of Mathematics and Statistics, São Paulo, Brazil
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j37 | C. N. Campos, Yoshiko Wakabayashi: On dominating sets of maximal outerplanar graphs. Discrete Applied Mathematics 161(3): 330-335 (2013) | |
| j36 | Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi: Intersecting longest paths. Discrete Mathematics 313(11): 1401-1408 (2013) | |
| 2012 | ||
| j35 | Thiago A. de Queiroz, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, Eduardo C. Xavier: Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Computers & OR 39(2): 200-212 (2012) | |
| c9 | Rafael da Ponte Barbosa, Yoshiko Wakabayashi: A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem. LATIN 2012: 49-60 | |
| 2011 | ||
| j34 | Karla Roberta Lima, Yoshiko Wakabayashi: Convex Recoloring of Paths. Electronic Notes in Discrete Mathematics 37: 165-170 (2011) | |
| j33 | Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi: Selfish Square Packing. Electronic Notes in Discrete Mathematics 37: 369-374 (2011) | |
| j32 | Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi: Intersection of Longest Paths in a Graph. Electronic Notes in Discrete Mathematics 38: 743-748 (2011) | |
| 2010 | ||
| j31 | Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi: Repetition-free longest common subsequence. Discrete Applied Mathematics 158(12): 1315-1324 (2010) | |
| j30 | José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi: Approximating a class of combinatorial problems with rational objective function. Math. Program. 124(1-2): 255-269 (2010) | |
| 2009 | ||
| j29 | Flavio Keidi Miyazawa, Yoshiko Wakabayashi: Three-dimensional packings with rotations. Computers & OR 36(10): 2801-2815 (2009) | |
| j28 | Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi: Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics 157(2): 272-279 (2009) | |
| j27 | Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster: Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics 157(7): 1396-1406 (2009) | |
| 2008 | ||
| j26 | Paulo Feofiloff, Celina M. Herrera de Figueiredo, Yoshiko Wakabayashi: Preface. Discrete Applied Mathematics 156(7): 985 (2008) | |
| j25 | Gordana Manic, Yoshiko Wakabayashi: Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics 308(8): 1455-1471 (2008) | |
| j24 | Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi: Repetition-free longest common subsequence. Electronic Notes in Discrete Mathematics 30: 243-248 (2008) | |
| j23 | 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) | |
| c8 | Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi: A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN 2008: 329-338 | |
| 2007 | ||
| j22 | Flávio Keidi Miyazawa, Yoshiko Wakabayashi: Two- and three-dimensional parametric packing. Computers & OR 34(9): 2589-2603 (2007) | |
| j21 | Yoshiko Wakabayashi, Frédéric Chataigner, Liliane Benning Salgado: Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs. Discrete Mathematics & Theoretical Computer Science 9(1) (2007) | |
| j20 | Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster: Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics 29: 397-401 (2007) | |
| j19 | 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) | |
| j18 | Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi: The maximum agreement forest problem: Approximation algorithms and computational experiments. Theor. Comput. Sci. 374(1-3): 91-110 (2007) | |
| c7 | José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi: A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. WAOA 2007: 184-192 | |
| 2006 | ||
| c6 | José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi: Approximating Rational Objectives Is as Easy as Approximating Linear Ones. SWAT 2006: 351-362 | |
| 2005 | ||
| j17 | Paulo Feofiloff, Celina M. Herrera de Figueiredo, Yoshiko Wakabayashi: Preface. Electronic Notes in Discrete Mathematics 19: 1-7 (2005) | |
| j16 | Flávio Keidi Miyazawa, Yoshiko Wakabayashi: Two- and three-dimensional parametric packing. Electronic Notes in Discrete Mathematics 19: 313-319 (2005) | |
| j15 | ||
| 2004 | ||
| j14 | Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi: Multidimensional Cube Packing. Algorithmica 40(3): 173-187 (2004) | |
| j13 | Liliane R. B. Salgado, Yoshiko Wakabayashi: Approximation Results on Balanced Connected Partitions of Graphs. Electronic Notes in Discrete Mathematics 18: 207-212 (2004) | |
| c5 | Flávio Keidi Miyazawa, Yoshiko Wakabayashi: Packing Problems with Orthogonal Rotations. LATIN 2004: 359-368 | |
| c4 | Glauber Cintra, Yoshiko Wakabayashi: Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. WEA 2004: 175-190 | |
| 2003 | ||
| j12 | 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) | |
| j11 | Flávio Keidi Miyazawa, Yoshiko Wakabayashi: Cube packing. Theor. Comput. Sci. 297(1-3): 355-366 (2003) | |
| 2002 | ||
| j10 | Orlando Lee, Yoshiko Wakabayashi: On The Circuit Cover Problemfor Mixed Graphs. Combinatorics, Probability & Computing 11(1): 43-59 (2002) | |
| j9 | Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi: Rearrangement of DNA fragments: a branch-and-cut algorithm. Discrete Applied Mathematics 116(1-2): 161-177 (2002) | |
| 2001 | ||
| j8 | Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi: Multidimensional Cube Packing. Electronic Notes in Discrete Mathematics 7: 110-113 (2001) | |
| j7 | Orlando Lee, Yoshiko Wakabayashi: Note on a min-max conjecture of Woodall. Journal of Graph Theory 38(1): 36-41 (2001) | |
| c3 | Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi: Some Approximation Results for the Maximum Agreement Forest Problem. RANDOM-APPROX 2001: 159-169 | |
| 2000 | ||
| c2 | ||
| 1999 | ||
| j6 | 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) | |
| 1998 | ||
| c1 | Orlando Lee, Yoshiko Wakabayashi: Circuit Covers in Series-Parallel Mixed Graphs. LATIN 1998: 226-238 | |
| 1997 | ||
| j5 | Flávio Keidi Miyazawa, Yoshiko Wakabayashi: An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis. Algorithmica 18(1): 122-144 (1997) | |
| j4 | Maria Angela C. M. Gurgel, Yoshiko Wakabayashi: Adjacency of vertices of the complete pre-order polytope. Discrete Mathematics 175(1-3): 163-172 (1997) | |
| 1990 | ||
| j3 | Martin Grötschel, Yoshiko Wakabayashi: Facets of the Clique Partitioning Polytope. Math. Program. 47: 367-387 (1990) | |
| 1986 | ||
| j2 | Maria Angela C. M. Gurgel, Yoshiko Wakabayashi: On k-leaf-connected graphs. J. Comb. Theory, Ser. B 41(1): 1-16 (1986) | |
| 1981 | ||
| j1 | Martin Grötschel, Yoshiko Wakabayashi: On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discrete Mathematics 34(1): 43-59 (1981) | |
Data released under the ODC-BY 1.0 license — See also our legal information page