default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Della Croce
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j81]Vincent T'kindt
, Federico Della Croce, Alessandro Agnetis:
Single machine adversarial bilevel scheduling problems. Eur. J. Oper. Res. 315(1): 63-72 (2024)- 2023
- [i10]Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia:
ITERATED INSIDE OUT: a new exact algorithm for the transportation problem. CoRR abs/2302.10826 (2023) - 2022
- [j80]Vincent T'kindt, Federico Della Croce, Mathieu Liedloff:
Moderate exponential-time algorithms for scheduling problems. 4OR 20(4): 533-566 (2022) - [j79]Federico Della Croce, Gabriele Dragotto, Rosario Scatamacchia:
On fairness and diversification in WTA and ATP tennis tournaments generation. Ann. Oper. Res. 316(2): 1107-1119 (2022) - [j78]Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia:
Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions. Comput. Ind. Eng. 168: 108139 (2022) - [j77]Federico Della Croce, Fabio Salassa, Vincent T'kindt:
Exact solution of the two-machine flow shop problem with three operations. Comput. Oper. Res. 138: 105595 (2022) - 2021
- [j76]Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce:
Merging combinatorial design and optimization: the Oberwolfach problem. Australas. J Comb. 79: 141-166 (2021) - [j75]Federico Della Croce, Vincent T'kindt, Olivier Ploton:
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms. Appl. Math. Comput. 397: 125888 (2021) - [j74]Jully Jeunet, Federico Della Croce, Fabio Salassa:
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs. Comput. Oper. Res. 127: 105151 (2021) - [j73]Lei Shang, Vincent T'kindt, Federico Della Croce:
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees. Comput. Oper. Res. 128: 105171 (2021) - [j72]Federico Della Croce, Andrea Grosso, Fabio Salassa:
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J. Heuristics 27(1-2): 159-173 (2021) - 2020
- [j71]Vincent T'kindt, Lei Shang, Federico Della Croce:
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. J. Comb. Optim. 39(3): 764-775 (2020) - [j70]Federico Della Croce, Rosario Scatamacchia:
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. Math. Program. 183(1): 249-281 (2020) - [j69]Federico Della Croce, Rosario Scatamacchia:
The Longest Processing Time rule for identical parallel machines revisited. J. Sched. 23(2): 163-176 (2020) - [i9]Federico Della Croce:
An enhanced pinwheel algorithm for the bamboo garden trimming problem. CoRR abs/2003.12460 (2020) - [i8]Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia:
An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem. CoRR abs/2005.06225 (2020)
2010 – 2019
- 2019
- [j68]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
New exact approaches and approximation results for the Penalized Knapsack Problem. Discret. Appl. Math. 253: 122-135 (2019) - [j67]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
On approximating the Incremental Knapsack Problem. Discret. Appl. Math. 264: 26-42 (2019) - [j66]Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt:
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem. J. Comb. Optim. 38(2): 608-617 (2019) - [j65]Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt:
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. J. Sched. 22(1): 59-68 (2019) - [c15]Federico Della Croce:
Improved Approximation Bounds Via Problem Independent Linear Programming Modeling. ICORES 2019: 5-6 - [c14]Federico Della Croce, Rosario Scatamacchia:
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints. IPCO 2019: 155-167 - 2018
- [j64]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms 52-53: 55-69 (2018) - [j63]Michele Garraffa, Lei Shang, Federico Della Croce, Vincent T'kindt:
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. Theor. Comput. Sci. 745: 133-149 (2018) - [i7]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the Incremental Knapsack Problem. CoRR abs/1801.04801 (2018) - [i6]Federico Della Croce, Rosario Scatamacchia:
Longest Processing Time rule for identical parallel machines revisited. CoRR abs/1801.05489 (2018) - [i5]Federico Della Croce, Rosario Scatamacchia:
A new exact approach for the Bilevel Knapsack with Interdiction Constraints. CoRR abs/1811.02822 (2018) - [i4]Federico Della Croce, Thierry Garaix, Andrea Grosso:
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. CoRR abs/1811.02882 (2018) - 2017
- [j62]Federico Della Croce, Michele Garraffa, Fabio Salassa, Claudio Borean, Giuseppe Di Bella, Ennio Grasso:
Heuristic approaches for a domestic energy management system. Comput. Ind. Eng. 109: 169-178 (2017) - [j61]Federico Della Croce, Fabio Salassa, Rosario Scatamacchia:
An exact approach for the 0-1 knapsack problem with setups. Comput. Oper. Res. 80: 61-67 (2017) - [j60]Federico Della Croce, Christos Koulamas, Vincent T'kindt:
A constraint generation approach for two-machine shop problems with jobs selection. Eur. J. Oper. Res. 259(3): 898-905 (2017) - [j59]Federico Della Croce, Fabio Salassa, Rosario Scatamacchia:
A new exact approach for the 0-1 Collapsing Knapsack Problem. Eur. J. Oper. Res. 260(1): 56-69 (2017) - [j58]Michele Garraffa, Federico Della Croce, Fabio Salassa:
An exact semidefinite programming approach for the max-mean dispersion problem. J. Comb. Optim. 34(1): 71-93 (2017) - [j57]Federico Della Croce, Christos Koulamas, Vincent T'kindt:
Minimizing the number of tardy jobs in two-machine settings with common due date. J. Comb. Optim. 34(1): 133-140 (2017) - [c13]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximation Results for the Incremental Knapsack Problem. IWOCA 2017: 75-87 - [c12]Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt:
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. IPEC 2017: 28:1-28:12 - [i3]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. CoRR abs/1702.04211 (2017) - [i2]Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt:
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths. CoRR abs/1707.02849 (2017) - [i1]Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe:
MILP and Max-Clique based heuristics for the Eternity II puzzle. CoRR abs/1709.00252 (2017) - 2016
- [j56]Federico Della Croce, Michele Garraffa, Fabio Salassa:
A hybrid three-phase approach for the Max-Mean Dispersion Problem. Comput. Oper. Res. 71: 16-22 (2016) - [j55]Federico Della Croce:
MP or not MP: that is the question. J. Sched. 19(1): 33-42 (2016) - 2015
- [j54]Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover problem. Discret. Appl. Math. 196: 62-71 (2015) - [j53]Jean-Charles Billaut, Federico Della Croce, Andrea Grosso:
A single machine scheduling problem with two-dimensional vector packing constraints. Eur. J. Oper. Res. 243(1): 75-81 (2015) - [j52]John J. Kanet, Federico Della Croce, Christos Koulamas, Vincent T'kindt:
Erratum - One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons. Oper. Res. 63(2): 351-352 (2015) - 2014
- [j51]Federico Della Croce, Andrea Grosso, Fabio Salassa:
A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213(1): 67-78 (2014) - [j50]Federico Della Croce, Fabio Salassa:
A variable neighborhood search based matheuristic for nurse rostering problems. Ann. Oper. Res. 218(1): 185-199 (2014) - [j49]Federico Della Croce, Michele Garraffa:
The Selective Fixing Algorithm for the closest string problem. Comput. Oper. Res. 41: 24-30 (2014) - [j48]Federico Della Croce, Fabio Salassa, Vincent T'kindt:
A hybrid heuristic approach for single machine scheduling with release times. Comput. Oper. Res. 45: 7-11 (2014) - [j47]Wim Vancroonenburg, Federico Della Croce, Dries R. Goossens, Frits C. R. Spieksma:
The Red-Blue transportation problem. Eur. J. Oper. Res. 237(3): 814-823 (2014) - [j46]Federico Della Croce, Vangelis Th. Paschos:
Efficient algorithms for the max k-vertex cover problem. J. Comb. Optim. 28(3): 674-691 (2014) - [j45]Nicolas Boria, Federico Della Croce:
Reoptimization in machine scheduling. Theor. Comput. Sci. 540: 13-26 (2014) - [c11]Federico Della Croce, Michele Garraffa, Fabio Salassa:
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem. ISCO 2014: 186-197 - [c10]Federico Della Croce, Christos Koulamas, Vincent T'kindt:
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection. ISCO 2014: 198-207 - 2013
- [j44]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. Discret. Appl. Math. 161(4-5): 558-572 (2013) - [c9]Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover Problem. WAOA 2013: 37-48 - 2012
- [j43]Federico Della Croce, Andrea Grosso:
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. Comput. Oper. Res. 39(1): 27-31 (2012) - [j42]Federico Della Croce, Fabio Salassa:
Improved LP-based algorithms for the closest string problem. Comput. Oper. Res. 39(3): 746-749 (2012) - [j41]Federico Della Croce, Thierry Garaix, Andrea Grosso:
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. Comput. Oper. Res. 39(6): 1213-1217 (2012) - [j40]Vincent T'kindt, Federico Della Croce:
A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment. Comput. Oper. Res. 39(12): 3244-3246 (2012) - [j39]Federico Della Croce, Christos Koulamas:
A note on minimizing the sum of quadratic completion times on two identical parallel machines. Inf. Process. Lett. 112(19): 738-742 (2012) - [j38]Federico Della Croce, Dominique Quadri:
Improving an exact approach for solving separable integer quadratic knapsack problems. J. Comb. Optim. 23(1): 21-28 (2012) - [j37]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Algorithms for dominating clique problems. Theor. Comput. Sci. 459: 77-88 (2012) - [c8]Federico Della Croce, Vangelis Th. Paschos:
Efficient Algorithms for the max k -vertex cover Problem. IFIP TCS 2012: 295-309 - 2011
- [j36]Federico Della Croce, E. Desmier, Thierry Garaix:
A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time". Comput. Ind. Eng. 60(1): 183-186 (2011) - [j35]Federico Della Croce, Andrea Grosso:
Computational experience with a core-based reduction procedure for the 2-knapsack problem. Comput. Oper. Res. 38(2): 514-516 (2011) - [j34]Ramesh Bollapragada, Federico Della Croce, Marco Ghirardi:
Discrete-time, economic lot scheduling problem on multiple, non-identical production lines. Eur. J. Oper. Res. 215(1): 89-96 (2011) - [c7]Federico Della Croce, Andrea Grosso, Fabio Salassa:
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. EvoCOP 2011: 38-47 - 2010
- [j33]Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo:
Approximating the metric 2-Peripatetic Salesman Problem. Algorithmic Oper. Res. 5(1): 13-20 (2010) - [j32]Federico Della Croce, Vincent T'kindt:
Improving the preemptive bound for the single machine dynamic maximum lateness problem. Oper. Res. Lett. 38(6): 589-591 (2010) - [j31]Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt:
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13(1): 39-47 (2010)
2000 – 2009
- 2009
- [j30]Federico Della Croce, Andrea Grosso, Marco Locatelli:
A heuristic approach for the max-min diversity problem based on max-clique. Comput. Oper. Res. 36(8): 2429-2433 (2009) - [j29]Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos:
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Discret. Appl. Math. 157(9): 1988-1992 (2009) - [j28]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. 17(3): 274-311 (2009) - [c6]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13 - 2008
- [j27]Federico Della Croce, Vangelis Th. Paschos:
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. Oper. Res. 8(3): 235-256 (2008) - [j26]Mohamed Ali Aloulou, Federico Della Croce:
Complexity of single machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett. 36(3): 338-342 (2008) - 2007
- [j25]Vincent T'kindt, Federico Della Croce, Jean-Louis Bouquard:
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. INFORMS J. Comput. 19(1): 64-72 (2007) - [j24]Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Improved worst-case complexity for the MIN 3-SET COVERING problem. Oper. Res. Lett. 35(2): 205-210 (2007) - [j23]Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos:
An exact algorithm for MAX-CUT in sparse graphs. Oper. Res. Lett. 35(3): 403-408 (2007) - 2006
- [j22]Federico Della Croce, Dario Oliveri:
Scheduling the Italian Football League: an ILP-based approach. Comput. Oper. Res. 33: 1963-1974 (2006) - [j21]Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos:
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. Electron. Notes Discret. Math. 27: 35-36 (2006) - [j20]Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli:
A "maximum node clustering" problem. J. Comb. Optim. 11(4): 373-385 (2006) - 2005
- [c5]Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) 2005: 202-211 - [c4]Federico Della Croce, Vangelis Th. Paschos:
Computing Optimal Solutions for the min 3-set covering Problem. ISAAC 2005: 685-692 - 2004
- [j19]F. Bellanti, Giuliana Carello, Federico Della Croce, Roberto Tadei:
A greedy-based neighborhood search approach to a nurse rostering problem. Eur. J. Oper. Res. 153(1): 28-40 (2004) - [j18]Federico Della Croce, Marco Ghirardi, Roberto Tadei:
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems. J. Heuristics 10(1): 89-104 (2004) - [j17]Andrea Grosso, Marco Locatelli, Federico Della Croce:
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. J. Heuristics 10(2): 135-152 (2004) - [j16]Luigi De Giovanni, Federico Della Croce, Roberto Tadei:
On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints. Networks 44(2): 73-83 (2004) - [j15]Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei:
Solving the Hub location problem in telecommunication network design: A local search approach. Networks 44(2): 94-105 (2004) - [j14]Andrea Grosso, Federico Della Croce, Roberto Tadei:
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32(1): 68-72 (2004) - [j13]Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos:
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. J. Sched. 7(1): 85-91 (2004) - [j12]Vincent T'kindt, Federico Della Croce, Carl Esswein:
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. J. Sched. 7(6): 429-440 (2004) - 2003
- [j11]Federico Della Croce, Vincent T'kindt:
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. Oper. Res. Lett. 31(2): 142-148 (2003) - 2002
- [j10]Roberto Tadei, Andrea Grosso, Federico Della Croce:
Finding the Pareto-optima for the total and maximum tardiness single machine problem. Discret. Appl. Math. 124(1-3): 117-126 (2002) - [j9]Federico Della Croce, Marco Ghirardi, Roberto Tadei:
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. Eur. J. Oper. Res. 139(2): 293-301 (2002) - [j8]Federico Della Croce, Vincent T'kindt:
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem. J. Oper. Res. Soc. 53(11): 1275-1280 (2002) - [j7]Roberto Tadei, Guido Perboli, Federico Della Croce:
A Heuristic Algorithm for the Auto-Carrier Transportation Problem. Transp. Sci. 36(1): 55-62 (2002) - 2000
- [j6]Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei:
Minimizing tardy jobs in a flowshop with common due date. Eur. J. Oper. Res. 120(2): 375-381 (2000)
1990 – 1999
- 1999
- [j5]Federico Della Croce, Roberto Tadei, P. S. Asioli:
Scheduling a round robin tennis tournamentunder courts and players availability constraints. Ann. Oper. Res. 92: 349-361 (1999) - [j4]Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs:
An improved general procedure for lexicographic bottleneck problems. Oper. Res. Lett. 24(4): 187-194 (1999) - 1998
- [j3]Roberto Tadei, Jatinder N. D. Gupta, Federico Della Croce, M. Cortesi:
Minimising makespan in the two-machine flow-shop with release times. J. Oper. Res. Soc. 49(1): 77-85 (1998) - [j2]Federico Della Croce, Roberto Tadei, Paolo Baracco, Andrea Grosso:
A new decomposition approach for the single machine total tardiness scheduling problem. J. Oper. Res. Soc. 49(10): 1101-1106 (1998) - 1995
- [j1]Federico Della Croce, Roberto Tadei, Giuseppe Volta:
A genetic algorithm for the job shop problem. Comput. Oper. Res. 22(1): 15-24 (1995) - 1994
- [c3]Giuseppe Menga, Roberto Tadei, M. Trubian, Giuseppe Volta, Federico Della Croce:
Production Scheduling for Perishable Goods: A Case Study. ICRA 1994: 507-512 - 1993
- [c2]Federico Della Croce, Roberto Tadei, Paolo Baracco, Raffaele Di Tullio:
On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine. ICRA (3) 1993: 816-820 - 1992
- [c1]Federico Della Croce, Giuseppe Menga, Roberto Tadei, M. Cavalotto, L. Petri:
Cellular control of flexible manufacturing systems. ICRA 1992: 937-948
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-05 21:11 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:
