Optimal sharing. - Tetsuo Ichimori; Hiroaki Ishii; Toshio Nishida (Math. Program., 1982)

Two routing problems with the limitation of fuel. - Tetsuo Ichimori; Hiroaki Ishii; Toshio Nishida (Discret. Appl. Math., 1983)

Technical Note - On Min-Max Integer Allocation Problems. - Tetsuo Ichimori (Oper. Res., 1984)

A Two-Resource Allocation Problem Solvable in Linear Time. - Nimrod Megiddo; Tetsuo Ichimori (Math. Oper. Res., 1985)

Note on a Rectilinear Distance Round-Trip Location Problem. - Tetsuo Ichimori; Toshio Nishida (Transp. Sci., 1985)

A new method of software structural testing by path analysis. - Hiroshi Masuyama; Tetsuo Ichimori (Syst. Comput. Jpn., 1986)

The Fair Resource Allocation Problem with Submodular Constraints. - Satoru Fujishige; Naoki Katoh; Tetsuo Ichimori (Math. Oper. Res., 1988)

Tolerance of Double-Loop Computer Networks to Multinode Failures. - Hiroshi Masuyama; Tetsuo Ichimori (IEEE Trans. Computers, 1989)

A two-commodity sharing problem on networks. - Tetsuo Ichimori; Naoki Katoh (Networks, 1991)

One-to-all and all-to-all broadcasting algorithms in cellular networks. - Hiroshi Masuyama; Yuuta Fukudome; Tetsuo Ichimori (ICETE, 2005)

On ability of orthogonal genetic algorithms for the mixed chinese postman problem. - Hiroshi Masuyama; Tetsuo Ichimori; Toshihiko Sasama (ICSOFT (1), 2006)

New apportionment methods and their quota property. - Tetsuo Ichimori (JSIAM Lett., 2010)

On rounding off quotas to the nearest integers in the problem of apportionment. - Tetsuo Ichimori (JSIAM Lett., 2011)