JORSJ Vol. 61, No.1, pp. 132-150 （2018）
“Efficient overlap detection and construction algorithms for the bitmap shape packing problem”
Yannan Hu, Sho Fukatsu, Hideki Hashimoto, Shinji Imahori, and Mutsunori Yagiura

JORSJ Vol. 60, No. 3, pp. 216–243（2017）
“Algorithms for L-convex function minimization: connection between discrete convex analysis and other research fields”
Akiyoshi Shioura（Tokyo Institute of Technology）

JORSJ Vol.59, No.3, pp. 241–257 （2016）
“A Structural Geometrical Analysis of Weakly Infeasible SDPs”
Bruno F. Lourenco （Seikei University）, Masakazu Muramatsu （The University of Electro-Communications）, and Takashi Tsuchiya （National Graduate Institute for Policy Studies）

JORSJ Vol.58, No.1, pp. 61-103 (2015)
GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
Akiyoshi Shioura (Tohoku University) and Akihisa Tamura (Keio University)

JORSJ Vol.57, No.1, pp. 45-61 (2014)
ENUMERATING BOTTOM-LEFT STABLE POSITIONS FOR RECTANGLE PLACEMENTS WITH OVERLAP
Shinji Imahori, Yuyao Chien (Nagoya University), Yuma Tanaka (Seikei University), and Mutsunori Yagiura (Nagoya University)

JORSJ Vol.56, No.4, pp. 257-308 (2013)
TAIL ASYMPTOTICS FOR CUMULATIVE PROCESSES SAMPLED AT HEAVY-TAILED RANDOM TIMES WITH APPLICATIONS TO QUEUEING MODELS IN MARKOVIAN ENVIRONMENTS
Hiroyuki Masuyama (Kyoto University)

JORSJ Vol.55, No.1, pp. 73-91 (2012)
LEAST DISTANCE BASED INEFFICIENCY MEASURES ON THE PARETO-EFFICIENT FRONTIER IN DEA
Kazutoshi Ando, Atsuhiko Kai, Yasunobu Maeda, and Kazuyuki Sekitani (Shizuoka University)

JORSJ　 Vol.54　No.4, pp. 237-258 (2011)
MAXIMUM FLOW-COVERING LOCATION AND SERVICE START TIME PROBLEM AND ITS APPLICATION TO TOKYO METROPOLITAN RAILWAY NETWORK
Ken-ichi Tanaka (The University of Electro-Communications)

JORSJ　 Vol.53, No.4, pp. 289–304 (2010)
SAMPLING SITE LOCATION PROBLEM IN LAKE MONITORING HAVING MULTIPLE PURPOSES AND CONSTRAINTS
Kazuya Haraguchi (Ishinomaki Senshu University) , Yuichi Sato (Lake Biwa Environmental Research Institute)