default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf H. Möhring
Person information
- affiliation: Technical University of Berlin, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j48]Donglei Du, Lu Han, Rolf H. Möhring, Chenchen Wu:
Preface - Special Issue: Research in Combinatorial Optimization and Applications of COCOA 2021. Int. J. Found. Comput. Sci. 35(6): 605-607 (2024)- [c28]Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. TAMC 2024: 197-208 - 2023
- [j47]Zijun Wu
, Rolf H. Möhring:
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games. Math. Oper. Res. 48(3): 1364-1392 (2023) - [j46]Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu:
A convergence analysis of the price of anarchy in atomic congestion games. Math. Program. 199(1): 937-993 (2023) - 2022
- [j45]Yicheng Xu, Vincent Chau, Rolf H. Möhring:
Introduction to the special section on parallel and distributed computing, algorithms, programming, applications and technologies (VSI-pdcat4). Comput. Electr. Eng. 100: 107929 (2022) - [e10]Yong Zhang, Dongjing Miao, Rolf H. Möhring:
Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings. Lecture Notes in Computer Science 13595, Springer 2022, ISBN 978-3-031-22104-0 [contents] - 2021
- [j44]Zijun Wu, Rolf H. Möhring, Yanyan Chen, Dachuan Xu:
Selfishness Need Not Be Bad. Oper. Res. 69(2): 410-435 (2021) - 2020
- [i16]Zijun Wu, Rolf H. Möhring:
A sensitivity analysis for the price of anarchy in non-atomic congestion games. CoRR abs/2007.13979 (2020) - [i15]Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu:
A convergence analysis of the price of anarchy in atomic congestion games. CoRR abs/2007.14769 (2020) - [i14]Yishui Wang, Rolf H. Möhring, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. CoRR abs/2012.10884 (2020)
2010 – 2019
- 2019
- [j43]Elisabeth Lübbecke, Marco E. Lübbecke, Rolf H. Möhring:
Ship Traffic Optimization for the Kiel Canal. Oper. Res. 67(3): 791-812 (2019) - 2018
- [j42]Zijun Wu, Rolf H. Möhring, Jianhui Lai:
Stochastic runtime analysis of a Cross-Entropy algorithm for traveling salesman problems. Theor. Comput. Sci. 724: 69-86 (2018) - [i13]Zijun Wu, Rolf H. Möhring, Dachuan Xu:
Selfishness need not be bad: a general proof. CoRR abs/1805.07762 (2018) - 2017
- [j41]Zijun Wu, Michael Kolonko, Rolf H. Möhring:
Stochastic Runtime Analysis of the Cross-Entropy Algorithm. IEEE Trans. Evol. Comput. 21(4): 616-628 (2017) - [i12]Zijun Wu, Rolf H. Möhring, Yanyan Chen:
Selfishness need not be bad. CoRR abs/1712.07464 (2017) - 2016
- [p5]Wiebke Höhn, Rolf H. Möhring:
Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications. Algorithm Engineering 2016: 330-351 - [i11]Zijun Wu, Rolf H. Möhring, Jianhui Lai:
Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems. CoRR abs/1612.06962 (2016) - 2015
- [j40]Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring:
Computing network tolls with support constraints. Networks 65(3): 262-285 (2015) - 2013
- [j39]Tobias Harks, Max Klimm, Rolf H. Möhring:
Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theory 42(2): 461-482 (2013) - 2012
- [j38]Ewgenij Gawrilow, Max Klimm, Rolf H. Möhring, Björn Stenzel:
Conflict-free vehicle routing. EURO J. Transp. Logist. 1(1-2): 87-111 (2012) - 2011
- [j37]Nicole Megow, Rolf H. Möhring, Jens Schulz:
Decision Support and Optimization in Shutdown and Turnaround Scheduling. INFORMS J. Comput. 23(2): 189-204 (2011) - [j36]Rolf H. Möhring:
Algorithm Engineering and Industrial Applications. it Inf. Technol. 53(6): 302- (2011) - [j35]Wiebke Höhn, Felix G. König, Rolf H. Möhring, Marco E. Lübbecke:
Integrated Sequencing and Scheduling in Coil Coating. Manag. Sci. 57(4): 647-666 (2011) - [j34]Tobias Harks, Max Klimm, Rolf H. Möhring:
Characterizing the Existence of Potential Functions in Weighted Congestion Games. Theory Comput. Syst. 49(1): 46-70 (2011) - [j33]Torsten J. Gellert, Wiebke Höhn, Rolf H. Möhring:
Sequencing and scheduling for filling lines in dairy production. Optim. Lett. 5(3): 491-504 (2011) - [p4]Rolf H. Möhring, Martin Oellrich:
The Sieve of Eratosthenes - How Fast Can We Compute a Prime Number Table? Algorithms Unplugged 2011: 119-130 - 2010
- [c27]Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz:
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. CPAIOR 2010: 313-317 - [e9]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
Scheduling, 14.02. - 19.02.2010. Dagstuhl Seminar Proceedings 10071, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i10]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
10071 Abstracts Collection - Scheduling. Scheduling 2010 - [i9]Susanne Albers, Sanjoy K. Baruah, Rolf H. Möhring, Kirk Pruhs:
10071 Executive Summary - Scheduling. Scheduling 2010
2000 – 2009
- 2009
- [c26]Ekkehard Köhler, Rolf H. Möhring, Martin Skutella:
Traffic Networks and Flows over Time. Algorithmics of Large and Complex Networks 2009: 166-196 - [c25]Tobias Harks, Max Klimm, Rolf H. Möhring:
Characterizing the Existence of Potential Functions in Weighted Congestion Games. SAGT 2009: 97-108 - [c24]Tobias Harks, Max Klimm, Rolf H. Möhring:
Strong Nash Equilibria in Games with the Lexicographical Improvement Property. WINE 2009: 463-470 - [p3]Christian Liebchen, Marco E. Lübbecke, Rolf H. Möhring, Sebastian Stiller:
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. Robust and Online Large-Scale Optimization 2009: 1-27 - [e8]Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, Rolf H. Möhring:
Models and Algorithms for Optimization in Logistics, 21.06. - 26.06.2009. Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [e7]Ravindra K. Ahuja, Rolf H. Möhring, Christos D. Zaroliagis:
Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems. Lecture Notes in Computer Science 5868, Springer 2009, ISBN 978-3-642-05464-8 [contents] - [i8]Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, Rolf H. Möhring:
09261 Abstracts Collection - Models and Algorithms for Optimization in Logistics. Models and Algorithms for Optimization in Logistics 2009 - [i7]Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, Rolf H. Möhring:
09261 Executive Summary - Models and Algorithms for Optimization in Logistics. Models and Algorithms for Optimization in Logistics 2009 - [i6]Wiebke Höhn, Felix G. König, Marco E. Lübbecke, Rolf H. Möhring:
Sequencing and Scheduling in Coil Coating with Shuttles. Models and Algorithms for Optimization in Logistics 2009 - [i5]Tobias Harks, Max Klimm, Rolf H. Möhring:
Strong Nash Equilibria in Games with the Lexicographical Improvement Property. CoRR abs/0909.0347 (2009) - 2008
- [c23]Rolf H. Möhring:
Routing in Graphs with Applications to Material Flow Problems. ALENEX 2008: 64 - [p2]Rolf H. Möhring, Martin Oellrich:
Das Sieb des Eratosthenes: Wie schnell kann man eine Primzahlentabelle berechnen?. Taschenbuch der Algorithmen 2008: 127-138 - [e6]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs:
Scheduling, 10.02. - 15.02.2008. Dagstuhl Seminar Proceedings 08071, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [i4]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs:
08071 Executive Summary -- Scheduling. Scheduling 2008 - [i3]Jane W.-S. Liu, Rolf H. Möhring, Kirk Pruhs:
08071 Abstracts Collection -- Scheduling. Scheduling 2008 - 2007
- [c22]Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke:
Solutions to Real-World Instances of PSPACE-Complete Stacking. ESA 2007: 729-740 - 2006
- [j32]Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning graphs to speedup Dijkstra's algorithm. ACM J. Exp. Algorithmics 11 (2006) - [c21]Moritz Hilger, Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling:
Fast Point-to-Point Shortest Path Computations with Arc-Flags. The Shortest Path Problem 2006: 41-72 - [e5]Leo G. Kroon, Rolf H. Möhring:
5th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2005, September 14, 2005, Palma de Mallorca, Spain. OASIcs 2, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [j31]Rolf H. Möhring, Rajeev Raman:
Preface. Algorithmica 42(3-4): 199-201 (2005) - [j30]Olaf Jahn, Rolf H. Möhring, Andreas S. Schulz, Nicolás E. Stier Moses:
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion. Oper. Res. 53(4): 600-616 (2005) - [c20]Leo G. Kroon, Rolf H. Möhring:
ATMOS Preface - Algorithmic Methods and Models for Optimization of Railways. ATMOS 2005 - [c19]Leo G. Kroon, Rolf H. Möhring:
ATMOS 2005 Abstracts Collection - Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways. ATMOS 2005 - [c18]Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling:
Acceleration of Shortest Path and Constrained Shortest Path Computation. WEA 2005: 126-138 - [c17]Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning Graphs to Speed Up Dijkstra's Algorithm. WEA 2005: 189-202 - [e4]Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
Algorithms for Optimization with Incomplete Information, 16.-21. January 2005. Dagstuhl Seminar Proceedings 05031, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - [i2]Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information. Algorithms for Optimization with Incomplete Information 2005 - [i1]Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
05031 Summary-- Algorithms for Optimization with Incomplete Information. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j29]Rolf H. Möhring, Martin Skutella, Frederik Stork:
Scheduling with AND/OR Precedence Constraints. SIAM J. Comput. 33(2): 393-415 (2004) - [c16]Christian Liebchen, Rolf H. Möhring:
The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond. ATMOS 2004: 3-40 - [c15]Rolf H. Möhring, Ekkehard Köhler, Ewgenij Gawrilow, Björn Stenzel:
Conflict-free Real-time AGV Routing. OR 2004: 18-24 - [c14]Ekkehard Köhler, Rolf H. Möhring, Gregor Wünsch:
Minimizing Total Delay in Fixed-Time Controlled Traffic Networks. OR 2004: 192-199 - 2003
- [j28]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
Solving Project Scheduling Problems by Minimum Cut Computations. Manag. Sci. 49(3): 330-350 (2003) - [c13]Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring:
Scheduling AND/OR-Networks on Identical Parallel Machines. WAOA 2003: 123-136 - 2002
- [c12]Christian Liebchen, Rolf H. Möhring:
A Case Study in Periodic Timetabling. ATMOS 2002: 18-31 - [e3]Rolf H. Möhring, Rajeev Raman:
Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2461, Springer 2002, ISBN 3-540-44180-8 [contents] - 2001
- [j27]Arfst Ludwig, Rolf H. Möhring, Frederik Stork:
A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks. Ann. Oper. Res. 102(1-4): 49-64 (2001) - [j26]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
On project scheduling with irregular starting time costs. Oper. Res. Lett. 28(4): 149-154 (2001) - [c11]Rolf H. Möhring:
Scheduling under Uncertainty: Bounding the Makespan Distribution. Computational Discrete Mathematics 2001: 79-97 - 2000
- [j25]Rolf H. Möhring, Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. Algorithmica 26(1): 148-171 (2000) - [j24]Rolf H. Möhring, Frederik Stork:
Linear preselective policies for stochastic project scheduling. Math. Methods Oper. Res. 52(3): 501-515 (2000) - [c10]Rolf H. Möhring:
Scheduling under uncertainty: Optimizing against a randomizing adversary. APPROX 2000: 15-26 - [c9]Rolf H. Möhring, Martin Skutella, Frederik Stork:
Forcing relations for AND/OR precedence constraints. SODA 2000: 235-236
1990 – 1999
- 1999
- [j23]Peter Brucker, Andreas Drexl, Rolf H. Möhring, Klaus Neumann, Erwin Pesch:
Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1): 3-41 (1999) - [j22]Rolf H. Möhring, Andreas S. Schulz, Marc Uetz:
Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46(6): 924-942 (1999) - [j21]Rolf H. Möhring, Markus W. Schäffter:
Scheduling series-parallel orders subject to 0/1-communication delays. Parallel Comput. 25(1): 23-40 (1999) - [c8]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. ESA 1999: 139-150 - [c7]Rolf H. Möhring, Andreas S. Schulz, Marc Uetz:
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. RANDOM-APPROX 1999: 144-155 - [p1]Rolf H. Möhring:
Verteilte Verbindungssuche im öffentlichen Personenverkehr Graphentheoretische Modelle und Algorithmen. Angewandte Mathematik, insbesondere Informatik 1999: 192-220 - 1997
- [j20]Rolf H. Möhring, Franz Josef Radermacher, Maria Grazia Speranza:
Scheduling at Villa Vigoni. Discret. Appl. Math. 72(1-2): 1-3 (1997) - [j19]Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe:
Mesh refinement via bidirected flows: modeling, complexity, and computational results. J. ACM 44(3): 395-426 (1997) - [c6]Rolf H. Möhring, Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. ISAAC 1997: 263-272 - [e2]Rolf H. Möhring:
Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings. Lecture Notes in Computer Science 1335, Springer 1997, ISBN 3-540-63757-5 [contents] - 1996
- [j18]Rolf H. Möhring:
Triangulating Graphs Without Asteroidal Triples. Discret. Appl. Math. 64(3): 281-287 (1996) - [c5]Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz:
Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). ESA 1996: 76-90 - 1995
- [j17]Rolf H. Möhring:
Editorial. Ann. Oper. Res. 55(1) (1995) - [j16]Rolf H. Möhring, Rudolf Müller, Franz Josef Radermacher:
Advanced DSS for scheduling: software engineering aspects and the role of Eigenmodels. Ann. Oper. Res. 55(3): 453-469 (1995) - [c4]Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe:
Using Network Flows for Surface Modeling. SODA 1995: 350-359 - 1994
- [j15]Stefan Felsner, Michel Habib, Rolf H. Möhring:
On the Interplay Between Interval Dimension and Dimension. SIAM J. Discret. Math. 7(1): 32-40 (1994) - [c3]Rolf H. Möhring, Rudolf Müller, Franz Josef Radermacher:
Advanced DSS for Scheduling: Software Engineering Aspects and the Role of Eigenmodels. HICSS (3) 1994: 290-299 - 1993
- [j14]Hans L. Bodlaender, Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs. SIAM J. Discret. Math. 6(2): 181-188 (1993) - 1991
- [j13]Michel Habib, David Kelly, Rolf H. Möhring:
Interval dimension is a comparability invariant. Discret. Math. 88(2-3): 211-229 (1991) - [e1]Rolf H. Möhring:
Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings. Lecture Notes in Computer Science 484, Springer 1991, ISBN 3-540-53832-1 [contents] - 1990
- [c2]Hans L. Bodlaender, Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs. SWAT 1990: 301-309
1980 – 1989
- 1989
- [j12]M. Bartusch, Rolf H. Möhring, Franz Josef Radermacher:
Design aspects of an advanced model-oriented DSS for scheduling problems in civil engineering. Decis. Support Syst. 5(4): 321-344 (1989) - [j11]Norbert Korte, Rolf H. Möhring:
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs. SIAM J. Comput. 18(1): 68-81 (1989) - 1988
- [j10]Ralph L. Keeney, Rolf H. Möhring, H. Otway, Franz Josef Radermacher, Michael M. Richter:
Design aspects of advanced decision support systems. Decis. Support Syst. 4(4): 381-385 (1988) - 1987
- [j9]Michel Habib, Rolf H. Möhring:
On some complexity properties of N-free posets and posets with bounded decomposition diameter. Discret. Math. 63(2-3): 157-182 (1987) - 1986
- [j8]Bruce A. Murtagh, Rolf H. Möhring:
Book reviews. Z. Oper. Research 30(3) (1986) - [c1]Norbert Korte, Rolf H. Möhring:
A Simple Linear -TIme Algorithm to Recognize Interval Graphs. WG 1986: 1-16 - 1985
- [j7]Rolf H. Möhring, Franz Josef Radermacher, Gideon Weiss:
Stochastic scheduling problems II-set strategies-. Z. Oper. Research 29(3): 65-104 (1985) - 1984
- [j6]Rolf H. Möhring:
Almost all comparability graphs are UPO. Discret. Math. 50: 63-70 (1984) - [j5]Rolf H. Möhring:
Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time. Oper. Res. 32(1): 89-120 (1984) - [j4]Rolf H. Möhring, Franz Josef Radermacher, Gideon Weiss:
Stochastic scheduling problems I - General strategies. Z. Oper. Research 28(7): 193-260 (1984) - 1983
- [j3]Rudolf Avenhaus, Peter Brucker, Alfred Luhmer, Rolf H. Möhring, Franz Josef Radermacher, Klaus-Peter Kistner, Volker Brandenburg, Götz Uebe:
Book reviews. Z. Oper. Research 27(1): 67-72 (1983) - [j2]Ulrich Lorscheider, K.-D. Hackbarth, Ch. Scholz, Rolf H. Möhring, Franz Josef Radermacher, Alfred Luhmer, Peter Brucker, Bernd Schiemenz, Gustav Feichtinger:
Book reviews. Z. Oper. Research 27(1): 211-216 (1983) - [j1]Hermann Buer, Rolf H. Möhring:
A Fast Algorithm for the Decomposition of Graphs and Posets. Math. Oper. Res. 8(2): 170-184 (1983)
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-15 20:43 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:
