Maiko Shigeno

According to our database1, Maiko Shigeno
  • authored at least 25 papers between 1995 and 2018.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Pure-strategy Nash equilibria on competitive diffusion games.
Discrete Applied Mathematics, 2018

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

2015
On the Number of Edges in a Minimum C6-Saturated Graph.
Graphs and Combinatorics, 2015

2013
Power Efficient Virtual Machine Packing for Green Datacenter.
IJNGC, 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

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. Discrete Math., 2005

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

2002
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization.
SIAM Journal on Optimization, 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.
Discrete Applied Mathematics, 1997

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

An Algorithm for Fractional Assignment Problems.
Discrete Applied Mathematics, 1995


  Loading...