Yoshiko Wakabayashi

96 papers A 1B 10C 4Misc 1Journal 75Unranked 4

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