Journal and Book series

  1. K. Utsunomiya, Y. Asahiro.
    Improvement of the greedy algorithm for (n^2-1)-puzzle
    International Journal of Innovative Computing and Applications (in press)
  2. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
    Theory of Computing Systems, Vol.58, No.1, pp.60-93, January 2016
    DOI: 10.1007/s00224-014-9565-5
  3. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    Graph Orientations Optimizing the Number of Light or Heavy Vertices
    Journal of Graph Algorithms and Applications, Vol.19, No.1, pp.441-465, 2015
    DOI:10.7155/jgaa.00371
  4. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    Complexity of finding maximum regular induced subgraphs with prescribed degree
    Theoretical Computer Science, Vol. 550, pp.21-35, Sep. 2014
    DOI: 10.1016/j.tcs.2014.07.008
  5. Yuichi Asahiro, Kenta Kanmera and Eiji Miyano
    (1+ε)-competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation
    Journal of Combinatorial Optimization, Vol.26, Issue 4, pp.687-708, Nov. 2013
    DOI: 10.1007/s10878-012-9454-2
  6. Yuichi Asahiro, Eiji Miyano, Toshihide Murata, and Hirotaka Ono
    Optimal Approximability of Bookmark Assignments
    Discrete Applied Mathmatics, Vol.161, Issues 16-17, pp.2361-2366, Nov. 2013
    DOI: 10.1016/j.dam.2013.05.018
  7. Yuichi Asahiro, Hiroshi Eto, and 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.
  8. Yuichi Asahiro, Kenichi Kawahara, and Eiji Miyano
    NP-hardness of the Sorting Buffer Problem on the Uniform Metric
    Discrete Applied Mathematics, Volume 160, Issues 10-11, pp.1453-1464, July 2012.
  9. Y. Asahiro, J. Jansson, E. Miyano, H. Ono, and K. Zenmyo
    Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
    Jounal of Combinatorial Optimization, Vol.22, No.1, pp.78-96, May 2011.
  10. Y. Asahiro, J. Jansson, E. Miyano, and H. Ono
    Graph Orientation to Maximize the Minimum Weighted Outdegree
    International Journal of Foundations of Computer Science, Vol.22, No.3, pp.583-601, Apr. 2011.
  11. Y. Asahiro, E. Miyano, and H. Ono
    Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
    Discrete Applied Mathematics, Vol.159, No.7, pp.498-508, Apr. 2011.
  12. Y. Aashiro, E. Miyano, S. Miyazaki, and T. Yoshimuta
    Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
    Information Processing Letters, Vol.110, No.3, pp.93-98, Jan. 2010.
  13. Y. Asahiro, E. Miyano and S. Shimoirisa
    Grasp and Delivery for Moving Objects on Broken Lines
    Theory of Computing Systems, Vol.42, No.3, pp.289-305, Apr. 2008.
  14. Y. Asahiro, E. Miyano, H. Ono, and K. Zenmyo
    Graph Orientation Algorithms to Minimize the Maximum Outdegree
    International Journal of Foundations of Computer Science, Vol.18, No.2, pp.197-215, Apr. 2007.
  15. Y. Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, and M. Yamashita
    How to Collect Balls Moving in the Euclidean Plane
    Discrete Applied Mathematics, Vol.154, No.16, pp.2247-2262, Nov. 2006.
  16. Y. Asahiro, M. Ishibashi, and M. Yamashita
    Independent and Cooperative Parallel Search Methods for the Generalized Assignment Problem
    Optimization Methods and Software, Vol.18, No.2, pp.129-141, Apr. 2003.
  17. Y. Asahiro, R. Hassin, and K. Iwama
    Complexity of Finding Dense Subgraphs
    Discrete Applied Mathematics, Vol 121, pp.15-26, Sep. 2002.
  18. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama
    Greedily Finding a Dense Subgraph
    J. Algorithms, Vol 34, pp.203-221, Jan. 2000.
  19. Y. Asahiro, K. Iwama, and E. Miyano
    Random Generation of Test Instances with Controlled Attributes
    Cliques, Coloring, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, pp.377-393, 1996.

International Conference

  1. Y. Asahiro, T. Kubo, E. Miyano.
    Experimental evaluation of approximation algorithms for maximum distance-bounded subgraph problems
    Proc. Joint 8th International Conference on Soft Com-puting and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems, 892-897, 2016
  2. Y. Asahiro, H. Eto, T. Ito, and E. Miyano.
    Regular induced subgraphs in bipartite and planar graphs
    Proc. The 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016), 43-1-8, 2016
  3. Yuichi Asahiro, Yuya Doi, Eiji Miyano, and Hirotaka Shimizu
    Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
    Proc. 9th International Conference on Combinatorial Optimization and Applications (COCOA 2015), Lecture Notes in Computer Science, Vol.9486, pp.586-600, Houston, TX, USA, December 18-20, 2015.
    DOI: 10.1007/978-3-319-26626-8_43
  4. Kaede Utsunomiya and Yuichi Asahiro
    An Improvement of the Greedy Algorithm for the (n^2-1)-Puzzle
    Proc. 15th International Conference on Computational Science and Its Applications (ICCSA 2015), Lecture Notes in Computer Science, Vol.9156, pp.457--473, Banff Park Lodge Conference Center, Banff, AB, Canada, June 22-25, 2015.
    DOI: 10.1007/978-3-319-21407-8_33
  5. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
    Proc. 11th International Workshop on Approximation and Online Algorithms (WAOA 2013), Lecture Notes in Computer Science, Vol.8447, pp.24--36, 2014.
    DOI: 10.1007/978-3-319-08001-7_3
    (the workshop was held: Sophia Antipolis, France, September 5-6, 2013)
  6. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, and Eiji Miyano
    Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree
    Proc. 19th International Symposium on Fundamentals of Computation Theory (FCT 2013), Lecture Notes in Computer Science, Vol.8070, pp.28--39, Crowne Plaza Hotel, Liverpool, UK, August 19-21, 2013.
    DOI: 10.1007/978-3-642-40164-0_6
  7. Yuichi Asahiro, Yuya Doi, Eiji Miyano, and 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, Kyonggi University, Suwon, Korea July 12-13, 2013.
  8. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    Graph Orientations Optimizing the Number of Light or Heavy Vertices
    Proc. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Lecture Notes in Computer Science, Vol.7422, pp.332--343, 2012.
  9. Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    Improved Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems
    Proc. The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), pp.161--168, 2012.
  10. Y. Asahiro, J. Jansson, E. Miyano, and H. Ono
    Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty
    Proc. Computing: The Australasian Theory Symposium(CATS 2012), Conferences in Research and Practice in Information Technology, Vol.128, pp.139-146, 2012.
  11. Y. Asahiro, K. Kanmera, and E.Miyano
    (1+ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation
    Proc. 17th Annual International Conference on Computing and Combinatorics (COCOON 2011), Lecture Notes in Computer Science, Vol.6842, pp.259-270, Aug. 2011.
  12. Y. Asahiro, H. Eto, and E. Miyano
    Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems
    Proc. The 2011 International Conference on Foundations of Computer Science (FCS), pp.102-107, Jul. 2011
  13. Y. Asahiro, E. Miyano, and K. Samizo
    Approximating Maximum Diameter-Bounded Subgraphs
    Proc. The 9th Latin American Theoretical Informatics Symposium (LATIN), Lecture Notes in Computer Science, Vol.6034, pp.616-627, Apr. 2010.
  14. Y. Asahiro, J. Jansson, E. Miyano, and H. Ono
    Graph Orientation to Maximize the Minimum Weighted Outdegree
    Proc. 2009 IEEE International Symposium on Parallel & Distributed Processing, pp.1-8, May. 2009.
  15. Y. Asahiro, S. Fujita, I. Suzuki, and M. Yamashita
    A Self-Stabilizing Marching Algorithm for a Group of Oblivious Robots
    Proc. The 12th International Conference on Principles of Distributed Systems (OPODIS), Lecture Notes in Computer Science, Vol.5401, pp.125-144, Dec. 2008.
  16. Y. Asahiro, K. Kawahara, and E. Miyano
    NP-Hardness of the Sorting Buffer Problem on the Uniform Metric
    Proc. The 2008 International Conference on Foundations of Computer Science (FCS), pp.137-143, Jul. 2008.
  17. Y. Asahiro, E. Miyano, and H.Ono
    Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Outdegree
    Proc. Computing: The Australasian Theory Symposium(CATS), Conferences in Research and Practice in Information Technology, Vol.77, pp.97-106, Jan. 2008.
  18. Y. Asahiro, E. Miyano, T. Murata, and H. Ono
    On Approximation of Bookmark Assignments
    Proc. 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, Vol.4708, pp.115-124, Aug. 2007
  19. Y. Asahiro, J. Jansson, E. Miyano, H. Ono, and K. Zenmyo
    Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
    Proc. 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), Lecture Notes in Computer Science, Vol.4508, pp.167-177, Jun. 2007.
  20. Y. Aashiro, E. Miyano, S. Miyazaki, and T. 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), Lecture Notes in Computer Science, Vol.4362, pp.164-175, Jan. 2007.
  21. Y. Asahiro, T. Furukawa, K. Ikegami, and E. Miyano
    How to Pack Directed Acyclic Graphs into Small Blocks
    Proc. 6th International Conference on Algorithms and Complexity (CIAC), Lecture Notes in Computer Science, Vol.3998, pp.272-283, May. 2006.
  22. Y. Asahiro, E. Miyano, H. Ono, and K. Zenmyo
    Graph Orientation Algorithms to Minimize the Maximum Outdegree
    Proc. Computing: The Australasian Theory Symposium(CATS), Conferences in Research and Practice in Information Technology, Vol.51, pp.11-20, Jan. 2006.
  23. Y. Asahiro, E. Miyano, and S. Shimoirisa
    Pickup and Delivery for Moving Objects on Broken Lines
    Proc. 9th Italian Conference on Theoretical Computer Science (ICTCS), Lecture Notes in Computer Science, Vol.3701, pp.36-50, Oct. 2005.
  24. Y. Asahiro, E. Miyano, and S. Shimoirisa
    K-Collect Tours for Moving Objects with Release Times and Deadlines
    Proc. 9th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI), Vol.III, pp.192-197, Jul. 2005.
  25. Y. Asahiro
    Simple Greedy Methods for DNA Word Design
    Proc. 9th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI), Vol.III, pp.186-191, Jul. 2005.
  26. Y. Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, and M. Yamashita
    How to Collect Balls Moving in the Euclidean Plane
    Proc. Computing: The Australasian Theory Symposium(CATS), pp.1-16, Jan. 2004.
  27. L. Xiang, K. Ushijima, and Y. Asahiro
    Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order
    Proc. International Conference on Information Technology: Coding and Computing (ITCC 2002), pp.396-401, Apr. 2002.
  28. Y. Asahiro, E. C. Chang, A. Mali, I. Suzuki, and M. Yamashita
    A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor
    Proc. IEEE International Conference on Robotics and Automation, pp.3016-3021, May 2001.
  29. Y. Asahiro, E. C. Chang, A. Mali, S. Nagafuji, I. Suzuki, and M. Yamashita
    Distributed Motion Generation for Two Omni-Directional Robots Carrying a Ladder
    Distributed Autonomous Robotic Systems, Vol. 4, pp.427-436, Oct. 2000.
  30. Y. Asahiro, H. Asama, I. Suzuki, and M. Yamashita
    Improvement of Distributed Control Algorithms for Robots Carrying an Object
    Proc. 1999 IEEE International Conference on Systems, Man, and Cybernetics, Vol.VI, pp.608-613, Oct. 1999.
  31. Y. Asahiro, H. Asama, S, Fujita, I. Suzuki, and M. Yamashita
    Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time
    Dagstuhl Seminar on Modelling and Planning for Sensor-based Intelligent Robot Systems, Lecture Notes in Artificial Intelligence 1724, pp.240-254, 1999.
  32. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama
    Greedily Finding a Dense Subgraph
    Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Sciense 1097, pp.136-148, Jul. 1996.
  33. Y. Asahiro and K. Iwama
    Finding Dense Subgraphs
    Proc. 6th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 1004, pp.102-111, Dec. 1995.

Talks

  1. Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu
    Approximation Algorithms to Find Maximum Distance-Bounded Subgraphs
    The 9th Annual Meeting of Asian Association for Algorithms and Computation, p.11(one page abstract), Taipei, Taiwan, May 14-16, 2016.
  2. Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita
    A Self-stabilizing Algorithm for Robust and Adaptive Marching
    Workshop on Distributed Robotic Swarms, Oct. 5, Tokyo, 2015.
  3. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, and Eiji Miyano
    Maximum r-Regular Induced Subgraph Problems for Chordal Bipartite Graphs
    Seventh Asian Association for Algorithms and Computation Annual Meeting (AAAC14), p.18(one page abstract), May 17-19, Hangzhou, China, 2014.
  4. Yuichi Asahiro, Yuya Doi, Eiji Miyano, and Hirotaka Shimizu
    Maximum Diameter-Bounded Subgraphs in Graphs without Long Induced Cycles
    The 6th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2013), p.24(one page abstract), Matsushima, Japan, April 19-21, 2013.
  5. Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    W[1]-Hardness of Regular Induced Connected Subgraph Problems
    Fifth Asian Association for Algorithms and Computation Annual Meeting (AAAC12), p.19(one page abstract), Fudan University, Shanghai, China, April 21-22, 2012.
  6. Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
    2-Competitive Algorithm for Online OVSF Code Assignment with Small Resource Augmentation
    The 4th Annual Meeting of Asian Association for Algorithms and Computation, p.69(one page abstract), April, 2011
  7. Yuichi Asahiro
    A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
    The Tenth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), Tutorial, Dec. 2009.
  8. Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo
    Complexity of Max d-Diameter Subgraph Problems on Chordal Graphs
    Second Asian Association for Algorithms and Computation Annual Meeting (AAAC09), p.7(one page abstract), Apr. 2009.
  9. Yuichi Asahiro, Kenichi Kawahara and Eiji Miyano
    NP-Hardness of the Sorting Buffer Problem on the Uniform Metric
    Proc. The First AAAC Annual Meeting, p.25(one page abstract), April, 2008.
  10. Yuichi Asahiro, Eiji Miyano and Taku Nakamura
    Note on Approximation of 1-Regular 2-Color Paintshop Problem
    Proc. INFORMS Annual Meeting, p.58(one page abstract), Nov. 2007.
  11. M. Ishibashi, Y. Asahiro, and M. Yamashita
    Parallelization of a local search method for the generalized assignment problem
    The Second Japanese-Sino Optimization Meeting(JSOM 2002), p.85(one page abstract), Oct. 2002.

Committee Member

  1. Organizing Committee
    The 11th Japan-Korea Workshop on Algorithms and Computation (WAAC),
    July 19-20, 2008, Fukuoka, Japan.

Others (in Japan[nese])

Please refer the page of other research works (mostly in Japanese).
Links: [Asahiro's page]

asahiro 'at' is.kyusan-u.ac.jp