default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Schaus
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
[j14]John O. R. Aoga
, Juhee Bae, Stefanija Veljanoska, Siegfried Nijssen, Pierre Schaus:
Impact of Weather Factors on Migration Intention Using Machine Learning Algorithms. Oper. Res. Forum 5(1): 8 (2024)- [c82]Alexandre Dubray, Pierre Schaus, Siegfried Nijssen:
Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference. CP 2024: 10:1-10:16 - [c81]Augustin Delecluse, Pierre Schaus:
Black-Box Value Heuristics for Solving Optimization Problems with Constraint Programming (Short Paper). CP 2024: 36:1-36:12 - [c80]Auguste Burlats, Pierre Schaus, Cristel Pelsser:
An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis. CPAIOR (1) 2024: 153-169 - [c79]Charles Thomas, Pierre Schaus:
A Constraint Programming Approach for Aircraft Disassembly Scheduling. CPAIOR (2) 2024: 211-220 - [c78]Vianney Coppé, Xavier Gillard, Pierre Schaus:
Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams. CPAIOR (1) 2024: 226-242 - [c77]Bastián Véjar, Gaël Aglin, Ali Irfan Mahmutogullari, Siegfried Nijssen, Pierre Schaus, Tias Guns:
An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems. CPAIOR (2) 2024: 253-262 - [c76]Harold Silvère Kiossou, Pierre Schaus, Siegfried Nijssen, Gaël Aglin:
Efficient Lookahead Decision Trees. IDA (2) 2024: 133-144 - 2023
- [c75]Vianney Coppé, Xavier Gillard, Pierre Schaus:
Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming. CP 2023: 13:1-13:17 - [c74]Alexandre Dubray, Pierre Schaus, Siegfried Nijssen:
Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses. CP 2023: 15:1-15:17 - [c73]Nicolas Golenvaux, Xavier Gillard, Siegfried Nijssen, Pierre Schaus:
Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams (Short Paper). CP 2023: 45:1-45:10 - 2022
- [j13]Guillaume Derval, Pierre Schaus:
Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach. Eur. J. Oper. Res. 297(3): 853-865 (2022) - [c72]Vianney Coppé, Xavier Gillard, Pierre Schaus:
Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams. CP 2022: 14:1-14:18 - [c71]Augustin Delecluse, Pierre Schaus, Pascal Van Hentenryck:
Sequence Variables for Routing Problems. CP 2022: 19:1-19:17 - [c70]Alexandre Dubray, Guillaume Derval, Siegfried Nijssen, Pierre Schaus:
Optimal Decoding of Hidden Markov Models with Consistency Constraints. DS 2022: 407-417 - [c69]Xavier Gillard, Pierre Schaus:
Large Neighborhood Search with Decision Diagrams. IJCAI 2022: 4754-4760 - [c68]Siegfried Nijssen, Pierre Schaus:
From Inductive Databases to DL8.5 (short paper). KDID 2022: 23-30 - [c67]Gaël Aglin, Siegfried Nijssen, Pierre Schaus:
Learning Optimal Decision Trees Under Memory Constraints. ECML/PKDD (5) 2022: 393-409 - [c66]Harold Silvère Kiossou, Pierre Schaus, Siegfried Nijssen, Vinasétan Ratheil Houndji:
Time Constrained DL8.5 Using Limited Discrepancy Search. ECML/PKDD (5) 2022: 443-459 - [c65]Vianney Coppé, Pierre Schaus:
A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract). SOCS 2022: 264-266 - [e1]Pierre Schaus:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings. Lecture Notes in Computer Science 13292, Springer 2022, ISBN 978-3-031-08010-4 [contents] - [i14]Vianney Coppé, Xavier Gillard, Pierre Schaus:
Branch-and-Bound with Barrier: Dominance and Suboptimality Detection for DD-Based Branch-and-Bound. CoRR abs/2211.13118 (2022) - 2021
- [j12]Alex Mattenet, Ian Davidson, Siegfried Nijssen, Pierre Schaus:
Generic Constraint-based Block Modeling using Constraint Programming. J. Artif. Intell. Res. 70: 597-630 (2021) - [j11]Laurent D. Michel, Pierre Schaus, Pascal Van Hentenryck:
MiniCP: a lightweight solver for constraint programming. Math. Program. Comput. 13(1): 133-184 (2021) - [c64]Xavier Gillard, Vianney Coppé, Pierre Schaus, André Augusto Ciré:
Improving the Filtering of Branch-and-Bound MDD Solver. CPAIOR 2021: 231-247 - [c63]Gaël Aglin, Siegfried Nijssen, Pierre Schaus:
Assessing Optimal Forests of Decision Trees. ICTAI 2021: 32-39 - [c62]Alexandre Dubray, Siegfried Nijssen, Isabelle Thomas, Pierre Schaus:
A Seriation Based Framework to Visualize Multiple Aspects of Road Transport from GPS Trajectories. ITSC 2021: 1379-1384 - [i13]Xavier Gillard, Vianney Coppé, Pierre Schaus, André Augusto Ciré:
Improving the filtering of Branch-And-Bound MDD solver (extended). CoRR abs/2104.11951 (2021) - 2020
- [j10]Hélène Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, Pierre Schaus:
Learning optimal decision trees using constraint programming. Constraints An Int. J. 25(3-4): 226-250 (2020) - [j9]Sascha Van Cauwelaert, Cyrille Dejemeppe, Pierre Schaus:
An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities. J. Sched. 23(4): 431-449 (2020) - [c61]Gaël Aglin, Siegfried Nijssen, Pierre Schaus:
Learning Optimal Decision Trees Using Caching Branch-and-Bound Search. AAAI 2020: 3146-3153 - [c60]Alex Lucía Mattenet, Ian Davidson, Siegfried Nijssen, Pierre Schaus:
Constraint Programming for an Efficient and Flexible Block Modeling Solver. AAAI 2020: 13685-13688 - [c59]Charles Thomas, Roger Kameugne, Pierre Schaus:
Insertion Sequence Variables for Hybrid Routing and Scheduling Problems. CPAIOR 2020: 457-474 - [c58]Alexandre Dubray, Guillaume Derval, Siegfried Nijssen, Pierre Schaus:
Mining Constrained Regions of Interest: An Optimization Approach. DS 2020: 630-644 - [c57]Hélène Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, Pierre Schaus:
Learning Optimal Decision Trees using Constraint Programming (Extended Abstract). IJCAI 2020: 4765-4769 - [c56]Gaël Aglin, Siegfried Nijssen, Pierre Schaus:
PyDL8.5: a Library for Learning Optimal Decision Trees. IJCAI 2020: 5222-5224 - [c55]Xavier Gillard, Pierre Schaus, Vianney Coppé:
Ddo, a Generic and Efficient Framework for MDD-Based Optimization. IJCAI 2020: 5243-5245 - [i12]Nicolas Golenvaux, Pablo Gonzalez Alvarez, Harold Silvère Kiossou, Pierre Schaus:
An LSTM approach to Predict Migration based on Google Trends. CoRR abs/2005.09902 (2020) - [i11]Harold Silvère Kiossou, Yannik Schenk, Frédéric Docquier, Vinasétan Ratheil Houndji, Siegfried Nijssen, Pierre Schaus:
Using an interpretable Machine Learning approach to study the drivers of International Migration. CoRR abs/2006.03560 (2020) - [i10]John O. R. Aoga, Juhee Bae, Stefanija Veljanoska, Siegfried Nijssen, Pierre Schaus:
Impact of weather factors on migration intention using machine learning algorithms. CoRR abs/2012.02794 (2020)
2010 – 2019
- 2019
- [j8]Vincent Branders, Pierre Schaus, Pierre Dupont:
Identifying gene-specific subgroups: an alternative to biclustering. BMC Bioinform. 20(1): 625 (2019) - [j7]Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey:
The item dependent stockingcost constraint. Constraints An Int. J. 24(2): 183-209 (2019) - [c54]Guillaume Derval, Frédéric Docquier, Pierre Schaus:
An Aggregate Learning Approach for Interpretable Semi-Supervised Population Prediction and Disaggregation Using Ancillary Data. BNAIC/BENELEARN 2019 - [c53]Alex Mattenet, Ian Davidson, Siegfried Nijssen, Pierre Schaus:
Generic Constraint-Based Block Modeling Using Constraint Programming. BNAIC/BENELEARN 2019 - [c52]Hélène Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, Pierre Schaus:
Learning Optimal Decision Trees Using Constraint Programming. BNAIC/BENELEARN 2019 - [c51]Xavier Gillard, Pierre Schaus, Yves Deville:
SolverCheck: Declarative Testing of Constraints. CP 2019: 565-582 - [c50]John O. R. Aoga, Siegfried Nijssen, Pierre Schaus:
Modeling Pattern Set Mining Using Boolean Circuits. CP 2019: 621-638 - [c49]Alex Mattenet, Ian Davidson, Siegfried Nijssen, Pierre Schaus:
Generic Constraint-Based Block Modeling Using Constraint Programming. CP 2019: 656-673 - [c48]Guillaume Derval, Vincent Branders, Pierre Dupont, Pierre Schaus:
The Maximum Weighted Submatrix Coverage Problem: A CP Approach. CPAIOR 2019: 258-274 - [c47]Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus:
Extending Compact-Diagram to Basic Smart Multi-Valued Variable Diagrams. CPAIOR 2019: 581-598 - [c46]Vincent Branders, Guillaume Derval, Pierre Schaus, Pierre Dupont:
Mining a Maximum Weighted Set of Disjoint Submatrices. DS 2019: 18-28 - [c45]Mathieu Jadin, Francois Aubry, Pierre Schaus, Olivier Bonaventure:
CG4SR: Near Optimal Traffic Engineering for Segment Routing with Column Generation. INFOCOM 2019: 1333-1341 - [c44]Guillaume Derval, Frédéric Docquier, Pierre Schaus:
An Aggregate Learning Approach for Interpretable Semi-supervised Population Prediction and Disaggregation Using Ancillary Data. ECML/PKDD (3) 2019: 672-687 - [i9]Guillaume Derval, Frédéric Docquier, Pierre Schaus:
An aggregate learning approach for interpretable semi-supervised population prediction and disaggregation using ancillary data. CoRR abs/1907.00270 (2019) - 2018
- [j6]Sascha Van Cauwelaert, Michele Lombardi, Pierre Schaus:
How efficient is a global constraint in practice? - A fair experimental framework. Constraints An Int. J. 23(1): 87-122 (2018) - [j5]Guillaume Derval, Jean-Charles Régin, Pierre Schaus:
Improved filtering for the bin-packing with cardinality constraint. Constraints An Int. J. 23(3): 251-271 (2018) - [c43]Quentin Cappart, Charles Thomas, Pierre Schaus, Louis-Martin Rousseau:
A Constraint Programming Approach for Solving Patient Transportation Problems. CP 2018: 490-506 - [c42]Quentin Cappart, John O. R. Aoga, Pierre Schaus:
EpisodeSupport: A Global Constraint for Mining Frequent Patterns in a Long Sequence of Events. CPAIOR 2018: 82-99 - [c41]Minh Thanh Khong, Christophe Lecoutre, Pierre Schaus, Yves Deville:
Soft-Regular with a Prefix-Size Violation Measure. CPAIOR 2018: 333-343 - [c40]Charles Thomas, Pierre Schaus:
Revisiting the Self-adaptive Large Neighborhood Search. CPAIOR 2018: 557-566 - [c39]John O. R. Aoga, Tias Guns, Siegfried Nijssen, Pierre Schaus:
Finding Probabilistic Rule Lists using the Minimum Description Length Principle. DS 2018: 66-82 - [c38]Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus:
Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets. IJCAI 2018: 1383-1389 - [i8]Aurélie Massart, Valentin Rombouts, Pierre Schaus:
Testing Global Constraints. CoRR abs/1807.03975 (2018) - 2017
- [j4]Sascha Van Cauwelaert, Pierre Schaus:
Efficient filtering for the Resource-Cost AllDifferent constraint. Constraints An Int. J. 22(4): 493-511 (2017) - [j3]John O. R. Aoga, Tias Guns, Pierre Schaus:
Mining Time-constrained Sequential Patterns with Constraint Programming. Constraints An Int. J. 22(4): 548-570 (2017) - [c37]Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus:
Extending Compact-Table to Negative and Short Tables. AAAI 2017: 3951-3957 - [c36]Hélène Verhaeghe, Christophe Lecoutre, Yves Deville, Pierre Schaus:
Extending Compact-Table to Basic Smart Tables. CP 2017: 297-307 - [c35]Pierre Schaus, John O. R. Aoga, Tias Guns:
CoverSize: A Global Constraint for Frequency-Based Itemset Mining. CP 2017: 529-546 - [c34]Vinasétan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence A. Wolsey:
The Weighted Arborescence Constraint. CPAIOR 2017: 185-201 - [c33]Quentin Cappart, Pierre Schaus:
Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables. CPAIOR 2017: 312-327 - [c32]Quentin Cappart, Christophe Limbrée, Pierre Schaus, Jean Quilbeuf, Louis-Marie Traonouez, Axel Legay:
Verification of Interlocking Systems Using Statistical Model Checking. HASE 2017: 61-68 - [c31]Minh Thanh Khong, Yves Deville, Pierre Schaus, Christophe Lecoutre:
Efficient Reification of Table Constraints. ICTAI 2017: 118-122 - [c30]Vincent Branders, Pierre Schaus, Pierre Dupont:
Combinatorial Optimization Algorithms to Mine a Sub-Matrix of Maximal Sum. NFMCP@PKDD/ECML 2017: 65-79 - [i7]Sascha Van Cauwelaert, Michele Lombardi, Pierre Schaus:
A Visual Web Tool to Perform What-If Analysis of Optimization Approaches. CoRR abs/1703.06042 (2017) - [i6]Vincent Branders, Pierre Schaus, Pierre Dupont:
Mining a Sub-Matrix of Maximal Sum. CoRR abs/1709.08461 (2017) - [i5]Steven Gay, Pierre Schaus, Stefano Vissicchio:
REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms. CoRR abs/1710.08665 (2017) - 2016
- [c29]Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus:
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets. CP 2016: 207-223 - [c28]Anthony Palmieri, Jean-Charles Régin, Pierre Schaus:
Parallel Strategies Selection. CP 2016: 388-404 - [c27]Sascha Van Cauwelaert, Cyrille Dejemeppe, Jean-Noël Monette, Pierre Schaus:
Efficient Filtering for the Unary Resource with Family-Based Transition Times. CP 2016: 520-535 - [c26]Cyrille Dejemeppe, Olivier Devolder, Victor Lecomte, Pierre Schaus:
Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware Production Planning Problem for Tissue Manufacturing. CPAIOR 2016: 108-124 - [c25]John O. R. Aoga, Tias Guns, Pierre Schaus:
An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming. ECML/PKDD (2) 2016: 315-330 - [c24]Quentin Cappart, Pierre Schaus:
A Dedicated Algorithm for Verification of Interlocking Systems. SAFECOMP 2016: 76-87 - [i4]John O. R. Aoga, Tias Guns, Pierre Schaus:
An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming. CoRR abs/1604.01166 (2016) - [i3]Anthony Palmieri, Jean-Charles Régin, Pierre Schaus:
Parallel Strategies Selection. CoRR abs/1604.06484 (2016) - [i2]Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus:
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets. CoRR abs/1604.06641 (2016) - [i1]Quentin Cappart, Christophe Limbrée, Pierre Schaus, Jean Quilbeuf, Louis-Marie Traonouez, Axel Legay:
Verification of interlocking systems using statistical model checking. CoRR abs/1605.02529 (2016) - 2015
- [c23]Cyrille Dejemeppe, Sascha Van Cauwelaert, Pierre Schaus:
The Unary Resource with Transition Times. CP 2015: 89-104 - [c22]Steven Gay, Renaud Hartert, Christophe Lecoutre, Pierre Schaus:
Conflict Ordering Search for Scheduling Problems. CP 2015: 140-148 - [c21]Steven Gay, Renaud Hartert, Pierre Schaus:
Simple and Scalable Time-Table Filtering for the Cumulative Constraint. CP 2015: 149-157 - [c20]Renaud Hartert, Pierre Schaus, Stefano Vissicchio, Olivier Bonaventure:
Solving Segment Routing Problems with Hybrid Constraint Programming Techniques. CP 2015: 592-608 - [c19]Cyrille Dejemeppe, Pierre Schaus, Yves Deville:
Derivative-Free Optimization: Lifting Single-Objective to Multi-Objective Algorithm. CPAIOR 2015: 124-140 - [c18]Steven Gay, Renaud Hartert, Pierre Schaus:
Time-Table Disjunctive Reasoning for the Cumulative Constraint. CPAIOR 2015: 157-172 - [c17]Sascha Van Cauwelaert, Michele Lombardi, Pierre Schaus:
Understanding the Potential of Propagators. CPAIOR 2015: 427-436 - [c16]Renaud Hartert, Stefano Vissicchio, Pierre Schaus, Olivier Bonaventure, Clarence Filsfils, Thomas Telkamp, Pierre François:
A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks. SIGCOMM 2015: 15-28 - [c15]Simon Busard, Quentin Cappart, Christophe Limbrée, Charles Pecheur, Pierre Schaus:
Verification of railway interlocking systems. ESSS 2015: 19-31 - 2014
- [j2]Pierre Schaus, Jean-Charles Régin:
Bound-consistent spread constraint. EURO J. Comput. Optim. 2(3): 123-146 (2014) - [c14]Renaud Hartert, Pierre Schaus:
A Support-Based Algorithm for the Bi-Objective Pareto Constraint. AAAI 2014: 2674-2679 - [c13]Vinasétan Ratheil Houndji, Pierre Schaus, Laurence A. Wolsey, Yves Deville:
The StockingCost Constraint. CP 2014: 382-397 - [c12]Steven Gay, Pierre Schaus, Vivian De Smedt:
Continuous Casting Scheduling with Constraint Programming. CP 2014: 831-845 - [c11]Michele Lombardi, Pierre Schaus:
Cost Impact Guided LNS. CPAIOR 2014: 293-300 - 2013
- [c10]François Pelsser, Pierre Schaus, Jean-Charles Régin:
Revisiting the Cardinality Reasoning for BinPacking Constraint. CP 2013: 578-586 - [c9]Pierre Schaus, Renaud Hartert:
Multi-Objective Large Neighborhood Search. CP 2013: 611-627 - [c8]Pierre Schaus:
Variable Objective Large Neighborhood Search: A Practical Approach to Solve Over-Constrained Problems. ICTAI 2013: 971-978 - 2012
- [c7]Pierre Schaus, Jean-Charles Régin, Rowan Van Schaeren, Wout Dullaert, Birger Raa:
Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem. CP 2012: 815-822 - 2011
- [j1]Pierre Schaus, Pascal Van Hentenryck, Jean-Noël Monette, Carleton Coffrin, Laurent Michel, Yves Deville:
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS. Constraints An Int. J. 16(2): 125-147 (2011) - 2010
- [c6]Julien Dupuis, Pierre Schaus, Yves Deville:
Consistency Check for the Bin Packing Constraint Revisited. CPAIOR 2010: 117-122 - [c5]Pierre Schaus, Pascal Van Hentenryck, Alessandro Zanarini:
Revisiting the Soft Global Cardinality Constraint. CPAIOR 2010: 307-312
2000 – 2009
- 2009
- [c4]Pierre Schaus, Pascal Van Hentenryck, Jean-Charles Régin:
Scalable Load Balancing in Nurse to Patient Assignment Problems. CPAIOR 2009: 248-262 - 2008
- [c3]Pierre Schaus, Yves Deville:
A Global Constraint for Bin-Packing with Precedences: Application to the Assembly Line Balancing Problem. AAAI 2008: 369-374 - 2007
- [c2]Pierre Schaus, Yves Deville, Pierre Dupont:
Bound-Consistent Deviation Constraint. CP 2007: 620-634 - [c1]Pierre Schaus, Yves Deville, Pierre Dupont, Jean-Charles Régin:
The Deviation Constraint. CPAIOR 2007: 260-274
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-09-02 01:01 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:
