| 2016 | OPODIS | Design Patterns in Beeping Algorithms. | Arnaud Casteigts, Yves Mtivier, John Michael Robson, Akka Zemmari |
| 2014 | SOFSEM | On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). | Allyx Fontaine, Yves Mtivier, John Michael Robson, Akka Zemmari |
| 2013 | SIROCCO | Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). | Yves Mtivier, John Michael Robson, Akka Zemmari |
| 2012 | SIROCCO | On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). | Jrmie Chalopin, Yves Mtivier, Thomas Morsellino |
| 2009 | OPODIS | Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. | Yves Mtivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari |
| 2009 | SIROCCO | An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). | Yves Mtivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari |
| 2008 | AICCSA | Electing a leader in the local computation model using mobile agents. | Med Amine Haddar, Ahmed Hadj Kacem, Yves Mtivier, Mohamed Mosbah, Mohamed Jmaiel |
| 2008 | ICDCN | Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks. | Med Amine Haddar, Ahmed Hadj Kacem, Yves Mtivier, Mohamed Mosbah, Mohamed Jmaiel |
| 2007 | PRIMA | A Distributed Computational Model for Mobile Agents. | Med Amine Haddar, Ahmed Hadj Kacem, Yves Mtivier, Mohamed Mosbah, Mohamed Jmaiel |
| 2007 | SOFSEM | About the Termination Detection in the Asynchronous Message Passing Model. | Jrmie Chalopin, Emmanuel Godard, Yves Mtivier, Gerard Tel |
| 2006 | OPODIS | Mobile Agent Algorithms Versus Message Passing Algorithms. | Jrmie Chalopin, Emmanuel Godard, Yves Mtivier, Rodrigue Ossamy |
| 2005 | MFCS | A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. | Jrmie Chalopin, Yves Mtivier |
| 2004 | FOSSACS | Election and Local Computations on Edges. | Jrmie Chalopin, Yves Mtivier |
| 2003 | SIROCCO | A uniform randomized election in trees. | Yves Mtivier, Nasser Saheb-Djahromi, Akka Zemmari |
| 2002 | FOSSACS | A Characterization of Families of Graphs in Which Election Is Possible. | Emmanuel Godard, Yves Mtivier |
| 2002 | SIROCCO | Equivalence of Structural Knowledges in Distributed Algorithms. | Emmanuel Godard, Yves Mtivier |
| 2001 | OPODIS | A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph. | Yves Mtivier, Mohamed Mosbah, Pierre-Andr Wacrenier, Stefan Gruner |
| 2001 | SIROCCO | A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. | Emmanuel Godard, Yves Mtivier |
| 2000 | SIROCCO | Termination detection and universal graph reconstruction. | Yves Mtivier, Gerard Tel |
| 1998 | FOSSACS | Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. | Anne Bottreau, Yves Mtivier |
| 1997 | SIROCCO | About the local detection of termination of local computations in graphs. | Yves Mtivier, Anca Muscholl, Pierre-Andr Wacrenier |
| 1995 | ICALP | Computing the Closure of Sets of Words Under Partial Commutations. | Yves Mtivier, Gwnal Richomme, Pierre-Andr Wacrenier |
| 1994 | STACS | On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). | Yves Mtivier, Gwnal Richomme |
| 1992 | MFCS | Definitions and Comparisons of Local Computations on Graphs. | Igor Litovsky, Yves Mtivier, ric Sopena |
| 1992 | WG | The Power and the Limitations of Local Computations on Graphs. | Igor Litovsky, Yves Mtivier, Wieslaw Zielonka |
| 1989 | WG | Graph Rewriting Systems with Priorities. | Michel Billaud, Pierre Lafon, Yves Mtivier, ric Sopena |
| 1988 | ICALP | Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. | Robert Cori, Yves Mtivier |
| 1987 | ICALP | An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs. | Yves Mtivier |
| 1986 | ICALP | On Recognizable Subsets of Free Partially Commutative Monoids. | Yves Mtivier |