E-LIB Suche - Ergebnisse für: Lin, Guohui

1

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/..

2

An Approximation Algorithm for Covering Vertices by $$4^+$$..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Gong, Mingyang ; Chen, Zhi-Zhong ; Lin, Guohui. - p. 459-470 , 2023

Link: https://doi.org/10.1007/..

3

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/..

4

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/..

5

Improved Approximation Algorithms for Multiprocessor Schedu..:

, In: Frontiers of Algorithmics; Lecture Notes in Computer Science,

Gong, Mingyang ; Lin, Guohui - p. 65-77 , 2022

Link: https://doi.org/10.1007/..

6

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/..

7

Approximation Algorithms for the Directed Path Partition Pr..:

, In: Frontiers of Algorithmics; Lecture Notes in Computer Science,

Chen, Yong ; Chen, Zhi-Zhong ; Kennedy, Curtis... - p. 23-36 , 2022

Link: https://doi.org/10.1007/..

8

Parameterized Algorithms for the Happy Set Problem:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu... - p. 323-328 , 2020

Link: https://doi.org/10.1007/..

9

Improved Hardness and Approximation Results for Single Allo..:

, In: Algorithmic Aspects in Information and Management; Lecture Notes in Computer Science,

Wang, Xing ; Chen, Guangting ; Chen, Yong... - p. 85-96 , 2020

Link: https://doi.org/10.1007/..

10

Acyclic Edge Coloring Conjecture Is True on Planar Graphs W..:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,

Shu, Qiaojun ; Chen, Yong ; Han, Shuguang... - p. 426-438 , 2020

Link: https://doi.org/10.1007/..

11

Graph Classes and Approximability of the Happy Set Problem:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu... - p. 335-346 , 2020

Link: https://doi.org/10.1007/..

12

Approximation of Scheduling with Calibrations on Multiple M..:

, In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures,

Chen, Lin ; Li, Minming ; Lin, Guohui. - p. 237-239 , 2019

Link: https://dl.acm.org/doi/1..

13

Exact Algorithms for the Bounded Repetition Longest Common ..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Asahiro, Yuichi ; Jansson, Jesper ; Lin, Guohui... - p. 1-12 , 2019

Link: https://doi.org/10.1007/..

14

A Local Search 4/3-approximation Algorithm for the Minimum ..:

, In: Frontiers in Algorithmics; Lecture Notes in Computer Science,

Chen, Yong ; Goebel, Randy ; Lin, Guohui... - p. 14-25 , 2019

Link: https://doi.org/10.1007/..

15

A Randomized Approximation Algorithm for Metric Triangle Pa..:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Chen, Yong ; Chen, Zhi-Zhong ; Lin, Guohui.. - p. 119-129 , 2019

Link: https://doi.org/10.1007/..