Maiko Shigeno

Orcid: 0000-0002-3671-9434

According to our database1, Maiko Shigeno authored at least 44 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A New Approach to Market Segmentation Based on 2-Dimensional Tables.
Proceedings of the 2024 10th International Conference on Computing and Data Engineering, 2024

Carry-over Effect Values Minimization under Circle Method and Binary Factorization Based on Jaya Algorithm.
Proceedings of the 2024 8th International Conference on Control Engineering and Artificial Intelligence, 2024

2023
Safe Route Carpooling to Avoid Accident Locations and Small-Scale Proof of Concept in Japan.
IEEE Trans. Syst. Man Cybern. Syst., July, 2023

Four-level knowledge graph contrastive learning structure for smart-phone application recommendation.
Proceedings of the International Wireless Communications and Mobile Computing, 2023

A Discrete JAYA Algorithm for Long-Term Carpooling Problem.
Proceedings of the 12th IEEE Global Conference on Consumer Electronics, 2023

2022
Solving the Static Resource-Allocation Problem in SDM-EONs via a Node-Type ILP Model.
Sensors, 2022

A novel channel-based model for the problem of routing, space, and spectrum assignment.
Opt. Switch. Netw., 2022

ILP models and improved methods for the problem of routing and spectrum allocation.
Opt. Switch. Netw., 2022

Designing of OTN/WDM Networks with Recovery Methods for Multiple Failures.
Proceedings of the 2022 27th OptoElectronics and Communications Conference (OECC) and 2022 International Conference on Photonics in Switching and Computing (PSC), 2022

Height Estimation for Abrasive Grain of Synthetic Diamonds on Microscope Images by Conditional Adversarial Networks.
Proceedings of the Advances and Trends in Artificial Intelligence. Theory and Practices in Artificial Intelligence, 2022

Restaurant Sales Forecasting with Feature Interaction-learning Mechanism-based Neural Network Model.
Proceedings of the IEEE International Conference on Big Data, 2022

2021
Strongly separable matrices for nonadaptive combinatorial group testing.
Discret. Appl. Math., 2021

Analysis of the relation between smartphone usage changes during the COVID-19 pandemic and usage preferences on apps.
CoRR, 2021

2020
Multilayer Routing and Resource Assignment in Spatial Channel Networks (SCNs): Oriented Toward the Massive SDM Era.
CoRR, 2020

2019
Bounds for two static optimization problems on routing and spectrum allocation of anycasting.
Opt. Switch. Netw., 2019

Non-adaptive group testing on graphs with connectivity.
J. Comb. Optim., 2019

A New Approach for Developing Segmentation Algorithms for Strongly Imbalanced Data.
IEEE Access, 2019

2018
Pure-strategy Nash equilibria on competitive diffusion games.
Discret. Appl. Math., 2018

2017
Cancel-and-tighten algorithm for quickest flow problems.
Networks, 2017

2015
On the Number of Edges in a Minimum C<sub>6</sub>-Saturated Graph.
Graphs Comb., 2015

2014
Ranking Smartphone Apps Based on Users' Behavior Records.
Proceedings of the Serviceology for Designing the Future, 2014

2013
Power Efficient Virtual Machine Packing for Green Datacenter.
Int. J. Next Gener. Comput., 2013

2012
A comment on pure-strategy Nash equilibria in competitive diffusion games.
Inf. Process. Lett., 2012

Progress in the Healthcare Service Innovation Project at the Tsukuba University Hospital.
Proceedings of the 2012 Annual SRII Global Conference, San Jose, CA, USA, July 24-27, 2012, 2012

Poster: Virtual Machine Packing Algorithms for Lower Power Consumption.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Abstract: Virtual Machine Packing Algorithms for Lower Power Consumption.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Virtual Machine packing algorithms for lower power consumption.
Proceedings of the 4th IEEE International Conference on Cloud Computing Technology and Science Proceedings, 2012

2011
Approximation algorithms for a winner determination problem of single-item multi-unit auctions.
JSIAM Lett., 2011

2010
A new parameter for a broadcast algorithm with locally bounded Byzantine faults.
Inf. Process. Lett., 2010

2009
New bounds on the minimum number of calls in failure-tolerant gossiping.
Networks, 2009

2006
Maximum network flows with concave gains.
Math. Program., 2006

2005
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.
SIAM J. Discret. Math., 2005

2003
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.
Comb., 2003

2002
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization.
SIAM J. Optim., 2002

Minimax inverse problems of minimum cuts.
Networks, 2002

2000
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.
Math. Oper. Res., 2000

A fast cost scaling algorithm for submodular flow.
Inf. Process. Lett., 2000

1999
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
A Faster Algorithm for Minimum Cost Submodular Flows.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
The tree center problems and the relationship with the bottleneck knapsack problems.
Networks, 1997

A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences.
Math. Oper. Res., 1997

A Cost-scaling Algorithm for 0-1 Submodular Flows.
Discret. Appl. Math., 1997

1995
A dual approximation approach to weighted matroid intersection.
Oper. Res. Lett., 1995

An Algorithm for Fractional Assignment Problems.
Discret. Appl. Math., 1995


  Loading...