default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaly A. Strusevich
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
[j96]Akiyoshi Shioura
, Vitaly A. Strusevich, Natalia V. Shakhlevich:
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. Networks 83(3): 527-546 (2024)- [j95]Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich:
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. 27(2): 203-224 (2024) - 2023
- [j94]Hans Kellerer, Vitaly A. Strusevich:
The two-flight low risk helicopter transportation problem under the split pickup scenario. EURO J. Transp. Logist. 12: 100115 (2023) - [j93]Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach:
A historical note on the complexity of scheduling problems. Oper. Res. Lett. 51(1): 1-2 (2023) - [j92]Bo Chen, Vitaly A. Strusevich:
An FPTAS for scheduling with resource constraints. Oper. Res. Lett. 51(4): 421-424 (2023) - 2022
- [j91]Vitaly A. Strusevich:
Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches. Comput. Oper. Res. 144: 105732 (2022) - [j90]Alan J. Soper, Vitaly A. Strusevich:
Preemptive and non-preemptive scheduling on two unrelated parallel machines. J. Sched. 25(6): 659-674 (2022) - 2021
- [j89]Alan J. Soper, Vitaly A. Strusevich:
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines. Ann. Oper. Res. 298(1): 469-495 (2021) - [j88]Vitaly A. Strusevich:
Approximation algorithms for makespan minimization on identical parallel machines under resource constraints. J. Oper. Res. Soc. 72(9): 2135-2146 (2021) - 2020
- [j87]Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich:
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR 18(4): 439-456 (2020) - [j86]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. J. Glob. Optim. 76(3): 471-490 (2020) - [j85]Alan J. Soper, Vitaly A. Strusevich:
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects. J. Sched. 23(6): 665-680 (2020)
2010 – 2019
- 2019
- [j84]Alan J. Soper, Vitaly A. Strusevich:
Schedules with a single preemption on uniform parallel machines. Discret. Appl. Math. 261: 332-343 (2019) - [e1]Igor A. Bykadorov, Vitaly A. Strusevich, Tatiana V. Tchemisova:
Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Revised Selected Papers. Communications in Computer and Information Science 1090, Springer 2019, ISBN 978-3-030-33393-5 [contents] - 2018
- [j83]Marcos de Melo da Silva, Günes Erdogan, Maria Battarra, Vitaly A. Strusevich:
The Block Retrieval Problem. Eur. J. Oper. Res. 265(3): 931-950 (2018) - [j82]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur. J. Oper. Res. 266(3): 795-818 (2018) - [j81]Nir Halman, Hans Kellerer, Vitaly A. Strusevich:
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints. Eur. J. Oper. Res. 270(2): 435-447 (2018) - [j80]Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich, Jonathan Mosheiff:
Two-machine flow shop and open shop scheduling problems with a single maintenance window. Eur. J. Oper. Res. 271(2): 388-400 (2018) - [j79]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas:
Models and algorithms for energy-efficient scheduling with immediate start of jobs. J. Sched. 21(5): 505-516 (2018) - 2017
- [j78]Rebecca Sarto Basso, Vitaly A. Strusevich:
Differential approximation schemes for half-product related functions and their scheduling applications. Discret. Appl. Math. 217: 71-78 (2017) - [j77]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints. INFORMS J. Comput. 29(4): 724-736 (2017) - [j76]Kabir Rustogi, Vitaly A. Strusevich:
Single machine scheduling with a generalized job-dependent cumulative effect. J. Sched. 20(6): 583-592 (2017) - [j75]Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich:
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. SIAM J. Discret. Math. 31(1): 101-123 (2017) - [j74]Hans Kellerer, Rebecca Sarto Basso, Vitaly A. Strusevich:
Approximability issues for unconstrained and constrained maximization of half-product related functions. Theor. Comput. Sci. 659: 64-71 (2017) - 2016
- [j73]Hans Kellerer, Vitaly A. Strusevich:
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications. Ann. Oper. Res. 240(1): 39-94 (2016) - [j72]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines. INFORMS J. Comput. 28(1): 148-161 (2016) - [c4]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. DOOR 2016: 74-90 - 2015
- [j71]Kabir Rustogi, Vitaly A. Strusevich:
Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance. J. Oper. Res. Soc. 66(3): 500-515 (2015) - [j70]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math. Program. 153(2): 495-534 (2015) - 2014
- [j69]Richard Quibell, Vitaly A. Strusevich:
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order. Comput. Ind. Eng. 76: 347-359 (2014) - [j68]Alan J. Soper, Vitaly A. Strusevich:
Single parameter analysis of power of preemption on two and three uniform machines. Discret. Optim. 12: 26-46 (2014) - [c3]Alan J. Soper, Vitaly A. Strusevich:
Power of Preemption on Uniform Parallel Machines. APPROX-RANDOM 2014: 392-402 - 2013
- [j67]Laureano F. Escudero, Silvano Martello, Vitaly A. Strusevich:
An overview of computational issues in combinatorial optimization. Ann. Oper. Res. 207(1): 1-5 (2013) - [j66]Hans Kellerer, Vitaly A. Strusevich:
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. Eur. J. Oper. Res. 228(1): 24-32 (2013) - [j65]Kabir Rustogi, Vitaly A. Strusevich:
Parallel Machine Scheduling: Impact of Adding Extra Machines. Oper. Res. 61(5): 1243-1257 (2013) - [j64]Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Preemptive scheduling on two identical parallel machines with a single transporter. J. Comb. Optim. 25(2): 279-307 (2013) - [j63]Hans Kellerer, Kabir Rustogi, Vitaly A. Strusevich:
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. J. Sched. 16(6): 675-683 (2013) - [j62]Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. SIAM J. Discret. Math. 27(1): 186-204 (2013) - 2012
- [j61]Hans Kellerer, Vitaly A. Strusevich:
The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR 10(2): 111-161 (2012) - [j60]Alexandre Dolgui, Valery S. Gordon, Vitaly A. Strusevich:
Single machine scheduling with precedence constraints and positionally dependent processing times. Comput. Oper. Res. 39(6): 1218-1224 (2012) - [j59]Kabir Rustogi, Vitaly A. Strusevich:
Simple matching vs linear assignment in scheduling models with positional effects: A critical review. Eur. J. Oper. Res. 222(3): 393-407 (2012) - [j58]Jacek Blazewicz, Edmund K. Burke, Valery S. Gordon, Mikhail Y. Kovalyov, Yakov M. Shafransky, Vitaly A. Strusevich:
Editorial: new branches, old roots. J. Sched. 15(4): 399-401 (2012) - [j57]Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov:
Vyacheslav Tanaev: contributions to scheduling and related areas. J. Sched. 15(4): 403-418 (2012) - [j56]Valery S. Gordon, Vitaly A. Strusevich, Alexandre Dolgui:
Scheduling with due date assignment under special conditions on job processing. J. Sched. 15(4): 447-456 (2012) - 2011
- [j55]Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich:
Hamiltonian properties of locally connected graphs with bounded vertex degree. Discret. Appl. Math. 159(16): 1759-1774 (2011) - 2010
- [j54]Hans Kellerer, Vitaly A. Strusevich:
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. Algorithmica 57(4): 769-795 (2010) - [j53]Irina N. Lushchakova, Vitaly A. Strusevich:
Scheduling incompatible tasks on two machines. Eur. J. Oper. Res. 200(2): 334-346 (2010) - [j52]Hans Kellerer, Vitaly A. Strusevich:
Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack. Int. J. Found. Comput. Sci. 21(3): 357-383 (2010) - [c2]Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Transporting Jobs through a Processing Center with Two Parallel Machines. COCOA (1) 2010: 408-422
2000 – 2009
- 2009
- [j51]Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich:
Operator non-availability periods. 4OR 7(3): 239-253 (2009) - [j50]Gerd Finke, Vitaly A. Strusevich, Frank Werner:
Guest Editorial. Comput. Oper. Res. 36(2): 299-300 (2009) - [j49]Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich:
Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36(2): 379-390 (2009) - [j48]Valery S. Gordon, Vitaly A. Strusevich:
Single machine scheduling and due date assignment with positionally dependent processing times. Eur. J. Oper. Res. 198(1): 57-62 (2009) - [j47]Hans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich:
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. Eur. J. Oper. Res. 199(1): 111-116 (2009) - [j46]Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich:
Single Machine Scheduling with Controllable Processing Times by submodular Optimization. Int. J. Found. Comput. Sci. 20(2): 247-269 (2009) - [j45]Chris N. Potts, Vitaly A. Strusevich:
Fifty years of scheduling: a survey of milestones. J. Oper. Res. Soc. 60(S1) (2009) - 2008
- [j44]Natalia V. Shakhlevich, Vitaly A. Strusevich:
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. Algorithmica 51(4): 451-473 (2008) - [j43]Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead:
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J. Sched. 11(5): 357-370 (2008) - [c1]Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich:
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. ESA 2008: 756-767 - 2007
- [j42]Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich:
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints. Electron. Notes Discret. Math. 29: 169-173 (2007) - [j41]Alan J. Soper, Vitaly A. Strusevich:
An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter. Int. J. Found. Comput. Sci. 18(3): 565-591 (2007) - 2006
- [j40]Natalia V. Shakhlevich, Vitaly A. Strusevich:
Single machine scheduling with controllable release and processing parameters. Discret. Appl. Math. 154(15): 2178-2199 (2006) - [j39]Mikhail A. Kubzin, Vitaly A. Strusevich:
Planning Machine Maintenance in Two-Machine Shop Scheduling. Oper. Res. 54(4): 789-800 (2006) - [j38]Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra:
Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper. Res. Lett. 34(4): 459-464 (2006) - [j37]Hans Kellerer, Vitaly A. Strusevich:
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theor. Comput. Sci. 369(1-3): 230-238 (2006) - 2005
- [j36]Mikhail A. Kubzin, Vitaly A. Strusevich:
Two-machine flow shop no-wait scheduling with machine maintenance. 4OR 3(4): 303-313 (2005) - [j35]Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich:
Two-machine shop scheduling: Compromise between flexibility and makespan value. Eur. J. Oper. Res. 167(3): 796-809 (2005) - [j34]Vitaly A. Strusevich:
Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95. Oper. Res. Lett. 33(2): 217-219 (2005) - [j33]Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich:
Two-machine flow shop scheduling problems with no-wait jobs. Oper. Res. Lett. 33(3): 255-262 (2005) - [j32]Natalia V. Shakhlevich, Vitaly A. Strusevich:
Pre-Emptive Scheduling Problems with Controllable Processing Times. J. Sched. 8(3): 233-253 (2005) - 2004
- [j31]Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. Ann. Oper. Res. 129(1-4): 171-185 (2004) - [j30]Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich:
Batching decisions for assembly production systems. Eur. J. Oper. Res. 157(3): 620-642 (2004) - [j29]Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich:
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. J. Comb. Optim. 8(1): 13-28 (2004) - [r1]Valery S. Gordon, Jean-Marie Proth, Vitaly A. Strusevich:
Scheduling with Due Date Assignment. Handbook of Scheduling 2004 - 2003
- [j28]Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich:
Preface: International Symposium on Combinatorial Optimisation. Discret. Appl. Math. 133(1-3): 1-2 (2003) - [j27]Hans Kellerer, Vitaly A. Strusevich:
Scheduling problems for parallel dedicated machines under multiple resource constraints. Discret. Appl. Math. 133(1-3): 45-68 (2003) - [j26]Hans Kellerer, Vitaly A. Strusevich:
Scheduling parallel dedicated machines under a single non-shared resource. Eur. J. Oper. Res. 147(2): 345-364 (2003) - [j25]Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57(2): 217-234 (2003) - 2002
- [j24]Vitaly A. Strusevich, Inna G. Drobouchevitch, Natalia V. Shakhlevich:
Three-machine shop scheduling with partially ordered processing routes. J. Oper. Res. Soc. 53(5): 574-582 (2002) - 2001
- [j23]Inna G. Drobouchevitch, Vitaly A. Strusevich:
Two-stage open shop scheduling with a bottleneck machine. Eur. J. Oper. Res. 128(1): 159-174 (2001) - [j22]Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. INFORMS J. Comput. 13(2): 120-137 (2001) - [j21]Joachim Breit, Günter Schmidt, Vitaly A. Strusevich:
Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29(2): 65-77 (2001) - 2000
- [j20]Inna G. Drobouchevitch, Vitaly A. Strusevich:
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine. Eur. J. Oper. Res. 123(2): 229-240 (2000) - [j19]Vitaly A. Strusevich:
Group technology approach to the open shop scheduling problem with batch setup times. Oper. Res. Lett. 26(4): 181-192 (2000)
1990 – 1999
- 1999
- [j18]Inna G. Drobouchevitch, Vitaly A. Strusevich:
A heuristic algorithm for two-machine re-entrant shop scheduling. Ann. Oper. Res. 86: 417-439 (1999) - [j17]Inna G. Drobouchevitch, Vitaly A. Strusevich:
A polynomial algorithm for the three‐machineopen shop with a bottleneck machine. Ann. Oper. Res. 92: 185-210 (1999) - [j16]Valery S. Gordon, Vitaly A. Strusevich:
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Comput. Oper. Res. 26(2): 157-177 (1999) - [j15]Vitaly A. Strusevich:
A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times. Discret. Appl. Math. 93(2-3): 287-304 (1999) - [j14]Vitaly A. Strusevich, A. J. A. van de Waart, Rommert Dekker:
A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times. J. Heuristics 5(1): 5-28 (1999) - [j13]Djamal Rebaine, Vitaly A. Strusevich:
Two-machine open shop scheduling with special transportation times. J. Oper. Res. Soc. 50(7): 756-764 (1999) - 1998
- [j12]Vitaly A. Strusevich:
A greedy open shop heuristic with job priorities. Ann. Oper. Res. 83: 253-270 (1998) - [j11]Inna G. Drobouchevitch, Vitaly A. Strusevich:
Heuristics for short route job shop scheduling problems. Math. Methods Oper. Res. 48(3): 359-375 (1998) - [j10]Bo Chen, Chris N. Potts, Vitaly A. Strusevich:
Approximation algorithms for two-machine flow shop scheduling with batch setup times. Math. Program. 82: 255-271 (1998) - 1997
- [j9]Vitaly A. Strusevich:
Shop scheduling problems under precedence constraints. Ann. Oper. Res. 69: 351-377 (1997) - [j8]Jatinder N. D. Gupta, Vitaly A. Strusevich, Carin M. Zwaneveld:
Two-stage no-wait scheduling models with setup and removal times separated. Comput. Oper. Res. 24(11): 1025-1031 (1997) - [j7]Vitaly A. Strusevich, L. A. Hall:
An open shop scheduling problem with a non-bottleneck machine. Oper. Res. Lett. 21(1): 11-18 (1997) - 1996
- [j6]Bo Chen, Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich:
A New Heuristic for Three-Machine Flow Shop Scheduling. Oper. Res. 44(6): 891-898 (1996) - 1995
- [j5]Vitaly A. Strusevich:
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds. Discret. Appl. Math. 59(1): 75-86 (1995) - [j4]Chris N. Potts, S. V. Sevast'janov, Vitaly A. Strusevich, Luk N. Van Wassenhove, Carin M. Zwaneveld:
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation. Oper. Res. 43(2): 346-355 (1995) - 1994
- [j3]Vitaly A. Strusevich, Carin M. Zwaneveld:
On non-permutation solutions to some two machine flow shop scheduling problems. Math. Methods Oper. Res. 39(3): 305-319 (1994) - 1993
- [j2]Vitaly A. Strusevich:
Two machine open shop scheduling problem with setup, processing and removal times separated. Comput. Oper. Res. 20(6): 597-611 (1993) - [j1]Bo Chen, Vitaly A. Strusevich:
Approximation Algorithms for Three-Machine Open Shop Scheduling. INFORMS J. Comput. 5(3): 321-326 (1993)
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-07 21:21 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:
