default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephane Rovedakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Valentin Bouquet
, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. Theor. Comput. Sci. 1001: 114561 (2024)- 2022
- [j7]Francesca Fossati, Stéphane Rovedakis, Stefano Secci:
Distributed Algorithms for Multi-Resource Allocation. IEEE Trans. Parallel Distributed Syst. 33(10): 2524-2539 (2022) - 2021
- [j6]Sourour Elloumi, Olivier Hudry, Estel Marie, Agathe Martin, Agnès Plateau, Stéphane Rovedakis:
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. Ann. Oper. Res. 298(1): 183-206 (2021) - 2019
- [j5]Alain Cournier, Stephane Rovedakis, Vincent Villain:
The first fully polynomial stabilizing algorithm for BFS tree construction. Inf. Comput. 265: 26-56 (2019) - 2016
- [j4]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property. Comput. J. 59(2): 225-243 (2016) - 2013
- [j3]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis:
A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees. Theor. Comput. Sci. 500: 90-112 (2013) - 2011
- [j2]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Self-stabilizing minimum degree spanning tree within one from the optimal degree. J. Parallel Distributed Comput. 71(3): 438-449 (2011) - 2010
- [j1]Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault:
Hardness Results and Heuristic for Multi-groups Interconnection. Comput. J. 53(9): 1497-1507 (2010)
Conference and Workshop Papers
- 2023
- [c18]Alessandro Aimi, Stéphane Rovedakis, Fabrice Guillemin, Stefano Secci:
ELoRa: End-to-end Emulation of Massive IoT LoRaWAN Infrastructures. NOMS 2023: 1-3 - 2022
- [c17]Laiza de Lara, Francesca Fossati, Stéphane Rovedakis:
Robust Multi-Resource Allocation Against Controller Failures in Network Slice Provisioning. CloudNet 2022: 28-33 - [c16]Alessandro Aimi, Fabrice Guillemin, Stéphane Rovedakis, Stefano Secci:
Packet Delivery Ratio Guarantees for Differentiated LoRaWanServices. GLOBECOM 2022: 2014-2019 - [c15]Alessandro Aimi, Fabrice Guillemin, Stéphane Rovedakis, Stefano Secci:
Traffic Control and Channel Assignment for Quality Differentiation in Dense Urban LoRaWANs. WiOpt 2022: 153-160 - 2020
- [c14]Francesca Fossati, Stefano Moretti, Stephane Rovedakis, Stefano Secci:
Decentralization of 5G slice resource allocation. NOMS 2020: 1-9 - 2019
- [c13]Ibtissem Zaatouri, Françoise Sailhan, Stephane Rovedakis, Awatef Ben Fradj Guiloufi, Nouha Alyaoui, Abdennaceur Kachouri:
Performance Evaluation of Mobility-Aware Routing Protocol for Low power and Lossy Networks. SSD 2019: 636-641 - 2017
- [c12]Sourour Elloumi, Olivier Hudry, Estel Marie, Agnès Plateau, Stephane Rovedakis:
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. CoDIT 2017: 336-341 - 2016
- [c11]Lilia Lassouaoui, Stephane Rovedakis, Françoise Sailhan, Anne Wei:
Comparison of RPL Routing Metrics on Grids. ADHOCNETS 2016: 64-75 - [c10]Lilia Lassouaoui, Stephane Rovedakis, Anne Wei, Linqing Gui:
Deterministic Allocation by Oriented Edge Coloring for Wireless Sensor Networks. VTC Spring 2016: 1-5 - [c9]Lilia Lassouaoui, Stephane Rovedakis, Françoise Sailhan, Anne Wei:
Evaluation of energy aware routing metrics for RPL. WiMob 2016: 1-8 - 2014
- [c8]François Delbot, Christian Laforest, Stephane Rovedakis:
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. OPODIS 2014: 307-322 - 2012
- [c7]Golnaz Karbaschi, Françoise Sailhan, Stephane Rovedakis:
Towards a Fault-Tolerant Wireless Sensor Network Using Fault Injection Mechanisms: A Parking Lot Monitoring Case. GreenCom 2012: 783-787 - 2011
- [c6]Alain Cournier, Stephane Rovedakis, Vincent Villain:
The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction. OPODIS 2011: 159-174 - 2010
- [c5]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
Loop-Free Super-Stabilizing Spanning Tree Construction. SSS 2010: 50-64 - [c4]Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme. DISC 2010: 480-494 - 2009
- [c3]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Self-stabilizing minimum-degree spanning tree within one from the optimal degree. IPDPS 2009: 1-11 - [c2]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees. SSS 2009: 133-148 - [c1]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. DISC 2009: 407-422
Editorship
- 2024
- [e1]Prosper Chemouil, Barbara Martini, Carmen Mas Machuca, Panagiotis Papadimitriou, Davide Borsatti, Stéphane Rovedakis:
27th Conference on Innovation in Clouds, Internet and Networks, ICIN 2024, Paris, France, March 11-14, 2024. IEEE 2024, ISBN 979-8-3503-9376-7 [contents]
Informal and Other Publications
- 2023
- [i8]Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. CoRR abs/2304.09701 (2023) - 2020
- [i7]Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On Minimum Dominating Sets in cubic and (claw, H)-free graphs. CoRR abs/2002.12232 (2020) - 2014
- [i6]François Delbot, Christian Laforest, Stephane Rovedakis:
Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems. CoRR abs/1408.2116 (2014) - 2013
- [i5]Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme. CoRR abs/1311.0798 (2013) - 2010
- [i4]Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
Universal Loop-Free Super-Stabilization. CoRR abs/1006.3009 (2010) - [i3]Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru, Stephane Rovedakis:
Fast Self-Stabilizing Minimum Spanning Tree Construction. CoRR abs/1006.3141 (2010) - 2009
- [i2]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees. CoRR abs/0902.3528 (2009) - [i1]Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property. CoRR abs/0905.2287 (2009)
Coauthor Index
aka: Maria Gradinariu Potop-Butucaru
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-06-03 00:55 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:
