Yoshiko Wakabayashi

Papers

Total Citations

H-Index

About

Yoshiko Wakabayashi is a leading figure in combinatorial optimization and graph theory, renowned for her deep contributions to network partitioning and connectivity problems. Her work centers on the Balanced Connected k-Partition Problem, where she has developed novel cut and flow formulations that enable efficient decomposition of graphs into balanced, connected subgraphs—a challenge with applications in parallel computing, VLSI design, and data clustering. Her most cited paper, "Partitioning a graph into balanced connected classes: Formulations, separation and experiments" (2021, 35 citations), introduces powerful integer programming models and separation routines, demonstrating both theoretical elegance and practical solvability. Building on this, her "Cut and Flow Formulations for the Balanced Connected k-Partition Problem" (2020, 11 citations) further refines these techniques, offering robust algorithmic frameworks. Wakabayashi’s impact is evident in the sustained interest her work generates among researchers tackling complex graph partitioning tasks. Her achievements include advancing the understanding of connectivity constraints and providing computational tools that bridge theory and application. For students and researchers, her work exemplifies how rigorous combinatorial optimization can solve real-world problems, making her a pivotal voice in modern graph theory.