Shuichi Miyazaki
According to our database^{1},
Shuichi Miyazaki
authored at least 58 papers
between 1994 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2020
Identifying Link Layer Home Network Topologies Using HTIP.
IEICE Trans. Inf. Syst., 2020
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings.
Proceedings of the Combinatorial Algorithms  31st International Workshop, 2020
2019
Jointly stable matchings.
J. Comb. Optim., 2019
On Computational Complexity of Pipe Puzzles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
An FPT Algorithm for MaxCut Parameterized by Crossing Number.
CoRR, 2019
An Improved FixedParameter Algorithm for MaxCut Parameterized by Crossing Number.
Proceedings of the Combinatorial Algorithms  30th International Workshop, 2019
StrategyProof 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 multiqueue switches in QoS networks using packet buffering algorithms.
Theor. Comput. Sci., 2017
Better bounds for online kframe throughput maximization in network switches.
Theor. Comput. Sci., 2017
2016
Stable Marriage with Ties and Incomplete Lists.
Encyclopedia of Algorithms, 2016
The Hospitals/Residents Problem with Lower Quotas.
Algorithmica, 2016
Total Stability in Stable Matching Games.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
2015
Finding Witnesses for Stability in the Hospitals/Residents Problem.
J. Inf. Process., 2015
Stable Nash Equilibria in the GaleShapley Matching Game.
CoRR, 2015
Approximability of Two Variants of Multiple Knapsack Problems.
Proceedings of the Algorithms and Complexity  9th International Conference, 2015
Implementation and evaluation of image recognition algorithm for an intelligent vehicle using heterogeneous multicore SoC.
Proceedings of the 20th Asia and South Pacific Design Automation Conference, 2015
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties.
Proceedings of the Approximation, 2015
2014
On the advice complexity of online bipartite matching and online stable marriage.
Inf. Process. Lett., 2014
A 25/17Approximation Algorithm for the Stable Marriage Problem with OneSided Ties.
Algorithmica, 2014
2013
Improving ManOptimal Stable Matchings by Minimum Change of Preference Lists.
Algorithms, 2013
A Mail Transfer System Selectively Restricting a Huge Amount of EMails.
Proceedings of the Ninth International Conference on SignalImage Technology & InternetBased Systems, 2013
2012
Improved approximation bounds for the StudentProject Allocation problem with preferences over projects.
J. Discrete Algorithms, 2012
2011
Foreword.
IEICE Trans. Inf. Syst., 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
The Hospitals/Residents Problem with Quota Lower Bounds.
Proceedings of the Algorithms  ESA 2011, 2011
2010
Approximation algorithms for the sexequal stable marriage problem.
ACM Trans. Algorithms, 2010
Weighted nearest neighbor algorithms for the graph exploration problem on cycles.
Inf. Process. Lett., 2010
Improving the Competitive Ratios of the Seat Reservation Problem.
Proceedings of the Theoretical Computer Science, 2010
2009
An improved approximation lower bound for finding almost stable maximum matchings.
Inf. Process. Lett., 2009
The Online Graph Exploration Problem on Restricted Graphs.
IEICE Trans. Inf. Syst., 2009
Computational Complexities of University Interview Timetabling.
IEICE Trans. Inf. Syst., 2009
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem.
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
Stable Marriage with Ties and Incomplete Lists.
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
A Tight Upper Bound on Online Buffer Management for MultiQueue Switches with Bicodal Buffers.
IEICE Trans. Inf. Syst., 2008
A Tight Bound on Online Buffer Management for TwoPort SharedMemory Switches.
IEICE Trans. Inf. Syst., 2008
A (2c(1/sqrt(N)))Approximation Algorithm for the Stable Marriage Problem.
Algorithmica, 2008
Privacy Oriented Attribute Exchange in Shibboleth Using Magic Protocols.
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008
2007
Improved approximation results for the stable marriage problem.
ACM Trans. Algorithms, 2007
A 1.875: approximation algorithm for the stable marriage problem.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
2006
A (2  clog N/N)Approximation Algorithm for the Stable Marriage Problem.
IEICE Trans. Inf. Syst., 2006
CheatProof Serverless Network Games.
Proceedings of the Computers and Games, 5th International Conference, 2006
2005
A (2c*(1/sqrt(N)))Approximation Algorithm for the Stable Marriage Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Randomized approximation of the stable marriage problem.
Theor. Comput. Sci., 2004
A (2c(log N/N))Approximation Algorithm for the Stable Marriage Problem.
Proceedings of the Algorithm Theory, 2004
2003
Approximability results for stable marriage problems with ties.
Theor. Comput. Sci., 2003
Improved Approximation of the Stable Marriage Problem.
Proceedings of the Algorithms, 2003
2002
Hard variants of stable marriage.
Theor. Comput. Sci., 2002
Online independent sets.
Theor. Comput. Sci., 2002
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
ACM J. Exp. Algorithmics, 2002
Inapproximability Results on Stable Marriage Problems.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
1999
Approximation of coNP sets by NPcomplete sets and its applications.
Systems and Computers in Japan, 1999
TreeLike Resolution Is Superpolynomially Slower Than DAGLike Resolution for the Pigeonhole Principle.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Stable Marriage with Incomplete Lists and Ties.
Proceedings of the Automata, 1999
1997
Local Search Algorithms for Partial MAXSAT.
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
Approximation of coNP Sets by NPcomplete Sets.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
SATVarible 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