Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs

von Hanaka, Tesshu
Veröffentlicht in Annual International Conference on Combinatorial Optimization and Applications (16. : 2023 : Honolulu, Hawaii) Combinatorial optimization and applications ; Part 1 (2024)

An Optimal Algorithm for BISECTION for Bounded-Treewidth Graph

von Hanaka, Tesshu
Veröffentlicht in FAW (14. : 2020 : Online) Frontiers in algorithmics (2020)

Computing L(p, 1)-Labeling with Combined Parameters

von Hanaka, Tesshu
Veröffentlicht in WALCOM (15. : 2021 : Online) WALCOM: algorithms and computation (2021)

Finding environmentally critical transmission sectors, transactions, and paths in global supply chain networks

von Hanaka, Tesshu
Veröffentlicht in Energy economics (2017)

Winner Determination Algorithms for Graph Games with Matching Structures

von Yoshiwatari, Kanae
Veröffentlicht in IWOCA (33. : 2022 : Trier) Combinatorial algorithms (2022)

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium

von Fukuzono, Naoka
Veröffentlicht in SOFSEM (46. : 2020 : Limassol) SOFSEM 2020 (2020)

Faster Winner Determination Algorithms for (Colored) Arc Kayles

von Hanaka, Tesshu
Veröffentlicht in SOFSEM (49. : 2024 : Cochem) SOFSEM 2024: theory and practice of computer science (2024)

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

von Gima, Tatsuya
Veröffentlicht in CIAC (12. : 2021 : Online) Algorithms and Complexity (2021)

Structural Parameterizations of Vertex Integrity

von Gima, Tatsuya
Veröffentlicht in International Conference and Workshops on Algorithms and Computation (18. : 2024 : Kanazawa) WALCOM: algorithms and computation (2024)

Parameterized Algorithms for the Happy Set Problem

von Asahiro, Yuichi
Veröffentlicht in WALCOM (14. : 2020 : Singapur) WALCOM: algorithms and computation (2020)

Graph Classes and Approximabihty of the Happy Set Problem

von Asahiro, Yuichi
Veröffentlicht in COCOON (26. : 2020 : Online) Computing and combinatorics (2020)

HEDONIC SEAT ARRANGEMENT PROBLEMS

von Bodlaender, Hans L.
Veröffentlicht in AAMAS (19. : 2020 : Online) International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020) ; Volume 3 of 3 (2021)

On the Complexity of List H-Packing for Sparse Graph Classes

von Gima, Tatsuya
Veröffentlicht in International Conference and Workshops on Algorithms and Computation (18. : 2024 : Kanazawa) WALCOM: algorithms and computation (2024)

Parameterized Complexity of (A,ℓ) -Path Packing

von Belmonte, Rémy
Veröffentlicht in IWOCA (31. : 2020 : Online) Combinatorial algorithms (2020)