default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Harks
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
[j45]Tobias Harks, Anja Schedel
:
Stackelberg pricing games with congestion effects. Math. Program. 203(1): 763-799 (2024)- [c44]Tobias Harks, Sven Jäger, Michael Markl, Philine Schiewe:
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities. ATMOS 2024: 17:1-17:17 - [c43]José Correa, Tobias Harks, Anja Schedel, José Verschae:
Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources. SODA 2024: 547-568 - [i33]Tobias Harks, Sven Jäger, Michael Markl, Philine Schiewe:
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities. CoRR abs/2406.17153 (2024) - [i32]Lukas Graf, Tobias Harks, Julian Schwarz:
A Decomposition Theorem for Dynamic Flows. CoRR abs/2407.04761 (2024) - [i31]Lukas Graf, Tobias Harks, Michael Markl:
Stochastic Prediction Equilibrium for Dynamic Traffic Assignment. CoRR abs/2409.12650 (2024) - 2023
- [j44]Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl:
Prediction Equilibrium for Dynamic Network Flows. J. Mach. Learn. Res. 24: 310:1-310:33 (2023) - [j43]Lukas Graf, Tobias Harks:
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows. Math. Program. 197(2): 761-792 (2023) - [j42]Tobias Harks, Julian Schwarz:
A Unified Framework for Pricing in Nonconvex Resource Allocation Games. SIAM J. Optim. 33(2): 1223-1249 (2023) - [c42]Lukas Graf, Tobias Harks:
Side-Constrained Dynamic Traffic Equilibria. EC 2023: 814 - 2022
- [j41]Tobias Harks, Veerle Timmermans:
Equilibrium computation in resource allocation games. Math. Program. 194(1): 1-34 (2022) - [j40]Tobias Harks, Veerle Timmermans:
Correction to: Equilibrium computation in resource allocation games. Math. Program. 194(1): 35-40 (2022) - [j39]Kai-Simon Goetzmann, Tobias Harks, Max Klimm:
Correction to: Broadcasting a file in a communication network. J. Sched. 25(2): 257 (2022) - [c41]Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl:
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment. AAAI 2022: 5059-5067 - [c40]Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel:
Multi-Leader Congestion Games with an Adversary. AAAI 2022: 5068-5075 - [c39]Lukas Graf, Tobias Harks, Prashant Palkar:
Dynamic Traffic Assignment for Electric Vehicles. ATMOS 2022: 6:1-6:15 - [i30]Lukas Graf, Tobias Harks, Prashant Palkar:
Dynamic Traffic Assignment for Electric Vehicles. CoRR abs/2207.04454 (2022) - [i29]Lukas Graf, Tobias Harks:
Side-Constrained Dynamic Traffic Equilibria. CoRR abs/2211.03194 (2022) - 2021
- [j38]Tobias Harks, Max Klimm, Jannik Matuschke:
Pure Nash Equilibria in Resource Graph Games. J. Artif. Intell. Res. 72: 185-213 (2021) - [j37]Tobias Harks, Martin Hoefer, Anja Schedel, Manuel Surek:
Efficient Black-Box Reductions for Separable Cost Sharing. Math. Oper. Res. 46(1): 134-158 (2021) - [j36]Giorgos Christodoulou, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 1. ACM Trans. Economics and Comput. 9(1): 1:1 (2021) - [j35]Giorgos Christodoulou, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 2. ACM Trans. Economics and Comput. 9(2): 8:1 (2021) - [c38]Lukas Graf, Tobias Harks:
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. IPCO 2021: 104-118 - [c37]Tobias Harks, Julian Schwarz:
Generalized Nash Equilibrium Problems with Mixed-Integer Variables. WINE 2021: 552 - [i28]Tobias Harks, Julian Schwarz:
Generalized Nash Equilibrium Problems with Mixed-Integer Variables. CoRR abs/2107.13298 (2021) - [i27]Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl:
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment. CoRR abs/2109.06713 (2021) - [i26]Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel:
Multi-Leader Congestion Games with an Adversary. CoRR abs/2112.07435 (2021) - 2020
- [j34]Lukas Graf, Tobias Harks, Leon Sering:
Dynamic flows with adaptive route choice. Math. Program. 183(1): 309-335 (2020) - [j33]Kai-Simon Goetzmann, Tobias Harks, Max Klimm:
Broadcasting a file in a communication network. J. Sched. 23(2): 211-232 (2020) - [c36]Lukas Graf, Tobias Harks:
The Price of Anarchy for Instantaneous Dynamic Equilibria. WINE 2020: 237-251 - [e2]Tobias Harks, Max Klimm:
Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Augsburg, Germany, September 16-18, 2020, Proceedings. Lecture Notes in Computer Science 12283, Springer 2020, ISBN 978-3-030-57979-1 [contents] - [i25]Lukas Graf, Tobias Harks:
The Price of Anarchy for Instantaneous Dynamic Equilibria. CoRR abs/2007.07794 (2020) - [i24]Lukas Graf, Tobias Harks:
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. CoRR abs/2007.07808 (2020) - [i23]Tobias Harks, Max Klimm, Jannik Matuschke:
Pure Nash Equilibria in Resource Graph Games. CoRR abs/2007.09017 (2020)
2010 – 2019
- 2019
- [j32]Tobias Harks, Marc Schröder, Dries Vermeulen:
Toll caps in privatized road networks. Eur. J. Oper. Res. 276(3): 947-956 (2019) - [j31]Tobias Harks, Anja Schedel, Manuel Surek:
A Characterization of Undirected Graphs Admitting Optimal Cost Shares. SIAM J. Discret. Math. 33(4): 1932-1996 (2019) - [c35]Lukas Graf, Tobias Harks:
Dynamic Flows with Adaptive Route Choice. IPCO 2019: 219-232 - [c34]Tobias Harks, Anja Schedel:
Capacity and Price Competition in Markets with Congestion Effects. WINE 2019: 341 - [i22]Tobias Harks, Anja Schedel:
Capacity and Price Competition in Markets with Congestion Effects. CoRR abs/1905.05683 (2019) - [i21]Tobias Harks:
Pricing in Resource Allocation Games Based on Duality Gaps. CoRR abs/1907.01976 (2019) - 2018
- [j30]Tobias Harks, Veerle Timmermans:
Uniqueness of equilibria in atomic splittable polymatroid congestion games. J. Comb. Optim. 36(3): 812-830 (2018) - [j29]Tobias Harks, Max Klimm, Manuel Schneider:
Bottleneck routing with elastic demands. Oper. Res. Lett. 46(1): 93-98 (2018) - [j28]Tobias Harks, Max Klimm, Britta Peis:
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM J. Optim. 28(3): 2222-2245 (2018) - [j27]Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. ACM Trans. Economics and Comput. 6(1): 4:1-4:26 (2018) - [c33]Tobias Harks, Martin Hoefer, Anja Huber, Manuel Surek:
Efficient Black-Box Reductions for Separable Cost Sharing. ICALP 2018: 154:1-154:15 - [e1]George Christodoulou, Tobias Harks:
Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings. Lecture Notes in Computer Science 11316, Springer 2018, ISBN 978-3-030-04611-8 [contents] - [i20]Tobias Harks, Martin Hoefer, Anja Huber, Manuel Surek:
Efficient Black-Box Reductions for Separable Cost Sharing. CoRR abs/1802.10351 (2018) - [i19]Tobias Harks, Marc Schröder, Dries Vermeulen:
Toll Caps in Privatized Road Networks. CoRR abs/1802.10514 (2018) - [i18]Tobias Harks, Veerle Timmermans:
Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs. CoRR abs/1808.04712 (2018) - [i17]Lukas Graf, Tobias Harks:
Dynamic Flows with Adaptive Route Choice. CoRR abs/1811.07381 (2018) - [i16]Roberto Cominetti, Tobias Harks, Carolina Osorio, Britta Peis:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102). Dagstuhl Reports 8(3): 21-38 (2018) - 2017
- [j26]José Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke:
Fare Evasion in Transit Networks. Oper. Res. 65(1): 165-183 (2017) - [j25]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42(3): 745-761 (2017) - [j24]Martin Gairing, Tobias Harks, Max Klimm:
Complexity and Approximation of the Continuous Network Design Problem. SIAM J. Optim. 27(3): 1554-1582 (2017) - [c32]Tobias Harks, Veerle Timmermans:
Equilibrium Computation in Atomic Splittable Singleton Congestion Games. IPCO 2017: 442-454 - [c31]Tobias Harks, Anja Huber, Manuel Surek:
A Characterization of Undirected Graphs Admitting Optimal Cost Shares. WINE 2017: 237-251 - [i15]Tobias Harks, Anja Huber, Manuel Surek:
A Characterization of Undirected Graphs Admitting Optimal Cost Shares. CoRR abs/1704.01983 (2017) - 2016
- [j23]André Berger, James Gross, Tobias Harks, Simon Tenbusch:
Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks. Manag. Sci. 62(7): 2070-2089 (2016) - [j22]Tobias Harks, Max Klimm:
Congestion Games with Variable Demands. Math. Oper. Res. 41(1): 255-277 (2016) - [j21]Tobias Harks, Tim Oosterwijk, Tjark Vredeveld:
A logarithmic approximation for polymatroid congestion games. Oper. Res. Lett. 44(6): 712-717 (2016) - [j20]Tobias Harks, Philipp von Falkenhausen:
Robust Quantitative Comparative Statics for a Multimarket Paradox. ACM Trans. Economics and Comput. 5(1): 3:1-3:22 (2016) - [j19]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing Games With Progressive Filling. IEEE/ACM Trans. Netw. 24(4): 2553-2562 (2016) - [j18]Tobias Harks, Felix G. König, Jannik Matuschke, Alexander T. Richter, Jens Schulz:
An Integrated Approach to Tactical Transportation Planning in Logistics Networks. Transp. Sci. 50(2): 439-460 (2016) - [c30]Tobias Harks, Veerle Timmermans:
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games. ISCO 2016: 98-109 - [c29]Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. MFCS 2016: 49:1-49:14 - [i14]Tobias Harks, Max Klimm, Britta Peis:
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids. CoRR abs/1611.05372 (2016) - [i13]Veerle Timmermans, Tobias Harks:
Equilibrium Computation in Atomic Splittable Singleton Congestion Games. CoRR abs/1612.00190 (2016) - 2015
- [j17]Dimitris Fotakis, Tobias Harks:
Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking. Theory Comput. Syst. 57(3): 673-680 (2015) - [j16]Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring:
Computing network tolls with support constraints. Networks 65(3): 262-285 (2015) - [j15]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Congestion games viewed from M-convexity. Oper. Res. Lett. 43(3): 329-333 (2015) - [c28]Tobias Harks, Max Klimm, Manuel Schneider:
Bottleneck Routing with Elastic Demands. WINE 2015: 384-397 - [p1]Tobias Harks, Britta Peis:
Resource Buying Games. Gems of Combinatorial Optimization and Graph Algorithms 2015: 103-111 - [i12]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids are Immune to Braess Paradox. CoRR abs/1504.07545 (2015) - [i11]Tobias Harks, Veerle Timmermans:
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games. CoRR abs/1512.01375 (2015) - [i10]José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, Martin Skutella:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). Dagstuhl Reports 5(10): 19-34 (2015) - 2014
- [j14]Tobias Harks, Britta Peis:
Resource Buying Games. Algorithmica 70(3): 493-512 (2014) - [j13]Tobias Harks, Philipp von Falkenhausen:
Optimal cost sharing for capacitated facility location games. Eur. J. Oper. Res. 239(1): 187-198 (2014) - [c27]Martin Gairing, Tobias Harks, Max Klimm:
Complexity and Approximation of the Continuous Network Design Problem. APPROX-RANDOM 2014: 226-241 - [c26]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing games with progressive filling. INFOCOM 2014: 352-360 - [c25]Tobias Harks, Max Klimm:
Multimarket Oligopolies with Restricted Market Access. SAGT 2014: 182-193 - [c24]Tobias Harks, Max Klimm, Britta Peis:
Resource Competition on Integral Polymatroids. WINE 2014: 189-202 - [i9]José R. Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke:
Fare Evasion in Transit Networks. CoRR abs/1405.2826 (2014) - [i8]Tobias Harks, Max Klimm, Britta Peis:
Resource Competition on Integral Polymatroids. CoRR abs/1407.7650 (2014) - 2013
- [j12]Tobias Harks, Max Klimm, Rolf H. Möhring:
Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theory 42(2): 461-482 (2013) - [j11]Philipp von Falkenhausen, Tobias Harks:
Optimal Cost Sharing for Resource Selection Games. Math. Oper. Res. 38(1): 184-208 (2013) - [j10]Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik:
Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. 141(1-2): 193-215 (2013) - [j9]Tobias Harks, Felix G. König, Jannik Matuschke:
Approximation Algorithms for Capacitated Location Routing. Transp. Sci. 47(1): 3-22 (2013) - [c23]Tobias Harks, Philipp von Falkenhausen:
Quantitative Comparative Statics for a Multimarket Paradox. WINE 2013: 230-231 - [i7]Philipp von Falkenhausen, Tobias Harks:
Optimal cost sharing for capacitated facility location games. CTW 2013: 99-102 - [i6]Martin Gairing, Tobias Harks, Max Klimm:
Complexity and Approximation of the Continuous Network Design Problem. CoRR abs/1307.4258 (2013) - [i5]Tobias Harks, Philipp von Falkenhausen:
Quantitative Comparative Statics for a Multimarket Paradox. CoRR abs/1307.5617 (2013) - [i4]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing Games with Progressive Filling. CoRR abs/1308.3161 (2013) - 2012
- [j8]Tobias Harks, Max Klimm:
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. Math. Oper. Res. 37(3): 419-436 (2012) - [c22]Tobias Harks, Britta Peis:
Resource Buying Games. ESA 2012: 563-574 - [i3]Tobias Harks, Britta Peis:
Resource Buying Games. CoRR abs/1204.4111 (2012) - 2011
- [j7]Tobias Harks, Konstantin Miller:
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games. Oper. Res. 59(6): 1491-1503 (2011) - [j6]Tobias Harks:
Stackelberg Strategies and Collusion in Network Games with Splittable Flow. Theory Comput. Syst. 48(4): 781-802 (2011) - [j5]Tobias Harks, Max Klimm, Rolf H. Möhring:
Characterizing the Existence of Potential Functions in Weighted Congestion Games. Theory Comput. Syst. 49(1): 46-70 (2011) - [c21]Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller:
Optimal File Distribution in Peer-to-Peer Networks. ISAAC 2011: 210-219 - [c20]Philipp von Falkenhausen, Tobias Harks:
Optimal cost sharing protocols for scheduling games. EC 2011: 285-294 - [c19]Tobias Harks, Max Klimm:
Congestion games with variable demands. TARK 2011: 111-120 - [c18]Tobias Harks, Max Klimm:
Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces. WINE 2011: 194-205 - 2010
- [j4]Vincenzo Bonifaci, Tobias Harks, Guido Schäfer:
Stackelberg Routing in Arbitrary Networks. Math. Oper. Res. 35(2): 330-346 (2010) - [c17]Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik:
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. ESA (2) 2010: 29-38 - [c16]Tobias Harks, Max Klimm:
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. ICALP (1) 2010: 79-89 - [c15]André Berger, James Gross, Tobias Harks:
The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. INFOCOM 2010: 2043-2051 - [i2]Tobias Harks, Max Klimm:
Congestion Games with Variable Demands. CoRR abs/1012.1938 (2010)
2000 – 2009
- 2009
- [j3]Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
Competitive Online Multicommodity Routing. Theory Comput. Syst. 45(3): 533-554 (2009) - [c14]Tobias Harks, Konstantin Miller:
Efficiency and stability of Nash equilibria in resource allocation games. GAMENETS 2009: 393-402 - [c13]Tobias Harks, Max Klimm, Rolf H. Möhring:
Characterizing the Existence of Potential Functions in Weighted Congestion Games. SAGT 2009: 97-108 - [c12]Tobias Harks, Max Klimm, Rolf H. Möhring:
Strong Nash Equilibria in Games with the Lexicographical Improvement Property. WINE 2009: 463-470 - [i1]Tobias Harks, Max Klimm, Rolf H. Möhring:
Strong Nash Equilibria in Games with the Lexicographical Improvement Property. CoRR abs/0909.0347 (2009) - 2008
- [j2]Tobias Harks, Tobias Poschwatta:
Congestion control in utility fair networks. Comput. Networks 52(15): 2947-2960 (2008) - [j1]Ariffin Datuk Yahaya, Tobias Harks, Tatsuya Suda:
iREX: efficient automation architecture for the deployment of inter-domain QoS policy. IEEE Trans. Netw. Serv. Manag. 5(1): 50-64 (2008) - [c11]Konstantin Miller, Tobias Harks:
Utility Max-Min Fair Congestion Control with Time-Varying Delays. INFOCOM 2008: 331-335 - [c10]Tobias Harks:
Stackelberg Strategies and Collusion in Network Games with Splittable Flow. WAOA 2008: 133-146 - [c9]Vincenzo Bonifaci, Tobias Harks, Guido Schäfer:
Stackelberg Routing in Arbitrary Networks. WINE 2008: 239-250 - 2007
- [c8]Tobias Harks, László A. Végh:
Nonadaptive Selfish Routing with Online Demands. CAAN 2007: 27-45 - 2006
- [c7]Tobias Harks, Tobias Poschwatta:
On user strategies in a network implementing congestion pricing. CCNC 2006: 681-685 - [c6]Ariffin Datuk Yahaya, Tobias Harks, Tatsuya Suda:
iREX: Efficient Inter-Domain QoS Policy Architecture. GLOBECOM 2006 - [c5]Tobias Harks, Tobias Poschwatta:
Utility Fair Congestion Control for Real-Time Traffic. INFOCOM 2006 - [c4]Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
Competitive Online Multicommodity Routing. WAOA 2006: 240-252 - 2005
- [c3]Tobias Harks, Tobias Poschwatta:
Priority Pricing in Utility Fair Networks. ICNP 2005: 311-320 - [c2]Tobias Harks, Tobias Poschwatta:
Utility fair congestion control for real-time traffic. INFOCOM 2005: 2786-2791 - [c1]Tobias Harks:
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach. QoS-IP 2005: 61-74
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-22 20:13 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:
