default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDorian Mazauric
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Frédéric Havet
, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a hypergraph with a graph with bounded maximum degree. Discret. Appl. Math. 319: 394-406 (2022)- [j18]Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
Non-Existence of Stable Social Groups in Information-Driven Networks. Theory Comput. Syst. 66(4): 758-777 (2022) - [c22]Sebastián Gallardo Díaz, Dorian Mazauric, Pierre Kornprobst:
From print to online newspapers on small displays: a layout generation approach aimed at preserving entry points. DocEng 2022: 5:1-5:4 - 2021
- [b2]Dorian Mazauric:
Algorithmique des graphes pour les réseaux et la biologie structurale computationnelle. (Graph Algorithm Techniques for Networks and Computational Structural Biology). University of Côte d'Azur, Nice, France, 2021 - 2020
- [j17]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. Algorithmica 82(10): 2867-2901 (2020) - [j16]Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, Philippe Nain:
Distributed link scheduling in wireless networks. Discret. Math. Algorithms Appl. 12(5): 2050058:1-2050058:43 (2020) - [c21]Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree. CALDAM 2020: 403-414
2010 – 2019
- 2019
- [j15]Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
How long does it take for all users in a social network to choose their communities? Discret. Appl. Math. 270: 37-57 (2019) - [j14]Frédéric Cazals, Dorian Mazauric, Romain Tetley, Rémi Watrigant:
Comparing Two Clusterings Using Matchings between Clusters of Clusters. ACM J. Exp. Algorithmics 24(1): 1.17:1-1.17:41 (2019) - 2018
- [j13]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018) - [c20]Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
How long does it take for all users in a social network to choose their communities?. FUN 2018: 6:1-6:21 - [c19]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. WAOA 2018: 36-50 - 2017
- [j12]Saleh Soltan, Dorian Mazauric, Gil Zussman:
Analysis of Failures in Power Grids. IEEE Trans. Control. Netw. Syst. 4(2): 288-300 (2017) - [j11]Pierre Bonami, Dorian Mazauric, Yann Vaxès:
Maximum flow under proportional delay constraint. Theor. Comput. Sci. 689: 58-66 (2017) - [c18]Nahuel Lascano, Guillermo Gallardo-Diez, Rachid Deriche, Dorian Mazauric, Demian Wassermann:
Extracting the Groupwise Core Structural Connectivity Network: Bridging Statistical and Graph-Theoretical Approaches. IPMI 2017: 373-384 - [c17]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA 2017: 116-127 - [i6]Nahuel Lascano, Guillermo Gallardo-Diez, Rachid Deriche, Dorian Mazauric, Demian Wassermann:
Extracting the Groupwise Core Structural Connectivity Network: Bridging Statistical and Graph-Theoretical Approaches. CoRR abs/1701.01311 (2017) - [i5]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR abs/1703.05156 (2017) - 2016
- [j10]David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM J. Exp. Algorithmics 21(1): 1.3:1-1.3:23 (2016) - [j9]Jean-Daniel Boissonnat, Dorian Mazauric:
On the complexity of the representation of simplicial complexes by trees. Theor. Comput. Sci. 617: 28-44 (2016) - [c16]Demian Wassermann, Dorian Mazauric, Guillermo Gallardo-Diez, Rachid Deriche:
Extracting the Core Structural Connectivity Network: Guaranteeing Network Connectedness Through a Graph-Theoretical Approach. MICCAI (1) 2016: 89-96 - 2015
- [j8]Frédéric Cazals, Tom Dreyfus, Dorian Mazauric, Christine-Andrea Roth, Charles H. Robert:
Conformational ensembles and sampled energy landscapes: Analysis and comparison. J. Comput. Chem. 36(16): 1213-1231 (2015) - [j7]Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, R. Soares:
Connected surveillance game. Theor. Comput. Sci. 584: 131-143 (2015) - 2014
- [j6]Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes:
P2P storage systems: Study of different placement policies. Peer-to-Peer Netw. Appl. 7(4): 427-443 (2014) - [j5]Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To satisfy impatient Web surfers is hard. Theor. Comput. Sci. 526: 1-17 (2014) - [c15]Emmanuel Godard, Dorian Mazauric:
Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard. ALGOSENSORS 2014: 88-102 - [c14]Saleh Soltan, Dorian Mazauric, Gil Zussman:
Cascading failures in power grids: analysis and algorithms. e-Energy 2014: 195-206 - [c13]David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth. SEA 2014: 46-58 - [i4]Saleh Soltan, Dorian Mazauric, Gil Zussman:
Cascading Failures in Power Grids - Analysis and Algorithms. CoRR abs/1402.1780 (2014) - [i3]Frédéric Giroire, Dorian Mazauric, Joanna Moulierac:
Energy Efficient Routing by Switching-Off Network Interfaces. CoRR abs/1410.1076 (2014) - 2013
- [c12]Dorian Mazauric, Saleh Soltan, Gil Zussman:
Computational analysis of cascading failures in power networks. SIGMETRICS 2013: 337-338 - [c11]Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares:
Connected Surveillance Game. SIROCCO 2013: 68-79 - 2012
- [j4]David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica 63(1-2): 158-190 (2012) - [j3]Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski:
Weighted improper colouring. J. Discrete Algorithms 16: 53-66 (2012) - [c10]Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To Satisfy Impatient Web Surfers Is Hard. FUN 2012: 166-176 - [c9]Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri:
Reconfiguration with physical constraints in WDM networks. ICC 2012: 6257-6261 - [i2]Guillaume Ducoffe, Dorian Mazauric, Augustin Chaintreau:
Convergence of Coloring Games with Collusions. CoRR abs/1212.3782 (2012) - 2011
- [b1]Dorian 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. (Discrete optimization in telecommunication networks: reconfiguration of the routing, energy efficient routing, link scheduling, and data placement). University of Nice Sophia Antipolis, France, 2011 - [j2]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theor. Comput. Sci. 412(35): 4675-4687 (2011) - [c8]Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski:
Weighted Improper Colouring. IWOCA 2011: 1-18 - 2010
- [c7]Philippe J. Giabbanelli, Dorian Mazauric, Jean-Claude Bermond:
On the Average Path Length of Deterministic and Stochastics Recursive Networks. CompleNet 2010: 1-12 - [c6]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem. FUN 2010: 121-132 - [c5]Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes:
Data Life Time for Different Placement Policies in P2P Storage Systems. Globe 2010: 75-88 - [c4]Frédéric Giroire, Dorian Mazauric, Joanna Moulierac, Brice Onfroy:
Minimizing Routing Energy Consumption: From Theoretical to Practical Results. GreenCom/CPSCom 2010: 252-259 - [c3]Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, Philippe Nain:
A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference. SIGMETRICS 2010: 345-346
2000 – 2009
- 2009
- [j1]David Coudert, Dorian Mazauric, Nicolas Nisse:
On Rerouting Connection Requests in Networks with Shared Bandwidth. Electron. Notes Discret. Math. 32: 109-116 (2009) - 2008
- [c2]David Coudert, Florian Huc, Dorian Mazauric:
Computing and Updating the Process Number in Trees. OPODIS 2008: 546-550 - [c1]David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing and Updating the Process Number of a Forest. DISC 2008: 500-501 - [i1]David Coudert, Florian Huc, Dorian Mazauric:
A distributed algorithm for computing and updating the process number of a forest. CoRR abs/0806.2710 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
