The following pages link to Shuichi Miyazaki (Q261378):
Displayed 50 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Better bounds for online \(k\)-frame throughput maximization in network switches (Q346256) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528) (← links)
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms (Q528490) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- An improved approximation lower bound for finding almost stable maximum matchings (Q989570) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- Improving the competitive ratio of the online OVSF code assignment problem (Q1662487) (← links)
- Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
- Online independent sets. (Q1853575) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number (Q2301753) (← links)
- Jointly stable matchings (Q2424832) (← links)
- Competitive analysis for two variants of online metric matching problem (Q2692234) (← links)
- (Q2743804) (← links)
- (Q2766829) (← links)
- Better Bounds for Online k-Frame Throughput Maximization in Network Switches (Q2872086) (← links)
- (Q2934607) (← links)
- Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
- Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects (Q3010424) (← links)
- (Q3044355) (← links)
- Randomized Approximation of the Stable Marriage Problem (Q3082941) (← links)
- The Hospitals/Residents Problem with Quota Lower Bounds (Q3092227) (← links)
- Improving the Competitive Ratios of the Seat Reservation Problem (Q3163894) (← links)
- Approximation algorithms for the sex-equal stable marriage problem (Q3188983) (← links)
- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties (Q3586389) (← links)
- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem (Q3596707) (← links)
- Approximation Algorithms for the Sex-Equal Stable Marriage Problem (Q3603527) (← links)
- (Q4253337) (← links)
- (Q4511222) (← links)
- (Q4635972) (← links)
- (Q4761867) (← links)
- (Q4937225) (← links)
- (Q4938640) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings (Q5041200) (← links)
- (Q5136277) (← links)
- Algorithm Theory - SWAT 2004 (Q5315387) (← links)
- A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties (Q5351911) (← links)
- Total Stability in Stable Matching Games (Q5369525) (← links)
- Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles (Q5448770) (← links)
- Parallelizing local search for CNF satisfiability using vectorization and PVM (Q5463427) (← links)
- (Q5875569) (← links)
- Algorithms - ESA 2003 (Q5897252) (← links)
- Algorithms and Computation (Q5897922) (← links)