Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTesshu Hanaka
Person information
- affiliation: Kyushu University, Fukuoka, Japan
- affiliation (former): Chuo University, Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j25]Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. Algorithmica 86(3): 808-824 (2024)- [j24]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) - [j23]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) - [j22]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) - 2023
- [j21]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. 25 (2023) - [j20]Tesshu Hanaka
:
Computing densest k-subgraph with structural parameters. J. Comb. Optim. 45(1): 39 (2023) - [j19]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. 975: 114114 (2023) - 2022
- [j18]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) - [j17]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) - [j16]Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of maximum minimal FVS. J. Comput. Syst. Sci. 124: 26-40 (2022) - [j15]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. J. Graph Algorithms Appl. 26(2): 241-255 (2022) - [j14]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) - [j13]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) - 2021
- [j12]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83(5): 1421-1458 (2021) - [j11]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304: 32-44 (2021) - [j10]Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita:
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. 865: 131-140 (2021) - [j9]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866: 123-144 (2021) - [j8]Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone:
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theor. Comput. Sci. 873: 38-46 (2021) - 2020
- [j7]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. Algorithmica 82(7): 1909-1938 (2020) - [j6]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82(9): 2586-2605 (2020) - [j5]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) - [j4]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) - [j3]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806: 553-566 (2020) - 2019
- [j2]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On directed covering and domination problems. Discret. Appl. Math. 259: 76-99 (2019) - [j1]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)
Conference and Workshop Papers
- 2024
- [c34]Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari:
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM 2024: 297-310 - [c33]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. WALCOM 2024: 406-420 - [c32]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 - 2023
- [c31]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 - [c30]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC 2023: 263-277 - [c29]Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono:
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. COCOA (1) 2023: 392-405 - [c28]Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama:
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP*. IPDPS Workshops 2023: 308-313 - [c27]Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama:
Shortest Beer Path Queries Based on Graph Decomposition. ISAAC 2023: 37:1-37:20 - 2022
- [c26]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 - [c25]Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono:
Capacitated Network Design Games on a Generalized Fair Allocation Model. AAMAS 2022: 1616-1617 - [c24]Tesshu Hanaka, Michael Lampis:
Hedonic Games and Treewidth Revisited. ESA 2022: 64:1-64:16 - [c23]Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono:
Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA 2022: 509-522 - 2021
- [c22]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi:
Finding Diverse Trees, Paths, and More. AAAI 2021: 3778-3786 - [c21]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 - [c20]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. WALCOM 2021: 208-220 - 2020
- [c19]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. AAMAS 2020: 1777-1779 - [c18]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Graph Classes and Approximability of the Happy Set Problem. COCOON 2020: 335-346 - [c17]Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone:
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. FAW 2020: 25-36 - [c16]Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of Maximum Minimal FVS. ISAAC 2020: 3:1-3:14 - [c15]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 - [c14]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 - [c13]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized Algorithms for the Happy Set Problem. WALCOM 2020: 323-328 - 2019
- [c12]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CIAC 2019: 38-49 - [c11]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 - [c10]Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi:
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC 2019: 13:1-13:15 - [c9]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA 2019: 576-584 - [c8]Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
Optimal Partition of a Tree with Social Distance. WALCOM 2019: 121-132 - [c7]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. WG 2019: 285-297 - 2018
- [c6]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring Spanning and Induced Subgraphs. COCOON 2018: 428-440 - [c5]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. MFCS 2018: 67:1-67:16 - [c4]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. SWAT 2018: 24:1-24:13 - 2017
- [c3]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On Directed Covering and Domination Problems. ISAAC 2017: 45:1-45:12 - [c2]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318 - 2015
- [c1]Tesshu Hanaka, Hirotaka Ono:
A Fixed-Parameter Algorithm for Max Edge Domination. SOFSEM (Student Research Forum Papers / Posters) 2015: 31-40
Informal and Other Publications
- 2024
- [i36]Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari:
Parameterized Vertex Integrity Revisited. CoRR abs/2402.09971 (2024) - [i35]Tesshu Hanaka, Noleen Köhler, Michael Lampis:
Core Stability in Additively Separable Hedonic Games of Low Treewidth. CoRR abs/2402.10815 (2024) - 2023
- [i34]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR abs/2302.06983 (2023) - [i33]Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama:
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. CoRR abs/2303.01290 (2023) - [i32]Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama:
Shortest Beer Path Queries based on Graph Decomposition. CoRR abs/2307.02787 (2023) - [i31]Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono:
Turning Tiles is PSPACE-complete. CoRR abs/2310.01983 (2023) - [i30]Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono:
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs. CoRR abs/2310.05139 (2023) - [i29]Tesshu Hanaka, Yasuaki Kobayashi:
Finding a Minimum Spanning Tree with a Small Non-Terminal Set. CoRR abs/2310.05494 (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]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) - [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
- [i25]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) - [i24]Tesshu Hanaka, Michael Lampis:
Hedonic Games and Treewidth Revisited. CoRR abs/2202.06925 (2022) - [i23]Tesshu Hanaka:
Computing Densest k-Subgraph with Structural Parameters. CoRR abs/2207.09803 (2022) - [i22]Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. CoRR abs/2211.05307 (2022) - 2021
- [i21]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) - [i20]Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono:
Capacitated Network Design Games on a Generalized Fair Allocation Model. CoRR abs/2107.03040 (2021) - [i19]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
- [i18]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) - [i17]Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone:
An optimal algorithm for Bisection for bounded-treewidth graphs. CoRR abs/2002.12706 (2020) - [i16]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR abs/2007.04513 (2020) - [i15]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) - [i14]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi:
Finding Diverse Trees, Paths, and More. CoRR abs/2009.03687 (2020) - [i13]Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of Maximum Minimal FVS. CoRR abs/2009.09971 (2020) - [i12]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. CoRR abs/2009.10502 (2020) - [i11]Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita:
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR abs/2009.12184 (2020) - [i10]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) - 2019
- [i9]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019) - [i8]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. CoRR abs/1902.04919 (2019) - [i7]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR abs/1905.00340 (2019) - [i6]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) - [i5]Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi:
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR abs/1908.03389 (2019) - [i4]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. CoRR abs/1908.11554 (2019) - 2018
- [i3]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. CoRR abs/1803.06074 (2018) - [i2]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. CoRR abs/1807.11518 (2018) - [i1]Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
Optimal Partition of a Tree with Social Distance. CoRR abs/1809.03392 (2018)
Coauthor Index
a service of 
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-04-25 05:48 CEST 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:
