__ Kyutech Algorithms Group __

## Refereed papers in journals, book series, and international conferences

- Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin,
,__Eiji Miyano__. Parameterized algorithms for the happy set problem. Discrete Applied Mathematics, Vol.304, pp.32-44 (December 15, 2021). DOI:10.1016/j.dam.2021.07.005__Ippei Terabaru__ - Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin,
, An Zhang. Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theoretical Computer Science, Vol.882, pp.77-108 (August 23, 2021). DOI:10.1016/j.tcs.2021.06.017__Eiji Miyano__ - Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin,
,__Eiji Miyano__. Complexity and Approximability of the Happy Set Problem. Theoretical Computer Science, Vol.866, pp.123-144 (April 18, 2021). DOI:10.1016/j.tcs.2021.03.023__Ippei Terabaru__ - Yuichi Asahiro, Jesper Jansson,
, Hirotaka Ono, Sandhya T.P.. Graph Orientation with Edge Modifications. International Journal of Foundations of Computer Science, Vol.322, No.2, pp.209-233 (January 30, 2021).__Eiji Miyano__

DOI:10.1142/S012905412150012X - Yuichi Asahiro, Tetsuya Furukawa,
,__Keiichi Ikegami__,__Eiji Miyano__. How to Pack Directed Acyclic Graphs into Small Blocks. Discrete Applied Mathematics, Vol.228, pp.91-113 (January 15, 2021). DOI:10.1016/j.dam.2020.08.005__Tsuyoshi Yagita__ - Yuichi Asahiro, Jesper Jansson,
, Hesam Nikpey, Hirotaka Ono. Graph orientation with splits. Theoretical Computer Science, Vol.844, pp.16-25 (December 6, 2020). DOI:10.1016/j.tcs.2020.07.013__Eiji Miyano__ - Yuichi Asahiro, Jepser Jansson, Guohui Lin,
, Hirotaka Ono,__Eiji Miyano__. Exact algorithms for the repetition-bounded longest common subsequence problem. Theoretical Computer Science, Vol.838, pp.238-249 (October 24, 2020). DOI:10.1016/j.tcs.2020.07.042__Tadatoshi Utashima__ - Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin,
, An Zhang. Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Proc. 16th Annual Conference on Theory and Applications of Models of Computation (TAMC2020), LNCS12337, pp.426-438, Changsha, China (October 18 – October 20, 2020).__Eiji Miyano__

DOI:10.1007/978-3-030-59267-7_36 -
,__Eiji Miyano__, Ryuhei Uehara,__Toshiki Saitoh__, and Tom C. van der Zanden. Complexity of the maximum k-path vertex cover problem. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E103-A, No.10, pp.1193-1201 (October 1, 2020). DOI:10.1587/transfun.2019DMP0014__Tsuyoshi Yagita__ - Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin,
,__Eiji Miyano__. Graph classes and approximability of the happy set problem. Proc. 16th International Computing and Combinatorics Conference (COCOON 2020), LNCS12273, pp.335-346, Georgia State University, Atlanta, GA, USA (Fully Online, August 29 – August 31, 2020).__Ippei Terabaru__

DOI:10.1007/978-3-030-58150-3_27 - Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin,
,__Eiji Miyano__. Parameterized algorithms for the happy set problem. Proc. 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), LNCS12049, pp.323-328, Institute for Mathematical Sciences, National University of Singapore (March 31 – April 2, 2020).__Ippei Terabaru__

DOI:10.1007/978-3-030-39881-1_27 - Yuichi Asahiro, Jepser Jansson, Guohui Lin,
, Hirotaka Ono,__Eiji Miyano__. Exact algorithms for the bounded repetition longest common subsequence problem. Proc. 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2019), LNCS11949, pp.1-12, the City Hotel Xiamen, Xiamen, China (December 13 – December 15, 2019).__Tadatoshi Utashima__

DOI:10.1007/978-3-030-36412-0_1 - Yuichi Asahiro,
,__Tomohiro Kubo__. Experimental evaluation of approximation and heuristic algorithms for maximum distance-bounded subgraph problems. The Review of Socionetwork Strategies. Vol.13, No.2, pp.143-161 (October, 2019). DOI:10.1007/s12626-019-00036-2__Eiji Miyano__ - Yuichi Asahiro, Guohui Lin,
, and__Zhilong Liu__.__Eiji Miyano__**An approximation algorithm for the maximum induced matching problem on C5-free regular graphs**. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E102-A, No.9, pp.1142-1149 (September 1, 2019). DOI: 10.1587/transfun.E102.A.1142 - Yuichi Asahiro, Jesper Jansson,
, Hirotaka Ono, Sandhya T.P.. Graph Orientation with Edge Modifications. Proc. 13th International Frontiers of Algorithmics Workshop (FAW 2019), LNCS11458, pp.38-50, Tsinghua Sanya International Mathematics Forum (TSIMF), Sanya, China (April 29 – May 3, 2019). DOI:10.1007/978-3-030-18126-0_4__Eiji Miyano__ - Weitian Tong,
, Randy Goebel, Guohui Lin. An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theoretical Computer Science, Vol.734, pp.24-31 (July 22, 2018). DOI: 10.1016/j.tcs.2017.09.018__Eiji Miyano__ - (Preliminary version) Weitian Tong,
, 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 Workshop (FAW 2016), LNCS9711, pp.227-237, Qingdao University, Qingdao, China (June 30 – July 2, 2016). DOI:10.1007/978-3-319-39817-4_22__Eiji Miyano__ - Yuichi Asahiro,
,__Eiji Miyano__. Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. Proc. 18th International Conference on Computational Science and Its Applications (ICCSA 2018), LNCS10961, pp.607-623, Monash University, Caulfield Campus, Melbourne, Australia (July 1-4, 2018). DOI:10.1007/978-3-319-95165-2_43__Tsuyoshi Yagita__ - Yuichi Asahiro,
,__Yuya Doi__,__Eiji Miyano__,__Kazuaki Samizo__. Optimal approximation algorithms for maximum distance-bounded subgraph problems. Algorithmica, Vol.80, No.6, pp.1834-1856 (June, 2018). DOI:10.1007/s00453-017-0344-y__Hirotaka Shimizu__ - Peng Zhang, Yao Xu, Tao Jian, Angsheng Li, Guohui Lin,
. Improved approximation algorithms for the maximum happy vertices and edges problems. Algorithmica, Vol.80, No.5, pp.1412-1438 (May, 2018). DOI:10.1007/s00453-017-0302-8__Eiji Miyano__ - Yuichi Asahiro, Jeper Jansson,
, Hesam Nikpey, Hirotaka Ono. Graph orientation with splits. Proc. 5th International Symposium on Combinatorial Optimization (ISCO2018), LNCS10856, pp.52-63, Palm Plaza Hotel & Spa 5, Marrakesh, Morocco (April 11-13, 2018). DOI:10.1007/978-3-319-96151-4_5__Eiji Miyano__ -
,__Eiji Miyano__, Ryuhei Uehara,__Toshiki Saitoh__, and Tom C. van der Zanden. Complexity of the maximum k-path vertex cover problem. Proc. 12th Annual Workshop on Algorithms and Computation (WALCOM 2018), LNCS10755, pp.240-251, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), ECE building, West Palasi, Dhaka, Bangladesh (March 3-5, 2018). DOI:10.1007/978-3-319-75172-6__Tsuyoshi Yagita__ -
,__Hiroshi Eto__,__Hiroyuki Kawahara__, and__Eiji Miyano__. Complexity of the minimum single dominating cycle problem for graph classes. IEICE TRANSACTIONS on Information and Systems, Vol.E101-D, No.3, pp.574-581 (March 1, 2018). DOI: 10.1587/transinf.2017FCP0007__Natsuki Nonoue__ -
, Takehiro Ito,__Hiroshi Eto__,__Zhilong Liu__. Approximation algorithm for the distance-3 independent set problem on cubic graphs. Proc. 11th International Conference and Workshops on Algorithms and Computation (WALCOM2017), LNCS10167, pp.228-240, Microelectronics and Information System Research Center, National Chiao Tung University, Hsinchu, Taiwan (March 29 – 31, 2017). DOI:10.1007/978-3-319-53925-6_18__Eiji Miyano__ -
, Takehiro Ito,__Hiroshi Eto__,__Zhilong Liu__. Approximability of the distance independent set problem on regular graphs and planar graphs. Proc. 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA2016), LNCS10043, pp.270-284, City University of Hong Kong, Hong Kong, China (December 16 – 18, 2016). DOI:10.1007/978-3-319-48749-6_20__Eiji Miyano__ - Yuichi Asahiro,
,__Tomohiro Kubo__. Experimental evaluation 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).__Eiji Miyano__

DOI: 10.1109/SCIS-ISIS.2016.0193 -
,__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).

DOI: 10.1587/transfun.E99.A.1059 - (Preliminary version)
,__Daiki Hoshika__. 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, BC, Canada (July 8 -11, 2014). DOI:10.1007/978-3-319-07956-1_10__Eiji Miyano__ - Yuichi Asahiro, Jesper Jansson,
, Hirotaka Ono. Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory of Computing Systems, Vol.58, No.1, pp.60-93 (January 2016).__Eiji Miyano__

DOI:10.1007/s00224-014-9565-5 - (Preliminary Version) Yuichi Asahiro, Jesper Jansson,
, 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). DOI:10.1007/978-3-319-08001-7_3__Eiji Miyano__ - Yuichi Asahiro,
,__Yuya Doi__,__Eiji Miyano__. 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). DOI:10.1007/978-3-319-26626-8_43__Hirotaka Shimizu__ - Yuichi Asahiro, Jesper Jansson,
, 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). DOI:10.7155/jgaa.00371__Eiji Miyano__ - (Preliminary Version) Yuichi Asahiro, Jesper Jansson,
, Hirotaka Ono. Graph Orientations Optimizing the Number of Light or Heavy Vertices. Proc. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), LNCS 7422, pp.332-343, the Athens University of Economics and Business, Athens, Greece (April 2012). DOI:10.1007/978-3-642-32147-4_30__Eiji Miyano__ -
and__Eiji Miyano__. 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). DOI: 10.1109/SCIS-ISIS.2014.7044840__Keisuke Tahara__ - Yuichi Asahiro,
,__Hiroshi Eto__, Takehiro Ito. Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. Theoretical Computer Science, Vol.550, 18, 21-35 (September 18, 2014)__Eiji Miyano__

DOI: 10.1016/j.tcs.2014.07.008 - (Preliminary Version) Yuichi Asahiro,
,__Hiroshi Eto__, 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). DOI:10.1007/978-3-642-40164-0_6__Eiji Miyano__ -
,__Hiroshi Eto__,__Fengrui Guo__. Distance-d Independent Set Problems for Bipartite and Chordal Graphs. Journal of Combinatorial Optimization, Vol.27, Issue 1, pp.88-99 (January 2014). DOI:10.1007/s10878-012-9594-4__Eiji Miyano__ - (Preliminary Version)
,__Hiroshi Eto__,__Fengrui Guo__. 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). DOI:10.1007/978-3-642-31770-5_21__Eiji Miyano__ - Yuichi Asahiro,
,__Kenta Kanmera__. (1+ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. Journal of Combinatorial Optimization, Vol.26, Issue 4, pp.687-708 (November 2013)__Eiji Miyano__ - (Preliminary Version) Yuichi Asahiro,
,__Kenta Kanmera__. (1+ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. Proc. 17th Annual International Computing and Combinatorics Conference (COCOON 2011), LNCS 6842, pp.259-270, DoubleTree by Hilton Hotel Dallas, Richardson, Texas, USA (August 2011)__Eiji Miyano__ - Yuichi Asahiro,
,__Eiji Miyano__, Hirotaka Ono. Optimal Approximability of Bookmark Assignments. Discrete Applied Mathematics, Vol.161, Issues 16-17, pp.2361-2366 (November 2013)__Toshihide Murata__ - (Preliminary Version) Yuichi Asahiro,
,__Eiji Miyano__, 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)__Toshihide Murata__ - Yuichi Asahiro,
,__Hiroshi Eto__. 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)__Eiji Miyano__ - (Preliminary Version) Yuichi Asahiro,
,__Hiroshi Eto__. 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)__Eiji Miyano__ - Yuichi Asahiro,
,__Kenichi Kawahara__. NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. Discrete Applied Mathematics, Vol.160, Issues 10-11, pp.1453-1464 (July 2012)__Eiji Miyano__ - (Preliminary Version) Yuichi Asahiro,
,__Kenichi Kawahara__. NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. Proc. the 2008 International Conference of Foundation of Computer Science (FCS’08), pp.137-143, Las Vegas, Nevada, USA (July 2008)__Eiji Miyano__ -
,__Masao Kumamoto__. Optimal Distortion Embedding of Complete Binary Trees into Lines.__Eiji Miyano__

Information Processing Letters, Vol.112, No.10, pp.365-370 (May 2012) - (Preliminary Version)
,__Masao Kumamoto__. Optimal Distortion Embedding of Complete Binary Trees into Lines. Proc. the 2010 International Conference of Foundation of Computer Science (FCS’2010), pp.16-21, Las Vegas, Nevada, USA (July 2010)__Eiji Miyano__ - Yuichi Asahiro, Jesper Jansson,
, 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)__Eiji Miyano__ - Yuichi Asahiro, Jesper Jansson,
, Hirotaka Ono,__Eiji Miyano__. Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. Journal of Combinatorial Optimization, Vol.22, No.1, pp.78-96 (May 2011)__Kouhei Zenmyo__ - (Preliminary Version) Yuichi Asahiro, Jesper Jansson,
, Hirotaka Ono,__Eiji Miyano__. 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)__Kouhei Zenmyo__ - Yuichi Asahiro, Jesper Jansson,
, 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)__Eiji Miyano__ - (Preliminary Version) Yuichi Asahiro, Jesper Jansson,
, 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)__Eiji Miyano__ - Yuichi Asahiro,
, 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)__Eiji Miyano__ - (Preliminary Version) Yuichi Asahiro,
, 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)__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)__Eiji Miyano__ - Yuichi Asahiro,
,__Eiji Miyano__. Approximating Maximum Diameter-Bounded Subgraphs__Kazuaki Samizo__

Proc. The 9th Latin American Theoretical Informatics Symposium (LATIN2010), LNCS 6034, pp.615-626, University of Oaxaca and Hotel Victoria, Oaxaca, Mexico (April 2010) - Yuichi Asahiro,
, Shuichi Miyazaki,__Eiji Miyano__. Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. Information Processing Letters, Vol.110, No.3, pp.93-98 (January 2010)__Takuro Yoshimuta__ - (Preliminary Version) Yuichi Asahiro,
, Shuichi Miyazaki,__Eiji Miyano__. 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)__Takuro Yoshimuta__ - Kazuo Iwama,
, Hirotaka Ono. Drawing Borders Efficiently. Theory of Computing Systems, Vol.44, No.2, pp.230-244 (February 2009)__Eiji Miyano__ - (Preliminary Version) Kazuo Iwama,
, 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)__Eiji Miyano__ - Naoyuki Kamiyama,
,__Yuuki Kiyonari__, 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)__Eiji Miyano__ - Yuichi Asahiro,
,__Eiji Miyano__. Grasp and Delivery for Moving Objects on Broken Lines. Theory of Computing Systems, Vol.42, No.3, pp.289-305 (April 2008)__Shinichi Shimoirisa__ - (Preliminary Version) Yuichi Asahiro,
,__Eiji Miyano__. 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)__Shinichi Shimoirisa__ - Yuichi Asahiro,
, Hirotaka Ono,__Eiji Miyano__. Graph Orientation Algorithms to Minimize the Maximum Outdegree. International Journal of Foundation of Computer Science, Vol.18, No.2, pp.197-216 (April 2007)__Kouhei Zenmyo__ - (Preliminary Version) Yuichi Asahiro,
, Hirotaka Ono,__Eiji Miyano__. 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)__Kouhei Zenmyo__ -
,__Yuuki Kiyonari__, 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)__Eiji Miyano__ - Takahiro Yukizane, Shin-ya Ohi,
, 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)__Eiji Miyano__ - Hideo Hirose, Takahiro Yukizane,
. Boundary detection for bumps using the Gini’s index in messy classification problems. Proc. 3rd International Conference on Cybernetics and Information Technologies, Systems and Applications, pp.293-297, Sheraton World Resort, Orlando, Florida, USA (July 2006)__Eiji Miyano__ - Yuichi Asahiro, Tetsuya Furukawa,
,__Keiichi Ikegami__. 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)__Eiji Miyano__ - Hideo Hirose, Takahiro Yukizane,
. 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)__Eiji Miyano__ - Yuichi Asahiro,
,__Eiji Miyano__. 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)__Shinichi Shimoirisa__ - Kazuo Iwama,
. An O(\sqrt{N}) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. Journal of Algorithms, Vol.41, pp.262-279 (2001)__Eiji Miyano__ - (Preliminary Version) Kazuo Iwama,
. 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)__Eiji Miyano__ - Kazuo Iwama,
. A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes__Eiji Miyano__

Journal of Algorithms, (2001) - (Preliminary Version) Kazuo Iwama,
. 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)__Eiji Miyano__ - Kazuo Iwama, Yahiko Kambayashi,
. New Bounds for Oblivious Mesh Routing__Eiji Miyano__

Journal of Graph Algorithms and Applications (2001) - Kazuo Iwama,
, Satoshi Tajima, Hisao Tamaki. Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theoretical Computer Science, (2001)__Eiji Miyano__ - Kazuo Iwama,
. 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)__Eiji Miyano__ - Kazuo Iwama,
. 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)__Eiji Miyano__ - Kazuo Iwama,
. Oblivious Routing Algorithms on the Mesh of Buses. Journal of Parallel and Distributed Computing, Vol.60, No.2, pp.137-149 (February, 2000)__Eiji Miyano__ - Kazuo Iwama,
. 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)__Eiji Miyano__ - (Preliminary Version) Kazuo Iwama, Yahiko Kambayashi,
. New Bounds for Oblivious Mesh Routing. Proc. Sixth Annual European Symposium on Algorithms (ESA’98), LNCS, pp.295-306, Venice, Italy (August, 1998)__Eiji Miyano__ - (Preliminary Version) Kazuo Iwama,
, 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)__Eiji Miyano__ - Kazuo Iwama,
. Better approximations of non-Hamiltonian graphs. Discrete Applied Mathematics 81, pp.239–261 (January, 1998)__Eiji Miyano__ - (Preliminary Version) Kazuo Iwama,
. Oblivious Routing Algorithms on the Mesh of Buses. Proc. 11th International Parallel Processing Symposium (IPPS’97), pp.721-727, Geneva, Switzerland (April 1997)__Eiji Miyano__ - Yuichi Asahiro, Kazuo Iwama,
. Random Generation of Test Instances with Controlled Attributes__Eiji Miyano__

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) - Kazuo Iwama,
, Yahiko Kambayashi. Routing Problems on the Mesh of Buses. Journal of Algorithms 20, pp.613-631 (1996)__Eiji Miyano__ - Kazuo Iwama,
. Intractability of Read-Once Resolution. Proc. Tenth IEEE Conference on Structure in Complexity Theory, pp.29-36, Minneapolis, USA (June 1995)__Eiji Miyano__ - Kazuo Iwama and
. Test-Case Generation with Known Answers and Proved Securities (preliminary Version) . Proc. Second DIMACS Challenge Workshop (Satisfiability), New Jersey, USA (October, 1993)__Eiji Miyano__ - Kazuo Iwama,
. Security of Test-Case Generation with Known Answers. Proc. AAAI Spring Symposium Series, pp.85-91, Stanford, USA (March 1993)__Eiji Miyano__ - Kazuo Iwama,
, Yahiko Kambayashi. Routing Problems on the Mesh of Buses (preliminary Version) . Proc. Third International Symposium on Algorithms and Computation (ISAAC’92), LNCS, pp.155-164, Nagoya (December, 1992)__Eiji Miyano__ - Kazuo Iwama, Hidetoshi Abeta,
. Random Generation of Satisfiable and Unsatisfiable CNF Predicates. Proc. the IFIP 12th World Computer Congress, Vol.1, pp.322-328, Madrid, Spain (September 1992)__Eiji Miyano__ - Kazuo Iwama,
, 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)__Eiji Miyano__

## Talks in International Workshops/Meetings

- Yuichi Asahiro, Guohui Lin,
__Zhilong Liu__,__Eiji Miyano__. On the Approximability of the Maximum Induced Matching Problem on Regular Graphs (one-page abstract). Proceedings of 12th Asian Association for Algorithms and Computation Annual Meeting (AAAC19), April 19-21, Department of Computer Science of Yonsei University, Seoul, South Korea (April 2019) -
__Eiji Miyano__. Efficient algorithm design for combinatorial optimization problems. Robotics and Computer Science, September 8, Steinman Hall of the Grove School of Engineering, the City College of New York, New York (September 2017) - Yuichi Asahiro,
__Eiji Miyano__,__Tsuyoshi Yagita__. Approximation algorithms for the minimum block transfer problem (one-page abstract). The 10th Asian Association for Algorithms and Computation Annual Meeting (AAAC17), May 5-7, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong (May 2017) -
__Hiroshi Eto__, Takehiro Ito,__Zhilong Liu__,__Eiji Miyano__. An improved approximation algorithm for the distance-3 independent set problem on cubic graphs (one-page abstract). The 10th Asian Association for Algorithms and Computation Annual Meeting (AAAC17), May 5-7, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong (May 2017) - 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) - 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) - 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) - 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) - 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) - 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) - 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) - Yuichi Asahiro, Hiroshi Eto,
__Eiji Miyano__. Improved Inapproximability 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) - 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) - 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) -
__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) - 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) - Yuichi Asahiro, Kenichi Kawahara,
__Eiji Miyano__. NP-Hardees 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) - 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) - 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 mostly in Japanese.