default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErwin Pesch
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
[j97]Mikhail Y. Kovalyov, Katarzyna Anna Kuzmicz
, Mikhail N. Lukashevich, Erwin Pesch:
Planning container inspection and repair: A case study. Comput. Oper. Res. 164: 106555 (2024)- [j96]Amir Hosseini, Alena Otto, Erwin Pesch:
Scheduling in manufacturing with transportation: Classification and solution techniques. Eur. J. Oper. Res. 315(3): 821-843 (2024) - 2023
- [j95]Jan-Erik Justkowiak, Erwin Pesch:
Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems. Eur. J. Oper. Res. 305(3): 1063-1078 (2023) - [j94]Jan-Erik Justkowiak, Sergey Kovalev, Mikhail Y. Kovalyov, Erwin Pesch:
Single machine scheduling with assignable due dates to minimize maximum and total late work. Eur. J. Oper. Res. 308(1): 76-83 (2023) - [j93]Mikhail Y. Kovalyov, Mikhail N. Lukashevich, Erwin Pesch:
Cost minimizing planning of container inspection and repair in multiple facilities. OR Spectr. 45(1): 181-204 (2023) - [j92]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
Mathematical challenges in scheduling theory. J. Sched. 26(6): 519-521 (2023) - 2022
- [j91]Tsan-Ming Choi, Alexandre Dolgui, Dmitry A. Ivanov, Erwin Pesch:
OR and analytics for digital, resilient, and sustainable manufacturing 4.0. Ann. Oper. Res. 310(1): 1-6 (2022) - [j90]Kai Wang, Erwin Pesch, Dominik Kress, Ilia Fridman, Nils Boysen:
The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse. Eur. J. Oper. Res. 296(2): 504-519 (2022) - [j89]David Müller, Marcus Gerhard Müller, Dominik Kress, Erwin Pesch:
An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning. Eur. J. Oper. Res. 302(3): 874-891 (2022) - [j88]Sezgi Tekil-Ergün, Erwin Pesch, Katarzyna Anna Kuzmicz:
Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation. Int. J. Prod. Res. 60(1): 297-323 (2022) - 2021
- [j87]Mikhail Y. Kovalyov, Erwin Pesch, Alain Quilliot:
Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation. Eur. J. Oper. Res. 289(3): 1008-1012 (2021) - [j86]Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
Dynamic pricing with demand disaggregation for hotel revenue management. J. Heuristics 27(5): 869-885 (2021) - [j85]Ilia Fridman, Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
Fixed interval scheduling with third-party machines. Networks 77(3): 361-371 (2021) - [j84]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New Perspectives in Scheduling Theory. J. Sched. 24(5): 455-457 (2021) - [i2]Jan Badura, Artur Laskowski, Maciej Antczak, Jacek Blazewicz, Grzegorz Pawlak, Erwin Pesch, Thomas Villmann, Szymon Wasik:
Brilliant Challenges Optimization Problem Submission Contest Final Report. CoRR abs/2110.04916 (2021) - 2020
- [j83]Ilia Fridman, Erwin Pesch, Yakov M. Shafransky:
Minimizing maximum cost for a single machine under uncertainty of processing times. Eur. J. Oper. Res. 286(2): 444-457 (2020) - [j82]Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir, Erwin Pesch:
Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. J. Heuristics 26(1): 83-118 (2020) - [j81]Erwin Pesch, Katarzyna Anna Kuzmicz:
Non-approximability of the single crane container transhipment problem. Int. J. Prod. Res. 58(13): 3965-3975 (2020)
2010 – 2019
- 2019
- [j80]Mikhail Y. Kovalyov, Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
A parallel machine schedule updating game with compensations and clients averse to uncertain loss. Comput. Oper. Res. 103: 148-157 (2019) - [j79]Xiyu Li, Alena Otto, Erwin Pesch:
Solving the single crane scheduling problem at rail transshipment yards. Discret. Appl. Math. 264: 134-147 (2019) - [j78]Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas. Eur. J. Oper. Res. 279(3): 732-750 (2019) - [j77]Alena Otto, Erwin Pesch:
The train-to-yard assignment problem. OR Spectr. 41(2): 549-580 (2019) - 2018
- [j76]Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs. Discret. Appl. Math. 242: 89-101 (2018) - [j75]Ali Allahverdi, Erwin Pesch, Michael L. Pinedo, Frank Werner:
Scheduling in manufacturing systems: new trends and perspectives. Int. J. Prod. Res. 56(19): 6333-6335 (2018) - [j74]Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
A note on scheduling container storage operations of two non-passing stacking cranes. Networks 71(3): 271-280 (2018) - [j73]Alena Otto, Niels A. H. Agatz, James F. Campbell, Bruce L. Golden, Erwin Pesch:
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey. Networks 72(4): 411-458 (2018) - [j72]Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
Mechanism design for machine scheduling problems: classification and literature overview. OR Spectr. 40(3): 583-611 (2018) - [j71]Andrei M. Bandalouski, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
An overview of revenue management and dynamic pricing models in hotel business. RAIRO Oper. Res. 52(1): 119-141 (2018) - [j70]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. J. Sched. 21(6): 581-582 (2018) - [j69]Dominik Kress, Maksim Barketau, Erwin Pesch:
Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. J. Sched. 21(6): 595-606 (2018) - [j68]Jenny Nossack, Dirk Briskorn, Erwin Pesch:
Container Dispatching and Conflict-Free Yard Crane Routing in an Automated Container Terminal. Transp. Sci. 52(5): 1059-1076 (2018) - [c10]Dominik Kress, Maksim Barketau, Erwin Pesch, David Müller:
Complexity and Approximation Results for Setup-Minimal Batch Scheduling with Deadlines on a Single Processor. OR 2018: 475-480 - 2017
- [j67]Jenny Nossack, Bruce L. Golden, Erwin Pesch, Rui Zhang:
The windy rural postman problem with a time-dependent zigzag option. Eur. J. Oper. Res. 258(3): 1131-1142 (2017) - [j66]Ulrich Dorndorf, Florian Jaehn, Erwin Pesch:
Flight gate assignment and recovery strategies with stochastic arrival and departure times. OR Spectr. 39(1): 65-93 (2017) - [j65]Mateusz Cichenski, Florian Jaehn, Grzegorz Pawlak, Erwin Pesch, Gaurav Singh, Jacek Blazewicz:
An integrated model for the transshipment yard scheduling problem. J. Sched. 20(1): 57-65 (2017) - [j64]Alena Otto, Xiyu Li, Erwin Pesch:
Two-Way Bounded Dynamic Programming Approach for Operations Planning in Transshipment Yards. Transp. Sci. 51(1): 325-342 (2017) - 2016
- [j63]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Erhan Kozan, Erwin Pesch:
Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117]. Inf. Sci. 357: 217 (2016) - [j62]Maksim Barketau, Erwin Pesch, Yakov M. Shafransky:
Scheduling dedicated jobs with variative processing times. J. Comb. Optim. 31(2): 774-785 (2016) - [j61]Graham Kendall, Ruibin Bai, Jacek Blazewicz, Patrick De Causmaecker, Michel Gendreau, Robert I. John, Jiawei Li, Barry McCollum, Erwin Pesch, Rong Qu, Nasser R. Sabar, Greet Vanden Berghe, Angelina Yee:
Good Laboratory Practice for optimization research. J. Oper. Res. Soc. 67(4): 676-689 (2016) - [j60]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. J. Sched. 19(6): 617-618 (2016) - [c9]Erwin Pesch, Mikhail Y. Kovalyov, Dominik Kress, Sebastian Meiswinkel:
Decentralized sequencing of jobs on a single machine. SSCI 2016: 1-7 - 2015
- [j59]Maksim Barketau, Erwin Pesch, Yakov M. Shafransky:
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph. Discret. Appl. Math. 196: 4-19 (2015) - [j58]Michel Gendreau, Jenny Nossack, Erwin Pesch:
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem. Eur. J. Oper. Res. 242(3): 1008-1016 (2015) - [j57]Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
The Partitioning Min-Max Weighted Matching Problem. Eur. J. Oper. Res. 247(3): 745-754 (2015) - [j56]Jacek Blazewicz, Erwin Pesch, Cynthia A. Phillips, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. RAIRO Oper. Res. 49(2): 335-337 (2015) - [j55]Jacek Blazewicz, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New perspectives in scheduling theory. J. Sched. 18(4): 333-334 (2015) - [j54]Ehab Morsy, Erwin Pesch:
Approximation algorithms for inventory constrained scheduling on a single machine. J. Sched. 18(6): 645-653 (2015) - [c8]Erwin Pesch, Dominik Kress, Sebastian Meiswinkel:
An Integrated Matching and Partitioning Problem with Applications in Intermodal Transport. SSCI 2015: 1758-1765 - 2014
- [j53]Jenny Nossack, Erwin Pesch:
A branch-and-bound algorithm for the acyclic partitioning problem. Comput. Oper. Res. 41: 174-184 (2014) - 2013
- [j52]Florian Jaehn, Erwin Pesch:
New bounds and constraint propagation techniques for the clique partitioning problem. Discret. Appl. Math. 161(13-14): 2025-2037 (2013) - [j51]Jenny Nossack, Erwin Pesch:
A truck scheduling problem arising in intermodal container transportation. Eur. J. Oper. Res. 230(3): 666-680 (2013) - [j50]Marta Szachniuk, Mikolaj Malaczynski, Erwin Pesch, Edmund K. Burke, Jacek Blazewicz:
MLP accompanied beam search for the resonance assignment problem. J. Heuristics 19(3): 443-464 (2013) - [j49]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Erhan Kozan, Erwin Pesch:
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Inf. Sci. 224: 109-117 (2013) - [j48]Maksim Barketau, Herbert Kopfer, Erwin Pesch:
A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm. J. Oper. Res. Soc. 64(11): 1614-1621 (2013) - [j47]Dirk Briskorn, Florian Jaehn, Erwin Pesch:
Exact algorithms for inventory constrained scheduling on a single machine. J. Sched. 16(1): 105-115 (2013) - [j46]Michael A. Bender, Jacek Blazewicz, Erwin Pesch, Denis Trystram, Guochuan Zhang:
Guest editorial: "New trends in scheduling" - Centre CNRS "La Villa Clythia" Frejus Workshop, September 12-17, 2010. J. Sched. 16(4): 347-348 (2013) - [j45]Nils Boysen, Malte Fliedner, Florian Jaehn, Erwin Pesch:
A Survey on Container Processing in Railway Yards. Transp. Sci. 47(3): 312-329 (2013) - [c7]Erwin Pesch, Jenny Nossack:
Planning and Scheduling in Intermodal Transport. MIM 2013: 27-32 - [c6]Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov, Jenny Nossack, Erwin Pesch:
A Transfer Line Design Problem with Setup Times and Costs. MIM 2013: 778-783 - [c5]Jenny Nossack, Erwin Pesch:
Mathematical Formulations for the Acyclic Partitioning Problem. OR 2013: 333-339 - 2012
- [j44]Ulrich Dorndorf, Florian Jaehn, Erwin Pesch:
Flight gate scheduling with respect to a reference schedule. Ann. Oper. Res. 194(1): 177-187 (2012) - [j43]Dominik Kress, Erwin Pesch:
(r|p)-centroid problems on networks with vertex and edge demand. Comput. Oper. Res. 39(12): 2954-2967 (2012) - [j42]Dominik Kress, Erwin Pesch:
Sequential competitive location on networks. Eur. J. Oper. Res. 217(3): 483-499 (2012) - [j41]Erwin Pesch, Gerhard J. Woeginger:
Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn). Eur. J. Oper. Res. 219(3): 489-490 (2012) - [j40]Nils Boysen, Malte Fliedner, Florian Jaehn, Erwin Pesch:
Shunting yard operations: Theoretical aspects and applications. Eur. J. Oper. Res. 220(1): 1-14 (2012) - [j39]Sergei Chubanov, Erwin Pesch:
An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand. Oper. Res. Lett. 40(6): 445-449 (2012) - [j38]Nils Boysen, Florian Jaehn, Erwin Pesch:
New bounds and algorithms for the transshipment yard scheduling problem. J. Sched. 15(4): 499-511 (2012) - 2011
- [j37]Jacek Blazewicz, Wojciech Frohmberg, Michal Kierzynka, Erwin Pesch, Pawel Wojciechowski:
Protein alignment algorithms with an efficient backtracking routine on multiple GPUs. BMC Bioinform. 12: 181 (2011) - [j36]Nils Boysen, Florian Jaehn, Erwin Pesch:
Scheduling Freight Trains in Rail-Rail Transshipment Yards. Transp. Sci. 45(2): 199-211 (2011) - 2010
- [j35]Mikhail Y. Kovalyov, Erwin Pesch:
A generic approach to proving NP-hardness of partition type problems. Discret. Appl. Math. 158(17): 1908-1912 (2010) - [j34]Michael A. Bender, Jacek Blazewicz, Erwin Pesch, Denis Trystram, Guochuan Zhang:
Guest editorial - Special issue "New challenges in scheduling theory" (Marseilles Workshop, May 12-16, 2008). J. Sched. 13(5): 451-452 (2010)
2000 – 2009
- 2009
- [j33]Erwin Pesch, Malgorzata Sterna:
Late work minimization in flow shops by a genetic algorithm. Comput. Ind. Eng. 57(4): 1202-1209 (2009) - [j32]Lasse Asbach, Ulrich Dorndorf, Erwin Pesch:
Analysis, modeling and solution of the concrete delivery problem. Eur. J. Oper. Res. 193(3): 820-835 (2009) - [j31]Sergei Chubanov, Erwin Pesch:
Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities. Math. Methods Oper. Res. 70(2): 313-335 (2009) - 2008
- [j30]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Comput. Oper. Res. 35(2): 574-599 (2008) - [j29]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
A single-item economic lot-sizing problem with a non-uniform resource: Approximation. Eur. J. Oper. Res. 189(3): 877-889 (2008) - [j28]Michael A. Bender, Jacek Blazewicz, Klaus Ecker, Erwin Pesch, Denis Trystram:
Guest editorial. J. Sched. 11(5): 309-310 (2008) - [j27]Ulrich Dorndorf, Florian Jaehn, Erwin Pesch:
Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem. Transp. Sci. 42(3): 292-301 (2008) - 2007
- [j26]Jacek Blazewicz, Edmund K. Burke, Klaus Ecker, Erwin Pesch, Denis Trystram:
Selected papers from the Dagstuhl workshop. J. Sched. 10(2): 85-86 (2007) - [j25]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A note on the two machine job shop with the weighted late work criterion. J. Sched. 10(2): 87-95 (2007) - 2006
- [j24]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Math. Program. 106(3): 453-466 (2006) - 2005
- [j23]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Comput. Ind. Eng. 49(4): 611-624 (2005) - [j22]Silvano Martello, Erwin Pesch:
Logistics: From theory to application (ECCO XIV). Eur. J. Oper. Res. 162(1): 1-3 (2005) - [j21]Tamás Kis, Erwin Pesch:
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur. J. Oper. Res. 164(3): 592-608 (2005) - [j20]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
The two-machine flow-shop problem with weighted late work criterion and common due date. Eur. J. Oper. Res. 165(2): 408-415 (2005) - [c4]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date. KI 2005: 222-234 - 2004
- [j19]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Open shop scheduling problems with late work criteria. Discret. Appl. Math. 134(1-3): 1-24 (2004) - [c3]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy. AACC 2004: 68-75 - [e1]Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Denis Trystram:
Scheduling in Computer and Manufacturing Systems, 31.05. - 04.06.2004. Dagstuhl Seminar Proceedings 04231, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents] - [i1]Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Denis Trystram:
04231 Abstracts Collection - Scheduling in Computer and Manufacturing Systems. Scheduling in Computer and Manufacturing Systems 2004 - 2002
- [j18]Ulrich Dorndorf, Erwin Pesch, Toàn Phan Huy:
Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem. Ann. Oper. Res. 115(1-4): 125-145 (2002) - 2000
- [j17]Ulrich Dorndorf, Erwin Pesch, Toàn Phan Huy:
Constraint propagation techniques for the disjunctive scheduling problem. Artif. Intell. 122(1-2): 189-240 (2000) - [j16]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna:
The disjunctive graph machine representation of the job shop scheduling problem. Eur. J. Oper. Res. 127(2): 317-331 (2000) - [j15]Ulrich Dorndorf, Erwin Pesch, Toàn Phan Huy:
A branch-and-bound algorithm for the resource-constrained project scheduling problem. Math. Methods Oper. Res. 52(3): 413-439 (2000)
1990 – 1999
- 1999
- [j14]Peter Brucker, Andreas Drexl, Rolf H. Möhring, Klaus Neumann, Erwin Pesch:
Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1): 3-41 (1999) - [j13]Ulrich A. W. Tetzlaff, Erwin Pesch:
Optimal workload allocation between a job shop and an FMS. IEEE Trans. Robotics Autom. 15(1): 20-32 (1999) - 1998
- [j12]Ulrich Dorndorf, Andreas Drexl, Erwin Pesch, Toàn Phan Huy:
Adaptive Suchverfahren zur Projektplanung bei beschränkten Ressourcen. Künstliche Intell. 12(4): 25-32 (1998) - 1997
- [j11]Erwin Pesch, Fred W. Glover:
TSP Ejection Chains. Discret. Appl. Math. 76(1-3): 165-181 (1997) - 1996
- [j10]Erwin Pesch, Ulrich A. W. Tetzlaff:
Constraint Propagation Based Scheduling of Job Shops. INFORMS J. Comput. 8(2): 144-157 (1996) - 1995
- [j9]Ulrich Dorndorf, Erwin Pesch:
Evolution based learning in a job shop scheduling environment. Comput. Oper. Res. 22(1): 25-40 (1995) - [c2]Yves Crama, Antoon W. J. Kolen, Erwin Pesch:
Local Search in Combinatorial Optimization. Artificial Neural Networks 1995: 157-174 - 1994
- [j8]Antoon W. J. Kolen, Erwin Pesch:
Genetic Local Search in Combinatorial Optimization. Discret. Appl. Math. 48(3): 273-284 (1994) - [j7]Ulrich Dorndorf, Erwin Pesch:
Fast Clustering Algorithms. INFORMS J. Comput. 6(2): 141-153 (1994) - 1991
- [j6]Hans-Jürgen Bandelt, Erwin Pesch:
Efficient characterizations of n-chromatic absolute retracts. J. Comb. Theory B 53(1): 5-31 (1991) - [j5]Harald Friedrich, Joachim Keßler, Erwin Pesch, Birgit Schildt:
Batch scheduling on parallel units in acrylic-glass production. ZOR Methods Model. Oper. Res. 35(4): 321-345 (1991) - 1990
- [c1]Nico L. J. Ulder, Emile H. L. Aarts, Hans-Jürgen Bandelt, Peter J. M. van Laarhoven, Erwin Pesch:
Genetic Local Search Algorithms for the Travelling Salesman Problem. PPSN 1990: 109-116
1980 – 1989
- 1989
- [j4]Hans-Jürgen Bandelt, Erwin Pesch:
DismantlinG Absolute Retracts of Reflexive Graphs. Eur. J. Comb. 10(3): 211-220 (1989) - 1988
- [j3]Erwin Pesch:
Products of absolute retracts. Discret. Math. 69(2): 179-188 (1988) - 1987
- [j2]Erwin Pesch:
Minimal extensions of graphs to absolute retracts. J. Graph Theory 11(4): 585-598 (1987) - 1985
- [j1]Erwin Pesch, Werner Poguntke:
A characterization of absolute retracts of n-chromatic graphs. Discret. Math. 57(1-2): 99-104 (1985)
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-08-23 18:31 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:
