Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. - Yoshiko Ikebe; Tomomi Matsui; Akihisa Tamura (Discret. Appl. Math., 1993)

Algorithms for finding a Kth best valued assignment. - Tomomi Matsui; Akihisa Tamura; Yoshiko Ikebe (Discret. Appl. Math., 1994)

The Rooted Tree Embedding Problem into Points in the Plane. - Yoshiko Ikebe; Micha A. Perles; Akihisa Tamura; Shinnichi Tokunaga (Discret. Comput. Geom., 1994)

Ideal polytopes and face structures of some combinatorial optimization problems. - Yoshiko Ikebe; Akihisa Tamura (Math. Program., 1995)

Solving the Maximum Clique Problem Using PUBB. - Yuji Shinano; Tetsuya Fujie; Yoshiko Ikebe; Ryuichi Hirabayashi (IPPS/SPDP, 1998)

Polyhedral Proof of a Characterization of Perfect Bidirected Graphs. - Yoshiko Ikebe; Akihisa Tamura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

On the existence of sports schedules with multiple venues. - Yoshiko Ikebe; Akihisa Tamura (Discret. Appl. Math., 2008)

Construction of Hamilton Path Tournament Designs. - Yoshiko Ikebe; Akihisa Tamura (Graphs Comb., 2011)

On Computing Medians of Marked Point Process Data Under Edit Distance. - Noriyoshi Sukegawa; Shohei Suzuki; Yoshiko Ikebe; Yoshito Hirata (J. Optim. Theory Appl., 2024)