![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Yoshiko Wakabayashi
Person information
- affiliation: University of São Paulo (USP), Institute of Mathematics and Statistics, São Paulo, Brazil
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j65]Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Polynomial algorithms for sparse spanners on subcubic graphs. J. Comb. Optim. 48(1): 11 (2024) - 2023
- [j64]Phablo F. S. Moura
, Matheus Jun Ota
, Yoshiko Wakabayashi
:
Balanced connected partitions of graphs: approximation, parameterization and lower bounds. J. Comb. Optim. 45(5): 127 (2023) - [j63]Renzo Gómez
, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
:
Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theor. Comput. Sci. 947: 113691 (2023) - [i8]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 abs/2308.00170 (2023) - 2022
- [c18]Phablo F. S. Moura
, Matheus Jun Ota
, Yoshiko Wakabayashi
:
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems. CALDAM 2022: 211-223 - [c17]Renzo Gómez
, Flávio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Tree 3-Spanners on Generalized Prisms of Graphs. LATIN 2022: 557-573 - [c16]Renzo Gómez
, Flávio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Minimum t-Spanners on Subcubic Graphs. WALCOM 2022: 365-380 - 2021
- [j62]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) - [j61]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): 826-836 (2021) - [c15]Fábio Botler
, Andrea Jiménez
, Maycon Sambinelli
, Yoshiko Wakabayashi:
The 2-Decomposition Conjecture for a new class of graphs. LAGOS 2021: 359-367 - [i7]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
A tight lower bound for the online bounded space hypercube bin packing problem. CoRR abs/2107.14161 (2021) - [i6]Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
Approximation and parameterized algorithms to find balanced connected partitions of graphs. CoRR abs/2108.10398 (2021) - 2020
- [j60]Phablo F. S. Moura
, Yoshiko Wakabayashi
:
Strong intractability results for generalized convex recoloring problems. Discret. Appl. Math. 281: 252-260 (2020) - [j59]Renzo Gómez
, Yoshiko Wakabayashi
:
Nontrivial path covers of graphs: existence, minimization and maximization. J. Comb. Optim. 39(2): 437-456 (2020) - [c14]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: 128-139
2010 – 2019
- 2019
- [j58]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): 355-374 (2019) - [i5]Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
Integer Programming Approaches to Balanced Connected k-Partition. CoRR abs/1911.05723 (2019) - 2018
- [j57]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: 128-138 (2018) - [c13]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: 697-711 - [c12]Renzo Gómez
, Yoshiko Wakabayashi
:
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. WG 2018: 228-238 - 2017
- [j56]Andrea Jiménez, Yoshiko Wakabayashi
:
On path-cycle decompositions of triangle-free graphs. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j55]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: 28-36 (2017) - [j54]Phablo F. S. Moura
, Yoshiko Wakabayashi:
Strong intractability of generalized convex recoloring problems. Electron. Notes Discret. Math. 62: 93-98 (2017) - [j53]Rafael S. Coelho
, Phablo F. S. Moura
, Yoshiko Wakabayashi
:
The k-hop connected dominating set problem: approximation and hardness. J. Comb. Optim. 34(4): 1060-1083 (2017) - [j52]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 B 122: 508-542 (2017) - [i4]Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Prices of anarchy of selfish 2D bin packing games. CoRR abs/1707.07882 (2017) - [i3]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 abs/1712.06763 (2017) - 2016
- [j51]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): 536-568 (2016) - [j50]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): 303-330 (2016) - 2015
- [j49]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): 199-219 (2015) - [j48]Fábio Botler
, Guilherme Oliveira Mota
, Yoshiko Wakabayashi
:
Decompositions of triangle-free 5-regular graphs into paths of length five. Discret. Math. 338(11): 1845-1855 (2015) - [j47]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: 629-636 (2015) - [j46]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: 795-802 (2015) - [j45]Rafael S. Coelho, Phablo F. S. Moura
, Yoshiko Wakabayashi
:
The k-hop connected dominating set problem: hardness and polyhedra. Electron. Notes Discret. Math. 50: 59-64 (2015) - [j44]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: 211-216 (2015) - [j43]Mario Leston Rey, Yoshiko Wakabayashi
:
Packing in generalized kernel systems: a framework that generalizes packing of branchings. Math. Program. 149(1-2): 209-251 (2015) - [i2]Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi:
Convex recoloring: inapproximability and a polyhedral study. CTW 2015: 117-120 - 2014
- [j42]Karla Roberta Lima, Yoshiko Wakabayashi
:
Convex recoloring of paths. Discret. Appl. Math. 164: 450-459 (2014) - [j41]Manoel B. Campêlo
, Cristiana Gomes Huiban, Rudini M. Sampaio
, Yoshiko Wakabayashi
:
Hardness and inapproximability of convex recoloring problems. Theor. Comput. Sci. 533: 15-25 (2014) - [c11]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: 713-724 - [i1]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 abs/1412.4709 (2014) - 2013
- [j40]C. N. Campos
, Yoshiko Wakabayashi
:
On dominating sets of maximal outerplanar graphs. Discret. Appl. Math. 161(3): 330-335 (2013) - [j39]Susanna F. de Rezende
, Cristina G. Fernandes
, Daniel M. Martin, Yoshiko Wakabayashi
:
Intersecting longest paths. Discret. Math. 313(11): 1401-1408 (2013) - [j38]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: 233-238 (2013) - [c10]Manoel B. Campêlo
, Cristiana Gomes Huiban, Rudini M. Sampaio
, Yoshiko Wakabayashi
:
On the Complexity of Solving or Approximating Convex Recoloring Problems. COCOON 2013: 614-625 - 2012
- [j37]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): 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
- [j36]Karla Roberta Lima, Yoshiko Wakabayashi
:
Convex Recoloring of Paths. Electron. Notes Discret. Math. 37: 165-170 (2011) - [j35]Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Selfish Square Packing. Electron. Notes Discret. Math. 37: 369-374 (2011) - [j34]Susanna F. de Rezende
, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi
:
Intersection of Longest Paths in a Graph. Electron. Notes Discret. Math. 38: 743-748 (2011) - 2010
- [j33]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): 1315-1324 (2010) - [j32]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)
2000 – 2009
- 2009
- [j31]Flavio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Three-dimensional packings with rotations. Comput. Oper. Res. 36(10): 2801-2815 (2009) - [j30]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): 272-279 (2009) - [j29]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): 1396-1406 (2009) - 2008
- [j28]Paulo Feofiloff
, Celina M. H. de Figueiredo
, Yoshiko Wakabayashi
:
Preface. Discret. Appl. Math. 156(7): 985 (2008) - [j27]Gordana Manic, Yoshiko Wakabayashi
:
Packing triangles in low degree graphs and indifference graphs. Discret. Math. 308(8): 1455-1471 (2008) - [j26]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: 243-248 (2008) - [j25]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): 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
- [j24]Flávio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Two- and three-dimensional parametric packing. Comput. Oper. Res. 34(9): 2589-2603 (2007) - [j23]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) - [j22]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: 397-401 (2007) - [j21]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): 1328-1332 (2007) - [j20]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
- [j19]Paulo Feofiloff
, Celina M. H. de Figueiredo
, Yoshiko Wakabayashi
:
Preface. Electron. Notes Discret. Math. 19: 1-7 (2005) - [j18]Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Two- and three-dimensional parametric packing. Electron. Notes Discret. Math. 19: 313-319 (2005) - [j17]Christian Choffrut, Yoshiko Wakabayashi
:
Preface. RAIRO Theor. Informatics Appl. 39(1) (2005) - 2004
- [j16]Yoshiharu Kohayakawa
, Flávio Keidi Miyazawa
, Prabhakar Raghavan
, Yoshiko Wakabayashi
:
Multidimensional Cube Packing. Algorithmica 40(3): 173-187 (2004) - [j15]Liliane R. B. Salgado, Yoshiko Wakabayashi
:
Approximation Results on Balanced Connected Partitions of Graphs. Electron. Notes Discret. Math. 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
- [j14]Flávio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Parametric on-line algorithms for packing rectangles and boxes. Eur. J. Oper. Res. 150(2): 281-292 (2003) - [j13]Flávio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Cube packing. Theor. Comput. Sci. 297(1-3): 355-366 (2003) - 2002
- [j12]Orlando Lee, Yoshiko Wakabayashi
:
On The Circuit Cover Problemfor Mixed Graphs. Comb. Probab. Comput. 11(1): 43-59 (2002) - [j11]Carlos Eduardo Ferreira, C. Carvalho de Souza
, Yoshiko Wakabayashi
:
Rearrangement of DNA fragments: a branch-and-cut algorithm. Discret. Appl. Math. 116(1-2): 161-177 (2002) - 2001
- [j10]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. Electron. Notes Discret. Math. 7: 110-113 (2001) - [j9]Orlando Lee, Yoshiko Wakabayashi
:
Note on a min-max conjecture of Woodall. J. 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]Flávio Keidi Miyazawa, Yoshiko Wakabayashi
:
Cube Packing. LATIN 2000: 58-67
1990 – 1999
- 1999
- [j8]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
- [j7]Flávio Keidi Miyazawa, Yoshiko Wakabayashi
:
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis. Algorithmica 18(1): 122-144 (1997) - [j6]Maria Angela C. M. Gurgel, Yoshiko Wakabayashi
:
Adjacency of vertices of the complete pre-order polytope. Discret. Math. 175(1-3): 163-172 (1997) - 1990
- [j5]Martin Grötschel, Yoshiko Wakabayashi
:
Facets of the Clique Partitioning Polytope. Math. Program. 47: 367-387 (1990)
1980 – 1989
- 1989
- [j4]Martin Grötschel, Yoshiko Wakabayashi
:
A cutting plane algorithm for a clustering problem. Math. Program. 45(1-3): 59-96 (1989) - 1986
- [b1]Yoshiko Wakabayashi:
Aggregation of binary relations: algorithmic and polyhedral investigations. University of Augsburg, Germany, 1986, pp. 1-191 - [j3]Maria Angela C. M. Gurgel, Yoshiko Wakabayashi
:
On k-leaf-connected graphs. J. Comb. Theory B 41(1): 1-16 (1986) - 1981
- [j2]Martin Grötschel, Yoshiko Wakabayashi
:
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discret. Math. 34(1): 43-59 (1981) - 1980
- [j1]Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi
:
Hypotraceable digraphs. J. Graph Theory 4(4): 377-381 (1980)
Coauthor Index
aka: Flavio Keidi Miyazawa
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint