Refereed papers in journals, book series, and international conferences
 Complexity of the minimum single dominating cycle problem for graph classes.
 An approximation scheme for minimizing the makespan of the parallel identical multistage flowshops.
 Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu
Optimal approximation algorithms for maximum distancebounded subgraph problems.
Algorithmica, to appear
DOI: 10.1007/s004530170344y
 Peng Zhang, Yao Xu, Tao Jian, Angsheng Li, Guohui Lin, Eiji Miyano
Improved approximation algorithms for the maximum happy vertices and edges problems.
Algorithmica, to appear
DOI: 10.1007/s0045301703028
 Hiroshi Eto, Takehiro Ito , Zhilong Liu,
Eiji Miyano
Approximation algorithm for the distance3 independent set problem on cubic graphs.
Proc. 11th International Conference and Workshops on Algorithms and Computation, LNCS10167, pp.228240, Microelectronics and Information System Research Center, National Chiao Tung University, Hsinchu, Taiwan (March 2017)
 Hiroshi Eto, Takehiro Ito , Zhilong Liu,
Eiji Miyano
Approximability of the distance independent set problem on regular graphs and planar graphs.
Proc. 10th Annual International Conference on Combinatorial Optimization and Applications, LNCS10043, pp.270284, City University of Hong Kong, Hong Kong, China (December 2016)

Yuichi Asahiro,
Tomohiro Kubo,
Eiji Miyano
Experimental evalution of approximation algorithms for maximum distancebounded subgraph problems.
Proc. Joint 8th International Conference on Soft Computing and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems, pp.892897, HokkaiGakuen University, Sapporo, Hokkaido, Japan (August 2016)
 Weitian Tong, Eiji Miyano , Randy Goebel, Guohui Lin
A PTAS for the multiple parallel identical multistage flowshops to minimize the makespan.
Proc. 10th International Frontiers of Algorithmics Workshp (FAW 2016), LNCS9711, pp.227237, Qingdao University, Qingdao, China (July 2016)
 Daiki Hoshika, Eiji Miyano
Approximation Algorithms for
Packing ElementDisjoint Steiner Trees on Bounded Terminal Nodes.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol.E99A, No.6, pp.10591066 (June 2016)
 Preliminary version:
Daiki Hoshika, Eiji Miyano
Approximation Algorithms for
Packing ElementDisjoint Steiner Trees on Bounded Terminal Nodes.
Proc. 10th International Conference on Algorithmic Aspects of Information
and Management (AAIM 2014), LNCS8546, pp.100111, Harbour Centre, Simon Fraser University, Vancouver, Canada (July 2014)

Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono
DegreeConstrained Graph Orientation: Maximum Satisfaction and Minimum Violation.
Theory of Computing Systems, Vol.58, No.1, pp.6093 (January 2016)
 Preliminary Version:
Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono
DegreeConstrained Graph Orientation: Maximum Satisfaction and Minimum Violation.
Proc. 11th International Workshop on Approximation and Online
Algorithms (WAOA2013), LNCS 8447, pp.2436, Sophia Antipolis, France (September 2013)

Yuichi Asahiro,
Yuya Doi,
Eiji Miyano ,
Hirotaka Shimizu
Optimal Approximation Algorithms for Maximum DistanceBounded Subgraph Problems.
Proc. 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2015), LNCS 9486, pp.586600, Houston Marriott West Loop by the Galleria, Houston, USA (December, 2015)

Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy
Vertices.
Journal of Graph Algorithms and Applications, Vol.19, No.1, pp.41465 (2015)
 Preliminary Version:
Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy
Vertices.
Proc. 2nd International Symposiumu on Combinatorial Optimizatoin (ISCO 2012), LNCS 7422, pp.332343, the Athens University of Economics and Business, Athens, Greece (April, 2012)
 Eiji Miyano and Keisuke Tahara.
Evolutionary Algorithms for the Pursuit Problem.
Proc. Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems,
6 pages, Kitakyushu International Conference Center,
Fukuoka, Japan (December, 2014)

Yuichi Asahiro,
Hiroshi Eto,
Eiji Miyano ,
Takehiro Ito
Complexity of Finding Maximum Regular Induced Subgraphs
with Prescribed Degree.
Theoretical Computer Science, Vol.550, 18, 2135 (September 18, 2014)
DOI: 10.1016/j.tcs.2014.07.008
 Preliminary Version:
Yuichi Asahiro,
Hiroshi Eto,
Eiji Miyano ,
Takehiro Ito
Complexity of Finding Maximum Regular Induced Subgraphs
with Prescribed Degree.
Proc. 19th International Symposium on Fundamentals of Computation
Theory (FCT 2013), LNCS 8070, pp.2839, Crowne Plaza Liverpool,
Liverpool, United Kingdom (August, 2013)
 Hiroshi Eto, Fengrui Guo,
Eiji Miyano
Distanced Independent Set Problems for Bipartite
and Chordal Graphs.
Journal of Combinatorial Optimization, Vol.27, Issue 1, pp.8899 (January 2014)
 Preliminary Version:
Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distanced Independent Set Problems for Bipartite and Chordal Graphs.
Proc. 6th Annual International
Conference on Combinatorial Optimization and Applications
(COCOA 2012), LNCS 7402, pp.234244, Banff Centre, Banff, Canada
(August, 2012)

Yuichi Asahiro,
Kenta Kanmera,
Eiji Miyano
(1+ε)Competitive Algorithm for Online OVSF Code Assignment
with Resource Augmentation.
Journal of Combinatorial Optimization, Vol.26, Issue 4, pp.687708 (November 2013)
 Preliminary Version:
Yuichi Asahiro,
Kenta Kanmera,
Eiji Miyano
(1+ε)Competitive Algorithm for Online OVSF Code Assignment
with Resource Augmentation.
Proc. 17th Annual International Computing and Cobminatorics Conference
(COCOON 2011), LNCS 6842, pp.259270,
DoubleTree by Hilton Hotel Dalls, Richardson, Texas, USA
(August, 2011)

Yuichi Asahiro,
Eiji Miyano ,
Toshihide Murata,
Hirotaka Ono
Optimal Approximability of Bookmark Assignments
Discrete Applied Mathematics, Vol.161, Issues 1617, pp.23612366 (November, 2013)
 Preliminary Version:
Yuichi Asahiro,
Eiji Miyano ,
Toshihide Murata,
Hirotaka Ono
On Approximation of Bookmark Assignments.
Proc. 32nd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2007), LNCS 4708, pp.115124, Cesky
Krumolov, Czech Republic (August, 2007)

Yuichi Asahiro,
Hiroshi Eto,
Eiji Miyano
Inapproximability of Maximum rRegular Induced Connected
Subgraph Problems.
IEICE Transactions on Information and Systems, Vol.E96D, No.3,
pp.443449 (March 2013)
 Preliminary Version:
Yuichi Asahiro,
Hiroshi Eto,
Eiji Miyano
Inapproximability of Maximum rRegular Induced Connected
Subgraph Problems.
Proc. the 2011
International Conference of Foundation of Computer Science (FCS'2011),
pp.102107, Las Vegas, Nevada, USA (July, 2011)

Yuichi Asahiro,
Kenichi Kawahara,
Eiji Miyano
NPHardness of the Sorting Buffer Problem on the Uniform Metric
Discrete Applied Mathematics, Vol.160, Issues 1011, pp.14531464 (July, 2012)
 Preliminary Version:
Proc. the 2008 International Conference of Foundation of Computer
Science (FCS'08), pp.137143, Las Vegas, Nevada, USA (July, 2008)
 Masao Kumamoto, Eiji Miyano
Optimal Distortion Embedding of Complete Binary Trees into Lines.
Information Processing Letters, Vol.112, No.10, pp.365370 (May, 2012)
 Preliminary Version:
Proc. the 2010
International Conference of Foundation of Computer Science (FCS'2010),
pp.1621, Las Vegas, Nevada, USA (July, 2010)

Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.
Proc. Computing: The 18th Australasian Theory Symposium (CATS
2012), CRPIT, Vol.128, pp.139146, Storey Hall, RMIT University,
Melbourne, Australia (January, 2012)

Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono,
Kouhei Zenmyo
Approximation Algorithms for the Graph Orientation Minimizing the
Maximum Weighted Outdegree.
Journal of Combinatorial Optimization, Vol.22, No.1, pp.7896
(May 2011)
 Preliminary Version:
Yuichi Asahiro,
Jesper Jansson, Eiji Miyano ,
Hirotaka Ono, Kouhei Zenmyo
Approximation Algorithms for
the Graph Orientation Minimizing the Maximum Weighted Outdegree
Proc. 3rd International Conference on Algorithmic Aspects in
Information and Management (AAIM 2007), LNCS 4508, pp.167177,
Washington State University Vancouver Campus, WA (or Portland,
OR), USA (June, 2007)

Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono
Graph Orientation to Maximize the Minimum Weighted Outdegree.
International Journal of Foundations Computer Science, Vol.22, No.3,
pp.583601 (April, 2011)
 Preliminary Version:
Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano ,
Hirotaka Ono
Graph Orientation to Maximize the Minimum Weighted Outdegree
Proc. 11th Workshop on Advances in Parallel and Distributed
Computation Models, IPDPS 2009, APDCM 2009, pp.18 (May 2009)

Yuichi Asahiro,
Eiji Miyano ,
Hirotaka Ono
Graph Classes and the Complexity of the Graph Orientation
Minimizing the Maximum Weighted Outdegree.
Discrete Applied Mathematics, Vol.159, No.7 (April, 2011)
 Preliminary Version:
Yuichi Asahiro,
Eiji Miyano ,
Hirotaka Ono
Graph Classes and the Complexity of the Graph Orientation
Minimizing the Maximum Weighted Outdegree
Proc. Computing: The 14th Australasian Theory Symposium (CATS
2008), CRPIT, Vol.77, Harland, J. and Manyem, P. Eds, ACS.
pp.97106, Wollongong, NSW, Australia (January,
2008)
 Eiji Miyano and
Hirotaka Ono
Maximum Domination Problem.
Proc. Computing: The 17th Australasian Theory Symposium
(CATS 2011), CRPIT, Vol.119, Alex Potanin and Taso Viglas Eds.,
ACS. pp.5561, Curtin University, Perth, Australia (January,
2011)

Yuichi Asahiro,
Eiji Miyano ,
Kazuaki Samizo
Approximating Maximum DiameterBounded Subgraphs
Proc. The 9th Latin American Theoretical Informatics Symposium
(LATIN2010), LNCS 6034, pp.615626, University of Oaxaca and
Hotel Victoria, Oaxaca, Mexico (April 2010)

Yuichi Asahiro,
Eiji Miyano ,
Shuichi Miyazaki,
Takuro Yoshimuta
Weighted Nearest Neighbor Algorithms for the Graph Exploration
Problem on Cycles
Information Processing Letters, Vol.110, No.3, pp.9398 (January, 2010)
 Preliminary Version:
Yuichi Asahiro,
Eiji Miyano ,
Shuichi Miyazaki,
Takuro Yoshimuta
Weighted Nearest Neighbor Algorithms for the Graph Exploration
Problem on Cycles
Proc. 33rd Conference on Current Trends in Theory and Practice of
Informatics (SOFSEM 2007), LNCS 4362, pp.164175, Hotel Sklar,
Harrachov, Czech Republic (January, 2007)

Kazuo Iwama , Eiji Miyano ,
Hirotaka Ono
Drawing Borders Efficiently
Theory of Computing Systems, Vol.44, No.2, pp.230244 (February 2009)
 Preliminary Version:
Kazuo Iwama , Eiji Miyano ,
Hirotaka Ono
Drawing Borders Efficiently
Proc. 4th International Conference on FUN WITH ALGORITHMS
(
FUN 2007), LNCS 4475, pp.213226, Castiglioncello (LI),
Tuscany, Italy (June, 2007)
 Naoyuki Kamiyama, Yuuki Kiyonari,
Eiji Miyano ,
Shuichi Miyazaki, Katsuhisa Yamanaka
Computational Complexities of University Interview Timetabling
IEICE Transactions on Information and Systems, Vol.E92D, No.2,
pp.130140 (February 2009)
 Yuichi Asahiro, Eiji Miyano , Shinichi Shimoirisa
Grasp and Delivery for Moving Objects on Broken Lines
Theory of Computing Systems, Vol.42, No.3, pp.289305 (April, 2008)
 Preliminary Version:
Yuichi Asahiro, Eiji Miyano , Shinichi Shimoirisa
Pickup and Delivery for Moving Objects on Broken Lines
Proc. 9th Italian Conference on Theoretical Computer Science (ICTCS
2005), LNCS 3701, pp.3650, Certosa di Pontignano, Siena, Italy
(October, 2005)

Yuichi Asahiro,
Eiji Miyano ,
Hirotaka Ono,
Kouhei Zenmyo
Graph Orientation Algorithms to Minimize the Maximum Outdegree
International Journal of Foundation of Computer Science, Vol.18,
No.2, pp.197216 (April 2007)
 Preliminary Version:
Yuichi Asahiro,
Eiji Miyano ,
Hirotaka Ono,
Kouhei Zenmyo
Graph Orientation Algorithms to Minimize the Maximum Outdegree
Proc. Computing: The Twelfth Australasian Theory Symposium (CATS 2006),
pp.1120, Wrest Point Casino Hotel, Tasmania, Australia (January,
2006)
 Yuuki Kiyonari,
Eiji Miyano ,
Shuichi Miyazaki
Computational Complexity Issues in University Interview
Timetabling
Proc. 6th International Conference on the Practice and Theory of
Automated Timetabling, pp.448453,
Hotel International Brno, Brno, The Czech Republic (August, 2006)
 Takahiro Yukizane, Shinya Ohi,
Eiji Miyano ,
Hideo Hirose.
The Bump Hunting Method Using the Genetic Algorithm with
the ExtremeValue Statistics.
Special Issue on Invited Papers from New Horizons in Computing,
IEICE Transactions on Information and Systems, Vol.E89D, No.8,
pp.23322339 (August, 2006)

Hideo Hirose, Takahiro Yukizane,
Eiji Miyano
Boundary detection for bumps using the Gini's index in messy
classificatin problems
Proc. 3rd International Conference on Cybernetics and Information
Technologies, Systems and Applications, pp.293297,
Sheraton World Resort, Orlando, Florida, USA (July, 2006)

Yuichi Asahiro,
Tetsuya Furukawa,
Keiichi Ikegami,
Eiji Miyano
How to Pack Directed Acyclic Graphs into Small Blocks
Proc. 6th Conference on Algorithms and Complexity (CIAC 2006),
LNCS 3998, pp.272283,
University of Rome, Rome, Italy (May, 2006)

Hideo Hirose, Takahiro Yukizane,
Eiji Miyano
The bump hunting method using the genetic algorithm and the
extremevalue statistics with application to a messy customer
database
2006 Hawaii International Conference on Statistics, Mathematics and
Related Fields, Hawaii, USA (January, 2006), to appear
 Yuichi Asahiro, Eiji Miyano , Shinichi Shimoirisa
KCollect Tours for Moving Objects with Release Times and Deadlines
Proc. 9th World MultiConference on Systemics, Cybernetics, and
Informatics, Vol.III, pp.192197, Rozen Centre Hotel, Orland,
Florida, USA (July, 2005)

Kazuo Iwama , Eiji Miyano
An O(\sqrt{N}) Oblivious Routing Algorithm for
2D Meshes of Constant QueueSize
Journal of Algorithms, Vol.41, pp.262279 (2001)
 Preliminary Version:
Kazuo Iwama , Eiji Miyano
An O(\sqrt{N}) Oblivious Routing Algorithm for
2D Meshes of Constant QueueSize
Proc. Tenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA '99),
pp.466475, Omni Inner Harbor Hotel, Baltimore, Maryland (January, 1999)

Kazuo Iwama , Eiji Miyano
A Lower Bound for Elementary Oblivious Routing on
ThreeDimensional Meshes
Journal of Algorithms, to appear (2001)
 Preliminary Version:
Kazuo Iwama , Eiji Miyano
ThreeDimensional Meshes Are Less Powerful than TwoDimensional
Ones in Oblivious Routing
Proc. 5th European Symposium on Algorithms (ESA'97),
LNCS, pp.284295,
Graz, Austria (September, 1997)

Kazuo Iwama , Yahiko Kambayashi,
Eiji Miyano
New Bounds for Oblivious Mesh Routing
Journal of Graph Algorithms and Applications ,
to appear (2001)
 Preliminary Version:
Kazuo Iwama ,
Yahiko Kambayashi, Eiji Miyano
New Bounds for Oblivious Mesh Routing
Proc. Sixth Annual European Symposium on Algorithms (ESA'98),
LNCS, pp.295306, Venice, Italy (August, 1998)

Kazuo Iwama , Eiji Miyano ,
Satoshi Tajima,
Hisao Tamaki
Efficient randomized routing algorithms on the twodimensional mesh
of buses
Theoretical Computer Science, to appear (2001)
 Preliminary Version:
Kazuo Iwama , Eiji Miyano , Satoshi Tajima,
Hisao Tamaki
Efficient randomized routing algorithms on the twodimensional mesh
of buses
Proc. Fourth Annual International Computing and Combinatorics Conference
(COCOON98), LNCS, pp.229240, Academia Sinica, Taipei, Taiwan, ROC,
(August, 1998)

Kazuo Iwama ,
Eiji Miyano
A (2.954+e)n oblivious routing algorithm on 2D Meshes
Proc. 12th ACM Symposium on Parallel Algorithms and Architectures
(SPAA2000), pp.186195, Bar Harbor, Maine, USA (July, 2000)
 Kazuo Iwama, Eiji Miyano
Recent Developments in Mesh Routing Algorithms
(Invited Survey Paper)
Special Issue on Algorithms Engineering: Surveys,
IEICE Transactions on Information and Systems, Vol.E83D, No.3,
pp.530540 (March, 2000)

Kazuo Iwama ,
Eiji Miyano
Oblivious Routing Algorithms on the Mesh of Buses
J. Parallel and Distributed Computing, Vol.60, No.2, pp.137149
(February, 2000)
 Preliminary Version:
Kazuo Iwama ,
Eiji Miyano
Oblivious Routing Algorithms on the Mesh of Buses
Proc. 11th International Parallel Processing Symposium (IPPS'97), pp.721727,
Geneva, Switzerland (April, 1997)

Kazuo Iwama , Eiji Miyano
Multipacket Routing on 2D meshes and Its Applications to
FaultTolerant Routing
Proc. Seventh Annual European Symposium on Algorithms (ESA'99),
LNCS, pp.5364, Prague, Czech Republic, July 1618, 1999)

Kazuo Iwama , Eiji Miyano
Better approximations of nonHamiltonian graphs
Discrete Applied Mathematics 81, pp.239261 (January, 1998)

Yuichi Asahiro ,
Kazuo Iwama , Eiji Miyano
Random Generation of Test Instances with Controlled Attributes
In Cliques, Coloring, and Satisfiability, DIMACS Series in Discrete
Mathematics and Theoretical Computer Science, Vol.26, D.S. Johnson and
M.A. Trick, Ed., 377393, American Mathematical Society (1996)
 Preliminary Version:
Kazuo Iwama and Eiji Miyano
TestCase Generation with Known Answers and Proved Secutities
Proc. Second DIMACS Challenge Workshop (Satisfiability), New Jersey, USA
(October, 1993)
 Kazuo Iwama, Eiji Miyano , Yahiko Kambayashi
Routing Problems on the Mesh of Buses
J. Algorithms 20, pp.613631 (1996)
 Preliminary Version:
Kazuo Iwama, Eiji Miyano , Yahiko Kambayashi
Routing Problems on the Mesh of Buses
Proc. Third International Symposium on
Algorithms and Computation (ISAAC'92), LNCS, pp.155164, Nagoya (December,
1992)
 Kazuo Iwama, Eiji Miyano
Intractability of ReadOnce Resolution
Proc. Tenth IEEE Conference on Structure in Complexity Theory,
pp.2936, Minneapolis, USA (June, 1995)
 Kazuo Iwama, Eiji Miyano
Security of TestCase Generation with Known Answers
Proc. AAAI Spring Symposium Series, pp.8591, Stanford, USA (March, 1993)
 Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano
Random Generation of Satisfiable and Unsatisfiable CNF Predicates
Proc. the IFIP 12th World Computer Congress,
Vol.1, pp.322328, Madrid, Spain (September, 1992)
 Kazuo Iwama, Eiji Miyano ,
Yahiko Kambayashi
Time Bounds for
Sorting and Routing Problems on MeshBus Computers
Proc. Joint
Symposium on Parallel Processing '91 (JSPP'91), pp.453460, Koube,
Japan (May, 1991)
Talks in international workshops/meetings
 Yuichi Asahiro, Hiroshi Eto, Takehiro Ito , Eiji Miyano .
Regular induced subgraphs in bipartite and planar graphs.
Proc. 19th JapanKorean Joint Workshop on Algorithms and Computation
(WAAC 2016), 4318, August 3031, Hakodate Citizen Hall, Hakodate, Hokkaido, Japan (August 2016)
 Ei Ando, Akitoshi Kawamura, Masashi Kiyomi, Eiji Miyano ,
Hirotaka Ono.
Logging with maximum length constraint.
Proc. 19th JapanKorean Joint Workshop on Algorithms and Computation
(WAAC 2016), 4 pages, August 3031, Hakodate Citizen Hall, Hakodate, Hokkaido, Japan (August 2016)
 Yuichi Asahiro, Yuya Doi, Eiji Miyano , Hirotaka Shimizu.
Approximation algorithms to find maximum distancebounded
subgraphs (one page abstract).
The 9th Asian Association for
Algorithms and Computation Annual
Meeting (AAAC16), p.11, May 1416, Taipei, Taiwan
(May, 2016)
 Hiroshi Eto, Zhilong Liu, Eiji Miyano .
Simple approximation algorithms for the distance3 independent set problem on cubic graphs (one page abstract).
The 9th Asian Association for
Algorithms and Computation Annual
Meeting (AAAC16), p.xx, May 1416, Taipei, Taiwan
(May, 2016)
 Yuichi Asahiro, Hiroshi Eto, Takehiro Ito , Eiji Miyano .
Maximum rRegular Induced Subgraph Problems for Chordal Bipartite Graphs (one page abstract).
Seventh Asian Association for
Algorithms and Computation Annual
Meeting (AAAC14), Page 18, May 1719, Hangzhou, China
(May, 2014)
 Yuichi Asahiro, Yuya Doi, Eiji Miyano , Hirotaka
Shimizu.
Maximum DiameterBounded Subgraphs in Intersection Graphs.
Proc. The 16th KoreaJapan Joint Workshop on Algorithms and Computation
(WAAC 2013), pp.8390, July 1213, Kyonggi University, Suwon, Korea (July 2013)
 Yuichi Asahiro, Yuya Doi, Eiji Miyano , Hirotaka Shimizu
Maximum DiameterBounded Subgraphs in Graphs Without Long
Induced Cycles (one page abstract).
Sixth Asian Association for
Algorithms and Computation Annual
Meeting (AAAC13), Page 24, April 1921, Matsushima, Japan
(April, 2013)
 Yuichi Asahiro, Hiroshi Eto, Eiji Miyano .
Improved Inapproimability of Regular Induced Connected Subgraph Problems
Proc. The 15th JapanKorea Joint Workshop on Algorithms and Computation
(WAAC 2012), pp.161168, July 1011, National Institute of Informatics,
Tokyo, Japan (July 2012)
 Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
W[1]Hardness of Regular Induced Connected Subgraph Problems
(one page abstract).
Fifth Asian Association for
Algorithms and Computation Annual
Meeting (AAAC12), Page 19, April 2122, Fundan University, Shanghai, China
(April, 2012)
 Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distanced Independent Set Problems
(one page abstract).
Fifth Asian Association for
Algorithms and Computation Annual
Meeting (AAAC12), Page 20, April 2122, Fundan University, Shanghai, China
(April, 2012)
 Eiji Miyano and
Hirotaka Ono
Maximum Edge Domination Problem (one page abstract)
Fourth Asian Association for
Algorithms and Computation Annual
Meeting (AAAC11), Page 66, April 1617, Hsinchu, Taiwan (April, 2011)
 Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
2Competitive Algorithm for Online OVSF Code Assignment with Small
Resource Augmentation (one page abstract)
Fourth Asian Association for
Algorithms and Computation Annual
Meeting (AAAC11), Page 69, April 1617, Hsinchu, Taiwan (April, 2011)
 Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
NPHardess of the Sorting Buffer Problem on the Uniform Metric
( one page abstract )
First Asian Association for
Algorithms and Computation Annual
Meeting (AAAC08), Page 25, April 2627, Hong Kong (April, 2008)
 Kazuo Iwama and Eiji Miyano
New Techniques in 2D Mesh Routing
ACM/UMIACS Workshop on Parallel Algorithms (WoPA'99), May 45,
1999, Atlanta, Georgia, USA (May, 1999)
 Kazuo Iwama and Eiji Miyano
New Bounds for Oblivious Mesh Routing
SPAA98 Revue, Puerto Vallarta, Mexico (June, 1998)
Click here to show talks, technical reports, and etc in Japanese.