Publications of Dorian Mazauric
BACK TO COATI PUBLICATION INDEX
Publications of Dorian Mazauric
-
F. Giroire and D. Mazauric, editors.
11es Journées Doctorales en Informatique et Réseaux (JDIR 2010),
number 11,
Sophia Antipolis, France,
March 2010.
Mascotte, INRIA, I3S(CNRS / Univ. of Nice-Sophia).
[WWW
] [bibtex-entry]
-
D. Mazauric.
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.
PhD thesis,
Ecole doctorale STIC, Université de Nice Sophia-Antipolis,
November 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Algorithmica,
82(10):2867-2901,
2020.
[WWW
] [PDF
]
Keywords:
Complexity,
Metric dimension,
Games in graphs.
[bibtex-entry]
-
Jean-Claude Bermond,
Dorian Mazauric,
Vishal Misra,
and Philippe Nain.
Distributed Link Scheduling in Wireless Networks.
Discrete Mathematics, Algorithms and Applications,
12(5):1-38,
2020.
[WWW
] [PDF
]
Keywords:
Stability,
Distributed algorithm,
Wireless network,
Link scheduling algorithm,
Binary interference,
Graph.
[bibtex-entry]
-
Jean-Claude Bermond,
Augustin Chaintreau,
Guillaume Ducoffe,
and Dorian Mazauric.
How long does it take for all users in a social network to choose their communities?.
Discrete Applied Mathematics,
270:37-57,
2019.
[WWW
] [PDF
]
Keywords:
graphs,
communities,
social networks,
algorithms,
integer partitions,
coloring games.
[bibtex-entry]
-
Nathann Cohen,
Frédéric Havet,
Dorian Mazauric,
Ignasi Sau,
and Rémi Watrigant.
Complexity dichotomies for the Minimum F -Overlay problem.
Journal of Discrete Algorithms,
52-53:133-142,
September 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Alain Jean-Marie,
Dorian Mazauric,
and Joseph Yu.
Well Balanced Designs for Data Placement.
Journal of Combinatorial Designs,
24(2):55-76,
February 2016.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth.
ACM Journal of Experimental Algorithmics,
21(1):23,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
Frédéric Giroire,
Ioannis Lamprou,
Dorian Mazauric,
Nicolas Nisse,
Stéphane Pérennes,
and Ronan Soares.
Connected Surveillance Game.
Journal of Theoretical Computer Science (TCS),
584:131-143,
June 2015.
[WWW
] [PDF
]
Keywords:
Surveillance game,
Cops and robber games,
Prefetching,
Online strategy,
Competitive ratio,
Cost of connectivity.
[Abstract] [bibtex-entry]
-
Fedor V. Fomin,
Frédéric Giroire,
Alain Jean-Marie,
Dorian Mazauric,
and Nicolas Nisse.
To satisfy impatient Web surfers is hard.
Journal of Theoretical Computer Science (TCS),
526:1-17,
March 2014.
[WWW
] [PDF
] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Study of Different Placement Policies.
Peer-to-Peer Networking and Applications,
March 2013.
[WWW
] [PDF
] [bibtex-entry]
-
J. Araujo,
J-C. Bermond,
F. Giroire,
F. Havet,
D. Mazauric,
and R. Modrzejewski.
Weighted improper colouring.
Journal of Discrete Algorithms,
16:53-66,
2012.
Note: Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011).
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
A Distributed Algorithm for Computing the Node Search Number in Trees.
Algorithmica,
63(1-2):158-190,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
and J. Moulierac.
Energy Efficient Routing by Switching-Off Network Interfaces,
chapter 10 - Energy-Aware Systems and Networking for Sustainable Initiatives,
pages 207-236.
IGI Global,
june 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
Theoretical Computer Science (TCS),
412(35):4675-4687,
August 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
Frédéric Havet,
Dorian Mazauric,
Viet-Ha Nguyen,
and Rémi Watrigant.
Overlaying a hypergraph with a graph with bounded maximum degree.
In CALDAM 2020 - 6th Annual International Conference on Algorithms and Discrete Applied Mathematics,
Hyderabad, India,
February 2020.
[WWW
] [PDF
] [bibtex-entry]
-
Frédéric Havet,
Dorian Mazauric,
Viet-Ha Nguyen,
and Rémi Watrigant.
Overlaying a hypergraph with a graph with bounded maximum degree.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
September 2020.
[WWW
] [PDF
]
Keywords:
biologie structurale computationnelle,
hypergraphes,
graphes,
algorithmes,
complexité.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
In 16th Workshop on Approximation and Online Algorithms (WAOA 2018),
Helsinki, Finland,
August 2018.
[WWW
] [PDF
]
Keywords:
metric dimension,
Games in graphs,
complexity.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Localiser une cible dans un graphe.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Mots-clefs : Graphes,
Dimension Métrique,
Dimension Centro¨idaleCentro¨idale,
Jeux dans les graphes.
[bibtex-entry]
-
Jean-Claude Bermond,
Augustin Chaintreau,
Guillaume Ducoffe,
and Dorian Mazauric.
How long does it take for all users in a social network to choose their communities?.
In 9th International Conference on Fun with Algorithms (FUN 2018),
La Maddalena, Italy,
2018.
[WWW
] [PDF
]
Keywords:
graphs,
communities,
social networks,
integer partitions,
coloring games.
[bibtex-entry]
-
Nathann Cohen,
Frédéric Havet,
Dorian Mazauric,
Ignasi Sau,
and Rémi Watrigant.
Complexity Dichotomies for the Minimum $F$-Overlay Problem.
In IWOCA: International Workshop on Combinatorial Algorithms,
Newcastle, Australia,
pages 12,
July 2017.
[WWW
] [PDF
]
Keywords:
Fixed-parameter tractability,
Hypergraph,
Minimum F-Overlay Problem,
NP-completeness.
[bibtex-entry]
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth.
In 13th International Symposium on Experimental Algorithms,
volume 8504 of Lecture Notes in Computer Science,
Copenhagen, Denmark,
pages 46-58,
2014.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
N. Nisse,
S. Pérennes,
and R. Soares.
Connected Surveillance Game.
In 20th Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume LNCS 8179 of Lecture Notes in Computer Science (LNCS),
Ischia, Italy,
pages pages 68-79,
2013.
Springer.
[WWW
] [PDF
] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
Satisfaire un internaute impatient est difficile.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 79-82,
2012.
Note: Best paper.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
In 6th International Conference on FUN with Algorithms (FUN),
volume 7288,
pages 166-176,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
J-C. Bermond,
F. Giroire,
F. Havet,
D. Mazauric,
and R. Modrzejewski.
Weighted Improper Colouring.
In C. S. Iliopoulos and W. F. Smyth, editors,
Combinatorial Algorithms,
volume 7056 of Lecture Notes in Computer Science,
Victoria, Canada,
pages 1-18,
June 2011.
Springer Berlin Heidelberg.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration avec contraintes physiques dans les réseaux WDM.
In Ducourthial et Bertrand et Felber et Pascal, editor,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
and J. Moulierac.
Routage efficace en énergie.
In Ducourthial et Bertrand et Felber et Pascal, editor,
13es Rencontres Francophones sur les Aspects
Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Mazauric,
V. Misra,
and P. Nain.
A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference.
In SIGMETRICS 2010,
pages 2p,
2010.
ACM.
[PDF
] [Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
Data Life Time for Different Placement Policies in P2P Storage Systems.
In Proceedings of the 3rd Intl. Conference on Data Management in Grid and P2P Systems (Globe),
volume 6265 of Lecture Notes in Computer Science,
Bilbao, Spain,
pages 75--88,
September 2010.
[PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in routing reconfiguration problems.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
In P. Boldi and L. Gargano, editors,
Fifth International conference on Fun with Algorithms (FUN 2010),
volume 6099 of Lecture Notes in Computer Science,
Ischia Island, Italy,
pages 121-132,
June 2010.
Springer.
Note: Http://hal.inria.fr/inria-00495443.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Giabbanelli,
D. Mazauric,
and J-C. Bermond.
Average path length of deterministic and stochastics recursive networks.
In Proceedings of the 2nd Workshop on Complex Networks (CompleNet),
volume 116 of Communications in Computer and Information Science (CCIS),
pages 1--12,
2010.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
P. Giabbanelli,
D. Mazauric,
and S. Pérennes.
Computing the average path length and a label-based routing in a small-world graph.
In 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'10),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
Recursive graph,
Labeling scheme,
Decentralized routing.
[Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
J. Moulierac,
and B. Onfroy.
Minimizing Routing Energy Consumption: from Theoretical to Practical Results.
In IEEE/ACM International Conference on Green Computing and Communications (GreenCom'10),
Hangzhou, China,
pages 8,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Mazauric,
and P. Nain.
Algorithmes distribués d'ordonnancement dans les réseaux sans-fil.
In 10èmes Journées Doctorales en Informatique et Réseaux (JDIR),
Belfort, France,
February 2009.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration dans les réseaux optiques.
In A. Chaintreau and C. Magnien, editors,
11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09),
Carry le Rouet,
pages 4p,
June 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration of the Routing in WDM Networks with Two Classes of Services.
In 13th Conference on Optical Network Design and Modeling (ONDM),
Braunschweig, Germany,
pages 6p,
February 2009.
IEEE.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert,
D. Mazauric,
and N. Nisse.
On Rerouting Connection Requests in Networks with Shared Bandwidth.
In DIMAP workshop on Algorithmic Graph Theory (AGT09),
volume 32 of Electronic Notes in Discrete Mathematics,
Warwick, UK,
pages 109-116,
March 2009.
Elsevier.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
Computing and updating the process number in trees (short paper).
In T. Baker and S. Tixeuil, editors,
12th International Conference On Principles Of DIstributed Systems (OPODIS),
volume 5401 of Lecture Notes in Computer Science,
Luxor, Egypt,
pages 546-550,
December 2008.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
A distributed algorithm for computing and updating the process number of a forest (brief announcement).
In G. Taubenfeld, editor,
22nd International Symposium on Distributed Computing (DISC),
volume 5218 of Lecture Notes in Computer Science,
Arcachon, France,
pages 500-501,
September 2008.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
Algorithme générique pour les jeux de capture dans les arbres.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
Saint-Malo,
pages 37--40,
May 2008.
[PDF
] [Abstract] [bibtex-entry]
-
Frédéric Havet,
Dorian Mazauric,
and Viet-Ha Nguyen.
On the complexity of overlaying a hypergraph with a graph with bounded maximum degree.
Research Report,
Inria ; CNRS ; I3S ; Université Côte d'Azur,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Frédéric Havet,
Dorian Mazauric,
Viet-Ha Nguyen,
and Rémi Watrigant.
Overlaying a hypergraph with a graph with bounded maximum degree.
Research Report RR-9258,
Inria Sophia Antipolis,
February 2019.
[WWW
] [PDF
]
Keywords:
computational structural biology,
Hypergraph,
graph,
algorithm,
complexity,
Hypergraphe,
graphe,
algorithme,
complexité,
biologie structurale computation-nelle.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Research Report,
Inria,
2018.
[WWW
] [PDF
]
Keywords:
complexity,
Metric dimension,
Games in graphs.
[bibtex-entry]
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth.
Research Report RR-8470,
INRIA,
February 2014.
[WWW
] [PDF
]
Keywords:
Pathwidth,
vertex-separation,
branch-and-bound,
Sage.
[bibtex-entry]
-
F. Giroire,
D. Mazauric,
N. Nisse,
S. Pérennes,
and R. Pardo Soares.
Connected Surveillance Game.
Research Report RR-8297,
INRIA,
May 2013.
[WWW
] [PDF
] [bibtex-entry]
-
J. Araujo,
J-C. Bermond,
F. Giroire,
F. Havet,
D. Mazauric,
and R. Modrzejewski.
Weighted Improper Colouring.
Research Report RR-7590,
INRIA,
04 2011.
[WWW
] [PDF
]
Keywords:
graph colouring,
improper colouring,
grids,
integer programming,
algorithms.
[Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration with physical constraints in WDM networks.
Research Report RR-7850,
INRIA,
2011.
[WWW
] [PDF
]
Keywords:
Reconfiguration,
WDM,
NP-complete,
Physical Layer Impaiments..
[Abstract] [bibtex-entry]
-
J-C. Bermond,
A. Jean-Marie,
D. Mazauric,
and M-L. Yu.
Well Balanced Designs for Data Placement.
Research Report 7725,
INRIA,
09 2011.
[WWW
] [Abstract] [bibtex-entry]
-
F. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
Technical report RR-7740,
INRIA,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
Research Report RR-7209,
INRIA,
February 2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
data life time,
mean time to data loss,
performance evaluation,
Markov chains.
[Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
J. Moulierac,
and B. Onfroy.
Minimizing Routing Energy Consumption: from Theoretical to Practical Results.
Research Report inria-00464318,
May 2010.
[WWW
] [PDF
]
Keywords:
power consumption,
energy-efficient routing,
graphs,
linear programming.
[Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks..
Technical report RR-7047,
INRIA,
September 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
D. Mazauric,
and N. Nisse.
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth..
Technical report RR-6790,
INRIA,
January 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Mazauric,
V. Misra,
and P. Nain.
Distributed Call Scheduling in Wireless Networks.
Technical report RR-6763,
INRIA,
December 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services.
Research Report RR-6698,
INRIA,
October 2008.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
A distributed algorithm for computing and updating the process number of a forest.
Research Report RR-6560,
INRIA,
June 2008.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert and D. Mazauric.
Network Reconfiguration using Cops-and-Robber Games.
Research Report RR-6694,
INRIA,
August 2008.
[WWW
] [Abstract] [bibtex-entry]
-
D. Mazauric.
Conception et analyse d'algorithmes distribués d'ordonnancement des transmissions dans les réseaux sans-fil,
September 2008.
Note: Internship report.
[PDF
] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:45 2022
