| 2009 |
|---|
| 21 | EE | Natalia V. Shakhlevich,
Akiyoshi Shioura,
Vitaly A. Strusevich:
Single Machine Scheduling with Controllable Processing Times by submodular Optimization.
Int. J. Found. Comput. Sci. 20(2): 247-269 (2009) |
| 2008 |
|---|
| 20 | EE | Natalia V. Shakhlevich,
Akiyoshi Shioura,
Vitaly A. Strusevich:
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.
ESA 2008: 756-767 |
| 2007 |
|---|
| 19 | EE | Akiyoshi Shioura,
Kenichiro Tanaka:
Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems.
SIAM J. Discrete Math. 21(2): 504-522 (2007) |
| 2006 |
|---|
| 18 | EE | Akiyoshi Shioura,
Takeshi Tokuyama:
Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm.
Inf. Process. Lett. 100(6): 213-219 (2006) |
| 2005 |
|---|
| 17 | EE | Akiyoshi Shioura,
Takeshi Tokuyama:
Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm.
AAIM 2005: 291-300 |
| 16 | EE | Kenichiro Ohta,
Kunihiko Sadakane,
Akiyoshi Shioura,
Takeshi Tokuyama:
A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options.
Algorithmica 42(2): 141-158 (2005) |
| 15 | EE | Kazuo Murota,
Akiyoshi Shioura:
Substitutes and complements in network flows viewed as discrete convexity.
Discrete Optimization 2(3): 256-268 (2005) |
| 2004 |
|---|
| 14 | EE | Akiyoshi Shioura:
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
Discrete Applied Mathematics 134(1-3): 303-316 (2004) |
| 13 | EE | Satoko Moriguchi,
Akiyoshi Shioura:
On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem.
Math. Oper. Res. 29(2): 394-397 (2004) |
| 12 | EE | Kazuo Murota,
Akiyoshi Shioura:
Conjugacy relationship between M-convex and L-convex functions in continuous variables.
Math. Program. 101(3): 415-433 (2004) |
| 11 | EE | Akiyoshi Shioura:
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks.
Oper. Res. Lett. 32(1): 31-35 (2004) |
| 2003 |
|---|
| 10 | EE | Kazuo Murota,
Akiyoshi Shioura:
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization.
Discrete Applied Mathematics 131(2): 467-494 (2003) |
| 2002 |
|---|
| 9 | EE | Kenichiro Ohta,
Kunihiko Sadakane,
Akiyoshi Shioura,
Takeshi Tokuyama:
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options.
ESA 2002: 772-784 |
| 2001 |
|---|
| 8 | | Kazuo Murota,
Akiyoshi Shioura:
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
Discrete Applied Mathematics 115(1-3): 151-176 (2001) |
| 2000 |
|---|
| 7 | EE | S. Thomas McCormick,
Akiyoshi Shioura:
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks.
SODA 2000: 944-952 |
| 6 | EE | S. Thomas McCormick,
Akiyoshi Shioura:
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks.
Oper. Res. Lett. 27(5): 199-207 (2000) |
| 1998 |
|---|
| 5 | EE | Akiyoshi Shioura:
A Constructive Proof for the Induction of M-convex Functions through Networks.
Discrete Applied Mathematics 82(1-3): 271-278 (1998) |
| 4 | EE | Akiyoshi Shioura:
Minimization of an M-convex Function.
Discrete Applied Mathematics 84(1-3): 215-220 (1998) |
| 1997 |
|---|
| 3 | | Akiyoshi Shioura,
Takeaki Uno:
A Linear Time Algorithm for Finding a k-Tree Core.
J. Algorithms 23(2): 281-290 (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) |
| 1 | | Akiyoshi Shioura,
Akihisa Tamura,
Takeaki Uno:
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.
SIAM J. Comput. 26(3): 678-692 (1997) |
