default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYota Otachi
Person information
- affiliation: Nagoya University, Graduate School of Informatics, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j79]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
:
An improved spectral lower bound of treewidth. Inf. Process. Lett. 188: 106536 (2025)- [j78]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural parameterizations of vertex integrity. Theor. Comput. Sci. 1024: 114954 (2025) - [j77]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for tree minor containment with structural parameters. Theor. Comput. Sci. 1026: 114984 (2025) - 2024
- [j76]Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. Algorithmica 86(1): 147-170 (2024) - [j75]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. Algorithmica 86(11): 3395-3424 (2024) - [j74]Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi:
Collecting Balls on a Line by Robots with Limited Energy. IEICE Trans. Inf. Syst. 107(3): 325-327 (2024) - [j73]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi:
On a Spectral Lower Bound of Treewidth. IEICE Trans. Inf. Syst. 107(3): 328-330 (2024) - [j72]Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Finding a Reconfiguration Sequence between Longest Increasing Subsequences. IEICE Trans. Inf. Syst. 107(4): 559-563 (2024) - [j71]Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara:
Computational complexity of jumping block puzzles. Theor. Comput. Sci. 983: 114292 (2024) - [j70]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped domination parameterized by vertex cover, twin cover, and beyond. Theor. Comput. Sci. 996: 114507 (2024) - [c71]Yota Otachi, Akira Suzuki, Yuma Tamura:
Finding Induced Subgraphs from Graphs with Small Mim-Width. SWAT 2024: 38:1-38:16 - [c70]Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. WALCOM 2024: 377-391 - [c69]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM 2024: 392-405 - [c68]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. WALCOM 2024: 406-420 - [c67]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM 2024: 421-435 - [i55]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi:
An improved spectral lower bound of treewidth. CoRR abs/2404.08520 (2024) - [i54]Yota Otachi, Akira Suzuki, Yuma Tamura:
Finding Induced Subgraphs from Graphs with Small Mim-Width. CoRR abs/2405.15492 (2024) - [i53]Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz:
Parameterized Spanning Tree Congestion. CoRR abs/2410.08314 (2024) - 2023
- [j69]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of cliques in a graph. Discret. Appl. Math. 333: 43-58 (2023) - [j68]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943: 131-141 (2023) - [j67]Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka:
Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. 978: 114158 (2023) - [c66]Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI 2023: 3968-3976 - [c65]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC 2023: 263-277 - [c64]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM 2023: 222-235 - [i52]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR abs/2302.06983 (2023) - [i51]Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi:
Minimum Consistent Subset for Trees Revisited. CoRR abs/2305.07259 (2023) - [i50]Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Finding a reconfiguration sequence between longest increasing subsequences. CoRR abs/2310.01066 (2023) - [i49]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. CoRR abs/2311.03225 (2023) - [i48]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. CoRR abs/2311.05892 (2023) - [i47]Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. CoRR abs/2311.13132 (2023) - [i46]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the complexity of list H-packing for sparse graph classes. CoRR abs/2312.08639 (2023) - 2022
- [j66]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84(4): 871-895 (2022) - [j65]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. Algorithmica 84(4): 1163-1181 (2022) - [j64]Yasuaki Kobayashi, Yota Otachi:
Parameterized Complexity of Graph Burning. Algorithmica 84(8): 2379-2393 (2022) - [j63]Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66(2): 502-515 (2022) - [j62]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36(3): 1761-1787 (2022) - [j61]Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. 918: 60-76 (2022) - [c63]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi:
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI 2022: 3758-3766 - [c62]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA 2022: 61:1-61:15 - [c61]Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka:
Sorting Balls and Water: Equivalence and Computational Complexity. FUN 2022: 16:1-16:17 - [c60]Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. ISAAC 2022: 20:1-20:15 - [c59]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh:
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS 2022: 6:1-6:15 - [c58]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa:
Independent Set Reconfiguration on Directed Graphs. MFCS 2022: 58:1-58:15 - [c57]Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa:
Reconfiguration of Regular Induced Subgraphs. WALCOM 2022: 35-46 - [i45]Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR abs/2201.08940 (2022) - [i44]Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. CoRR abs/2202.08445 (2022) - [i43]Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka:
Sorting Balls and Water: Equivalence and Computational Complexity. CoRR abs/2202.09495 (2022) - [i42]Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi:
Finding shortest non-separating and non-disconnecting paths. CoRR abs/2202.09718 (2022) - [i41]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa:
Independent set reconfiguration on directed graphs. CoRR abs/2203.13435 (2022) - [i40]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR abs/2207.01024 (2022) - [i39]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. CoRR abs/2210.02835 (2022) - 2021
- [j60]Marko Jakovac, Yota Otachi:
On the security number of the Cartesian product of graphs. Discret. Appl. Math. 304: 119-128 (2021) - [j59]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-congestion shortcut and graph parameters. Distributed Comput. 34(5): 349-365 (2021) - [j58]Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest common subsequence in sublinear space. Inf. Process. Lett. 168: 106084 (2021) - [j57]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. Theory Comput. Syst. 65(4): 662-686 (2021) - [c56]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi:
Finding Diverse Trees, Paths, and More. AAAI 2021: 3778-3786 - [c55]Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC 2021: 271-285 - [c54]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. COCOON 2021: 343-354 - [c53]Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara:
Computational Complexity of Jumping Block Puzzles. COCOON 2021: 655-667 - [c52]Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi:
Distributed Reconfiguration of Spanning Trees. SSS 2021: 516-520 - [i38]Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CoRR abs/2101.09414 (2021) - [i37]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. CoRR abs/2107.03092 (2021) - [i36]Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara:
Computational Complexity of Jumping Block Puzzles. CoRR abs/2109.02213 (2021) - [i35]Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa:
Reconfiguration of Regular Induced Subgraphs. CoRR abs/2111.13476 (2021) - [i34]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi:
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. CoRR abs/2112.05403 (2021) - 2020
- [j56]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. Algorithmica 82(7): 1909-1938 (2020) - [j55]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82(9): 2586-2605 (2020) - [j54]Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica 82(12): 3566-3587 (2020) - [j53]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. 90: 101648 (2020) - [j52]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24(3): 215-245 (2020) - [j51]Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi:
K3 Edge Cover Problem in a Wide Sense. J. Inf. Process. 28: 849-858 (2020) - [j50]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. 64(3): 522-541 (2020) - [j49]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818: 2-11 (2020) - [c51]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. AAMAS 2020: 1777-1779 - [c50]Yota Otachi:
A Survey on Spanning Tree Congestion. Treewidth, Kernels, and Algorithms 2020: 165-172 - [c49]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. ESA 2020: 14:1-14:19 - [c48]Taisuke Izumi, Yota Otachi:
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. ICALP 2020: 67:1-67:17 - [c47]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA 2020: 43-55 - [c46]Yasuaki Kobayashi, Yota Otachi:
Parameterized Complexity of Graph Burning. IPEC 2020: 21:1-21:10 - [c45]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. WG 2020: 286-297 - [i33]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. CoRR abs/2002.10898 (2020) - [i32]Yasuaki Kobayashi, Yota Otachi:
Parameterized Complexity of Graph Burning. CoRR abs/2007.08811 (2020) - [i31]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR abs/2008.03448 (2020) - [i30]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. CoRR abs/2008.07425 (2020) - [i29]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi:
Finding Diverse Trees, Paths, and More. CoRR abs/2009.03687 (2020) - [i28]Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest Common Subsequence in Sublinear Space. CoRR abs/2009.08588 (2020) - [i27]Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR abs/2012.04910 (2020)
2010 – 2019
- 2019
- [j48]Pavel Klavík, Yota Otachi, Jirí Sejnoha:
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. Algorithmica 81(4): 1490-1511 (2019) - [j47]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. Comput. Geom. 80: 13-22 (2019) - [j46]Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara:
On Computational Complexity of Pipe Puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1134-1141 (2019) - [j45]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It? J. Graph Algorithms Appl. 23(2): 111-134 (2019) - [j44]Takehiro Ito, Yota Otachi:
Reconfiguration of colorable sets in classes of perfect graphs. Theor. Comput. Sci. 772: 111-122 (2019) - [j43]Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura:
On structural parameterizations of firefighting. Theor. Comput. Sci. 782: 79-90 (2019) - [c44]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CIAC 2019: 38-49 - [c43]Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC 2019: 87-98 - [c42]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. STACS 2019: 13:1-13:17 - [c41]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-Congestion Shortcut and Graph Parameters. DISC 2019: 25:1-25:17 - [c40]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. WG 2019: 285-297 - [i26]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019) - [i25]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR abs/1905.00340 (2019) - [i24]Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR abs/1905.10670 (2019) - [i23]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-Congestion Shortcut and Graph Parameters. CoRR abs/1908.09473 (2019) - [i22]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. CoRR abs/1909.09371 (2019) - 2018
- [j42]Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-Width. Algorithmica 80(1): 29-47 (2018) - [j41]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica 80(7): 2160-2180 (2018) - [j40]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. 236: 42-56 (2018) - [j39]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - [j38]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping colored tokens on graphs. Theor. Comput. Sci. 729: 1-10 (2018) - [j37]Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex deletion problems on chordal graphs. Theor. Comput. Sci. 745: 75-86 (2018) - [c39]Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Exact Algorithms for the Max-Min Dispersion Problem. FAW 2018: 263-272 - [c38]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It?. FUN 2018: 5:1-5:13 - [c37]Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara:
Computational Complexity of Robot Arm Simulation Problems. IWOCA 2018: 177-188 - [c36]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS 2018: 44:1-44:15 - [c35]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. SWAT 2018: 24:1-24:13 - [c34]Takehiro Ito, Yota Otachi:
Reconfiguration of Colorable Sets in Classes of Perfect Graphs. SWAT 2018: 27:1-27:13 - [i21]Takehiro Ito, Yota Otachi:
Reconfiguration of Colorable Sets in Classes of Perfect Graphs. CoRR abs/1802.06511 (2018) - [i20]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. CoRR abs/1803.06816 (2018) - [i19]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It? CoRR abs/1804.08236 (2018) - [i18]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. CoRR abs/1807.05322 (2018) - [i17]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. CoRR abs/1807.11518 (2018) - 2017
- [j36]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. Algorithmica 77(4): 1071-1104 (2017) - [j35]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. Algorithmica 78(3): 945-967 (2017) - [j34]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216: 130-135 (2017) - [j33]Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki:
Thin strip graphs. Discret. Appl. Math. 216: 203-210 (2017) - [j32]Masashi Kiyomi, Yota Otachi:
Alliances in graphs of bounded clique-width. Discret. Appl. Math. 223: 91-97 (2017) - [j31]Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno:
Hitori Numbers. J. Inf. Process. 25: 695-707 (2017) - [c33]Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON 2017: 150-161 - [c32]Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex Deletion Problems on Chordal Graphs. FSTTCS 2017: 22:1-22:14 - [i16]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR abs/1703.02671 (2017) - [i15]Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex Deletion Problems on Chordal Graphs. CoRR abs/1707.08690 (2017) - [i14]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR abs/1712.09230 (2017) - 2016
- [j30]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. 51: 25-39 (2016) - [j29]Masashi Kiyomi, Yoshio Okamoto, Yota Otachi:
On the treewidth of toroidal grids. Discret. Appl. Math. 198: 303-306 (2016) - [j28]Matsuo Konagaya, Yota Otachi, Ryuhei Uehara:
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs. Discret. Appl. Math. 199: 37-45 (2016) - [j27]Masashi Kiyomi, Yota Otachi:
Finding a chain graph in a bipartite permutation graph. Inf. Process. Lett. 116(9): 569-573 (2016) - [c31]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - [c30]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A Lower Bound on Opaque Sets. SoCG 2016: 46:1-46:10 - [c29]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC 2016: 20:1-20:12 - [c28]Pavel Klavík, Yota Otachi, Jirí Sejnoha:
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. ISAAC 2016: 45:1-45:13 - [c27]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC 2016: 7:1-7:12 - [i13]Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-width. CoRR abs/1605.08540 (2016) - 2015
- [j26]Toru Araki, Masayoshi Matsushita, Yota Otachi:
Completely independent spanning trees in (partial) k-trees. Discuss. Math. Graph Theory 35(3): 427-437 (2015) - [j25]Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara:
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. IEICE Trans. Inf. Syst. 98-D(3): 486-489 (2015) - [j24]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576: 85-101 (2015) - [j23]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600: 132-142 (2015) - [c26]Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara:
Sliding Token on Bipartite Permutation Graphs. ISAAC 2015: 237-247 - [c25]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. JCDCGG 2015: 180-192 - [c24]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. TAMC 2015: 212-223 - [c23]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Competitive Diffusion on Weighted Graphs. WADS 2015: 422-433 - [c22]Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. WADS 2015: 619-628 - [c21]Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-width. WG 2015: 299-311 - [i12]Pavel Klavík, Yota Otachi, Jirí Sejnoha:
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. CoRR abs/1510.03998 (2015) - 2014
- [j22]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
Lower bounds for treewidth of product graphs. Discret. Appl. Math. 162: 251-258 (2014) - [j21]Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. 168: 69-77 (2014) - [j20]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544: 14-31 (2014) - [j19]Meng Li, Yota Otachi, Takeshi Tokuyama:
Efficient algorithms for network localization using cores of underlying graphs. Theor. Comput. Sci. 553: 18-26 (2014) - [j18]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base-object location problems for base-monotone regions. Theor. Comput. Sci. 555: 71-84 (2014) - [c20]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC 2014: 389-400 - [c19]Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara:
Depth-First Search Using O(n) Bits. ISAAC 2014: 553-564 - [c18]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. SWAT 2014: 253-264 - [c17]Yota Otachi, Pascal Schweitzer:
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. SWAT 2014: 368-379 - [c16]Matsuo Konagaya, Yota Otachi, Ryuhei Uehara:
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. TAMC 2014: 216-228 - [c15]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Intersection Dimension of Bipartite Graphs. TAMC 2014: 323-340 - [i11]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. CoRR abs/1403.3894 (2014) - [i10]Yota Otachi, Pascal Schweitzer:
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. CoRR abs/1403.7238 (2014) - [i9]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR abs/1406.6576 (2014) - [i8]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR abs/1412.3334 (2014) - [i7]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. CoRR abs/1412.3976 (2014) - 2013
- [j17]Yota Otachi:
The path-distance-width of hypercubes. Discuss. Math. Graph Theory 33(2): 467-470 (2013) - [c14]Yota Otachi, Pascal Schweitzer:
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. ISAAC 2013: 111-118 - [c13]Martin Balko, Pavel Klavík, Yota Otachi:
Bounded Representations of Interval and Proper Interval Graphs. ISAAC 2013: 535-546 - [c12]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64 - [i6]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Linear-time Algorithm for Partial Representation Extension of Interval Graphs. CoRR abs/1306.2182 (2013) - [i5]Martin Balko, Pavel Klavík, Yota Otachi:
Bounded Representations of Interval and Proper Interval Graphs. CoRR abs/1309.1248 (2013) - 2012
- [j16]Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012) - [j15]Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno:
Subgraph isomorphism in graph classes. Discret. Math. 312(21): 3164-3173 (2012) - [j14]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara:
On bipartite powers of bigraphs. Discret. Math. Theor. Comput. Sci. 14(2): 11-20 (2012) - [j13]Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Enumerating All Rooted Trees Including k Leaves. IEICE Trans. Inf. Syst. 95-D(3): 763-768 (2012) - [j12]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10: 84-97 (2012) - [j11]Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient enumeration of ordered trees with k leaves. Theor. Comput. Sci. 442: 22-27 (2012) - [c11]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381 - [c10]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending Partial Representations of Subclasses of Chordal Graphs. ISAAC 2012: 444-454 - [c9]Yota Otachi:
Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. ISAAC 2012: 455-464 - [c8]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35 - [c7]Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG 2012: 73-84 - [i4]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending Partial Representations of Subclasses of Chordal Graphs. CoRR abs/1207.0255 (2012) - [i3]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil:
Extending Partial Representations of Proper and Unit Interval Graphs. CoRR abs/1207.6960 (2012) - 2011
- [j10]Yota Otachi, Ryohei Suda:
Bandwidth and pathwidth of three-dimensional grids. Discret. Math. 311(10-11): 881-887 (2011) - [j9]Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi:
Spanning tree congestion of k-outerplanar graphs. Discret. Math. 311(12): 1040-1045 (2011) - [j8]Kyohei Kozawa, Yota Otachi:
Spanning tree congestion of rook's graphs. Discuss. Math. Graph Theory 31(4): 753-761 (2011) - [j7]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno:
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. 15(6): 727-751 (2011) - [c6]Meng Li, Yota Otachi, Takeshi Tokuyama:
Efficient Algorithms for Network Localization Using Cores of Underlying Graphs. ALGOSENSORS 2011: 101-114 - [c5]Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno:
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462 - [c4]Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximability of the Path-Distance-Width for AT-free Graphs. WG 2011: 271-282 - [i2]Yota Otachi, Ryohei Suda:
Bandwidth and pathwidth of three-dimensional grids. CoRR abs/1101.0964 (2011) - [i1]Kyohei Kozawa, Yota Otachi:
On spanning tree congestion of Hamming graphs. CoRR abs/1110.1304 (2011) - 2010
- [j6]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
The carving-width of generalized hypercubes. Discret. Math. 310(21): 2867-2876 (2010) - [c3]Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen:
Complexity Results for the Spanning Tree Congestion Problem. WG 2010: 3-14
2000 – 2009
- 2009
- [j5]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
Security number of grid-like graphs. Discret. Appl. Math. 157(11): 2555-2561 (2009) - [j4]Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
On spanning tree congestion of graphs. Discret. Math. 309(13): 4215-4224 (2009) - [c2]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC 2009: 1104-1113 - [c1]Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). WALCOM 2009: 141-150 - 2008
- [j3]Tetsuya Ishizeki, Yota Otachi, Koichi Yamazaki:
An improved algorithm for the longest induced path problem on k-chordal graphs. Discret. Appl. Math. 156(15): 3057-3059 (2008) - [j2]Yota Otachi, Koichi Yamazaki:
A lower bound for the vertex boundary-width of complete k-ary trees. Discret. Math. 308(12): 2389-2395 (2008) - 2007
- [j1]Yota Otachi, Yoshio Okamoto, Koichi Yamazaki:
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discret. Appl. Math. 155(17): 2383-2390 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
