default search action
Eiji Miyano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j50]Mingyang Gong
, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation Algorithms for Covering Vertices by Long Paths. Algorithmica 86(8): 2625-2651 (2024) - [j49]Mingyang Gong
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. 335(1): 185-204 (2024) - [j48]Yuichi Asahiro, Jesper Jansson
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. 353: 44-64 (2024) - [c54]Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir:
Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA 2024: 314-326 - 2023
- [j47]Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85(11): 3327-3347 (2023) - [j46]Kenya Kobayashi, Guohui Lin
Path Cover Problems with Length Cost. Algorithmica 85(11): 3348-3375 (2023) - [j45]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. 975: 114114 (2023) - [c53]Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue:
Independent Set Under a Change Constraint from an Initial Solution. CIAC 2023: 37-51 - [c52]Yuichi Asahiro, Jesper Jansson
Shortest Longest-Path Graph Orientations. COCOON (1) 2023: 141-154 - [c51]Yuichi Asahiro, Hiroshi Eto, Mingyang Gong
Approximation Algorithms for the Longest Run Subsequence Problem. CPM 2023: 2:1-2:12 - [c50]Yuya Higashikawa, Naoki Katoh, Guohui Lin
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - 2022
- [j44]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano:
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1211-1222 (2022) - [j43]Mingyang Gong
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. J. Comb. Optim. 44(1): 877-893 (2022) - [j42]Yuichi Asahiro, Jesper Jansson
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900: 53-78 (2022) - [c49]Yuichi Asahiro, Jesper Jansson
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM 2022: 15:1-15:17 - [c48]Mingyang Gong
Approximation Algorithms for Covering Vertices by Long Paths. MFCS 2022: 53:1-53:14 - [c47]Hiroshi Eto, Takehiro Ito, Eiji Miyano
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM 2022: 149-160 - [c46]Kenya Kobayashi, Guohui Lin, Eiji Miyano
Path Cover Problems with Length Cost. WALCOM 2022: 396-408 - [i3]Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation algorithms for covering vertices by long paths. CoRR abs/2208.03294 (2022) - 2021
- [j41]Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
How to pack directed acyclic graphs into small blocks. Discret. Appl. Math. 288: 91-113 (2021) - [j40]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304: 32-44 (2021) - [j39]Yuichi Asahiro
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32(2): 209-233 (2021) - [j38]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866: 123-144 (2021) - [j37]Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. 882: 77-108 (2021) - 2020
- [j36]Eiji Miyano
Complexity of the Maximum k-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1193-1201 (2020) - [j35]Yuichi Asahiro, Jesper Jansson
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838: 238-249 (2020) - [j34]Yuichi Asahiro, Jesper Jansson
Graph orientation with splits. Theor. Comput. Sci. 844: 16-25 (2020) - [c45]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano
Graph Classes and Approximability of the Happy Set Problem. COCOON 2020: 335-346 - [c44]Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. TAMC 2020: 426-438 - [c43]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka
Parameterized Algorithms for the Happy Set Problem. WALCOM 2020: 323-328 - [i2]Qiaojun Shu, Guohui Lin, Eiji Miyano:
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. CoRR abs/2005.06152 (2020)
2010 – 2019
- 2019
- [j33]Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano
An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1142-1149 (2019) - [j32]Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano:
Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems. Rev. Socionetwork Strateg. 13(2): 143-161 (2019) - [c42]Yuichi Asahiro, Jesper Jansson
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA 2019: 1-12 - [c41]Yuichi Asahiro, Jesper Jansson
Graph Orientation with Edge Modifications. FAW 2019: 38-50 - [i1]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. CoRR abs/1910.01753 (2019) - 2018
- [j31]Peng Zhang, Yao Xu
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica 80(5): 1412-1438 (2018) - [j30]Yuichi Asahiro, Yuya Doi, Eiji Miyano
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. Algorithmica 80(6): 1834-1856 (2018) - [j29]Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes. IEICE Trans. Inf. Syst. 101-D(3): 574-581 (2018) - [j28]Weitian Tong
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theor. Comput. Sci. 734: 24-31 (2018) - [c40]Yuichi Asahiro, Eiji Miyano
Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. ICCSA (2) 2018: 607-623 - [c39]Yuichi Asahiro, Jesper Jansson
Graph Orientation with Splits. ISCO 2018: 52-63 - [c38]Eiji Miyano
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM 2018: 240-251 - 2017
- [c37]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. WALCOM 2017: 228-240 - 2016
- [j27]Daiki Hoshika, Eiji Miyano
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1059-1066 (2016) - [j26]Yuichi Asahiro, Jesper Jansson
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58(1): 60-93 (2016) - [c36]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. COCOA 2016: 270-284 - [c35]Weitian Tong
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. FAW 2016: 227-237 - [c34]Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. SCIS&ISIS 2016: 892-897 - 2015
- [j25]Yuichi Asahiro, Jesper Jansson
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19(1): 441-465 (2015) - [c33]Yuichi Asahiro, Yuya Doi, Eiji Miyano
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. COCOA 2015: 586-600 - 2014
- [j24]Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance- $$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. 27(1): 88-99 (2014) - [j23]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. 550: 21-35 (2014) - [c32]Daiki Hoshika, Eiji Miyano
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. AAIM 2014: 100-111 - [c31]Eiji Miyano
Evolutionary algorithms for the pursuit problem. SCIS&ISIS 2014: 1321-1326 - 2013
- [j22]Yuichi Asahiro, Eiji Miyano
Optimal approximability of bookmark assignments. Discret. Appl. Math. 161(16-17): 2361-2366 (2013) - [j21]Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. IEICE Trans. Inf. Syst. 96-D(3): 443-449 (2013) - [j20]Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. J. Comb. Optim. 26(4): 687-708 (2013) - [c30]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT 2013: 28-39 - [c29]Yuichi Asahiro, Jesper Jansson
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA 2013: 24-36 - 2012
- [j19]Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
NP-hardness of the sorting buffer problem on the uniform metric. Discret. Appl. Math. 160(10-11): 1453-1464 (2012) - [j18]Masao Kumamoto, Eiji Miyano
Optimal distortion embedding of complete binary trees into lines. Inf. Process. Lett. 112(10): 365-370 (2012) - [c28]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS 2012: 139-146 - [c27]Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance-d Independent Set Problems for Bipartite and Chordal Graphs. COCOA 2012: 234-244 - [c26]Yuichi Asahiro, Jesper Jansson
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO 2012: 332-343 - 2011
- [j17]Yuichi Asahiro, Eiji Miyano
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. 159(7): 498-508 (2011) - [j16]Eiji Miyano
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1221 (2011) - [j15]Yuichi Asahiro, Jesper Jansson
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22(3): 583-601 (2011) - [j14]Yuichi Asahiro, Jesper Jansson
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1): 78-96 (2011) - [c25]Eiji Miyano, Hirotaka Ono:
Maximum Domination Problem. CATS 2011: 55-62 - [c24]Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. COCOON 2011: 259-270 - 2010
- [j13]Yuichi Asahiro, Eiji Miyano
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. 110(3): 93-98 (2010) - [c23]Masao Kumamoto, Eiji Miyano:
Optimal Distortion Embedding of Complete Binary Trees into Lines. FCS 2010: 16-21 - [c22]Yuichi Asahiro, Eiji Miyano
Approximating Maximum Diameter-Bounded Subgraphs. LATIN 2010: 615-626
2000 – 2009
- 2009
- [j12]Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano
Computational Complexities of University Interview Timetabling. IEICE Trans. Inf. Syst. 92-D(2): 130-140 (2009) - [j11]Kazuo Iwama, Eiji Miyano
Drawing Borders Efficiently. Theory Comput. Syst. 44(2): 230-244 (2009) - [c21]Yuichi Asahiro, Jesper Jansson, Eiji Miyano
Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 - 2008
- [j10]Yuichi Asahiro, Eiji Miyano
Grasp and Delivery for Moving Objects on Broken Lines. Theory Comput. Syst. 42(3): 289-305 (2008) - [c20]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono:
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS 2008: 97-106 - [c19]Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano:
NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. FCS 2008: 137-143 - 2007
- [j9]Yuichi Asahiro, Eiji Miyano
Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. 18(2): 197-215 (2007) - [c18]Yuichi Asahiro, Jesper Jansson
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM 2007: 167-177 - [c17]Kazuo Iwama, Eiji Miyano
Drawing Borders Efficiently. FUN 2007: 213-226 - [c16]Yuichi Asahiro, Eiji Miyano
On Approximation of Bookmark Assignments. MFCS 2007: 115-124 - [c15]Yuichi Asahiro, Eiji Miyano
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) 2007: 164-175 - 2006
- [j8]Takahiro Yukizane, Shin-ya Ohi, Eiji Miyano
The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics. IEICE Trans. Inf. Syst. 89-D(8): 2332-2339 (2006) - [c14]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20 - [c13]Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
How to Pack Directed Acyclic Graphs into Small Blocks. CIAC 2006: 272-283 - 2005
- [c12]Yuichi Asahiro, Eiji Miyano
Pickup and Delivery for Moving Objects on Broken Lines. ICTCS 2005: 36-50 - 2001
- [j7]Kazuo Iwama, Eiji Miyano
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. J. Algorithms 39(2): 145-161 (2001) - [j6]Kazuo Iwama, Eiji Miyano
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms 41(2): 262-279 (2001) - [j5]Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
New Bounds for Oblivious Mesh Routing. J. Graph Algorithms Appl. 5(5): 17-38 (2001) - [j4]Kazuo Iwama, Eiji Miyano
Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theor. Comput. Sci. 261(2): 227-239 (2001) - 2000
- [j3]Kazuo Iwama, Eiji Miyano
Oblivious Routing Algorithms on the Mesh of Buses. J. Parallel Distributed Comput. 60(2): 137-149 (2000) - [c11]Kazuo Iwama, Eiji Miyano:
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. SPAA 2000: 186-195
1990 – 1999
- 1999
- [c10]Kazuo Iwama, Eiji Miyano
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. ESA 1999: 53-64 - [c9]Kazuo Iwama, Eiji Miyano:
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. SODA 1999: 466-475 - 1998
- [j2]Kazuo Iwama, Eiji Miyano
Better Approximations of Non-Hamiltonian Graphs. Discret. Appl. Math. 81(1-3): 239-261 (1998) - [c8]Kazuo Iwama, Eiji Miyano
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON 1998: 229-240 - [c7]Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
New Bounds for Oblivious Mesh Routing. ESA 1998: 295-306 - 1997
- [c6]Kazuo Iwama, Eiji Miyano
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. ESA 1997: 284-295 - [c5]Kazuo Iwama, Eiji Miyano:
Oblivious Routing Algorithms on the Mesh of Buses. IPPS 1997: 721-727 - 1996
- [j1]Kazuo Iwama, Eiji Miyano
Routing Problems on the Mesh of Buses. J. Algorithms 20(3): 613-631 (1996) - 1995
- [c4]Kazuo Iwama, Eiji Miyano:
Intractability of Read-Once Resolution. SCT 1995: 29-36 - 1993
- [c3]Yuichi Asahiro, Kazuo Iwama, Eiji Miyano:
Random generation of test instances with controlled attributes. Cliques, Coloring, and Satisfiability 1993: 377-393 - 1992
- [c2]Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano:
Random Generation of Satisfiable and Unsatisfiable CNF Predicates. IFIP Congress (1) 1992: 322-328 - [c1]Kazuo Iwama, Eiji Miyano
Routing Problems on the Mesh of Buses. ISAAC 1992: 155-164
Coauthor Index
[j48] [j45] [c53] [c52] [c51] [j42] [c49] [j41] [j40] [j39] [j38] [j35] [j34] [c45] [c43] [j33] [j32] [c42] [c41] [j30] [c40] [c39] [j26] [c34] [j25] [c33] [j23] [j22] [j21] [j20] [c30] [c29] [j19] [c28] [c26] [j17] [j15] [j14] [c24] [j13] [c22] [c21] [j10] [c20] [c19] [j9] [c18] [c16] [c15] [c14] [c13] [c12] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: