| 2009 |
|---|
| 12 | EE | Zhe Hou,
Maiko Shigeno:
New bounds on the minimum number of calls in failure-tolerant gossiping.
Networks 53(1): 35-38 (2009) |
| 2006 |
|---|
| 11 | EE | Maiko Shigeno:
Maximum network flows with concave gains.
Math. Program. 107(3): 439-459 (2006) |
| 2005 |
|---|
| 10 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.
SIAM J. Discrete Math. 19(2): 304-320 (2005) |
| 2003 |
|---|
| 9 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.
Combinatorica 23(3): 503-525 (2003) |
| 2002 |
|---|
| 8 | EE | Maiko Shigeno:
Minimax inverse problems of minimum cuts.
Networks 39(1): 7-14 (2002) |
| 2000 |
|---|
| 7 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A fast cost scaling algorithm for submodular flow.
Inf. Process. Lett. 74(3-4): 123-128 (2000) |
| 6 | EE | 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) |
| 1999 |
|---|
| 5 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.
IPCO 1999: 259-272 |
| 1998 |
|---|
| 4 | | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A Faster Algorithm for Minimum Cost Submodular Flows.
SODA 1998: 167-174 |
| 1997 |
|---|
| 3 | EE | Maiko Shigeno,
Satoru Iwata:
A Cost-scaling Algorithm for 0-1 Submodular Flows.
Discrete Applied Mathematics 73(3): 261-273 (1997) |
| 2 | EE | Akiyoshi Shioura,
Maiko Shigeno:
The tree center problems and the relationship with the bottleneck knapsack problems.
Networks 29(2): 107-110 (1997) |
| 1995 |
|---|
| 1 | EE | Maiko Shigeno,
Yasufumi Saruwatari,
Tomomi Matsui:
An Algorithm for Fractional Assignment Problems.
Discrete Applied Mathematics 56(2-3): 333-343 (1995) |
