Publication List
Eiji TCS Group SDI Dept Iizuka Kyutech

Publications

Refereed papers in journals, book series, and international conferences

  1. Complexity of the minimum single dominating cycle problem for graph classes.

  2. An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops.

  3. Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu
    Optimal approximation algorithms for maximum distance-bounded subgraph problems.
    Algorithmica, to appear
    DOI: 10.1007/s00453-017-0344-y

  4. 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/s00453-017-0302-8

  5. Hiroshi Eto, Takehiro Ito , Zhilong Liu, Eiji Miyano
    Approximation algorithm for the distance-3 independent set problem on cubic graphs.
    Proc. 11th International Conference and Workshops on Algorithms and Computation, LNCS10167, pp.228-240, Microelectronics and Information System Research Center, National Chiao Tung University, Hsinchu, Taiwan (March 2017)

  6. 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.270-284, City University of Hong Kong, Hong Kong, China (December 2016)

  7. Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
    Experimental evalution of approximation algorithms for maximum distance-bounded subgraph problems.
    Proc. Joint 8th International Conference on Soft Computing and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems, pp.892-897, Hokkai-Gakuen University, Sapporo, Hokkaido, Japan (August 2016)

  8. Weitian Tong, Eiji Miyano , Randy Goebel, Guohui Lin
    A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan.
    Proc. 10th International Frontiers of Algorithmics Workshp (FAW 2016), LNCS9711, pp.227-237, Qingdao University, Qingdao, China (July 2016)

  9. Daiki Hoshika, Eiji Miyano
    Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes.
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol.E99-A, No.6, pp.1059-1066 (June 2016)
  10. Preliminary version:
    Daiki Hoshika, Eiji Miyano
    Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes.
    Proc. 10th International Conference on Algorithmic Aspects of Information and Management (AAIM 2014), LNCS8546, pp.100--111, Harbour Centre, Simon Fraser University, Vancouver, Canada (July 2014)

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

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

  14. 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.41-465 (2015)
  15. 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.332-343, the Athens University of Economics and Business, Athens, Greece (April, 2012)

  16. 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)

  17. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano , Takehiro Ito
    Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.
    Theoretical Computer Science, Vol.550, 18, 21-35 (September 18, 2014)
    DOI: 10.1016/j.tcs.2014.07.008
  18. 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.28-39, Crowne Plaza Liverpool, Liverpool, United Kingdom (August, 2013)

  19. Hiroshi Eto, Fengrui Guo, Eiji Miyano
    Distance-d Independent Set Problems for Bipartite and Chordal Graphs.
    Journal of Combinatorial Optimization, Vol.27, Issue 1, pp.88-99 (January 2014)
  20. Preliminary Version:
    Hiroshi Eto, Fengrui Guo, Eiji Miyano
    Distance-d Independent Set Problems for Bipartite and Chordal Graphs.
    Proc. 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2012), LNCS 7402, pp.234-244, Banff Centre, Banff, Canada (August, 2012)

  21. 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.687-708 (November 2013)
  22. 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.259-270, DoubleTree by Hilton Hotel Dalls, Richardson, Texas, USA (August, 2011)

  23. Yuichi Asahiro, Eiji Miyano , Toshihide Murata, Hirotaka Ono
    Optimal Approximability of Bookmark Assignments
    Discrete Applied Mathematics, Vol.161, Issues 16-17, pp.2361-2366 (November, 2013)
  24. 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.115-124, Cesky Krumolov, Czech Republic (August, 2007)

  25. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
    Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems.
    IEICE Transactions on Information and Systems, Vol.E96-D, No.3, pp.443-449 (March 2013)
  26. Preliminary Version:
    Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
    Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems.
    Proc. the 2011 International Conference of Foundation of Computer Science (FCS'2011), pp.102-107, Las Vegas, Nevada, USA (July, 2011)

  27. Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
    NP-Hardness of the Sorting Buffer Problem on the Uniform Metric
    Discrete Applied Mathematics, Vol.160, Issues 10-11, pp.1453-1464 (July, 2012)
  28. Preliminary Version:
    Proc. the 2008 International Conference of Foundation of Computer Science (FCS'08), pp.137-143, Las Vegas, Nevada, USA (July, 2008)

  29. Masao Kumamoto, Eiji Miyano
    Optimal Distortion Embedding of Complete Binary Trees into Lines.
    Information Processing Letters, Vol.112, No.10, pp.365-370 (May, 2012)
  30. Preliminary Version:
    Proc. the 2010 International Conference of Foundation of Computer Science (FCS'2010), pp.16-21, Las Vegas, Nevada, USA (July, 2010)

  31. 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.139-146, Storey Hall, RMIT University, Melbourne, Australia (January, 2012)

  32. 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.78-96 (May 2011)
  33. 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.167-177, Washington State University Vancouver Campus, WA (or Portland, OR), USA (June, 2007)

  34. 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.583-601 (April, 2011)
  35. 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.1-8 (May 2009)

  36. 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)
  37. 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.97-106, Wollongong, NSW, Australia (January, 2008)

  38. 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.55-61, Curtin University, Perth, Australia (January, 2011)

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

  40. 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.93-98 (January, 2010)
  41. 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.164-175, Hotel Sklar, Harrachov, Czech Republic (January, 2007)

  42. Kazuo Iwama , Eiji Miyano , Hirotaka Ono
    Drawing Borders Efficiently
    Theory of Computing Systems, Vol.44, No.2, pp.230-244 (February 2009)
  43. Preliminary Version:
    Kazuo Iwama , Eiji Miyano , Hirotaka Ono
    Drawing Borders Efficiently
    Proc. 4th International Conference on FUN WITH ALGORITHMS ( FUN 2007), LNCS 4475, pp.213-226, Castiglioncello (LI), Tuscany, Italy (June, 2007)

  44. Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano , Shuichi Miyazaki, Katsuhisa Yamanaka
    Computational Complexities of University Interview Timetabling
    IEICE Transactions on Information and Systems, Vol.E92-D, No.2, pp.130-140 (February 2009)

  45. Yuichi Asahiro, Eiji Miyano , Shinichi Shimoirisa
    Grasp and Delivery for Moving Objects on Broken Lines
    Theory of Computing Systems, Vol.42, No.3, pp.289-305 (April, 2008)
  46. 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.36-50, Certosa di Pontignano, Siena, Italy (October, 2005)

  47. 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.197-216 (April 2007)
  48. 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.11-20, Wrest Point Casino Hotel, Tasmania, Australia (January, 2006)

  49. 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.448-453, Hotel International Brno, Brno, The Czech Republic (August, 2006)

  50. Takahiro Yukizane, Shin-ya Ohi, Eiji Miyano , Hideo Hirose.
    The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics.
    Special Issue on Invited Papers from New Horizons in Computing, IEICE Transactions on Information and Systems, Vol.E89-D, No.8, pp.2332-2339 (August, 2006)
  51. 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.293-297, Sheraton World Resort, Orlando, Florida, USA (July, 2006)

  52. 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.272-283, University of Rome, Rome, Italy (May, 2006)

  53. Hideo Hirose, Takahiro Yukizane, Eiji Miyano
    The bump hunting method using the genetic algorithm and the extreme-value statistics with application to a messy customer database
    2006 Hawaii International Conference on Statistics, Mathematics and Related Fields, Hawaii, USA (January, 2006), to appear

  54. Yuichi Asahiro, Eiji Miyano , Shinichi Shimoirisa
    K-Collect Tours for Moving Objects with Release Times and Deadlines
    Proc. 9th World Multi-Conference on Systemics, Cybernetics, and Informatics, Vol.III, pp.192-197, Rozen Centre Hotel, Orland, Florida, USA (July, 2005)

  55. Kazuo Iwama , Eiji Miyano
    An O(\sqrt{N}) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size
    Journal of Algorithms, Vol.41, pp.262-279 (2001)
  56. Preliminary Version:
    Kazuo Iwama , Eiji Miyano
    An O(\sqrt{N}) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size
    Proc. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), pp.466-475, Omni Inner Harbor Hotel, Baltimore, Maryland (January, 1999)

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

  59. Kazuo Iwama , Yahiko Kambayashi, Eiji Miyano
    New Bounds for Oblivious Mesh Routing
    Journal of Graph Algorithms and Applications , to appear (2001)
  60. 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.295-306, Venice, Italy (August, 1998)

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

  63. 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.186-195, Bar Harbor, Maine, USA (July, 2000)

  64. 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.E83-D, No.3, pp.530-540 (March, 2000)

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

  67. Kazuo Iwama , Eiji Miyano
    Multipacket Routing on 2-D meshes and Its Applications to Fault-Tolerant Routing
    Proc. Seventh Annual European Symposium on Algorithms (ESA'99), LNCS, pp.53-64, Prague, Czech Republic, July 16-18, 1999)

  68. Kazuo Iwama , Eiji Miyano
    Better approximations of non-Hamiltonian graphs
    Discrete Applied Mathematics 81, pp.239--261 (January, 1998)

  69. 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., 377-393, American Mathematical Society (1996)
  70. Preliminary Version:
    Kazuo Iwama and Eiji Miyano
    Test-Case Generation with Known Answers and Proved Secutities
    Proc. Second DIMACS Challenge Workshop (Satisfiability), New Jersey, USA (October, 1993)

  71. Kazuo Iwama, Eiji Miyano , Yahiko Kambayashi
    Routing Problems on the Mesh of Buses
    J. Algorithms 20, pp.613-631 (1996)
  72. 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.155-164, Nagoya (December, 1992)

  73. Kazuo Iwama, Eiji Miyano
    Intractability of Read-Once Resolution
    Proc. Tenth IEEE Conference on Structure in Complexity Theory, pp.29-36, Minneapolis, USA (June, 1995)

  74. Kazuo Iwama, Eiji Miyano
    Security of Test-Case Generation with Known Answers
    Proc. AAAI Spring Symposium Series, pp.85-91, Stanford, USA (March, 1993)

  75. Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano
    Random Generation of Satisfiable and Unsatisfiable CNF Predicates
    Proc. the IFIP 12th World Computer Congress, Vol.1, pp.322-328, Madrid, Spain (September, 1992)

  76. Kazuo Iwama, Eiji Miyano , Yahiko Kambayashi
    Time Bounds for Sorting and Routing Problems on Mesh-Bus Computers
    Proc. Joint Symposium on Parallel Processing '91 (JSPP'91), pp.453-460, Koube, Japan (May, 1991)

Talks

Talks in international workshops/meetings

  1. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito , Eiji Miyano .
    Regular induced subgraphs in bipartite and planar graphs.
    Proc. 19th Japan-Korean Joint Workshop on Algorithms and Computation (WAAC 2016), 43-1-8, August 30-31, Hakodate Citizen Hall, Hakodate, Hokkaido, Japan (August 2016)

  2. Ei Ando, Akitoshi Kawamura, Masashi Kiyomi, Eiji Miyano , Hirotaka Ono.
    Logging with maximum length constraint.
    Proc. 19th Japan-Korean Joint Workshop on Algorithms and Computation (WAAC 2016), 4 pages, August 30-31, Hakodate Citizen Hall, Hakodate, Hokkaido, Japan (August 2016)

  3. Yuichi Asahiro, Yuya Doi, Eiji Miyano , Hirotaka Shimizu.
    Approximation algorithms to find maximum distance-bounded subgraphs (one page abstract).
    The 9th Asian Association for Algorithms and Computation Annual Meeting (AAAC16), p.11, May 14-16, Taipei, Taiwan (May, 2016)

  4. Hiroshi Eto, Zhilong Liu, Eiji Miyano .
    Simple approximation algorithms for the distance-3 independent set problem on cubic graphs (one page abstract).
    The 9th Asian Association for Algorithms and Computation Annual Meeting (AAAC16), p.xx, May 14-16, Taipei, Taiwan (May, 2016)

  5. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito , Eiji Miyano .
    Maximum r-Regular Induced Subgraph Problems for Chordal Bipartite Graphs (one page abstract).
    Seventh Asian Association for Algorithms and Computation Annual Meeting (AAAC14), Page 18, May 17-19, Hangzhou, China (May, 2014)

  6. Yuichi Asahiro, Yuya Doi, Eiji Miyano , Hirotaka Shimizu.
    Maximum Diameter-Bounded Subgraphs in Intersection Graphs.
    Proc. The 16th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2013), pp.83--90, July 12-13, Kyonggi University, Suwon, Korea (July 2013)

  7. Yuichi Asahiro, Yuya Doi, Eiji Miyano , Hirotaka Shimizu
    Maximum Diameter-Bounded Subgraphs in Graphs Without Long Induced Cycles (one page abstract).
    Sixth Asian Association for Algorithms and Computation Annual Meeting (AAAC13), Page 24, April 19-21, Matsushima, Japan (April, 2013)

  8. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano .
    Improved Inapproimability of Regular Induced Connected Subgraph Problems
    Proc. The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), pp.161-168, July 10-11, National Institute of Informatics, Tokyo, Japan (July 2012)

  9. 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 21-22, Fundan University, Shanghai, China (April, 2012)

  10. Hiroshi Eto, Fengrui Guo, Eiji Miyano
    Distance-d Independent Set Problems (one page abstract).
    Fifth Asian Association for Algorithms and Computation Annual Meeting (AAAC12), Page 20, April 21-22, Fundan University, Shanghai, China (April, 2012)

  11. 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 16-17, Hsinchu, Taiwan (April, 2011)

  12. Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
    2-Competitive 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 16-17, Hsinchu, Taiwan (April, 2011)

  13. Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
    NP-Hardess 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 26-27, Hong Kong (April, 2008)

  14. Kazuo Iwama and Eiji Miyano
    New Techniques in 2-D Mesh Routing
    ACM/UMIACS Workshop on Parallel Algorithms (WoPA'99), May 4-5, 1999, Atlanta, Georgia, USA (May, 1999)

  15. Kazuo Iwama and Eiji Miyano
    New Bounds for Oblivious Mesh Routing
    SPAA98 Revue, Puerto Vallarta, Mexico (June, 1998)

Others

Click here to show talks, technical reports, and etc in Japanese.


Eiji TCS Group SDI Dept Iizuka Kyutech