default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaiko Shigeno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Wushuang Wang
, Fei Xue, Toshiki Mitsui, Zhiyuan Shang, Maiko Shigeno:
Carry-over Effect Values Minimization under Circle Method and Binary Factorization Based on Jaya Algorithm. CCEAI 2024: 44-51- [c13]Naoya Tabata, Rin Itohiya, Hideshi Narita, Maiko Shigeno:
A New Approach to Market Segmentation Based on 2-Dimensional Tables. ICCDE 2024: 8-13 - 2023
- [j28]Hidenobu Hashikami, Ryotaro Kobayashi, Yu Li, Yoshiki Nakano, Maiko Shigeno:
Safe Route Carpooling to Avoid Accident Locations and Small-Scale Proof of Concept in Japan. IEEE Trans. Syst. Man Cybern. Syst. 53(7): 4239-4250 (2023) - [c12]Wushuang Wang, Yu Li, Hidenobu Hashikami, Maiko Shigeno:
A Discrete JAYA Algorithm for Long-Term Carpooling Problem. GCCE 2023: 1075-1076 - [c11]Xin Yang, Yu Li, Wenhui Ai, Maiko Shigeno:
Four-level knowledge graph contrastive learning structure for smart-phone application recommendation. IWCMC 2023: 1340-1345 - 2022
- [j27]Qian Wu, Jiading Wang, Maiko Shigeno:
A novel channel-based model for the problem of routing, space, and spectrum assignment. Opt. Switch. Netw. 43: 100636 (2022) - [j26]Jiading Wang, Maiko Shigeno, Qian Wu:
ILP models and improved methods for the problem of routing and spectrum allocation. Opt. Switch. Netw. 45: 100675 (2022) - [j25]Jiading Wang, Sibo Chen, Qian Wu, Yiliu Tan, Maiko Shigeno:
Solving the Static Resource-Allocation Problem in SDM-EONs via a Node-Type ILP Model. Sensors 22(24): 9710 (2022) - [c10]Xin Yang, Tetsuya Tsuboi, Keisuke Kimura, Keitarou Hangai, Maiko Shigeno:
Restaurant Sales Forecasting with Feature Interaction-learning Mechanism-based Neural Network Model. IEEE Big Data 2022: 4166-4172 - [c9]Joe Brinton, Shota Oki, Xin Yang, Maiko Shigeno:
Height Estimation for Abrasive Grain of Synthetic Diamonds on Microscope Images by Conditional Adversarial Networks. IEA/AIE 2022: 797-804 - [c8]Yiliu Tan, Yoshiki Nakano, Jiading Wang, Maiko Shigeno:
Designing of OTN/WDM Networks with Recovery Methods for Multiple Failures. OECC/PSC 2022: 1-3 - 2021
- [j24]Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno:
Strongly separable matrices for nonadaptive combinatorial group testing. Discret. Appl. Math. 291: 180-187 (2021) - [i2]Yuxuan Yang, Maiko Shigeno:
Analysis of the relation between smartphone usage changes during the COVID-19 pandemic and usage preferences on apps. CoRR abs/2110.01331 (2021) - 2020
- [i1]Mingcong Yang, Qian Wu, Maiko Shigeno, Yongbing Zhang:
Multilayer Routing and Resource Assignment in Spatial Channel Networks (SCNs): Oriented Toward the Massive SDM Era. CoRR abs/2002.02880 (2020)
2010 – 2019
- 2019
- [j23]Kazuki Fujiwara, Maiko Shigeno, Ushio Sumita:
A New Approach for Developing Segmentation Algorithms for Strongly Imbalanced Data. IEEE Access 7: 82970-82977 (2019) - [j22]Song Luo, Yuji Matsuura, Ying Miao, Maiko Shigeno:
Non-adaptive group testing on graphs with connectivity. J. Comb. Optim. 38(1): 278-291 (2019) - [j21]Yasutaka Miyagawa, Yosuke Watanabe, Maiko Shigeno, Kiyo Ishii, Atsuko Takefusa, Akiko Yoshise:
Bounds for two static optimization problems on routing and spectrum allocation of anycasting. Opt. Switch. Netw. 31: 144-161 (2019) - 2018
- [j20]Hikoe Enomoto, Masahiro Hachimori, Shun Nakamura, Maiko Shigeno, Yuya Tanaka, Masaaki Tsugami:
Pure-strategy Nash equilibria on competitive diffusion games. Discret. Appl. Math. 244: 1-19 (2018) - 2017
- [j19]Masahide Saho, Maiko Shigeno:
Cancel-and-tighten algorithm for quickest flow problems. Networks 69(2): 179-188 (2017) - 2015
- [j18]Mingchao Zhang, Song Luo, Maiko Shigeno:
On the Number of Edges in a Minimum C6-Saturated Graph. Graphs Comb. 31(4): 1085-1106 (2015) - 2014
- [c7]Song Luo, Maiko Shigeno, Wenbo Ma:
Ranking Smartphone Apps Based on Users' Behavior Records. ICServ 2014: 345-358 - 2013
- [j17]Satoshi Takahashi, Atsuko Takefusa, Maiko Shigeno, Hidemoto Nakada, Tomohiro Kudoh, Akiko Yoshise:
Power Efficient Virtual Machine Packing for Green Datacenter. Int. J. Next Gener. Comput. 4(2) (2013) - 2012
- [j16]Reiko Takehara, Masahiro Hachimori, Maiko Shigeno:
A comment on pure-strategy Nash equilibria in competitive diffusion games. Inf. Process. Lett. 112(3): 59-60 (2012) - [c6]Satoshi Takahashi, Hidemoto Nakada, Atsuko Takefusa, Tomohiro Kudoh, Maiko Shigeno, Akiko Yoshise:
Virtual Machine packing algorithms for lower power consumption. CloudCom 2012: 161-168 - [c5]Satoshi Takahashi, Atsuko Takefusa, Maiko Shigeno, Hidemoto Nakada, Tomohiro Kudoh, Akiko Yoshise:
Abstract: Virtual Machine Packing Algorithms for Lower Power Consumption. SC Companion 2012: 1517-1518 - [c4]Satoshi Takahashi, Atsuko Takefusa, Maiko Shigeno, Hidemoto Nakada, Tomohiro Kudoh, Akiko Yoshise:
Poster: Virtual Machine Packing Algorithms for Lower Power Consumption. SC Companion 2012: 1519-1520 - [c3]Hideaki Takagi, Hisashi Kurata, Yukihiko Okada, Maiko Shigeno, Akiko Yoshise, Yongbing Zhang, Keizo Yamashita:
Progress in the Healthcare Service Innovation Project at the Tsukuba University Hospital. SRII Global Conference 2012: 667-671 - 2011
- [j15]Satoshi Takahashi, Maiko Shigeno:
Approximation algorithms for a winner determination problem of single-item multi-unit auctions. JSIAM Lett. 3: 29-32 (2011) - 2010
- [j14]Akira Ichimura, Maiko Shigeno:
A new parameter for a broadcast algorithm with locally bounded Byzantine faults. Inf. Process. Lett. 110(12-13): 514-517 (2010)
2000 – 2009
- 2009
- [j13]Zhe Hou, Maiko Shigeno:
New bounds on the minimum number of calls in failure-tolerant gossiping. Networks 53(1): 35-38 (2009) - 2006
- [j12]Maiko Shigeno:
Maximum network flows with concave gains. Math. Program. 107(3): 439-459 (2006) - 2005
- [j11]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM J. Discret. Math. 19(2): 304-320 (2005) - 2003
- [j10]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Comb. 23(3): 503-525 (2003) - 2002
- [j9]Maiko Shigeno:
Minimax inverse problems of minimum cuts. Networks 39(1): 7-14 (2002) - [j8]Satoru Iwata, Maiko Shigeno:
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization. SIAM J. Optim. 13(1): 204-211 (2002) - 2000
- [j7]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. 74(3-4): 123-128 (2000) - [j6]Maiko Shigeno, Satoru Iwata, S. Thomas McCormick:
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. Math. Oper. Res. 25(1): 76-104 (2000)
1990 – 1999
- 1999
- [c2]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO 1999: 259-272 - 1998
- [c1]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Faster Algorithm for Minimum Cost Submodular Flows. SODA 1998: 167-174 - 1997
- [j5]Maiko Shigeno, Satoru Iwata:
A Cost-scaling Algorithm for 0-1 Submodular Flows. Discret. Appl. Math. 73(3): 261-273 (1997) - [j4]Satoru Iwata, Kazuo Murota, Maiko Shigeno:
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences. Math. Oper. Res. 22(4): 803-813 (1997) - [j3]Akiyoshi Shioura, Maiko Shigeno:
The tree center problems and the relationship with the bottleneck knapsack problems. Networks 29(2): 107-110 (1997) - 1995
- [j2]Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui:
An Algorithm for Fractional Assignment Problems. Discret. Appl. Math. 56(2-3): 333-343 (1995) - [j1]Maiko Shigeno, Satoru Iwata:
A dual approximation approach to weighted matroid intersection. Oper. Res. Lett. 18(3): 153-156 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-13 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
