interview: Hirotaka Ono von Anon., Anon

Volltext

On directed covering and domination problems von Hanaka, Tesshu, Nishimura, Naomi, Ono, Hirotaka

Volltext

Fairness norm through social networks: a simulation approach von Rifki, Omar, Ono, Hirotaka

Volltext

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP von Hanaka, Tesshu, Ono, Hirotaka, Sugiyama, Kosuke

Volltext

Finding environmentally critical transmission sectors, transactions, and paths in global supply chain networks von Hanaka, Tesshu, Kagawa, Shigemi, Ono, Hirotaka, Kanemoto, Keiichiro

Volltext

Winner Determination Algorithms for Graph Games with Matching Structures von Hanaka, Tesshu, Kiya, Hironori, Ono, Hirotaka, Yoshiwatari, Kanae

Volltext

BlockSum is NP-Complete von HARAGUCHI, Kazuya, ONO, Hirotaka

Volltext

Pattern Formation by Oblivious Asynchronous Mobile Robots von Fujinaga, Nao, Yamauchi, Yukiko, Ono, Hirotaka, Kijima, Shuji, Yamashita, Masafumi

Volltext

Liver fibrosis is associated with carotid atherosclerosis in patients with liver biopsy-proven nonalcoholic fatty liver disease von Arai, Taeang, Atsukawa, Masanori, Tsubota, Akihito, Kato, Keizo, Abe, Hiroshi, Ono, Hirotaka, Kawano, Tadamichi, Yoshida, Yuji, Tanabe, Tomohide, Okubo, Tomomi, Hayama, Korenobu, Nakagawa-Iwashita, Ai, Itokawa, Norio, Kondo, Chisa, Kaneko, Keiko, Emoto, Naoya, Nagao, Mototsugu, Inagaki, Kyoko, Fukuda, Izumi, Sugihara, Hitoshi, Iwakiri, Katsuhiko

Volltext

On a Spectral Lower Bound of Treewidth von GIMA, Tatsuya, HANAKA, Tesshu, NORO, Kohei, ONO, Hirotaka, OTACHI, Yota

Volltext

Algorithmic Approach for Combinatorial Game Theory von Kiya, Hironori, Ono, Hirotaka

Volltext

Sequentially Swapping Tokens: Further on Graph Classes von Kiya, Hironori, Okada, Yuto, Ono, Hirotaka, Otachi, Yota

Volltext

Parameterized Complexity of (A,ℓ)-Path Packing von Belmonte, Rémy, Hanaka, Tesshu, Kanzaki, Masaaki, Kiyomi, Masashi, Kobayashi, Yasuaki, Kobayashi, Yusuke, Lampis, Michael, Ono, Hirotaka, Otachi, Yota

Volltext

Fixed-Parameter Tractability of Token Jumping on Planar Graphs von Ito, Takehiro, Kamiński, Marcin, Ono, Hirotaka

Volltext

Computing the Winner of 2-Player TANHINMIN von KIYA, Hironori, OHTO, Katsuki, ONO, Hirotaka

Volltext

Parameterized complexity of independent set reconfiguration problems von Ito, Takehiro, Kamiński, Marcin, Ono, Hirotaka, Suzuki, Akira, Uehara, Ryuhei, Yamanaka, Katsuhisa

Volltext

The complexity of dominating set reconfiguration von Haddadan, Arash, Ito, Takehiro, Mouawad, Amer E., Nishimura, Naomi, Ono, Hirotaka, Suzuki, Akira, Tebbal, Youcef

Volltext

Efficacy of early antifibrotic treatment for idiopathic pulmonary fibrosis von Sugino, Keishi, Ono, Hirotaka, Watanabe, Natsumi, Ando, Masahiro, Tsuboi, Eiyasu, Homma, Sakae, Kishi, Kazuma

Volltext

409-Tb/s + 409-Tb/s crosstalk suppressed bidirectional MCF transmission over 450 km using propagation-direction interleaving von Sano, Akihide, Takara, Hidehiko, Kobayashi, Takayuki, Kawakami, Hiroto, Kishikawa, Hiroki, Nakagawa, Tadao, Miyamoto, Yutaka, Abe, Yoshiteru, Ono, Hirotaka, Shikama, Kota, Nagatani, Munehiko, Mori, Takayoshi, Sasaki, Yusuke, Ishida, Itaru, Takenaga, Katsuhiro, Matsuo, Shoichiro, Saitoh, Kunimasa, Koshiba, Masanori, Yamada, Makoto, Masuda, Hiroji, Morioka, Toshio

Volltext

Coalescing Random Walks and Voting on Connected Graphs von Cooper, Colin, Elsässer, Robert, Ono, Hirotaka, Radzik, Tomasz

Volltext