default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Hecher
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, MA, USA
SPARQL queries 
🛈 Please note that only 71% of the records listed on this page have a DOI. 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
- 2024
[j14]Thomas Eiter
, Markus Hecher, Rafael Kiesel:
aspmc: New frontiers of algebraic answer set counting. Artif. Intell. 330: 104109 (2024)- [j13]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. J. Artif. Intell. Res. 80 (2024) - [c59]Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlögel:
Parallel Empirical Evaluations: Resilience despite Concurrency. AAAI 2024: 8004-8012 - [c58]Markus Hecher, Rafael Kiesel:
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? AAAI 2024: 10535-10543 - [c57]Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert T. Schweller, Ahmed Shalaby, Damien Woods:
Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds. DNA 2024: 2:1-2:24 - [c56]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Rejection in Abstract Argumentation: Harder Than Acceptance? ECAI 2024: 3212-3219 - [c55]Damiano Azzolini, Markus Hecher:
A First Journey into the Complexity of Statistical Statements in Probabilistic Answer Set Programming. ICLP Workshops 2024 - [c54]Alexander Beiser, Markus Hecher, Kaan Unalan, Stefan Woltran:
Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. IJCAI 2024: 3250-3258 - [c53]Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran:
Epistemic Logic Programs: Non-Ground and Counting Complexity. IJCAI 2024: 3333-3341 - [c52]Lukas Gerlach, David Carral, Markus Hecher:
Finite Groundings for ASP with Functions: A Journey through Consistency. IJCAI 2024: 3386-3394 - [c51]Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt:
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. IJCAI 2024: 3404-3412 - [c50]Max Bannach, Markus Hecher:
Structure-Guided Cube-and-Conquer for MaxSAT. NFM 2024: 3-20 - [c49]Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche:
The Relative Strength of #SAT Proof Systems. SAT 2024: 5:1-5:19 - [c48]Ivan Bliznets, Markus Hecher:
Tight Double Exponential Lower Bounds. TAMC 2024: 124-136 - [e4]Joaquín Arias, Damiano Azzolini, Kinjal Basu, Verónica Dahl, Markus Hecher, Francesco Pacenza, Zeynep G. Saribatur, Sarat Chandra Varanasi:
Workshop Proceedings of the 40th International Conference on Logic Programming (ICLP-WS 2024) co-located with the 40th International Conference on Logic Programming (ICLP 2024), Dallas, TX, USA, October 12th and 13th, 2024. CEUR Workshop Proceedings 3799, CEUR-WS.org 2024 [contents] - [i27]Markus Hecher, Rafael Kiesel:
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? CoRR abs/2402.03539 (2024) - [i26]Lukas Gerlach, David Carral, Markus Hecher:
Finite Groundings for ASP with Functions: A Journey through Consistency. CoRR abs/2405.15794 (2024) - [i25]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Rejection in Abstract Argumentation: Harder Than Acceptance? CoRR abs/2408.10683 (2024) - 2023
- [j12]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. Artif. Intell. 314: 103810 (2023) - [j11]Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider:
The Silent (R)evolution of SAT. Commun. ACM 66(6): 64-72 (2023) - [j10]Markus Hecher:
Advanced tools and methods for treewidth-based problem solving. it Inf. Technol. 65(1-2): 65-74 (2023) - [c47]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. AAAI 2023: 6363-6371 - [c46]Markus Hecher:
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? AAAI 2023: 6407-6415 - [c45]Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran:
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. ICAPS 2023: 100-108 - [c44]Viktor Besin, Markus Hecher, Stefan Woltran:
On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. ECAI 2023: 247-254 - [c43]Jorge Fandinno, Markus Hecher:
Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs. IJCAI 2023: 3203-3211 - [c42]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. IJCAI 2023: 3212-3220 - [c41]Markus Hecher, Rafael Kiesel:
The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits. KR 2023: 344-354 - [c40]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. LICS 2023: 1-14 - [i24]Markus Hecher:
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth? CoRR abs/2301.07472 (2023) - [i23]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR abs/2304.13896 (2023) - [i22]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. CoRR abs/2305.19212 (2023) - [i21]Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac:
IASCAR: Incremental Answer Set Counting by Anytime Refinement. CoRR abs/2311.07233 (2023) - [i20]Max Bannach, Markus Hecher:
Structure-Guided Automated Reasoning. CoRR abs/2312.14620 (2023) - 2022
- [b2]Markus Hecher:
Advanced Tools and Methods for Treewidth-Based Problem Solving. Frontiers in Artificial Intelligence and Applications 359, IOS Press 2022, ISBN 978-1-64368-344-7 - [j9]Markus Hecher:
Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? Artif. Intell. 304: 103651 (2022) - [j8]Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default logic and bounded treewidth. Inf. Comput. 283: 104675 (2022) - [j7]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. Theory Pract. Log. Program. 22(1): 128-157 (2022) - [c39]Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran:
Tractable Abstract Argumentation via Backdoor-Treewidth. AAAI 2022: 5608-5615 - [c38]Mohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, Kuldeep S. Meel:
ApproxASP - a Scalable Approximate Answer Set Counter. AAAI 2022: 5755-5764 - [c37]Viktor Besin, Markus Hecher, Stefan Woltran:
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. IJCAI 2022: 2546-2552 - [c36]Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem:
Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. IJCAI 2022: 2620-2626 - [c35]Viktor Besin, Markus Hecher, Stefan Woltran:
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). IJCAI 2022: 5264-5268 - [c34]Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac:
IASCAR: Incremental Answer Set Counting by Anytime Refinement. LPNMR 2022: 217-230 - [c33]Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher:
A Practical Account into Counting Dung's Extensions by Dynamic Programming. LPNMR 2022: 387-400 - [c32]Johannes Klaus Fichte, Markus Hecher, Valentin Roland:
Proofs for Propositional Model Counting. SAT 2022: 30:1-30:24 - [e3]Joaquín Arias, Roberta Calegari, Luke Dickens, Wolfgang Faber, Jorge Fandinno, Gopal Gupta, Markus Hecher, Daniela Inclezan, Emily LeBlanc, Michael Morak, Elmer Salazar, Jessica Zangari:
Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP 2022), Haifa, Israel, July 31st - August 1st, 2022. CEUR Workshop Proceedings 3193, CEUR-WS.org 2022 [contents] - [i19]Markus Hecher:
Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract. CoRR abs/2208.11340 (2022) - [i18]Markus Hecher:
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? CoRR abs/2210.03553 (2022) - 2021
- [b1]Markus Hecher:
Advanced tools and methods for treewidth-based problem solving. University of Potsdam, Germany, 2021 - [j6]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms 14(3): 81 (2021) - [j5]Johannes Klaus Fichte, Markus Hecher, Florim Hamiti:
The Model Counting Competition 2020. ACM J. Exp. Algorithmics 26: 13:1-13:26 (2021) - [j4]Viktor Besin, Markus Hecher, Stefan Woltran:
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. Theory Pract. Log. Program. 21(5): 575-592 (2021) - [c31]Jorge Fandinno, Markus Hecher:
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. AAAI 2021: 6312-6320 - [c30]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Knowledge-Base Degrees of Inconsistency: Complexity and Counting. AAAI 2021: 6349-6357 - [c29]Johannes Klaus Fichte, Markus Hecher, Valentin Roland:
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. CP 2021: 24:1-24:20 - [c28]Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab:
Complications for Computational Experiments from Modern Processors. CP 2021: 25:1-25:21 - [c27]Thomas Eiter, Markus Hecher, Rafael Kiesel:
aspmc: An Algebraic Answer Set Counter. ICLP Workshops 2021 - [c26]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI 2021: 1880-1886 - [c25]Thomas Eiter, Markus Hecher, Rafael Kiesel:
Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. KR 2021: 269-279 - [p1]Markus Hecher:
Werkzeuge und Methoden zum Lösen von Problemen mittels Baumweite . Ausgezeichnete Informatikdissertationen 2021: 91-100 - [e2]Joaquín Arias, Fabio Aurelio D'Asaro, Abeer Dyoub, Gopal Gupta, Markus Hecher, Emily LeBlanc, Rafael Peñaloza, Elmer Salazar, Ari Saptawijaya, Felix Weitkämper, Jessica Zangari:
Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal (virtual), September 20th-21st, 2021. CEUR Workshop Proceedings 2970, CEUR-WS.org 2021 [contents] - [i17]Viktor Besin, Markus Hecher, Stefan Woltran:
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. CoRR abs/2108.03022 (2021) - 2020
- [c24]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. AAAI 2020: 2830-2837 - [c23]Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler:
Treewidth-Aware Quantifier Elimination and Expansion for QCSP. CP 2020: 248-266 - [c22]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT-Solving. CP 2020: 267-285 - [c21]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Breaking Symmetries with RootClique and LexTopSort. CP 2020: 286-303 - [c20]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. ICLP Workshops 2020 - [c19]Johannes Klaus Fichte, Markus Hecher, André Schidler:
Solving the Steiner Tree Problem with few Terminals. ICTAI 2020: 293-300 - [c18]Markus Hecher:
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? KR 2020: 485-495 - [c17]Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler:
Lower Bounds for QBFs of Bounded Treewidth. LICS 2020: 410-424 - [c16]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. PADL 2020: 151-167 - [c15]Markus Hecher, Patrick Thier, Stefan Woltran:
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. SAT 2020: 343-360 - [e1]Carmine Dodaro, George Aristidis Elder, Wolfgang Faber, Jorge Fandinno, Martin Gebser, Markus Hecher, Emily LeBlanc, Michael Morak, Jessica Zangari:
International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020. CEUR Workshop Proceedings 2678, CEUR-WS.org 2020 [contents] - [i16]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. CoRR abs/2001.04191 (2020) - [i15]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. CoRR abs/2001.04219 (2020) - [i14]Markus Hecher, Jorge Fandinno:
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. CoRR abs/2007.04620 (2020) - [i13]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT Solving. CoRR abs/2008.02215 (2020) - [i12]Johannes Klaus Fichte, Markus Hecher, André Schidler:
Solving the Steiner Tree Problem with few Terminals. CoRR abs/2011.04593 (2020) - [i11]Johannes Klaus Fichte, Markus Hecher, Florim Hamiti:
The Model Counting Competition 2020. CoRR abs/2012.01323 (2020)
2010 – 2019
- 2019
- [j3]Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath:
Inconsistency Proofs for ASP: The ASP - DRUPE Format. Theory Pract. Log. Program. 19(5-6): 891-907 (2019) - [c14]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. AAAI 2019: 2827-2834 - [c13]Johannes Klaus Fichte, Markus Hecher, Markus Zisser:
An Improved GPU-Based SAT Model Counter. CP 2019: 491-509 - [c12]Muhammad Ayaz Dzulfikar, Johannes Klaus Fichte, Markus Hecher:
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). IPEC 2019: 25:1-25:23 - [c11]Johannes Klaus Fichte, Markus Hecher:
Treewidth and Counting Projected Answer Sets. LPNMR 2019: 105-119 - [i10]Johannes Klaus Fichte, Markus Hecher:
Treewidth and Counting Projected Answer Sets. CoRR abs/1903.11316 (2019) - [i9]Markus Hecher:
Answer Set Solving exploiting Treewidth and its Limits. CoRR abs/1905.01688 (2019) - [i8]Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath:
Inconsistency Proofs for ASP: The ASP-DRUPE Format. CoRR abs/1907.10389 (2019) - [i7]Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler:
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. CoRR abs/1910.01047 (2019) - 2018
- [j2]Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran:
Dynamic Programming on Tree Decompositions with D-FLAT. Künstliche Intell. 32(2-3): 191-192 (2018) - [c10]Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider:
An SMT Approach to Fractional Hypertree Width. CP 2018: 109-127 - [c9]Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser:
Weighted Model Counting on the GPU by Exploiting Small Treewidth. ESA 2018: 28:1-28:16 - [c8]Johannes Klaus Fichte, Markus Hecher:
Exploiting Treewidth for Counting Projected Answer Sets. KR 2018: 639-640 - [c7]Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. LATA 2018: 130-142 - [c6]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and Its Limits. SAT 2018: 165-184 - [i6]Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and its Limits. CoRR abs/1805.05445 (2018) - [i5]Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. CoRR abs/1811.11501 (2018) - 2017
- [c5]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. IPEC 2017: 17:1-17:13 - [c4]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. LPNMR 2017: 132-145 - [i4]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. CoRR abs/1702.02890 (2017) - [i3]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. CoRR abs/1706.09370 (2017) - [i2]Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. CoRR abs/1706.09393 (2017) - 2016
- [j1]Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran:
D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundam. Informaticae 147(1): 27-61 (2016) - [c3]Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran:
Subset Minimization in Dynamic Programming on Tree Decompositions. AAAI Workshop: Beyond NP 2016 - [c2]Bernhard Bliem, Markus Hecher, Stefan Woltran:
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. COMMA 2016: 107-118 - [i1]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Counting Answer Sets via Dynamic Programming. CoRR abs/1612.07601 (2016) - 2014
- [c1]Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran:
The D-FLAT System for Dynamic Programming on Tree Decompositions. JELIA 2014: 558-572
Coauthor Index
[j13] [c59] [c56] [c53] [c49] [i25] [j12] [j11] [c47] [c42] [c40] [i23] [i22] [i21] [j8] [j7] [c38] [c36] [c34] [c33] [c32] [j6] [j5] [c30] [c29] [c28] [c26] [c23] [c22] [c21] [c19] [c17] [c16] [i16] [i13] [i12] [i11] [j3] [c14] [c13] [c12] [c11] [i10] [i8] [i7] [c10] [c9] [c8] [c7] [c6] [i6] [i5] [c5] [c4] [i4] [i3] [i2] [i1]
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-11-07 21:29 CET 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:
