Yoshiko Wakabayashi

According to our database1, Yoshiko Wakabayashi authored at least 70 papers between 1980 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Nontrivial path covers of graphs: existence, minimization and maximization.
J. Comb. Optim., 2020

Strong intractability results for generalized convex recoloring problems.
Discret. Appl. Math., 2020

Cut and Flow Formulations for the Balanced Connected k-Partition Problem.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
Prices of Anarchy of Selfish 2D Bin Packing Games.
Int. J. Found. Comput. Sci., 2019

Integer Programming Approaches to Balanced Connected k-Partition.
CoRR, 2019

2018
Decomposing highly connected graphs into paths of length five.
Discret. Appl. Math., 2018

Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization.
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
Decomposing highly edge-connected graphs into paths of any given length.
J. Comb. Theory, Ser. B, 2017

The k-hop connected dominating set problem: approximation and hardness.
J. Comb. Optim., 2017

Strong intractability of generalized convex recoloring problems.
Electron. Notes Discret. Math., 2017

Decomposing regular graphs with prescribed girth into paths of given length.
Eur. J. Comb., 2017

On path-cycle decompositions of triangle-free graphs.
Discret. Math. Theor. Comput. Sci., 2017

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

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

2015
Packing in generalized kernel systems: a framework that generalizes packing of branchings.
Math. Program., 2015

The k-hop connected dominating set problem: hardness and polyhedra.
Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of length five.
Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of any given length.
Electron. Notes Discret. Math., 2015

Path decompositions of regular graphs with prescribed girth.
Electron. Notes Discret. Math., 2015

Decompositions of triangle-free 5-regular graphs into paths of length five.
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
Hardness and inapproximability of convex recoloring problems.
Theor. Comput. Sci., 2014

Polynomial-Time Approximation Schemes for Circle Packing Problems.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Polyhedral studies on the convex recoloring problem.
Electron. Notes Discret. Math., 2013

Intersecting longest paths.
Discret. Math., 2013

On dominating sets of maximal outerplanar graphs.
Discret. Appl. Math., 2013

On the Complexity of Solving or Approximating Convex Recoloring Problems.
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

A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Intersection of Longest Paths in a Graph.
Electron. Notes Discret. Math., 2011

Convex Recoloring of Paths.
Electron. Notes Discret. Math., 2011

Selfish Square Packing.
Electron. Notes Discret. Math., 2011

2010
Approximating a class of combinatorial problems with rational objective function.
Math. Program., 2010

2009
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.
Discret. Appl. Math., 2009

Three-dimensional packings with rotations.
Comput. Oper. Res., 2009

2008
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation.
Eur. J. Oper. Res., 2008

Repetition-free longest common subsequence.
Electron. Notes Discret. Math., 2008

Packing triangles in low degree graphs and indifference graphs.
Discret. Math., 2008

A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
The maximum agreement forest problem: Approximation algorithms and computational experiments.
Theor. Comput. Sci., 2007

A note on the approximability of cutting stock problems.
Eur. J. Oper. Res., 2007

Approximation algorithms and hardness results for the clique packing problem.
Electron. Notes Discret. Math., 2007

Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs.
Discret. Math. Theor. Comput. Sci., 2007

A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006
Approximating Rational Objectives Is as Easy as Approximating Linear Ones.
Proceedings of the Algorithm Theory, 2006

2005
Preface.
RAIRO Theor. Informatics Appl., 2005

Two- and three-dimensional parametric packing.
Electron. Notes Discret. Math., 2005

Preface.
Electron. Notes Discret. Math., 2005

2004
Approximation Results on Balanced Connected Partitions of Graphs.
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

Packing Problems with Orthogonal Rotations.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Cube packing.
Theor. Comput. Sci., 2003

Parametric on-line algorithms for packing rectangles and boxes.
Eur. J. Oper. Res., 2003

2002
Rearrangement of DNA fragments: a branch-and-cut algorithm.
Discret. Appl. Math., 2002

On The Circuit Cover Problemfor Mixed Graphs.
Comb. Probab. Comput., 2002

2001
Note on a min-max conjecture of Woodall.
J. Graph Theory, 2001

Multidimensional Cube Packing.
Electron. Notes Discret. Math., 2001

Some Approximation Results for the Maximum Agreement Forest Problem.
Proceedings of the Approximation, 2001

1999
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.
SIAM J. Comput., 1999

1998
Circuit Covers in Series-Parallel Mixed Graphs.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997
Adjacency of vertices of the complete pre-order polytope.
Discret. Math., 1997

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

1990
Facets of the Clique Partitioning Polytope.
Math. Program., 1990

1989
A cutting plane algorithm for a clustering problem.
Math. Program., 1989

1986
Aggregation of binary relations: algorithmic and polyhedral investigations.
PhD thesis, 1986

On <i>k</i>-leaf-connected graphs.
J. Comb. Theory, Ser. B, 1986

1981
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets.
Discret. Math., 1981

1980
Hypotraceable digraphs.
J. Graph Theory, 1980


  Loading...