Yoshiko Wakabayashi

Yoshiko Wakabayashi's AcademicInfluence.com Rankings

Yoshiko Wakabayashi

Computer Science

#10496

World Rank

#11027

Historical Rank

Machine Learning

#5558

World Rank

#5632

Historical Rank

Artificial Intelligence

#6032

World Rank

#6124

Historical Rank

Database

#9284

World Rank

#9774

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Yoshiko Wakabayashi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Yoshiko Wakabayashi is a Brazilian computer scientist and applied mathematician whose research interests include combinatorial optimization, polyhedral combinatorics, packing problems, and graph algorithms. She is a professor in the department of computer science and institute of mathematics and statistics at the University of São Paulo.

(See a Problem?)

Yoshiko Wakabayashi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A cutting plane algorithm for a clustering problem (1989) (338)
Facets of the clique partitioning polytope (1990) (194)
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (2008) (154)
The Complexity of Computing Medians of Relations (1998) (81)
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing (2012) (49)
On dominating sets of maximal outerplanar graphs (2013) (48)
Aggregation of binary relations: algorithmic and polyhedral investigations (1986) (48)
An algorithm for the three-dimensional packing problem with asymptotic performance analysis (1997) (47)
The maximum agreement forest problem: Approximation algorithms and computational experiments (2007) (45)
Repetition-free longest common subsequence (2008) (44)
Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs (2007) (40)
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem (1999) (37)
Multidimensional Cube Packing (2001) (37)
Packing Problems with Orthogonal Rotations (2004) (31)
Some Approximation Results for the Maximum Agreement Forest Problem (2001) (31)
Two- and three-dimensional parametric packing (2005) (26)
Intersecting longest paths (2013) (26)
Packing Squares into Squares (1999) (23)
Cube Packing (2000) (23)
On k-leaf-connected graphs (1986) (22)
Composition of Facets of the Clique Partitioning Polytope (1990) (22)
Decomposing highly edge-connected graphs into paths of any given length (2015) (21)
Packing triangles in low degree graphs and indifference graphs (2008) (19)
Decompositions of triangle-free 5-regular graphs into paths of length five (2015) (17)
Packing subgraphs in a graph (2007) (17)
Rearrangement of DNA fragments: a branch-and-cut algorithm (2002) (17)
Approximation algorithms and hardness results for the clique packing problem (2007) (17)
Three-dimensional packings with rotations (2009) (16)
Polynomial-Time Approximation Schemes for Circle Packing Problems (2014) (15)
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems (2004) (15)
Decompositions of highly connected graphs into paths of length five (2015) (15)
Approximating a class of combinatorial problems with rational objective function (2010) (15)
Partitioning a graph into balanced connected classes: Formulations, separation and experiments (2021) (14)
Approximation Algorithms For The Orthogonal Z-Oriented 3-D Packing Problem (1999) (14)
Note on a min‐max conjecture of Woodall (2001) (13)
A note on the approximability of cutting stock problems (2007) (13)
Parametric on-line algorithms for packing rectangles and boxes (2003) (13)
Decomposing regular graphs with prescribed girth into paths of given length (2017) (12)
Selfish Square Packing (2011) (12)
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (1981) (12)
On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets (1981) (11)
On path-cycle decompositions of triangle-free graphs (2014) (11)
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (2009) (11)
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (2007) (11)
Polyhedral studies on the convex recoloring problem (2013) (11)
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems (2014) (10)
Pattern Inference under many Guises (2003) (10)
Approximation Results on Balanced Connected Partitions of Graphs (2004) (9)
Hardness and inapproximability of convex recoloring problems (2014) (9)
The convex recoloring problem: polyhedra, facets and computational experiments (2016) (9)
Hypotraceable digraphs (1980) (9)
On the Complexity of Solving or Approximating Convex Recoloring Problems (2013) (9)
Decomposing highly connected graphs into paths of length five (2015) (9)
The k-hop connected dominating set problem: hardness and polyhedra (2015) (8)
The k-hop connected dominating set problem: approximation and hardness (2017) (8)
Note on a min-max conjecture of Woodall (2001) (8)
Constructions of hypotraceable digraphs (1984) (7)
Intersection of Longest Paths in a Graph (2011) (6)
Direct measurement of the astrophysical reaction 14O( a, p) 17F (2004) (6)
Cut and Flow Formulations for the Balanced Connected k-Partition Problem (2020) (6)
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant (2008) (5)
Path decompositions of regular graphs with prescribed girth (2015) (5)
On the $$L$$L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (2015) (5)
Decompositions of highly connected graphs into paths of any given length (2015) (5)
Adjacency of vertices of the complete pre-order polytope (1997) (4)
Nontrivial path covers of graphs: existence, minimization and maximization (2020) (4)
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization (2018) (4)
Packing in generalized kernel systems: a framework that generalizes packing of branchings (2015) (3)
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (2017) (3)
Prices of anarchy of selfish 2D bin packing games (2017) (2)
Approximating Rational Objectives Is as Easy as Approximating Linear Ones (2006) (2)
Strong intractability of generalized convex recoloring problems (2017) (2)
Techniques and results on approximation algorithms for packing circles (2022) (2)
Strong intractability results for generalized convex recoloring problems (2020) (2)
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem (2012) (1)
A constrained path decomposition of cubic graphs and the path number of cacti (2013) (1)
Integer Programming Approaches to Balanced Connected k-Partition (2019) (1)
Circuit Covers in Series-Parallel Mixed Graphs (1998) (1)
The 2-Decomposition Conjecture for a new class of graphs (2021) (1)
Preface (2005) (1)
Adjacency of Vertices on the Clique Partitioning Polytope (1)
On the Circuit Cover Problem for Mixed Graphs (2002) (1)
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems (2022) (1)
Packing of Squares into Squares Packing of Squares into Squares (2008) (1)
Techniques and results on approximation algorithms for packing circles (2022) (0)
Preface (2005) (0)
The k-hop connected dominating set problem: approximation and hardness (2017) (0)
Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs (2023) (0)
The Minimum Cy le Cover and the Chinese PostmanProblems on Mixed Graphs with Bounded Tree-WidthCristina (1990) (0)
Preface (2008) (0)
Nontrivial path covers of graphs: existence, minimization and maximization (2019) (0)
Convex recoloring: inapproximability and a polyhedral study (2015) (0)
Approximation and parameterized algorithms to find balanced connected partitions of graphs (2021) (0)
The convex recoloring problem: polyhedra, facets and computational experiments (2015) (0)
Multidimensional Cube Packing 1 (0)
Packing in generalized kernel systems: a framework that generalizes packing of branchings (2014) (0)
A tight lower bound for the online bounded space hypercube bin packing problem (2021) (0)
Algorithms for Scheduling Sensors to Maximize Coverage Time (2013) (0)
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems (2015) (0)
Minimum Density of Identifying Codes of Hexagonal Grids with a Finite Number of Rows (2022) (0)
Tree 3-Spanners on Generalized Prisms of Graphs (2022) (0)
Minimum t-Spanners on Subcubic Graphs (2022) (0)
Special issue: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO 2005 - Preface (2008) (0)

This paper list is powered by the following services:

Other Resources About Yoshiko Wakabayashi

What Schools Are Affiliated With Yoshiko Wakabayashi?

Yoshiko Wakabayashi is affiliated with the following schools:

Yoshiko Wakabayashi's Academic­Influence.com Rankings

Why Is Yoshiko Wakabayashi Influential?

Yoshiko Wakabayashi's Published Works

Published Works

Other Resources About Yoshiko Wakabayashi

What Schools Are Affiliated With Yoshiko Wakabayashi?

Yoshiko Wakabayashi's AcademicInfluence.com Rankings