default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakashi Horiyama
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j37]Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. IEICE Trans. Inf. Syst. 107(6): 732-740 (2024)- [c42]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 - [c41]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest Cover After Edit. CPM 2024: 24:1-24:15 - [i17]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest cover after edit. CoRR abs/2402.17428 (2024) - [i16]Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama:
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. CoRR abs/2409.19576 (2024) - 2023
- [j36]Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
:
Efficient Folding Algorithms for Convex Polyhedra. Discret. Comput. Geom. 70(4): 1499-1522 (2023) - [j35]Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno:
Enumerating Empty and Surrounding Polygons. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1082-1091 (2023) - [j34]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Finding top-k longest palindromes in substrings. Theor. Comput. Sci. 979: 114183 (2023) - [c40]Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG 2023: 191-196 - [c39]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. WALCOM 2023: 127-138 - [i15]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) - 2022
- [j33]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient segment folding is hard. Comput. Geom. 104: 101860 (2022) - [c38]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM 2022: 26:1-26:17 - [i14]Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama, Jun Kawahara, Ichigaku Takigawa, Yutaro Yamaguchi:
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. CoRR abs/2201.08118 (2022) - [i13]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR abs/2202.08447 (2022) - [i12]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. CoRR abs/2210.02000 (2022) - 2021
- [j32]Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi:
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303: 305-313 (2021) - [j31]Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1101-1107 (2021) - [j30]Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest common subsequence in sublinear space. Inf. Process. Lett. 168: 106084 (2021) - [j29]Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa:
Optimal reconfiguration of optimal ladder lotteries. Theor. Comput. Sci. 859: 57-69 (2021) - [i11]Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara:
Efficient Folding Algorithms for Regular Polyhedra. CoRR abs/2105.14305 (2021) - [i10]Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda:
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. CoRR abs/2110.05184 (2021) - 2020
- [j28]Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
Efficient Algorithm for Box Folding. J. Graph Algorithms Appl. 24(2): 89-103 (2020) - [j27]Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi:
Rigid foldability is NP-hard. J. Comput. Geom. 11(1): 93-124 (2020) - [c37]Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara:
Efficient Folding Algorithms for Regular Polyhedra. CCCG 2020: 121-127 - [c36]Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato:
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. WALCOM 2020: 211-222 - [i9]Yu Nakahata, Takashi Horiyama, Shin-ichi Minato, Katsuhisa Yamanaka:
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization. CoRR abs/2001.08899 (2020) - [i8]Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest Common Subsequence in Sublinear Space. CoRR abs/2009.08588 (2020) - [i7]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient Segment Folding is Hard. CoRR abs/2012.11062 (2020)
2010 – 2019
- 2019
- [j26]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23(1): 3-27 (2019) - [c35]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Ecient Segment Folding is Hard. CCCG 2019: 177-183 - [c34]Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. COCOON 2019: 291-300 - [c33]Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
Efficient Algorithm for Box Folding. WALCOM 2019: 277-288 - [i6]Takashi Horiyama, Jun Kawahara, Shin-ichi Minato, Yu Nakahata:
Decomposing a Graph into Unigraphs. CoRR abs/1904.09438 (2019) - [i5]Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato:
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. CoRR abs/1911.07465 (2019) - [i4]Seri Nishimoto, Takashi Horiyama, Tomohiro Tachi:
Geodesic Folding of Tetrahedron. CoRR abs/1912.01227 (2019) - 2018
- [j25]Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara:
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1363-1374 (2018) - [j24]Dawei Xu, Jinfeng Huang, Yuta Nakane, Tomoo Yokoyama, Takashi Horiyama, Ryuhei Uehara:
Rep-Cubes: Dissection of a Cube into Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1420-1430 (2018) - [j23]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) - [c32]Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa:
Ladder-Lottery Realization. CCCG 2018: 61-67 - [c31]Takashi Horiyama, Masahiro Miyasaka, Riku Sasaki:
Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams. CCCG 2018: 360-366 - [c30]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 - [c29]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 - [i3]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) - [i2]Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Takashi Horiyama, Ayumi Shinohara:
Enumerating Cryptarithms Using Deterministic Finite Automata. CoRR abs/1807.11580 (2018) - [i1]Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi:
Rigid Foldability is NP-Hard. CoRR abs/1812.01160 (2018) - 2017
- [j22]Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara:
Common developments of three incongruent boxes of area 30. Comput. Geom. 64: 1-12 (2017) - [j21]Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Complexity of Tiling a Polygon with Trominoes or Bars. Discret. Comput. Geom. 58(3): 686-704 (2017) - [j20]Takashi Horiyama:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1763 (2017) - [j19]Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi:
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. 25: 708-715 (2017) - [c28]Dawei Xu, Takashi Horiyama, Ryuhei Uehara:
Rep-cubes: Unfolding and Dissection of Cubes. CCCG 2017: 62-67 - [c27]Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato:
Generating All Patterns of Graph Partitions Within a Disparity Bound. WALCOM 2017: 119-131 - [c26]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. WALCOM 2017: 435-447 - 2016
- [j18]Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara:
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. J. Graph Algorithms Appl. 20(1): 101-114 (2016) - [c25]Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya:
Convex Configurations on Nana-kin-san Puzzle. FUN 2016: 20:1-20:14 - 2015
- [c24]Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara:
Continuous Folding of Regular Dodecahedra. JCDCGG 2015: 120-131 - [c23]Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara:
Box Pleating is Hard. JCDCGG 2015: 167-179 - [c22]Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara:
Common Developments of Three Incongruent Boxes of Area 30. TAMC 2015: 236-247 - [c21]Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. WADS 2015: 619-628 - [c20]Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara:
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. WALCOM 2015: 294-305 - 2014
- [j17]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara:
Computational Complexity of Piano-Hinged Dissections. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1206-1212 (2014) - [j16]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) - [c19]Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi:
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN 2014: 230-239 - 2013
- [j15]Takashi Horiyama:
Foreword. IEICE Trans. Inf. Syst. 96-D(3): 399 (2013) - [c18]Takashi Horiyama, Wataru Shoji:
The Number of Different Unfoldings of Polyhedra. ISAAC 2013: 623-633 - [c17]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 - 2012
- [j14]Xin Man, Takashi Horiyama, Shinji Kimura:
Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(8): 1347-1358 (2012) - [c16]Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. CCCG 2012: 211-216 - 2011
- [c15]Takashi Horiyama, Wataru Shoji:
Edge Unfoldings of Platonic Solids Never Overlap. CCCG 2011 - 2010
- [j13]Xin Man, Takashi Horiyama, Shinji Kimura:
Power Optimization of Sequential Circuits Using Switching Activity Based Clock Gating. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(12): 2472-2480 (2010) - [c14]Takashi Horiyama, Shogo Yamane:
Generation of Polyiamonds for p6 Tiling by the Reverse Search. CGGA 2010: 96-107
2000 – 2009
- 2009
- [c13]Takashi Horiyama, Masato Samejima:
Enumeration of Polyominoes for p4 Tiling. CCCG 2009: 29-32 - 2008
- [j12]Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki:
New Graph Calculi for Planar Non-3-Colorable Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2301-2307 (2008) - [j11]Lei Chen, Takashi Horiyama, Yuichi Nakamura, Shinji Kimura:
Fine-Grained Power Gating Based on the Controlling Value of Logic Elements. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(12): 3531-3538 (2008) - 2006
- [j10]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) - [j9]Youichi Hanatani, Takashi Horiyama, Kazuo Iwama:
Density condensation of Boolean formulas. Discret. Appl. Math. 154(16): 2263-2270 (2006) - [j8]Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura:
Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(12): 3427-3434 (2006) - [c12]Takashi Horiyama, Kazuo Iwama, Jun Kawahara:
Finite-State Online Algorithms and Their Automated Competitive Analysis. ISAAC 2006: 71-80 - 2004
- [j7]Takashi Horiyama, Toshihide Ibaraki:
Reasoning with ordered binary decision diagrams. Discret. Appl. Math. 142(1-3): 151-163 (2004) - [c11]Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura:
Minimization of fractional wordlength on fixed-point conversion for high-level synthesis. ASP-DAC 2004: 80-85 - [c10]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
- [j6]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39(3): 223-257 (2003) - [j5]Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura, Katsumasa Watanabe:
Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(12): 3184-3191 (2003) - [j4]Takashi Horiyama, Toshihide Ibaraki:
Translation among CNFs, characteristic models and ordered binary decision diagrams. Inf. Process. Lett. 85(4): 191-198 (2003) - [c9]Youichi Hanatani, Takashi Horiyama, Kazuo Iwama:
Density Condensation of Boolean Formulas. SAT 2003: 69-77 - 2002
- [j3]Takashi Horiyama, Toshihide Ibaraki:
Ordered binary decision diagrams as knowledge-bases. Artif. Intell. 136(2): 189-213 (2002) - [j2]Shinji Kimura, Atsushi Ishii, Takashi Horiyama, Masaki Nakanishi, Hirotsugu Kajihara, Katsumasa Watanabe:
Look Up Table Compaction Based on Folding of Logic Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(12): 2701-2707 (2002) - [c8]Shinji Kimura, Takashi Horiyama, Masaki Nakanishi, Hirotsugu Kajihara:
Folding of logic functions and its application to look up table compaction. ICCAD 2002: 694-697 - 2001
- [c7]Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe:
A real-time 64-monosyllable recognition LSI with learning mechanism. ASP-DAC 2001: 31-32 - [c6]Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe:
Speech recognition chip for monosyllables. ASP-DAC 2001: 396-399 - [c5]Takashi Horiyama, Toshihide Ibaraki:
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. ISAAC 2001: 231-243 - 2000
- [c4]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138 - [c3]Takashi Horiyama, Toshihide Ibaraki:
Reasoning with Ordered Binary Decision Diagrams. ISAAC 2000: 120-131
1990 – 1999
- 1999
- [j1]Naofumi Takagi, Takashi Horiyama:
A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival. IEEE Trans. Computers 48(1): 76-80 (1999) - [c2]Takashi Horiyama, Toshihide Ibaraki:
Ordered Binary Decision Diagrams as Knowledge-Bases. ISAAC 1999: 83-92 - 1997
- [c1]Takashi Horiyama, Shuzo Yajima:
Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion. ISAAC 1997: 163-172
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-10-18 19:32 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:
