default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Müller-Hannemann
Person information
- affiliation: Martin Luther University of Halle-Wittenberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j32]Valentina Cacchiani, Matthias Müller-Hannemann, Federico Perea Rojas-Marcos:
Guest Editorial to the Special Issue Public Transport Optimization: From Theory to Practice. Oper. Res. Forum 5(3): 73 (2024)- [c57]Frederik L. Jatzkowski, Antonia Schmidt, Robert Mank, Steffen Schüler, Matthias Müller-Hannemann:
Barcode Selection and Layout Optimization in Spatial Transcriptomics. SEA 2024: 17:1-17:19 - 2022
- [c56]Julian Patzner, Ralf Rückert, Matthias Müller-Hannemann:
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport. ATMOS 2022: 13:1-13:18 - 2021
- [c55]Matthias Müller-Hannemann
, Ralf Rückert, Alexander Schiewe, Anita Schöbel:
Towards Improved Robustness of Public Transport by a Machine-Learned Oracle. ATMOS 2021: 3:1-3:20 - [e6]Matthias Müller-Hannemann, Federico Perea:
21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, September 9-10, 2021, Lisbon, Portugal (Virtual Conference). OASIcs 96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-213-6 [contents] - [i7]Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel:
Estimating the Robustness of Public Transport Systems Using Machine Learning. CoRR abs/2106.08967 (2021) - 2020
- [j31]Jördis-Ann Schüler, Steffen Rechner, Matthias Müller-Hannemann:
MET: a Java package for fast molecule equivalence testing. J. Cheminformatics 12(1): 73 (2020)
2010 – 2019
- 2019
- [c54]Matthias Müller-Hannemann, Ralf Rückert, Sebastian S. Schmidt:
Vehicle Capacity-Aware Rerouting of Passengers in Delay Management. ATMOS 2019: 7:1-7:14 - 2018
- [j30]Steffen Rechner, Linda Strowick, Matthias Müller-Hannemann:
Uniform sampling of bipartite graphs with degrees in prescribed intervals. J. Complex Networks 6(6): 833-858 (2018) - [j29]Ivo Hedtke, Ioana M. Lemnian, Ivo Grosse, Matthias Müller-Hannemann:
Optimal Block-Based Trimming for Next Generation Sequencing. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 364-376 (2018) - [c53]Markus Friedrich, Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel:
Robustness as a Third Dimension for Evaluating Public Transport Plans. ATMOS 2018: 4:1-4:17 - 2017
- [j28]Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann:
Gerbil: a fast and memory-efficient k-mer counter with GPU-support. Algorithms Mol. Biol. 12(1): 9:1-9:12 (2017) - [j27]Matthias Müller-Hannemann, Ralf Rückert:
Dynamic Event-Activity Networks in Public Transportation - Timetable Information and Delay Management. Datenbank-Spektrum 17(2): 131-137 (2017) - [j26]Ralf Rückert, Martin Lemnian, Christoph Blendinger, Steffen Rechner, Matthias Müller-Hannemann:
PANDA: a software tool for improved train dispatching with focus on passenger flows. Public Transp. 9(1-2): 307-324 (2017) - [c52]Markus Friedrich, Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel:
Robustness Tests for Public Transport Planning. ATMOS 2017: 6:1-6:16 - 2016
- [c51]Martin Lemnian, Matthias Müller-Hannemann, Ralf Rückert:
Sensitivity Analysis and Coupled Decisions in Passenger Flow-Based Train Dispatching. ATMOS 2016: 2:1-2:15 - [c50]Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann:
Gerbil: A Fast and Memory-Efficient k-mer Counter with GPU-Support. WABI 2016: 150-161 - [p3]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - [i6]Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann:
Gerbil: A Fast and Memory-Efficient k-mer Counter with GPU-Support. CoRR abs/1607.06618 (2016) - 2015
- [j25]Sarah Hart, Ivo Hedtke, Matthias Müller-Hannemann, Sandeep Murthy:
A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication. Groups Complex. Cryptol. 7(1): 31-46 (2015) - [p2]Matthias Müller-Hannemann:
Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics. Gems of Combinatorial Optimization and Graph Algorithms 2015: 37-47 - [i5]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - 2014
- [j24]Marc Goerigk, Marie Schmidt, Anita Schöbel, Martin Knoth, Matthias Müller-Hannemann:
The Price of Strict and Light Robustness in Timetable Information. Transp. Sci. 48(2): 225-242 (2014) - [c49]Ivo Hedtke, Ioana M. Lemnian, Matthias Müller-Hannemann, Ivo Grosse:
On Optimal Read Trimming in Next Generation Sequencing and Its Complexity. AlCoB 2014: 83-94 - [c48]Martin Lemnian, Ralf Rückert, Steffen Rechner, Christoph Blendinger, Matthias Müller-Hannemann:
Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays. ATMOS 2014: 122-137 - [c47]Clemens Beckstein, Sebastian Böcker, Martin Bogdan, Helge Bruehlheide, H. Martin Bücker, Joachim Denzler, Peter Dittrich, Ivo Grosse, Alexander Hinneburg, Birgitta König-Ries, Felicitas Löffler, Manja Marz, Matthias Müller-Hannemann, Martin Winter, Wolf Zimmermann:
Explorative Analysis of Heterogeneous, Unstructured, and Uncertain Data - A Computer Science Perspective on Biodiversity Research. DATA 2014: 251-257 - 2013
- [j23]Stephan Winter, Matthias Müller-Hannemann:
5th ACM SIGSPATIAL International Workshop on Computational Transportation Science. ACM SIGSPATIAL Special 5(1): 5-6 (2013) - [c46]Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel:
Recoverable Robust Timetable Information. ATMOS 2013: 1-14 - 2012
- [j22]Steffen Schiele, Markus Möller, Holger Blaar, Detlef Thürkow, Matthias Müller-Hannemann:
Parallelization strategies to deal with non-localities in the calculation of regional land-surface parameters. Comput. Geosci. 44: 1-9 (2012) - [c45]Steffen Schiele, Holger Blaar, Detlef Thürkow, Markus Möller, Matthias Müller-Hannemann:
Parallelization Strategies to Speed-Up Computations for Terrain Analysis on Multi-Core Processors. ARCS Workshops 2012: 457-468 - [c44]Annabell Berger, Matthias Müller-Hannemann:
How to Attack the NP-Complete Dag Realization Problem in Practice. SEA 2012: 51-62 - [e5]Stephan Winter, Matthias Müller-Hannemann:
5th ACM SIGSPATIAL International Workshop on Computational Transportation Science 2011, CTS'12, November 6, 2012, Redondo Beach, CA, USA. ACM 2012, ISBN 978-1-4503-1693-4 [contents] - [i4]Annabell Berger, Matthias Müller-Hannemann:
How to Attack the NP-complete Dag Realization Problem in Practice. CoRR abs/1203.3636 (2012) - 2011
- [j21]Siamak Tazari, Matthias Müller-Hannemann:
Dealing with large hidden constants: engineering a planar steiner tree PTAS. ACM J. Exp. Algorithmics 16 (2011) - [j20]Matthias Müller-Hannemann, Renato Fonseca F. Werneck:
Introduction to special issue ALENEX'11. ACM J. Exp. Algorithmics 17(1) (2011) - [j19]Thorsten Gunkel, Mathias Schnee, Matthias Müller-Hannemann:
How to find good night train connections. Networks 57(1): 19-27 (2011) - [c43]Marc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel:
The Price of Robustness in Timetable Information. ATMOS 2011: 76-87 - [c42]Annabell Berger, Andreas Gebhardt, Matthias Müller-Hannemann, Martin Ostrowski:
Stochastic Delay Prediction in Large Train Networks. ATMOS 2011: 100-111 - [c41]Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee:
Passenger Flow-Oriented Train Disposition. ESA 2011: 227-238 - [c40]Annabell Berger, Matthias Müller-Hannemann:
Dag Realizations of Directed Degree Sequences. FCT 2011: 264-275 - [c39]Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock:
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. WALCOM 2011: 77-88 - [e4]Matthias Müller-Hannemann, Renato Fonseca F. Werneck:
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011. SIAM 2011, ISBN 978-1-61197-291-7 [contents] - 2010
- [j18]Sebastian Wolf, Stephan Schmidt, Matthias Müller-Hannemann, Steffen Neumann:
In silico fragmentation for computer assisted identification of metabolite mass spectra. BMC Bioinform. 11: 148 (2010) - [j17]Matthias Müller-Hannemann, Siamak Tazari:
A near linear time approximation scheme for Steiner tree among obstacles in the plane. Comput. Geom. 43(4): 395-409 (2010) - [c38]Matthias Müller-Hannemann, Stefan Schirra:
Foundations of Algorithm Engineering. Algorithm Engineering 2010: 1-15 - [c37]Matthias Müller-Hannemann, Stefan Schirra:
Challenges in Algorithm Engineering. Algorithm Engineering 2010: 446-453 - [c36]Annabell Berger, Martin Grimmer, Matthias Müller-Hannemann:
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. SEA 2010: 35-46 - [c35]Annabell Berger, Matthias Müller-Hannemann:
Uniform Sampling of Digraphs with a Fixed Degree Sequence. WG 2010: 220-231 - [e3]Matthias Müller-Hannemann, Stefan Schirra:
Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar]. Lecture Notes in Computer Science 5971, Springer 2010, ISBN 978-3-642-14865-1 [contents] - [e2]Jason Dykes, Matthias Müller-Hannemann, Alexander Wolff:
Schematization in Cartography, Visualization, and Computational Geometry, 14.11. - 19.11.2010. Dagstuhl Seminar Proceedings 10461, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i3]Jason Dykes, Matthias Müller-Hannemann, Alexander Wolff:
10461 Abstracts Collection and Summary - Schematization in Cartography, Visualization, and Computational Geometry. Schematization in Cartography, Visualization, and Computational Geometry 2010 - [i2]Christoph Fretter, Lachezar Krumov, Karsten Weihe, Matthias Müller-Hannemann, Marc-Thorsten Hütt:
Phase Synchronization in Railway Timetables. CoRR abs/1003.4012 (2010)
2000 – 2009
- 2009
- [j16]Siamak Tazari, Matthias Müller-Hannemann:
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. Discret. Appl. Math. 157(4): 673-684 (2009) - [j15]Matthias Müller-Hannemann, Alexander Sonnikow:
Non-approximability of just-in-time scheduling. J. Sched. 12(5): 555-562 (2009) - [c34]Siamak Tazari, Matthias Müller-Hannemann:
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. ALENEX 2009: 120-131 - [c33]Annabell Berger, Daniel Delling, Andreas Gebhardt, Matthias Müller-Hannemann:
Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. ATMOS 2009 - [p1]Matthias Müller-Hannemann, Mathias Schnee:
Efficient Timetable Information in the Presence of Delays. Robust and Online Large-Scale Optimization 2009: 249-272 - [i1]Annabell Berger, Matthias Müller-Hannemann:
Uniform sampling of undirected and directed graphs with a fixed degree sequence. CoRR abs/0912.0685 (2009) - 2008
- [c32]Lennart Frede, Matthias Müller-Hannemann, Mathias Schnee:
Efficient On-Trip Timetable Information in the Presence of Delays. ATMOS 2008 - [c31]Yann Disser, Matthias Müller-Hannemann, Mathias Schnee:
Multi-criteria Shortest Paths in Time-Dependent Train Networks. WEA 2008: 347-361 - [c30]Siamak Tazari, Matthias Müller-Hannemann:
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. WG 2008: 360-371 - 2007
- [j14]Anders Eriksson, Kurt Marti, Matthias Müller-Hannemann, Barry H. V. Topping, Carlos A. Mota Soares:
Engineering Computational Technology. Adv. Eng. Softw. 38(11-12): 723-725 (2007) - [j13]Matthias Müller-Hannemann, Anna Schulze:
Hardness and Approximation of Octilinear Steiner Trees. Int. J. Comput. Geom. Appl. 17(3): 231-260 (2007) - [c29]Thorsten Gunkel, Matthias Müller-Hannemann, Mathias Schnee:
Improved Search for Night Train Connections. ATMOS 2007 - [c28]Matthias Müller-Hannemann, Siamak Tazari:
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. WADS 2007: 151-162 - 2006
- [j12]Matthias Müller-Hannemann, Karsten Weihe:
On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147(1): 269-286 (2006) - [j11]Matthias Müller-Hannemann, Karsten Weihe:
Moving policies in cyclic assembly line scheduling. Theor. Comput. Sci. 351(3): 425-436 (2006) - [c27]Riko Jacob, Matthias Müller-Hannemann:
ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. ATMOS 2006 - [c26]Riko Jacob, Matthias Müller-Hannemann:
ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways. ATMOS 2006 - [c25]Matthias Müller-Hannemann, Anna Schulze:
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles. SWAT 2006: 242-254 - [c24]Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe:
Workload Balancing in Multi-stage Production Processes. WEA 2006: 49-60 - [e1]Riko Jacob, Matthias Müller-Hannemann:
ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, September 14, 2006, ETH Zürich, Zurich, Switzerland, Selected Papers. OASIcs 6, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [c23]Matthias Müller-Hannemann, Mathias Schnee:
Paying Less for Train Connections with MOTIS. ATMOS 2005 - [c22]Matthias Müller-Hannemann, Anna Schulze:
Hardness and Approximation of Octilinear Steiner Trees. ISAAC 2005: 256-265 - 2004
- [c21]Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Timetable Information: Models and Algorithms. ATMOS 2004: 67-90 - [c20]Matthias Müller-Hannemann, Mathias Schnee:
Finding All Attractive Train Connections by Multi-criteria Pareto Search. ATMOS 2004: 246-263 - [c19]Matthias Müller-Hannemann, Karsten Weihe:
Moving Policies in Cyclic Assembly-Line Scheduling. IWPEC 2004: 149-161 - 2003
- [c18]Matthias Müller-Hannemann, Ute Zimmermann:
Slack Optimization of Timing-Critical Nets. ESA 2003: 727-739 - [c17]Matthias Müller-Hannemann, Sven Peyer:
Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles. WADS 2003: 207-218 - 2002
- [j10]Matthias Müller-Hannemann:
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation. Comput. Geom. 22(1-3): 75-97 (2002) - [c16]Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe:
Getting Train Timetables into the Main Storage. ATMOS 2002: 8-17 - 2001
- [j9]Cornelia Kober, Matthias Müller-Hannemann:
A Case Study in Hexahedral Mesh Generation: Simulation of the Human Mandible. Eng. Comput. 17(3): 249-260 (2001) - [j8]Matthias Müller-Hannemann:
Shelling Hexahedral Complexes for Mesh Generation. J. Graph Algorithms Appl. 5(5): 59-91 (2001) - [c15]Matthias Müller-Hannemann, Cornelia Kober, Robert Sader, Hans-Florian Zeilhofer:
Anisotropic Validation of Hexahedral Meshes for Composite Materials in Biomechanics. IMR 2001 - [c14]Matthias Müller-Hannemann, Karsten Weihe:
Pareto Shortest Paths is Often Feasible in Practice. WAE 2001: 185-198 - 2000
- [j7]Rolf H. Möhring, Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilater. Algorithmica 26(1): 148-171 (2000) - [j6]Matthias Müller-Hannemann, Karsten Weihe:
Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. Int. J. Comput. Geom. Appl. 10(1): 1-40 (2000) - [j5]Matthias Müller-Hannemann:
High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques. Int. J. Comput. Geom. Appl. 10(3): 285-307 (2000) - [j4]Matthias Müller-Hannemann, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ACM J. Exp. Algorithmics 5: 8 (2000) - [c13]Matthias Müller-Hannemann:
Improving the surface cycle structure for hexahedral mesh generation. SCG 2000: 19-28 - [c12]Cornelia Kober, Matthias Müller-Hannemann:
Hexahedral Mesh Generation for the Simulation of the Human Mandible. IMR 2000: 423-434
1990 – 1999
- 1999
- [j3]Matthias Müller-Hannemann:
Hexahedral Mesh Generation by Successive Dual Cycle Elimination. Eng. Comput. 15(3): 269-279 (1999) - [j2]Matthias Müller-Hannemann, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. ACM J. Exp. Algorithmics 4: 7 (1999) - [c11]Matthias Müller-Hannemann, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. ALENEX 1999: 18-36 - [c10]Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm:
Empirical Design of Geometric Algorithms. SCG 1999: 86-94 - [c9]Matthias Müller-Hannemann:
Drawing Trees, Series-Parallel Digraphs, and Lattices. Drawing Graphs 1999: 46-70 - [c8]Matthias Müller-Hannemann:
Kombinatorische Algorithmen zur Netzgenerierung im CAD. GI Jahrestagung 1999: 138-145 - [c7]Matthias Müller-Hannemann:
Combinatorics Helps for Hexahedral Mesh Generation in CAD. SODA 1999: 949-950 - 1998
- [c6]Matthias Müller-Hannemann:
Hexahedral Mesh generation by Successive Dual Cycle Elimination. IMR 1998: 379-393 - [c5]Matthias Müller-Hannemann, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. WAE 1998: 86-97 - 1997
- [b1]Matthias Müller-Hannemann:
Quadrilateral mesh generation in computer aided design. Berlin Institute of Technology, Cuvillier 1997, ISBN 3-89712-031-3, pp. 1-179 - [j1]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) - [c4]Matthias Müller-Hannemann, Karsten Weihe:
Minimum Strictly Convex Quadrangulations of Convex Polygons. SCG 1997: 193-202 - [c3]Matthias Müller-Hannemann, Karsten Weihe:
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. ESA 1997: 364-377 - [c2]Rolf H. Möhring, Matthias Müller-Hannemann:
Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. ISAAC 1997: 263-272 - 1995
- [c1]Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe:
Using Network Flows for Surface Modeling. SODA 1995: 350-359
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-08-22 20:47 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:
