default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuichi Miyazaki
Person information
- affiliation: University of Hyogo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j35]Tsubasa Harada
, Toshiya Itoh, Shuichi Miyazaki:
Capacity-insensitive algorithms for online facility assignment problems on a line. Discret. Math. Algorithms Appl. 16(5): 2350057:1-2350057:39 (2024)- [j34]Koki Hamada, Shuichi Miyazaki:
Refined computational complexities of Hospitals/Residents problem with regional caps. Theor. Comput. Sci. 989: 114389 (2024) - 2023
- [j33]Kazuo Iwama, Shuichi Miyazaki:
Marriage and Roommate. Int. J. Found. Comput. Sci. 34(7): 853-873 (2023) - 2021
- [j32]Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto:
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. Algorithmica 83(9): 2678-2696 (2021) - [j31]Toshiya Itoh, Shuichi Miyazaki, Makoto Satake:
Competitive analysis for two variants of online metric matching problem. Discret. Math. Algorithms Appl. 13(6): 2150156:1-2150156:16 (2021) - [j30]Yuki Matsuyama, Shuichi Miyazaki:
Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem. J. Inf. Process. 29: 166-173 (2021) - 2020
- [j29]Yoshiyuki Mihara, Shuichi Miyazaki, Yasuo Okabe, Tetsuya Yamaguchi, Manabu Okamoto:
Identifying Link Layer Home Network Topologies Using HTIP. IEICE Trans. Inf. Syst. 103-D(3): 566-577 (2020) - 2019
- [j28]Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara:
On Computational Complexity of Pipe Puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1134-1141 (2019) - [j27]Shuichi Miyazaki, Kazuya Okamoto:
Jointly stable matchings. J. Comb. Optim. 38(2): 646-665 (2019) - 2017
- [j26]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better bounds for online k-frame throughput maximization in network switches. Theor. Comput. Sci. 657: 173-190 (2017) - [j25]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms. Theor. Comput. Sci. 675: 27-42 (2017) - 2016
- [j24]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Lower Quotas. Algorithmica 74(1): 440-465 (2016) - 2015
- [j23]Minseon Lee, Shuichi Miyazaki, Kazuo Iwama:
Finding Witnesses for Stability in the Hospitals/Residents Problem. J. Inf. Process. 23(2): 202-209 (2015) - 2014
- [j22]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. Algorithmica 68(3): 758-775 (2014) - [j21]Shuichi Miyazaki:
On the advice complexity of online bipartite matching and online stable marriage. Inf. Process. Lett. 114(12): 714-717 (2014) - 2013
- [j20]Takao Inoshita, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Takashi Nagase:
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists. Algorithms 6(2): 371-382 (2013) - 2012
- [j19]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects. J. Discrete Algorithms 13: 59-66 (2012) - 2011
- [j18]Shuichi Miyazaki:
Foreword. IEICE Trans. Inf. Syst. 94-D(2): 181 (2011) - 2010
- [j17]Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta:
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. 110(3): 93-98 (2010) - [j16]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation algorithms for the sex-equal stable marriage problem. ACM Trans. Algorithms 7(1): 2:1-2:17 (2010) - 2009
- [j15]Shuichi Miyazaki, Kazuya Okamoto:
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem. Algorithms 2(3): 953-972 (2009) - [j14]Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka:
Computational Complexities of University Interview Timetabling. IEICE Trans. Inf. Syst. 92-D(2): 130-140 (2009) - [j13]Shuichi Miyazaki, Naoyuki Morimoto, Yasuo Okabe:
The Online Graph Exploration Problem on Restricted Graphs. IEICE Trans. Inf. Syst. 92-D(9): 1620-1627 (2009) - [j12]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
An improved approximation lower bound for finding almost stable maximum matchings. Inf. Process. Lett. 109(18): 1036-1040 (2009) - 2008
- [j11]Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. Algorithmica 51(3): 342-356 (2008) - [j10]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches. IEICE Trans. Inf. Syst. 91-D(8): 2105-2114 (2008) - [j9]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
A Tight Upper Bound on Online Buffer Management for Multi-Queue Switches with Bicodal Buffers. IEICE Trans. Inf. Syst. 91-D(12): 2757-2769 (2008) - 2007
- [j8]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3): 30 (2007) - 2006
- [j7]Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto:
A (2 - clog N/N)-Approximation Algorithm for the Stable Marriage Problem. IEICE Trans. Inf. Syst. 89-D(8): 2380-2387 (2006) - 2004
- [j6]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized approximation of the stable marriage problem. Theor. Comput. Sci. 325(3): 439-465 (2004) - 2003
- [j5]Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott:
Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1-3): 431-447 (2003) - 2002
- [j4]Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. ACM J. Exp. Algorithmics 7: 2 (2002) - [j3]David F. Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Hard variants of stable marriage. Theor. Comput. Sci. 276(1-2): 261-279 (2002) - [j2]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi:
Online independent sets. Theor. Comput. Sci. 289(2): 953-962 (2002) - 1999
- [j1]Shuichi Miyazaki, Kazuo Iwama:
Approximation of coNP sets by NP-complete sets and its applications. Syst. Comput. Jpn. 30(7): 47-54 (1999)
Conference and Workshop Papers
- 2022
- [c42]Koki Hamada, Shuichi Miyazaki:
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps. COCOON 2022: 333-344 - [c41]Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. SAGT 2022: 544-561 - [c40]Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. STACS 2022: 31:1-31:20 - 2020
- [c39]Toshiya Itoh, Shuichi Miyazaki, Makoto Satake:
Competitive Analysis for Two Variants of Online Metric Matching Problem. COCOA 2020: 486-498 - [c38]Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto:
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. IWOCA 2020: 304-315 - 2019
- [c37]Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa:
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. ISAAC 2019: 9:1-9:14 - [c36]Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA 2019: 327-338 - 2017
- [c35]Yoshiyuki Mihara, Shuichi Miyazaki, Yasuo Okabe, Tetsuya Yamaguchi, Manabu Okamoto:
Identifying link layer home network topologies using HTIP. CCNC 2017: 891-898 - [c34]Shuichi Miyazaki, Kazuya Okamoto:
Jointly Stable Matchings. ISAAC 2017: 56:1-56:12 - 2016
- [c33]Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki:
Total Stability in Stable Matching Games. SWAT 2016: 23:1-23:12 - 2015
- [c32]Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties. APPROX-RANDOM 2015: 361-380 - [c31]Nau Ozaki, Masato Uchiyama, Yasuki Tanabe, Shuichi Miyazaki, Takaaki Sawada, Takanori Tamai, Moriyasu Banno:
Implementation and evaluation of image recognition algorithm for an intelligent vehicle using heterogeneous multi-core SoC. ASP-DAC 2015: 410-415 - [c30]Shuichi Miyazaki, Naoyuki Morimoto, Yasuo Okabe:
Approximability of Two Variants of Multiple Knapsack Problems. CIAC 2015: 365-376 - 2013
- [c29]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better Bounds for Online k-Frame Throughput Maximization in Network Switches. ISAAC 2013: 218-228 - [c28]Yoshiharu Tsuzaki, Ryosuke Matsumoto, Daisuke Kotani, Shuichi Miyazaki, Yasuo Okabe:
A Mail Transfer System Selectively Restricting a Huge Amount of E-Mails. SITIS 2013: 896-900 - 2011
- [c27]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Quota Lower Bounds. ESA 2011: 180-191 - [c26]Satoshi Ishibashi, Shuichi Miyazaki, Yasuo Okabe:
Design and Implementation of a Certified Document Delivery System without a Trusted Intermediate Authority. SAINT 2011: 20-26 - [c25]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. TAMC 2011: 440-451 - 2010
- [c24]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. ESA (2) 2010: 135-146 - [c23]Shuichi Miyazaki, Kazuya Okamoto:
Improving the Competitive Ratios of the Seat Reservation Problem. IFIP TCS 2010: 328-339 - 2009
- [c22]Keita Shimizu, Shuichi Miyazaki, Yasuo Okabe:
Design and Implementation of a Certified Mail Exchange System Using Simultaneous Secret Exchange. SAINT 2009: 37-42 - [c21]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms. SPAA 2009: 328-336 - 2008
- [c20]Shuichi Miyazaki, Kazuya Okamoto:
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem. ISAAC 2008: 64-76 - [c19]Toshihiro Takagi, Takaaki Komura, Shuichi Miyazaki, Yasuo Okabe:
Privacy Oriented Attribute Exchange in Shibboleth Using Magic Protocols. SAINT 2008: 293-296 - 2007
- [c18]Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A 1.875: approximation algorithm for the stable marriage problem. SODA 2007: 288-297 - [c17]Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta:
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) 2007: 164-175 - [c16]Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
A tight bound on online buffer management for two-port shared-memory switches. SPAA 2007: 358-364 - [c15]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation Algorithms for the Sex-Equal Stable Marriage Problem. WADS 2007: 201-213 - 2006
- [c14]Shunsaku Kato, Shuichi Miyazaki, Yusuke Nishimura, Yasuo Okabe:
Cheat-Proof Serverless Network Games. Computers and Games 2006: 234-243 - 2005
- [c13]Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. ISAAC 2005: 902-914 - 2004
- [c12]Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto:
A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem. SWAT 2004: 349-361 - 2003
- [c11]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized Approximation of the Stable Marriage Problem. COCOON 2003: 339-350 - [c10]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved Approximation of the Stable Marriage Problem. ESA 2003: 266-277 - 2002
- [c9]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Inapproximability Results on Stable Marriage Problems. LATIN 2002: 554-568 - 2000
- [c8]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi:
Online Independent Sets. COCOON 2000: 202-209 - [c7]Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. WAE 2000: 123-134 - 1999
- [c6]Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita:
Stable Marriage with Incomplete Lists and Ties. ICALP 1999: 443-452 - [c5]Kazuo Iwama, Shuichi Miyazaki:
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. ISAAC 1999: 133-142 - 1997
- [c4]Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki:
Local Search Algorithms for Partial MAXSAT. AAAI/IAAI 1997: 263-268 - 1996
- [c3]Shuichi Miyazaki, Kazuo Iwama, Yahiko Kambayashi:
Database Queries as Combinatorial Optimization Problems. CODAS 1996: 477-483 - 1995
- [c2]Kazuo Iwama, Shuichi Miyazaki:
Approximation of coNP Sets by NP-complete Sets. COCOON 1995: 11-20 - 1994
- [c1]Kazuo Iwama, Shuichi Miyazaki:
SAT-Varible Complexity of Hard Combinatorial Problems. IFIP Congress (1) 1994: 253-258
Reference Works
- 2016
- [r2]Kazuo Iwama, Shuichi Miyazaki:
Stable Marriage with Ties and Incomplete Lists. Encyclopedia of Algorithms 2016: 2071-2075 - 2008
- [r1]Kazuo Iwama, Shuichi Miyazaki:
Stable Marriage with Ties and Incomplete Lists. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2023
- [i11]Kazuo Iwama, Shuichi Miyazaki:
Marriage and Roommate. CoRR abs/2305.12841 (2023) - 2022
- [i10]Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists. CoRR abs/2203.06660 (2022) - [i9]Tsubasa Harada, Toshiya Itoh, Shuichi Miyazaki:
Capacity-Insensitive Algorithms for Online Facility Assignment Problems on a Line. CoRR abs/2207.05308 (2022) - 2021
- [i8]Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. CoRR abs/2105.03093 (2021) - [i7]Koki Hamada, Shuichi Miyazaki:
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps. CoRR abs/2107.03123 (2021) - 2020
- [i6]Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto:
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. CoRR abs/2001.08468 (2020) - [i5]Toshiya Itoh, Shuichi Miyazaki, Makoto Satake:
Competitive Analysis for Two Variants of Online Metric Matching Problem. CoRR abs/2008.08415 (2020) - 2019
- [i4]Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa:
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. CoRR abs/1902.05678 (2019) - [i3]Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR abs/1904.05011 (2019) - 2015
- [i2]Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki:
Stable Nash Equilibria in the Gale-Shapley Matching Game. CoRR abs/1509.04344 (2015) - 2013
- [i1]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches. CoRR abs/1309.4919 (2013)
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-09-22 00:32 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:
