Yoshiko Wakabayashi

ORCID

Publication Activity (10 Years)

Years Active: 1980-2024
Publications (10 Years): 29

Top Venues

CoRR

Electron. Notes Discret. Math.

J. Comb. Optim.

Discret. Appl. Math.

University of Augsburg, Germany (PHD)

Education History

University of Augsburg, Germany

PHD

Publications

Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Polynomial algorithms for sparse spanners on subcubic graphs. J. Comb. Optim. 48 (1) (2024)
Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
-spanner problem on bounded-degree graphs. Theor. Comput. Sci. 947 (2023)
Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer, Martín Matamala, Juan Pablo Peña, Daniel A. Quiroz, Maycon Sambinelli, Yoshiko Wakabayashi, Weiqiang Yu, José Zamora
Boundedness for proper conflict-free and odd colorings. CoRR (2023)
Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Balanced connected partitions of graphs: approximation, parameterization and lower bounds. J. Comb. Optim. 45 (5) (2023)
Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems. CALDAM (2022)
Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Minimum t-Spanners on Subcubic Graphs. WALCOM (2022)
Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Tree 3-Spanners on Generalized Prisms of Graphs. LATIN (2022)
Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Partitioning a graph into balanced connected classes: Formulations, separation and experiments. Eur. J. Oper. Res. 293 (3) (2021)
Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Approximation and parameterized algorithms to find balanced connected partitions of graphs. CoRR (2021)
Fábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi
The 2-Decomposition Conjecture for a new class of graphs. LAGOS (2021)
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
A tight lower bound for the online bounded space hypercube bin packing problem. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
A tight lower bound for the online bounded space hypercube bin packing problem. CoRR (2021)
Renzo Gómez, Yoshiko Wakabayashi
Nontrivial path covers of graphs: existence, minimization and maximization. J. Comb. Optim. 39 (2) (2020)
Phablo F. S. Moura, Yoshiko Wakabayashi
Strong intractability results for generalized convex recoloring problems. Discret. Appl. Math. 281 (2020)
Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Cut and Flow Formulations for the Balanced Connected k-Partition Problem. ISCO (2020)
Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Integer Programming Approaches to Balanced Connected k-Partition. CoRR (2019)
Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Prices of Anarchy of Selfish 2D Bin Packing Games. Int. J. Found. Comput. Sci. 30 (3) (2019)
Renzo Gómez, Yoshiko Wakabayashi
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. WG (2018)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decomposing highly connected graphs into paths of length five. Discret. Appl. Math. 245 (2018)
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. LATIN (2018)
Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi
The k-hop connected dominating set problem: approximation and hardness. J. Comb. Optim. 34 (4) (2017)
Andrea Jiménez, Yoshiko Wakabayashi
On path-cycle decompositions of triangle-free graphs. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decomposing regular graphs with prescribed girth into paths of given length. Eur. J. Comb. 66 (2017)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decomposing highly edge-connected graphs into paths of any given length. J. Comb. Theory, Ser. B 122 (2017)
Phablo F. S. Moura, Yoshiko Wakabayashi
Strong intractability of generalized convex recoloring problems. Electron. Notes Discret. Math. 62 (2017)
Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Prices of anarchy of selfish 2D bin packing games. CoRR (2017)
Yoshiharu Kohayakawa, Flavio Keidi Miyazawa, Yoshiko Wakabayashi
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. CoRR (2017)
Manoel B. Campêlo, Alexandre S. Freire, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi
The convex recoloring problem: polyhedra, facets and computational experiments. Math. Program. 156 (1-2) (2016)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica 76 (2) (2016)
Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi
The k-hop connected dominating set problem: hardness and polyhedra. Electron. Notes Discret. Math. 50 (2015)
Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi
Convex recoloring: inapproximability and a polyhedral study. CTW (2015)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decompositions of highly connected graphs into paths of length five. Electron. Notes Discret. Math. 50 (2015)
Fábio Botler, Guilherme Oliveira Mota, Yoshiko Wakabayashi
Decompositions of triangle-free 5-regular graphs into paths of length five. Discret. Math. 338 (11) (2015)
Thiago Alves de Queiroz, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns. 4OR 13 (2) (2015)
Mario Leston Rey, Yoshiko Wakabayashi
Packing in generalized kernel systems: a framework that generalizes packing of branchings. Math. Program. 149 (1-2) (2015)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Decompositions of highly connected graphs into paths of any given length. Electron. Notes Discret. Math. 49 (2015)
Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi
Path decompositions of regular graphs with prescribed girth. Electron. Notes Discret. Math. 49 (2015)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. CoRR (2014)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle Packing Problems. ESA (2014)
Manoel B. Campêlo, Cristiana G. Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi
Hardness and inapproximability of convex recoloring problems. Theor. Comput. Sci. 533 (2014)
Karla Roberta Lima, Yoshiko Wakabayashi
Convex recoloring of paths. Discret. Appl. Math. 164 (2014)
Manoel B. Campêlo, Cristiana G. Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi
On the Complexity of Solving or Approximating Convex Recoloring Problems. COCOON (2013)
Manoel B. Campêlo, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi
Polyhedral studies on the convex recoloring problem. Electron. Notes Discret. Math. 44 (2013)
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
Intersecting longest paths. Discret. Math. 313 (11) (2013)
C. N. Campos, Yoshiko Wakabayashi
On dominating sets of maximal outerplanar graphs. Discret. Appl. Math. 161 (3) (2013)
Rafael da Ponte Barbosa, Yoshiko Wakabayashi
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem. LATIN (2012)
Thiago Alves de Queiroz, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, Eduardo C. Xavier
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Comput. Oper. Res. 39 (2) (2012)
Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi
Selfish Square Packing. Electron. Notes Discret. Math. 37 (2011)
Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
Intersection of Longest Paths in a Graph. Electron. Notes Discret. Math. 38 (2011)
Karla Roberta Lima, Yoshiko Wakabayashi
Convex Recoloring of Paths. Electron. Notes Discret. Math. 37 (2011)
José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
Approximating a class of combinatorial problems with rational objective function. Math. Program. 124 (1-2) (2010)
Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
Repetition-free longest common subsequence. Discret. Appl. Math. 158 (12) (2010)
Flavio Keidi Miyazawa, Yoshiko Wakabayashi
Three-dimensional packings with rotations. Comput. Oper. Res. 36 (10) (2009)
Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discret. Appl. Math. 157 (2) (2009)
Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster
Approximation algorithms and hardness results for the clique packing problem. Discret. Appl. Math. 157 (7) (2009)
Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
Repetition-free longest common subsequence. Electron. Notes Discret. Math. 30 (2008)
Gordana Manic, Yoshiko Wakabayashi
Packing triangles in low degree graphs and indifference graphs. Discret. Math. 308 (8) (2008)
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. Eur. J. Oper. Res. 191 (1) (2008)
Paulo Feofiloff, Celina M. H. de Figueiredo, Yoshiko Wakabayashi
Preface. Discret. Appl. Math. 156 (7) (2008)
Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN (2008)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Two- and three-dimensional parametric packing. Comput. Oper. Res. 34 (9) (2007)
Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
The maximum agreement forest problem: Approximation algorithms and computational experiments. Theor. Comput. Sci. 374 (1-3) (2007)
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)
Yoshiko Wakabayashi, Frédéric Chataigner, Liliane Benning Salgado
Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs. Discret. Math. Theor. Comput. Sci. 9 (1) (2007)
G. F. Cintra, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, E. C. Xavier
A note on the approximability of cutting stock problems. Eur. J. Oper. Res. 183 (3) (2007)
Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster
Approximation algorithms and hardness results for the clique packing problem. Electron. Notes Discret. Math. 29 (2007)
José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
Approximating Rational Objectives Is as Easy as Approximating Linear Ones. SWAT (2006)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Two- and three-dimensional parametric packing. Electron. Notes Discret. Math. 19 (2005)
Christian Choffrut, Yoshiko Wakabayashi
Preface. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Paulo Feofiloff, Celina M. H. de Figueiredo, Yoshiko Wakabayashi
Preface. Electron. Notes Discret. Math. 19 (2005)
Liliane R. B. Salgado, Yoshiko Wakabayashi
Approximation Results on Balanced Connected Partitions of Graphs. Electron. Notes Discret. Math. 18 (2004)
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi
Multidimensional Cube Packing. Algorithmica 40 (3) (2004)
Glauber Cintra, Yoshiko Wakabayashi
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. WEA (2004)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Packing Problems with Orthogonal Rotations. LATIN (2004)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Cube packing. Theor. Comput. Sci. 297 (1-3) (2003)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Parametric on-line algorithms for packing rectangles and boxes. Eur. J. Oper. Res. 150 (2) (2003)
Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi
Rearrangement of DNA fragments: a branch-and-cut algorithm. Discret. Appl. Math. 116 (1-2) (2002)
Orlando Lee, Yoshiko Wakabayashi
On The Circuit Cover Problemfor Mixed Graphs. Comb. Probab. Comput. 11 (1) (2002)
Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
Some Approximation Results for the Maximum Agreement Forest Problem. RANDOM-APPROX (2001)
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi
Multidimensional Cube Packing. Electron. Notes Discret. Math. 7 (2001)
Orlando Lee, Yoshiko Wakabayashi
Note on a min-max conjecture of Woodall. J. Graph Theory 38 (1) (2001)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Cube Packing. LATIN (2000)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem. SIAM J. Comput. 29 (3) (1999)
Orlando Lee, Yoshiko Wakabayashi
Circuit Covers in Series-Parallel Mixed Graphs. LATIN (1998)
Maria Angela C. M. Gurgel, Yoshiko Wakabayashi
Adjacency of vertices of the complete pre-order polytope. Discret. Math. 175 (1-3) (1997)
Flávio Keidi Miyazawa, Yoshiko Wakabayashi
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis. Algorithmica 18 (1) (1997)
Martin Grötschel, Yoshiko Wakabayashi
Facets of the Clique Partitioning Polytope. Math. Program. 47 (1990)
Martin Grötschel, Yoshiko Wakabayashi
A cutting plane algorithm for a clustering problem. Math. Program. 45 (1-3) (1989)
Maria Angela C. M. Gurgel, Yoshiko Wakabayashi
-leaf-connected graphs. J. Comb. Theory, Ser. B 41 (1) (1986)
Martin Grötschel, Yoshiko Wakabayashi
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discret. Math. 34 (1) (1981)
Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi
Hypotraceable digraphs. J. Graph Theory 4 (4) (1980)

Yoshiko Wakabayashi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yoshiko Wakabayashi