An Algorithm for Fractional Assignment Problems. - Maiko Shigeno; Yasufumi Saruwatari; Tomomi Matsui (Discret. Appl. Math., 1995)

A dual approximation approach to weighted matroid intersection. - Maiko Shigeno; Satoru Iwata 001 (Oper. Res. Lett., 1995)

A Cost-scaling Algorithm for 0-1 Submodular Flows. - Maiko Shigeno; Satoru Iwata 001 (Discret. Appl. Math., 1997)

A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences. - Satoru Iwata 001; Kazuo Murota; Maiko Shigeno (Math. Oper. Res., 1997)

The tree center problems and the relationship with the bottleneck knapsack problems. - Akiyoshi Shioura; Maiko Shigeno (Networks, 1997)

A Faster Algorithm for Minimum Cost Submodular Flows. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (SODA, 1998)

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (IPCO, 1999)

A fast cost scaling algorithm for submodular flow. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (Inf. Process. Lett., 2000)

Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. - Maiko Shigeno; Satoru Iwata 001; S. Thomas McCormick (Math. Oper. Res., 2000)

Minimax inverse problems of minimum cuts. - Maiko Shigeno (Networks, 2002)

Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization. - Satoru Iwata 001; Maiko Shigeno (SIAM J. Optim., 2002)

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (Comb., 2003)

Minimum Maximal Flow Problem: An Optimization over the Efficient Set. - Maiko Shigeno; Ichiro Takahashi; Yoshitsugu Yamamoto (J. Glob. Optim., 2003)

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (SIAM J. Discret. Math., 2005)

Maximum network flows with concave gains. - Maiko Shigeno (Math. Program., 2006)

New bounds on the minimum number of calls in failure-tolerant gossiping. - Zhe Hou; Maiko Shigeno (Networks, 2009)

A new parameter for a broadcast algorithm with locally bounded Byzantine faults. - Akira Ichimura; Maiko Shigeno (Inf. Process. Lett., 2010)

Approximation algorithms for a winner determination problem of single-item multi-unit auctions. - Satoshi Takahashi; Maiko Shigeno (JSIAM Lett., 2011)

Virtual Machine packing algorithms for lower power consumption. - Satoshi Takahashi; Hidemoto Nakada; Atsuko Takefusa; Tomohiro Kudoh; Maiko Shigeno; Akiko Yoshise (CloudCom, 2012)

Abstract: Virtual Machine Packing Algorithms for Lower Power Consumption. - Satoshi Takahashi; Atsuko Takefusa; Maiko Shigeno; Hidemoto Nakada; Tomohiro Kudoh; Akiko Yoshise (SC Companion, 2012)

Poster: Virtual Machine Packing Algorithms for Lower Power Consumption. - Satoshi Takahashi; Atsuko Takefusa; Maiko Shigeno; Hidemoto Nakada; Tomohiro Kudoh; Akiko Yoshise (SC Companion, 2012)

Progress in the Healthcare Service Innovation Project at the Tsukuba University Hospital. - Hideaki Takagi; Hisashi Kurata; Yukihiko Okada; Maiko Shigeno; Akiko Yoshise; Yongbing Zhang 001; Keizo Yamashita (SRII Global Conference, 2012)

A comment on pure-strategy Nash equilibria in competitive diffusion games. - Reiko Takehara; Masahiro Hachimori; Maiko Shigeno (Inf. Process. Lett., 2012)

Power Efficient Virtual Machine Packing for Green Datacenter. - Satoshi Takahashi; Atsuko Takefusa; Maiko Shigeno; Hidemoto Nakada; Tomohiro Kudoh; Akiko Yoshise (Int. J. Next Gener. Comput., 2013)

Ranking Smartphone Apps Based on Users' Behavior Records. - Song Luo; Maiko Shigeno; Wenbo Ma (ICServ, 2014)

On the Number of Edges in a Minimum C6-Saturated Graph. - Mingchao Zhang; Song Luo; Maiko Shigeno (Graphs Comb., 2015)

Cancel-and-tighten algorithm for quickest flow problems. - Masahide Saho; Maiko Shigeno (Networks, 2017)

Pure-strategy Nash equilibria on competitive diffusion games. - Hikoe Enomoto; Masahiro Hachimori; Shun Nakamura; Maiko Shigeno; Yuya Tanaka; Masaaki Tsugami (Discret. Appl. Math., 2018)

A New Approach for Developing Segmentation Algorithms for Strongly Imbalanced Data. - Kazuki Fujiwara; Maiko Shigeno; Ushio Sumita (IEEE Access, 2019)

Non-adaptive group testing on graphs with connectivity. - Song Luo; Yuji Matsuura; Ying Miao 001; Maiko Shigeno (J. Comb. Optim., 2019)

Bounds for two static optimization problems on routing and spectrum allocation of anycasting. - Yasutaka Miyagawa; Yosuke Watanabe; Maiko Shigeno; Kiyo Ishii; Atsuko Takefusa; Akiko Yoshise (Opt. Switch. Netw., 2019)

Multilayer Routing and Resource Assignment in Spatial Channel Networks (SCNs): Oriented Toward the Massive SDM Era. - Mingcong Yang; Qian Wu 003; Maiko Shigeno; Yongbing Zhang 001 (CoRR, 2020)

Analysis of the relation between smartphone usage changes during the COVID-19 pandemic and usage preferences on apps. - Yuxuan Yang; Maiko Shigeno (CoRR, 2021)

Strongly separable matrices for nonadaptive combinatorial group testing. - Jinping Fan; Hung-Lin Fu; Yujie Gu; Ying Miao 001; Maiko Shigeno (Discret. Appl. Math., 2021)

Restaurant Sales Forecasting with Feature Interaction-learning Mechanism-based Neural Network Model. - Xin Yang; Tetsuya Tsuboi; Keisuke Kimura; Keitarou Hangai; Maiko Shigeno (IEEE Big Data, 2022)

Height Estimation for Abrasive Grain of Synthetic Diamonds on Microscope Images by Conditional Adversarial Networks. - Joe Brinton; Shota Oki; Xin Yang; Maiko Shigeno (IEA/AIE, 2022)

Designing of OTN/WDM Networks with Recovery Methods for Multiple Failures. - Yiliu Tan; Yoshiki Nakano; Jiading Wang; Maiko Shigeno (OECC/PSC, 2022)

ILP models and improved methods for the problem of routing and spectrum allocation. - Jiading Wang; Maiko Shigeno; Qian Wu 003 (Opt. Switch. Netw., 2022)

A novel channel-based model for the problem of routing, space, and spectrum assignment. - Qian Wu 003; Jiading Wang; Maiko Shigeno (Opt. Switch. Netw., 2022)

Solving the Static Resource-Allocation Problem in SDM-EONs via a Node-Type ILP Model. - Jiading Wang; Sibo Chen; Qian Wu 003; Yiliu Tan; Maiko Shigeno (Sensors, 2022)

A Discrete JAYA Algorithm for Long-Term Carpooling Problem. - Wushuang Wang; Yu Li; Hidenobu Hashikami; Maiko Shigeno (GCCE, 2023)

Four-level knowledge graph contrastive learning structure for smart-phone application recommendation. - Xin Yang; Yu Li; Wenhui Ai; Maiko Shigeno (IWCMC, 2023)

Safe Route Carpooling to Avoid Accident Locations and Small-Scale Proof of Concept in Japan. - Hidenobu Hashikami; Ryotaro Kobayashi; Yu Li; Yoshiki Nakano; Maiko Shigeno (IEEE Trans. Syst. Man Cybern. Syst., 2023)

Carry-over Effect Values Minimization under Circle Method and Binary Factorization Based on Jaya Algorithm. - Wushuang Wang; Fei Xue; Toshiki Mitsui; Zhiyuan Shang; Maiko Shigeno (CCEAI, 2024)

A New Approach to Market Segmentation Based on 2-Dimensional Tables. - Naoya Tabata; Rin Itohiya; Hideshi Narita; Maiko Shigeno (ICCDE, 2024)

Optimizing Carpooling with Multiple Shared-Destinations: Reasonable Fare Calculation and Effective Route Planning. - Yu Li; Wushuang Wang; Maiko Shigeno (MIWAI (1), 2024)

Optimizing long-term carpooling with fairness: A collaborative Jaya algorithm. - Yu Li; Wushuang Wang; Hidenobu Hashikami; Maiko Shigeno (Comput. Ind. Eng., 2024)

Break maximization for round-robin tournaments without consecutive breaks. - Fei Xue; Hajunfu Ma; Maiko Shigeno (Oper. Res. Lett., 2024)

Hgformer: Hyperbolic Graph Transformer for Recommendation. - Xin Yang; Xingrun Li; Heng Chang; Jinze Yang; Xihong Yang; Shengyu Tao; Ningkang Chang; Maiko Shigeno; Junfeng Wang; Dawei Yin; Erxue Min (CoRR, 2025)