default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerhard Reinelt
Person information
- affiliation: Heidelberg University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c24]Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt:
PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. IPEC 2024: 27:1-27:4- 2022
- [j66]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics 27: 1.3:1-1.3:4 (2022) - 2021
- [j65]Michael Jünger, Elisabeth Lobe
, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk:
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26: 1.9:1-1.9:30 (2021)
2010 – 2019
- 2019
- [j64]Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Andreas Spitz:
A mixed integer linear programming model for multi-satellite scheduling. Eur. J. Oper. Res. 275(2): 694-707 (2019) - [i7]Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk:
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR abs/1904.11965 (2019) - 2018
- [j63]Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Maocai Wang:
Priority-based and conflict-avoidance heuristics for multi-satellite scheduling. Appl. Soft Comput. 69: 177-191 (2018) - [j62]Xiaoyu Chen, Guangming Dai, Gerhard Reinelt, Maocai Wang:
A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization. IEEE Commun. Lett. 22(3): 534-537 (2018) - [i6]Ruobing Shen, Xiaoyu Chen, Xiangrui Zheng, Gerhard Reinelt:
Discrete Potts Model for Generating Superpixels on Noisy Images. CoRR abs/1803.07351 (2018) - [i5]Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Andreas Spitz:
A Mixed Integer Linear Programming Model for Multi-Satellite Scheduling. CoRR abs/1811.12114 (2018) - 2017
- [c23]Ruobing Shen, Gerhard Reinelt, Stéphane Canu:
A First Derivative Potts Model for Segmentation and Denoising Using ILP. OR 2017: 53-59 - [i4]Ruobing Shen, Gerhard Reinelt, Stéphane Canu:
A First Derivative Potts Model for Segmentation and Denoising Using MILP. CoRR abs/1709.07212 (2017) - [i3]Ruobing Shen, Eric Kendinibilir, Ismail Ben Ayed, Andrea Lodi, Andrea Tramontani, Gerhard Reinelt:
An ILP Solver for Multi-label MRFS with Connectivity Constraints. CoRR abs/1712.06020 (2017) - 2016
- [j61]Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr:
Higher-order segmentation via multicuts. Comput. Vis. Image Underst. 143: 104-119 (2016) - [i2]Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr:
Symmetry-free SDP Relaxations for Affine Subspace Clustering. CoRR abs/1607.07387 (2016) - 2015
- [j60]Stefan Wiesberg, Gerhard Reinelt:
Evaluating the quality of image matrices in blockmodeling. EURO J. Comput. Optim. 3(2): 111-129 (2015) - [j59]Stefan Lörwald, Gerhard Reinelt:
PANDA: a software for polyhedral transformations. EURO J. Comput. Optim. 3(4): 297-308 (2015) - [j58]Achim Hildenbrandt, Gerhard Reinelt:
Inter Programming Models for the Target Visitation Problem. Informatica (Slovenia) 39(3) (2015) - [j57]Stefan Wiesberg, Gerhard Reinelt:
Relaxations in Practical Clustering and Blockmodeling. Informatica (Slovenia) 39(3) (2015) - [j56]Michael N. Jung, Gerhard Reinelt, Sebastian Sager:
The Lagrangian relaxation for the combinatorial integral approximation problem. Optim. Methods Softw. 30(1): 54-80 (2015) - [c22]Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr:
A Convex Relaxation Approach to the Affine Subspace Clustering Problem. GCPR 2015: 67-78 - 2014
- [j55]Rosario M. Piro, Stefan Wiesberg, Gunnar Schramm, Nico Rebel, Marcus Oswald, Roland Eils, Gerhard Reinelt, Rainer König:
Network topology-based detection of differential gene regulation and regulatory switches in cell metabolism and signaling. BMC Syst. Biol. 8: 56 (2014) - [j54]János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt:
On-line bin packing with restricted repacking. J. Comb. Optim. 27(1): 115-131 (2014) - [j53]József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt:
A branch-and-bound algorithm for the coupled task problem. Math. Methods Oper. Res. 80(1): 47-81 (2014) - [j52]Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi:
Lifting and separation procedures for the cut polytope. Math. Program. 146(1-2): 351-378 (2014) - 2013
- [j51]Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg:
A Flow Formulation for the Optimum Communication Spanning Tree. Electron. Notes Discret. Math. 41: 85-92 (2013) - [c21]Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr:
Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization. CVPR 2013: 1752-1758 - [i1]Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr:
Higher-order Segmentation via Multicuts. CoRR abs/1305.6387 (2013) - 2012
- [j50]Rafael Martí, Gerhard Reinelt, Abraham Duarte:
A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput. Optim. Appl. 51(3): 1297-1317 (2012) - [j49]Marcus Oswald, Gerhard Reinelt, Stefan Wiesberg:
Exact solution of the 2-dimensional grid arrangement problem. Discret. Optim. 9(3): 189-199 (2012) - [j48]Steffen Rebennack, Gerhard Reinelt, Panos M. Pardalos:
A tutorial on branch and cut algorithms for the maximum stable set problem. Int. Trans. Oper. Res. 19(1-2): 161-199 (2012) - [j47]Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis:
New results on the Windy Postman Problem. Math. Program. 132(1-2): 309-332 (2012) - 2011
- [j46]Pei Wang, Gerhard Reinelt, Peng Gao, Yuejin Tan:
A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation. Comput. Ind. Eng. 61(2): 322-335 (2011) - [j45]Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos:
A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21(4): 434-457 (2011) - [j44]Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi:
Optimal linear arrangements using betweenness variables. Math. Program. Comput. 3(3): 261-280 (2011) - [c20]Jörg H. Kappes, Markus Speth, Björn Andres, Gerhard Reinelt, Christoph Schnörr:
Globally Optimal Image Partitioning by Multicuts. EMMCVPR 2011: 31-44 - 2010
- [j43]Gunnar Schramm, Stefan Wiesberg, Nicolle Diessl, Anna-Lena Kranz, Vitalia Sagulenko, Marcus Oswald, Gerhard Reinelt, Frank Westermann, Roland Eils, Rainer König:
PathWave: discovering patterns of differentially regulated enzymes in metabolic pathways. Bioinform. 26(9): 1225-1231 (2010) - [j42]Gerhard Reinelt, Klaus Michael Wenger:
Generating partitions of a graph into a fixed number of minimum weight cuts. Discret. Optim. 7(1-2): 1-12 (2010) - [j41]Pei Wang, Gerhard Reinelt:
A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations. Electron. Notes Discret. Math. 36: 711-718 (2010) - [j40]Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010) - [c19]Pei Wang, Gerhard Reinelt:
Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price. OR 2010: 491-496 - [e2]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2009
- [j39]Johanna Mazur, Daniel Ritter, Gerhard Reinelt, Lars Kaderali:
Reconstructing nonlinear dynamic models of gene regulation using stochastic sampling. BMC Bioinform. 10: 448 (2009) - [j38]Sebastian Sager, Hans Georg Bock, Gerhard Reinelt:
Direct methods with maximal lower bound for mixed-integer optimal control problems. Math. Program. 118(1): 109-149 (2009) - [j37]József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt:
Improved analysis of an algorithm for the coupled task problem with UET jobs. Oper. Res. Lett. 37(2): 93-96 (2009) - [j36]Marcus Oswald, Gerhard Reinelt:
The simultaneous consecutive ones problem. Theor. Comput. Sci. 410(21-23): 1986-1992 (2009) - [c18]Eva-Maria Surmann, Gunnar Schramm, Stefan Wiesberg, Marcus Oswald, Gerhard Reinelt, Roland Eils, Rainer König:
Analyzing the regulation of metabolic pathways in human breast cancer. LWA 2009: KDML:111-118 - 2008
- [j35]Gerhard Reinelt, Dirk Oliver Theis:
On the general routing polytope. Discret. Appl. Math. 156(3): 368-384 (2008) - [j34]Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger:
Computing finest mincut partitions of a graph and application to routing problems. Discret. Appl. Math. 156(3): 385-396 (2008) - [j33]János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt:
Lower Bound for the Online Bin Packing Problem with Restricted Repacking. SIAM J. Comput. 38(1): 398-410 (2008) - [j32]Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis:
Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math. 22(4): 1480-1487 (2008) - 2007
- [j31]Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis:
On the graphical relaxation of the symmetric traveling salesman polytope. Math. Program. 110(1): 175-193 (2007) - [c17]Frank Noé, Marcus Oswald, Gerhard Reinelt:
Optimizing in Graphs with Expensive Computation of Edge Weights. OR 2007: 435-440 - [c16]Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T. Vo, Marcus Oswald, Gerhard Reinelt:
Compression of Digital Road Networks. SSTD 2007: 423-440 - 2006
- [j30]Rainer König, Gunnar Schramm, Marcus Oswald, Hanna Seitz, Sebastian Sager, Marc Zapatka, Gerhard Reinelt, Roland Eils:
Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms. BMC Bioinform. 7: 119 (2006) - [j29]Dino Ahr, Gerhard Reinelt:
A tabu search algorithm for the min-max k-Chinese postman problem. Comput. Oper. Res. 33(12): 3403-3422 (2006) - [j28]Gerhard Reinelt, Klaus Michael Wenger:
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem. INFORMS J. Comput. 18(4): 466-479 (2006) - [j27]Frank Noé, Marcus Oswald, Gerhard Reinelt, Stefan Fischer, Jeremy C. Smith:
Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the AlphaL \leftrightharpoons Beta \leftrightharpoons AlphaR Transitions in Octaalanine. Multiscale Model. Simul. 5(2): 393-419 (2006) - [j26]Gerhard Reinelt, Dirk Oliver Theis:
A note on the Undirected Rural Postman Problem polytope. Math. Program. 106(3): 447-452 (2006) - [c15]Chotiros Surapholchai, Gerhard Reinelt, Hans Georg Bock:
Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm. HPSC 2006: 557-564 - [c14]Gunnar Schramm, Marcus Oswald, Hanna Seitz, Sebastian Sager, Marc Zapatka, Gerhard Reinelt, Roland Eils, Rainer König:
Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms. LWA 2006: 350-355 - 2005
- [j25]Gerhard Reinelt, Dirk Oliver Theis:
Transformation of Facets of the General Routing Problem Polytope. SIAM J. Optim. 16(1): 220-234 (2005) - [c13]Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis:
Not Every GTSP Facet Induces an STSP Facet. IPCO 2005: 468-482 - [c12]Cara Cocking, Steffen Flessa, Gerhard Reinelt:
Locating Health Facilities in Nouna District, Burkina Faso. OR 2005: 431-436 - 2004
- [j24]Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt:
An exact algorithm for scheduling identical coupled tasks. Math. Methods Oper. Res. 59(2): 193-203 (2004) - [j23]Gerhard Reinelt:
Book review. Oper. Res. Lett. 32(5): 497-498 (2004) - [c11]Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis:
A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO 2004: 196-205 - [p1]Marcus Oswald, Gerhard Reinelt:
Computing Optimal Consecutive Ones Matrices. The Sharpest Cut 2004: 173-183 - 2003
- [j22]Marcus Oswald, Gerhard Reinelt:
The weighted consecutive ones problem for a fixed number of rows or columns. Oper. Res. Lett. 31(3): 350-356 (2003) - [c10]Tran Van Hoai, Gerhard Reinelt, Hans Georg Bock:
Advanced Column Generation Techniques for Crew Pairing Problems. HPSC 2003: 203-214 - [e1]Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi:
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers. Lecture Notes in Computer Science 2570, Springer 2003, ISBN 3-540-00580-3 [contents] - 2002
- [c9]Dino Ahr, Gerhard Reinelt:
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. ESA 2002: 64-74 - 2001
- [j21]Thomas Christof, Gerhard Reinelt:
Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. Algorithmica 30(4): 597-629 (2001) - [j20]Thomas Christof, Gerhard Reinelt:
Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes. Int. J. Comput. Geom. Appl. 11(4): 423-437 (2001) - [c8]Marcus Oswald, Gerhard Reinelt:
Constructing New Facets of the Consecutive Ones Polytope. Combinatorial Optimization 2001: 147-157 - 2000
- [j19]Norbert Ascheuer, Michael Jünger, Gerhard Reinelt:
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. 17(1): 61-84 (2000) - [c7]Marcus Oswald, Gerhard Reinelt:
Polyhedral Aspects of the Consecutive Ones Problem. COCOON 2000: 373-382
1990 – 1999
- 1998
- [c6]Thomas Christof, Marcus Oswald, Gerhard Reinelt:
Consecutive Ones and a Betweenness Problem in Computational Biology. IPCO 1998: 213-228 - 1997
- [j18]Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. J. Comput. Biol. 4(4): 433-447 (1997) - [c5]Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
A branch-and-cut approach to physical mapping with end-probes. RECOMB 1997: 84-92 - 1996
- [c4]Meinrad Funke, Gerhard Reinelt:
A Polyhedral Approach to the Feedback Vertex Set Problem. IPCO 1996: 445-459 - 1994
- [b2]Gerhard Reinelt:
The Traveling Salesman, Computational Solutions for TSP Applications. Lecture Notes in Computer Science 840, Springer 1994, ISBN 3-540-58334-3 - [j17]Michael Jünger, Stefan Thienel, Gerhard Reinelt:
Provably good solutions for the traveling salesman problem. Math. Methods Oper. Res. 40(2): 183-217 (1994) - [j16]Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel:
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Program. 63: 257-279 (1994) - 1993
- [j15]Gerhard Reinelt:
A Note on Small Linear-Ordering Polytopes. Discret. Comput. Geom. 10: 67-78 (1993) - [j14]Gerhard Reinelt:
Book review. ZOR Methods Model. Oper. Res. 37(3): 284 (1993) - [j13]M. Bischoff, Norbert Gaffke, K. Fleischmann, Gerhard Reinelt:
Book reviews. ZOR Methods Model. Oper. Res. 37(3): 332-338 (1993) - [c3]Michael Jünger, Gerhard Reinelt, Stefan Thienel:
Practical problem solving with cutting plane algorithms in combinatorialoptimization. Combinatorial Optimization 1993: 111-152 - 1992
- [j12]Gerhard Reinelt:
Fast Heuristics for Large Geometric Traveling Salesman Problems. INFORMS J. Comput. 4(2): 206-217 (1992) - 1991
- [j11]Michael Jünger, Gerhard Reinelt, Doris Zepf:
Computing correct Delaunay triangulations. Computing 47(1): 43-49 (1991) - [j10]Gerhard Reinelt:
TSPLIB - A Traveling Salesman Problem Library. INFORMS J. Comput. 3(4): 376-384 (1991) - [j9]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Optimal control of plotting and drilling machines: A case study. ZOR Methods Model. Oper. Res. 35(1): 61-84 (1991) - [j8]Thomas Christof, Michael Jünger, Gerhard Reinelt:
A complete description of the traveling salesman polytope on 8 nodes. Oper. Res. Lett. 10(9): 497-500 (1991) - 1990
- [c2]Karl Heinz Borgwardt, Norbert Gaffke, Michael Jünger, Gerhard Reinelt:
Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. Applied Geometry And Discrete Mathematics 1990: 91-108 - [c1]Gerhard Reinelt:
Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme. GI Jahrestagung (2) 1990: 517-526
1980 – 1989
- 1989
- [j7]Francisco Barahona, Michael Jünger, Gerhard Reinelt:
Experiments in quadratic 0-1 programming. Math. Program. 44(1-3): 127-137 (1989) - 1988
- [j6]Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt:
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. 36(3): 493-513 (1988) - 1987
- [j5]Reinhardt Euler, Michael Jünger, Gerhard Reinelt:
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. Math. Oper. Res. 12(3): 451-462 (1987) - 1985
- [b1]Gerhard Reinelt:
The linear ordering problem: algorithms and applications. University of Augsburg, Germany, Heldermann 1985, ISBN 978-3-88538-208-9, pp. 1-158 - [j4]Michael Jünger, Gerhard Reinelt, William R. Pulleyblank:
On partitioning the edges of graphs into connected subgraphs. J. Graph Theory 9(4): 539-549 (1985) - [j3]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
On the acyclic subgraph polytope. Math. Program. 33(1): 28-42 (1985) - [j2]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Facets of the linear ordering polytope. Math. Program. 33(1): 43-60 (1985) - 1984
- [j1]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
A Cutting Plane Algorithm for the Linear Ordering Problem. Oper. Res. 32(6): 1195-1220 (1984)
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-12-08 02:23 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:
