default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Schweitzer
Person information
- affiliation: TU Darmstadt, Germany
- affiliation (former): TU Kaiserslautern, Department of Computer Science, Germany
- affiliation (former): RWTH Aachen University, Germany
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
SPARQL queries 
🛈 Please note that only 72% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j33]Irene Heinrich, Thomas Schneider, Pascal Schweitzer
:
Classification of Finite Highly Regular Vertex-Colored Graphs. SIAM J. Discret. Math. 39(1): 413-448 (2025)- [c48]Moritz Lichter, Simon Raßmann, Pascal Schweitzer:
Computational Complexity of the Weisfeiler-Leman Dimension. CSL 2025: 13:1-13:22 - [c47]Simon Raßmann, Georg Schindling, Pascal Schweitzer:
Finite Variable Counting Logics with Restricted Requantification. CSL 2025: 14:1-14:23 - 2024
- [j32]Moritz Lichter, Pascal Schweitzer:
Choiceless Polynomial Time with Witnessed Symmetric Choice. J. ACM 71(2): 7:1-7:70 (2024) - [c46]Irene Heinrich, Eda Kaja, Pascal Schweitzer:
Finite Vertex-Colored Ultrahomogeneous Oriented Graphs. WG 2024: 251-265 - [i41]Moritz Lichter, Simon Raßmann, Pascal Schweitzer:
Computational complexity of the Weisfeiler-Leman dimension. CoRR abs/2402.11531 (2024) - [i40]Thomas Schneider, Pascal Schweitzer:
An Upper Bound on the Weisfeiler-Leman Dimension. CoRR abs/2403.12581 (2024) - [i39]Irene Heinrich, Eda Kaja, Pascal Schweitzer:
Finite Vertex-colored Ultrahomogeneous Oriented Graphs. CoRR abs/2408.07162 (2024) - [i38]Simon Raßmann, Georg Schindling, Pascal Schweitzer:
Finite Variable Counting Logics with Restricted Requantification. CoRR abs/2411.06944 (2024) - 2023
- [j31]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. 52(6): S18-1 (2023) - [j30]Billy Joe Franks, Markus Anders, Marius Kloft, Pascal Schweitzer:
A Systematic Approach to Universal Random Features in Graph Neural Networks. Trans. Mach. Learn. Res. 2023 (2023) - [c45]Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer:
Exploration of Graphs with Excluded Minors. ESA 2023: 11:1-11:15 - [c44]Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS 2023: 798-809 - [c43]Markus Anders, Pascal Schweitzer, Mate Soos:
Algorithms Transcending the SAT-Symmetry Interface. SAT 2023: 1:1-1:21 - [c42]Markus Anders, Pascal Schweitzer, Julian Stieß:
Engineering a Preprocessor for Symmetry Detection. SEA 2023: 1:1-1:21 - [i37]Markus Anders, Pascal Schweitzer, Julian Stieß:
Engineering a Preprocessor for Symmetry Detection. CoRR abs/2302.06351 (2023) - [i36]Markus Anders, Pascal Schweitzer, Mate Soos:
Algorithms Transcending the SAT-Symmetry Interface. CoRR abs/2306.00613 (2023) - [i35]Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer:
Exploration of graphs with excluded minors. CoRR abs/2308.06823 (2023) - [i34]Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR abs/2308.11970 (2023) - 2022
- [j29]Sandra Kiefer, Pascal Schweitzer, Erkal Selman:
Graphs Identified by Logics with Counting. ACM Trans. Comput. Log. 23(1): 1:1-1:31 (2022) - [c41]Jendrik Brachter, Pascal Schweitzer:
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. ESA 2022: 27:1-27:14 - [c40]Moritz Lichter, Pascal Schweitzer:
Choiceless Polynomial Time with Witnessed Symmetric Choice. LICS 2022: 30:1-30:13 - [i33]Moritz Lichter, Pascal Schweitzer:
Choiceless Polynomial Time with Witnessed Symmetric Choice. CoRR abs/2205.14003 (2022) - 2021
- [j28]Pascal Schweitzer:
Technical perspective: A logical step toward the graph isomorphism problem. Commun. ACM 64(5): 97 (2021) - [c39]Markus Anders, Pascal Schweitzer:
Engineering a Fast Probabilistic Isomorphism Test. ALENEX 2021: 73-84 - [c38]Moritz Lichter, Pascal Schweitzer:
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CSL 2021: 31:1-31:18 - [c37]Markus Anders, Pascal Schweitzer:
Parallel Computation of Combinatorial Symmetries. ESA 2021: 6:1-6:18 - [c36]Markus Anders, Pascal Schweitzer, Florian Wetzels:
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. ICALP 2021: 15:1-15:15 - [c35]Markus Anders, Pascal Schweitzer:
Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms. ICALP 2021: 16:1-16:21 - [c34]Markus Anders, Jendrik Brachter, Pascal Schweitzer:
A Characterization of Individualization-Refinement Trees. ISAAC 2021: 24:1-24:14 - [c33]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Deep Weisfeiler Leman. SODA 2021: 2600-2614 - [c32]Pascal Schweitzer, Constantin Seebach:
Resolution with Symmetry Rule Applied to Linear Equations. STACS 2021: 58:1-58:16 - [i32]Pascal Schweitzer, Constantin Seebach:
Resolution with Symmetry Rule applied to Linear Equations. CoRR abs/2101.05142 (2021) - [i31]Markus Anders, Pascal Schweitzer, Florian Wetzels:
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. CoRR abs/2103.10244 (2021) - [i30]Markus Anders, Pascal Schweitzer:
Parallel Computation of Combinatorial Symmetries. CoRR abs/2108.04590 (2021) - [i29]Markus Anders, Jendrik Brachter, Pascal Schweitzer:
A Characterization of Individualization-Refinement Trees. CoRR abs/2109.07302 (2021) - [i28]Billy Joe Franks, Markus Anders, Marius Kloft, Pascal Schweitzer:
Trainability for Universal GNNs Through Surgical Randomness. CoRR abs/2112.04314 (2021) - 2020
- [j27]Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer:
Stochastic Dominance and the Bijective Ratio of Online Algorithms. Algorithmica 82(5): 1101-1135 (2020) - [j26]Martin Grohe, Pascal Schweitzer:
The graph isomorphism problem. Commun. ACM 63(11): 128-134 (2020) - [j25]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) - [j24]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16(3): 34:1-34:31 (2020) - [c31]Jendrik Brachter, Pascal Schweitzer:
On the Weisfeiler-Leman Dimension of Finite Groups. LICS 2020: 287-300 - [i27]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Deep Weisfeiler Leman. CoRR abs/2003.10935 (2020) - [i26]Jendrik Brachter, Pascal Schweitzer:
On the Weisfeiler-Leman Dimension of Finite Groups. CoRR abs/2003.13745 (2020) - [i25]Moritz Lichter, Pascal Schweitzer:
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CoRR abs/2010.12182 (2020) - [i24]Markus Anders, Pascal Schweitzer:
Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms. CoRR abs/2011.01726 (2020) - [i23]Markus Anders, Pascal Schweitzer:
Engineering a Fast Probabilistic Isomorphism Test. CoRR abs/2011.09375 (2020) - [i22]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Automorphism groups of graphs of bounded Hadwiger number. CoRR abs/2012.14300 (2020)
2010 – 2019
- 2019
- [j23]Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. J. ACM 66(6): 44:1-44:31 (2019) - [j22]Sandra Kiefer, Pascal Schweitzer:
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic. Log. Methods Comput. Sci. 15(2) (2019) - [c30]Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer:
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. LICS 2019: 1-13 - [c29]Pascal Schweitzer, Daniel Wiebking:
A unifying method for the design of algorithms canonizing combinatorial objects. STOC 2019: 1247-1258 - [i21]Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer:
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. CoRR abs/1905.03008 (2019) - 2018
- [j21]Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-Width. Algorithmica 80(1): 29-47 (2018) - [c28]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. FOCS 2018: 89-100 - [c27]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP 2018: 67:1-67:14 - [c26]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS 2018: 44:1-44:15 - [c25]Daniel Neuen, Pascal Schweitzer:
An exponential lower bound for individualization-refinement algorithms for graph isomorphism. STOC 2018: 138-150 - [i20]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
Towards faster isomorphism tests for bounded-degree graphs. CoRR abs/1802.04659 (2018) - [i19]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An improved isomorphism test for bounded-tree-width graphs. CoRR abs/1803.06858 (2018) - [i18]Pascal Schweitzer, Daniel Wiebking:
A unifying method for the design of algorithms canonizing combinatorial objects. CoRR abs/1806.07466 (2018) - 2017
- [j20]Stefan Kratsch, Pascal Schweitzer:
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. Discret. Appl. Math. 216: 240-253 (2017) - [j19]Pascal Schweitzer, Patrick Schweitzer:
Minimal asymmetric graphs. J. Comb. Theory B 127: 215-227 (2017) - [j18]Pascal Schweitzer:
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. Theory Comput. Syst. 61(4): 1084-1127 (2017) - [j17]Michael Elberfeld, Pascal Schweitzer:
Canonizing Graphs of Bounded Tree Width in Logspace. ACM Trans. Comput. Theory 9(3): 12:1-12:29 (2017) - [c24]Daniel Neuen, Pascal Schweitzer:
Benchmark Graphs for Practical Graph Isomorphism. ESA 2017: 60:1-60:14 - [c23]Pascal Schweitzer:
A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry. ICALP 2017: 66:1-66:14 - [c22]Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman dimension of planar graphs is at most 3. LICS 2017: 1-12 - [i17]Pascal Schweitzer:
A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry. CoRR abs/1704.08529 (2017) - [i16]Daniel Neuen, Pascal Schweitzer:
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism. CoRR abs/1705.03283 (2017) - [i15]Daniel Neuen, Pascal Schweitzer:
Benchmark Graphs for Practical Graph Isomorphism. CoRR abs/1705.03686 (2017) - [i14]Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3. CoRR abs/1708.07354 (2017) - [i13]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR abs/1712.09230 (2017) - 2016
- [j16]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. SIAM J. Discret. Math. 30(2): 1213-1247 (2016) - [c21]Wenchao Li, Hossein Saidi, Huascar Sanchez, Martin Schäf, Pascal Schweitzer:
Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel. ICSR 2016: 315-330 - [c20]Sandra Kiefer, Pascal Schweitzer:
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. LICS 2016: 287-296 - [c19]Michael Elberfeld, Pascal Schweitzer:
Canonizing Graphs of Bounded Tree Width in Logspace. STACS 2016: 32:1-32:14 - [i12]Sandra Kiefer, Pascal Schweitzer:
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. CoRR abs/1605.03480 (2016) - [i11]Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-width. CoRR abs/1605.08540 (2016) - [i10]Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer:
Stochastic dominance and the bijective ratio of online algorithms. CoRR abs/1607.06132 (2016) - 2015
- [j15]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica 72(4): 1033-1054 (2015) - [c18]Martin Grohe, Pascal Schweitzer:
Isomorphism Testing for Graphs of Bounded Rank Width. FOCS 2015: 1010-1029 - [c17]Sandra Kiefer, Pascal Schweitzer, Erkal Selman:
Graphs Identified by Logics with Counting. MFCS (1) 2015: 319-330 - [c16]Pascal Schweitzer:
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. STACS 2015: 689-702 - [c15]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. STOC 2015: 683-692 - [c14]Rémy Belmonte, Yota Otachi, Pascal Schweitzer:
Induced Minor Free Graphs: Isomorphism and Clique-width. WG 2015: 299-311 - [i9]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. CoRR abs/1503.00190 (2015) - [i8]Sandra Kiefer, Pascal Schweitzer, Erkal Selman:
Graphs Identified by Logics with Counting. CoRR abs/1503.08792 (2015) - [i7]Martin Grohe, Pascal Schweitzer:
Isomorphism Testing for Graphs of Bounded Rank Width. CoRR abs/1505.03737 (2015) - [i6]Michael Elberfeld, Pascal Schweitzer:
Canonizing Graphs of Bounded Tree Width in Logspace. CoRR abs/1506.07810 (2015) - [i5]László Babai, Anuj Dawar, Pascal Schweitzer, Jacobo Torán:
The Graph Isomorphism Problem (Dagstuhl Seminar 15511). Dagstuhl Reports 5(12): 1-17 (2015) - 2014
- [j14]Brendan D. McKay, Pascal Schweitzer:
Switching Reconstruction of Digraphs. J. Graph Theory 76(4): 279-296 (2014) - [j13]Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer:
Competition Numbers, Quasi-line Graphs, and Holes. SIAM J. Discret. Math. 28(1): 77-91 (2014) - [c13]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 - [c12]Yota Otachi, Pascal Schweitzer:
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. SWAT 2014: 368-379 - [i4]Yota Otachi, Pascal Schweitzer:
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. CoRR abs/1403.7238 (2014) - [i3]Pascal Schweitzer:
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. CoRR abs/1411.1977 (2014) - 2013
- [j12]Pascal Schweitzer:
Iterated open neighborhood graphs and generalizations. Discret. Appl. Math. 161(10-11): 1598-1609 (2013) - [j11]Spyros Angelopoulos, Pascal Schweitzer:
Paging and list update under bijective analysis. J. ACM 60(2): 7:1-7:18 (2013) - [j10]Weifa Liang, Pascal Schweitzer, Zichuan Xu:
Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink. IEEE Trans. Computers 62(10): 1932-1944 (2013) - [j9]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513: 65-76 (2013) - [c11]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. GD 2013: 71-82 - [c10]Yota Otachi, Pascal Schweitzer:
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. ISAAC 2013: 111-118 - 2012
- [j8]Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer:
Online graph exploration: New results on old and new algorithms. Theor. Comput. Sci. 463: 62-72 (2012) - [c9]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). GD 2012: 339-345 - [c8]Cristiano Bertolini, Martin Schäf, Pascal Schweitzer:
Infeasible Code Detection. VSTTE 2012: 310-325 - [c7]Stefan Kratsch, Pascal Schweitzer:
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. WG 2012: 34-45 - [i2]Pascal Schweitzer:
On Zero Divisors with Small Support in Group Rings of Torsion-Free Groups. CoRR abs/1202.6645 (2012) - [i1]Stefan Kratsch, Pascal Schweitzer:
Graph Isomorphism for Graph Classes Characterized by two Forbidden Induced Subgraphs. CoRR abs/1208.0142 (2012) - 2011
- [j7]Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer:
Certifying algorithms. Comput. Sci. Rev. 5(2): 119-161 (2011) - [j6]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah, Pascal Schweitzer:
An Introduction to Certifying Algorithms. it Inf. Technol. 53(6): 287-293 (2011) - [j5]Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt:
Weisfeiler-Lehman Graph Kernels. J. Mach. Learn. Res. 12: 2539-2561 (2011) - [c6]Pascal Schweitzer:
Isomorphism of (mis)Labeled Graphs. ESA 2011: 370-381 - [c5]Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer:
Online Graph Exploration: New Results on Old and New Algorithms. ICALP (2) 2011: 478-489 - 2010
- [j4]Pascal Schweitzer, Patrick Schweitzer:
Connecting face hitting sets in planar graphs. Inf. Process. Lett. 111(1): 11-15 (2010) - [j3]Momchil Rusinov, Pascal Schweitzer:
Homomorphism-homogeneous graphs. J. Graph Theory 65(3): 253-262 (2010) - [c4]Kurt Mehlhorn, Pascal Schweitzer:
Progress on Certifying Algorithms. FAW 2010: 1-5 - [c3]Stefan Kratsch, Pascal Schweitzer:
Isomorphism for Graphs of Bounded Feedback Vertex Set Number. SWAT 2010: 81-92
2000 – 2009
- 2009
- [j2]Pascal Schweitzer:
Using the incompressibility method to obtain local lemma results for Ramsey-type problems. Inf. Process. Lett. 109(4): 229-232 (2009) - [c2]Spyros Angelopoulos, Pascal Schweitzer:
Paging and list update under bijective analysis. SODA 2009: 1136-1145 - 2008
- [j1]Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer:
Counting Defective Parking Functions. Electron. J. Comb. 15(1) (2008) - 2007
- [c1]Martin Kutz, Pascal Schweitzer:
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. ALENEX 2007
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 2025-04-03 00:24 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:
