default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick De Causmaecker
Person information
- affiliation: Catholic University of Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Lennart Van Hirtum
, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter, Heinrich Riebler, Michael Lass, Christian Plessl:
A Computation of the Ninth Dedekind Number Using FPGA Supercomputing. ACM Trans. Reconfigurable Technol. Syst. 17(3): 40:1-40:28 (2024)- [i14]Patrick De Causmaecker, Lennart Van Hirtum:
Solving systems of equations on antichains for the computation of the ninth Dedekind Number. CoRR abs/2405.20904 (2024) - 2023
- [j51]Ziyi Chen, Patrick De Causmaecker, Yajie Dou:
A combined mixed integer programming and deep neural network-assisted heuristics algorithm for the nurse rostering problem. Appl. Soft Comput. 136: 109919 (2023) - [j50]Thibault Lechien, Jorik Jooken, Patrick De Causmaecker:
Evolving test instances of the Hamiltonian completion problem. Comput. Oper. Res. 149: 106019 (2023) - [j49]Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker:
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems. Comput. Oper. Res. 150: 106070 (2023) - [j48]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. Eur. J. Oper. Res. 311(1): 36-55 (2023) - [j47]Tu-San Pham, Antoine Legrain, Patrick De Causmaecker, Louis-Martin Rousseau:
A Prediction-Based Approach for Online Dynamic Appointment Scheduling: A Case Study in Radiotherapy Treatment. INFORMS J. Comput. 35(4): 844-868 (2023) - [i13]Lennart Van Hirtum, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter, Heinrich Riebler, Michael Lass, Christian Plessl:
A computation of D(9) using FPGA Supercomputing. CoRR abs/2304.03039 (2023) - 2022
- [j46]Duy-Hoang Tran, Pieter Leyman, Patrick De Causmaecker:
Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem. Comput. Ind. Eng. 169: 108187 (2022) - [j45]Ziyi Chen, Yajie Dou, Patrick De Causmaecker:
Neural networked-assisted method for the nurse rostering problem. Comput. Ind. Eng. 171: 108430 (2022) - [j44]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A new class of hard problem instances for the 0-1 knapsack problem. Eur. J. Oper. Res. 301(3): 841-854 (2022) - [j43]Ender Özcan, Patrick De Causmaecker, Greet Vanden Berghe:
Advances in the practice and theory of automated timetabling. J. Sched. 25(3): 259 (2022) - [i12]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. CoRR abs/2211.09665 (2022) - 2021
- [j42]Yingqian Zhang, Michele Lombardi, Patrick De Causmaecker:
Preface. Ann. Math. Artif. Intell. 89(7): 615-616 (2021) - [j41]Duy-Hoang Tran, Behrouz Babaki, Dries Van Daele, Pieter Leyman, Patrick De Causmaecker:
Local search for constrained graph clustering in biological networks. Comput. Oper. Res. 132: 105299 (2021) - [i11]Tu-San Pham, Antoine Legrain, Patrick De Causmaecker, Louis-Martin Rousseau:
A prediction-based approach for online dynamic radiotherapy scheduling. CoRR abs/2112.08549 (2021) - 2020
- [j40]Morteza Davari, Mohammad Ranjbar, Patrick De Causmaecker, Roel Leus:
Minimizing makespan on a single machine with release dates and inventory constraints. Eur. J. Oper. Res. 286(1): 115-128 (2020) - [j39]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. J. Heuristics 26(5): 743-769 (2020) - [j38]Tu-San Pham, Pieter Leyman, Patrick De Causmaecker:
The intermittent travelling salesman problem. Int. Trans. Oper. Res. 27(1): 525-548 (2020) - [i10]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters:
Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem. CoRR abs/2010.11523 (2020) - [i9]Ziyi Chen, Patrick De Causmaecker, Yajie Dou:
Neural Networked Assisted Tree Search for the Personnel Rostering Problem. CoRR abs/2010.14252 (2020) - [i8]Thibault Lechien, Jorik Jooken, Patrick De Causmaecker:
Evolving test instances of the Hamiltonian completion problem. CoRR abs/2011.02291 (2020)
2010 – 2019
- 2019
- [j37]Sara Ceschia, Nguyen Dang, Patrick De Causmaecker, Stefaan Haspeslagh, Andrea Schaerf:
The Second International Nurse Rostering Competition. Ann. Oper. Res. 274(1-2): 171-186 (2019) - [j36]Pieter Leyman, Niels Van Driessche, Mario Vanhoucke, Patrick De Causmaecker:
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models. Comput. Oper. Res. 103: 184-197 (2019) - [j35]Jeroen Corstjens, Nguyen Dang, Benoît Depaire, An Caris, Patrick De Causmaecker:
A combined approach for analysing heuristic algorithms. J. Heuristics 25(4-5): 591-628 (2019) - [c35]Mohit Kumar, Stefano Teso, Patrick De Causmaecker, Luc De Raedt:
Automating Personnel Rostering by Learning Constraints Using Tensors. ICTAI 2019: 697-704 - [c34]Tu-San Pham, Jo Devriendt, Patrick De Causmaecker:
Declarative Local Search for Predicate Logic. LPNMR 2019: 340-346 - [i7]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. CoRR abs/1904.11337 (2019) - 2018
- [j34]Hans Degroote, José Luis González Velarde, Patrick De Causmaecker:
Applying Algorithm Selection - a Case Study for the Generalised Assignment Problem. Electron. Notes Discret. Math. 69: 205-212 (2018) - [c33]Chao Li, Yingwu Chen, Patrick De Causmaecker:
Data-driven Onboard Scheduling for an Autonomous Observation Satellite. IJCAI 2018: 5773-5774 - [c32]Aymeric Blot, Marie-Eléonore Kessaci, Laetitia Jourdan, Patrick De Causmaecker:
Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem. LION 2018: 241-256 - [c31]Nguyen Dang, Patrick De Causmaecker:
Analysis of Algorithm Components and Parameters: Some Case Studies. LION 2018: 288-303 - [c30]Hans Degroote, Patrick De Causmaecker, Bernd Bischl, Lars Kotthoff:
A Regression-Based Methodology for Online Algorithm Selection. SOCS 2018: 37-45 - [i6]Matthieu De Laere, San Tu Pham, Patrick De Causmaecker:
Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent. CoRR abs/1806.06685 (2018) - 2017
- [c29]Nguyen Dang, Leslie Pérez Cáceres, Patrick De Causmaecker, Thomas Stützle:
Configuring irace using surrogate configuration benchmarks. GECCO 2017: 243-250 - [i5]Pieter Leyman, San Tu Pham, Patrick De Causmaecker:
The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not? CoRR abs/1701.08517 (2017) - [i4]Pieter Leyman, Patrick De Causmaecker:
Optimization in large graphs: Toward a better future? CoRR abs/1705.08277 (2017) - 2016
- [j33]Wim Vancroonenburg, Patrick De Causmaecker, Greet Vanden Berghe:
A study of decision support models for online patient-to-room assignment planning. Ann. Oper. Res. 239(1): 253-271 (2016) - [j32]Pieter Smet, Peter Brucker, Patrick De Causmaecker, Greet Vanden Berghe:
Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249(1): 67-75 (2016) - [j31]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) - [c28]Hans Degroote, Bernd Bischl, Lars Kotthoff, Patrick De Causmaecker:
Reinforcement Learning for Automatic Online Algorithm Selection - an Empirical Study. ITAT 2016: 93-101 - [c27]Nguyen Dang Thi Thanh, Patrick De Causmaecker:
Characterization of Neighborhood Behaviours in a Multi-neighborhood Local Search Algorithm. LION 2016: 234-239 - [i3]Nguyen Dang Thi Thanh, Patrick De Causmaecker:
Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm. CoRR abs/1603.06459 (2016) - [i2]San Tu Pham, Jo Devriendt, Maurice Bruynooghe, Patrick De Causmaecker:
A MIP Backend for the IDP System. CoRR abs/1609.00759 (2016) - 2015
- [j30]Jannes Verstichel, Joris Kinable, Patrick De Causmaecker, Greet Vanden Berghe:
A Combinatorial Benders' decomposition for the lock scheduling problem. Comput. Oper. Res. 54: 117-128 (2015) - [j29]Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
A learning-based optimization approach to multi-project scheduling. J. Sched. 18(1): 61-74 (2015) - [c26]Hans Degroote, Patrick De Causmaecker:
Towards a Knowledge Base for Performance Data: A Formal Model for Performance Comparison. GECCO (Companion) 2015: 1189-1192 - [c25]Tom Decroos, Patrick De Causmaecker, Bart Demoen:
Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization. GECCO (Companion) 2015: 1379-1380 - [c24]Willem Van Onsem, Bart Demoen, Patrick De Causmaecker:
Learning a Hidden Markov Model-Based Hyper-heuristic. LION 2015: 74-88 - [i1]Sara Ceschia, Nguyen Dang Thi Thanh, Patrick De Causmaecker, Stefaan Haspeslagh, Andrea Schaerf:
Second International Nurse Rostering Competition (INRC-II) - Problem Description and Rules -. CoRR abs/1501.04177 (2015) - 2014
- [j28]Stefaan Haspeslagh, Patrick De Causmaecker, Andrea Schaerf, Martin Stølevik:
The first international nurse rostering competition 2010. Ann. Oper. Res. 218(1): 221-236 (2014) - [j27]Pieter Smet, Burak Bilgin, Patrick De Causmaecker, Greet Vanden Berghe:
Modelling and evaluation issues in nurse rostering. Ann. Oper. Res. 218(1): 303-326 (2014) - [j26]Tommy Messelis, Patrick De Causmaecker:
An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem. Eur. J. Oper. Res. 233(3): 511-528 (2014) - [j25]Jannes Verstichel, Patrick De Causmaecker, Frits C. R. Spieksma, Greet Vanden Berghe:
Exact and heuristic methods for placing ships in locks. Eur. J. Oper. Res. 235(2): 387-398 (2014) - [c23]Joris Maervoet, Patrick De Causmaecker, Greet Vanden Berghe:
Fast approximation of reach hierarchies in networks. SIGSPATIAL/GIS 2014: 441-444 - [c22]Nguyen Dang Thi Thanh, Patrick De Causmaecker:
Motivations for the Development of a Multi-objective Algorithm Configurator. ICORES 2014: 328-333 - 2013
- [j24]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
An investigation on the generality level of selection hyper-heuristics under different empirical conditions. Appl. Soft Comput. 13(7): 3335-3353 (2013) - [j23]Jannes Verstichel, Patrick De Causmaecker, Greet Vanden Berghe:
An improved best-fit heuristic for the orthogonal strip packing problem. Int. Trans. Oper. Res. 20(5): 711-730 (2013) - [j22]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
A new hyper-heuristic as a general problem solver: an implementation in HyFlex. J. Sched. 16(3): 291-311 (2013) - [c21]Patrick De Causmaecker, Stefan De Wannemacker:
Decomposition of Intervals in the Space of Anti-Monotonic Functions. CLA 2013: 57-67 - [c20]Stefaan Haspeslagh, Tommy Messelis, Greet Vanden Berghe, Patrick De Causmaecker:
An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems. ICAART (2) 2013: 303-310 - [c19]Joris Maervoet, Pascal Brackman, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Tour Suggestion for Outdoor Activities. W2GIS 2013: 54-63 - [p2]Pieter Smet, Patrick De Causmaecker, Burak Bilgin, Greet Vanden Berghe:
Nurse Rostering: A Complex Example of Personnel Scheduling with Perspectives. Automated Scheduling and Planning 2013: 129-153 - [p1]Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Boosting Metaheuristic Search Using Reinforcement Learning. Hybrid Metaheuristics 2013: 433-452 - 2012
- [j21]Burak Bilgin, Patrick De Causmaecker, Benoît Rossie, Greet Vanden Berghe:
Local search neighbourhoods for dealing with a novel nurse rostering model. Ann. Oper. Res. 194(1): 33-57 (2012) - [j20]Patrick De Causmaecker, Greet Vanden Berghe:
Towards a reference model for timetabling and rostering. Ann. Oper. Res. 194(1): 167-176 (2012) - [j19]Daniela Börnigen, Léon-Charles Tranchevent, Francisco Bonachela Capdevila, Koenraad Devriendt, Bart De Moor, Patrick De Causmaecker, Yves Moreau:
An unbiased evaluation of gene prioritization tools. Bioinform. 28(23): 3081-3088 (2012) - [j18]Tony Wauters, Katja Verbeeck, Paul Verstraete, Greet Vanden Berghe, Patrick De Causmaecker:
Real-world production scheduling for the food industry: An integrated approach. Eng. Appl. Artif. Intell. 25(2): 222-228 (2012) - [j17]Joris Maervoet, Celine Vens, Greet Vanden Berghe, Hendrik Blockeel, Patrick De Causmaecker:
Outlier detection in relational data: A case study in geographical information systems. Expert Syst. Appl. 39(5): 4718-4728 (2012) - [j16]Ahmet Soylu, Felix Mödritscher, Patrick De Causmaecker:
Ubiquitous web navigation through harvesting embedded semantic data: A mobile scenario. Integr. Comput. Aided Eng. 19(1): 93-109 (2012) - [j15]Ahmet Soylu, Felix Mödritscher, Fridolin Wild, Patrick De Causmaecker, Piet Desmet:
Mashups by orchestration and widget-based personal environments: Key challenges, solution strategies, and an application. Program 46(4): 383-428 (2012) - [j14]Peter Demeester, Burak Bilgin, Patrick De Causmaecker, Greet Vanden Berghe:
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice. J. Sched. 15(1): 83-103 (2012) - [c18]Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Fast Permutation Learning. LION 2012: 292-306 - [c17]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
An Intelligent Hyper-Heuristic Framework for CHeSC 2011. LION 2012: 461-466 - [c16]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
The Effect of the Set of Low-Level Heuristics on the Performance of Selection Hyper-heuristics. PPSN (2) 2012: 408-417 - 2011
- [j13]Léon-Charles Tranchevent, Francisco Bonachela Capdevila, Daniela Nitsch, Bart De Moor, Patrick De Causmaecker, Yves Moreau:
A guide to web tools to prioritize candidate genes. Briefings Bioinform. 12(1): 22-32 (2011) - [j12]Ahmet Soylu, Patrick De Causmaecker, Davy Preuveneers, Yolande Berbers, Piet Desmet:
Formal modelling, knowledge representation and reasoning for design and development of user-centric pervasive software: a meta-review. Int. J. Metadata Semant. Ontologies 6(2): 96-125 (2011) - [j11]Tony Wauters, Katja Verbeeck, Greet Vanden Berghe, Patrick De Causmaecker:
Learning agents for the multi-mode project scheduling problem. J. Oper. Res. Soc. 62(2): 281-290 (2011) - [j10]Patrick De Causmaecker, Greet Vanden Berghe:
A categorisation of nurse rostering problems. J. Sched. 14(1): 3-16 (2011) - [c15]Felix Mödritscher, Wolfgang Taferner, Ahmet Soylu, Patrick De Causmaecker:
Visualization of networked collaboration in digital ecosystems through two-mode network patterns. MEDES 2011: 158-162 - [c14]Ahmet Soylu, Fridolin Wild, Felix Mödritscher, Piet Desmet, Serge Verlinde, Patrick De Causmaecker:
Mashups and widget orchestration. MEDES 2011: 226-234 - 2010
- [j9]Peter Demeester, Wouter Souffriau, Patrick De Causmaecker, Greet Vanden Berghe:
A hybrid tabu search algorithm for automatically assigning patients to beds. Artif. Intell. Medicine 48(1): 61-70 (2010) - [j8]Edmund K. Burke, Patrick De Causmaecker, Geert De Maere, Jeroen Mulder, Marc Paelinck, Greet Vanden Berghe:
A multi-objective approach for robust airline scheduling. Comput. Oper. Res. 37(5): 822-832 (2010) - [j7]Ahmet Soylu, Patrick De Causmaecker, Fridolin Wild:
Ubiquitous Web for Ubiquitous Environments: The Role of Embedded Semantics. J. Mobile Multimedia 6(1): 26-48 (2010) - [c13]Tony Wauters, Katja Verbeeck, Greet Vanden Berghe, Patrick De Causmaecker:
A game theoretic approach to decentralized multi-project scheduling. AAMAS 2010: 1415-1416 - [c12]Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c11]Ahmet Soylu, Felix Mödritscher, Patrick De Causmaecker:
Multi-facade and Ubiquitous Web Navigation and Access through Embedded Semantics. FGIT 2010: 272-289 - [c10]Ahmet Soylu, Felix Mödritscher, Patrick De Causmaecker:
Utilizing Embedded Semantics for User-Driven Design of Pervasive Environments. MTSR 2010: 63-77 - [c9]Ahmet Soylu, Fridolin Wild, Felix Mödritscher, Patrick De Causmaecker:
Semantic Mash-Up Personal and Pervasive Learning Environments (SMupple). USAB 2010: 501-504
2000 – 2009
- 2009
- [j6]Patrick De Causmaecker, Peter Demeester, Greet Vanden Berghe:
A decomposed metaheuristic approach for a real-world university timetabling problem. Eur. J. Oper. Res. 195(1): 307-318 (2009) - [j5]Ahmet Soylu, Patrick De Causmaecker, Piet Desmet:
Context and Adaptivity in Pervasive Computing Environments: Links with Software Engineering and Ontological Engineering. J. Softw. 4(9): 992-1013 (2009) - [c8]Ahmet Soylu, Patrick De Causmaecker:
Merging model driven and ontology driven system development approaches pervasive computing perspective. ISCIS 2009: 730-735 - 2008
- [c7]Koen Vangheluwe, Wouter Souffriau, Katja Verbeeck, Patrick De Causmaecker:
Dynamic scheduling of multi-media streams in home automation systems. AAMAS (Demos) 2008: 1683-1684 - 2006
- [j4]Edmund K. Burke, Patrick De Causmaecker, Sanja Petrovic, Greet Vanden Berghe:
Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling. Appl. Artif. Intell. 20(9): 743-766 (2006) - [j3]Stijn Bernaer, Martin Meganck, Greet Vanden Berghe, Patrick De Causmaecker:
Designing trust with software agents: A case study. J. Inf. Commun. Ethics Soc. 4(1): 37-48 (2006) - 2004
- [j2]Edmund K. Burke, Patrick De Causmaecker, Greet Vanden Berghe, Hendrik Van Landeghem:
The State of the Art of Nurse Rostering. J. Sched. 7(6): 441-499 (2004) - [c6]Nele Custers, Patrick De Causmaecker, Peter Demeester, Greet Vanden Berghe:
Semantic Components for Timetabling. PATAT 2004: 17-33 - [r1]Edmund Kieran Burke, Patrick De Causmaecker, Greet Vanden Berghe:
Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals. Handbook of Scheduling 2004 - 2003
- [e1]Edmund K. Burke, Patrick De Causmaecker:
Practice and Theory of Automated Timetabling IV, 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002, Selected Revised Papers. Lecture Notes in Computer Science 2740, Springer 2003, ISBN 3-540-40699-9 [contents] - 2002
- [c5]Edmund K. Burke, Patrick De Causmaecker, Sanja Petrovic, Greet Vanden Berghe:
A multi criteria meta-heuristic approach to nurse rostering. IEEE Congress on Evolutionary Computation 2002: 1197-1202 - [c4]Patrick De Causmaecker, Greet Vanden Berghe:
Relaxation of Coverage Constraints in Hospital Personnel Rostering. PATAT 2002: 129-147 - 2001
- [j1]Edmund K. Burke, Peter I. Cowling, Patrick De Causmaecker, Greet Vanden Berghe:
A Memetic Approach to the Nurse Rostering Problem. Appl. Intell. 15(3): 199-214 (2001) - [c3]Patrick De Causmaecker, Peter Demeester, Ph. De Pauw-Waterschoot, Greet Vanden Berghe:
Sympathetic agents assist route in route planning. Agents 2001: 190-191 - [c2]Edmund K. Burke, Patrick De Causmaecker, Sanja Petrovic, Greet Vanden Berghe:
Fitness evaluation for nurse scheduling problems. CEC 2001: 1139-1146
1990 – 1999
- 1998
- [c1]Edmund K. Burke, Patrick De Causmaecker, Greet Vanden Berghe:
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. SEAL 1998: 187-194
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-11-07 20:29 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:
