default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Prcovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j2]Yannick Carissan
, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids. Constraints An Int. J. 27(3): 192-248 (2022)- [j1]Adrien Varet, Nicolas Prcovic, Cyril Terrioux, Denis Hagebaum-Reignier, Yannick Carissan:
BenzAI: A Program to Design Benzenoids with Defined Properties Using Constraint Programming. J. Chem. Inf. Model. 62(11): 2811-2820 (2022)
Conference and Workshop Papers
- 2024
- [c17]Alexandre Coppé, Nicolas Prcovic:
Un algorithme de routage de navires générant des trajets précis et diversifiés. APIA 2024: 75-82 - 2021
- [c16]Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. CP 2021: 19:1-19:18 - 2020
- [c15]Yannick Carissan, Chisom-Adaobi Dim, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming. CP 2020: 673-689 - [c14]Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry. CP 2020: 690-706 - 2017
- [c13]Estelle Chauveau, Philippe Jégou, Nicolas Prcovic:
Weather Routing Optimization: A New Shortest Path Algorithm. ICTAI 2017: 687-694 - 2012
- [c12]Nicolas Prcovic:
Narrowing Extended Resolution. ICTAI 2012: 556-563 - 2006
- [c11]Verroust Florent, Nicolas Prcovic:
Solving Symmetrical CSPs with an Asymmetrical Cost Function. ICTAI 2006: 275-278 - 2005
- [c10]Laurent Henocque, Mathias Kleiner, Nicolas Prcovic:
Advances in Polytime Isomorph Elimination for Configuration. CP 2005: 301-313 - [c9]Nicolas Prcovic:
Extremal CSPs. CP 2005: 807-811 - 2004
- [c8]Laurent Henocque, Nicolas Prcovic:
Practically Handling Some Configuration Isomorphisms. ICTAI 2004: 90-97 - 2003
- [c7]Stéphane Grandcolas, Laurent Henocque, Nicolas Prcovic:
A Canonicity Test for Configuration. CP 2003: 853-857 - [c6]Nicolas Prcovic:
Tree Local Search. CP 2003: 935-939 - 2002
- [c5]Nicolas Prcovic, Bertrand Neveu:
Progressive Focusing Search. ECAI 2002: 126-130 - 1999
- [c4]Nicolas Prcovic, Bertrand Neveu:
Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search. CP 1999: 361-374 - 1998
- [c3]Per Kristian Nilsen, Nicolas Prcovic:
Parallel Optimisation in the SCOOP Library. IPPS/SPDP Workshops 1998: 452-463 - 1997
- [c2]Nicolas Prcovic:
Changing the Distribution Depth During a Parallel Tree Search. Euro-Par 1997: 1217-1220 - 1996
- [c1]Nicolas Prcovic:
A Distributed Algorithm Solving CSPs with a Low Communication Cost. ICTAI 1996: 454-455
Informal and Other Publications
- 2003
- [i1]Stéphane Grandcolas, Laurent Henocque, Nicolas Prcovic:
Pruning Isomorphic Structural Sub-problems in Configuration. CoRR cs.AI/0306135 (2003)
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-21 02:39 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:
