Publications of Pierre Fraigniaud
BACK TO COATI PUBLICATION INDEX
Publications of Pierre Fraigniaud
-
Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse,
and Dimitrios M. Thilikos.
Forewords: Special issue on Theory and Applications of Graph Searching Problems,
volume 655:1 of Theoretical Computer Science - Special Issue on Theory and Applications of Graph Searching Problems.
December 2016.
[WWW
] [bibtex-entry]
-
Fedor Fomin,
Pierre Fraigniaud,
Nicolas Nisse,
and Dimitrios M. M. Thilikos.
Report on GRASTA 2014.
2014.
[WWW
] [PDF
] [bibtex-entry]
-
S. Akl,
A. Ferreira,
P. Fraigniaud,
and D. Sotteau, editors.
Parallel Processing Letters -- Special Issue on Algorithmic and Structural Aspects of Interconnection Networks.
World Publisher Co.,
1994.
[bibtex-entry]
-
Pierre Fraigniaud and Emanuele Natale.
Noisy rumor spreading and plurality consensus.
Distributed Computing,
32(4):257-276,
2019.
[WWW
] [PDF
]
Keywords:
Noise,
Biological distributed algorithms,
PUSH model,
Plurality consensus,
Rumor spreading.
[bibtex-entry]
-
Pierre Fraigniaud and Emanuele Natale.
Noisy rumor spreading and plurality consensus.
Distributed Computing,
June 2018.
[WWW
] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Information and Computation,
219:1-16,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica,
53(3):358-373,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Distributed chasing of network intruders.
Theoretical Computer Science,
399(1-2):12-37,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Monotony Properties of Connected Visible Graph Searching.
Information and Computation,
206(12):1383-1393,
2008.
[Abstract] [bibtex-entry]
-
P. Fraigniaud,
A. Pelc,
D. Peleg,
and S. Pérennes.
Assigning labels in unknown network with a leader.
Distributed Computing,
14(3):163--183,
2001.
[bibtex-entry]
-
J-C. Bermond,
P. Fraigniaud,
and J.G. Peters.
Antepenultimate Broadcasting.
Networks,
26(3):125--137,
1995.
[bibtex-entry]
-
J-C. Bermond and P. Fraigniaud.
Broadcasting and Gossiping in de Bruijn Networks.
SIAM Journal on Computing,
23(1):212--225,
1994.
[bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Distributed Chasing of Network Intruders.
In Proceeding of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 4056 of Lecture Notes in Computer Science,
Chester, UK,
pages 70-84,
July 2006.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Encerclement réparti d'un fugitif dans un réseau par des agents mobiles..
In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 89-92,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Strategies d'encerclement non deterministes.
In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 81-84,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Connected Treewidth and Connected Graph Searching.
In Proceeding of the 7th Latin American Symposium on Theoretical Informatics (LATIN),
pages 479-490,
2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Monotony Properties of Connected Visible Graph Searching.
In Proceedings of 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 5911 of Lecture Notes in Computer Science,
Montpellier, France,
pages 229-240,
June 2006.
Springer.
[Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS),
pages 364-375,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Stratégies d'encerclement connexes dans un réseau.
In 7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 13-16,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud,
A. Pelc,
D. Peleg,
and S. Pérennes.
Assigning labels in unknown anonymous networks.
In Proceedings of PODC 2000, (Nineteenth Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING),
pages 101--112,
2000.
[bibtex-entry]
-
J-C. Bermond and P. Fraigniaud.
Broadcasting and NP-Completeness.
In Graph Theory Notes of New York,
volume XXII,
pages 8--14,
1992.
[PDF
] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. V. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Research Report 7363,
INRIA,
August 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:44 2022
