E-LIB Suche - Ergebnisse für: Asahiro, Yuichi

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

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

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

Minimum Algorithm Sizes for Self-stabilizing Gathering and ..:

, In: Lecture Notes in Computer Science; Stabilization, Safety, and Security of Distributed Systems,

Asahiro, Yuichi ; Yamashita, Masafumi - p. 312-327 , 2023

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

5

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

6

Compatibility of Convergence Algorithms for Autonomous Mobi..:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Asahiro, Yuichi ; Yamashita, Masafumi - p. 149-164 , 2023

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

7

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

8

Monotonic self-stabilization and its application to robust ..:

Asahiro, Yuichi ; Suzuki, Ichiro ; Yamashita, Masafumi
Theoretical Computer Science. 934 (2022) - p. 21-46 , 2022

Link: https://doi.org/10.1016/..

9

Complexity and approximability of the happy set problem:

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu...
Theoretical Computer Science. 866 (2021) - p. 123-144 , 2021

Link: https://doi.org/10.1016/..

10

How to pack directed acyclic graphs into small blocks:

Asahiro, Yuichi ; Furukawa, Tetsuya ; Ikegami, Keiichi..
Discrete Applied Mathematics. 288 (2021) - p. 91-113 , 2021

Link: https://doi.org/10.1016/..

11

Parameterized algorithms for the Happy Set problem:

Asahiro, Yuichi ; Eto, Hiroshi ; Hanaka, Tesshu...
Discrete Applied Mathematics. 304 (2021) - p. 32-44 , 2021

Link: https://doi.org/10.1016/..

12

Exact algorithms for the repetition-bounded longest common ..:

Asahiro, Yuichi ; Jansson, Jesper ; Lin, Guohui...
Theoretical Computer Science. 838 (2020) - p. 238-249 , 2020

Link: https://doi.org/10.1016/..

13

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

14

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

15

Graph orientation with splits:

Asahiro, Yuichi ; Jansson, Jesper ; Miyano, Eiji..
Theoretical Computer Science. 844 (2020) - p. 16-25 , 2020

Link: https://doi.org/10.1016/..