Yoshiko Wakabayashi

According to our database, Yoshiko Wakabayashi authored at least 80 papers between 1980 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Balanced connected partitions of graphs: approximation, parameterization and lower bounds.

Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi

J. Comb. Optim., July, 2023

Improved NP-hardness results for the minimum <i>t</i>-spanner problem on bounded-degree graphs.

Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Theor. Comput. Sci., February, 2023

Boundedness for proper conflict-free and odd colorings.

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

CoRR, 2023

2022

Minimum t-Spanners on Subcubic Graphs.

Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Proceedings of the WALCOM: Algorithms and Computation, 2022

Tree 3-Spanners on Generalized Prisms of Graphs.

Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Approximation and Parameterized Algorithms for Balanced Connected Partition Problems.

Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Partitioning a graph into balanced connected classes: Formulations, separation and experiments.

Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi

Eur. J. Oper. Res., 2021

A tight lower bound for the online bounded space hypercube bin packing problem.

Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Discret. Math. Theor. Comput. Sci., 2021

Approximation and parameterized algorithms to find balanced connected partitions of graphs.

Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi

CoRR, 2021

The 2-Decomposition Conjecture for a new class of graphs.

Fábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Nontrivial path covers of graphs: existence, minimization and maximization.

Renzo Gómez, Yoshiko Wakabayashi

J. Comb. Optim., 2020

Strong intractability results for generalized convex recoloring problems.

Phablo F. S. Moura, Yoshiko Wakabayashi

Discret. Appl. Math., 2020

Cut and Flow Formulations for the Balanced Connected k-Partition Problem.

Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Prices of Anarchy of Selfish 2D Bin Packing Games.

Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Int. J. Found. Comput. Sci., 2019

Integer Programming Approaches to Balanced Connected k-Partition.

Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi

CoRR, 2019

2018

Decomposing highly connected graphs into paths of length five.

Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi

Discret. Appl. Math., 2018

Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization.

Renzo Gómez, Yoshiko Wakabayashi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game.

Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Decomposing highly edge-connected graphs into paths of any given length.

Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi

J. Comb. Theory, Ser. B, 2017

The k-hop connected dominating set problem: approximation and hardness.

Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi

J. Comb. Optim., 2017

Strong intractability of generalized convex recoloring problems.

Phablo F. S. Moura, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2017

Decomposing regular graphs with prescribed girth into paths of given length.

Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi

Eur. J. Comb., 2017

On path-cycle decompositions of triangle-free graphs.

Andrea Jiménez, Yoshiko Wakabayashi

Discret. Math. Theor. Comput. Sci., 2017

2016

The convex recoloring problem: polyhedra, facets and computational experiments.

Manoel B. Campêlo, Alexandre S. Freire, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi

Math. Program., 2016

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.

Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi

Algorithmica, 2016

2015

Packing in generalized kernel systems: a framework that generalizes packing of branchings.

Mario Leston Rey, Yoshiko Wakabayashi

Math. Program., 2015

The k-hop connected dominating set problem: hardness and polyhedra.

Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of length five.

Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of any given length.

Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2015

Path decompositions of regular graphs with prescribed girth.

Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2015

Decompositions of triangle-free 5-regular graphs into paths of length five.

Fábio Botler, Guilherme Oliveira Mota, Yoshiko Wakabayashi

Discret. Math., 2015

On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns.

Thiago Alves de Queiroz, Flávio Keidi Miyazawa, Yoshiko Wakabayashi

4OR, 2015

Convex recoloring: inapproximability and a polyhedral study.

Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Hardness and inapproximability of convex recoloring problems.

Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi

Theor. Comput. Sci., 2014

Polynomial-Time Approximation Schemes for Circle Packing Problems.

Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi

Proceedings of the Algorithms - ESA 2014, 2014

2013

Polyhedral studies on the convex recoloring problem.

Manoel B. Campêlo, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2013

Intersecting longest paths.

Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi

Discret. Math., 2013

On dominating sets of maximal outerplanar graphs.

C. N. Campos, Yoshiko Wakabayashi

Discret. Appl. Math., 2013

On the Complexity of Solving or Approximating Convex Recoloring Problems.

Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing.

Thiago Alves de Queiroz, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, Eduardo C. Xavier

Comput. Oper. Res., 2012

A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem.

Rafael da Ponte Barbosa, Yoshiko Wakabayashi

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Intersection of Longest Paths in a Graph.

Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2011

Convex Recoloring of Paths.

Karla Roberta Lima, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2011

Selfish Square Packing.

Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2011

2010

Approximating a class of combinatorial problems with rational objective function.

José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi

Math. Program., 2010

2009

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.

Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi

Discret. Appl. Math., 2009

Three-dimensional packings with rotations.

Flavio Keidi Miyazawa, Yoshiko Wakabayashi

Comput. Oper. Res., 2009

2008

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation.

G. F. Cintra, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, E. C. Xavier

Eur. J. Oper. Res., 2008

Repetition-free longest common subsequence.

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

Electron. Notes Discret. Math., 2008

Packing triangles in low degree graphs and indifference graphs.

Gordana Manic, Yoshiko Wakabayashi

Discret. Math., 2008

A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.

Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

The maximum agreement forest problem: Approximation algorithms and computational experiments.

Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi

Theor. Comput. Sci., 2007

A note on the approximability of cutting stock problems.

G. F. Cintra, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, E. C. Xavier

Eur. J. Oper. Res., 2007

Approximation algorithms and hardness results for the clique packing problem.

Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster

Electron. Notes Discret. Math., 2007

Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs.

Yoshiko Wakabayashi, Frédéric Chataigner, Liliane Benning Salgado

Discret. Math. Theor. Comput. Sci., 2007

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.

José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006

Approximating Rational Objectives Is as Easy as Approximating Linear Ones.

José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi

Proceedings of the Algorithm Theory, 2006

2005

Preface.

Christian Choffrut, Yoshiko Wakabayashi

RAIRO Theor. Informatics Appl., 2005

Two- and three-dimensional parametric packing.

Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2005

Preface.

Paulo Feofiloff, Celina M. H. de Figueiredo, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2005

2004

Approximation Results on Balanced Connected Partitions of Graphs.

Liliane R. B. Salgado, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2004

Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems.

Glauber Cintra, Yoshiko Wakabayashi

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Packing Problems with Orthogonal Rotations.

Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

Cube packing.

Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Theor. Comput. Sci., 2003

Parametric on-line algorithms for packing rectangles and boxes.

Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Eur. J. Oper. Res., 2003

2002

Rearrangement of DNA fragments: a branch-and-cut algorithm.

Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi

Discret. Appl. Math., 2002

On The Circuit Cover Problemfor Mixed Graphs.

Orlando Lee, Yoshiko Wakabayashi

Comb. Probab. Comput., 2002

2001

Note on a min-max conjecture of Woodall.

Orlando Lee, Yoshiko Wakabayashi

J. Graph Theory, 2001

Multidimensional Cube Packing.

Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2001

Some Approximation Results for the Maximum Agreement Forest Problem.

Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi

Proceedings of the Approximation, 2001

1999

Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.

Flávio Keidi Miyazawa, Yoshiko Wakabayashi

SIAM J. Comput., 1999

1998

Circuit Covers in Series-Parallel Mixed Graphs.

Orlando Lee, Yoshiko Wakabayashi

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

Adjacency of vertices of the complete pre-order polytope.

Maria Angela C. M. Gurgel, Yoshiko Wakabayashi

Discret. Math., 1997

An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.

Flávio Keidi Miyazawa, Yoshiko Wakabayashi

Algorithmica, 1997

1990

Facets of the Clique Partitioning Polytope.

Martin Grötschel, Yoshiko Wakabayashi

Math. Program., 1990

1989

A cutting plane algorithm for a clustering problem.

Martin Grötschel, Yoshiko Wakabayashi

Math. Program., 1989

1986

Aggregation of binary relations: algorithmic and polyhedral investigations.

Yoshiko Wakabayashi

PhD thesis, 1986

On <i>k</i>-leaf-connected graphs.

Maria Angela C. M. Gurgel, Yoshiko Wakabayashi

J. Comb. Theory, Ser. B, 1986

1981

On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets.

Martin Grötschel, Yoshiko Wakabayashi

Discret. Math., 1981

1980

Hypotraceable digraphs.

Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi

J. Graph Theory, 1980