default search action
Florian Huc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c13]Nicolas Braud-Santoni, Rachid Guerraoui, Florian Huc:
Fast byzantine agreement. PODC 2013: 57-64 - [c12]Rachid Guerraoui, Florian Huc, Anne-Marie Kermarrec:
Highly dynamic distributed computing with byzantine failures. PODC 2013: 176-183 - [c11]Yahya Benkaouz, Rachid Guerraoui, Mohammed Erradi, Florian Huc:
A Distributed Polling with Probabilistic Privacy. SRDS 2013: 41-50 - 2012
- [j14]David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica 63(1-2): 158-190 (2012) - [j13]Florian Huc, Cláudia Linhares Sales, Hervé Rivano:
The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks. Discret. Math. Algorithms Appl. 4(3) (2012) - [j12]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) - [j11]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 - [c9]Sébastien Gambs, Rachid Guerraoui, Hamza Harkous, Florian Huc, Anne-Marie Kermarrec:
Scalable and Secure Polling in Dynamic Distributed Networks. SRDS 2012: 181-190 - [i7]Sébastien Gambs, Rachid Guerraoui, Florian Huc, Anne-Marie Kermarrec:
On Dynamic Distributed Computing. CoRR abs/1202.3084 (2012) - 2011
- [j10]Florian Huc:
Weighted-Edge-Coloring of k-degenerate Graphs and Bin-Packing. J. Interconnect. Networks 12(1-2): 109-124 (2011) - [j9]Omid Amini, Simon Griffiths, Florian Huc:
Subgraphs of Weakly Quasi-Random Oriented Graphs. SIAM J. Discret. Math. 25(1): 234-259 (2011) - [i6]Aubin Jarry, Florian Huc, Pierre Leone, José D. P. Rolim:
Distributed Planarization and Local Routing Strategies in Sensor Networks. CoRR abs/1107.5154 (2011) - [i5]Sébastien Gambs, Rachid Guerraoui, Hamza Harkous, Florian Huc, Anne-Marie Kermarrec:
Scalable and Secure Aggregation in Distributed Networks. CoRR abs/1107.5419 (2011) - 2010
- [j8]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. Comb. Probab. Comput. 19(2): 161-182 (2010) - [j7]Jean-Claude Bermond, Frédéric Havet, Florian Huc, Cláudia Linhares Sales:
Improper Coloring of Weighted Grid and Hexagonal Graphs. Discret. Math. Algorithms Appl. 2(3): 395-412 (2010) - [j6]Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc:
Minimal selectors and fault tolerant networks. Networks 55(4): 326-340 (2010) - [c8]Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Virtual Raw Anchor Coordinates: A New Localization Paradigm. ALGOSENSORS 2010: 161-175 - [c7]Brigitte Jaumard, Nazmun Nahar Bhuiyan, Samir Sebbah, Florian Huc, David Coudert:
A new framework for efficient shared segment protection scheme for WDM networks. HPSR 2010: 189-196 - [c6]Christelle Caillouet, Florian Huc, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano:
Stability of a localized and greedy routing algorithm. IPDPS Workshops 2010: 1-8 - [c5]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
2000 – 2009
- 2009
- [j5]Florian Huc, Ignasi Sau, Janez Zerovnik:
(l, k)-ROUTING ON PLANE GRIDS. J. Interconnect. Networks 10(1-2): 27-57 (2009) - [j4]Omid Amini, Florian Huc, Stéphane Pérennes:
On the Path-Width of Planar Graphs. SIAM J. Discret. Math. 23(3): 1311-1316 (2009) - [c4]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 - [i4]Florian Huc, Aubin Jarry:
VRAC: Virtual Raw Anchor Coordinates Routing in Sensor Networks -- Concepts and Experimental Protocol. CoRR abs/0904.3611 (2009) - [i3]Florian Huc, Aubin Jarry:
VRAC: Simulation Results #1. CoRR abs/0910.4024 (2009) - 2008
- [b1]Florian Huc:
Conception de Réseaux Dynamiques Tolérants aux Pannes. (Conception of dynamic fault tolerant networks). University of Nice Sophia Antipolis, France, 2008 - [j3]Omid Amini, Simon Griffiths, Florian Huc:
4-cycles in mixing digraphs. Electron. Notes Discret. Math. 30: 63-68 (2008) - [j2]Florian Huc, Cláudia Linhares Sales, Hervé Rivano:
The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks. Electron. Notes Discret. Math. 30: 141-146 (2008) - [c3]David Coudert, Florian Huc, Fabrice Peix, Marie-Emilie Voge:
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints. ICC 2008: 5170-5174 - [c2]David Coudert, Florian Huc, Dorian Mazauric:
Computing and Updating the Process Number in Trees. OPODIS 2008: 546-550 - [c1]David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing and Updating the Process Number of a Forest. DISC 2008: 500-501 - [i2]David Coudert, Florian Huc, Dorian Mazauric:
A distributed algorithm for computing and updating the process number of a forest. CoRR abs/0806.2710 (2008) - 2007
- [j1]David Coudert, Florian Huc, Jean-Sébastien Sereni:
Pathwidth of outerplanar graphs. J. Graph Theory 55(1): 27-41 (2007) - [i1]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. CoRR abs/0705.0315 (2007)
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-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint