default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeiko Röglin
Person information
- affiliation: University of Bonn, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Lukas Drexler, Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. Algorithmica 86(11): 3425-3464 (2024)- [j33]Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and lower bounds for complete linkage in general metric spaces. Mach. Learn. 113(1): 489-518 (2024) - [c51]Frederik Brüning, Anne Driemel
, Alperen Ergür, Heiko Röglin:
On the number of iterations of the DBA algorithm. SDM 2024: 172-180 - [i31]Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin:
On the number of iterations of the DBA algorithm. CoRR abs/2401.05841 (2024) - 2023
- [j32]René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking:
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. 200(1): 319-355 (2023) - [c50]Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. ICALP 2023: 50:1-50:20 - [i30]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR abs/2302.06889 (2023) - 2022
- [c49]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG 2022: 7:1-7:18 - [c48]Anna Arutyunova, Heiko Röglin:
The Price of Hierarchical Clustering. ESA 2022: 10:1-10:14 - [i29]Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR abs/2203.07325 (2022) - [i28]Anna Arutyunova, Heiko Röglin:
The Price of Hierarchical Clustering. CoRR abs/2205.01417 (2022) - [i27]Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. CoRR abs/2211.02176 (2022) - 2021
- [c47]Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and Lower Bounds for Complete Linkage in General Metric Spaces. APPROX-RANDOM 2021: 18:1-18:22 - [c46]Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert:
Bicriteria Aggregation of Polygons via Graph Cuts. GIScience (II) 2021: 6:1-6:16 - 2020
- [j31]Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin:
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272: 1 (2020) - [c45]Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not so Greedy k-Means++. ESA 2020: 18:1-18:21 - [p1]Heiko Röglin:
Smoothed Analysis of Pareto Curves in Multiobjective Optimization. Beyond the Worst-Case Analysis of Algorithms 2020: 334-358 - [i26]Heiko Röglin:
Smoothed Analysis of Pareto Curves in Multiobjective Optimization. CoRR abs/2010.11064 (2020)
2010 – 2019
- 2019
- [c44]Anna Großwendt, Heiko Röglin, Melanie Schmidt:
Analysis of Ward's Method. SODA 2019: 2939-2957 - [i25]Anna Großwendt, Heiko Röglin, Melanie Schmidt:
Analysis of Ward's Method. CoRR abs/1907.05094 (2019) - [i24]Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not So Greedy k-means++. CoRR abs/1912.00653 (2019) - 2018
- [j30]Matthias Mnich, Heiko Röglin, Clemens Rösner:
New deterministic algorithms for solving parity games. Discret. Optim. 30: 73-95 (2018) - [j29]Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. ACM Trans. Algorithms 14(2): 19:1-19:23 (2018) - [c43]Carsten Fischer, Heiko Röglin:
Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. LATIN 2018: 461-474 - 2017
- [j28]Anna Großwendt, Heiko Röglin:
Improved Analysis of Complete-Linkage Clustering. Algorithmica 78(4): 1131-1150 (2017) - [j27]Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial kernels for weighted problems. J. Comput. Syst. Sci. 84: 1-10 (2017) - [j26]Michael Etscheid, Heiko Röglin:
Smoothed Analysis of Local Search for the Maximum-Cut Problem. ACM Trans. Algorithms 13(2): 25:1-25:12 (2017) - [c42]Heiko Röglin, Clemens Rösner:
The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. TAMC 2017: 543-555 - [i23]Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal:
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports 7(4): 1-22 (2017) - 2016
- [j25]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms 13(1): 10:1-10:15 (2016) - [c41]Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. ESA 2016: 71:1-71:16 - [c40]Carsten Fischer, Heiko Röglin:
Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. LATIN 2016: 469-482 - [c39]Matthias Mnich, Heiko Röglin, Clemens Rösner:
New Deterministic Algorithms for Solving Parity Games. LATIN 2016: 634-645 - [c38]Tobias Brunsch, Michael Etscheid, Heiko Röglin:
Bounds for the Convergence Time of Local Search in Scheduling Problems. WINE 2016: 339-353 - [r1]Heiko Röglin:
Smoothed Analysis. Encyclopedia of Algorithms 2016: 2014-2017 - 2015
- [j24]André Berger, Heiko Röglin, Ruben van der Zwaan:
Internet routing between autonomous systems: Fast algorithms for path trading. Discret. Appl. Math. 185: 8-17 (2015) - [j23]Tobias Brunsch, Heiko Röglin:
Improved Smoothed Analysis of Multiobjective Optimization. J. ACM 62(1): 4:1-4:58 (2015) - [j22]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner:
Smoothed Analysis of the Successive Shortest Path Algorithm. SIAM J. Comput. 44(6): 1798-1819 (2015) - [c37]Michael Etscheid, Heiko Röglin:
Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem. ESA 2015: 509-520 - [c36]Anna Großwendt, Heiko Röglin:
Improved Analysis of Complete-Linkage Clustering. ESA 2015: 656-667 - [c35]Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial Kernels for Weighted Problems. MFCS (2) 2015: 287-298 - [c34]Tobias Brunsch, Anna Großwendt, Heiko Röglin:
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. STACS 2015: 171-183 - [i22]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner:
Smoothed Analysis of the Successive Shortest Path Algorithm. CoRR abs/1501.05493 (2015) - [i21]Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial Kernels for Weighted Problems. CoRR abs/1507.03439 (2015) - [i20]Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. CoRR abs/1511.09259 (2015) - [i19]Matthias Mnich, Heiko Röglin, Clemens Rösner:
New Deterministic Algorithms for Solving Parity Games. CoRR abs/1512.03246 (2015) - [i18]Carsten Fischer, Heiko Röglin:
Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. CoRR abs/1512.04719 (2015) - 2014
- [j21]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica 68(1): 190-264 (2014) - [j20]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed performance guarantees for local search. Math. Program. 146(1-2): 185-218 (2014) - [j19]Tobias Brunsch, Navin Goyal, Luis Rademacher, Heiko Röglin:
Lower Bounds for the Average and Smoothed Number of Pareto-Optima. Theory Comput. 10: 237-256 (2014) - [c33]Michael Etscheid, Heiko Röglin:
Smoothed Analysis of Local Search for the Maximum-Cut Problem. SODA 2014: 882-889 - [i17]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Efficient Clustering with Limited Distance Information. CoRR abs/1408.2045 (2014) - [i16]Tobias Brunsch, Anna Großwendt, Heiko Röglin:
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. CoRR abs/1412.5381 (2014) - [i15]Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden:
Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372). Dagstuhl Reports 4(9): 30-49 (2014) - 2013
- [j18]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. J. Graph Algorithms Appl. 17(6): 647-670 (2013) - [j17]Bodo Manthey, Heiko Röglin:
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. J. Comput. Geom. 4(1): 94-132 (2013) - [j16]Tobias Brunsch, Heiko Röglin:
A bad instance for k-means++. Theor. Comput. Sci. 505: 19-26 (2013) - [j15]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking:
Economical Caching. ACM Trans. Comput. Theory 5(2): 4:1-4:21 (2013) - [c32]Tobias Brunsch, Heiko Röglin:
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. ICALP (1) 2013: 279-290 - [c31]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of the Successive Shortest Path Algorithm. SODA 2013: 1180-1189 - [c30]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. WALCOM 2013: 182-193 - [i14]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed analysis of the successive shortest path algorithm. CTW 2013: 27-30 - [i13]Tobias Brunsch, Heiko Röglin:
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. CoRR abs/1304.7235 (2013) - 2012
- [j14]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Active Clustering of Biological Sequences. J. Mach. Learn. Res. 13: 203-225 (2012) - [j13]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012) - [j12]Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt:
Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. 6(1): 1-21 (2012) - [c29]Tobias Brunsch, Heiko Röglin:
Improved smoothed analysis of multiobjective optimization. STOC 2012: 407-426 - [i12]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. CoRR abs/1211.3299 (2012) - 2011
- [j11]Bodo Manthey, Heiko Röglin:
Smoothed Analysis: Analysis of Algorithms Beyond Worst Case. it Inf. Technol. 53(6): 280-286 (2011) - [j10]David Arthur, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of the k-Means Method. J. ACM 58(5): 19:1-19:31 (2011) - [j9]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40(1): 92-106 (2011) - [j8]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng:
Competitive routing over time. Theor. Comput. Sci. 412(39): 5420-5432 (2011) - [c28]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. ESA 2011: 772-783 - [c27]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Min-sum Clustering of Protein Sequences with Limited Distance Information. SIMBAD 2011: 192-206 - [c26]Tobias Brunsch, Heiko Röglin:
A Bad Instance for k-Means++. TAMC 2011: 344-352 - [c25]Tobias Brunsch, Heiko Röglin:
Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. TAMC 2011: 416-427 - [c24]André Berger, Heiko Röglin, Ruben van der Zwaan:
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA 2011: 43-53 - [i11]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function. CoRR abs/1101.3620 (2011) - [i10]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. CoRR abs/1105.2686 (2011) - [i9]Tobias Brunsch, Heiko Röglin:
Improved Smoothed Analysis of Multiobjective Optimization. CoRR abs/1111.1546 (2011) - 2010
- [c23]Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt:
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference 2010: 324-335 - [c22]Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer:
Analysis of Algorithms. Algorithm Engineering 2010: 127-193 - [c21]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Efficient Clustering with Limited Distance Information. UAI 2010: 632-640 - [c20]Patrick Briest, Heiko Röglin:
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. WAOA 2010: 47-58 - [i8]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Efficient Clustering with Limited Distance Information. CoRR abs/1009.5168 (2010) - [i7]Tobias Brunsch, Heiko Röglin:
Lower Bounds for the Smoothed Number of Pareto optimal Solutions. CoRR abs/1012.1163 (2010)
2000 – 2009
- 2009
- [j7]Matthias Englert, Heiko Röglin, Matthias Westermann:
Evaluation of online strategies for reordering buffers. ACM J. Exp. Algorithmics 14 (2009) - [j6]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated two-sided matching markets. SIGecom Exch. 8(1) (2009) - [j5]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17): 1552-1563 (2009) - [c19]Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng:
Agnostic Clustering. ALT 2009: 384-398 - [c18]David Arthur, Bodo Manthey, Heiko Röglin:
k-Means Has Polynomial Smoothed Complexity. FOCS 2009: 405-414 - [c17]Heiko Röglin, Shang-Hua Teng:
Smoothed Analysis of Multiobjective Optimization. FOCS 2009: 681-690 - [c16]Bodo Manthey, Heiko Röglin:
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. ISAAC 2009: 1024-1033 - [c15]Bodo Manthey, Heiko Röglin:
Improved smoothed analysis of the k-means method. SODA 2009: 461-470 - [c14]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking:
Economical Caching. STACS 2009: 385-396 - [c13]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng:
Competitive Routing over Time. WINE 2009: 18-29 - [i6]David Arthur, Bodo Manthey, Heiko Röglin:
k-Means has Polynomial Smoothed Complexity. CoRR abs/0904.1113 (2009) - 2008
- [j4]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. 5(4): 439-457 (2008) - [j3]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the impact of combinatorial structure on congestion games. J. ACM 55(6): 25:1-25:22 (2008) - [c12]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated two-sided matching markets. EC 2008: 256-263 - [c11]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220 - [i5]Patrick Briest, Paul W. Goldberg, Heiko Röglin:
Approximate Equilibria in Games with Few Players. CoRR abs/0804.4524 (2008) - [i4]Heiner Ackermann, Heiko Röglin:
On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games. CoRR abs/0805.1130 (2008) - [i3]Bodo Manthey, Heiko Röglin:
Improved Smoothed Analysis of the k-Means Method. CoRR abs/0809.1715 (2008) - 2007
- [j2]Heiko Röglin, Berthold Vöcking:
Smoothed analysis of integer programming. Math. Program. 110(1): 21-56 (2007) - [j1]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378(3): 253-270 (2007) - [c10]René Beier, Heiko Röglin, Berthold Vöcking:
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO 2007: 53-67 - [c9]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. SODA 2007: 1295-1304 - [c8]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41 - 2006
- [c7]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games. FOCS 2006: 613-622 - [c6]Matthias Englert, Heiko Röglin, Matthias Westermann:
Evaluation of Online Strategies for Reordering Buffers. WEA 2006: 183-194 - [c5]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE 2006: 50-61 - [i2]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c4]Heiko Röglin, Berthold Vöcking:
Smoothed Analysis of Integer Programming. IPCO 2005: 276-290 - [c3]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684 - 2004
- [c2]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener:
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN 2004: 21-30 - [c1]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener:
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN 2004: 31-40
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-25 20:16 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:
