Yoshiko Wakabayashi
Orcid: 0000-0002-8229-3139Affiliations:
- University of São Paulo (USP), Institute of Mathematics and Statistics, São Paulo, Brazil
According to our database1,
Yoshiko Wakabayashi
authored at least 83 papers
between 1980 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1980
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
3
3
3
2
2
1
5
2
7
2
3
1
2
2
3
3
3
2
2
2
2
1
1
2
1
1
1
1
1
3
1
1
2
1
1
1
1
1
1
1
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on ime.usp.br
On csauthors.net:
Bibliography
2024
On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture.
Graphs Comb., October, 2024
J. Comb. Optim., August, 2024
RAIRO Oper. Res., 2024
2023
Balanced connected partitions of graphs: approximation, parameterization and lower bounds.
J. Comb. Optim., July, 2023
Improved NP-hardness results for the minimum <i>t</i>-spanner problem on bounded-degree graphs.
Theor. Comput. Sci., February, 2023
2022
Proceedings of the WALCOM: Algorithms and Computation, 2022
Proceedings of the LATIN 2022: Theoretical Informatics, 2022
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022
2021
Partitioning a graph into balanced connected classes: Formulations, separation and experiments.
Eur. J. Oper. Res., 2021
Discret. Math. Theor. Comput. Sci., 2021
Approximation and parameterized algorithms to find balanced connected partitions of graphs.
CoRR, 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
J. Comb. Optim., 2020
Discret. Appl. Math., 2020
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
2019
2018
Discret. Appl. Math., 2018
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.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
J. Comb. Theory B, 2017
J. Comb. Optim., 2017
Electron. Notes Discret. Math., 2017
Eur. J. Comb., 2017
Discret. Math. Theor. Comput. Sci., 2017
2016
Math. Program., 2016
Algorithmica, 2016
2015
Packing in generalized kernel systems: a framework that generalizes packing of branchings.
Math. Program., 2015
Electron. Notes Discret. Math., 2015
Electron. Notes Discret. Math., 2015
Electron. Notes Discret. Math., 2015
Electron. Notes Discret. Math., 2015
Discret. Math., 2015
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns.
4OR, 2015
Convex recoloring: inapproximability and a polyhedral study.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
Theor. Comput. Sci., 2014
Proceedings of the Algorithms - ESA 2014, 2014
2013
Electron. Notes Discret. Math., 2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing.
Comput. Oper. Res., 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
2011
2010
Math. Program., 2010
2009
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
2008
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation.
Eur. J. Oper. Res., 2008
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
2007
The maximum agreement forest problem: Approximation algorithms and computational experiments.
Theor. Comput. Sci., 2007
Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs.
Discret. Math. Theor. Comput. Sci., 2007
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007
2006
Proceedings of the Algorithm Theory, 2006
2005
2004
Electron. Notes Discret. Math., 2004
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
2003
Eur. J. Oper. Res., 2003
2002
Discret. Appl. Math., 2002
2001
Proceedings of the Approximation, 2001
1999
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.
SIAM J. Comput., 1999
1998
Proceedings of the LATIN '98: Theoretical Informatics, 1998
1997
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.
Algorithmica, 1997
1990
1989
1986
PhD thesis, 1986
1981
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets.
Discret. Math., 1981
1980