Eiji Miyano

From MaRDI portal
Person:260258

Available identifiers

zbMath Open miyano.eijiMaRDI QIDQ260258

List of research outcomes

PublicationDate of PublicationType
Happy set problem on subclasses of co-comparability graphs2023-11-17Paper
Path cover problems with length cost2023-11-17Paper
Independent set under a change constraint from an initial solution2023-10-04Paper
Corrigendum to: ``Complexity and approximability of the happy set problem2023-09-21Paper
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles2022-12-22Paper
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing2022-08-26Paper
Happy set problem on subclasses of co-comparability graphs2022-07-13Paper
Path cover problems with length cost2022-07-13Paper
Upper and lower degree-constrained graph orientation with minimum penalty2021-12-22Paper
Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing2021-12-20Paper
Parameterized algorithms for the happy set problem2021-09-30Paper
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles2021-08-11Paper
Graph classes and approximability of the happy set problem2021-04-21Paper
Graph Orientation with Edge Modifications2021-04-19Paper
Complexity and approximability of the happy set problem2021-04-14Paper
How to pack directed acyclic graphs into small blocks2020-11-02Paper
Graph orientation with splits2020-10-21Paper
Exact algorithms for the repetition-bounded longest common subsequence problem2020-09-01Paper
Parameterized algorithms for the happy set problem2020-07-22Paper
Exact algorithms for the bounded repetition longest common subsequence problem2020-05-13Paper
Graph orientation with edge modifications2019-10-11Paper
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan2019-04-26Paper
Graph orientation with splits2018-08-17Paper
Complexity of the maximum \(k\)-path vertex cover problem2018-06-15Paper
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops2018-06-05Paper
Optimal approximation algorithms for maximum distance-bounded subgraph problems2018-06-01Paper
Improved approximation algorithms for the maximum happy vertices and edges problems2018-05-18Paper
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs2017-05-05Paper
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2017-02-01Paper
Degree-constrained graph orientation: maximum satisfaction and minimum violation2016-03-21Paper
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems2016-02-05Paper
Graph Orientations Optimizing the Number of Light or Heavy Vertices2015-10-29Paper
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes2015-05-20Paper
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation2014-09-02Paper
Complexity of finding maximum regular induced subgraphs with prescribed degree2014-08-26Paper
Optimal approximability of bookmark assignments2014-04-10Paper
Distance-\(d\) independent set problems for bipartite and chordal graphs2014-02-25Paper
(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation2013-12-09Paper
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree2013-08-16Paper
Distance-d Independent Set Problems for Bipartite and Chordal Graphs2012-11-02Paper
Graph Orientations Optimizing the Number of Light or Heavy Vertices2012-11-02Paper
Optimal distortion embedding of complete binary trees into lines2012-07-20Paper
NP-hardness of the sorting buffer problem on the uniform metric2012-06-18Paper
(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation2011-08-17Paper
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree2011-06-17Paper
GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE2011-05-10Paper
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree2011-04-19Paper
Weighted nearest neighbor algorithms for the graph exploration problem on cycles2010-09-02Paper
Approximating Maximum Diameter-Bounded Subgraphs2010-04-27Paper
Drawing borders efficiently2009-08-06Paper
On Approximation of Bookmark Assignments2008-09-17Paper
Grasp and delivery for moving objects on broken lines2008-04-11Paper
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles2008-03-07Paper
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree2008-01-04Paper
Drawing Borders Efficiently2007-11-15Paper
How to Pack Directed Acyclic Graphs into Small Blocks2007-05-02Paper
GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE2007-04-25Paper
Theoretical Computer Science2006-11-01Paper
An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size2002-07-08Paper
https://portal.mardi4nfdi.de/entity/Q43313082002-05-15Paper
New Bounds for Oblivious Mesh Routing2002-01-07Paper
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes2001-12-12Paper
Efficient randomized routing algorithms on the two-dimensional mesh of buses2001-08-20Paper
Oblivious routing algorithms on the mesh of buses2000-05-07Paper
https://portal.mardi4nfdi.de/entity/Q42523222000-04-13Paper
https://portal.mardi4nfdi.de/entity/Q49378472000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q49371932000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q42184251998-11-11Paper
Better approximations of non-Hamiltonian graphs1998-06-02Paper
https://portal.mardi4nfdi.de/entity/Q56872641996-12-11Paper
Routing Problems on the Mesh of Buses1996-08-21Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Eiji Miyano