default search action
Yasuaki Kobayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j19]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. Algorithmica 86(11): 3395-3424 (2024) - [j18]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) - [c48]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 - [c47]Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM 2024: 27:1-27:19 - [c46]Yasuaki Kobayashi
, Kazuhiro Kurita
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA 2024: 232-246 - [c45]Tatsuya Gima
Structural Parameterizations of Vertex Integrity. WALCOM 2024: 406-420 - [c44]Tatsuya Gima
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM 2024: 421-435 - [i44]Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno:
Parameterized Complexity of Finding Dissimilar Shortest Paths. CoRR abs/2402.14376 (2024) - [i43]Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. CoRR abs/2405.00131 (2024) - [i42]Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa:
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR abs/2405.13613 (2024) - [i41]Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito:
Basis sequence reconfiguration in the union of matroids. CoRR abs/2409.07848 (2024) - 2023
- [j17]Masataka Nakahara, Norihiro Okui
Malware detection for IoT devices using hybrid system of whitelist and machine learning based on lightweight flow data. Enterp. Inf. Syst. 17(9) (2023) - [j16]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943: 131-141 (2023) - [c43]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 - [c42]Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi:
A Process Reduction Method for Spatial Information in Real-Time AR Snow Visualization Systems. COMPSAC 2023: 1249-1254 - [c41]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. MFCS 2023: 58:1-58:14 - [c40]Hiroki Arimura
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE 2023: 28-34 - [c39]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. WADS 2023: 521-532 - [i40]Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi:
Minimum Consistent Subset for Trees Revisited. CoRR abs/2305.07259 (2023) - [i39]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. CoRR abs/2305.07262 (2023) - [i38]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. CoRR abs/2307.08948 (2023) - [i37]Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue:
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR abs/2308.02269 (2023) - [i36]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) - [i35]Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Finding a reconfiguration sequence between longest increasing subsequences. CoRR abs/2310.01066 (2023) - [i34]Tesshu Hanaka, Yasuaki Kobayashi:
Finding a Minimum Spanning Tree with a Small Non-Terminal Set. CoRR abs/2310.05494 (2023) - [i33]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. CoRR abs/2311.05892 (2023) - [i32]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) - [i31]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
- [j15]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84(4): 871-895 (2022) - [j14]Yasuaki Kobayashi
Parameterized Complexity of Graph Burning. Algorithmica 84(8): 2379-2393 (2022) - [j13]Yasuaki Kobayashi
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. 105-D(3): 503-507 (2022) - [j12]Yuuki Aoike, Tatsuya Gima
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66(2): 502-515 (2022) - [j11]Tatsuya Gima
Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. 918: 60-76 (2022) - [c38]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 - [c37]Tatsuya Gima
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA 2022: 61:1-61:15 - [c36]Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi:
A Real-Time AR Visualization System of Snow-Covered Situations. GCCE 2022: 825-827 - [c35]Takayuki Nishio, Masataka Nakahara, Norihiro Okui
Anomaly Traffic Detection with Federated Learning toward Network-based Malware Detection in IoT. GLOBECOM 2022: 299-304 - [c34]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS 2022: 6:1-6:15 - [c33]Takehiro Ito
Independent Set Reconfiguration on Directed Graphs. MFCS 2022: 58:1-58:15 - [c32]Yasuaki Kobayashi
Linear-Delay Enumeration for Minimal Steiner Problems. PODS 2022: 301-313 - [c31]Hiroshi Eto, Takehiro Ito
Reconfiguration of Regular Induced Subgraphs. WALCOM 2022: 35-46 - [c30]Yasuaki Kobayashi
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. WG 2022: 342-355 - [i30]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) - [i29]Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi:
Finding shortest non-separating and non-disconnecting paths. CoRR abs/2202.09718 (2022) - [i28]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) - [i27]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR abs/2207.01024 (2022) - 2021
- [j10]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83(5): 1421-1458 (2021) - [j9]Tesshu Hanaka, Yasuaki Kobayashi
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. 865: 131-140 (2021) - [j8]Tesshu Hanaka, Yasuaki Kobayashi
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theor. Comput. Sci. 873: 38-46 (2021) - [c29]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi:
Finding Diverse Trees, Paths, and More. AAAI 2021: 3778-3786 - [c28]Tatsuya Gima
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC 2021: 271-285 - [c27]Takehiro Ito
Reconfiguring Directed Trees in a Digraph. COCOON 2021: 343-354 - [c26]Yasuaki Kobayashi, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi, Shinji Shimojo:
How Do Avatar Appearances Affect Communication from Others? COMPSAC 2021: 1036-1039 - [c25]Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake:
Malware Detection for IoT Devices using Automatically Generated White List and Isolation Forest. IoTBDS 2021: 38-47 - [c24]Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Takashi Ozu, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto:
Automatic Security Inspection Framework for Trustworthy Supply Chain. SERA 2021: 45-50 - [i26]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) - [i25]Yasuaki Kobayashi, Kazuhiro Kurita
Polynomial-Delay Enumeration of Large Maximal Matchings. CoRR abs/2105.04146 (2021) - [i24]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. CoRR abs/2107.03092 (2021) - [i23]Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa:
Reconfiguration of Regular Induced Subgraphs. CoRR abs/2111.13476 (2021) - [i22]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
- [j7]Hans L. Bodlaender
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica 82(12): 3566-3587 (2020) - [c23]Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi
Metric Learning for Ordered Labeled Trees with pq-grams. ECAI 2020: 1475-1482 - [c22]Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto:
Consideration on Data Conformance Toward Building Trust in Supply Chain. EuCNC 2020: 128-132 - [c21]Tesshu Hanaka
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. FAW 2020: 25-36 - [c20]Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake:
Machine Learning based Malware Traffic Detection on IoT Devices using Summarized Packet Data. IoTBDS 2020: 78-87 - [c19]Rémy Belmonte, Tesshu Hanaka
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA 2020: 43-55 - [c18]Yasuaki Kobayashi
Parameterized Complexity of Graph Burning. IPEC 2020: 21:1-21:10 - [c17]Kazuhiro Kurita
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. MFCS 2020: 60:1-60:14 - [i21]Tesshu Hanaka, Yasuaki Kobayashi
An optimal algorithm for Bisection for bounded-treewidth graphs. CoRR abs/2002.12706 (2020) - [i20]Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi
Metric Learning for Ordered Labeled Trees with pq-grams. CoRR abs/2003.03960 (2020) - [i19]Yasuaki Kobayashi
On Structural Parameterizations of Node Kayles. CoRR abs/2003.11775 (2020) - [i18]Kazuhiro Kurita
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. CoRR abs/2006.16222 (2020) - [i17]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR abs/2007.04513 (2020) - [i16]Yasuaki Kobayashi
Parameterized Complexity of Graph Burning. CoRR abs/2007.08811 (2020) - [i15]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi
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]Yasuaki Kobayashi, Kazuhiro Kurita
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. CoRR abs/2009.08830 (2020) - [i12]Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita:
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR abs/2009.12184 (2020) - [i11]Yasuaki Kobayashi, Yu Nakahata:
A Note on Exponential-Time Algorithms for Linearwidth. CoRR abs/2010.02388 (2020) - [i10]Yasuaki Kobayashi, Kazuhiro Kurita
Polynomial Delay Enumeration for Minimal Steiner Problems. CoRR abs/2010.11462 (2020) - [i9]Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR abs/2012.04910 (2020)
2010 – 2019
- 2019
- [c16]Yasuaki Kobayashi
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. COCOA 2019: 303-315 - [c15]Yusuke Shido, Yasuaki Kobayashi
Automatic Source Code Summarization with Extended Tree-LSTM. IJCNN 2019: 1-8 - [c14]Yasuaki Kobayashi
On the Complexity of Lattice Puzzles. ISAAC 2019: 32:1-32:12 - [c13]Yasuaki Kobayashi
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA 2019: 327-338 - [c12]Hiroshi Eto, Tesshu Hanaka
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC 2019: 13:1-13:15 - [c11]Shinsaku Kiyomoto, Yuto Nakano, Atsushi Waseda, Toru Nakamura, Masahito Ishizaka, Yasuaki Kobayashi:
A Framework for Secure and Trustworthy Data Management in Supply Chain. MobiWIS 2019: 148-159 - [i8]Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR abs/1904.05011 (2019) - [i7]Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR abs/1905.10670 (2019) - [i6]Yusuke Shido, Yasuaki Kobayashi, Akihiro Yamamoto, Atsushi Miyamoto, Tadayuki Matsumura:
Automatic Source Code Summarization with Extended Tree-LSTM. CoRR abs/1906.08094 (2019) - [i5]Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi:
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR abs/1908.03389 (2019) - [i4]Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto:
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. CoRR abs/1910.07305 (2019) - 2018
- [c10]Yasuaki Kobayashi
On Structural Parameterizations of Node Kayles. JCDCGGG 2018: 96-105 - 2017
- [c9]Eunpyeong Hong, Yasuaki Kobayashi
Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming. COCOA (2) 2017: 45-60 - [c8]Yasuaki Kobayashi
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. IPEC 2017: 25:1-25:12 - [i3]Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto:
Improved Methods for Computing Distances between Unordered Trees Using Integer Programming. CoRR abs/1706.03473 (2017) - 2016
- [j6]Kenta Kitsunai, Yasuaki Kobayashi
Computing Directed Pathwidth in O(1.89n) Time. Algorithmica 75(1): 138-157 (2016) - [j5]Yasuaki Kobayashi
A faster fixed parameter algorithm for two-layer crossing minimization. Inf. Process. Lett. 116(9): 547-549 (2016) - [c7]Yasuaki Kobayashi
Treedepth Parameterized by Vertex Cover Number. IPEC 2016: 18:1-18:11 - 2015
- [j4]Yasuaki Kobayashi
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. Algorithmica 72(3): 778-790 (2015) - [j3]Yasuaki Kobayashi
Computing the pathwidth of directed graphs with small vertex cover. Inf. Process. Lett. 115(2): 310-312 (2015) - [c6]Kenta Kitsunai, Yasuaki Kobayashi
On the Pathwidth of Almost Semicomplete Digraphs. ESA 2015: 816-827 - [i2]Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki:
On the pathwidth of almost semicomplete digraphs. CoRR abs/1507.01934 (2015) - [i1]Yasuaki Kobayashi, Hisao Tamaki:
A faster fixed parameter algorithm for two-layer crossing minimization. CoRR abs/1512.05876 (2015) - 2014
- [j2]Yasuaki Kobayashi
A linear edge kernel for two-layer crossing minimization. Theor. Comput. Sci. 554: 74-81 (2014) - [c5]Yasuaki Kobayashi
Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study. SEA 2014: 388-399 - 2013
- [c4]Yasuaki Kobayashi
A Linear Edge Kernel for Two-Layer Crossing Minimization. COCOON 2013: 458-468 - 2012
- [c3]Yasuaki Kobayashi
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. ESA 2012: 683-694 - [c2]Kenta Kitsunai, Yasuaki Kobayashi
Computing Directed Pathwidth in O(1.89 n ) Time. IPEC 2012: 182-193 - 2010
- [c1]Yasuaki Kobayashi
k-cyclic Orientations of Graphs. ISAAC (2) 2010: 73-84
1990 – 1999
- 1994
- [j1]Yasuhiro Takai, Mamoru Nagase, Mamoru Kitamura, Yasuji Koshikawa, Naoyuki Yoshida, Yasuaki Kobayashi, Takashi Obara, Yukio Fukuzo, Hiroshi Watanabe:
250 Mbyte/s synchronous DRAM using a 3-stage-pipelined architecture. IEEE J. Solid State Circuits 29(4): 426-431 (1994)
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-25 20:15 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: