The following pages link to Eiji Miyano (Q260258):
Displaying 50 items.
- (Q198583) (redirect page) (← links)
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- NP-hardness of the sorting buffer problem on the uniform metric (Q427885) (← links)
- Optimal distortion embedding of complete binary trees into lines (Q436329) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing (Q826097) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Complexity of the maximum \(k\)-path vertex cover problem (Q1641128) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Oblivious routing algorithms on the mesh of buses (Q1974679) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Exact algorithms for the bounded repetition longest common subsequence problem (Q2180128) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- How to pack directed acyclic graphs into small blocks (Q2208351) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Graph orientation with edge modifications (Q2327085) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Optimal approximability of bookmark assignments (Q2444527) (← links)
- Grasp and delivery for moving objects on broken lines (Q2481562) (← links)
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes (Q2729648) (← links)
- New Bounds for Oblivious Mesh Routing (Q2755057) (← links)
- An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size (Q2775890) (← links)
- Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree (Q2842769) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
- (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation (Q3087955) (← links)
- Distance-d Independent Set Problems for Bipartite and Chordal Graphs (Q3167365) (← links)
- Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation (Q3188863) (← links)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
- How to Pack Directed Acyclic Graphs into Small Blocks (Q3434563) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- On Approximation of Bookmark Assignments (Q3525561) (← links)
- Approximating Maximum Diameter-Bounded Subgraphs (Q3557054) (← links)
- (Q4218425) (← links)
- (Q4252322) (← links)
- (Q4331308) (← links)
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
- Routing Problems on the Mesh of Buses (Q4881411) (← links)
