default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaroslaw Byrka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c40]Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub:
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. FOCS 2024: 730-753- [c39]Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
An O(loglog n)-Approximation for Submodular Facility Location. ICALP 2024: 5:1-5:20 - [c38]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP 2024: 6:1-6:19 - [c37]Andrzej Turko
, Jaroslaw Byrka:
Sublogarithmic Approximation for Tollbooth Pricing on a Cactus. SAGT 2024: 297-314 - [e3]Jens Vygen, Jaroslaw Byrka:
Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024, Proceedings. Lecture Notes in Computer Science 14679, Springer 2024, ISBN 978-3-031-59834-0 [contents] - [i35]Marcin Bienkowski, Jaroslaw Byrka, Lukasz Jez:
Online Disjoint Set Covers: Randomization is not Necessary. CoRR abs/2404.15554 (2024) - [i34]Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub:
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2. CoRR abs/2407.19905 (2024) - 2023
- [j19]Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM J. Comput. 52(3): 718-739 (2023) - [c36]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS 2023: 1377-1399 - [e2]Jaroslaw Byrka, Andreas Wiese:
Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings. Lecture Notes in Computer Science 14297, Springer 2023, ISBN 978-3-031-49814-5 [contents] - [i33]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR abs/2304.03146 (2023) - [i32]Andrzej Turko, Jaroslaw Byrka:
Sublogarithmic Approximation for Tollbooth Pricing on a Cactus. CoRR abs/2305.05405 (2023) - [i31]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR abs/2305.07316 (2023) - [i30]Martin Böhm, Jaroslaw Byrka, Mateusz Lewandowski, Jan Marcinkowski:
Submodularity Gaps for Selected Network Design and Matching Problems. CoRR abs/2305.10935 (2023) - 2022
- [c35]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. APPROX/RANDOM 2022: 45:1-45:17 - [i29]Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
An O(loglog n)-Approximation for Submodular Facility Location. CoRR abs/2211.05474 (2022) - 2021
- [j18]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - [i28]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. CoRR abs/2110.15155 (2021) - 2020
- [j17]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - [j16]Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. Theory Comput. Syst. 64(4): 626-644 (2020) - [c34]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. LATIN 2020: 3-14 - [c33]Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. STOC 2020: 815-825 - [c32]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. STOC 2020: 1165-1169 - [c31]Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. WAOA 2020: 113-126 - [c30]Jaroslaw Byrka, Mateusz Lewandowski:
Concave Connection Cost Facility Location and the Star Inventory Routing Problem. WAOA 2020: 174-188 - [e1]Jaroslaw Byrka, Raghu Meka:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference. LIPIcs 176, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-164-1 [contents] - [i27]Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. CoRR abs/2011.08083 (2020)
2010 – 2019
- 2019
- [j15]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration. ACM Trans. Algorithms 15(4): 46:1-46:21 (2019) - [c29]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant-Factor FPT Approximation for Capacitated k-Median. ESA 2019: 1:1-1:14 - [c28]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. MFCS 2019: 8:1-8:13 - [i26]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. CoRR abs/1911.01592 (2019) - [i25]Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree. CoRR abs/1911.02259 (2019) - [i24]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. CoRR abs/1912.00717 (2019) - [i23]Jaroslaw Byrka, Mateusz Lewandowski:
Concave connection cost Facility Location and the Star Inventory Routing problem. CoRR abs/1912.00770 (2019) - 2018
- [j14]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica 80(4): 1093-1114 (2018) - [j13]Jaroslaw Byrka, Aravind Srinivasan:
Approximation Algorithms for Stochastic and Risk-Averse Optimization. SIAM J. Discret. Math. 32(1): 44-63 (2018) - [c27]Jaroslaw Byrka, Piotr Skowron, Krzysztof Sornat:
Proportional Approval Voting, Harmonic k-median, and Negative Association. ICALP 2018: 26:1-26:14 - [c26]Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase:
Constant-factor approximation for ordered k-median. STOC 2018: 620-631 - [c25]Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. WAOA 2018: 87-101 - [i22]Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. CoRR abs/1801.00313 (2018) - [i21]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant factor FPT approximation for capacitated k-median. CoRR abs/1809.05791 (2018) - [i20]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. CoRR abs/1811.09233 (2018) - 2017
- [j12]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization. ACM Trans. Algorithms 13(2): 23:1-23:31 (2017) - [c24]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration. ICALP 2017: 13:1-13:14 - [i19]Jaroslaw Byrka, Piotr Skowron, Krzysztof Sornat:
Proportional Approval Voting, Harmonic k-median, and Negative Association. CoRR abs/1704.02183 (2017) - [i18]Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase:
Constant-Factor Approximation for Ordered k-Median. CoRR abs/1711.01972 (2017) - [i17]Jaroslaw Byrka, Aravind Srinivasan:
Approximation algorithms for stochastic and risk-averse optimization. CoRR abs/1712.06996 (2017) - 2016
- [j11]Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki:
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties). Theory Comput. Syst. 58(1): 19-44 (2016) - [c23]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - [c22]Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal:
An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation. IPCO 2016: 262-274 - [c21]Jaroslaw Byrka, Mateusz Lewandowski, Carsten Moldenhauer:
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs. SWAT 2016: 2:1-2:14 - [r2]Karen I. Aardal, Jaroslaw Byrka, Mohammad Mahdian:
Facility Location. Encyclopedia of Algorithms 2016: 717-724 - [i16]Jaroslaw Byrka, Mateusz Lewandowski, Carsten Moldenhauer:
Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs. CoRR abs/1601.02481 (2016) - [i15]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic beats fixed: on phase-based algorithms for file migration. CoRR abs/1609.00831 (2016) - 2015
- [j10]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young:
Approximation algorithms for the joint replenishment problem with deadlines. J. Sched. 18(6): 545-560 (2015) - [j9]Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The interval constrained 3-coloring problem. Theor. Comput. Sci. 593: 42-50 (2015) - [c20]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. ESA 2015: 275-287 - [c19]Marcin Bienkowski, Jaroslaw Byrka, Krzysztof Chrobak, Tomasz Jurdzinski, Dariusz R. Kowalski:
Provable fairness for TDMA scheduling. INFOCOM 2015: 1320-1327 - [c18]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. SODA 2015: 722-736 - [c17]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization. SODA 2015: 737-756 - [i14]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015) - [i13]Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal:
An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation. CoRR abs/1511.07494 (2015) - 2014
- [c16]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall:
Better Approximation Bounds for the Joint Replenishment Problem. SODA 2014: 42-54 - [c15]Bartosz Rybicki, Jaroslaw Byrka:
Improved Approximation Algorithm for Fault-Tolerant Facility Placement. WAOA 2014: 59-70 - [c14]Jaroslaw Byrka, Krzysztof Sornat:
PTAS for Minimax Approval Voting. WINE 2014: 203-217 - [i12]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization. CoRR abs/1406.2951 (2014) - [i11]Jaroslaw Byrka, Krzysztof Sornat:
PTAS for Minimax Approval Voting. CoRR abs/1407.7216 (2014) - 2013
- [j8]Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
Steiner Tree Approximation via Iterative Randomized Rounding. J. ACM 60(1): 6:1-6:33 (2013) - [c13]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young:
Approximation Algorithms for the Joint Replenishment Problem with Deadlines. ICALP (1) 2013: 135-147 - [c12]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall, Grzegorz Stachowiak:
Online Control Message Aggregation in Chain Networks. WADS 2013: 133-145 - [c11]Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki:
Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter. WAOA 2013: 85-96 - [i10]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better Approximation Bounds for the Joint Replenishment Problem. CoRR abs/1307.2531 (2013) - [i9]Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki:
Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter. CoRR abs/1310.2386 (2013) - [i8]Bartosz Rybicki, Jaroslaw Byrka:
Improved approximation algorithm for Fault-Tolerant Facility Placement. CoRR abs/1311.6615 (2013) - [i7]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. CoRR abs/1312.6550 (2013) - 2012
- [j7]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica 62(1-2): 309-332 (2012) - [c10]Michal Szydelko, Jaroslaw Byrka, Jakub Oszmianski:
Dynamic valuation function based definition of the primary spectrum user in collocated cellular networks. CrownCom 2012: 297-302 - [c9]Jaroslaw Byrka, Bartosz Rybicki:
Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location. ICALP (1) 2012: 157-169 - [i6]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak:
Approximation Algorithms for the Joint Replenishment Problem with Deadlines. CoRR abs/1212.3233 (2012) - 2010
- [j6]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson:
New results on optimizing rooted triplets consistency. Discret. Appl. Math. 158(11): 1136-1147 (2010) - [j5]Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. Huber, Steven Kelk:
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J. Discrete Algorithms 8(1): 65-75 (2010) - [j4]Jaroslaw Byrka, Karen I. Aardal:
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. SIAM J. Comput. 39(6): 2212-2231 (2010) - [j3]Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis:
New algorithms for approximate Nash equilibria in bimatrix games. Theor. Comput. Sci. 411(1): 164-173 (2010) - [c8]Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy:
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. IPCO 2010: 244-257 - [c7]Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The Interval Constrained 3-Coloring Problem. LATIN 2010: 591-602 - [c6]Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
An improved LP-based approximation for steiner tree. STOC 2010: 583-592 - [i5]Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy:
Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm. CoRR abs/1003.1295 (2010) - [i4]Jaroslaw Byrka, Mohammadreza Ghodsi, Aravind Srinivasan:
LP-rounding algorithms for facility-location problems. CoRR abs/1007.3611 (2010)
2000 – 2009
- 2009
- [j2]Marcin Bienkowski, Jaroslaw Byrka, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Optimal algorithms for page migration in dynamic networks. J. Discrete Algorithms 7(4): 545-569 (2009) - [i3]Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The interval constrained 3-coloring problem. CoRR abs/0907.3563 (2009) - 2008
- [c5]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams. GD 2008: 324-335 - [c4]Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson:
New Results on Optimizing Rooted Triplets Consistency. ISAAC 2008: 484-495 - [r1]Karen I. Aardal, Jaroslaw Byrka, Mohammad Mahdian:
Facility Location. Encyclopedia of Algorithms 2008 - [i2]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. CoRR abs/0806.0920 (2008) - 2007
- [j1]Jaroslaw Byrka, Karen I. Aardal:
The approximation gap for the metric facility location problem is not yet closed. Oper. Res. Lett. 35(3): 379-384 (2007) - [c3]Jaroslaw Byrka:
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. APPROX-RANDOM 2007: 29-43 - [c2]Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis:
New Algorithms for Approximate Nash Equilibria in Bimatrix Games. WINE 2007: 17-29 - [i1]Jaroslaw Byrka:
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. CoRR abs/cs/0703010 (2007) - 2005
- [c1]Marcin Bienkowski, Jaroslaw Byrka:
Bucket Game with Applications to Set Multicover and Dynamic Page Migration. ESA 2005: 815-826
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-10 21:43 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:
