Eiji Miyano - RankMe

113 papers A* 1A 4B 16C 14Misc 6Journal 53Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Approximability of Longest Run Subsequence and Complementary Minimization Problems. WABI Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka
2025	C	`conf`	Covering Vertices by 4 IWOCA Mingyang Gong, Guangting Chen, Guohui Lin, Eiji Miyano, Abbinash Ranjitkar
2025	—	`conf`	Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs. CIAC (2) Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano, Yudai Oka
2025	—	`conf`	Happy Vertex Game. CANDAR Hiroshi Eto, Akiko Fujimoto, Hironori Kiya, Ruka Matsushita, Eiji Miyano, Yuto Murao, Toshiki Saitoh
2025	B	`conf`	On the Complexity of Locally Rainbow Path. FCT Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida
2025	—	`conf`	Shortest Longest-Path Graph Orientations for Trees. SOFSEM (1) Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov
2024	J	`jnl`	A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. Mingyang Gong, Guohui Lin, Eiji Miyano, Bing Su, Weitian Tong
2024	J	`jnl`	Approximation Algorithms for Covering Vertices by Long Paths. Algorithmica Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano
2024	C	`conf`	Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir
2024	J	`jnl`	Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2023	B	`conf`	Approximation Algorithms for the Longest Run Subsequence Problem. CPM Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
2023	J	`jnl`	Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2023	J	`jnl`	Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
2023	C	`conf`	Independent Set Under a Change Constraint from an Initial Solution. CIAC Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue
2023	B	`conf`	On Computing a Center Persistence Diagram. FCT Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
2023	J	`jnl`	Path Cover Problems with Length Cost. Algorithmica Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
2023	—	`conf`	Shortest Longest-Path Graph Orientations. COCOON (1) Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov
2022	J	`jnl`	Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2022	B	`conf`	Approximation Algorithms for Covering Vertices by Long Paths. MFCS Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano
2022	J	`jnl`	Approximation algorithms for covering vertices by long paths. CoRR Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano
2022	B	`conf`	Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
2022	J	`jnl`	Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. J. Comb. Optim. Mingyang Gong, Randy Goebel, Guohui Lin, Eiji Miyano
2022	B	`conf`	Path Cover Problems with Length Cost. WALCOM Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
2022	B	`conf`	Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2022	J	`jnl`	Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2021	J	`jnl`	Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
2021	J	`jnl`	Complexity and approximability of the happy set problem. Theor. Comput. Sci. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2021	J	`jnl`	Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2021	J	`jnl`	How to pack directed acyclic graphs into small blocks. Discret. Appl. Math. Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita
2021	J	`jnl`	Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2020	C	`conf`	Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. TAMC Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
2020	J	`jnl`	Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. CoRR Qiaojun Shu, Guohui Lin, Eiji Miyano
2020	J	`jnl`	Complexity of the Maximum IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2020	J	`jnl`	Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2020	Misc	`conf`	Graph Classes and Approximability of the Happy Set Problem. COCOON Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2020	J	`jnl`	Graph orientation with splits. Theor. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
2020	B	`conf`	Parameterized Algorithms for the Happy Set Problem. WALCOM Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2019	J	`jnl`	An Approximation Algorithm for the Maximum Induced Matching Problem on IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano
2019	C	`conf`	Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
2019	J	`jnl`	Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems. Rev. Socionetwork Strateg. Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
2019	Misc	`conf`	Graph Orientation with Edge Modifications. FAW Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.
2019	J	`jnl`	On Computing a Center Persistence Diagram. CoRR Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
2018	J	`jnl`	An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theor. Comput. Sci. Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin
2018	—	`conf`	Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. ICCSA (2) Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita
2018	B	`conf`	Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2018	J	`jnl`	Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes. IEICE Trans. Inf. Syst. Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue
2018	C	`conf`	Graph Orientation with Splits. ISCO Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
2018	J	`jnl`	Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano
2018	J	`jnl`	Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. Algorithmica Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu
2017	B	`conf`	Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. WALCOM Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2016	Misc	`conf`	A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. FAW Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin
2016	C	`conf`	Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. COCOA Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2016	J	`jnl`	Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Daiki Hoshika, Eiji Miyano
2016	J	`jnl`	Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2016	—	`conf`	Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. SCIS&ISIS Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
2015	J	`jnl`	Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2015	C	`conf`	Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. COCOA Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu
2014	C	`conf`	Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. AAIM Daiki Hoshika, Eiji Miyano
2014	J	`jnl`	Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
2014	J	`jnl`	Distance- $$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. Hiroshi Eto, Fengrui Guo, Eiji Miyano
2014	—	`conf`	Evolutionary algorithms for the pursuit problem. SCIS&ISIS Eiji Miyano, Keisuke Tahara
2013	J	`jnl`	(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. J. Comb. Optim. Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
2013	B	`conf`	Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
2013	B	`conf`	Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2013	J	`jnl`	Inapproximability of Maximum IEICE Trans. Inf. Syst. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
2013	J	`jnl`	Optimal approximability of bookmark assignments. Discret. Appl. Math. Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
2012	C	`conf`	Distance-d Independent Set Problems for Bipartite and Chordal Graphs. COCOA Hiroshi Eto, Fengrui Guo, Eiji Miyano
2012	C	`conf`	Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2012	J	`jnl`	NP-hardness of the sorting buffer problem on the uniform metric. Discret. Appl. Math. Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
2012	J	`jnl`	Optimal distortion embedding of complete binary trees into lines. Inf. Process. Lett. Masao Kumamoto, Eiji Miyano
2012	—	`conf`	Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2011	Misc	`conf`	(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. COCOON Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
2011	J	`jnl`	Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2011	J	`jnl`	Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Eiji Miyano
2011	J	`jnl`	Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2011	J	`jnl`	Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
2011	—	`conf`	Maximum Domination Problem. CATS Eiji Miyano, Hirotaka Ono
2010	B	`conf`	Approximating Maximum Diameter-Bounded Subgraphs. LATIN Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo
2010	—	`conf`	Optimal Distortion Embedding of Complete Binary Trees into Lines. FCS Masao Kumamoto, Eiji Miyano
2010	J	`jnl`	Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
2009	J	`jnl`	Computational Complexities of University Interview Timetabling. IEICE Trans. Inf. Syst. Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka
2009	J	`jnl`	Drawing Borders Efficiently. Theory Comput. Syst. Kazuo Iwama, Eiji Miyano, Hirotaka Ono
2009	A	`conf`	Graph orientation to maximize the minimum weighted outdegree. IPDPS Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
2008	—	`conf`	Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
2008	J	`jnl`	Grasp and Delivery for Moving Objects on Broken Lines. Theory Comput. Syst. Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
2008	—	`conf`	NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. FCS Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
2007	C	`conf`	Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2007	Misc	`conf`	Drawing Borders Efficiently. FUN Kazuo Iwama, Eiji Miyano, Hirotaka Ono
2007	J	`jnl`	Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2007	B	`conf`	On Approximation of Bookmark Assignments. MFCS Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
2007	—	`conf`	Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
2006	—	`conf`	Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
2006	C	`conf`	How to Pack Directed Acyclic Graphs into Small Blocks. CIAC Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
2006	J	`jnl`	The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics. IEICE Trans. Inf. Syst. Takahiro Yukizane, Shin-ya Ohi, Eiji Miyano, Hideo Hirose
2005	—	`conf`	Pickup and Delivery for Moving Objects on Broken Lines. ICTCS Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
2001	J	`jnl`	A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. J. Algorithms Kazuo Iwama, Eiji Miyano
2001	J	`jnl`	An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms Kazuo Iwama, Eiji Miyano
2001	J	`jnl`	Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theor. Comput. Sci. Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
2001	J	`jnl`	New Bounds for Oblivious Mesh Routing. J. Graph Algorithms Appl. Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
2000	B	`conf`	A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. SPAA Kazuo Iwama, Eiji Miyano
2000	J	`jnl`	Oblivious Routing Algorithms on the Mesh of Buses. J. Parallel Distributed Comput. Kazuo Iwama, Eiji Miyano
1999	A*	`conf`	An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. SODA Kazuo Iwama, Eiji Miyano
1999	A	`conf`	Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. ESA Kazuo Iwama, Eiji Miyano
1998	J	`jnl`	Better Approximations of Non-Hamiltonian Graphs. Discret. Appl. Math. Kazuo Iwama, Eiji Miyano
1998	Misc	`conf`	Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
1998	A	`conf`	New Bounds for Oblivious Mesh Routing. ESA Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
1997	—	`conf`	Oblivious Routing Algorithms on the Mesh of Buses. IPPS Kazuo Iwama, Eiji Miyano
1997	A	`conf`	Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. ESA Kazuo Iwama, Eiji Miyano
1996	J	`jnl`	Routing Problems on the Mesh of Buses. J. Algorithms Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi
1995	—	`conf`	Intractability of Read-Once Resolution. SCT Kazuo Iwama, Eiji Miyano
1993	—	`conf`	Random generation of test instances with controlled attributes. Cliques, Coloring, and Satisfiability Yuichi Asahiro, Kazuo Iwama, Eiji Miyano
1992	—	`conf`	Random Generation of Satisfiable and Unsatisfiable CNF Predicates. IFIP Congress (1) Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano
1992	B	`conf`	Routing Problems on the Mesh of Buses. ISAAC Kazuo Iwama, Eiji Miyano