default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc E. Pfetsch
Person information
- affiliation: TU Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j49]Max Gläser, Marc E. Pfetsch
:
On computing small variable disjunction branch-and-bound trees. Math. Program. 206(1): 145-173 (2024)- 2023
- [j48]Frederic Matter, Marc E. Pfetsch:
Presolving for Mixed-Integer Semidefinite Optimization. INFORMS J. Optim. 5(2): 131-154 (2023) - [j47]Erik Laurin Strelow, Alf Gerisch, Jens Lang, Marc E. Pfetsch:
Physics informed neural networks: A case study for gas transport problems. J. Comput. Phys. 481: 112041 (2023) - [j46]Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
On the robustness of potential-based flow networks. Math. Program. 197(1): 337-374 (2023) - [j45]Marc E. Pfetsch, Andreas Schmitt:
A generic optimization framework for resilient systems. Optim. Methods Softw. 38(2): 356-385 (2023) - [j44]Ksenia Bestuzheva, Mathieu Besançon, Weikun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros M. Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig:
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - 2022
- [j43]Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch:
Estimating the Size of Branch-and-Bound Trees. INFORMS J. Comput. 34(2): 934-952 (2022) - [j42]Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
Packing under convex quadratic constraints. Math. Program. 192(1): 361-386 (2022) - [j41]Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura:
Optimal patchings for consecutive ones matrices. Math. Program. Comput. 14(1): 43-84 (2022) - [j40]Oliver Habeck, Marc E. Pfetsch:
Combinatorial acyclicity models for potential-based flows. Networks 79(1): 83-104 (2022) - [j39]Frederic Matter, Tobias Fischer, Marius Pesavento, Marc E. Pfetsch:
Ambiguities in DoA Estimation With Linear Arrays. IEEE Trans. Signal Process. 70: 4395-4407 (2022) - 2020
- [j38]Christopher Hojny, Tristan Gally, Oliver Habeck, Hendrik Lüthen, Frederic Matter, Marc E. Pfetsch, Andreas Schmitt:
Knapsack polytopes: a survey. Ann. Oper. Res. 292(1): 469-517 (2020) - [j37]Tobias Fischer, Marc E. Pfetsch:
On the structure of linear programs with overlapping cardinality constraints. Discret. Appl. Math. 275: 42-68 (2020) - [j36]Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann:
Sparse recovery with integrality constraints. Discret. Appl. Math. 283: 346-366 (2020) - 2019
- [j35]Kai Kellner, Marc E. Pfetsch, Thorsten Theobald:
Irreducible Infeasible Subsystems of Semidefinite Systems. J. Optim. Theory Appl. 181(3): 727-742 (2019) - [j34]Christopher Hojny, Marc E. Pfetsch:
Polytopes associated with symmetry handling. Math. Program. 175(1-2): 197-240 (2019) - [j33]Marc E. Pfetsch, Thomas Rehn:
A computational comparison of symmetry handling methods for mixed integer programs. Math. Program. Comput. 11(1): 37-93 (2019) - [j32]Martin Groß, Marc E. Pfetsch, Lars Schewe, Martin Schmidt, Martin Skutella:
Algorithmic results for potential-based flows: Easy and hard cases. Networks 73(3): 306-324 (2019) - [j31]Christopher Hojny, Hendrik Lüthen, Marc E. Pfetsch:
Sparsity of integer formulations for binary programs. Oper. Res. Lett. 47(5): 348-352 (2019) - [j30]Oliver Habeck, Marc E. Pfetsch, Stefan Ulbrich:
Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport. SIAM J. Optim. 29(4): 2949-2985 (2019) - 2018
- [j29]Imke Joormann, Marc E. Pfetsch:
Complexity of minimum irreducible infeasible subsystem covers for flow networks. Discret. Appl. Math. 244: 124-142 (2018) - [j28]Pierre Le Bodic, Jeffrey William Pavelka, Marc E. Pfetsch, Sebastian Pokutta:
Solving MIPs via scaling-based augmentation. Discret. Optim. 27: 1-25 (2018) - [j27]Tobias Fischer, Marc E. Pfetsch:
Branch-and-cut for linear programs with overlapping SOS1 constraints. Math. Program. Comput. 10(1): 33-68 (2018) - [j26]Tristan Gally, Marc E. Pfetsch, Stefan Ulbrich:
A framework for solving mixed-integer semidefinite programs. Optim. Methods Softw. 33(3): 594-632 (2018) - [j25]Martin Groß, Marc E. Pfetsch, Martin Skutella:
On the complexity of instationary gas flows. Oper. Res. Lett. 46(3): 286-290 (2018) - [j24]Christian Steffens, Marius Pesavento, Marc E. Pfetsch:
A Compact Formulation for the $\ell _{2, 1}$ Mixed-Norm Minimization Problem. IEEE Trans. Signal Process. 66(6): 1483-1497 (2018) - 2017
- [j23]Martin Schmidt, Denis Aßmann, Robert Burlacu, Jesco Humpola, Imke Joormann, Nikolaos Kanelakis, Thorsten Koch, Djamal Oucherif, Marc E. Pfetsch, Lars Schewe, Robert Schwarz, Mathias Sirvent:
GasLib - A Library of Gas Network Instances. Data 2(4): 40 (2017) - [j22]Tobias Fischer, Marc E. Pfetsch:
Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints. Oper. Res. Lett. 45(6): 556-560 (2017) - 2016
- [j21]Christopher Hojny, Marc E. Pfetsch:
A polyhedral investigation of star colorings. Discret. Appl. Math. 208: 59-78 (2016) - [j20]Imke Joormann, James B. Orlin, Marc E. Pfetsch:
A characterization of irreducible infeasible subsystems in flow networks. Networks 68(2): 121-129 (2016) - 2015
- [j19]Marc E. Pfetsch, Armin Fügenschuh, Björn Geißler, Nina Geißler, Ralf Gollmer, Benjamin Hiller, Jesco Humpola, Thorsten Koch, Thomas Lehmann, Alexander Martin, Antonio Morsi, Jessica Rövekamp, Lars Schewe, Martin Schmidt, Rüdiger Schultz, Robert Schwarz, Jonas Schweiger, Claudia Stangl, Marc Christian Steinbach, Stefan Vigerske, Bernhard M. Willert:
Validation of nominations in gas network optimization: models, methods, and solutions. Optim. Methods Softw. 30(1): 15-53 (2015) - [j18]Dirk A. Lorenz, Marc E. Pfetsch, Andreas M. Tillmann:
Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison. ACM Trans. Math. Softw. 41(2): 8:1-8:29 (2015) - 2014
- [j17]Dirk A. Lorenz, Marc E. Pfetsch, Andreas M. Tillmann:
An infeasible-point subgradient method using adaptive approximate projections. Comput. Optim. Appl. 57(2): 271-306 (2014) - [j16]Andreas M. Tillmann, Marc E. Pfetsch:
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing. IEEE Trans. Inf. Theory 60(2): 1248-1259 (2014) - 2013
- [j15]Sven Herrmann, Michael Joswig, Marc E. Pfetsch:
Computing the bounded subcomplex of an unbounded polyhedron. Comput. Geom. 46(5): 541-551 (2013) - [j14]Luigi De Giovanni, G. Massi, Ferdinando Pezzella, Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura:
A heuristic and an exact method for the gate matrix connection cost minimization problem. Int. Trans. Oper. Res. 20(5): 627-643 (2013) - [j13]Ralf Borndörfer, Marika Karbstein, Marc E. Pfetsch:
The Steiner connectivity problem. Math. Program. 142(1-2): 133-167 (2013) - 2012
- [j12]Ralf Borndörfer, Marika Karbstein, Marc E. Pfetsch:
Models for fare planning in public transport. Discret. Appl. Math. 160(18): 2591-2605 (2012) - 2011
- [j11]Tim Januschowski, Marc E. Pfetsch:
The maximum k-colorable subgraph problem and orbitopes. Discret. Optim. 8(3): 478-494 (2011) - [j10]Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch:
Orbitopal fixing. Discret. Optim. 8(4): 595-610 (2011) - [j9]Luis Miguel Torres, Ramiro Torres, Ralf Borndörfer, Marc E. Pfetsch:
Line planning on tree networks with applications to the Quito Trolebús system. Int. Trans. Oper. Res. 18(4): 455-472 (2011) - 2009
- [j8]Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
Competitive Online Multicommodity Routing. Theory Comput. Syst. 45(3): 533-554 (2009) - 2008
- [j7]Marc E. Pfetsch:
Branch-and-Cut for the Maximum Feasible Subsystem Problem. SIAM J. Optim. 19(1): 21-38 (2008) - [j6]Sadegh Jokar, Marc E. Pfetsch:
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations. SIAM J. Sci. Comput. 31(1): 23-44 (2008) - 2007
- [j5]Ralf Borndörfer, Martin Grötschel, Marc E. Pfetsch:
A Column-Generation Approach to Line Planning in Public Transport. Transp. Sci. 41(1): 123-132 (2007) - 2006
- [j4]Michael Joswig, Marc E. Pfetsch:
Computing Optimal Morse Matchings. SIAM J. Discret. Math. 20(1): 11-25 (2006) - 2004
- [j3]Michael Joswig, Marc E. Pfetsch:
Computing Optimal Discrete Morse Functions. Electron. Notes Discret. Math. 17: 191-195 (2004) - 2003
- [j2]Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.:
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Program. 95(3): 533-554 (2003) - 2002
- [j1]Volker Kaibel, Marc E. Pfetsch:
Computing the face lattice of a polytope from its vertex-facet incidences. Comput. Geom. 23(3): 281-290 (2002)
Conference and Workshop Papers
- 2024
- [c28]Tianyi Liu, Sai Pavan Deram, Khaled Ardah, Martin Haardt, Marc E. Pfetsch, Marius Pesavento:
Gridless Parameter Estimation in Partly Calibrated Rectangular Arrays. ICASSP 2024: 8796-8800 - [c27]Max Gläser, Marc E. Pfetsch:
Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation. SODA 2024: 3747-3764 - 2023
- [c26]Tianyi Liu, Frederic Matter, Alexander Sorg, Marc E. Pfetsch, Martin Haardt, Marius Pesavento:
Joint Sparse Estimation with Cardinality Constraint via Mixed-Integer Semidefinite Programming. CAMSAP 2023: 106-110 - [c25]Christopher Hojny, Marc E. Pfetsch:
Handling Symmetries in Mixed-Integer Semidefinite Programs. CPAIOR 2023: 69-78 - [c24]Daniel Thuerck, Boro Sofranac, Marc E. Pfetsch, Sebastian Pokutta:
Learning Cuts via Enumeration Oracles. NeurIPS 2023 - 2022
- [c23]Max Gläser, Marc E. Pfetsch:
On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. IPCO 2022: 291-304 - 2021
- [c22]Johannes Sindt, Allan Almeida Santos, Marc E. Pfetsch, Florian Steinke:
Evaluation of Multiparametric Linear Programming for Economic Dispatch under Uncertainty. ISGT-Europe 2021: 1-5 - [c21]Lena C. Altherr, Philipp Leise, Marc E. Pfetsch, Andreas Schmitt:
Optimization of Wear Related Material Costs of a Hydrostatic Transmission System via MINLP. OR 2021: 331-337 - 2020
- [c20]Marc E. Pfetsch, Sebastian Pokutta:
IPBoost - Non-Convex Boosting via Integer Programming. ICML 2020: 7663-7672 - [c19]Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
Packing Under Convex Quadratic Constraints. IPCO 2020: 266-279 - 2019
- [c18]Marc E. Pfetsch, Andreas Schmitt:
Exploiting Partial Convexity of Pump Characteristics in Water Network Design. OR 2019: 497-503 - 2018
- [c17]Tobias Fischer, Ganapati Hegde, Frederic Matter, Marius Pesavento, Marc E. Pfetsch, Andreas M. Tillmann:
Joint Antenna Selection and Phase-only Beamforming using Mixed-Integer Nonlinear Programming. WSA 2018: 1-7 - 2017
- [c16]Ganapati Hegde, Marius Pesavento, Marc E. Pfetsch:
Joint active device identification and symbol detection using sparse constraints in massive MIMO systems. EUSIPCO 2017: 703-707 - [c15]Christian Steffens, Marius Pesavento, Marc E. Pfetsch:
A compact formulation for the l21 mixed-norm minimization problem. ICASSP 2017: 4730-4734 - [c14]Christopher Hojny, Marc E. Pfetsch, Andreas Schmitt:
Extended Formulations for Column Constrained Orbitopes. OR 2017: 197-203 - 2016
- [c13]Daniel Thuerck, Michael Waechter, Sven Widmer, Max von Bülow, Patrick Seemann, Marc E. Pfetsch, Michael Goesele:
A fast, massively parallel solver for large, irregular pairwise Markov random fields. High Performance Graphics 2016: 173-183 - [c12]Lena C. Altherr, Bastian Dörig, Thorsten Ederer, Peter F. Pelz, Marc E. Pfetsch, Jan Wolf:
A Mixed-Integer Nonlinear Program for the Design of Gearboxes. OR 2016: 227-233 - 2014
- [c11]Andreas M. Tillmann, Rémi Gribonval, Marc E. Pfetsch:
Projection onto the cosparse set is NP-hard. ICASSP 2014: 7148-7152 - 2011
- [c10]Tim Januschowski, Marc E. Pfetsch:
Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry. CPAIOR 2011: 99-116 - 2009
- [c9]Timo Berthold, Stefan Heinz, Marc E. Pfetsch:
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. SAT 2009: 441-446 - 2008
- [c8]Luis Miguel Torres, Ramiro Torres, Ralf Borndörfer, Marc E. Pfetsch:
Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System. ATMOS 2008 - 2007
- [c7]Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch:
Orbitopal Fixing. IPCO 2007: 74-88 - 2006
- [c6]Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
Competitive Online Multicommodity Routing. WAOA 2006: 240-252 - 2005
- [c5]Marc E. Pfetsch, Ralf Borndörfer:
Routing in Line Planning for Public Transport. OR 2005: 405-410 - [c4]Ralf Borndörfer, Marika Neumann, Marc E. Pfetsch:
Optimal Fares for Public Transport. OR 2005: 591-596 - 2004
- [c3]Michael Joswig, Marc E. Pfetsch:
Computing Optimal Discrete Morse Functions. CTW 2004: 170-174 - 2003
- [c2]Volker Kaibel, Marc E. Pfetsch:
Some Algorithmic Problems in Polytope Theory. Algebra, Geometry, and Software Systems 2003: 23-47 - 1999
- [c1]Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.:
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. IPCO 1999: 45-59
Parts in Books or Collections
- 2015
- [p5]Jessica Rövekamp, Thorsten Koch, Marc E. Pfetsch:
Chapter 1: Introduction. Evaluating Gas Network Capacities 2015: 3-16 - [p4]Armin Fügenschuh, Björn Geißler, Ralf Gollmer, Antonio Morsi, Jessica Rövekamp, Martin Schmidt, Klaus Spreckelsen, Marc Christian Steinbach, Marc E. Pfetsch:
Chapter 2: Physical and technical fundamentals of gas networks. Evaluating Gas Network Capacities 2015: 17-43 - [p3]Dagmar Bargmann, Mirko Ebbers, Nina Heinecke, Veronika Kühl, Antje Pelzer, Jessica Rövekamp, Klaus Spreckelsen, Thorsten Koch, Marc E. Pfetsch:
Chapter 4: State of the art in evaluating gas network capacities. Evaluating Gas Network Capacities 2015: 65-84 - [p2]Alexander Martin, Lars Schewe, Thorsten Koch, Marc E. Pfetsch:
Chapter 5: Mathematical optimization for evaluating gas network capacities. Evaluating Gas Network Capacities 2015: 87-102 - [p1]Jesco Humpola, Thomas Lehmann, Ralf Lenz, Antonio Morsi, Martin Schmidt, Robert Schwarz, Jonas Schweiger, Claudia Stangl, Bernhard M. Willert, Benjamin Hiller, Marc E. Pfetsch, Lars Schewe:
Chapter 12: Computational results for validation of nominations. Evaluating Gas Network Capacities 2015: 233-270
Editorship
- 2015
- [e1]Thorsten Koch, Benjamin Hiller, Marc E. Pfetsch, Lars Schewe:
Evaluating Gas Network Capacities. MOS-SIAM Series on Optimization 21, SIAM 2015, ISBN 978-1-611-97368-6 [contents]
Informal and Other Publications
- 2024
- [i16]Ji-Ung Lee, Marc E. Pfetsch, Iryna Gurevych:
Constrained C-Test Generation via Mixed-Integer Programming. CoRR abs/2404.08821 (2024) - 2021
- [i15]Khaled Ardah, Martin Haardt, Tianyi Liu, Frederic Matter, Marius Pesavento, Marc E. Pfetsch:
Recovery under Side Constraints. CoRR abs/2106.09375 (2021) - [i14]Frederic Matter, Tobias Fischer, Marius Pesavento, Marc E. Pfetsch:
Ambiguities in Direction-of-Arrival Estimation with Linear Arrays. CoRR abs/2110.10756 (2021) - 2020
- [i13]Marc E. Pfetsch, Sebastian Pokutta:
IPBoost - Non-Convex Boosting via Integer Programming. CoRR abs/2002.04679 (2020) - 2019
- [i12]Janin Heuer, Frederic Matter, Marc E. Pfetsch, Thorsten Theobald:
Block-sparse Recovery of Semidefinite Systems and Generalized Null Space Conditions. CoRR abs/1907.09442 (2019) - [i11]Tristan Gally, Peter Groche, Florian Hoppe, Anja Kuttich, Alexander Matei, Marc E. Pfetsch, Martin Rakowitsch, Stefan Ulbrich:
Identification of Model Uncertainty via Optimal Design of Experiments applied to a Mechanical Press. CoRR abs/1910.08408 (2019) - [i10]Christopher Hojny, Marc E. Pfetsch, Matthias Walter:
Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials. CoRR abs/1911.06894 (2019) - 2018
- [i9]Tobias Fischer, Ganapati Hegde, Frederic Matter, Marius Pesavento, Marc E. Pfetsch, Andreas M. Tillmann:
Joint Antenna Selection and Phase-Only Beamforming Using Mixed-Integer Nonlinear Programming. CoRR abs/1802.07990 (2018) - 2017
- [i8]Martin Groß, Marc E. Pfetsch, Martin Skutella:
On the Complexity of Instationary Gas Flows. CoRR abs/1708.08748 (2017) - 2016
- [i7]Christian Steffens, Marius Pesavento, Marc E. Pfetsch:
A Compact Formulation for the ℓ2, 1 Mixed-Norm Minimization Problem. CoRR abs/1606.07231 (2016) - [i6]Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann:
Sparse Recovery With Integrality Constraints. CoRR abs/1608.08678 (2016) - 2015
- [i5]Christopher Hojny, Marc E. Pfetsch:
Symmetry Handling via Symmetry Breaking Polytopes. CTW 2015: 63-66 - 2013
- [i4]Andreas M. Tillmann, Rémi Gribonval, Marc E. Pfetsch:
Projection Onto The k-Cosparse Set is NP-Hard. CoRR abs/1303.5305 (2013) - 2012
- [i3]Andreas M. Tillmann, Marc E. Pfetsch:
The Computational Complexity of RIP, NSP, and Related Concepts in Compressed Sensing. CoRR abs/1205.2081 (2012) - 2011
- [i2]Sándor P. Fekete, Alexander Kroeller, Martin Lorek, Marc E. Pfetsch:
Disruption Management with Rescheduling of Trips and Vehicle Circulations. CoRR abs/1101.2123 (2011) - 2009
- [i1]Ralf Borndörfer, Marika Neumann, Marc E. Pfetsch:
Line Planning and Connectivity. Models and Algorithms for Optimization in Logistics 2009
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-07 22:27 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:
