E-LIB Suche - Ergebnisse für: Katoh, Naoki

1

Lower Bounds for the Thickness and the Total Number of Edge..:

KAWAKAMI, Yuki ; TAKAHASHI, Shun ; SETO, Kazuhisa...
IEICE Transactions on Information and Systems. E107.D (2024) 6 - p. 732-740 , 2024

Link: https://doi.org/10.1587/..

2

Red-Black Spanners for Mixed-Charging Vehicular Networks:

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

Bereg, Sergey ; Higashikawa, Yuya ; Katoh, Naoki... - p. 220-231 , 2023

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

3

Faster Algorithms for Evacuation Problems in Networks with ..:

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

Higashikawa, Yuya ; Katoh, Naoki ; Teruyama, Junichi. - p. 29-42 , 2023

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

4

The Line-Constrained Maximum Coverage Facility Location Pro..:

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

Maegawa, Hiroki ; Katoh, Naoki ; Tokuni, Yuki. - p. 406-418 , 2023

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

5

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

6

Sublinear Computation Paradigm: Algorithmic Revolution in t..:

Katoh, Naoki ; Higashikawa, Yuya ; Ito, Hiro... - 1st ed. 2022 . , 2022

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

7

Improving Upper and Lower Bounds for the Total Number of Ed..:

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

Kobayashi, Yuki ; Higashikawa, Yuya ; Katoh, Naoki - p. 244-256 , 2021

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

8

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path..:

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

Fujie, Tetsuya ; Higashikawa, Yuya ; Katoh, Naoki.. - p. 52-64 , 2021

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

9

Almost Linear Time Algorithms for Some Problems on Dynamic ..:

, In: Sublinear Computation Paradigm,

Higashikawa, Yuya ; Katoh, Naoki ; Teruyama, Junichi - p. 65-85 , 2021

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

10

Almost linear time algorithms for minsum k-sink problems on..:

Higashikawa, Yuya ; Katoh, Naoki ; Teruyama, Junichi.
Theoretical Computer Science. 873 (2021) - p. 87-113 , 2021

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

11

What Is the Sublinear Computation Paradigm?:

, In: Sublinear Computation Paradigm,

Katoh, Naoki ; Ito, Hiro - p. 3-10 , 2021

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

12

Minsum k-sink problem on path networks:

Benkoczi, Robert ; Bhattacharya, Binay ; Higashikawa, Yuya..
Theoretical Computer Science. 806 (2020) - p. 388-401 , 2020

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

13

Almost Linear Time Algorithms for Minsum k-Sink Problems on..:

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

Higashikawa, Yuya ; Katoh, Naoki ; Teruyama, Junichi. - p. 198-213 , 2020

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

14

A Survey on Facility Location Problems in Dynamic Flow Netw..:

Higashikawa, Yuya ; Katoh, Naoki
The Review of Socionetwork Strategies. 13 (2019) 2 - p. 163-208 , 2019

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

15

Preface for the Special Issue on the Project "Foundation of..:

Katoh, Naoki ; Higashikawa, Yuya ; Ito, Hiro...
The Review of Socionetwork Strategies. 13 (2019) 2 - p. 99-100 , 2019

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