default search action
Charalampos E. Tsourakakis
Babis Tsourakakis
Person information
- affiliation: Boston University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c56]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
On the Role of Edge Dependency in Graph Generative Models. ICML 2024 - [c55]Dragos Ristache, Fabian Spaeh, Charalampos E. Tsourakakis:
Wiser than the Wisest of Crowds: The Asch Effect and Polarization Revisited. ECML/PKDD (5) 2024: 440-458 - [c54]Petros Petsinis
, Charalampos E. Tsourakakis
Finding Dense and Persistently Expansive Subgraphs. WWW (Companion Volume) 2024: 553-556 - [c53]Fabian Spaeh
Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures. WWW 2024: 4160-4171 - [i45]Fabian Spaeh, Charalampos E. Tsourakakis:
Markovletics: Methods and A Novel Application for Learning Continuous-Time Markov Chain Mixtures. CoRR abs/2402.17730 (2024) - [i44]Fabian Spaeh, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
ULTRA-MC: A Unified Approach to Learning Mixtures of Markov Chains via Hitting Times. CoRR abs/2405.15094 (2024) - [i43]Dragos Ristache, Fabian Spaeh, Charalampos E. Tsourakakis:
Wiser than the Wisest of Crowds: The Asch Effect Revisited under Friedkin-Johnsen Opinion Dynamics. CoRR abs/2406.07805 (2024) - [i42]Charalampos E. Tsourakakis:
A Note on Computing Betweenness Centrality from the 2-core. CoRR abs/2408.01157 (2024) - [i41]Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis:
Targeted Least Cardinality Candidate Key for Relational Databases. CoRR abs/2408.13540 (2024) - 2023
- [c52]Atsushi Miyauchi
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. KDD 2023: 1710-1721 - [c51]Iden Kalemaj
Node-Differentially Private Estimation of the Number of Connected Components. PODS 2023: 183-194 - [c50]Fabian Spaeh
Learning Mixtures of Markov Chains with Quality Guarantees. WWW 2023: 662-672 - [i40]Fabian Spaeh, Charalampos E. Tsourakakis:
Learning Mixtures of Markov Chains with Quality Guarantees. CoRR abs/2302.04680 (2023) - [i39]Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis:
Node-Differentially Private Estimation of the Number of Connected Components. CoRR abs/2304.05890 (2023) - [i38]Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. CoRR abs/2306.02338 (2023) - [i37]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
On the Role of Edge Dependency in Graph Generative Models. CoRR abs/2312.03691 (2023) - 2022
- [j19]Adriano Fazzone, Tommaso Lanciano, Riccardo Denni, Charalampos E. Tsourakakis
Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers. Proc. VLDB Endow. 15(13): 3883-3896 (2022) - [j18]Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search. ACM Trans. Knowl. Discov. Data 16(2): 33:1-33:34 (2022) - [c49]Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar:
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. ICML 2022: 17071-17093 - [c48]Tianyi Chen, Charalampos E. Tsourakakis:
AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks. KDD 2022: 2762-2770 - [c47]Tianyi Chen, Brian Matejek, Michael Mitzenmacher, Charalampos E. Tsourakakis:
Algorithmic Tools for Understanding the Motif Structure of Networks. ECML/PKDD (2) 2022: 3-19 - [c46]Tianyi Chen, Francesco Bonchi, David García-Soriano
Dense and well-connected subgraph detection in dual networks. SDM 2022: 361-369 - [c45]Tianyi Chen, Xu Wang, Charalampos E. Tsourakakis:
Polarizing Opinion Dynamics with Confirmation Bias. SocInfo 2022: 144-158 - [i36]Tianyi Chen
AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks. CoRR abs/2205.13426 (2022) - 2021
- [j17]Francesco Bonchi
Finding densest k-connected subgraphs. Discret. Appl. Math. 305: 34-47 (2021) - [c44]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
DeepWalking Backwards: From Embeddings Back to Graphs. ICML 2021: 1473-1483 - [c43]Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
Triangle-aware Spectral Sparsifiers and Community Detection. KDD 2021: 1501-1509 - [c42]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
On the Power of Edge Independent Graph Models. NeurIPS 2021: 24418-24429 - [c41]Michele Starnini, Charalampos E. Tsourakakis, Maryam Zamanipour, André Panisson
Smurf-Based Anti-money Laundering in Time-Evolving Transaction Networks. ECML/PKDD (4) 2021: 171-186 - [i35]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
DeepWalking Backwards: From Embeddings Back to Graphs. CoRR abs/2102.08532 (2021) - [i34]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
On the Power of Edge Independent Graph Models. CoRR abs/2111.00048 (2021) - [i33]Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Dense and well-connected subgraph detection in dual networks. CoRR abs/2112.03337 (2021) - 2020
- [c40]Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis:
Optimal Learning of Joint Alignments with a Faulty Oracle. ISIT 2020: 2492-2497 - [c39]Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis:
Optimal Learning of Joint Alignments with a Faulty Oracle. ITA 2020: 1-10 - [c38]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
Node Embeddings and Exact Low-Rank Representations of Complex Networks. NeurIPS 2020 - [c37]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW 2020: 573-583 - [c36]David García-Soriano
Query-Efficient Correlation Clustering. WWW 2020: 1468-1478 - [c35]Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis:
Clustering with a faulty oracle. WWW 2020: 2831-2834 - [i32]David García-Soriano, Konstantin Kutzkov, Francesco Bonchi, Charalampos E. Tsourakakis:
Query-Efficient Correlation Clustering. CoRR abs/2002.11557 (2020) - [i31]Michael Mitzenmacher, Charalampos E. Tsourakakis:
Joint Alignment From Pairwise Differences with a Noisy Oracle. CoRR abs/2003.06076 (2020) - [i30]Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
Node Embeddings and Exact Low-Rank Representations of Complex Networks. CoRR abs/2006.05592 (2020) - [i29]Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding Densest k-Connected Subgraphs. CoRR abs/2007.01533 (2020) - [i28]Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis:
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. CoRR abs/2011.02583 (2020)
2010 – 2019
- 2019
- [c34]Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis, Charalampos E. Tsourakakis:
TwitterMancer: Predicting User Interactions on Twitter. Allerton 2019: 973-980 - [c33]Charalampos E. Tsourakakis, Tianyi Chen
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. ECML/PKDD (1) 2019: 378-394 - [i27]Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki:
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. CoRR abs/1904.08178 (2019) - [i26]Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis, Charalampos E. Tsourakakis:
TwitterMancer: Predicting Interactions on Twitter Accurately. CoRR abs/1904.11119 (2019) - [i25]Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis:
Optimal Learning of Joint Alignments with a Faulty Oracle. CoRR abs/1909.09912 (2019) - [i24]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR abs/1910.07087 (2019) - 2018
- [c32]Rediet Abebe, Jon M. Kleinberg, David C. Parkes, Charalampos E. Tsourakakis
Opinion Dynamics with Varying Susceptibility to Persuasion. KDD 2018: 1089-1098 - [c31]Jeremy G. Hoskins, Cameron Musco, Christopher Musco
Inferring Networks From Random Walk-Based Node Similarities. NeurIPS 2018: 3708-3719 - [c30]Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang:
Risk-Averse Matchings over Uncertain Graph Databases. ECML/PKDD (2) 2018: 71-87 - [c29]Michael Mitzenmacher, Charalampos E. Tsourakakis:
Joint Alignment from Pairwise Differences with a Noisy Oracle. WAW 2018: 59-69 - [c28]Cameron Musco, Christopher Musco
Minimizing Polarization and Disagreement in Social Networks. WWW 2018: 369-378 - [i23]Charalampos E. Tsourakakis, Shreyas Sekar, Johnson Lam, Liu Yang:
Risk-Averse Matchings over Uncertain Graph Databases. CoRR abs/1801.03190 (2018) - [i22]Jeremy G. Hoskins, Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis:
Learning Networks from Random Walk-Based Node Similarities. CoRR abs/1801.07386 (2018) - [i21]Rediet Abebe, Jon M. Kleinberg, David C. Parkes, Charalampos E. Tsourakakis:
Opinion Dynamics with Varying Susceptibility to Persuasion. CoRR abs/1801.07863 (2018) - 2017
- [c27]Charalampos E. Tsourakakis
Scalable Motif-aware Graph Clustering. WWW 2017: 1451-1460 - [i20]Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos:
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR abs/1709.07308 (2017) - [i19]Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis:
Minimizing Polarization and Disagreement in Social Networks. CoRR abs/1712.09948 (2017) - 2016
- [j16]Chen Chen
Node Immunization on Large Graphs: Theory and Algorithms. IEEE Trans. Knowl. Data Eng. 28(1): 113-126 (2016) - [c26]Charalampos E. Tsourakakis
Motif-driven graph analysis. Allerton 2016: 891-893 - [c25]Jaroslaw Blasiok, Charalampos E. Tsourakakis
ADAGIO: Fast Data-Aware Near-Isometric Linear Embeddings. ICDM 2016: 31-40 - [c24]Ahmad Mahmoody, Charalampos E. Tsourakakis
Scalable Betweenness Centrality Maximization via Sampling. KDD 2016: 1765-1773 - [i18]Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher:
Scalable motif-aware graph clustering. CoRR abs/1606.06235 (2016) - [i17]Michael Mitzenmacher, Charalampos E. Tsourakakis:
Predicting Signed Edges with O(n log n) Queries. CoRR abs/1609.00750 (2016) - [i16]Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal:
Scalable Betweenness Centrality Maximization via Sampling. CoRR abs/1609.00790 (2016) - [i15]Jaroslaw Blasiok, Charalampos E. Tsourakakis:
ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings. CoRR abs/1609.05388 (2016) - 2015
- [j15]Andrzej Dudek, Alan M. Frieze
Rainbow Connection of Random Regular Graphs. SIAM J. Discret. Math. 29(4): 2255-2266 (2015) - [j14]Francesco Bonchi, Aristides Gionis, Francesco Gullo
Chromatic Correlation Clustering. ACM Trans. Knowl. Discov. Data 9(4): 34:1-34:24 (2015) - [c23]Charalampos E. Tsourakakis
Streaming Graph Partitioning in the Planted Partition Model. COSN 2015: 27-35 - [c22]Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. KDD 2015: 815-824 - [c21]Aristides Gionis, Charalampos E. Tsourakakis
Dense Subgraph Discovery: KDD 2015 tutorial. KDD 2015: 2313-2314 - [c20]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC 2015: 173-182 - [c19]Charalampos E. Tsourakakis
Provably Fast Inference of Latent Features from Networks: with Applications to Learning Social Circles and Multilabel Classification. WWW 2015: 1111-1121 - [c18]Charalampos E. Tsourakakis
The K-clique Densest Subgraph Problem. WWW 2015: 1122-1132 - [i14]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. CoRR abs/1504.02268 (2015) - 2014
- [j13]Alan M. Frieze, Charalampos E. Tsourakakis
Some Properties of Random Apollonian Networks. Internet Math. 10(1-2): 162-187 (2014) - [j12]Charalampos E. Tsourakakis
Toward Quantifying Vertex Similarity in Networks. Internet Math. 10(3-4): 263-286 (2014) - [c17]George Nychis, Charalampos E. Tsourakakis
Centralized, measurement-based, spectrum management for environments with heterogeneous wireless networks. DySPAN 2014: 303-314 - [c16]Charalampos E. Tsourakakis
FENNEL: streaming graph partitioning for massive scale graphs. WSDM 2014: 333-342 - [p2]Charalampos E. Tsourakakis
PEGASUS: A System for Large-Scale Graph Processing. Large Scale and Big Data 2014: 255-286 - [i13]Charalampos E. Tsourakakis:
A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem. CoRR abs/1405.1477 (2014) - [i12]Charalampos E. Tsourakakis:
Streaming Graph Partitioning in the Planted Partition Model. CoRR abs/1406.7570 (2014) - [i11]Charalampos E. Tsourakakis:
Mathematical and Algorithmic Analysis of Network and Biological Data. CoRR abs/1407.0375 (2014) - 2013
- [c15]Charalampos E. Tsourakakis
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. KDD 2013: 104-112 - [c14]Alan M. Frieze, Aristides Gionis, Charalampos E. Tsourakakis
Algorithmic techniques for modeling and mining large graphs (AMAzING). KDD 2013: 1523 - [c13]Charalampos E. Tsourakakis:
Modeling Intratumor Gene Copy Number Heterogeneity Using Fluorescence in Situ Hybridization Data. WABI 2013: 313-325 - 2012
- [j11]Alan M. Frieze, Charalampos E. Tsourakakis
Rainbow Connection of Sparse Random Graphs. Electron. J. Comb. 19(4): 5 (2012) - [j10]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Math. 8(1-2): 161-185 (2012) - [j9]Rasmus Pagh, Charalampos E. Tsourakakis
Colorful triangle counting and a MapReduce implementation. Inf. Process. Lett. 112(7): 277-281 (2012) - [c12]Alan M. Frieze, Charalampos E. Tsourakakis:
Rainbow Connectivity of Sparse Random Graphs. APPROX-RANDOM 2012: 541-552 - [c11]Alan M. Frieze, Charalampos E. Tsourakakis:
On Certain Properties of Random Apollonian Networks. WAW 2012: 93-112 - [i10]Alan M. Frieze, Charalampos E. Tsourakakis:
Rainbow Connectivity of Sparse Random Graphs. CoRR abs/1201.4603 (2012) - [i9]Charalampos E. Tsourakakis:
Perfect Reconstruction of Oncogenetic Trees. CoRR abs/1201.4618 (2012) - 2011
- [j8]Charalampos E. Tsourakakis
Approximation algorithms for speeding up dynamic programming and denoising aCGH data. ACM J. Exp. Algorithmics 16 (2011) - [j7]Charalampos E. Tsourakakis
Triangle Sparsifiers. J. Graph Algorithms Appl. 15(6): 703-726 (2011) - [j6]Charalampos E. Tsourakakis
Counting triangles in real-world networks using projections. Knowl. Inf. Syst. 26(3): 501-520 (2011) - [j5]U Kang, Charalampos E. Tsourakakis
PEGASUS: mining peta-scale graphs. Knowl. Inf. Syst. 27(2): 303-325 (2011) - [j4]Charalampos E. Tsourakakis
Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Soc. Netw. Anal. Min. 1(2): 75-81 (2011) - [j3]U Kang, Charalampos E. Tsourakakis
HADI: Mining Radii of Large Graphs. ACM Trans. Knowl. Discov. Data 5(2): 8:1-8:24 (2011) - [c10]Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis
Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. SODA 2011: 1675-1682 - [p1]Charalampos E. Tsourakakis
Large Scale Graph Mining with MapReduce: Counting Triangles in Large Real Networks. Graph Data Management 2011: 299-314 - [i8]Rasmus Pagh, Charalampos E. Tsourakakis:
Colorful Triangle Counting and a MapReduce Implementation. CoRR abs/1103.6073 (2011) - [i7]Alan M. Frieze, Charalampos E. Tsourakakis:
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks. CoRR abs/1104.5259 (2011) - [i6]Charalampos E. Tsourakakis:
The Degree Sequence of Random Apollonian Networks. CoRR abs/1106.1940 (2011) - [i5]Charalampos E. Tsourakakis:
Social Network Archetypes and Vertex Similarity, Graph Matching and the Generalized Eigenvalue Problem. CoRR abs/1110.2813 (2011) - 2010
- [j2]David Tolliver, Charalampos E. Tsourakakis
Robust unmixing of tumor states in array comparative genomic hybridization data. Bioinform. 26(12): 106-114 (2010) - [c9]Hanghang Tong
On the Vulnerability of Large Graphs. ICDM 2010: 1091-1096 - [c8]U Kang, Charalampos E. Tsourakakis
Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations. SDM 2010: 548-558 - [c7]Charalampos E. Tsourakakis
MACH: Fast Randomized Tensor Decompositions. SDM 2010: 689-700 - [c6]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis:
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. WAW 2010: 15-24 - [i4]Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis:
Approximate Dynamic Programming for Fast Denoising of aCGH Data. CoRR abs/1003.4942 (2010) - [i3]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis:
Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. CoRR abs/1011.0468 (2010)
2000 – 2009
- 2009
- [c5]Charalampos E. Tsourakakis
Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification. ASONAM 2009: 66-71 - [c4]U Kang, Charalampos E. Tsourakakis
PEGASUS: A Peta-Scale Graph Mining System. ICDM 2009: 229-238 - [c3]Charalampos E. Tsourakakis
DOULION: counting triangles in massive graphs with a coin. KDD 2009: 837-846 - [i2]Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller:
Approximate Triangle Counting. CoRR abs/0904.3761 (2009) - [i1]Charalampos E. Tsourakakis:
MACH: Fast Randomized Tensor Decompositions. CoRR abs/0909.4969 (2009) - 2008
- [j1]Jimeng Sun
Two heads better than one: pattern discovery in time-evolving multi-aspect data. Data Min. Knowl. Discov. 17(1): 111-128 (2008) - [c2]Charalampos E. Tsourakakis
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws. ICDM 2008: 608-617 - [c1]Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke, Christos Faloutsos
Two Heads Better Than One: Pattern Discovery in Time-Evolving Multi-aspect Data. ECML/PKDD (1) 2008: 22
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-09-30 00:10 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: