default search action
Aubin Jarry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [i6]Aubin Jarry:
The Four Principles of Geographic Routing. CoRR abs/1403.3007 (2014) - 2013
- [j9]Aubin Jarry:
Fast reroute paths algorithms. Telecommun. Syst. 52(2): 881-888 (2013) - 2012
- [j8]Aubin Jarry:
Multiflows in symmetric digraphs. Discret. Appl. Math. 160(15): 2208-2220 (2012) - [j7]Aubin Jarry, Alexandre Laugier:
On the minimum number of edges of two-connected graphs with given diameter. Discret. Math. 312(4): 757-762 (2012) - [j6]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
On the efficiency of routing in sensor networks. J. Parallel Distributed Comput. 72(7): 889-901 (2012) - [j5]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Virtual raw anchor coordinates: A new localization paradigm. Theor. Comput. Sci. 453: 44-53 (2012) - [c10]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm. DCOSS 2012: 140-149 - 2011
- [j4]Aubin Jarry, Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Optimal data gathering paths and energy-balance mechanisms in wireless networks. Ad Hoc Networks 9(6): 1036-1048 (2011) - [i5]Aubin Jarry, Florian Huc, Pierre Leone, José D. P. Rolim:
Distributed Planarization and Local Routing Strategies in Sensor Networks. CoRR abs/1107.5154 (2011) - 2010
- [c9]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Virtual Raw Anchor Coordinates: A New Localization Paradigm. ALGOSENSORS 2010: 161-175 - [c8]Aubin Jarry, Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Optimal Data Gathering Paths and Energy Balance Mechanisms in Wireless Networks. DCOSS 2010: 288-305 - [c7]Aubin Jarry:
On the complexity of computing shortest fast reroute paths. ICUMT 2010: 595-600 - [c6]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio. PODC 2010: 116-117 - [i4]Aubin Jarry, Pierre Leone, José D. P. Rolim:
VRAC: Theory #1. CoRR abs/1002.0484 (2010)
2000 – 2009
- 2009
- [j3]Aubin Jarry, Stéphane Pérennes:
Disjoint paths in symmetric digraphs. Discret. Appl. Math. 157(1): 90-97 (2009) - [c5]Florian Huc, Aubin Jarry, Pierre Leone, Luminita Moraru
, Sotiris E. Nikoletseas, José D. P. Rolim:
Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks. ALGOSENSORS 2009: 102-115 - [i3]Florian Huc, Aubin Jarry:
VRAC: Virtual Raw Anchor Coordinates Routing in Sensor Networks -- Concepts and Experimental Protocol. CoRR abs/0904.3611 (2009) - [i2]Florian Huc, Aubin Jarry:
VRAC: Simulation Results #1. CoRR abs/0910.4024 (2009) - 2006
- [c4]Aubin Jarry, Pierre Leone, Olivier Powell, José D. P. Rolim:
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks. DCOSS 2006: 405-421 - 2005
- [b1]Aubin Jarry:
Connexité dans les réseaux de télécommunications. (Connectivity in telecommunication networks). University of Nice Sophia Antipolis, France, 2005 - [j2]Sébastien Choplin, Aubin Jarry, Stéphane Pérennes:
Virtual network embedding in the cycle. Discret. Appl. Math. 145(3): 368-375 (2005) - [i1]Olivier Powell, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Gradient Based Routing in Wireless Sensor Networks: a Mixed Strategy. CoRR abs/cs/0511083 (2005) - 2004
- [c3]Aubin Jarry, Zvi Lotker:
Connectivity in evolving graph with geometric properties. DIALM-POMC 2004: 24-30 - [c2]Aubin Jarry:
Integral Symmetric 2-Commodity Flows. STACS 2004: 406-417 - 2003
- [j1]Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry:
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. Int. J. Found. Comput. Sci. 14(2): 267-285 (2003) - 2002
- [c1]Aubin Jarry, Stephane Perennes:
Disjoint Paths in Symmetric Digraphs. SIROCCO 2002: 211-222
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:58 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: