Dorian Mazauric

Orcid: 0000-0002-5589-1889

According to our database1, Dorian Mazauric authored at least 39 papers between 2008 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Non-Existence of Stable Social Groups in Information-Driven Networks.
Theory Comput. Syst., 2022

Overlaying a hypergraph with a graph with bounded maximum degree.
Discret. Appl. Math., 2022

From print to online newspapers on small displays: a layout generation approach aimed at preserving entry points.
Proceedings of the 22nd ACM Symposium on Document Engineering, 2022

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

2020
Distributed link scheduling in wireless networks.
Discret. Math. Algorithms Appl., 2020

Sequential Metric Dimension.
Algorithmica, 2020

2019
Comparing Two Clusterings Using Matchings between Clusters of Clusters.
ACM J. Exp. Algorithmics, 2019

How long does it take for all users in a social network to choose their communities?
Discret. Appl. Math., 2019

2018
Complexity dichotomies for the MinimumF-Overlay problem.
J. Discrete Algorithms, 2018

2017
Maximum flow under proportional delay constraint.
Theor. Comput. Sci., 2017

Analysis of Failures in Power Grids.
IEEE Trans. Control. Netw. Syst., 2017

Complexity Dichotomies for the Minimum ℱ -Overlay Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Extracting the Groupwise Core Structural Connectivity Network: Bridging Statistical and Graph-Theoretical Approaches.
Proceedings of the Information Processing in Medical Imaging, 2017

2016
On the complexity of the representation of simplicial complexes by trees.
Theor. Comput. Sci., 2016

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth.
ACM J. Exp. Algorithmics, 2016

Extracting the Core Structural Connectivity Network: Guaranteeing Network Connectedness Through a Graph-Theoretical Approach.
Proceedings of the Medical Image Computing and Computer-Assisted Intervention - MICCAI 2016, 2016

2015
Connected surveillance game.
Theor. Comput. Sci., 2015

Conformational ensembles and sampled energy landscapes: Analysis and comparison.
J. Comput. Chem., 2015

2014
To satisfy impatient Web surfers is hard.
Theor. Comput. Sci., 2014

P2P storage systems: Study of different placement policies.
Peer-to-Peer Netw. Appl., 2014

Energy Efficient Routing by Switching-Off Network Interfaces.
CoRR, 2014

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Cascading failures in power grids: analysis and algorithms.
Proceedings of the Fifth International Conference on Future Energy Systems, 2014

Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
Connected Surveillance Game.
Proceedings of the Structural Information and Communication Complexity, 2013

Computational analysis of cascading failures in power networks.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

2012
Weighted improper colouring.
J. Discrete Algorithms, 2012

Convergence of Coloring Games with Collusions
CoRR, 2012

A Distributed Algorithm for Computing the Node Search Number in Trees.
Algorithmica, 2012

Reconfiguration with physical constraints in WDM networks.
Proceedings of IEEE International Conference on Communications, 2012

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).
PhD thesis, 2011

Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
Theor. Comput. Sci., 2011

2010
A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference.
Proceedings of the SIGMETRICS 2010, 2010

Minimizing Routing Energy Consumption: From Theoretical to Practical Results.
Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications, 2010

Data Life Time for Different Placement Policies in P2P Storage Systems.
Proceedings of the Data Management in Grid and Peer-to-Peer Systmes, 2010

On the Average Path Length of Deterministic and Stochastics Recursive Networks.
Proceedings of the Complex Networks - Second International Workshop, 2010

2009
On Rerouting Connection Requests in Networks with Shared Bandwidth.
Electron. Notes Discret. Math., 2009

2008
A Distributed Algorithm for Computing and Updating the Process Number of a Forest.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Computing and Updating the Process Number in Trees.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008


  Loading...