Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks
Higashikawa, Yuya, Katoh, Naoki, Teruyama, Junichi, Watase, Koji
Published in Theoretical computer science (10.06.2021)
Published in Theoretical computer science (10.06.2021)
Get full text
Journal Article
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs
KAWAKAMI, Yuki, TAKAHASHI, Shun, SETO, Kazuhisa, HORIYAMA, Takashi, KOBAYASHI, Yuki, HIGASHIKAWA, Yuya, KATOH, Naoki
Published in IEICE Transactions on Information and Systems (01.06.2024)
Published in IEICE Transactions on Information and Systems (01.06.2024)
Get full text
Journal Article
Multiple sink location problems in dynamic path networks
Higashikawa, Yuya, Golin, Mordecai J., Katoh, Naoki
Published in Theoretical computer science (23.11.2015)
Published in Theoretical computer science (23.11.2015)
Get full text
Journal Article
Repertoire Analysis of Antibody CDR-H3 Loops Suggests Affinity Maturation Does Not Typically Result in Rigidification
Jeliazkov, Jeliazko R, Sljoka, Adnan, Kuroda, Daisuke, Tsuchimura, Nobuyuki, Katoh, Naoki, Tsumoto, Kouhei, Gray, Jeffrey J
Published in Frontiers in immunology (02.03.2018)
Published in Frontiers in immunology (02.03.2018)
Get full text
Journal Article
A Linear-Time Algorithm for Testing Outer-1-Planarity
Hong, Seok-Hee, Eades, Peter, Katoh, Naoki, Liotta, Giuseppe, Schweitzer, Pascal, Suzuki, Yusuke
Published in Algorithmica (01.08.2015)
Published in Algorithmica (01.08.2015)
Get full text
Journal Article
Minimax regret 1-sink location problem in dynamic path networks
Higashikawa, Yuya, Augustine, John, Cheng, Siu-Wing, Golin, Mordecai J., Katoh, Naoki, Ni, Guanqun, Su, Bing, Xu, Yinfeng
Published in Theoretical computer science (11.07.2015)
Published in Theoretical computer science (11.07.2015)
Get full text
Journal Article
An inductive construction of minimally rigid body–hinge simple graphs
Kobayashi, Yuki, Higashikawa, Yuya, Katoh, Naoki, Kamiyama, Naoyuki
Published in Theoretical computer science (01.10.2014)
Published in Theoretical computer science (01.10.2014)
Get full text
Journal Article
Online graph exploration algorithms for cycles and trees by multiple searchers
Higashikawa, Yuya, Katoh, Naoki, Langerman, Stefan, Tanigawa, Shin-ichi
Published in Journal of combinatorial optimization (01.08.2014)
Published in Journal of combinatorial optimization (01.08.2014)
Get full text
Journal Article
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
Kobayashi, Yuki, Higashikawa, Yuya, Katoh, Naoki, Sljoka, Adnan
Published in Information processing letters (01.02.2016)
Published in Information processing letters (01.02.2016)
Get full text
Journal Article
Preface for the Special Issue on the Project “Foundation of Innovative Algorithms for Big Data”
Katoh, Naoki, Higashikawa, Yuya, Ito, Hiro, Kataoka, Shun, Kida, Takuya, Saitoh, Toshiki, Shibuya, Tetsuo, Tanaka, Kazuyuki, Uno, Yushi
Published in The review of socionetwork strategies (01.10.2019)
Published in The review of socionetwork strategies (01.10.2019)
Get full text
Journal Article
Straight-Line Drawability of a Planar Graph Plus an Edge
Eades, Peter, Hong, Seok-Hee, Liotta, Giuseppe, Katoh, Naoki, Poon, Sheung-Hung
Published in Algorithms and Data Structures (2015)
Published in Algorithms and Data Structures (2015)
Get full text
Book Chapter
On the edge crossing properties of Euclidean minimum weight Laman graphs
Bereg, Sergey, Hong, Seok-Hee, Katoh, Naoki, Poon, Sheung-Hung, Tanigawa, Shin-ichi
Published in Computational geometry : theory and applications (01.01.2016)
Published in Computational geometry : theory and applications (01.01.2016)
Get full text
Journal Article