default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNysret Musliu
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j40]Arben Ahmeti
, Nysret Musliu:
Hybridizing constraint programming and meta-heuristics for multi-mode resource-constrained multiple projects scheduling Problem. J. Heuristics 31(1): 1-37 (2025)- 2024
- [j39]Thomas Eiter, Tobias Geibinger, Nelson Higuera Ruiz, Nysret Musliu, Johannes Oetsch, Dave Pfliegler, Daria Stepanova:
Adaptive large-neighbourhood search for optimisation in answer-set programming. Artif. Intell. 337: 104230 (2024) - [j38]Tobias Geibinger, Florian Mischek, Nysret Musliu:
Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling. J. Sched. 27(6): 607-622 (2024) - [j37]Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch, Peter Skocovský, Daria Stepanova:
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling - ADDENDUM. Theory Pract. Log. Program. 24(2): 421 (2024) - [c62]Ida Gjergji, Nysret Musliu:
Large Neighborhood Search for the Capacitated P-Median Problem. MIC (2) 2024: 158-173 - [c61]Francesca Da Ros, Luca Di Gaspero, Marie-Louise Lackner, Nysret Musliu, Felix Winter:
Local Search Algorithms for the Oven Scheduling Problem. GECCO Companion 2024: 191-194 - [c60]Francesca Da Ros, Luca Di Gaspero, Marie-Louise Lackner, Nysret Musliu:
Reducing Energy Consumption in Electronic Component Manufacturing through Large Neighborhood Search. GECCO Companion 2024: 1706-1714 - [c59]Tommaso Mannelli Mazzoli, Lucas Kletzander, Pascal Van Hentenryck, Nysret Musliu:
Investigating Large Neighbourhood Search for Bus Driver Scheduling. ICAPS 2024: 360-368 - [c58]Florian Mischek, Nysret Musliu:
Preference Explanation and Decision Support for Multi-Objective Real-World Test Laboratory Scheduling. ICAPS 2024: 378-386 - [i6]Francesca Da Ros, Marie-Louise Lackner, Nysret Musliu:
Theoretical Lower Bounds for the Oven Scheduling Problem. CoRR abs/2410.01368 (2024) - 2023
- [j36]Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter:
Exact methods for the Oven Scheduling Problem. Constraints An Int. J. 28(2): 320-361 (2023) - [j35]Florian Mischek, Nysret Musliu, Andrea Schaerf:
Local search approaches for the test laboratory scheduling problem with variable task grouping. J. Sched. 26(5): 457-477 (2023) - [j34]Philipp Danzinger, Tobias Geibinger, David Janneau, Florian Mischek, Nysret Musliu, Christian Poschalko:
A System for Automated Industrial Test Laboratory Scheduling. ACM Trans. Intell. Syst. Technol. 14(1): 3:1-3:27 (2023) - [j33]Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch, Peter Skocovský, Daria Stepanova:
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. Theory Pract. Log. Program. 23(6): 1281-1306 (2023) - [c57]Lucas Kletzander, Nysret Musliu:
Large-State Reinforcement Learning for Hyper-Heuristics. AAAI 2023: 12444-12452 - [c56]Lucas Kletzander, Nysret Musliu:
Dynamic Weight Setting for Personnel Scheduling with Many Objectives. ICAPS 2023: 509-517 - [c55]Florian Mischek, Nysret Musliu:
Leveraging problem-independent hyper-heuristics for real-world test laboratory scheduling. GECCO 2023: 321-329 - 2022
- [j32]Simon Strassl, Nysret Musliu:
Instance space analysis and algorithm selection for the job shop scheduling problem. Comput. Oper. Res. 141: 105661 (2022) - [j31]Arnaud De Coster, Nysret Musliu, Andrea Schaerf, Johannes Schoisswohl, Kate Smith-Miles:
Algorithm selection and instance space analysis for curriculum-based course timetabling. J. Sched. 25(1): 35-58 (2022) - [j30]Johannes Vass, Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Felix Winter:
Exact and meta-heuristic approaches for the production leveling problem. J. Sched. 25(3): 339-370 (2022) - [j29]Felix Winter, Nysret Musliu:
A large neighborhood search approach for the paint shop scheduling problem. J. Sched. 25(4): 453-475 (2022) - [j28]Maximilian Moser, Nysret Musliu, Andrea Schaerf, Felix Winter:
Exact and metaheuristic approaches for unrelated parallel machine scheduling. J. Sched. 25(5): 507-534 (2022) - [c54]Thomas Eiter, Tobias Geibinger, Nelson Higuera Ruiz, Nysret Musliu, Johannes Oetsch, Daria Stepanova:
Large-Neighbourhood Search for Optimisation in Answer-Set Solving. AAAI 2022: 5616-5625 - [c53]Roberto Maria Rosati, Lucas Kletzander, Christian Blum, Nysret Musliu, Andrea Schaerf:
Construct, Merge, Solve and Adapt Applied to a Bus Driver Scheduling Problem with Complex Break Constraints. AI*IA 2022: 254-267 - [c52]Lucas Kletzander, Nysret Musliu:
Hyper-Heuristics for Personnel Scheduling Domains. ICAPS 2022: 462-470 - [c51]Felix Winter, Nysret Musliu:
An Investigation of Hyper-Heuristic Approaches for Teeth Scheduling. MIC 2022: 274-289 - [c50]Jakob Preininger, Felix Winter, Nysret Musliu:
Modeling and Solving the K-Track Assignment Problem. MIC 2022: 406-420 - [c49]Tobias Geibinger, Lucas Kletzander, Nysret Musliu:
Instance Space Analysis for the Generalized Assignment Problem. MIC 2022: 421-435 - [c48]Felix Winter, Sebastian Meiswinkel, Nysret Musliu, Daniel Walkiewicz:
Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry. CP 2022: 41:1-41:18 - [c47]Lucas Kletzander, Tommaso Mannelli Mazzoli, Nysret Musliu:
Metaheuristic algorithms for the bus driver scheduling problem with complex break constraints. GECCO 2022: 232-240 - [c46]Felix Winter, Nysret Musliu:
A hyper-heuristic approach for artificial teeth scheduling. GECCO Companion 2022: 767-769 - [c45]Florian Mischek, Nysret Musliu:
Reinforcement Learning for Cross-Domain Hyper-Heuristics. IJCAI 2022: 4793-4799 - [c44]Thomas Eiter, Tobias Geibinger, Nelson Higuera Ruiz, Nysret Musliu, Johannes Oetsch, Daria Stepanova:
ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser. KR 2022 - [i5]Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter:
Exact methods and lower bounds for the Oven Scheduling Problem. CoRR abs/2203.12517 (2022) - [i4]Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch, Peter Skocovsky, Daria Stepanova:
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. CoRR abs/2212.09077 (2022) - 2021
- [j27]Lucas Kletzander, Nysret Musliu, Kate Smith-Miles:
Instance space analysis for a personnel scheduling problem. Ann. Math. Artif. Intell. 89(7): 617-637 (2021) - [j26]Ender Özcan, Edmund K. Burke, Luca Di Gaspero, Barry McCollum, Nysret Musliu:
Preface: The practice and theory of automated timetabling (2018). Ann. Oper. Res. 302(2): 339-340 (2021) - [j25]Florian Mischek, Nysret Musliu:
A local search framework for industrial test laboratory scheduling. Ann. Oper. Res. 302(2): 533-562 (2021) - [j24]Felix Winter, Nysret Musliu:
Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry. ACM Trans. Intell. Syst. Technol. 12(2): 17:1-17:25 (2021) - [c43]Tobias Geibinger, Florian Mischek, Nysret Musliu:
Constraint Logic Programming for Real-World Test Laboratory Scheduling. AAAI 2021: 6358-6366 - [c42]Lucas Kletzander, Nysret Musliu, Pascal Van Hentenryck:
Branch and Price for Bus Driver Scheduling with Complex Break Constraints. AAAI 2021: 11853-11861 - [c41]Felix Winter, Christoph Mrkvicka, Nysret Musliu, Jakob Preininger:
Automated Production Scheduling for Artificial Teeth Manufacturing. ICAPS 2021: 500-508 - [c40]Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter:
Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem. CP 2021: 37:1-37:18 - [c39]Tobias Geibinger, Lucas Kletzander, Matthias Krainz, Florian Mischek, Nysret Musliu, Felix Winter:
Physician Scheduling During a Pandemic. CPAIOR 2021: 456-465 - [c38]Georg Faustmann, Christoph Mrkvicka, Nysret Musliu, Felix Winter:
Automated configuration of parallel machine dispatching rules by machine learning. GECCO Companion 2021: 125-126 - [c37]Wolfgang Weintritt, Nysret Musliu, Felix Winter:
Solving the paintshop scheduling problem with memetic algorithms. GECCO 2021: 1070-1078 - [c36]Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch, Peter Skocovský, Daria Stepanova:
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. KR 2021: 280-290 - 2020
- [j23]Emmanuel Hebrard, Nysret Musliu:
Introduction to the CPAIOR 2020 fast track issue. Constraints An Int. J. 25(3-4): 298-299 (2020) - [j22]Lucas Kletzander, Nysret Musliu:
Solving the general employee scheduling problem. Comput. Oper. Res. 113 (2020) - [c35]Felix Winter, Nysret Musliu, Peter J. Stuckey:
Explaining Propagators for String Edit Distance Constraints. AAAI 2020: 1676-1683 - [c34]Philipp Danzinger, Tobias Geibinger, Florian Mischek, Nysret Musliu:
Solving the Test Laboratory Scheduling Problem with Variable Task Grouping. ICAPS 2020: 357-365 - [c33]Lucas Kletzander, Nysret Musliu:
Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints. ICAPS 2020: 421-430 - [e1]Emmanuel Hebrard, Nysret Musliu:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 17th International Conference, CPAIOR 2020, Vienna, Austria, September 21-24, 2020, Proceedings. Lecture Notes in Computer Science 12296, Springer 2020, ISBN 978-3-030-58941-7 [contents] - [i3]Johannes Vass, Marie-Louise Lackner, Nysret Musliu:
Exact and Metaheuristic Approaches for the Production Leveling Problem. CoRR abs/2006.08731 (2020)
2010 – 2019
- 2019
- [j21]Emir Demirovic, Nysret Musliu, Felix Winter:
Modeling and solving staff scheduling with partial weighted maxSAT. Ann. Oper. Res. 275(1): 79-99 (2019) - [j20]Florian Mischek, Nysret Musliu:
Integer programming model extensions for a multi-stage nurse rostering problem. Ann. Oper. Res. 275(1): 123-143 (2019) - [j19]Martin Josef Geiger, Lucas Kletzander, Nysret Musliu:
Solving the Torpedo Scheduling Problem. J. Artif. Intell. Res. 66: 1-32 (2019) - [c32]Lucas Kletzander, Nysret Musliu, Johannes Gärtner, Thomas Krennwallner, Werner Schafhauser:
Exact Methods for Extended Rotating Workforce Scheduling Problems. ICAPS 2019: 519-527 - [c31]Felix Winter, Nysret Musliu, Emir Demirovic, Christoph Mrkvicka:
Solution Approaches for an Automotive Paint Shop Scheduling Problem. ICAPS 2019: 573-581 - [c30]Tobias Geibinger, Florian Mischek, Nysret Musliu:
Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling. CPAIOR 2019: 304-319 - [c29]Lucas Kletzander, Nysret Musliu:
Modelling and Solving the Minimum Shift Design Problem. CPAIOR 2019: 391-408 - [c28]Jussi Rasku, Nysret Musliu, Tommi Kärkkäinen:
Feature and Algorithm Selection for Capacitated Vehicle Routing Problems. ESANN 2019 - [i2]Tobias Geibinger, Florian Mischek, Nysret Musliu:
Investigating Constraint Programming and Hybrid Methods for Real World Industrial Test Laboratory Scheduling. CoRR abs/1911.04766 (2019) - 2018
- [c27]Nysret Musliu, Andreas Schutt, Peter J. Stuckey:
Solver Independent Rotating Workforce Scheduling. CPAIOR 2018: 429-445 - [c26]Arben Ahmeti, Nysret Musliu:
Min-conflicts heuristic for multi-mode resource-constrained projects scheduling. GECCO 2018: 237-244 - 2017
- [j18]Emir Demirovic, Nysret Musliu:
Modeling high school timetabling with bitvectors. Ann. Oper. Res. 252(2): 215-238 (2017) - [j17]Alex Bonutti, Sara Ceschia, Fabio De Cesco, Nysret Musliu, Andrea Schaerf:
Modeling and solving a real-life multi-skill shift design problem. Ann. Oper. Res. 252(2): 365-382 (2017) - [j16]Emir Demirovic, Nysret Musliu:
MaxSAT-based large neighborhood search for high school timetabling. Comput. Oper. Res. 78: 172-180 (2017) - [j15]Nysret Musliu, Felix Winter:
A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search. IEEE Intell. Syst. 32(2): 52-62 (2017) - [j14]Michael Abseher, Nysret Musliu, Stefan Woltran:
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. J. Artif. Intell. Res. 58: 829-858 (2017) - [j13]Kadri Sylejmani, Jürgen Dorn, Nysret Musliu:
Planning the trip itinerary for tourist groups. J. Inf. Technol. Tour. 17(3): 275-314 (2017) - [c25]Lucas Kletzander, Nysret Musliu:
A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem. CPAIOR 2017: 344-358 - [c24]Michael Abseher, Nysret Musliu, Stefan Woltran:
htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. CPAIOR 2017: 376-386 - [c23]Gelareh Taghizadeh, Nysret Musliu:
A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search. EvoCOP 2017: 30-43 - [c22]Christoph Erkinger, Nysret Musliu:
Personnel Scheduling as Satisfiability Modulo Theories. IJCAI 2017: 614-621 - 2016
- [j12]Kathrin Conrad, Nysret Musliu, Reinhard Pichler, Hannes Werthner:
Universities and computer science in the European crisis of refugees. Commun. ACM 59(10): 31-33 (2016) - [j11]Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran:
Shift Design with Answer Set Programming. Fundam. Informaticae 147(1): 1-25 (2016) - [c21]Jussi Rasku, Tommi Kärkkäinen, Nysret Musliu:
Feature Extractors for Describing Vehicle Routing Problem Instances. SCOR 2016: 7:1-7:13 - 2015
- [c20]Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran:
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. IJCAI 2015: 275-282 - [c19]Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran:
Shift Design with Answer Set Programming. LPNMR 2015: 32-39 - [p4]Thomas Hammerl, Nysret Musliu, Werner Schafhauser:
Metaheuristic Algorithms and Tree Decomposition. Handbook of Computational Intelligence 2015: 1255-1270 - 2014
- [j10]Gerhard Post, Jeffrey H. Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngäs, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo G. Santos, Andrea Schaerf:
XHSTT: an XML archive for high school timetabling problems in different countries. Ann. Oper. Res. 218(1): 295-301 (2014) - [j9]Magdalena Widl, Nysret Musliu:
The break scheduling problem: complexity results and practical algorithms. Memetic Comput. 6(2): 97-112 (2014) - [c18]Josef Pihera, Nysret Musliu:
Application of Machine Learning to Algorithm Selection for TSP. ICTAI 2014: 47-54 - [p3]Jussi Rasku, Nysret Musliu, Tommi Kärkkäinen:
Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison. Modeling, Simulation and Optimization for Science and Technology 2014: 191-209 - 2013
- [c17]Nysret Musliu, Wolfgang Slany, Johannes Gärtner:
Automated Test Case Generation in End-User Programming. IS-EUD 2013: 272-277 - [c16]Nysret Musliu, Martin Schwengerer:
Algorithm Selection for the Graph Coloring Problem. LION 2013: 389-403 - [p2]Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany:
Automated Shift Design and Break Scheduling. Automated Scheduling and Planning 2013: 109-127 - 2012
- [j8]Markus Triska, Nysret Musliu:
An effective greedy heuristic for the Social Golfer Problem. Ann. Oper. Res. 194(1): 413-425 (2012) - [j7]Markus Triska, Nysret Musliu:
An improved SAT formulation for the social golfer problem. Ann. Oper. Res. 194(1): 427-438 (2012) - [c15]Kadri Sylejmani, Jürgen Dorn, Nysret Musliu:
A Tabu Search approach for Multi Constrained Team Orienteering Problem and its application in touristic trip planning. HIS 2012: 300-305 - [c14]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144 - [c13]Andreas Lehrbaum, Nysret Musliu:
A New Hyperheuristic Algorithm for Cross-Domain Search Problems. LION 2012: 437-442 - 2011
- [c12]Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany:
TEMPLE - A domain specific language for modeling and solving staff scheduling problems. CISched 2011: 58-64 - [c11]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918 - 2010
- [j6]Andreas Beer, Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany:
An AI-Based Break-Scheduling System for Supervisory Personnel. IEEE Intell. Syst. 25(2): 60-73 (2010) - [c10]Thomas Hammerl, Nysret Musliu:
Ant Colony Optimization for Tree Decompositions. EvoCOP 2010: 95-106 - [c9]Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany:
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem. Hybrid Metaheuristics 2010: 46-61 - [c8]Magdalena Widl, Nysret Musliu:
An Improved Memetic Algorithm for Break Scheduling. Hybrid Metaheuristics 2010: 133-147
2000 – 2009
- 2008
- [c7]Artan Dermaku, Tobias Ganzow, Georg Gottlob, Benjamin J. McMahan, Nysret Musliu, Marko Samer:
Heuristic Methods for Hypertree Decomposition. MICAI 2008: 1-11 - [p1]Nysret Musliu:
An Iterative Heuristic Algorithm for Tree Decomposition. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 133-150 - 2007
- [j5]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
The minimum shift design problem. Ann. Oper. Res. 155(1): 79-105 (2007) - [c6]Nysret Musliu:
Generation of Tree Decompositions by Iterated Local Search. EvoCOP 2007: 130-141 - 2006
- [c5]Nysret Musliu:
Local Search Algorithm for Unicost Set Covering Problem. IEA/AIE 2006: 302-311 - 2005
- [c4]Nysret Musliu:
Combination of Local Search Strategies for Rotating Workforce Scheduling Problem. IJCAI 2005: 1529-1530 - [c3]Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello:
Hypertree Decompositions: Structure, Algorithms, and Applications. WG 2005: 1-15 - 2004
- [j4]Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
Local search for shift design. Eur. J. Oper. Res. 153(1): 51-64 (2004) - [c2]Johannes Gärtner, Nysret Musliu, Wolfgang Slany:
A Heuristic Based System for Generation of Shifts with Breaks. SGAI Conf. (Applications) 2004: 95-106 - 2003
- [c1]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
The Minimum Shift Design Problem: Theory and Practice. ESA 2003: 593-604 - 2002
- [j3]Nysret Musliu, Johannes Gärtner, Wolfgang Slany:
Efficient generation of rotating workforce schedules. Discret. Appl. Math. 118(1-2): 85-98 (2002) - 2001
- [j2]Johannes Gärtner, Nysret Musliu, Wolfgang Slany:
Rota: a research project on algorithms for workforce scheduling and shift design optimization. AI Commun. 14(2): 83-92 (2001) - [j1]Ruth Fingerlos, Johannes Gärtner, Nysret Musliu, Wolfgang Slany:
Zyklische Schichtplanung. Künstliche Intell. 15(2): 31-34 (2001) - 2000
- [i1]Nysret Musliu, Johannes Gärtner, Wolfgang Slany:
Efficient generation of rotating workforce schedules. CoRR cs.OH/0002018 (2000)
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-23 19:31 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:
