Shuichi Miyazaki
Orcid: 0000-0003-0369-1970Affiliations:
- University of Hyogo, Japan
According to our database1,
Shuichi Miyazaki
authored at least 67 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Discret. Math. Algorithms Appl., July, 2024
Refined computational complexities of Hospitals/Residents problem with regional caps.
Theor. Comput. Sci., 2024
Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs.
CoRR, 2024
2023
2022
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists.
CoRR, 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
2021
Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem.
J. Inf. Process., 2021
Discret. Math. Algorithms Appl., 2021
2020
IEICE Trans. Inf. Syst., 2020
2019
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
2017
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms.
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
2016
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
2015
J. Inf. Process., 2015
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015
Implementation and evaluation of image recognition algorithm for an intelligent vehicle using heterogeneous multi-core SoC.
Proceedings of the 20th Asia and South Pacific Design Automation Conference, 2015
Proceedings of the Approximation, 2015
2014
Inf. Process. Lett., 2014
Algorithmica, 2014
2013
Algorithms, 2013
Proceedings of the Ninth International Conference on Signal-Image Technology & Internet-Based Systems, 2013
2012
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects.
J. Discrete Algorithms, 2012
2011
Design and Implementation of a Certified Document Delivery System without a Trusted Intermediate Authority.
Proceedings of the 11th Annual International Symposium on Applications and the Internet, 2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
ACM Trans. Algorithms, 2010
Inf. Process. Lett., 2010
Proceedings of the Theoretical Computer Science, 2010
2009
Inf. Process. Lett., 2009
IEICE Trans. Inf. Syst., 2009
IEICE Trans. Inf. Syst., 2009
Algorithms, 2009
Design and Implementation of a Certified Mail Exchange System Using Simultaneous Secret Exchange.
Proceedings of the Ninth Annual International Symposium on Applications and the Internet, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
A Tight Upper Bound on Online Buffer Management for Multi-Queue Switches with Bicodal Buffers.
IEICE Trans. Inf. Syst., 2008
IEICE Trans. Inf. Syst., 2008
Algorithmica, 2008
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008
2007
ACM Trans. Algorithms, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2006
A (2 - <i>c</i>log <i>N</i>/<i>N</i>)-Approximation Algorithm for the Stable Marriage Problem.
IEICE Trans. Inf. Syst., 2006
Proceedings of the Computers and Games, 5th International Conference, 2006
2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Proceedings of the Algorithm Theory, 2004
2003
Theor. Comput. Sci., 2003
Proceedings of the Algorithms, 2003
2002
ACM J. Exp. Algorithmics, 2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
1999
Syst. Comput. Jpn., 1999
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
1997
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997
1996
Database Queries as Combinatorial Optimization Problems.
Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, 1996
1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
SAT-Varible Complexity of Hard Combinatorial Problems.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994