default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Pisinger
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j96]Marielle Christiansen, Kjetil Fagerholt, David Pisinger:
Fifty years on maritime transportation. EURO J. Transp. Logist. 14: 100148 (2025)- 2024
- [j95]Miriam Enzi
, Sophie N. Parragh, David Pisinger:
Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport. EURO J. Transp. Logist. 13: 100122 (2024) - [j94]Mette Gamst, David Pisinger:
Decision support for the technician routing and scheduling problem. Networks 83(1): 169-196 (2024) - [j93]David Pisinger, Siv Sørensen:
Topology reconstruction using time series data in telecommunication networks. Networks 83(2): 408-427 (2024) - 2023
- [j92]Anita Schöbel, David Pisinger, Dorit S. Hochbaum:
Obituary for Professor Emeritus Jakob Kraurp. Eur. J. Oper. Res. 310(1): 1-2 (2023) - [j91]Davide Cazzaro, David Franz Koza, David Pisinger:
Combined layout and cable optimization of offshore wind farms. Eur. J. Oper. Res. 311(1): 301-315 (2023) - [j90]Karen R. Smilowitz, Jean-François Cordeau, Barrett W. Thomas, David Pisinger, Yafeng Yin, Ann M. Campbell:
Special Issue on Emerging Topics in Transportation Science and Logistics. Transp. Sci. 57(4): 839-842 (2023) - 2022
- [j89]Davide Cazzaro, David Pisinger:
Variable neighborhood search for large offshore wind farm layout optimization. Comput. Oper. Res. 138: 105588 (2022) - [j88]Niels-Christian Fink Bagger, Evelien van der Hurk, Rowan Hoogervorst, David Pisinger:
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes. Comput. Oper. Res. 142: 105718 (2022) - [j87]Erik Orm Hellsten, David Sacramento, David Pisinger:
A branch-and-price algorithm for solving the single-hub feeder network design problem. Eur. J. Oper. Res. 300(3): 902-916 (2022) - [j86]Davide Cazzaro, David Pisinger:
Balanced cable routing for offshore wind farms with obstacles. Networks 80(4): 386-406 (2022) - [c10]Jinwen Ye, Giovanni Pantuso, David Pisinger:
Fleet Size Control in First-Mile Ride-Sharing Problems. ICCL 2022: 91-104 - [i7]Mette Gamst, David Pisinger:
Decision support for the Technician Routing and Scheduling Problem. CoRR abs/2211.16968 (2022) - 2021
- [j85]Erik Orm Hellsten, David Franz Koza, Iván A. Contreras, Jean-François Cordeau, David Pisinger:
The transit time constrained fixed charge multi-commodity network design problem. Comput. Oper. Res. 136: 105511 (2021) - [j84]David Pisinger, Rosario Scatamacchia:
The Baggage Belt Assignment Problem. EURO J. Transp. Logist. 10: 100041 (2021) - [j83]Miriam Enzi, Sophie N. Parragh, David Pisinger, Matthias Prandtstetter:
Modeling and solving the multimodal car- and ride-sharing problem. Eur. J. Oper. Res. 293(1): 290-303 (2021) - [j82]Alessio Trivella, Selvaprabu Nadarajah, Stein-Erik Fleten, Denis Mazieres, David Pisinger:
Managing Shutdown Decisions in Merchant Commodity and Energy Production: A Social Commerce Perspective. Manuf. Serv. Oper. Manag. 23(2): 311-330 (2021) - [j81]Torben Barth, David Pisinger:
Baggage Carousel Assignment at Airports: Model and Case Study. Oper. Res. Forum 2(1) (2021) - [j80]Torben Barth, Janus Timler Holm, Jakob Lindorff Larsen, David Pisinger:
Optimization of Transfer Baggage Handling in a Major Transit Airport. Oper. Res. Forum 2(2) (2021) - 2020
- [j79]Line Blander Reinhardt, David Pisinger, Mikkel Sigurd, Jonas Ahmt:
Speed optimizations for liner networks with business constraints. Eur. J. Oper. Res. 285(3): 1127-1140 (2020) - [j78]Marielle Christiansen, Erik Orm Hellsten, David Pisinger, David Sacramento, Charlotte Vilhelmsen:
Liner shipping network design. Eur. J. Oper. Res. 286(1): 1-20 (2020) - [j77]Erik Orm Hellsten, David Sacramento, David Pisinger:
An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports. Eur. J. Oper. Res. 287(2): 682-698 (2020) - [j76]Martina Fischetti, Jesper Runge Kristoffersen, Thomas Hjort, Michele Monaci, David Pisinger:
Vattenfall Optimizes Offshore Wind Farm Design. INFORMS J. Appl. Anal. 50(1): 80-94 (2020) - [j75]Stefanie Buchholz, Mette Gamst, David Pisinger:
Finding a Portfolio of Near-Optimal Aggregated Solutions to Capacity Expansion Energy System Models. Oper. Res. Forum 1(1) (2020) - [j74]David Sacramento, Christine Solnon, David Pisinger:
Constraint Programming and Local Search Heuristic: a Matheuristic Approach for Routing and Scheduling Feeder Vessels in Multi-terminal Ports. Oper. Res. Forum 1(4) (2020) - [i6]Miriam Enzi, Sophie N. Parragh, David Pisinger, Matthias Prandtstetter:
Modeling and solving the multimodal car- and ride-sharing problem. CoRR abs/2001.05490 (2020) - [i5]Miriam Enzi, Sophie N. Parragh, David Pisinger:
Modeling and solving a vehicle-sharing problem. CoRR abs/2003.08207 (2020) - [i4]David Pisinger, Rosario Scatamacchia:
The Baggage Belt Assignment Problem. CoRR abs/2006.03365 (2020) - [i3]Mette Gamst, Stefanie Buchholz, David Pisinger:
Time Aggregation Techniques Applied to a Capacity Expansion Model for Real-Life Sector Coupled Energy Systems. CoRR abs/2012.10244 (2020)
2010 – 2019
- 2019
- [j73]Martina Fischetti, David Pisinger:
Mathematical Optimization and Algorithms for Offshore Wind Farm Design: An Overview. Bus. Inf. Syst. Eng. 61(4): 469-485 (2019) - 2018
- [j72]Berit Dangaard Brouer, Christian Vad Karsten, David Pisinger:
Optimization in liner shipping. Ann. Oper. Res. 271(1): 205-236 (2018) - [j71]Martina Fischetti, David Pisinger:
Mixed Integer Linear Programming for new trends in wind farm cable routing. Electron. Notes Discret. Math. 64: 115-124 (2018) - [j70]Valerie Belton, Tim Bedford, David Pisinger:
Operational Research: Making an impact. Eur. J. Oper. Res. 264(3): 797-798 (2018) - [j69]Martina Fischetti, David Pisinger:
Optimizing wind farm cable routing considering power losses. Eur. J. Oper. Res. 270(3): 917-930 (2018) - [j68]Thomas R. Stidsen, David Pisinger, Daniele Vigo:
Scheduling EURO-k conferences. Eur. J. Oper. Res. 270(3): 1138-1147 (2018) - [j67]Martina Fischetti, David Pisinger:
Optimal wind farm cable routing: Modeling branches and offshore transformer modules. Networks 72(1): 42-59 (2018) - [j66]Alexander Krogsgaard, David Pisinger, Jesper Thorsen:
A flow-first route-next heuristic for liner shipping network design. Networks 72(3): 358-381 (2018) - [j65]Christian Vad Karsten, Stefan Ropke, David Pisinger:
Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions. Transp. Sci. 52(4): 769-787 (2018) - 2017
- [j64]Berit Dangaard Brouer, Christian Vad Karsten, David Pisinger:
Optimization in liner shipping. 4OR 15(1): 1-35 (2017) - [j63]Christian Vad Karsten, Berit Dangaard Brouer, David Pisinger:
Competitive Liner Shipping Network Design. Comput. Oper. Res. 87: 125-136 (2017) - [j62]David Pisinger, Alima Saidi:
Tolerance analysis for 0-1 knapsack problems. Eur. J. Oper. Res. 258(3): 866-876 (2017) - [j61]Ida Græsted Jensen, Marie Münster, David Pisinger:
Optimizing the supply chain of biomass and biogas for a single plant considering mass and energy losses. Eur. J. Oper. Res. 262(2): 744-758 (2017) - [c9]Martina Fischetti, David Pisinger:
On the Impact of using Mixed Integer Programming Techniques on Real-world Offshore Wind Parks. ICORES 2017: 108-118 - 2016
- [j60]Alessio Trivella, David Pisinger:
The load-balanced multi-dimensional bin-packing problem. Comput. Oper. Res. 74: 152-164 (2016) - [j59]Line Blander Reinhardt, David Pisinger, Simon Spoorendonk, Mikkel Sigurd:
Optimization of the drayage problem using exact methods. INFOR Inf. Syst. Oper. Res. 54(1): 33-51 (2016) - [j58]Line Blander Reinhardt, Mads Kehlet Jepsen, David Pisinger:
The Edge Set Cost of the Vehicle Routing Problem with Time Windows. Transp. Sci. 50(2): 694-707 (2016) - [c8]Martina Fischetti, David Pisinger:
Inter-array cable routing optimization for big wind parks with obstacles. ECC 2016: 617-622 - 2015
- [j57]Agnieszka Karolina Konicz, David Pisinger, Alex Weissensteiner:
Optimal annuity portfolio under inflation risk. Comput. Manag. Sci. 12(3): 461-488 (2015) - [j56]Agnieszka Karolina Konicz, David Pisinger, Kourosh Marjani Rasmussen, Mogens Steffensen:
A combined stochastic programming and optimal control approach to personal finance and pensions. OR Spectr. 37(3): 583-616 (2015) - [j55]Kevin Tierney, Björg Áskelsdóttir, Rune Møller Jensen, David Pisinger:
Solving the Liner Shipping Fleet Repositioning Problem with Cargo Flows. Transp. Sci. 49(3): 652-674 (2015) - [c7]Berit Dangaard Brouer, Guy Desaulniers, Christian Vad Karsten, David Pisinger:
A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions. ICCL 2015: 195-208 - [c6]Line Blander Reinhardt, Susanne Nordholm, David Pisinger:
Capacity Analysis of Freight Transport with Application to the Danish and Southern Swedish Railway. ICCL 2015: 627-647 - 2014
- [j54]Christian E. M. Plum, David Pisinger, Juan José Salazar González, Mikkel Sigurd:
Single liner shipping service design. Comput. Oper. Res. 45: 1-6 (2014) - [j53]Mads Kehlet Jepsen, Bjørn Petersen, Simon Spoorendonk, David Pisinger:
A branch-and-cut algorithm for the capacitated profitable tour problem. Discret. Optim. 14: 78-96 (2014) - [j52]Claudia Archetti, David Pisinger, M. Grazia Speranza:
Special issue on: "matheuristics". EURO J. Comput. Optim. 2(4): 221-222 (2014) - [j51]Christian E. M. Plum, David Pisinger, Mikkel Sigurd:
A service flow model for the liner shipping network design problem. Eur. J. Oper. Res. 235(2): 378-386 (2014) - [j50]Berit D. Brouer, J. Fernando Alvarez, Christian E. M. Plum, David Pisinger, Mikkel Sigurd:
A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design. Transp. Sci. 48(2): 281-312 (2014) - [c5]Kevin Tierney, David Pisinger, Rune Møller Jensen:
Column Generation for the Liner Shipping Fleet Repositioning Problem (Abstract Only). MKWI 2014: 1472 - [i2]Henrik Reif Andersen, Tarik Hadzic, David Pisinger:
Interactive Cost Configuration Over Decision Diagrams. CoRR abs/1401.3830 (2014) - 2013
- [j49]Shahin Gelareh, Rahimeh Neamatian Monemi, Philippe Mahey, Nelson Maculan, David Pisinger:
Single string planning problem arising in liner shipping industries: A heuristic approach. Comput. Oper. Res. 40(10): 2357-2373 (2013) - [j48]Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian Plum, Bo Vaaben:
The Vessel Schedule Recovery Problem (VSRP) - A MIP model for handling disruptions in liner shipping. Eur. J. Oper. Res. 224(2): 362-374 (2013) - [j47]Line Blander Reinhardt, Tommy Clausen, David Pisinger:
Synchronized dial-a-ride transportation of disabled passengers at airports. Eur. J. Oper. Res. 225(1): 106-117 (2013) - [j46]Alper Atamtürk, Laurent Flindt Muller, David Pisinger:
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds. INFORMS J. Comput. 25(3): 420-431 (2013) - [j45]Mette Gamst, David Pisinger:
Integrated job scheduling and network routing. Networks 61(3): 248-262 (2013) - 2012
- [j44]Laurent Flindt Muller, Simon Spoorendonk, David Pisinger:
A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. Eur. J. Oper. Res. 218(3): 614-623 (2012) - [c4]Line Blander Reinhardt, Simon Spoorendonk, David Pisinger:
Solving Vehicle Routing with Full Container Load and Time Windows. ICCL 2012: 120-128 - 2011
- [j43]Line Blander Reinhardt, David Pisinger:
Multi-objective and multi-constrained non-additive shortest path problems. Comput. Oper. Res. 38(3): 605-616 (2011) - [j42]Berit D. Brouer, David Pisinger, Simon Spoorendonk:
Liner Shipping Cargo Allocation with Repositioning of Empty Containers. INFOR Inf. Syst. Oper. Res. 49(2): 109-124 (2011) - [j41]Lasse Nisted, David Pisinger, Avri Altman:
Optimal wafer cutting in shuttle layout problems. J. Comb. Optim. 22(2): 202-216 (2011) - [c3]Torben Barth, David Pisinger:
Scheduling of outbound luggage handling at airports. OR 2011: 251-256 - 2010
- [j40]Rasmus Resen Amossen, David Pisinger:
Multi-dimensional bin packing problems with guillotine constraints. Comput. Oper. Res. 37(11): 1999-2006 (2010) - [j39]Jens Egeblad, Achille Claudio Garavelli, Stefano Lisi, David Pisinger:
Heuristics for container loading of furniture. Eur. J. Oper. Res. 200(3): 881-892 (2010) - [j38]Mette Gamst, Peter Neergaard Jensen, David Pisinger, Christian Plum:
Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem. Eur. J. Oper. Res. 202(1): 82-89 (2010) - [j37]Tommy Clausen, Allan Nordlunde Hjorth, Morten Nielsen, David Pisinger:
The off-line group seat reservation problem. Eur. J. Oper. Res. 207(3): 1244-1253 (2010) - [j36]Henrik Reif Andersen, Tarik Hadzic, David Pisinger:
Interactive Cost Configuration Over Decision Diagrams. J. Artif. Intell. Res. 37: 99-139 (2010)
2000 – 2009
- 2009
- [j35]Jens Egeblad, David Pisinger:
Heuristic approaches for the two- and three-dimensional knapsack packing problem. Comput. Oper. Res. 36(4): 1026-1049 (2009) - [i1]David Pisinger:
ENERPLAN - Green Logistic Solutions. ERCIM News 2009(79) (2009) - 2008
- [j34]Mads Jepsen, Bjørn Petersen, Simon Spoorendonk, David Pisinger:
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows. Oper. Res. 56(2): 497-511 (2008) - 2007
- [j33]David Pisinger, Stefan Ropke:
A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8): 2403-2435 (2007) - [j32]David Pisinger:
The quadratic knapsack problem - a survey. Discret. Appl. Math. 155(5): 623-648 (2007) - [j31]David Pisinger, Mikkel Sigurd:
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem. INFORMS J. Comput. 19(1): 36-51 (2007) - [j30]David Pisinger, Anders Bo Rasmussen, Rune Sandvik:
Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction. INFORMS J. Comput. 19(2): 280-290 (2007) - [j29]David Pisinger:
Denser Packings Obtained in O(n log log n) Time. INFORMS J. Comput. 19(3): 395-405 (2007) - [j28]Silvano Martello, David Pisinger, Daniele Vigo, Edgar den Boef, Jan H. M. Korst:
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Softw. 33(1): 7 (2007) - 2006
- [j27]David Pisinger:
Upper bounds and exact algorithms for p-dispersion problems. Comput. Oper. Res. 33: 1380-1398 (2006) - [j26]Stefan Ropke, David Pisinger:
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls. Eur. J. Oper. Res. 171(3): 750-775 (2006) - [j25]Stefan Ropke, David Pisinger:
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transp. Sci. 40(4): 455-472 (2006) - 2005
- [j24]David Pisinger:
Where are the hard knapsack problems? Comput. Oper. Res. 32: 2271-2284 (2005) - [j23]David Pisinger, Mikkel Sigurd:
The two-dimensional bin packing problem with variable bin sizes and costs. Discret. Optim. 2(2): 154-167 (2005) - [j22]Edgar den Boef, Jan H. M. Korst, Silvano Martello, David Pisinger, Daniele Vigo:
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems. Oper. Res. 53(4): 735-736 (2005) - 2004
- [b1]Hans Kellerer, Ulrich Pferschy, David Pisinger:
Knapsack problems. Springer 2004, ISBN 978-3-540-40286-2, pp. I-XX, 1-546 - [j21]Mikkel Sigurd, David Pisinger, Michael Sig:
Scheduling Transportation of Live Animals to Avoid the Spread of Diseases. Transp. Sci. 38(2): 197-209 (2004) - 2003
- [j20]David Pisinger:
Dynamic Programming on the Word RAM. Algorithmica 35(2): 128-145 (2003) - [j19]Oluf Faroe, David Pisinger, Martin Zachariasen:
Guided Local Search for Final Placement in VLSI Design. J. Heuristics 9(3): 269-295 (2003) - [j18]Oluf Faroe, David Pisinger, Martin Zachariasen:
Guided Local Search for the Three-Dimensional Bin-Packing Problem. INFORMS J. Comput. 15(3): 267-283 (2003) - 2002
- [j17]Jakob Krarup, David Pisinger, Frank Plastria:
Discrete location problems with push-pull objectives. Discret. Appl. Math. 123(1-3): 363-378 (2002) - [j16]Jakob Krarup, David Pisinger:
The EURO 2000 feature issue of EJOR. Eur. J. Oper. Res. 140(2): 167-169 (2002) - [j15]David Pisinger:
Heuristics for the container loading problem. Eur. J. Oper. Res. 141(2): 382-392 (2002) - 2001
- [j14]David Pisinger:
Budgeting with bounded multiple-choice constraints. Eur. J. Oper. Res. 129(3): 471-480 (2001) - [j13]Tibor Illés, David Pisinger:
Upper Bounds on the Covering Number of Galois-Planes with Small Order. J. Heuristics 7(1): 59-76 (2001) - [c2]Oluf Faroe, David Pisinger, Martin Zachariasen:
Local Search for Final Placement in VLSI Design. ICCAD 2001: 565-572 - 2000
- [j12]Silvano Martello, David Pisinger, Paolo Toth:
New trends in exact algorithms for the 0-1 knapsack problem. Eur. J. Oper. Res. 123(2): 325-332 (2000) - [j11]Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger:
Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2): 333-345 (2000) - [j10]Jakob Krarup, David Pisinger:
Editorial. Eur. J. Oper. Res. 125(2): 219-221 (2000) - [j9]David Pisinger:
A Minimal Algorithm for the Bounded Knapsack Problem. INFORMS J. Comput. 12(1): 75-82 (2000) - [j8]Silvano Martello, David Pisinger, Daniele Vigo:
The Three-Dimensional Bin Packing Problem. Oper. Res. 48(2): 256-267 (2000)
1990 – 1999
- 1999
- [j7]David Pisinger:
An exact algorithm for large multiple knapsack problems. Eur. J. Oper. Res. 114(3): 528-541 (1999) - [j6]Alberto Caprara, David Pisinger, Paolo Toth:
Exact Solution of the Quadratic Knapsack Problem. INFORMS J. Comput. 11(2): 125-137 (1999) - [j5]David Pisinger:
Core Problems in Knapsack Algorithms. Oper. Res. 47(4): 570-575 (1999) - [j4]David Pisinger:
Linear Time Algorithms for Knapsack Problems with Bounded Weights. J. Algorithms 33(1): 1-14 (1999) - 1998
- [j3]David Pisinger:
A Fast Algorithm for Strongly Correlated Knapsack Problems. Discret. Appl. Math. 89(1-3): 197-212 (1998) - 1997
- [j2]Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger:
Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discret. Appl. Math. 77(3): 271-280 (1997) - [j1]David Pisinger:
A Minimal Algorithm for the 0-1 Knapsack Problem. Oper. Res. 45(5): 758-767 (1997) - 1995
- [c1]David Pisinger:
A Minimal Algorithm for the Bounded Knapsack Problem. IPCO 1995: 95-109
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-26 01:50 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:
