default search action
Nicolas Delanoue
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j10]Nicolas Delanoue
, Mehdi Lhommeau, Sebastien Lagrange:
Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis. Comput. Optim. Appl. 77(1): 307-334 (2020)
2010 – 2019
- 2019
- [j9]Jean-Baptiste Fasquel
A Graph Based Image Interpretation Method Using A Priori Qualitative Inclusion and Photometric Relationships. IEEE Trans. Pattern Anal. Mach. Intell. 41(5): 1043-1055 (2019) - 2018
- [j8]Mohamed Mustafa, Alexandru Stancu
Guaranteed SLAM - An interval approach. Robotics Auton. Syst. 100: 160-170 (2018) - 2016
- [j7]Nicolas Delanoue, Mehdi Lhommeau
Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem. Comput. Optim. Appl. 63(3): 855-873 (2016) - 2015
- [j6]Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau:
An algorithm for computing a neighborhood included in the attraction domain of an asymptotically stable point. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 181-189 (2015) - 2014
- [j5]Nicolas Delanoue, Sebastien Lagrange
A numerical approach to compute the topology of the Apparent Contour of a smooth mapping from R2 to R2. J. Comput. Appl. Math. 271: 267-284 (2014) - 2013
- [c2]Simon Landrault, Philippe Lucidarme, Nicolas Delanoue:
Path Planning Optimization based on Bézier Curves through Open-doors Way Point. ICINCO (2) 2013: 156-161
2000 – 2009
- 2008
- [j4]Sebastien Lagrange, Nicolas Delanoue, Luc Jaulin:
Injectivity analysis using interval analysis: Application to structural identifiability. Autom. 44(11): 2959-2962 (2008) - 2007
- [j3]Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau:
Guaranteeing the Homotopy Type of a Set Defined by Non-Linear Inequalities. Reliab. Comput. 13(5): 381-398 (2007) - [j2]Sebastien Lagrange, Nicolas Delanoue, Luc Jaulin:
On Sufficient Conditions of the Injectivity: Development of a Numerical Test Algorithm via Interval Analysis. Reliab. Comput. 13(5): 409-421 (2007) - 2006
- [j1]Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau:
Using interval arithmetic to prove that a set is path-connected. Theor. Comput. Sci. 351(1): 119-128 (2006) - 2004
- [c1]Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau:
Counting the Number of Connected Components of a Set and Its Application to Robotics. PARA 2004: 93-101
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-04-25 05:45 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: