Vlady Ravelomanana

According to our database1, Vlady Ravelomanana authored at least 48 papers between 2000 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Threshold functions for small subgraphs in simple graphs and multigraphs.
Eur. J. Comb., 2020

Range-free localization algorithm using a customary drone: Towards a realistic scenario.
Pervasive Mob. Comput., 2019

Expected Maximum Block Size in Critical Random Graphs.
Comb. Probab. Comput., 2019

Energy Efficient Naming in Beeping Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 2019

The Maximal Length of 2-Path in Random Critical Graphs.
J. Appl. Math., 2018

Range-Free Localization Algorithm Using a Customary Drone.
Proceedings of the 2018 IEEE International Conference on Smart Computing, 2018

Border effects on connectivity for randomly oriented directional antenna networks.
Proceedings of the 17th Annual Mediterranean Ad Hoc Networking Workshop, 2018

Shifting the Phase Transition Threshold for Random Graphs Using Degree Set Constraints.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Threshold functions for small subgraphs: an analytic approach.
Electron. Notes Discret. Math., 2017

Shifting the Phase Transition Threshold for Random Graphs and 2-SAT using Degree Constraints.
CoRR, 2017

Isolated cycles of critical random graphs.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

The Maximum Block Size of Critical Random Graphs.
CoRR, 2016

Time-Optimal and Energy-Efficient Size Approximation of Radio Networks.
Proceedings of the International Conference on Distributed Computing in Sensor Systems, 2016

Analytic description of the phase transition of inhomogeneous multigraphs.
Eur. J. Comb., 2015

Analysis of an Exhaustive Search Algorithm in Random Graphs and the n<sup>clog n</sup>-Asymptotics.
SIAM J. Discret. Math., 2014

Analysis of an exhaustive search algorithm in random graphs and the n<sup>c log n</sup>-asymptotics.
CoRR, 2012

The MAX-CUT of sparse random graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks.
IEEE Trans. Mob. Comput., 2011

Random 2 XORSAT Phase Transition.
Algorithmica, 2011

Birth and growth of multicyclic components in random hypergraphs.
Theor. Comput. Sci., 2010

Cooperative training for high density sensor and actor networks.
IEEE J. Sel. Areas Commun., 2010

Minimum sum edge colorings of multicycles.
Discret. Appl. Math., 2010

Limit Theorems for Random MAX-2-XORSAT.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Cooperative Training in Wireless Sensor and Actor Networks.
Proceedings of the Quality of Service in Heterogeneous Networks, 2009

Chromatic Edge Strength of Some Multigraphs.
Electron. Notes Discret. Math., 2008

Efficient binary schemes for training heterogeneous sensor and actor networks.
Proceedings of the 1st ACM International Workshop on Heterogeneous Sensor and Actor Networks, 2008

Random 2-XORSAT at the Satisfiability Threshold.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Limit Theorems for Degree of Coverage and Lifetime in Large Sensor Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Optimal Initialization and Gossiping Algorithms for Random Radio Networks.
IEEE Trans. Parallel Distributed Syst., 2007

Another proof of Wright's inequalities.
Inf. Process. Lett., 2007

Quasi-optimal energy-efficient leader election algorithms in radio networks.
Inf. Comput., 2007

Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
CoRR, 2006

A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
CoRR, 2006

The Average Size of Giant Components between the Double-Jump.
Algorithmica, 2006

An energy-efficient initialization algorithm for random radio networks.
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

Creation and Growth of Components in a Random Hypergraph Process.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Distributed k-Clustering Algorithms for Random Wireless Multihop Networks.
Proceedings of the Networking, 2005

Randomized Initialization of a Wireless Multihop Network.
Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005

Extremal Properties of Three-Dimensional Sensor Networks with Applications.
IEEE Trans. Mob. Comput., 2004

Forbidden subgraphs in connected graphs.
Theor. Comput. Sci., 2004

Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
CoRR, 2004

A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks.
Proceedings of the Mobile and Wireless Communication Networks, 2004

Assigning Codes in a Random Wireless Network.
Proceedings of the Telecommunications and Networking, 2004

Average case analysis-based protocols to initialize packet radio networks.
Wirel. Commun. Mob. Comput., 2003

Asymptotic enumeration of cographs.
Electron. Notes Discret. Math., 2001

On the growth of components with non-fixed excesses.
Electron. Notes Discret. Math., 2001

Patchworks and metablocks enumeration.
Inf. Process. Lett., 2000

Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000