default search action
Friedrich Eisenbrand
Person information
- affiliation: Swiss Federal Institute of Technology in Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c52]Friedrich Eisenbrand, Matthieu Haeberle, Neta Singer:
An Improved Bound on Sums of Square Roots via the Subspace Theorem. SoCG 2024: 54:1-54:8 - [c51]Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki:
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. FOCS 2024: 1610-1620 - [i27]Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki:
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR abs/2404.03747 (2024) - [i26]Matthieu Haeberle, Puck van Gerwen, Rubén Laplaza, Ksenia R. Briling, Jan Weinreich, Friedrich Eisenbrand, Clémence Corminboeuf:
Integer linear programming for unsupervised training set selection in molecular machine learning. CoRR abs/2410.16122 (2024) - 2023
- [j40]Friedrich Eisenbrand
, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6): 595-598 (2023) - [c50]Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From Approximate to Exact Integer Programming. IPCO 2023: 100-114 - [c49]Christoph Finkensiep, Matthieu Haeberle, Friedrich Eisenbrand, Markus Neuwirth, Martin Rohrmeier:
Repetition-Structure Inference With Formal Prototypes. ISMIR 2023: 383-390 - [i25]Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi:
Integer points in the degree-sequence polytope. CoRR abs/2305.06732 (2023) - [i24]Friedrich Eisenbrand, Matthieu Haeberle, Neta Singer:
An improved bound on sums of square roots via the subspace theorem. CoRR abs/2312.02057 (2023) - 2022
- [j39]Friedrich Eisenbrand, Moritz Venzin
Approximate CVPp in time 20.802n. J. Comput. Syst. Sci. 124: 129-139 (2022) - [j38]Raimon Fabregat
Metric learning for kernel ridge regression: assessment of molecular similarity. Mach. Learn. Sci. Technol. 3(3): 35015 (2022) - [i23]Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From approximate to exact integer programming. CoRR abs/2211.03859 (2022) - 2021
- [c48]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA 2021: 33:1-33:14 - [c47]Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA 2021: 1666-1681 - [i22]Friedrich Eisenbrand, Martina Gallato, Ola Svensson, Moritz Venzin:
A QPTAS for stabbing rectangles. CoRR abs/2107.06571 (2021) - 2020
- [j37]Friedrich Eisenbrand, Robert Weismantel:
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. ACM Trans. Algorithms 16(1): 5:1-5:14 (2020) - [c46]Friedrich Eisenbrand, Moritz Venzin:
Approximate CVPp in Time 20.802 n. ESA 2020: 43:1-43:15 - [i21]Jana Cslovjecsek, Friedrich Eisenbrand, Robert Weismantel:
N-fold integer programming via LP rounding. CoRR abs/2002.07745 (2020) - [i20]Friedrich Eisenbrand, Moritz Venzin:
Approximate $\mathrm{CVP}_{\infty}$ in time $2^{0.802 \, n}$. CoRR abs/2005.04957 (2020) - [i19]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR abs/2012.11742 (2020)
2010 – 2019
- 2019
- [j36]Alfonso Cevallos
An Improved Analysis of Local Search for Max-Sum Diversification. Math. Oper. Res. 44(4): 1494-1509 (2019) - [i18]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
An Algorithmic Theory of Integer Programming. CoRR abs/1904.01361 (2019) - 2018
- [j35]Iskander Aliev, Jesús A. De Loera, Friedrich Eisenbrand, Timm Oertel
The Support of Integer Optimal Solutions. SIAM J. Optim. 28(3): 2152-2157 (2018) - [c45]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
Faster Algorithms for Integer Programs with Block Structure. ICALP 2018: 49:1-49:13 - [c44]Alfonso Cevallos
Diversity Maximization in Doubling Metrics. ISAAC 2018: 33:1-33:12 - [c43]Friedrich Eisenbrand, Robert Weismantel:
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. SODA 2018: 808-816 - [i17]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
Faster Algorithms for Integer Programs with Block Structure. CoRR abs/1802.06289 (2018) - [i16]Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell
Diversity maximization in doubling metrics. CoRR abs/1809.09521 (2018) - 2017
- [j34]Friedrich Eisenbrand
Geometric random edge. Math. Program. 164(1-2): 325-339 (2017) - [c42]Alfonso Cevallos
Local Search for Max-Sum Diversification. SODA 2017: 130-142 - [e2]Friedrich Eisenbrand, Jochen Könemann:
Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings. Lecture Notes in Computer Science 10328, Springer 2017, ISBN 978-3-319-59249-7 [contents] - [i15]Friedrich Eisenbrand, Robert Weismantel:
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. CoRR abs/1707.00481 (2017) - 2016
- [j33]Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer, Timm Oertel
A note on non-degenerate integer programs with small sub-determinants. Oper. Res. Lett. 44(5): 635-639 (2016) - [c41]Alfonso Cevallos
Max-Sum Diversity Via Convex Programming. SoCG 2016: 26:1-26:14 - [i14]Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
Local Search for Max-Sum Diversification. CoRR abs/1607.04557 (2016) - 2015
- [c40]Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella:
Node-Balancing by Edge-Increments. ESA 2015: 450-458 - [c39]Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer:
On largest volume simplices and sub-determinants. SODA 2015: 315-323 - [i13]Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella:
Node-balancing by edge-increments. CoRR abs/1504.06919 (2015) - [i12]Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
Max-sum diversity via convex programming. CoRR abs/1511.07077 (2015) - 2014
- [j32]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On Sub-determinants and the Diameter of Polyhedra. Discret. Comput. Geom. 52(1): 102-115 (2014) - [i11]Friedrich Eisenbrand, Santosh S. Vempala:
Geometric Random Edge. CoRR abs/1404.1568 (2014) - [i10]Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer:
On largest volume simplices and sub-determinants. CoRR abs/1406.3512 (2014) - 2013
- [j31]Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi
Testing additive integrality gaps. Math. Program. 141(1-2): 257-271 (2013) - [j30]Friedrich Eisenbrand, Dömötör Pálvölgyi
Bin Packing via Discrepancy of Permutations. ACM Trans. Algorithms 9(3): 24:1-24:15 (2013) - [c38]Friedrich Eisenbrand, Nicolai Hähnle:
Minimizing the number of lattice points in a translated polygon. SODA 2013: 1123-1130 - 2012
- [j29]Friedrich Eisenbrand, Martin Niemeier:
Coloring fuzzy circular interval graphs. Eur. J. Comb. 33(5): 893-904 (2012) - [c37]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On sub-determinants and the diameter of polyhedra. SCG 2012: 357-362 - [i9]Friedrich Eisenbrand, Nicolai Hähnle:
Minimizing the number of lattice points in a translated polygon. CoRR abs/1207.0979 (2012) - 2011
- [j28]Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Real-time Avionics Optimization. it Inf. Technol. 53(6): 274-279 (2011) - [c36]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
Covering cubes and the closest vector problem. SCG 2011: 417-423 - [c35]Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO 2011: 170-182 - [c34]Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß:
Bin Packing via Discrepancy of Permutations. SODA 2011: 476-481 - [p4]Friedrich Eisenbrand:
The Euclidean Algorithm. Algorithms Unplugged 2011: 111-117 - [i8]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On sub-determinants and the diameter of polyhedra. CoRR abs/1108.4272 (2011) - 2010
- [j27]Friedrich Eisenbrand, Fabrizio Grandoni
Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76(8): 709-726 (2010) - [j26]Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß:
Diameter of Polyhedra: Limits of Abstraction. Math. Oper. Res. 35(4): 786-794 (2010) - [c33]Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese:
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. ESA (1) 2010: 11-22 - [c32]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311 - [c31]Friedrich Eisenbrand, Thomas Rothvoß:
EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. SODA 2010: 1029-1034 - [c30]Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin:
Testing Additive Integrality Gaps. SODA 2010: 1227-1234 - [p3]Friedrich Eisenbrand:
Integer Programming and Algorithmic Geometry of Numbers - A tutorial. 50 Years of Integer Programming 2010: 505-559 - [p2]Karen I. Aardal, Friedrich Eisenbrand:
The LLL Algorithm and Integer Programming. The LLL Algorithm 2010: 293-314 - [e1]Friedrich Eisenbrand, F. Bruce Shepherd:
Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings. Lecture Notes in Computer Science 6080, Springer 2010, ISBN 978-3-642-13035-9 [contents] - [i7]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling periodic tasks in a hard real-time environment. Scheduling 2010 - [i6]Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß:
Diameter of Polyhedra: Limits of Abstraction. Flexible Network Design 2010 - [i5]Friedrich Eisenbrand, Thomas Rothvoß:
Recent Hardness Results for Periodic Uni-processor Scheduling. Scheduling 2010 - [i4]Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß:
Bin Packing via Discrepancy of Permutations. CoRR abs/1007.2170 (2010) - [i3]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
Covering Cubes and the Closest Vector Problem. CoRR abs/1012.2289 (2010) - [i2]Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità:
Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps. CoRR abs/1012.3295 (2010)
2000 – 2009
- 2009
- [j25]Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu:
Multiline Addressing by Network Flow. Algorithmica 53(4): 583-596 (2009) - [j24]Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister:
Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. Discret. Comput. Geom. 42(1): 22-36 (2009) - [j23]Friedrich Eisenbrand, Martin Niemeier:
Coloring Fuzzy Circular Interval Graphs. Electron. Notes Discret. Math. 34: 543-548 (2009) - [j22]Friedrich Eisenbrand, Andreas Karrenbauer
Algorithms for longer OLED lifetime. ACM J. Exp. Algorithmics 14 (2009) - [j21]Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey:
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34(1): 194-209 (2009) - [c29]Friedrich Eisenbrand, Thomas Rothvoß:
New Hardness Results for Diophantine Approximation. APPROX-RANDOM 2009: 98-110 - [c28]Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß:
Diameter of polyhedra: limits of abstraction. SCG 2009: 386-392 - 2008
- [j20]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
The stable set polytope of quasi-line graphs. Comb. 28(1): 45-67 (2008) - [j19]Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher:
Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets. Electron. J. Comb. 15(1) (2008) - [j18]Friedrich Eisenbrand:
Algorithms for Integer Programming. Bull. EATCS 96: 46-57 (2008) - [j17]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Energy-Aware Stage Illumination. Int. J. Comput. Geom. Appl. 18(1/2): 107-129 (2008) - [j16]Lijun Zhang, Holger Hermanns
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. Log. Methods Comput. Sci. 4(4) (2008) - [j15]Friedrich Eisenbrand, Gennady Shmonin:
Parametric Integer Programming in Fixed Dimension. Math. Oper. Res. 33(4): 839-850 (2008) - [c27]Friedrich Eisenbrand, Thomas Rothvoß:
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. ICALP (1) 2008: 246-257 - [c26]Friedrich Eisenbrand, Thomas Rothvoß:
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard. RTSS 2008: 397-406 - [c25]Friedrich Eisenbrand, Fabrizio Grandoni
Approximating connected facility location problems via random facility sampling and core detouring. SODA 2008: 1174-1183 - [p1]Friedrich Eisenbrand:
Der Euklidische Algorithmus. Taschenbuch der Algorithmen 2008: 119-125 - [i1]Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen:
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. CoRR abs/0808.3651 (2008) - 2007
- [j14]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Packing a Truck - Now with a Twist! Int. J. Comput. Geom. Appl. 17(5): 505-527 (2007) - [j13]Friedrich Eisenbrand, Fabrizio Grandoni
New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007) - [c24]Markus Behle, Friedrich Eisenbrand:
0/1 Vertex and Facet Enumeration with BDDs. ALENEX 2007 - [c23]Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister:
A geometric framework for solving subsequence problems in computational biology efficiently. SCG 2007: 310-318 - [c22]Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen:
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. TACAS 2007: 155-169 - [c21]Friedrich Eisenbrand, Andreas Karrenbauer
Algorithms for Longer OLED Lifetime. WEA 2007: 338-351 - 2006
- [j12]Friedrich Eisenbrand, Gennady Shmonin:
Carathéodory bounds for integer cones. Oper. Res. Lett. 34(5): 564-568 (2006) - [c20]Friedrich Eisenbrand, Edda Happ:
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. CIAC 2006: 105-114 - [c19]Friedrich Eisenbrand, Andreas Karrenbauer
Multiline Addressing by Network Flow. ESA 2006: 744-755 - [c18]Werner Damm, Alexander Metzner, Friedrich Eisenbrand, Gennady Shmonin, Reinhard Wilhelm, Sebastian Winkel:
Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality. RTCSA 2006: 87-90 - 2005
- [j11]Friedrich Eisenbrand, Sören Laue:
A linear algorithm for integer programming in the plane. Math. Program. 102(2): 249-259 (2005) - [c17]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Energy-aware stage illumination. SCG 2005: 336-345 - [c16]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella:
New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 - [c15]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO 2005: 291-305 - [c14]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Packing a trunk: now with a twist! Symposium on Solid and Physical Modeling 2005: 197-206 - [c13]Friedrich Eisenbrand, Fabrizio Grandoni
An improved approximation algorithm for virtual private network design. SODA 2005: 928-932 - [c12]Bernd Becker
BDDs in a Branch and Cut Framework. WEA 2005: 452-463 - 2004
- [j10]Friedrich Eisenbrand, Fabrizio Grandoni
On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3): 57-67 (2004) - [c11]Bernd Becker, Markus Behle, Friedrich Eisenbrand, Martin Fränzle, Marc Herbstritt, Christian Herde, Jörg Hoffmann, Daniel Kröning, Bernhard Nebel, Ilia Polian, Ralf Wimmer:
Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems. MBMV 2004: 65-75 - [c10]Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn:
Point containment in the integer hull of a polyhedron. SODA 2004: 929-933 - 2003
- [j9]Friedrich Eisenbrand, Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. Comb. 23(2): 245-261 (2003) - [j8]Friedrich Eisenbrand, Fabrizio Grandoni
Detecting directed 4-cycles still faster. Inf. Process. Lett. 87(1): 13-15 (2003) - [j7]Friedrich Eisenbrand, Giovanni Rinaldi
Primal separation for 0/1 polytopes. Math. Program. 95(3): 475-491 (2003) - [j6]Paolo Ventura, Friedrich Eisenbrand:
A compact linear program for testing optimality of perfect matchings. Oper. Res. Lett. 31(3): 429-434 (2003) - [c9]Friedrich Eisenbrand:
Fast Integer Programming in Fixed Dimension. ESA 2003: 196-207 - [c8]Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer:
Packing a Trunk. ESA 2003: 618-629 - [c7]Friedrich Eisenbrand, Sören Laue:
A Faster Algorithm for Two-Variable Integer Programming. ISAAC 2003: 290-299 - [c6]Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann:
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. SODA 2003: 517-522 - 2002
- [c5]Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura:
0/1 optimization and 0/1 primal separation are equivalent. SODA 2002: 920-926 - 2001
- [j5]Friedrich Eisenbrand:
Short vectors of planar lattices via continued fractions. Inf. Process. Lett. 79(3): 121-126 (2001) - [j4]Alexander Bockmayr
Cutting Planes and the Elementary Closure in Fixed Dimension. Math. Oper. Res. 26(2): 304-312 (2001) - [c4]Friedrich Eisenbrand, Günter Rote:
Fast Reduction of Ternary Quadratic Forms. CaLC 2001: 32-44 - [c3]Friedrich Eisenbrand, Günter Rote:
Fast 2-Variable Integer Programming. IPCO 2001: 78-89 - 2000
- [b1]Friedrich Eisenbrand:
Gomory-Chvátal cutting planes and the elementary closure of polyhedra. Saarland University, Germany, 2000 - [c2]Alexander Bockmayr
Combining Logic and Optimization in Cutting Plane Theory. FroCoS 2000: 1-17
1990 – 1999
- 1999
- [j3]Friedrich Eisenbrand:
On the Membership Problem for the Elementary Closure of a Polyhedron. Comb. 19(2): 297-300 (1999) - [j2]Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz:
On the Chvátal Rank of Polytopes in the 0/1 Cube. Discret. Appl. Math. 98(1-2): 21-27 (1999) - [j1]Johannes Buchmann, Friedrich Eisenbrand:
On factor refinement in number fields. Math. Comput. 68(225): 345-350 (1999) - [c1]Friedrich Eisenbrand, Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. IPCO 1999: 137-150
Coauthor Index
Thomas Rothvoß
aka: Thomas Rothvoss
aka: Thomas Rothvoss
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 2025-01-04 03:19 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: