default search action
Gilles Pesant
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
- [j49]Andrea Lodi
, Philippe Olivier, Gilles Pesant, Sriram Sankaranarayanan
Fairness over time in dynamic resource allocation with an application in healthcare. Math. Program. 203(1): 285-318 (2024) - [j48]Younes Aalian, Michel Gamache, Gilles Pesant:
Short-term underground mine planning with uncertain activity durations using constraint programming. J. Sched. 27(5): 423-439 (2024) - [c67]Hélène Verhaeghe
Learning Precedences for Scheduling Problems with Graph Neural Networks. CP 2024: 30:1-30:18 - [c66]Mathis Azéma, Guy Desaulniers, Jorge E. Mendoza, Gilles Pesant:
A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints. CPAIOR (1) 2024: 17-33 - [c65]Chao Yin, Quentin Cappart, Gilles Pesant:
An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems. CPAIOR (2) 2024: 279-288 - [c64]François Camelin, Samir Loudni, Gilles Pesant, Charlotte Truchet:
Échantillonnage d'ensemble de motifs diversifiés par compression locale. EGC 2024: 83-94 - 2023
- [c63]Younes Aalian, Gilles Pesant, Michel Gamache:
Optimization of Short-Term Underground Mine Planning Using Constraint Programming. CP 2023: 6:1-6:16 - [c62]Auguste Burlats, Gilles Pesant:
Exploiting Entropy in Constraint Programming. CPAIOR 2023: 320-335 - [c61]Gauthier Pezzoli, Gilles Pesant:
A Weighted Counting Algorithm for the Circuit Constraint. CPAIOR 2023: 370-377 - [c60]Miquel Bofill
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract). IJCAI 2023: 6851-6852 - 2022
- [j47]Philippe Olivier, Andrea Lodi
Measures of balance in combinatorial optimization. 4OR 20(3): 391-415 (2022) - [j46]Miquel Bofill
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. J. Artif. Intell. Res. 74: 263-301 (2022) - [c59]Daphné Lafleur, Sarath Chandar, Gilles Pesant:
Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints. CP 2022: 30:1-30:16 - [c58]Gilles Pesant, Claude-Guy Quimper, Hélène Verhaeghe
Practically Uniform Solution Sampling in Constraint Programming. CPAIOR 2022: 335-344 - [c57]Rémi Nahon
Improving tracking with a tracklet associator. CRV 2022: 175-182 - [i5]Rémi Nahon
Improving tracking with a tracklet associator. CoRR abs/2204.10677 (2022) - 2021
- [j45]Hossein Hashemi Doulabi
Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios. INFORMS J. Comput. 33(1): 143-162 (2021) - [j44]Philippe Olivier, Andrea Lodi
The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints. INFORMS J. Comput. 33(3): 949-962 (2021) - [c56]Gilles Pesant, Kuldeep S. Meel, Mahshid Mohammadalitajrishi:
On the Usefulness of Linear Modular Arithmetic in Constraint Programming. CPAIOR 2021: 248-265 - 2020
- [j43]Mohamed Hamza Ibrahim
Leveraging cluster backbones for improving MAP inference in statistical relational models. Ann. Math. Artif. Intell. 88(8): 907-949 (2020) - [j42]Hélène Verhaeghe
Learning optimal decision trees using constraint programming. Constraints An Int. J. 25(3-4): 226-250 (2020) - [j41]Seyed Hossein Hashemi Doulabi, Gilles Pesant, Louis-Martin Rousseau:
Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare. Transp. Sci. 54(4): 1053-1072 (2020) - [c55]Behrouz Babaki, Bilel Omrani, Gilles Pesant:
Combinatorial Search in CP-Based Iterated Belief Propagation. CP 2020: 21-36 - [c54]Mohammed Najib Haouas, Daniel Aloise
An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem. CPAIOR 2020: 256-272 - [c53]Behrouz Babaki, Gilles Pesant:
Parallel Planning using a Lazy Clause Generation Solver. ICTAI 2020: 272-276 - [c52]Hélène Verhaeghe
Learning Optimal Decision Trees using Constraint Programming (Extended Abstract). IJCAI 2020: 4765-4769 - [c51]Gilles Pesant:
From Support Propagation to Belief Propagation in Constraint Programming (Extended Abstract). IJCAI 2020: 5100-5104 - [c50]Behrouz Babaki, Gilles Pesant, Claude-Guy Quimper:
Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search. SOCS 2020: 2-10 - [i4]Alexandre Pineault, Guillaume-Alexandre Bilodeau, Gilles Pesant:
Tracking Road Users using Constraint Programming. CoRR abs/2003.04468 (2020)
2010 – 2019
- 2019
- [j40]Gilles Pesant:
From Support Propagation to Belief Propagation in Constraint Programming. J. Artif. Intell. Res. 66: 123-150 (2019) - [j39]Giovanni Lo Bianco
Revisiting Counting Solutions for the Global Cardinality Constraint. J. Artif. Intell. Res. 66: 411-441 (2019) - [c49]Hélène Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, Pierre Schaus:
Learning Optimal Decision Trees Using Constraint Programming. BNAIC/BENELEARN 2019 - [c48]Pierre Coste, Andrea Lodi, Gilles Pesant:
Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. CPAIOR 2019: 182-191 - [i3]Behrouz Babaki, Golnoosh Farnadi, Gilles Pesant:
Compiling Stochastic Constraint Programs to And-Or Decision Diagrams. CoRR abs/1909.10622 (2019) - 2018
- [c47]Samuel Gagnon, Gilles Pesant:
Accelerating Counting-Based Search. CPAIOR 2018: 245-253 - [c46]Philippe Olivier, Andrea Lodi, Gilles Pesant:
A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems. CPAIOR 2018: 462-476 - 2017
- [j38]Mohamed Hamza Ibrahim
Improving probabilistic inference in graphical models with determinism and cycles. Mach. Learn. 106(1): 1-54 (2017) - [c45]Gilles Pesant:
Getting More Out of the Exposed Structure in Constraint Programming Models of Combinatorial Problems. AAAI 2017: 4846-4851 - [c44]Antoine Delaite, Gilles Pesant:
Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems. CPAIOR 2017: 176-184 - [c43]Abdelilah Sakti, Gilles Pesant, Yann-Gaël Guéhéneuc:
JTeXpert at the SBST 2017 Tool Competition. SBST@ICSE 2017: 43-46 - 2016
- [j37]Seyed Hossein Hashemi Doulabi, Louis-Martin Rousseau, Gilles Pesant:
A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling. INFORMS J. Comput. 28(3): 432-448 (2016) - [c42]Gilles Pesant:
Counting-Based Search for Constraint Optimization Problems. AAAI 2016: 3441-3448 - [c41]Gilles Pesant:
Balancing Nursing Workload by Constraint Programming. CPAIOR 2016: 294-302 - [c40]Abdelilah Sakti, Gilles Pesant, Yann-Gaël Guéhéneuc:
JTExpert at the fourth unit testing tool competition. SBST@ICSE 2016: 37-40 - 2015
- [j36]David Meignan
Interactive planning system for forest road location. J. Heuristics 21(6): 789-817 (2015) - [j35]Gilles Pesant:
Achieving Domain Consistency and Counting Solutions for Dispersion Constraints. INFORMS J. Comput. 27(4): 690-703 (2015) - [j34]Gregory Rix, Louis-Martin Rousseau, Gilles Pesant:
A column generation algorithm for tactical timber transportation planning. J. Oper. Res. Soc. 66(2): 278-287 (2015) - [j33]David Meignan
A Review and Taxonomy of Interactive Optimization Methods in Operations Research. ACM Trans. Interact. Intell. Syst. 5(3): 17:1-17:43 (2015) - [j32]Abdelilah Sakti, Gilles Pesant, Yann-Gaël Guéhéneuc:
Instance Generator and Problem Representation to Improve Object Oriented Code Coverage. IEEE Trans. Software Eng. 41(3): 294-313 (2015) - [c39]Mohamed Hamza Ibrahim, Christopher J. Pal, Gilles Pesant:
Exploiting Determinism to Scale Relational Inference. AAAI 2015: 1756-1762 - [c38]Gilles Pesant, Gregory Rix, Louis-Martin Rousseau:
A Comparative Study of MIP and CP Formulations for the B2B Scheduling Optimization Problem. CPAIOR 2015: 306-321 - [c37]Abdelilah Sakti, Gilles Pesant, Yann-Gaël Guéhéneuc:
JTExpert at the Third Unit Testing Tool Competition. SBST@ICSE 2015: 52-55 - [e1]Gilles Pesant:
Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings. Lecture Notes in Computer Science 9255, Springer 2015, ISBN 978-3-319-23218-8 [contents] - 2014
- [j31]Gilles Pesant:
A constraint programming primer. EURO J. Comput. Optim. 2(3): 89-97 (2014) - [c36]Seyed Hossein Hashemi Doulabi, Louis-Martin Rousseau, Gilles Pesant:
A Constraint Programming-Based Column Generation Approach for Operating Room Planning and Scheduling. CPAIOR 2014: 455-463 - [i2]Gilles Pesant, Claude-Guy Quimper, Alessandro Zanarini:
Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. CoRR abs/1401.4601 (2014) - 2013
- [j30]Louis-Martin Rousseau, Michel Gendreau, Gilles Pesant:
The Synchronized Dynamic Vehicle Dispatching Problem. INFOR Inf. Syst. Oper. Res. 51(2): 76-83 (2013) - [c35]Simon Brockbank, Gilles Pesant, Louis-Martin Rousseau:
Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems. CP 2013: 175-183 - [c34]Abdelilah Sakti, Yann-Gaël Guéhéneuc, Gilles Pesant:
Constraint-Based Fitness Function for Search-Based Software Testing. CPAIOR 2013: 378-385 - [c33]Olfat El-Mahi, Gilles Pesant, Gabriela Nicolescu, Giovanni Beltrame:
Embedded system verification through constraint-based scheduling. RSP 2013: 73-79 - 2012
- [j29]Gilles Pesant, Claude-Guy Quimper
Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. J. Artif. Intell. Res. 43: 173-210 (2012) - [j28]Gerardo Berbeglia
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis. Transp. Sci. 46(3): 359-373 (2012) - [j27]Jonathan Gaudreault
Supply Chain Coordination Using an Adaptive Distributed Search Strategy. IEEE Trans. Syst. Man Cybern. Part C 42(6): 1424-1438 (2012) - [c32]Olfat El-Mahi, Gabriela Nicolescu, Gilles Pesant, Giovanni Beltrame:
Embedded system verification through constraint-based scheduling. HLDVT 2012: 92-95 - [c31]Abdelilah Sakti, Yann-Gaël Guéhéneuc, Gilles Pesant:
Boosting Search Based Testing by Using Constraint Based Testing. SSBSE 2012: 213-227 - 2011
- [j26]Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant:
Using local search to speed up filtering algorithms for some NP-hard constraints. Ann. Oper. Res. 184(1): 121-135 (2011) - [j25]Gerardo Berbeglia
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming. Transp. Sci. 45(3): 399-412 (2011) - [c30]Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau:
On Counting Lattice Points and Chvátal-Gomory Cutting Planes. CPAIOR 2011: 131-136 - [c29]Gilles Pesant, Alessandro Zanarini:
Recovering Indirect Solution Densities for Counting-Based Branching Heuristics. CPAIOR 2011: 170-175 - [c28]David Meignan
An interactive heuristic approach for the P-forest problem. SMC 2011: 1009-1013 - [c27]Neelesh Bhattacharya, Abdelilah Sakti, Giuliano Antoniol, Yann-Gaël Guéhéneuc, Gilles Pesant:
Divide-by-Zero Exception Raising via Branch Coverage. SSBSE 2011: 204-218 - 2010
- [j24]Gilles Pesant:
Editor's note. Constraints An Int. J. 15(3): 305-306 (2010) - [c26]Alessandro Zanarini, Gilles Pesant:
More Robust Counting-Based Search Heuristics with Alldifferent Constraints. CPAIOR 2010: 354-368
2000 – 2009
- 2009
- [j23]Jonathan Gaudreault
Distributed search for supply chain coordination. Comput. Ind. 60(6): 441-451 (2009) - [j22]Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal:
New filtering algorithms for combinations of among constraints. Constraints An Int. J. 14(2): 273-292 (2009) - [j21]Alessandro Zanarini, Gilles Pesant:
Solution counting algorithms for constraint-centered search heuristics. Constraints An Int. J. 14(3): 392-413 (2009) - [j20]Gilles Pesant, Meinolf Sellmann, Bernard Gendron:
Special issue on constraint programming. Comput. Oper. Res. 36(8): 2329 (2009) - [c25]Ronan LeBras, Alessandro Zanarini, Gilles Pesant:
Efficient Generic Search Heuristics within the EMBP Framework. CP 2009: 539-553 - [c24]Gilles Pesant, Claude-Guy Quimper
The Polytope of Context-Free Grammar Constraints. CPAIOR 2009: 223-232 - 2008
- [c23]Gilles Pesant, Claude-Guy Quimper
Counting Solutions of Knapsack Constraints. CPAIOR 2008: 203-217 - [c22]Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant:
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. CPAIOR 2008: 298-302 - 2007
- [c21]Alessandro Zanarini, Gilles Pesant:
Solution Counting Algorithms for Constraint-Centered Search Heuristics. CP 2007: 743-757 - [c20]Alessandro Zanarini, Gilles Pesant:
Generalizations of the Global Cardinality Constraint for Hierarchical Resources. CPAIOR 2007: 361-375 - [c19]Jonathan Gaudreault
Discrepancy-Based Method for Hierarchical Distributed Optimization. ICTAI (2) 2007: 75-81 - 2006
- [j19]Sophie Demassey
A Cost-Regular Based Hybrid Column Generation Approach. Constraints An Int. J. 11(4): 315-333 (2006) - [j18]Michel Gendreau, Gilles Pesant, Louis-Martin Rousseau:
Focused issue of C & OR on constraint programming. Comput. Oper. Res. 33(10): 2775-2776 (2006) - [j17]Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau:
On global warming: Flow-based soft global constraints. J. Heuristics 12(4-5): 347-373 (2006) - [j16]Yanick Pomerleau, Steven Chamberland, Gilles Pesant:
On solving the tree-topology design problem for wireless cellular networks. J. Commun. Networks 8(1): 85-92 (2006) - [c18]Claude-Guy Quimper, Alejandro López-Ortiz, Gilles Pesant:
A Quadratic Propagator for the Inter-Distance Constraint. AAAI 2006: 123-128 - [c17]Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal:
Revisiting the Sequence Constraint. CP 2006: 620-634 - [c16]Alessandro Zanarini, Michela Milano, Gilles Pesant:
Improved Algorithm for the Soft Global Cardinality Constraint. CPAIOR 2006: 288-299 - [c15]Michel Gendreau, Jacques A. Ferland, Bernard Gendron, Noureddine Hail, Brigitte Jaumard, Sophie D. Lapierre, Gilles Pesant, Patrick Soriano:
Physician Scheduling in Emergency Rooms. PATAT 2006: 53-66 - 2005
- [c14]Gilles Pesant, Jean-Charles Régin:
SPREAD: A Balancing Constraint Based on Statistics. CP 2005: 460-474 - [c13]Sophie Demassey
Constraint Programming Based Column Generation for Employee Timetabling. CPAIOR 2005: 140-154 - [c12]Bernard Gendron, Hocine Lebbah, Gilles Pesant:
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. CPAIOR 2005: 217-227 - [c11]Gilles Pesant:
Counting Solutions of CSPs: A Structural Approach. IJCAI 2005: 260-265 - 2004
- [j15]Laurent Méric, Gilles Pesant, Samuel Pierre:
Recherche locale à voisinage variable pour le routage optique dans des réseaux utilisant des routeurs latins. Ann. des Télécommunications 59(3-4): 261-286 (2004) - [j14]Louis-Martin Rousseau, Michel Gendreau, Gilles Pesant, Filippo Focacci:
Solving VRPTWs with Constraint Programming Based Column Generation. Ann. Oper. Res. 130(1-4): 199-216 (2004) - [j13]Gilbert Laporte, Gilles Pesant:
A general multi-shift scheduling system. J. Oper. Res. Soc. 55(11): 1208-1217 (2004) - [c10]Lars Hellsten, Gilles Pesant, Peter van Beek:
A Domain Consistency Algorithm for the Stretch Constraint. CP 2004: 290-304 - [c9]Gilles Pesant:
A Regular Language Membership Constraint for Finite Sequences of Variables. CP 2004: 482-495 - [i1]Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau:
On Global Warming (Softening Global Constraints). CoRR cs.AI/0408023 (2004) - 2003
- [j12]Grâce Amoussou, Matthieu André, Gilles Pesant, Samuel Pierre:
Une approche basée sur la programmation par contraintes pour affecter des cellules à des commutateurs dans les réseaux cellulaires pour mobiles. Ann. des Télécommunications 58(3-4): 584-604 (2003) - [c8]Stéphane Bourdais, Philippe Galinier, Gilles Pesant:
HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. CP 2003: 153-167 - 2002
- [j11]Gilles Pesant, Patrick Soriano:
An Optimal Strategy for the Constrained Cycle Cover Problem. Ann. Math. Artif. Intell. 34(4): 313-325 (2002) - [j10]Louis-Martin Rousseau, Gilles Pesant, Michel Gendreau:
A General Approach to the Physician Rostering Problem. Ann. Oper. Res. 115(1-4): 193-205 (2002) - [j9]Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant:
An exact algorithm for the maximum k-club problem in an undirected graph. Eur. J. Oper. Res. 138(1): 21-28 (2002) - [j8]Louis-Martin Rousseau, Michel Gendreau, Gilles Pesant:
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows. J. Heuristics 8(1): 43-58 (2002) - 2001
- [c7]Gilles Pesant:
A Filtering Algorithm for the Stretch Constraint. CP 2001: 183-195 - [c6]Louis-Martin Rousseau, Gilles Pesant, Michel Gendreau:
Building Negative Reduced Cost Paths Using Constraint Programming. CP 2001: 778 - 2000
- [j7]Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant:
Heuristics for finding k-clubs in an undirected graph. Comput. Oper. Res. 27(6): 559-569 (2000)
1990 – 1999
- 1999
- [j6]Gilles Pesant, Patrick Soriano:
An Optimal Strategy for the Constrained Cycle Cover Problem. Electron. Notes Discret. Math. 1: 48-60 (1999) - [j5]Mark Wallace
Preface: Volume 1. Electron. Notes Discret. Math. 1: 85-86 (1999) - [j4]Gilles Pesant, Michel Gendreau, Jean-Yves Potvin, Jean-Marc Rousseau:
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem. Eur. J. Oper. Res. 117(2): 253-263 (1999) - [j3]Gilles Pesant, Michel Gendreau:
A Constraint Programming Framework for Local Search Methods. J. Heuristics 5(3): 255-279 (1999) - [j2]Gilles Pesant, Michel Boyer:
Reasoning about Solids Using Constraint Logic Programming. J. Autom. Reason. 22(2): 241-262 (1999) - [c5]Louis-Martin Rousseau, Gilles Pesant:
Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules. JFPLC 1999: 145-160 - 1998
- [j1]Gilles Pesant, Michel Gendreau, Jean-Yves Potvin, Jean-Marc Rousseau:
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows. Transp. Sci. 32(1): 12-29 (1998) - 1997
- [c4]Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau:
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm. CP 1997: 420-434 - 1996
- [c3]Gilles Pesant, Michel Gendreau:
A View of Local Search in Constraint Programming. CP 1996: 353-366 - 1994
- [c2]Gilles Pesant, Michel Boyer:
QUAD-CLP(R): Adding the Power of Quadratic Constraints. PPCP 1994: 95-108 - 1993
- [c1]Gilles Pesant, Michel Boyer:
Handling Quadratic Constraints through Geometry. ILPS 1993: 659
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-08 20:32 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: