# Shuichi Miyazaki

According to our database

Collaborative distances:

^{1}, Shuichi Miyazaki authored at least 53 papers between 1994 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2019

An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number.

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2017

Jointly Stable Matchings.

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Identifying link layer home network topologies using HTIP.

Proceedings of the 14th IEEE Annual Consumer Communications & Networking Conference, 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.

JIP, 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 multi-core 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

2013

Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists.

Algorithms, 2013

A Mail Transfer System Selectively Restricting a Huge Amount of E-Mails.

Proceedings of the Ninth International Conference on Signal-Image Technology & Internet-Based Systems, 2013

Better Bounds for Online k-Frame Throughput Maximization in Network Switches.

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2011

Foreword.

IEICE Transactions, 2011

Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects.

Proceedings of the Theory and Applications of Models of Computation, 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

Improving the Competitive Ratios of the Seat Reservation Problem.

Proceedings of the Theoretical Computer Science, 2010

A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.

Proceedings of the Algorithms, 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 Transactions, 2009

Computational Complexities of University Interview Timetabling.

IEICE Transactions, 2009

Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms.

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 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 Multi-Queue Switches with Bicodal Buffers.

IEICE Transactions, 2008

A (2-

*c*(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

Improving the Competitive Ratio of the Online OVSF Code Assignment Problem.

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Improved approximation results for the stable marriage problem.

ACM Trans. Algorithms, 2007

Approximation Algorithms for the Sex-Equal Stable Marriage Problem.

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

A tight bound on online buffer management for two-port shared-memory switches.

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles.

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

A 1.875: approximation algorithm for the stable marriage problem.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

IEICE Transactions, 2006

Cheat-Proof Serverless Network Games.

Proceedings of the Computers and Games, 5th International Conference, 2006

2005

A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

A (2-c(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

Randomized Approximation of the Stable Marriage Problem.

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Hard variants of stable marriage.

Theor. Comput. Sci., 2002

Inapproximability Results on Stable Marriage Problems.

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2000

Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.

Proceedings of the Algorithm Engineering, 2000

Online Independent Sets.

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Approximation of coNP sets by NP-complete sets and its applications.

Systems and Computers in Japan, 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

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 NP-complete Sets.

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