Computing and Updating the Process Number in Trees. - David Coudert; Florian Huc; Dorian Mazauric (OPODIS, 2008)

A Distributed Algorithm for Computing and Updating the Process Number of a Forest. - David Coudert; Florian Huc; Dorian Mazauric (DISC, 2008)

On Rerouting Connection Requests in Networks with Shared Bandwidth. - David Coudert; Dorian Mazauric; Nicolas Nisse (Electron. Notes Discret. Math., 2009)

On the Average Path Length of Deterministic and Stochastics Recursive Networks. - Philippe J. Giabbanelli; Dorian Mazauric; Jean-Claude Bermond (CompleNet, 2010)

Data Life Time for Different Placement Policies in P2P Storage Systems. - Stéphane Caron; Frédéric Giroire; Dorian Mazauric; Julian Monteiro; Stéphane Pérennes (Globe, 2010)

Minimizing Routing Energy Consumption: From Theoretical to Practical Results. - Frédéric Giroire; Dorian Mazauric; Joanna Moulierac; Brice Onfroy (GreenCom/CPSCom, 2010)

A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference. - Jean-Claude Bermond; Dorian Mazauric; Vishal Misra; Philippe Nain (SIGMETRICS, 2010)

Tradeoffs in process strategy games with application in the WDM reconfiguration problem. - Nathann Cohen; David Coudert; Dorian Mazauric; Napoleão Nepomuceno; Nicolas Nisse (Theor. Comput. Sci., 2011)

Optimisation discrète dans les réseaux de télécommunication : reconfiguration du routage, routage efficace en énergie, ordonnancement de liens et placement de données. (Discrete optimization in telecommunication networks: reconfiguration of the routing, energy efficient routing, link scheduling, and data placement). - Dorian Mazauric (2011)

Reconfiguration with physical constraints in WDM networks. - Sonia Belhareth; David Coudert; Dorian Mazauric; Nicolas Nisse; Issam Tahiri (ICC, 2012)

A Distributed Algorithm for Computing the Node Search Number in Trees. - David Coudert; Florian Huc; Dorian Mazauric (Algorithmica, 2012)

Convergence of Coloring Games with Collusions - Guillaume Ducoffe; Dorian Mazauric; Augustin Chaintreau (CoRR, 2012)

Weighted improper colouring. - Júlio Araújo 001; Jean-Claude Bermond; Frédéric Giroire; Frédéric Havet; Dorian Mazauric; Remigiusz Modrzejewski (J. Discrete Algorithms, 2012)

Computational analysis of cascading failures in power networks. - Dorian Mazauric; Saleh Soltan; Gil Zussman (SIGMETRICS, 2013)

Connected Surveillance Game. - Frédéric Giroire; Dorian Mazauric; Nicolas Nisse; Stéphane Pérennes; Ronan Pardo Soares (SIROCCO, 2013)

Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard. - Emmanuel Godard; Dorian Mazauric (ALGOSENSORS, 2014)

Cascading failures in power grids: analysis and algorithms. - Saleh Soltan; Dorian Mazauric; Gil Zussman (e-Energy, 2014)

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth. - David Coudert; Dorian Mazauric; Nicolas Nisse (SEA, 2014)

Energy Efficient Routing by Switching-Off Network Interfaces. - Frédéric Giroire; Dorian Mazauric; Joanna Moulierac (CoRR, 2014)

P2P storage systems: Study of different placement policies. - Stéphane Caron; Frédéric Giroire; Dorian Mazauric; Julian Monteiro; Stéphane Pérennes (Peer-to-Peer Netw. Appl., 2014)

To satisfy impatient Web surfers is hard. - Fedor V. Fomin; Frédéric Giroire; Alain Jean-Marie; Dorian Mazauric; Nicolas Nisse (Theor. Comput. Sci., 2014)

Conformational ensembles and sampled energy landscapes: Analysis and comparison. - Frédéric Cazals; Tom Dreyfus; Dorian Mazauric; Christine-Andrea Roth; Charles H. Robert (J. Comput. Chem., 2015)

Connected surveillance game. - Frédéric Giroire; Ioannis Lamprou 001; Dorian Mazauric; Nicolas Nisse; Stéphane Pérennes; R. Soares 001 (Theor. Comput. Sci., 2015)

Extracting the Core Structural Connectivity Network: Guaranteeing Network Connectedness Through a Graph-Theoretical Approach. - Demian Wassermann; Dorian Mazauric; Guillermo Gallardo-Diez; Rachid Deriche (MICCAI (1), 2016)

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. - David Coudert; Dorian Mazauric; Nicolas Nisse (ACM J. Exp. Algorithmics, 2016)

On the complexity of the representation of simplicial complexes by trees. - Jean-Daniel Boissonnat; Dorian Mazauric (Theor. Comput. Sci., 2016)

Extracting the Groupwise Core Structural Connectivity Network: Bridging Statistical and Graph-Theoretical Approaches. - Nahuel Lascano; Guillermo Gallardo-Diez; Rachid Deriche; Dorian Mazauric; Demian Wassermann (IPMI, 2017)

Complexity Dichotomies for the Minimum ℱ -Overlay Problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (IWOCA, 2017)

Analysis of Failures in Power Grids. - Saleh Soltan; Dorian Mazauric; Gil Zussman (IEEE Trans. Control. Netw. Syst., 2017)

Maximum flow under proportional delay constraint. - Pierre Bonami; Dorian Mazauric; Yann Vaxès (Theor. Comput. Sci., 2017)

Complexity dichotomies for the MinimumF-Overlay problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (J. Discrete Algorithms, 2018)

How long does it take for all users in a social network to choose their communities? - Jean-Claude Bermond; Augustin Chaintreau; Guillaume Ducoffe; Dorian Mazauric (Discret. Appl. Math., 2019)

Comparing Two Clusterings Using Matchings between Clusters of Clusters. - Frédéric Cazals; Dorian Mazauric; Romain Tetley; Rémi Watrigant (ACM J. Exp. Algorithmics, 2019)

Sequential Metric Dimension. - Julien Bensmail; Dorian Mazauric; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2020)

Distributed link scheduling in wireless networks. - Jean-Claude Bermond; Dorian Mazauric; Vishal Misra; Philippe Nain (Discret. Math. Algorithms Appl., 2020)

Algorithmique des graphes pour les réseaux et la biologie structurale computationnelle. (Graph Algorithm Techniques for Networks and Computational Structural Biology). - Dorian Mazauric (2021)

From print to online newspapers on small displays: a layout generation approach aimed at preserving entry points. - Sebastián Gallardo Díaz; Dorian Mazauric; Pierre Kornprobst (DocEng, 2022)

Overlaying a hypergraph with a graph with bounded maximum degree. - Frédéric Havet; Dorian Mazauric; Viet-Ha Nguyen 004; Rémi Watrigant (Discret. Appl. Math., 2022)

Non-Existence of Stable Social Groups in Information-Driven Networks. - Augustin Chaintreau; Guillaume Ducoffe; Dorian Mazauric (Theory Comput. Syst., 2022)