The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Akiyoshi Shioura: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Akiyoshi Shioura, Takeshi Tokuyama
    Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm. [Citation Graph (0, 0)][DBLP]
    AAIM, 2005, pp:291-300 [Conf]
  2. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
    A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:772-784 [Conf]
  3. S. Thomas McCormick, Akiyoshi Shioura
    Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:944-952 [Conf]
  4. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
    A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:2, pp:141-158 [Journal]
  5. Kazuo Murota, Akiyoshi Shioura
    Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:151-176 [Journal]
  6. Kazuo Murota, Akiyoshi Shioura
    Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:467-494 [Journal]
  7. Akiyoshi Shioura
    Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:303-316 [Journal]
  8. Akiyoshi Shioura
    A Constructive Proof for the Induction of M-convex Functions through Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:271-278 [Journal]
  9. Akiyoshi Shioura
    Minimization of an M-convex Function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:215-220 [Journal]
  10. Akiyoshi Shioura, Takeshi Tokuyama
    Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:6, pp:213-219 [Journal]
  11. Akiyoshi Shioura, Takeaki Uno
    A Linear Time Algorithm for Finding a k-Tree Core. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:281-290 [Journal]
  12. Satoko Moriguchi, Akiyoshi Shioura
    On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:2, pp:394-397 [Journal]
  13. Kazuo Murota, Akiyoshi Shioura
    Conjugacy relationship between M-convex and L-convex functions in continuous variables. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:101, n:3, pp:415-433 [Journal]
  14. Akiyoshi Shioura, Maiko Shigeno
    The tree center problems and the relationship with the bottleneck knapsack problems. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:2, pp:107-110 [Journal]
  15. S. Thomas McCormick, Akiyoshi Shioura
    Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:199-207 [Journal]
  16. Akiyoshi Shioura
    The MA-ordering max-flow algorithm is not strongly polynomial for directed networks. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:31-35 [Journal]
  17. Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno
    An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:678-692 [Journal]

  18. A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. [Citation Graph (, )][DBLP]


  19. Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002