Research field (2)：
Mathematical informatics
, Information theory
Research keywords (5)：
algorithm theory
, approximation algorithm
, online algorithm
, stable matching
, computational complexity
Research theme for competitive and other funds (23)：
2024 - 2027 バイデザインアプローチと高解像度解析に基づく高機能共通鍵暗号技術の開拓
2020 - 2025 Extensions of stable matching problems and algorithm design
2021 - 2024 不完全情報に伴って生じる最悪の場合を回避する乱化技術と平均化技術の研究
2016 - 2021 Randomization technologies for algorithms taking incomplete inputs
2016 - 2021 Research on designing assignment algorithms using stable matchings
2014 - 2018 Research on the online buffer management problems using competitive analysis
2013 - 2016 Approximate Computing to Cope with Imperfect Information from Growing Data Size
2012 - 2016 Reasonable modeling and algorithm developments of stable matching problems
2008 - 2012 Research on Formalization and Algorithms for the Stable Matching Problems Adapted to Real World
2010 - 2012 Studies on Algorithms for Insufficient Spatial Information
2008 - 2012 Open Ubiquitous Network Architecture based on Host Identity Protocol
2009 - 2011 Contents-certified e-mail delivery systems using the Gradual Secret Exchange Protocol
2007 - 2009 Design and Analysis of Algorithms for Insufficient Information
2005 - 2008 各種配属問題への安定マッチングの応用
2005 - 2007 不正を許さないサーバレスネットワークゲーム
2004 - 2007 Research on modeling and algorithms for network problems
2004 - 2006 Studies on Diarete Algorithms with Guaranteed Quality based on Engineering Criteria
2003 - 2005 多様な局面に適合した安足マッチング問題の解法研究
2001 - 2003 High Quality Discrete Algorithms Based on Engineering Criteria
1998 - 2000 A fast search of approximate feasible solutions for real-world combinatorial problems
1998 - 2000 Development of fast routing algorithms using adaptation and randomization
1997 - 1999 Solving Real-World Combinatorial Problems using High-Speed SAT-Algorithms
1995 - 1998 問題相互の変換を利用した組合せアルゴリズムの効率化に関する研究
Show all
Papers (45)：
Tsubasa Harada, Toshiya Itoh, Shuichi Miyazaki. Capacity-insensitive algorithms for online facility assignment problems on a line. Discrete Mathematics, Algorithms and Applications. 2024. 16. 05. 2350057-1-2350057-39
Koki Hamada, Shuichi Miyazaki. Refined computational complexities of Hospitals/Residents problem with regional caps. Theoretical Computer Science. 2024. 989. 114389-1-114389-18
Kazuo Iwama, Shuichi Miyazaki. Marriage and Roommate. International Journal of Foundations of Computer Science. 2023. 34. 07. 853-873
Toshiya Itoh, Shuichi Miyazaki, Makoto Satake. Competitive analysis for two variants of online metric matching problem. Discrete Mathematics, Algorithms and Applications. 2021. 13. 06
Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto. Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. Algorithmica. 2021. 83. 9. 2678-2696
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps.
(Proc. the 28th International Computing and Combinatorics Conference (COCOON 2022) 2022)
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas.
(Proc. the 15th International Symposium on Algorithmic Game Theory (SAGT 2022) 2022)
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties.
(39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) 2022)
Competitive Analysis for Two Variants of Online Metric Matching Problem
(Combinatorial Optimization and Applications (COCOA 2020) Lecture Notes in Computer Science book series (LNCS, volume 12577) 2020)
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
(Combinatorial Algorithms (IWOCA 2020). Lecture Notes in Computer Science, vol 12126 2020)
1989 - 1993 Kyushu University School of Engineering
Professional career (1)：
Doctor of Engineering (Kyushu University)
Work history (4)：
2022/04 - 現在 University of Hyogo Graduate School of Information Science Professor
2007/04 - 2022/03 Kyoto University Academic Center for Computing and Media Studies Associate Professor
2002/04 - 2007/03 Kyoto University Academic Center for Computing and Media Studies Associate Professor
1998/04 - 2002/03 Kyoto University Graduate School of Informatics Research Associate
Awards (3)：
2019/07 - 30th International Workshop on Combinatorial Algorithms (IWOCA 2019) Best Paper Award An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number
2009/11 - 電子情報通信学会 ISSソサイエティ活動功労賞
2007/05 - Inose award (best paper award of the year) A (2-c log N/N)-Approximation Algorithm for the Stable Marriage Problem
