Yota Otachi

Citace

	Všechny	Od 2020
Citace	1627	989
h-index	23	17
i10-index	57	34

280

140

210

2008200920102011201220132014201520162017201820192020202120222023202420254 4 18 35 24 45 54 45 71 91 98 123 131 133 172 201 270 77

Veřejný přístup

Zobrazit všechny

22 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Ryuhei UeharaJapan Advanced Institute of Science and TechnologyE-mailová adresa ověřena na: jaist.ac.jp
Hirotaka OnoNagoya University, JapanE-mailová adresa ověřena na: i.nagoya-u.ac.jp
Toshiki SaitohKyushu Institute of TechnologyE-mailová adresa ověřena na: ces.kyutech.ac.jp
Tesshu Hanaka 土中哲秀Kyushu UniversityE-mailová adresa ověřena na: inf.kyushu-u.ac.jp
Yasuaki KobayashiHokkaido UniversityE-mailová adresa ověřena na: ist.hokudai.ac.jp
Masashi KiyomiSeikei UniversityE-mailová adresa ověřena na: st.seikei.ac.jp
Takeaki UnoNational Institute of Informatics, JapanE-mailová adresa ověřena na: nii.jp
Yoshio OkamotoUniversity of Electro-CommunicationsE-mailová adresa ověřena na: uec.ac.jp
Pavel KlavíkOrgPadE-mailová adresa ověřena na: iuuk.mff.cuni.cz
Michael LampisLAMSADE, Université Paris DauphineE-mailová adresa ověřena na: dauphine.fr
Tatsuya GimaHokkaido UniversityE-mailová adresa ověřena na: ist.hokudai.ac.jp
Koichi YamazakiTokyo Denki UniversityE-mailová adresa ověřena na: mail.dendai.ac.jp
Rémy BelmonteUniversité Gustave EiffelE-mailová adresa ověřena na: univ-eiffel.fr
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityE-mailová adresa ověřena na: uu.nl
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaE-mailová adresa ověřena na: kam.mff.cuni.cz
Kazuhiro KuritaNagoya UniversityE-mailová adresa ověřena na: i.nagoya-u.ac.jp
Shinichi NakanoProfessor of Computer Science, Gunma UniversityE-mailová adresa ověřena na: gunma-u.ac.jp
Tomas VyskocilCharles University, Rutgers UniversityE-mailová adresa ověřena na: cs.rutgers.edu
Kunihiro WasaHosei UniversityE-mailová adresa ověřena na: hosei.ac.jp
Yusuke KOBAYASHIKyoto UniversityE-mailová adresa ověřena na: kurims.kyoto-u.ac.jp

Sledovat

Yota Otachi

Nagoya University

E-mailová adresa ověřena na: nagoya-u.jp - Domovská stránka

Graph Algorithms


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Linear-time algorithm for sliding tokens on trees ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ... Theoretical Computer Science 600, 132-142, 2015	71	2015
Extending partial representations of interval graphs P Klavík, J Kratochvíl, Y Otachi, T Saitoh, T Vyskočil Algorithmica 78 (3), 945-967, 2017	59	2017
Extending partial representations of proper and unit interval graphs P Klavík, J Kratochvíl, Y Otachi, I Rutter, T Saitoh, M Saumell, T Vyskočil Scandinavian Workshop on Algorithm Theory, 253-264, 2014	59	2014
Extending partial representations of subclasses of chordal graphs P Klavík, J Kratochvíl, Y Otachi, T Saitoh Theoretical Computer Science 576, 85-101, 2015	58	2015
Depth-first search using O(n) bits T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ... International Symposium on Algorithms and Computation, 553-564, 2014	56	2014
Token sliding on split graphs R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora Theory of Computing Systems 65, 662-686, 2021	47	2021
Sliding token on bipartite permutation graphs E Fox-Epstein, DA Hoang, Y Otachi, R Uehara Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015	44	2015
Subgraph isomorphism in graph classes S Kijima, Y Otachi, T Saitoh, T Uno Discrete Mathematics 312 (21), 3164-3173, 2012	40	2012
Exploring the gap between treedepth and vertex cover through vertex integrity T Gima, T Hanaka, M Kiyomi, Y Kobayashi, Y Otachi Theoretical Computer Science 918, 60-76, 2022	38	2022
Exact algorithms for the max-min dispersion problem T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ... International Workshop on Frontiers in Algorithmics, 263-272, 2018	35	2018
Finding diverse trees, paths, and more T Hanaka, Y Kobayashi, K Kurita, Y Otachi Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3778-3786, 2021	34	2021
Reconfiguration of cliques in a graph T Ito, H Ono, Y Otachi Theory and Applications of Models of Computation: 12th Annual Conference …, 2015	32	2015
On spanning tree congestion of graphs K Kozawa, Y Otachi, K Yamazaki Discrete Mathematics 309 (13), 4215-4224, 2009	30	2009
Grundy distinguishes treewidth from pathwidth R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi SIAM Journal on Discrete Mathematics 36 (3), 1761-1787, 2022	29	2022
Completely independent spanning trees in (partial) k-trees M Matsushita, Y Otachi, T Araki Discussiones Mathematicae Graph Theory 35 (3), 427-437, 2015	28	2015
Random generation and enumeration of bipartite permutation graphs T Saitoh, Y Otachi, K Yamanaka, R Uehara Journal of Discrete Algorithms 10, 84-97, 2012	28	2012
Computing diverse shortest paths efficiently: A theoretical and experimental study T Hanaka, Y Kobayashi, K Kurita, SW Lee, Y Otachi Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3758-3766, 2022	27	2022
Polynomial-time algorithm for sliding tokens on trees ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ... International Symposium on Algorithms and Computation, 389-400, 2014	27	2014
On the classes of interval graphs of limited nesting and count of lengths P Klavík, Y Otachi, J Šejnoha Algorithmica 81 (4), 1490-1511, 2019	26	2019
A faster parameterized algorithm for pseudoforest deletion HL Bodlaender, H Ono, Y Otachi Discrete Applied Mathematics 236, 42-56, 2018	25	2018

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři