Random Generation of Satisfiable and Unsatisfiable CNF Predicates. - Kazuo Iwama; Hidetoshi Abeta; Eiji Miyano (IFIP Congress (1), 1992)

Routing Problems on the Mesh of Buses. - Kazuo Iwama; Eiji Miyano (ISAAC, 1992)

Random generation of test instances with controlled attributes. - Yuichi Asahiro; Kazuo Iwama; Eiji Miyano (Cliques, Coloring, and Satisfiability, 1993)

Intractability of Read-Once Resolution. - Kazuo Iwama; Eiji Miyano (SCT, 1995)

Routing Problems on the Mesh of Buses. - Kazuo Iwama; Eiji Miyano; Yahiko Kambayashi (J. Algorithms, 1996)

Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. - Kazuo Iwama; Eiji Miyano (ESA, 1997)

Better Approximations of Non-Hamiltonian Graphs. - Kazuo Iwama; Eiji Miyano (Discret. Appl. Math., 1998)

Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. - Kazuo Iwama; Eiji Miyano (ESA, 1999)

An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. - Kazuo Iwama; Eiji Miyano (SODA, 1999)

A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. - Kazuo Iwama; Eiji Miyano (SPAA, 2000)

Oblivious Routing Algorithms on the Mesh of Buses. - Kazuo Iwama; Eiji Miyano (J. Parallel Distributed Comput., 2000)

A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. - Kazuo Iwama; Eiji Miyano (J. Algorithms, 2001)

An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. - Kazuo Iwama; Eiji Miyano (J. Algorithms, 2001)

New Bounds for Oblivious Mesh Routing. - Kazuo Iwama; Yahiko Kambayashi; Eiji Miyano (J. Graph Algorithms Appl., 2001)

Efficient randomized routing algorithms on the two-dimensional mesh of buses. - Kazuo Iwama; Eiji Miyano; Satoshi Tajima; Hisao Tamaki (Theor. Comput. Sci., 2001)

Pickup and Delivery for Moving Objects on Broken Lines. - Yuichi Asahiro; Eiji Miyano; Shinichi Shimoirisa (ICTCS, 2005)

How to Pack Directed Acyclic Graphs into Small Blocks. - Yuichi Asahiro; Tetsuya Furukawa; Keiichi Ikegami; Eiji Miyano (CIAC, 2006)

The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics. - Takahiro Yukizane; Shin-ya Ohi; Eiji Miyano; Hideo Hirose (IEICE Trans. Inf. Syst., 2006)

On Approximation of Bookmark Assignments. - Yuichi Asahiro; Eiji Miyano; Toshihide Murata; Hirotaka Ono 001 (MFCS, 2007)

Graph Orientation Algorithms to minimize the Maximum Outdegree. - Yuichi Asahiro; Eiji Miyano; Hirotaka Ono 001; Kouhei Zenmyo (Int. J. Found. Comput. Sci., 2007)

Grasp and Delivery for Moving Objects on Broken Lines. - Yuichi Asahiro; Eiji Miyano; Shinichi Shimoirisa (Theory Comput. Syst., 2008)

Computational Complexities of University Interview Timetabling. - Naoyuki Kamiyama; Yuuki Kiyonari; Eiji Miyano; Shuichi Miyazaki; Katsuhisa Yamanaka (IEICE Trans. Inf. Syst., 2009)

Drawing Borders Efficiently. - Kazuo Iwama; Eiji Miyano; Hirotaka Ono 001 (Theory Comput. Syst., 2009)

Approximating Maximum Diameter-Bounded Subgraphs. - Yuichi Asahiro; Eiji Miyano; Kazuaki Samizo (LATIN, 2010)

Weighted nearest neighbor algorithms for the graph exploration problem on cycles. - Yuichi Asahiro; Eiji Miyano; Shuichi Miyazaki; Takuro Yoshimuta (Inf. Process. Lett., 2010)

Maximum Domination Problem. - Eiji Miyano; Hirotaka Ono 001 (CATS, 2011)

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. - Yuichi Asahiro; Eiji Miyano; Hirotaka Ono 001 (Discret. Appl. Math., 2011)

Foreword. - Eiji Miyano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Graph Orientation to Maximize the Minimum Weighted Outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2011)

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Kouhei Zenmyo (J. Comb. Optim., 2011)

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (CATS, 2012)

NP-hardness of the sorting buffer problem on the uniform metric. - Yuichi Asahiro; Kenichi Kawahara; Eiji Miyano (Discret. Appl. Math., 2012)

Optimal distortion embedding of complete binary trees into lines. - Masao Kumamoto; Eiji Miyano (Inf. Process. Lett., 2012)

Optimal approximability of bookmark assignments. - Yuichi Asahiro; Eiji Miyano; Toshihide Murata; Hirotaka Ono 001 (Discret. Appl. Math., 2013)

Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. - Yuichi Asahiro; Hiroshi Eto; Eiji Miyano (IEICE Trans. Inf. Syst., 2013)

(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. - Yuichi Asahiro; Kenta Kanmera; Eiji Miyano (J. Comb. Optim., 2013)

Evolutionary algorithms for the pursuit problem. - Eiji Miyano; Keisuke Tahara (SCIS&ISIS, 2014)

Distance- $$d$$ independent set problems for bipartite and chordal graphs. - Hiroshi Eto; Fengrui Guo; Eiji Miyano (J. Comb. Optim., 2014)

Complexity of finding maximum regular induced subgraphs with prescribed degree. - Yuichi Asahiro; Hiroshi Eto; Takehiro Ito; Eiji Miyano (Theor. Comput. Sci., 2014)

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Yuya Doi; Eiji Miyano; Hirotaka Shimizu (COCOA, 2015)

Graph Orientations Optimizing the Number of Light or Heavy Vertices. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (J. Graph Algorithms Appl., 2015)

A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. - Weitian Tong; Eiji Miyano; Randy Goebel; Guohui Lin (FAW, 2016)

Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Tomohiro Kubo; Eiji Miyano (SCIS&ISIS, 2016)

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. - Daiki Hoshika; Eiji Miyano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theory Comput. Syst., 2016)

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. - Hiroshi Eto; Takehiro Ito; Zhilong Liu; Eiji Miyano (WALCOM, 2017)

Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. - Yuichi Asahiro; Eiji Miyano; Tsuyoshi Yagita (ICCSA (2), 2018)

Complexity of the Maximum k-Path Vertex Cover Problem. - Eiji Miyano; Toshiki Saitoh; Ryuhei Uehara; Tsuyoshi Yagita; Tom C. van der Zanden (WALCOM, 2018)

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Yuya Doi; Eiji Miyano; Kazuaki Samizo; Hirotaka Shimizu (Algorithmica, 2018)

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. - Peng Zhang 008; Yao Xu; Tao Jiang 001; Angsheng Li; Guohui Lin; Eiji Miyano (Algorithmica, 2018)

Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes. - Hiroshi Eto; Hiroyuki Kawahara; Eiji Miyano; Natsuki Nonoue (IEICE Trans. Inf. Syst., 2018)

An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. - Weitian Tong; Eiji Miyano; Randy Goebel; Guohui Lin (Theor. Comput. Sci., 2018)

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (COCOA, 2019)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Sandhya T. P. 001 (FAW, 2019)

An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs. - Yuichi Asahiro; Guohui Lin; Zhilong Liu; Eiji Miyano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems. - Yuichi Asahiro; Tomohiro Kubo; Eiji Miyano (Rev. Socionetwork Strateg., 2019)

Graph Classes and Approximability of the Happy Set Problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (COCOON, 2020)

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. - Qiaojun Shu; Guohui Lin; Eiji Miyano (CoRR, 2020)

Complexity of the Maximum k-Path Vertex Cover Problem. - Eiji Miyano; Toshiki Saitoh; Ryuhei Uehara; Tsuyoshi Yagita; Tom C. van der Zanden (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Exact algorithms for the repetition-bounded longest common subsequence problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Theor. Comput. Sci., 2020)

Graph orientation with splits. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hesam Nikpey; Hirotaka Ono 001 (Theor. Comput. Sci., 2020)

Parameterized algorithms for the Happy Set problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Discret. Appl. Math., 2021)

How to pack directed acyclic graphs into small blocks. - Yuichi Asahiro; Tetsuya Furukawa; Keiichi Ikegami; Eiji Miyano; Tsuyoshi Yagita (Discret. Appl. Math., 2021)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2021)

Complexity and approximability of the happy set problem. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Theor. Comput. Sci., 2021)

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. - Qiaojun Shu; Yong Chen 002; Shuguang Han; Guohui Lin; Eiji Miyano; An Zhang 001 (Theor. Comput. Sci., 2021)

Approximation Algorithms for Covering Vertices by Long Paths. - Mingyang Gong; Jing Fan; Guohui Lin; Eiji Miyano (MFCS, 2022)

Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. - Mingyang Gong; Randy Goebel; Guohui Lin; Eiji Miyano (J. Comb. Optim., 2022)

Upper and lower degree-constrained graph orientation with minimum penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theor. Comput. Sci., 2022)

Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. - Hiroshi Eto; Takehiro Ito; Zhilong Liu; Eiji Miyano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Independent Set Under a Change Constraint from an Initial Solution. - Yuichi Asahiro; Hiroshi Eto; Kana Korenaga; Guohui Lin; Eiji Miyano; Reo Nonoue (CIAC, 2023)

Shortest Longest-Path Graph Orientations. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Shay Zakov (COCOON (1), 2023)

Approximation Algorithms for the Longest Run Subsequence Problem. - Yuichi Asahiro; Hiroshi Eto; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Shunichi Tanaka (CPM, 2023)

On Computing a Center Persistence Diagram. - Yuya Higashikawa; Naoki Katoh; Guohui Lin; Eiji Miyano; Suguru Tamaki; Junichi Teruyama; Binhai Zhu (FCT, 2023)

Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. - Yuichi Asahiro; Hiroshi Eto; Tesshu Hanaka; Guohui Lin; Eiji Miyano; Ippei Terabaru (Theor. Comput. Sci., 2023)

Happy Set Problem on Subclasses of Co-comparability Graphs. - Hiroshi Eto; Takehiro Ito; Eiji Miyano; Akira Suzuki 001; Yuma Tamura (Algorithmica, 2023)

Path Cover Problems with Length Cost. - Kenya Kobayashi; Guohui Lin; Eiji Miyano; Toshiki Saitoh; Akira Suzuki 001; Tadatoshi Utashima; Tsuyoshi Yagita (Algorithmica, 2023)

Directed Path Partition Problem on Directed Acyclic Graphs. - Hiroshi Eto; Shunsuke Kawaharada; Guohui Lin; Eiji Miyano; Tugce Ozdemir (IWOCA, 2024)

Polynomial-time equivalences and refined algorithms for longest common subsequence variants. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Discret. Appl. Math., 2024)

A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. - Mingyang Gong; Guohui Lin; Eiji Miyano; Bing Su 002; Weitian Tong (Ann. Oper. Res., 2024)

Approximation Algorithms for Covering Vertices by Long Paths. - Mingyang Gong; Brett Edgar; Jing Fan; Guohui Lin; Eiji Miyano (Algorithmica, 2024)

Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs. - Yuichi Asahiro; Hiroshi Eto; Guohui Lin; Eiji Miyano; Yudai Oka (CIAC (2), 2025)

Covering Vertices by 4+-Paths: A Simpler Local Search Coupled with a More Delicate Amortization. - Mingyang Gong; Guangting Chen; Guohui Lin; Eiji Miyano; Abbinash Ranjitkar (IWOCA, 2025)

Shortest Longest-Path Graph Orientations for Trees. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Yoshichika Yano; Shay Zakov (SOFSEM (1), 2025)

Approximability of Longest Run Subsequence and Complementary Minimization Problems. - Yuichi Asahiro; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Sichen Lu; Eiji Miyano; Hirotaka Ono 001; Toshiki Saitoh; Shunichi Tanaka (WABI, 2025)