default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHirotaka Ono 0001
Person information
- affiliation: Nagoya University, Furocho, Chikusa-ku, Nagoya, Japan
- affiliation (former): Kyushu University, Fukuoka, Japan
Other persons with the same name
- Hirotaka Ono 0002 — NTT Device Technology Laboratories, Kanagawa, Japan
- Hirotaka Ono 0003 — Okayama University, Okayama, Japan
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j72]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
:
An improved spectral lower bound of treewidth. Inf. Process. Lett. 188: 106536 (2025)- [j71]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural parameterizations of vertex integrity. Theor. Comput. Sci. 1024: 114954 (2025) - 2024
- [j70]Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. Algorithmica 86(3): 808-824 (2024) - [j69]Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo:
Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. 346: 215-227 (2024) - [j68]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. 353: 44-64 (2024) - [j67]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) - [j66]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) - [j65]Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama:
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. Int. J. Netw. Comput. 14(1): 26-39 (2024) - [j64]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped domination parameterized by vertex cover, twin cover, and beyond. Theor. Comput. Sci. 996: 114507 (2024) - [c98]Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki:
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. AAAI 2024: 20726-20734 - [c97]Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono:
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA 2024: 232-246 - [c96]Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM 2024: 55-68 - [c95]Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari:
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM 2024: 297-310 - [c94]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. WALCOM 2024: 406-420 - [i36]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi:
An improved spectral lower bound of treewidth. CoRR abs/2404.08520 (2024) - 2023
- [j63]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of cliques in a graph. Discret. Appl. Math. 333: 43-58 (2023) - [j62]Hirotaka Ono, Hisato Yamanaka:
An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs. Discret. Appl. Math. 341: 93-101 (2023) - [c93]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC 2023: 263-277 - [c92]Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono:
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. COCOA (1) 2023: 392-405 - [c91]Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov:
Shortest Longest-Path Graph Orientations. COCOON (1) 2023: 141-154 - [c90]Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka:
Approximation Algorithms for the Longest Run Subsequence Problem. CPM 2023: 2:1-2:12 - [c89]Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama:
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP*. IPDPS Workshops 2023: 308-313 - [c88]Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama:
Shortest Beer Path Queries Based on Graph Decomposition. ISAAC 2023: 37:1-37:20 - [c87]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM 2023: 222-235 - [i35]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR abs/2302.06983 (2023) - [i34]Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama:
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. CoRR abs/2303.01290 (2023) - [i33]Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. CoRR abs/2305.10749 (2023) - [i32]Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama:
Shortest Beer Path Queries based on Graph Decomposition. CoRR abs/2307.02787 (2023) - [i31]Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono:
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR abs/2308.16426 (2023) - [i30]Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono:
Turning Tiles is PSPACE-complete. CoRR abs/2310.01983 (2023) - [i29]Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono:
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs. CoRR abs/2310.05139 (2023) - [i28]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. CoRR abs/2311.05892 (2023) - [i27]Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki:
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. CoRR abs/2312.10599 (2023) - [i26]Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono:
Algorithms for Optimally Shifting Intervals under Intersection Graph Models. CoRR abs/2312.16964 (2023) - 2022
- [j61]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) - [j60]Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono:
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. Discret. Appl. Math. 321: 281-294 (2022) - [j59]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. J. Graph Algorithms Appl. 26(2): 241-255 (2022) - [j58]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900: 53-78 (2022) - [c86]Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono:
Capacitated Network Design Games on a Generalized Fair Allocation Model. AAMAS 2022: 1616-1617 - [c85]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. COCOON 2022: 292-304 - [c84]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM 2022: 15:1-15:17 - [c83]Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono:
Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA 2022: 509-522 - [c82]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. SAGT 2022: 421-435 - [i25]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. CoRR abs/2210.02835 (2022) - [i24]Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. CoRR abs/2211.05307 (2022) - 2021
- [j57]Hironori Kiya, Katsuki Ohto, Hirotaka Ono:
Computing the Winner of 2-Player TANHINMIN. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1134-1141 (2021) - [j56]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32(2): 209-233 (2021) - [c81]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. WALCOM 2021: 208-220 - [i23]Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono:
Capacitated Network Design Games on a Generalized Fair Allocation Model. CoRR abs/2107.03040 (2021) - [i22]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. CoRR abs/2111.02579 (2021) - 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]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020) - [j53]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) - [j52]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) - [j51]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838: 238-249 (2020) - [j50]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph orientation with splits. Theor. Comput. Sci. 844: 16-25 (2020) - [c80]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. AAMAS 2020: 1777-1779 - [c79]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 - [c78]Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi:
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. SOFSEM 2020: 627-635 - [i21]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) - [i20]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. CoRR abs/2007.08045 (2020) - [i19]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) - [i18]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. CoRR abs/2009.10502 (2020)
2010 – 2019
- 2019
- [j49]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On directed covering and domination problems. Discret. Appl. Math. 259: 76-99 (2019) - [j48]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement fund circulation problem. Discret. Appl. Math. 265: 86-103 (2019) - [j47]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the maximum weight minimal separator. Theor. Comput. Sci. 796: 294-308 (2019) - [c77]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CIAC 2019: 38-49 - [c76]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA 2019: 1-12 - [c75]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.:
Graph Orientation with Edge Modifications. FAW 2019: 38-50 - [c74]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA 2019: 576-584 - [c73]Hirotaka Ono, Hisato Yamanaka:
A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. SOFSEM 2019: 379-391 - [c72]Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
Optimal Partition of a Tree with Social Distance. WALCOM 2019: 121-132 - [c71]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. WG 2019: 285-297 - [i17]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019) - [i16]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR abs/1905.00340 (2019) - [i15]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. CoRR abs/1908.11554 (2019) - 2018
- [j46]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica 80(7): 2160-2180 (2018) - [j45]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. 236: 42-56 (2018) - [j44]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) - [c70]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph Orientation with Splits. ISCO 2018: 52-63 - [c69]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS 2018: 44:1-44:15 - [i14]Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
Optimal Partition of a Tree with Social Distance. CoRR abs/1809.03392 (2018) - 2017
- [c68]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On Directed Covering and Domination Problems. ISAAC 2017: 45:1-45:12 - [c67]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement Fund Circulation Problem. ISAAC 2017: 46:1-46:13 - [c66]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318 - [i13]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR abs/1712.09230 (2017) - 2016
- [j43]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207: 80-89 (2016) - [j42]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. 22: 111-121 (2016) - [j41]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58(1): 60-93 (2016) - [j40]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651: 37-49 (2016) - [c65]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC 2016: 20:1-20:12 - [c64]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC 2016: 7:1-7:12 - 2015
- [j39]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19(1): 441-465 (2015) - [j38]Kazuya Haraguchi, Hirotaka Ono:
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. J. Inf. Process. 23(3): 276-283 (2015) - [j37]Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput. 44(3): 740-785 (2015) - [j36]Yen Kaow Ng, Linzhi Yin, Hirotaka Ono, Shuai Cheng Li:
Finding All Longest Common Segments in Protein Structures Efficiently. IEEE ACM Trans. Comput. Biol. Bioinform. 12(3): 644-655 (2015) - [j35]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. 562: 660-661 (2015) - [j34]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. 591: 5-14 (2015) - [j33]Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski:
The searchlight problem for road networks. Theor. Comput. Sci. 591: 28-59 (2015) - [j32]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) - [c63]Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono:
Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. ISIT 2015: 1307-1311 - [c62]Omar Rifki, Hirotaka Ono:
A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection. OR 2015: 317-324 - [c61]Tesshu Hanaka, Hirotaka Ono:
A Fixed-Parameter Algorithm for Max Edge Domination. SOFSEM (Student Research Forum Papers / Posters) 2015: 31-40 - [c60]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. TAMC 2015: 212-223 - [c59]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The Complexity of Dominating Set Reconfiguration. WADS 2015: 398-409 - [i12]Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono:
Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. CoRR abs/1501.04402 (2015) - [i11]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. CoRR abs/1503.00833 (2015) - 2014
- [j31]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) - [j30]Hirotaka Ono:
Foreword. IEICE Trans. Inf. Syst. 97-D(3): 391 (2014) - [j29]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4(2): 251-259 (2014) - [j28]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of list L(2,1)-labelings in a graph. Theor. Comput. Sci. 544: 84-97 (2014) - [j27]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) - [c58]Kazuya Haraguchi, Hirotaka Ono:
Approximability of Latin Square Completion-Type Puzzles. FUN 2014: 218-229 - [c57]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. ISAAC 2014: 208-219 - [c56]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 - [c55]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 - [c54]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO 2014: 292-304 - [c53]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. LATIN 2014: 238-249 - [c52]Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351 - [i10]Takehiro Ito, Marcin Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. CoRR abs/1406.6567 (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, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. CoRR abs/1412.3976 (2014) - 2013
- [j26]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. Algorithmica 65(2): 317-338 (2013) - [j25]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66(3): 654-681 (2013) - [j24]Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono:
Optimal approximability of bookmark assignments. Discret. Appl. Math. 161(16-17): 2361-2366 (2013) - [j23]Kazuya Haraguchi, Hirotaka Ono:
BLOCKSUM is NP-Complete. IEICE Trans. Inf. Syst. 96-D(3): 481-488 (2013) - [j22]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. 27(4): 1748-1758 (2013) - [c51]Hirotaka Ono:
Recent Advances on Distance Constrained Labeling Problems. CANDAR 2013: 26-29 - [c50]Omar Rifki, Hirotaka Ono:
Robustness Analysis of Evolutionary Algorithms to Portfolio Optimization Against Errors in Asset Means. OR 2013: 369-375 - [c49]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 - [c48]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA 2013: 24-36 - [i7]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. CoRR abs/1306.5041 (2013) - 2012
- [j21]Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Comput. 25(6): 451-460 (2012) - [j20]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total labeling problem for trees. Discret. Math. 312(8): 1407-1420 (2012) - [j19]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms 14: 189-206 (2012) - [j18]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. 429: 144-154 (2012) - [j17]Kazuhisa Makino, Hirotaka Ono:
Deductive inference for the interiors and exteriors of horn theories. ACM Trans. Comput. Log. 13(3): 23:1-23:16 (2012) - [c47]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS 2012: 139-146 - [c46]Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li:
Finding Longest Common Segments in Protein Structures in Nearly Linear Time. CPM 2012: 334-348 - [c45]Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita:
An Extension of Matthews' Bound to Multiplex Random Walks. IPDPS Workshops 2012: 872-877 - [c44]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of List L(2, 1)-Labelings in a Graph. ISAAC 2012: 34-43 - [c43]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO 2012: 332-343 - [c42]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. PODC 2012: 47-56 - [c41]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Minimum Certificate Dispersal with Tree Structures. TAMC 2012: 548-559 - [i6]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. CoRR abs/1204.4106 (2012) - 2011
- [j16]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono:
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. 159(7): 498-508 (2011) - [j15]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22(3): 583-601 (2011) - [j14]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1): 78-96 (2011) - [j13]Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita:
Broadcastings and digit tilings on three-dimensional torus networks. Theor. Comput. Sci. 412(4-5): 307-319 (2011) - [c40]Eiji Miyano, Hirotaka Ono:
Maximum Domination Problem. CATS 2011: 55-62 - [c39]Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS 2011: 63-68 - [c38]Hirotaka Ono:
Fast Random Walks on Finite Graphs and Graph Topological Information. ICNC 2011: 360-363 - [c37]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS 2011: 376-387 - [c36]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 - [i5]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Minimum Certificate Dispersal with Tree Structures. CoRR abs/1106.5845 (2011) - [i4]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances. CoRR abs/1107.2443 (2011) - 2010
- [j12]Fuminiko Nakano, Hirotaka Ono, Taizo Sadahiro:
Local move connectedness of domino tilings with diagonal impurities. Discret. Math. 310(13-14): 1918-1931 (2010) - [j11]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. 21(3): 427-440 (2010) - [j10]Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The hitting and cover times of Metropolis walks. Theor. Comput. Sci. 411(16-18): 1889-1894 (2010) - [j9]Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada:
Approximability and inapproximability of the minimum certificate dispersal problem. Theor. Comput. Sci. 411(31-33): 2773-2783 (2010) - [c35]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60 - [c34]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA 2010: 103-106 - [c33]Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS 2010: 1-15 - [c32]Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. OPODIS 2010: 491-503
2000 – 2009
- 2009
- [j8]Kazuo Iwama, Eiji Miyano, Hirotaka Ono:
Drawing Borders Efficiently. Theory Comput. Syst. 44(2): 230-244 (2009) - [j7]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An O(n1.75) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410(38-40): 3702-3710 (2009) - [c31]Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada:
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. COCOON 2009: 56-65 - [c30]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. ESA 2009: 35-46 - [c29]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 - [c28]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. ISAAC 2009: 403-412 - [c27]Ei Ando, Hirotaka Ono, Masafumi Yamashita:
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA 2009: 89-103 - [c26]Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA 2009: 104-116 - [c25]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC 2009: 98-107 - [i3]Kazuhisa Makino, Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories. CoRR abs/0903.0422 (2009) - [i2]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. CoRR abs/0911.4590 (2009) - 2008
- [c24]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono:
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS 2008: 97-106 - [c23]Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. DNA 2008: 168-178 - [c22]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8 - [c21]Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The Balanced Edge Cover Problem. ISAAC 2008: 246-257 - [c20]Kazuhisa Makino, Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories. ISAAC 2008: 390-401 - [c19]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197 - [i1]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A linear time algorithm for L(2,1)-labeling of trees. CoRR abs/0810.0906 (2008) - 2007
- [j6]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. 18(2): 197-215 (2007) - [j5]Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. Inf. Media Technol. 2(4): 1103-1112 (2007) - [c18]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM 2007: 167-177 - [c17]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA 2007: 130-139 - [c16]Kazuo Iwama, Eiji Miyano, Hirotaka Ono:
Drawing Borders Efficiently. FUN 2007: 213-226 - [c15]Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono:
On Approximation of Bookmark Assignments. MFCS 2007: 115-124 - 2006
- [j4]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to collect balls moving in the Euclidean plane. Discret. Appl. Math. 154(16): 2247-2262 (2006) - [c14]Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20 - [c13]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
DNA Sequence Design by Dynamic Neighborhood Searches. DNA 2006: 157-171 - [c12]Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A Probabilistic Model of the DNA Conformational Change. DNA 2006: 274-285 - [c11]Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A generic search strategy for large-scale real-world networks. Infoscale 2006: 2 - [c10]Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA 2006: 39-50 - 2005
- [c9]Hirotaka Ono, Yen Kaow Ng:
Best Fitting Fixed-Length Substring Patterns for a Set of Strings. COCOON 2005: 240-250 - [c8]Yen Kaow Ng, Hirotaka Ono, Takeshi Shinohara:
Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. Discovery Science 2005: 176-188 - [c7]Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA 2005: 359-370 - [c6]Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita:
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005: 125-130 - 2004
- [j3]Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
A decomposability index in logical analysis of data. Discret. Appl. Math. 142(1-3): 165-180 (2004) - [c5]Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004: 155-163 - [c4]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to Collect Balls Moving in the Euclidean Plane. CATS 2004: 229-245 - 2003
- [j2]Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki:
Interior and exterior functions of positive Boolean functions. Discret. Appl. Math. 130(3): 417-436 (2003) - [e1]Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono:
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Lecture Notes in Computer Science 2906, Springer 2003, ISBN 3-540-20695-7 [contents] - 2002
- [j1]Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki:
Logical analysis of data with decomposable structures. Theor. Comput. Sci. 289(2): 977-995 (2002) - [c3]Hoong Chuin Lau, Qi Zhang Liu, Hirotaka Ono:
Integrating Local Search and Network Flow to Solve the Inventory Routing Problem. AAAI/IAAI 2002: 9-14 - 2001
- [c2]Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC 2001: 279-290 - 2000
- [c1]Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki:
Logical Analysis of Data with Decomposable Structures. COCOON 2000: 396-406
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-03 20:30 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:
