default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkiyoshi Shioura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Akiyoshi Shioura
, Vitaly A. Strusevich, Natalia V. Shakhlevich:
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. Networks 83(3): 527-546 (2024)- [j44]Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich:
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. 27(2): 203-224 (2024) - 2022
- [j43]Akiyoshi Shioura:
M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System. Math. Oper. Res. 47(2): 1566-1611 (2022) - [c13]Yusuke Saito, Akiyoshi Shioura:
Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines. ISCO 2022: 324-335 - 2020
- [j42]Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura:
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. Inf. Process. Lett. 162: 105991 (2020) - [j41]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. J. Glob. Optim. 76(3): 471-490 (2020)
2010 – 2019
- 2018
- [j40]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored spanning graphs for set visualization. Comput. Geom. 68: 262-276 (2018) - [j39]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur. J. Oper. Res. 266(3): 795-818 (2018) - [j38]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas:
Models and algorithms for energy-efficient scheduling with immediate start of jobs. J. Sched. 21(5): 505-516 (2018) - 2017
- [j37]Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama:
Buyback problem with discrete concave valuation functions. Discret. Optim. 26: 78-96 (2017) - [j36]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints. INFORMS J. Comput. 29(4): 724-736 (2017) - 2016
- [j35]Kazuo Murota, Akiyoshi Shioura, Zaifu Yang:
Time bounds for iterative auctions: A unified approach by discrete convex analysis. Discret. Optim. 19: 36-62 (2016) - [j34]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines. INFORMS J. Comput. 28(1): 148-161 (2016) - [c12]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. DOOR 2016: 74-90 - [i1]Ferran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán, Akiyoshi Shioura, Rodrigo I. Silveira, Bettina Speckmann, Takeshi Tokuyama:
Colored Spanning Graphs for Set Visualization. CoRR abs/1603.00580 (2016) - 2015
- [j33]Akiyoshi Shioura:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1144 (2015) - [j32]Akiyoshi Shioura:
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints. Math. Oper. Res. 40(1): 192-225 (2015) - [j31]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math. Program. 153(2): 495-534 (2015) - [c11]Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama:
Buyback Problem with Discrete Concave Valuation Functions. WAOA 2015: 72-83 - 2014
- [j30]Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama:
A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1220-1230 (2014) - [j29]Kazuo Murota, Akiyoshi Shioura:
Dijkstra's algorithm and L-concave function maximization. Math. Program. 145(1-2): 163-177 (2014) - [j28]Kazuo Murota, Akiyoshi Shioura:
Exact bounds for steepest descent algorithms of L-convex function minimization. Oper. Res. Lett. 42(5): 361-366 (2014) - 2013
- [j27]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. SIAM J. Discret. Math. 27(1): 186-204 (2013) - [c10]Kazuo Murota, Akiyoshi Shioura, Zaifu Yang:
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items. ISAAC 2013: 468-478 - 2012
- [j26]Akiyoshi Shioura:
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra. SIAM J. Discret. Math. 26(1): 114-144 (2012) - [c9]Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama:
A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks. ALGOSENSORS 2012: 54-65 - 2011
- [j25]Satoko Moriguchi, Akiyoshi Shioura, Nobuyuki Tsuchimura:
M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm. SIAM J. Optim. 21(3): 633-668 (2011) - [c8]Akiyoshi Shioura:
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints. ESA 2011: 1-12 - [c7]Akiyoshi Shioura, Shunya Suzuki:
Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions. TAMC 2011: 142-153 - 2010
- [j24]Akiyoshi Shioura, Mutsunori Yagiura:
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. J. Graph Algorithms Appl. 14(2): 391-407 (2010) - [c6]Akiyoshi Shioura:
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra. ISAAC (1) 2010: 169-181
2000 – 2009
- 2009
- [j23]Vladimir Kolmogorov, Akiyoshi Shioura:
New algorithms for convex cost tension problem with application to computer vision. Discret. Optim. 6(4): 378-393 (2009) - [j22]Akiyoshi Shioura:
On the Pipage Rounding Algorithm for Submodular Function Maximization - a View from Discrete Convex Analysis. Discret. Math. Algorithms Appl. 1(1): 1-24 (2009) - [j21]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) - [c5]Akiyoshi Shioura, Mutsunori Yagiura:
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. COCOON 2009: 116-126 - 2008
- [c4]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
- [j20]Akiyoshi Shioura, Ken'ichiro Tanaka:
Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems. SIAM J. Discret. Math. 21(2): 504-522 (2007) - 2006
- [j19]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
- [j18]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) - [j17]Kazuo Murota, Akiyoshi Shioura:
Substitutes and complements in network flows viewed as discrete convexity. Discret. Optim. 2(3): 256-268 (2005) - [c3]Akiyoshi Shioura, Takeshi Tokuyama:
Efficiently Pricing European-Asian Options - Ultimate Implementation and Analysis of the AMO Algorithm. AAIM 2005: 291-300 - 2004
- [j16]Kazuo Murota, Akiyoshi Shioura:
Quadratic M-convex and L-convex functions. Adv. Appl. Math. 33(2): 318-341 (2004) - [j15]Akiyoshi Shioura:
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. Discret. Appl. Math. 134(1-3): 303-316 (2004) - [j14]Satoko Moriguchi, Akiyoshi Shioura:
On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem. Math. Oper. Res. 29(2): 394-397 (2004) - [j13]Kazuo Murota, Akiyoshi Shioura:
Conjugacy relationship between M-convex and L-convex functions in continuous variables. Math. Program. 101(3): 415-433 (2004) - [j12]Akiyoshi Shioura:
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks. Oper. Res. Lett. 32(1): 31-35 (2004) - 2003
- [j11]Kazuo Murota, Akiyoshi Shioura:
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization. Discret. Appl. Math. 131(2): 467-494 (2003) - 2002
- [j10]Satoko Moriguchi, Kazuo Murota, Akiyoshi Shioura:
Scaling Algorithms for M-Convex Function Minimization. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 922-929 (2002) - [c2]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
- [j9]Kazuo Murota, Akiyoshi Shioura:
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. Discret. Appl. Math. 115(1-3): 151-176 (2001) - 2000
- [j8]Kazuo Murota, Akiyoshi Shioura:
Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions. Adv. Appl. Math. 25(4): 352-427 (2000) - [j7]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) - [c1]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
1990 – 1999
- 1999
- [j6]Kazuo Murota, Akiyoshi Shioura:
M-Convex Function on Generalized Polymatroid. Math. Oper. Res. 24(1): 95-105 (1999) - 1998
- [j5]Akiyoshi Shioura:
A Constructive Proof for the Induction of M-convex Functions through Networks. Discret. Appl. Math. 82(1-3): 271-278 (1998) - [j4]Akiyoshi Shioura:
Minimization of an M-convex Function. Discret. Appl. Math. 84(1-3): 215-220 (1998) - 1997
- [j3]Akiyoshi Shioura, Takeaki Uno:
A Linear Time Algorithm for Finding a k-Tree Core. J. Algorithms 23(2): 281-290 (1997) - [j2]Akiyoshi Shioura, Maiko Shigeno:
The tree center problems and the relationship with the bottleneck knapsack problems. Networks 29(2): 107-110 (1997) - [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
