default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Vismara
Person information
- affiliation: University of Montpellier, LRIMM
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Margot Challand
, Philippe Vismara, Dimitri Justeau-Allaire, Stéphane de Tourdonnet:
Supporting Sustainable Agroecological Initiatives for Small Farmers through Constraint Programming. IJCAI 2023: 5924-5931- 2022
- [j6]B. Oger, G. Le Moguédec, Philippe Vismara, Bruno Tisseyre:
A new criterion based on estimator variance for model sampling in precision agriculture. Comput. Electron. Agric. 200: 107184 (2022)
2010 – 2019
- 2019
- [c10]Dimitri Justeau-Allaire, Philippe Vismara, Philippe Birnbaum, Xavier Lorca:
Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design.. IJCAI 2019: 5902-5908 - 2018
- [c9]Philippe Vismara, Nicolas Briot:
A Circuit Constraint for Multiple Tours Problems. CP 2018: 389-402 - 2016
- [j5]Philippe Vismara, Remi Coletta, Gilles Trombettoni:
Constrained global optimization for wine blending. Constraints An Int. J. 21(4): 597-615 (2016) - 2015
- [c8]Nicolas Briot, Christian Bessiere, Philippe Vismara:
A Constraint-Based Approach to the Differential Harvest Problem. CP 2015: 541-556 - 2014
- [c7]Clément Carbonnel, Gilles Trombettoni, Philippe Vismara, Gilles Chabert:
Q-Intersection Algorithms for Constraint-Based Robust Parameter Estimation. AAAI 2014: 2630-2636 - 2013
- [c6]Philippe Vismara, Remi Coletta, Gilles Trombettoni:
Constrained Wine Blending. CP 2013: 864-879 - 2012
- [j4]Jannik Laval, Jean-Rémy Falleri, Philippe Vismara, Stéphane Ducasse:
Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems. J. Object Technol. 11(1): 1-24 (2012) - [c5]Philippe Vismara, Remi Coletta:
Breaking Variable Symmetry in Almost Injective Problems. CP 2012: 664-671 - 2011
- [c4]Jean-Rémy Falleri, Simon Denier, Jannik Laval, Philippe Vismara, Stéphane Ducasse:
Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems. TOOLS (49) 2011: 260-275 - 2010
- [j3]Frédéric Pennerath, Gilles Niel, Philippe Vismara, Philippe Jauffret, Claude Laurenço, Amedeo Napoli:
Graph-Mining Algorithm for the Evaluation of Bond Formability. J. Chem. Inf. Model. 50(2): 221-239 (2010)
2000 – 2009
- 2008
- [c3]Philippe Vismara, Benoît Valéry:
Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms. MCO 2008: 358-368 - 2005
- [j2]Philippe Vismara, Yannic S. Tognetti, Claude Laurenço:
Maximum Symmetrical Split of Molecular Graphs. Application to Organic Synthesis Design. J. Chem. Inf. Model. 45(3): 685-695 (2005)
1990 – 1999
- 1998
- [c2]Philippe Vismara, Claude Laurenço:
An abstract representation for molecular graphs. Discrete Mathematical Chemistry 1998: 343-366 - 1997
- [j1]Philippe Vismara:
Union of all the Minimum Cycle Bases of a Graph. Electron. J. Comb. 4(1) (1997) - 1996
- [c1]Philippe Vismara:
Appariements dirigés pour le raisonnement par classification sur des hiérarchies de graphes. LMO 1996: 201-214
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-10-07 21:19 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:
