default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVlady Ravelomanana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Vlady Ravelomanana, Ny Aina Andriambolamalala:
Transmitting Once to Elect a Leader on Wireless Networks. Algorithmica 85(9): 2529-2553 (2023)- 2021
- [j25]Marc Noy, Vonjy Rasendrahasina
, Vlady Ravelomanana, Juanjo Rué:
Cycles of given lengths in unicyclic components in sparse random graphs. Adv. Appl. Math. 125: 102162 (2021) - [i16]Ny Aina Andriambolamalala, Vlady Ravelomanana:
Energy-Efficient Naming in Beeping Networks. CoRR abs/2106.03753 (2021) - [i15]Sergey Dovgal, Élie de Panafieu, Vlady Ravelomanana:
Exact enumeration of satisfiable 2-SAT formulae. CoRR abs/2108.08067 (2021) - 2020
- [j24]Gwendal Collet, Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs in simple graphs and multigraphs. Eur. J. Comb. 88: 103113 (2020) - [c20]Ny Aina Andriambolamalala, Vlady Ravelomanana:
Transmitting once to Elect a Leader on Wireless Networks. LATIN 2020: 439-450
2010 – 2019
- 2019
- [j23]Vonjy Rasendrahasina, Andry Rasoanaivo, Vlady Ravelomanana:
Expected Maximum Block Size in Critical Random Graphs. Comb. Probab. Comput. 28(4): 638-655 (2019) - [j22]Francesco Betti Sorbelli, Cristina M. Pinotti, Vlady Ravelomanana:
Range-free localization algorithm using a customary drone: Towards a realistic scenario. Pervasive Mob. Comput. 54: 1-15 (2019) - [c19]Ny Aina Andriambolamalala, Vlady Ravelomanana:
Energy Efficient Naming in Beeping Networks. ADHOC-NOW 2019: 355-369 - 2018
- [j21]Vonjy Rasendrahasina, Vlady Ravelomanana, Liva Aly Raonenantsoamihaja:
The Maximal Length of 2-Path in Random Critical Graphs. J. Appl. Math. 2018: 8983218:1-8983218:5 (2018) - [c18]Sergey Dovgal, Vlady Ravelomanana:
Shifting the Phase Transition Threshold for Random Graphs Using Degree Set Constraints. LATIN 2018: 399-412 - [c17]Amitabha Bagchi, Federico Coro, Cristina M. Pinotti, Vlady Ravelomanana:
Border effects on connectivity for randomly oriented directional antenna networks. Med-Hoc-Net 2018: 1-8 - [c16]Francesco Betti Sorbelli, Cristina M. Pinotti, Vlady Ravelomanana:
Range-Free Localization Algorithm Using a Customary Drone. SMARTCOMP 2018: 9-16 - 2017
- [j20]Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs: an analytic approach. Electron. Notes Discret. Math. 61: 271-277 (2017) - [c15]Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana, Juanjo Rué:
Isolated cycles of critical random graphs. ANALCO 2017: 46-55 - [i14]Sergey Dovgal, Vlady Ravelomanana:
Shifting the Phase Transition Threshold for Random Graphs and 2-SAT using Degree Constraints. CoRR abs/1704.06683 (2017) - 2016
- [c14]Vlady Ravelomanana:
Time-Optimal and Energy-Efficient Size Approximation of Radio Networks. DCOSS 2016: 233-237 - [i13]Vonjy Rasendrahasina, Andry Rasoanaivo, Vlady Ravelomanana:
The Maximum Block Size of Critical Random Graphs. CoRR abs/1605.04340 (2016) - 2015
- [j19]Elie de Panafieu, Vlady Ravelomanana:
Analytic description of the phase transition of inhomogeneous multigraphs. Eur. J. Comb. 48: 186-197 (2015) - 2014
- [j18]Cyril Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana, Vytas Zacharovas:
Analysis of an Exhaustive Search Algorithm in Random Graphs and the nclog n-Asymptotics. SIAM J. Discret. Math. 28(1): 342-371 (2014) - 2012
- [c13]Hervé Daudé, Conrado Martínez, Vonjy Rasendrahasina, Vlady Ravelomanana:
The MAX-CUT of sparse random graphs. SODA 2012: 265-271 - [i12]Cyril Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana, Vytas Zacharovas:
Analysis of an exhaustive search algorithm in random graphs and the nc log n-asymptotics. CoRR abs/1207.6549 (2012) - 2011
- [j17]Hervé Daudé, Vlady Ravelomanana:
Random 2 XORSAT Phase Transition. Algorithmica 59(1): 48-65 (2011) - [j16]Ferruccio Barsi, Alan A. Bertossi, Christian Lavault, Alfredo Navarra, Stephan Olariu, Maria Cristina Pinotti, Vlady Ravelomanana:
Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks. IEEE Trans. Mob. Comput. 10(3): 377-391 (2011) - 2010
- [j15]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Minimum sum edge colorings of multicycles. Discret. Appl. Math. 158(12): 1216-1223 (2010) - [j14]Alfredo Navarra, Maria Cristina Pinotti, Vlady Ravelomanana, Francesco Betti Sorbelli, Roberto Ciotti:
Cooperative training for high density sensor and actor networks. IEEE J. Sel. Areas Commun. 28(5): 753-763 (2010) - [j13]Vlady Ravelomanana:
Birth and growth of multicyclic components in random hypergraphs. Theor. Comput. Sci. 411(43): 3801-3813 (2010) - [c12]Vonjy Rasendrahasina, Vlady Ravelomanana:
Limit Theorems for Random MAX-2-XORSAT. LATIN 2010: 320-331
2000 – 2009
- 2009
- [c11]Francesco Betti Sorbelli, Roberto Ciotti, Alfredo Navarra, Maria Cristina Pinotti, Vlady Ravelomanana:
Cooperative Training in Wireless Sensor and Actor Networks. QSHINE 2009: 569-583 - 2008
- [j12]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs. Electron. Notes Discret. Math. 30: 39-44 (2008) - [c10]Gabriel Paillard, Vlady Ravelomanana:
Limit Theorems for Degree of Coverage and Lifetime in Large Sensor Networks. INFOCOM 2008: 2011-2019 - [c9]Hervé Daudé, Vlady Ravelomanana:
Random 2-XORSAT at the Satisfiability Threshold. LATIN 2008: 12-23 - [c8]Ferruccio Barsi, Alfredo Navarra, Maria Cristina Pinotti, Christian Lavault, Vlady Ravelomanana, Stephan Olariu, Alan A. Bertossi:
Efficient binary schemes for training heterogeneous sensor and actor networks. HeterSanet 2008: 17-24 - 2007
- [j11]Christian Lavault, Jean-François Marckert, Vlady Ravelomanana:
Quasi-optimal energy-efficient leader election algorithms in radio networks. Inf. Comput. 205(5): 679-693 (2007) - [j10]Vlady Ravelomanana:
Another proof of Wright's inequalities. Inf. Process. Lett. 104(1): 36-39 (2007) - [j9]Vlady Ravelomanana:
Optimal Initialization and Gossiping Algorithms for Random Radio Networks. IEEE Trans. Parallel Distributed Syst. 18(1): 17-28 (2007) - [i11]Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier:
On the growth of components with non fixed excesses. CoRR abs/0706.1642 (2007) - [i10]Vlady Ravelomanana:
Another Proof of Wright's Inequalities. CoRR abs/0706.1665 (2007) - [i9]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs. CoRR abs/0706.3848 (2007) - 2006
- [j8]Vlady Ravelomanana:
The Average Size of Giant Components between the Double-Jump. Algorithmica 46(3-4): 529-555 (2006) - [c7]Vlady Ravelomanana, Alphonse Laza Rijamamy:
Creation and Growth of Components in a Random Hypergraph Process. COCOON 2006: 350-359 - [c6]Binh Thanh Doan, Christian Lavault, Stephan Olariu, Vlady Ravelomanana:
An energy-efficient initialization algorithm for random radio networks. RIVF 2006: 126-132 - [i8]Christian Lavault, Jean-François Marckert, Vlady Ravelomanana:
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots. CoRR abs/cs/0607028 (2006) - [i7]Christian Lavault, Jean-François Marckert, Vlady Ravelomanana:
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots. CoRR abs/cs/0607034 (2006) - [i6]Vlady Ravelomanana:
The Average Size of Giant Components Between the Double-Jump. CoRR abs/cs/0607057 (2006) - [i5]Vlady Ravelomanana, Alphonse Laza Rijamamy:
Creation and Growth of Components in a Random Hypergraph Process. CoRR abs/cs/0607059 (2006) - 2005
- [c5]Vlady Ravelomanana:
Randomized Initialization of a Wireless Multihop Network. HICSS 2005 - [c4]Vlady Ravelomanana:
Distributed k-Clustering Algorithms for Random Wireless Multihop Networks. ICN (1) 2005: 109-116 - 2004
- [j7]Vlady Ravelomanana, Loÿs Thimonier:
Forbidden subgraphs in connected graphs. Theor. Comput. Sci. 314(1-2): 121-171 (2004) - [j6]Vlady Ravelomanana:
Extremal Properties of Three-Dimensional Sensor Networks with Applications. IEEE Trans. Mob. Comput. 3(3): 246-257 (2004) - [c3]Fayçal Djerourou, Christian Lavault, Gabriel Antoine Louis Paillard, Vlady Ravelomanana:
Assigning Codes in a Random Wireless Network. ICT 2004: 348-353 - [c2]Romain Mellier, Jean Frédéric Myoupo, Vlady Ravelomanana:
A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks. MWCN 2004: 287-298 - [i4]Vlady Ravelomanana:
Randomized Initialization of a Wireless Multihop Network. CoRR abs/cs/0412014 (2004) - [i3]Vlady Ravelomanana:
Extremal Properties of Three Dimensional Sensor Networks with Applications. CoRR cs.DS/0411027 (2004) - [i2]Vlady Ravelomanana, Loÿs Thimonier:
Forbidden Subgraphs in Connected Graphs. CoRR cs.DS/0411093 (2004) - [i1]Cyril Banderier, Jean-Marie Le Bars, Vlady Ravelomanana:
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games). CoRR math.CO/0411138 (2004) - 2003
- [j5]Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier:
On the growth of components with non-fixed excesses. Discret. Appl. Math. 130(3): 487-493 (2003) - [j4]Jean Frédéric Myoupo, Loÿs Thimonier, Vlady Ravelomanana:
Average case analysis-based protocols to initialize packet radio networks. Wirel. Commun. Mob. Comput. 3(4): 539-548 (2003) - 2001
- [j3]Vlady Ravelomanana, Loÿs Thimonier:
Asymptotic enumeration of cographs. Electron. Notes Discret. Math. 7: 58-61 (2001) - [j2]Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier:
On the growth of components with non-fixed excesses. Electron. Notes Discret. Math. 10: 7-12 (2001) - 2000
- [j1]Vlady Ravelomanana, Loÿs Thimonier:
Patchworks and metablocks enumeration. Inf. Process. Lett. 73(3-4): 77-86 (2000) - [c1]Vlady Ravelomanana, Loÿs Thimonier:
Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs. LATIN 2000: 28-37
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:54 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:
