Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
MIYANO, Eiji
105  Ergebnisse:
Personensuche X
?
1

Polynomial-time equivalences and refined algorithms for lon..:

Asahiro, Yuichi ; Jansson, Jesper ; Lin, Guohui...
Discrete Applied Mathematics.  353 (2024)  - p. 44-64 , 2024
Link: https://doi.org/10.1016/..
 
?
2

A polynomial-time approximation scheme for an arbitrary num..:

Gong, Mingyang ; Lin, Guohui ; Miyano, Eiji..
Annals of Operations Research.  335 (2024)  1 - p. 185-204 , 2024
Link: https://doi.org/10.1007/..
 
?
3

Approximation Algorithms for Covering Vertices by Long Path:

Gong, Mingyang ; Edgar, Brett ; Fan, Jing..
Algorithmica.  , 2024
Link: https://doi.org/10.1007/..
 
?
4

Directed Path Partition Problem on Directed Acyclic Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Eto, Hiroshi ; Kawaharada, Shunsuke ; Lin, Guohui.. - p. 314-326 , 2024
Link: https://doi.org/10.1007/..
 
?
5

Shortest Longest-Path Graph Orientations:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Asahiro, Yuichi ; Jansson, Jesper ; Melkman, Avraham A.... - p. 141-154 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Path Cover Problems with Length Cost:

Kobayashi, Kenya ; Lin, Guohui ; Miyano, Eiji...
Algorithmica.  85 (2023)  11 - p. 3348-3375 , 2023
Link: https://doi.org/10.1007/..
 
?
7

Independent Set Under a Change Constraint from an Initial S..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Asahiro, Yuichi ; Eto, Hiroshi ; Korenaga, Kana... - p. 37-51 , 2023
Link: https://doi.org/10.1007/..
 
?
8

Corrigendum to "Complexity and approximability of the happy..:

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu...
Theoretical Computer Science.  975 (2023)  - p. 114114 , 2023
Link: https://doi.org/10.1016/..
 
?
9

On Computing a Center Persistence Diagram:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
Higashikawa, Yuya ; Katoh, Naoki ; Lin, Guohui... - p. 262-275 , 2023
Link: https://doi.org/10.1007/..
 
?
10

Path Cover Problems with Length Cost:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Kobayashi, Kenya ; Lin, Guohui ; Miyano, Eiji... - p. 396-408 , 2022
Link: https://doi.org/10.1007/..
 
?
11

Happy Set Problem on Subclasses of Co-comparability Graphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Eto, Hiroshi ; Ito, Takehiro ; Miyano, Eiji.. - p. 149-160 , 2022
Link: https://doi.org/10.1007/..
 
?
12

Happy Set Problem on Subclasses of Co-comparability Graphs:

Eto, Hiroshi ; Ito, Takehiro ; Miyano, Eiji..
Algorithmica.  85 (2022)  11 - p. 3327-3347 , 2022
Link: https://doi.org/10.1007/..
 
?
13

Improved approximation algorithms for non-preemptive multip..:

Gong, Mingyang ; Goebel, Randy ; Lin, Guohui.
Journal of Combinatorial Optimization.  44 (2022)  1 - p. 877-893 , 2022
Link: https://doi.org/10.1007/..
 
?
14

Approximability of the Distance Independent Set Problem on ..:

ETO, Hiroshi ; ITO, Takehiro ; LIU, Zhilong.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.  E105.A (2022)  9 - p. 1211-1222 , 2022
Link: https://doi.org/10.1587/..
 
?
15

Upper and lower degree-constrained graph orientation with m..:

Asahiro, Yuichi ; Jansson, Jesper ; Miyano, Eiji.
Theoretical Computer Science.  900 (2022)  - p. 53-78 , 2022
Link: https://doi.org/10.1016/..
 
1-15