### Publications

#### Textbooks

• P. Feofiloff, Y. Kohayakawa e Y. Wakabayashi, Uma Introdução Sucinta à Teoria dos Grafos (pdf), texto redigido para minicurso na II Bienal da SBM (Sociedade Brasileira de Matemática), realizado em Salvador, outubro de 2004. Página do texto.

• M.H. Carvalho, M.R. Cerioli, R. Dahab, P. Feofiloff, C.G. Fernandes, C.E. Ferreira, K.S. Guimarães, F.K. Miyazawa, J.C. Pina Jr., J. Soares, Y. Wakabayashi, Uma Introdução Sucinta a Algoritmos de Aproximação (pdf), Publicações Matemáticas do IMPA, 2001 Página do livro - Colóquio Brasileiro de Matemática, 2001.

• C.E. Ferreira and Y. Wakabayashi, Planos-de-corte Faciais e a Resolução de Problemas de Otimização Combinatória -- texto para o I Encontro de Matemática Aplicada e Computacional, ERMAC, 1998.

• C.E. Ferreira and Y. Wakabayashi, Combinatória Poliédrica e Planos-de-Corte Faciais, livro para a X Escola de Computação, UNICAMP, julho de 1996.

#### Book Chapters

T. Kowaltowski, A. Mandel e Y. Wakabayashi, capítulo sobre Imre Simon, livro Humanistas e Cientistas do Brasil: Ciências Exatas, editado por Luiz Edmundo de Magalhães, EDUSP, ISBN 10: 85-314-1529-2, ISBN 13: 978-85-314-1529-6 (2015), 216 pp.

• R. da Ponte Barbosa and Y. Wakabayashi, Algorithms for scheduling sensors to maximize coverage time, chapter of Facets of Combinatorial Optimization - Festschrift for Martin Groetschel, Springer, 2013, pp 195-214 -- ISBN 978-3-642-38189-8, DOI: 10.1007/978-3-642-38189-8_9, Springerlink: http://link.springer.com/chapter/10.1007/978-3-642-38189-8_9

• M.-F. Sagot and Y. Wakabayashi, Pattern Inference under many Guises, chapter of Recent Advances in Algorithms and Combinatorics, 245-287, Springer-Verlag, New York, 2003. (ISBN: 0387954341 - 368 pages - http://www.springer.de/search97cgi/s97_cgi) Mini-course of CIMPA School on Algorithms and Combinatorics, 12-16 and 21-24 of March, 2001, Fortaleza, Ceará, Brazil.

• 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.

• 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.

#### Journals

• R. Gómez, F.K. Miyazawa and Y. Wakabayashi, Sparse spanners on subcubic graphs: algorithmic and polyhderal results, submitted.

• R. Gómez, F.K. Miyazawa and Y. Wakabayashi, Improved NP-hardness results for the minimum $t$-spanner problem on bounded degree graphs, submitted.

• F. Botler, A. Jiménez, M. Sambinelli and Y. Wakabayashi, On the structure of a smallest counterexample and a new class verifying the 2-Decomposition Conjecture, submitted.

• P.F.S. Moura, M.J. Ota and Y. Wakabayashi, Balanced connected partitions of graphs: approximation, parameterization and lower bounds, submitted. [Preliminary arxiv version: Approximation and parameterized algorithms to find balanced connected partitions of graphs. (arXiv version)]

• F.K. Miyazawa and Y. Wakabayashi, Techniques and results on approximation algorithms for packing circles, São Paulo Journal of Mathematical Sciences 16, pages 585-615 (2022) -- Special issue commemorating the Golden Jubilee of the Institute of Mathematics and Statistics of the University of São Paulo, 2022 -- DOI (available online).

• Y. Kohayakawa, F.K. Miyazawa and Y. Wakabayashi, A tight lower bound for the online bounded space hypercube bin packing problem, Discrete Mathematics and Theoretical Computer Science, vol 23 (3), #7, 2021. DOI

• Flávio K. Miyazawa, Phablo F.S. Moura, Matheus J. Ota and Yoshiko Wakabayashi, Partitioning a graph into balanced connected classes: formulations, separation and experiments, European Journal of Operational Research, Volume 293, Issue 3 (2021), pp 826--836. DOI. (Preliminary arXiv version)

• R. Gómez and Y. Wakabayashi, Nontrivial path covers of graphs: existence, minimization and maximization, Journal of Combinatorial Optimization, Volume 39 (2), 437-456 (2020). DOI

• Y. Kohayakawa, F.K. Miyazawa and Y. Wakabayashi, A tight lower bound for a hypercube bin packing problem and prices of anarchy of a related game (arXiv version)

• P.F.S. Moura and Y. Wakabayashi, Strong intractability results for generalized convex recoloring problems, Discrete Appl. Math., Vol. 281 (2020), pp. 252-260. DOI

• C.G. Fernandes, C.E. Ferreira, F.K. Miyazawa and Y. Wakabayashi, Prices of anarchy of selfish 2D bin packing games, International Journal of Foundations of Computer Science, Vol. 30, No. 03, pp. 355-374 (2019). DOI (Preliminary arXiv version)

• F. Botler, G.O. Mota, M.T.I. Oshiro and Y. Wakabayashi, Decompositions of highly connected graphs into paths of length five, Discrete Appl. Math. 245 (2018), 128-138. DOI

• R.S. Coelho, P.F.S. Moura and Y. Wakabayashi, The $k$-hop connected dominating set problem: approximation and hardness, Journal of Combinatorial Optimization, Volume 34, Issue 4, pp 1060–1083 (2017). DOI

• F. Botler, G.O. Mota, M.T.I. Oshiro and Y. Wakabayashi, Decomposing regular graphs with prescribed girth into paths of given length, European Journal of Combinatorics, Vol. 66 (2017), p. 28-36. DOI

• A. Jiménez and Y. Wakabayashi, On path-cycle decompositions of triangle-free graphs, Discrete Mathematics & Theoretical Computer Science, Vol 19 no. 3 (2017).

• F. Botler, G.O. Mota, M.T.I. Oshiro and Y. Wakabayashi, Decomposing highly connected graphs into paths of any given length, Journal of Combinatorial Theory, series B 122 (2017), 508-542. DOI. (ArXiv Version)

• F.K. Miyazawa, L.L.C. Pedrosa, R. C.S. Schouery, M. Sviridenko and Y. Wakabayashi, Polynomial-time approximation schemes for circle and other packing problems, Algorithmica, Volume 76, Issue 2 (2016), 536-568. DOI

• M. Campêlo, A.S. Freire, K.R. Lima, P.F.S. Moura and Y. Wakabayashi, The convex recoloring problem: polyhedra, facets and computational experiments, Mathematical Programming, Series A, Volume 156, Issue 1 (2016), 303-330. DOI

• F. Botler, G.O. Mota and Y. Wakabayashi, Decompositions of triangle-free 5-regular graphs into paths of length five, Discrete Mathematics 338 (2015), pp. 1845-1855. DOI

• T.A. de Queiroz, F.K. Miyazawa and Y. Wakabayashi, On the L-approach for generating unconstrained two-dimensional non-guillotine patterns, 4OR-Q J Oper Res, Volume 13, Issue 2, 199-219 (2015), DOI

• M. L.-Rey and Y. Wakabayashi, Packing in generalized kernel systems: a framework that generalizes packing of branchings, Mathematical Programming, Series A, Volume 149, Issue 1 (2015), 209-251. DOI

• M. Campêlo, C. Huiban, R.M. Sampaio and Y. Wakabayashi, Hardness and inapproximability of convex recoloring problems, Theoretical Computer Science, Volume 533, 15-25 (2014). DOI: http://dx.doi.org/10.1016/j.tcs.2014.03.017.

• K.R. Lima and Y. Wakabayashi, Convex recoloring of paths, Discrete Appl. Math., 164 (2), 450-459 (2014). DOI: http://dx.doi.org/10.1016/j.dam.2013.02.034.

• S.F. de Rezende, C.G. Fernandes, D.M. Martin and Y. Wakabayashi, Intersecting longest paths, Discrete Math., Volume 313, Issue 12, 1401-1408 (2013). DOI: http://dx.doi.org/10.1016/j.disc.2013.02.016

• C.N. Campos and Y. Wakabayashi, On dominating sets of maximal outerplanar graphs, Discrete Appl. Math., 161 (3), 330--335 (2013). DOI: http://dx.doi.org/10.1016/j.dam.2012.08.023

• T.A. Queiroz, F.K. Miyazawa, Y. Wakabayashi and E.C. Xavier, Algorithms for 3D guillotine cutting stock problems: unbounded knapsack, cutting stock and strip packing, Computers and Operations Research, Volume 39, issue 2, pages 200-212 (2012).

• J.R. Correa, C.G. Fernandes and Y. Wakabayashi, Approximating a class of combinatorial problems with rational objective function, Mathematical Programming B, Volume 124, Issue 1-2, 255-269 (2010). DOI: 10.1007/s10107-010-0364-8.

• S. Adi, M.D.V. Braga, C.G. Fernandes, C.E. Ferreira, F.H.V. Martinez, M.-F Sagot, M.A. Stefanes, C. Tjandraatmadja and Y. Wakabayashi, Repetition-free longest common subsequence, Discrete Appl. Math., 158 (12), 1315-1324 (2010). DOI: http://dx.doi.org/10.1016/j.dam.2009.04.023.

• C.G. Fernandes, O. Lee and Y. Wakabayashi, The minimum cycle cover and the Chinese postman problems on mixed graphs with bounded tree-width, Discrete Appl. Math. 157 (2009) 272--279. DOI: http://dx.doi.org/10.1016/j.dam.2007.10.032 [pdf]

• F. K. Miyazawa and Y. Wakabayashi, Three-dimensional packings with rotations, Computers and Operations Research, vol. 36, Issue 10, 2801--2815, 2009.DOI: http://dx.doi.org/10.1016/j.cor.2008.12.015: [pdf]

• G. Manic and Y. Wakabayashi, Packing triangles in low degree graphs and indifference graphs, Discrete Mathematics, vol. 308 (2008), Issue 8, 1455-1471; DOI: http://dx.doi.org/10.1016/j.disc.2007.07.100: [pdf]

• F. Chataigner, G. Manic, Y.Wakabayashi and R. Yuster, Approximation algorithms and hardness results for the clique packing problem, Discrete Appl. Math.157 (2009) 1396--1406 DOI: http://dx.doi.org/10.1016/j.dam.2008.10.017 [pdf file]

• F. Chataigner, L.R.B. Salgado and Y.Wakabayashi, Approximation and inaproximability results on balanced connected partitions of graphs, DMTCS (Discrete Mathematics & Theoretical Computer Science), vol. 9, 2007, 177-192. DMTCS-vol.9, 2007

• G.F. Cintra, F.K. Miyazawa, Y. Wakabayashi and E.C. Xavier, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, European Journal of Operational Research, Volume 191, Issue 1 (2008), 59--83; DOI: http://dx.doi.org/10.1016/j.ejor.2007.08.007.

• G.F. Cintra, F.K. Miyazawa, Y. Wakabayashi and E.C. Xavier, A note on the approximability of cutting stock problems, European Journal of Operational Research, Volume 183, Issue 3 (2007), Pages 1328-1332; DOI: http://dx.doi.org/10.1016/j.ejor.2005.09.053

• E.M. Rodrigues, M.-F. Sagot and Y. Wakabayashi, The maximum agreement forest problem: approximation algorithms and computational experiments, Theoretical Computer Science 374 (2007) 91--110; DOI: http://dx.doi.org/doi:10.1016/j.tcs.2006.12.011

• F.K. Miyazawa and Y. Wakabayashi, Two- and three-dimensional parametric packing, Computers and Operations Research, Vol. 34, Issue 9, 2589-2603, 2007;DOI: http://dx.doi.org/10.1016/j.cor.2005.10.001

• Y. Kohayakawa, F.K. Miyazawa, P. Raghavan, Y. Wakabayashi, Multidimensional cube packing, Algorithmica, 40(3): 173--187, 2004. [ps.gz | pdf.gz] -- (submitted version -- different from the revised version), DOI: http://dx.doi.org/10.1007/s00453-004-1102-5.

• F.K. Miyazawa and Y. Wakabayashi, Parametric on-line approximation algorithms for packing squares and boxes, European Journal of Operational Research, 150 (2003) 281-292.

• F.K. Miyazawa and Y. Wakabayashi, Cube packing, Theoretical Computer Science, 297 (2003) 1-3, 355--366.

• O. Lee and Y. Wakabayashi, On the circuit cover problem for mixed graphs, Combinatorics, Probability and Computing (2002) 11, 43--59. [ps.gz] [pdf.gz]

• C.E. Ferreira and C.C. Souza and Y. Wakabayashi, Rearrangement of DNA fragments: a branch-and-cut algorithm, Discrete Applied Mathematics 116 (2002), no. 1-2, 161--177.

• O. Lee and Y. Wakabayashi, Note on a min-max conjecture of Woodall, Journal of Graph Theory, 38 (2001), no. 1, 36-41 [ps.gz]

• E.M. Rodrigues, M.-F. Sagot and Y. Wakabayashi, The maximum agreement forest problem: approximation algorithms and computational experiments, Theoretical Computer Science 374 (2007) 91--110; DOI: http://dx.doi.org/doi:10.1016/j.tcs.2006.12.011

• 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 [ps.gz | pdf.gz]

• C.E. Ferreira and F.K. Miyazawa and Y. Wakabayashi, Packing Squares into Squares, Pesquisa Operacional, 19 (1999), No.2, 223-237. [ps.gz]

• Y. Wakabayashi, The Complexity of Computing Medians of Relations. Resenhas, 3 (3) (1998), 323-349 [ps] [pdf]

• 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 [ps.gz]

• 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 [preliminary version ps.gz]

• M. Grötschel and Y. Wakabayashi, Facets of the Clique Partitioning Polytope, Mathematical Programming A, 47 (1990) 367-387. DOI Number: 10.1007/BF01580870 [pdf]

• 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. [pdf]

• M. Grötschel and Y. Wakabayashi, A Cutting Plane Algorithm for a Clustering Problem, Mathematical Programming B, 45 (1989) 52-96. DOI Number: 10.1007/BF01589097 [pdf]

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

• 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 Studies 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.

#### Conference Proceedings

• R. Gómez, F.K. Miyazawa and Y. Wakabayashi, Tree 3-spanners on generalized prisms of graphs, accepted to the 15th Latin American Theoretical Informatics Symposium - LATIN 2022.

• R. Sampaio, G.A.G. Sobral and Y. Wakabayashi, Minimum density of identifying codes of hexagonal grids with a finite number of rows. Anais do VII Encontro em Teoria da Computação, SBC, 2022.

• R. Gómez, F.K. Miyazawa and Y. Wakabayashi, Minimum $t$-spanners on subcubic graphs. In: Mutzel, P., Rahman, M.S., Slamin (eds) WALCOM 2022: Algorithms and Computation. Lecture Notes in Computer Science, vol 13174. Springer, Cham. DOI

• Phablo F.S. Moura, Matheus J. Ota and Yoshiko Wakabayashi, Approximation and parameterized algorithms for balanced connected partition problems. Lecture Notes in Computer Science, vol 13179, pp 211-223 (2022). Proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2022). Springer DOI doi.org/10.1007/978-3-030-95018-7_17

• F. Botler, A. Jiménez, M. Sambinelli and Y. Wakabayashi, The 2-Decomposition Conjecture for a new class of graphs, Procedia Computer Science 195 (2021) 359-367, LAGOS 2021 (XI Latin and American Algorithms, Graphs and Optimization Symposium), May 17 to 21, 2021. Open acess: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C

• Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota and Yoshiko Wakabayashi, Cut and Flow Formulations for the Balanced Connected k-Partition Problem. In: Baïou M., Gendron B., Günlük O., Mahjoub A. (eds) Combinatorial Optimization. ISCO 2020. Lecture Notes in Computer Science, vol 12176, pp. 128-139, Springer DOI doi.org/10.1007/978-3-030-53262-8_11

• R. Gomez and Y. Wakabayashi, Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. In: Brandstädt A., Köhler E., Meer K. (eds) Graph-Theoretic Concepts in Computer Science. WG 2018. Lecture Notes in Computer Science, vol 11159, pp 228-238. Springer. DOI doi.org/10.1007/978-3-030-00256-5_19

• Y. Kohayakawa, F. K. Miyazawa and Y. Wakabayashi, A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game, In: In: Bender M., Farach-Colton M., Mosteiro M. (eds) LATIN 2018: Theoretical Informatics. LATIN 2018. Lecture Notes in Computer Science, vol 10807, pp 697-711. Springer. DOI doi.org/10.1007/978-3-319-77404-6_51

• P.F.S. Moura and Y. Wakabayashi, Strong intractability of generalized convex recoloring problems, Electron. Notes in Discrete Mathematics, volume 62, 93-98 (2017). DOI.

• F. Botler, G.O. Mota, M.T.I. Oshiro and Y. Wakabayashi, Decompositions of highly connected graphs into paths of any given length, Electron. Notes in Discrete Mathematics, volume 49C, 795-802 (2015), Proceedings of EuroComb 2015 (available online). DOI

• F. Botler, G.O. Mota, M.T.I. Oshiro and Y. Wakabayashi, Path decompositions of regular graphs with prescribed girth, Electron. Notes in Discrete Mathematics, volume 49C, 629-636 (2015), Proceedings of EuroComb 2015 (available online). DOI

• R.S. Coelho, P.F.S. Moura and Y. Wakabayashi, The $k$-hop connected dominating set problem: hardness and polyhedra, Electron. Notes in Discrete Mathematics, volume 50, 59-64 (2015), Proceedings of VIII Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2015).

• F. Botler, G.O. Mota, M.T.I. Oshiro and Y. Wakabayashi, Decompositions of highly connected graphs into paths of length 5, Electron. Notes in Discrete Mathematics, volume 50C, 421-426 (2015), Proceedings of VIII Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2015).

• F.K. Miyazawa, L.L.C. Pedrosa, R. C.S. Schouery, M. Sviridenko and Y. Wakabayashi, Polynomial-Time Approximation Schemes for Circle Packing Problems, 22th Annual European Symposium (ESA), Wroclaw, Poland, September 8-10, 2014. Lecture Notes in Computer Science Volume 8737, 2014, pp 713-724 DOI

• A. Jiménez and Y. Wakabayashi, On path-cycle decompositions of triangle-free graphs, 9th International Colloquium on Graph Theory and Combinatorics (ICGT) - Grenoble, France, July 2014.

• F. Botler, G.O. Mota and Y. Wakabayashi, Path decompositions of triangle-free 5-regular graphs, 9th International Colloquium on Graph Theory and Combinatorics (ICGT) - Grenoble, France, July 2014.

• M.B. Campêlo, C. Huiban, R. Sampaio and Y. Wakabayashi, On the complexity for solving or approximating convex recoloring problems, in: 19th International Computing and Combinatorics Conference (COCOON), 2013, Hangzhou. Lecture Notes in Computer Science, Volume 7936, 2013, pp 614-625 DOI:http://dx.doi.org/10.1007/978-3-642-38768-5_54 -- ISBN: 978-3-642-38767-8 (Print) 978-3-642-38768-5 (Online) -- Editors: Ding-Zhu Du, Guochuan Zhang

• M.B. Campêlo, K.R. Lima, P.F.S. Moura and Y. Wakabayashi, Polyhedral studies on the convex recoloring problem, Electron. Notes in Discrete Math. 44 (2013) 233-238. Proceedings of the VII Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2013). DOI: http://dx.doi.org/10.1016/j.endm.2013.10.036

• R. da Ponte Barbosa and Y. Wakabayashi, A better approximation ratio and an IP formulation for a sensor cover problem. In: 10th Latin American Theoretical Informatics Symposium (LATIN), Arequipa, 2012, Lecture Notes in Computer Science , v. 7256. David Fernández-Baca (Ed.): pp. 49-60, 2012. ISBN:978-3-642-29343-6. DOI:http://dx.doi.org/10.1007/978-3-642-29344-3_5 Springerlink

• S.F. de Rezende, C.G. Fernandes, D.M. Martin and Y. Wakabayashi, Intersection of longest paths in a graph, Electronic Notes in Discrete Mathematics 38 (2011) 743--748. EuroComb 2011. DOI:10.1016/j.endm.2011.10.024

• C.G. Fernandes, C.E. Ferreira, F.K. Miyazawa and Y. Wakabayashi, Selfish square packing, Electron. Notes in Discrete Math. (2011), Volume 37C, pp. 369-374. LAGOS 2011, extended abstract. DOI: 10.1016/j.endm.2011.05.063

• K.R. Lima and Y. Wakabayashi, Convex recoloring of paths, Electron. Notes in Discrete Math. (2011), Volume 37C, pp. 165-170. LAGOS 2011, extended abstract. DOI: 10.1016/j.endm.2011.05.029

• T. de Queiroz, F. K. Miyazawa, Y. Wakabayashi e E. C. Xavier. Algoritmos para os Problemas da Mochila e do Corte de Estoque Tridimensional Guilhotinado, Simpósio Brasileiro de Pesquisa Operacional, 12 pag, 2009.

• T. Serra and Y. Wakabayashi, The Full Employment Theorem for Solver Designers and Related Issues in CP Modeling, Proceedings of V WTDIA at SBIA 2010 - São Bernardo do Campo, Brazil (WTDIA: Workshop on MSc Dissertation and PhD Thesis in Artificial Intelligence) (SBIA: Brazilian Symposium on Artificial Intelligence)

• T. A. de Queiroz, F. K. Miyazawa e Y. Wakabayashi. Heurísticas para o Problema da Mochila 2D Não-Guilhotinada Ilimitada. In: XXXVI Conferência Latino-americana de Informática, p. 1-14, 2010.

• S. Adi, M.D.V. Braga, C.G. Fernandes, C.E. Ferreira, F.H.V. Martinez, M.-F Sagot, M.A. Stefanes, C. Tjandraatmadja and Y. Wakabayashi, Repetition-free longest common subsequence, Electronic Notes in Discrete Mathematics 30 (2008) 243-248 (extended abstract - LAGOS 2007).

• C.G. Fernandes, C.E. Ferreira, C. Tjandraatmadja, and Y. Wakabayashi, A polyhedral investigation of the LCS problem and a repetition-free variant, In: 8th Latin American Theoretical Informatics Symposium (LATIN), Buzios, 2008, Lecture Notes in Computer Science , v. 4957. E.S. Laber et al. (Eds.): pp. 329-338, 2008. ISBN: 978-3-540-78772-3. DOI:http://dx.doi.org/10.1007/978-3-540-78773. Springerlink [pdf file]

• J.R. Correa, C.G. Fernandes, M. Matamala and Y. Wakabayashi, A 5/3-approximation for finding spanning trees with many leaves in cubic graphs, WAOA 2007 (5th Workshop on Approximation and Online Algorithms), Lecture Notes in Computer Science, v. 4927 (2008), p. 184-192. DOI:http://dx.doi.org/10.1007/978-3-540-77918-6_15 [pdf]

• F. Chataigner, G. Manic, Y.Wakabayashi and R. Yuster, Approximation algorithms and hardness results for the clique packing problem, Electronic Notes in Discrete Mathematics, Volume 29 (2007), Pages 397-401 URL of ENDM http://www.sciencedirect.com/science/journal/1571065.]

• J.R. Correa, C.G. Fernandes and Y. Wakabayashi, Approximating rational objectives is as easy as approximating linear ones, SWAT (10th Scandinavian Workshop on Algorithm Theory), Riga, July 2006, Lecture Notes in Computer Science, vol. 4059 (2006), pp. 351--362; DOI: http://dx.doi.org/10.1007/11785293_33

• G. Manic and Y. Wakabayashi, Packing triangles in low degree graphs and indifference graphs, EuroComb 2005 (European Conference on Combinatorics, Graph Theory and Applications). Discrete Mathematics and Theoretical Computer Science (DMTCS), Vol. AE 2005, pp. 251--256 (extended abstract).

• F.K. Miyazawa and Y. Wakabayashi, Two- and three-dimensional parametric packing. Proceedings of GRACO2005, 313--319 (electronic), Electron. Notes Discrete Math., 19, Elsevier, Amsterdam, 2005 (extended abstract). ENDM-vol.19-GRACO 2005

• L.R.B. Salgado and Y. Wakabayashi, Approximation results on balanced connected partitions of graphs, Proceedings of the Latin-American Conference on Combinatorics, Graphs and Applications, Santiago, Chile, 16--20 August, 2004, Extended abstract. Electronic Notes in Discrete Mathematics 18 (2004) 207-212.

• G.F. Cintra and Y. Wakabayashi, Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems, Proceedings of WEA 2004: Workshop on Efficient and Experimental Algorithms (Angra dos Reis, RJ, Brazil - May 25 to 28, 2004). Lecture Notes in Computer Science, vol. 3059 (2004), pp. 175-190.

• F.K. Miyazawa and Y. Wakabayashi, Three-dimensional on-line packing with rotations, IV ALIO/EURO Workshop on Applied Combinatorial Optimization. C.C. Ribeiro (ed), Pucon, Chile, pp.97-99, November 2002.

• F.K. Miyazawa and Y. Wakabayashi, Packing problems with orthogonal rotations. Proceedings of LATIN 2004: Theoretical Informatics. M. Farach-Colton (Ed.) Lecture Notes in Computer Science, vol. 2976 (2004), pp. 359--368. Buenos Aires, Argentina, April 5--8, 2004.

• E.M. Rodrigues, M.-F. Sagot and Y. Wakabayashi, Some approximation results for the maximum agreement forest problem. Proceedings of APPROX-RANDOM 2001 (Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques), M. Goemans et al (Eds.), Lecture Notes in Computer Science, vol. 2129, Springer (2001), 159-169. DOI 10.1007/3-540-44666-4 full paper ATTENTION: The algorithm shown is for the maximum agreement forest (maf) problem (see how this problem is defined in this paper). WE DO NOT CLAIM the algorithm is for the problem of calculating rSPR or TBR distance between two trees. The relation between the maf problem and these other problems have been mentioned by other authors. Some authors state that our algorithm has been proposed for TBR or rSPR and it has some flaws in the sense that it is not a 3-approx for these problems. All we say in the paper is that we present a 3-approx for the maf problem (as defined in the paper). A full paper containing the results of this paper and other new results, implementations, comparisons, etc is mentioned above.

• Y. Kohayakawa, F.K. Miyazawa, P. Raghavan and Y. Wakabayashi. Multidimensional Cube Packing, Szwarcfiter, Jayme (ed.), Proceedings of the Brazilian symposium on graphs, algorithms and combinatorics, Fortaleza, Ceará, Brazil, March 17-19, 2001. Extended abstracts. Amsterdam: Elsevier, Electron. Notes in Discrete Mathematics 7, no pag., electronic only (2001).

• 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.

• O. Lee and Y. Wakabayashi, Circuit Covers in Series-Parallel Mixed Graphs, Proceedings of LATIN'98: Theoretical Informatics. Lecture Notes in Computer Science, vol. 1380 (1998), 226-238 [ LNCSv.1380] [ps.gz]

• G.F. Cintra and Y. Wakabayashi, Um Algoritmo Híbrido para o Problema de Corte Unidimensional, Anais do XXX Simpósio Brasileiro de Pesquisa Operacional, 1998, 19pp.[ps.gz | pdf.gz]

• F.K. Miyazawa and Y. Wakabayashi, Parametric on-line packing, XXX SOBRAPO-Simpósio Brasileiro de Pesquisa Operacional, Curitiba, 1998. Anais da III Oficina de Problemas de Corte e Empacotamento, 109-121 [ps.gz]

• F.K. Miyazawa and Y. Wakabayashi. Approximation algorithms for packing small items, XX Congresso Nacional de Matemática Aplicada e Computacional, 1997.

• O. Lee and Y. Wakakabayashi, Caminhos Mínimos em Grafos Mistos, Anais do XVIII Congresso de Matemática Aplicada e Computacional, 1995, 329-333.

#### Other Publications

• Y. Wakabayashi, Partições conexas balanceadas de grafos, Computação Brasil, No. 43, 39-42, novembro 2020. Revista da Sociedade Brasileira de Computação.

• Feofiloff, P; De Figueiredo, C.M.H.; Wakabayashi, Y. Preface, Special issue: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO 2005, editors of Discrete Applied Mathematics, Vol. 156, Issue 7 (2008), page 985.

• Choffrut, Christian and Wakabayashi, Yoshiko, Preface [Imre Simon, the tropical computer scientist]. Editors of the special volume: Theor. Inform. Appl. 39 (2005), no. 1, i--vii.

• Proceedings of GRACO 2005. Papers from the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics held in Angra dos Reis, April 27--29, 2005. Edited by Paulo Feofiloff, Celina M. H. de Figueiredo and Yoshiko Wakabayashi. Electronic Notes in Discrete Mathematics, 19. Elsevier Science B.V., Amsterdam, 2005. front matter+416 pp. (electronic).

• Y. Wakabayashi, Contribuições a Teoria dos Grafos e Otimização Combinatória. Monografia apresentada no concurso de livre-docência - USP, 1995.

• Y. Wakabayashi, Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations, Thesis, Universität Augsburg, Germany, 1986.

• M.A.C.M. Gurgel and Y. Wakabayashi, A Result on Hamilton-connected Graphs, Tech. Report 83309-OR, Institut für Operations Research, Universität Bonn, 1983.

• Y. Wakabayashi, Sobre Grafos Hamiltonianos, dissertação de mestrado, Instituto de Matemática e Estatística da Universidade de São Paulo. 1977.

Yoshiko Wakabayashi, IME-USP