Dantas, Rennan; Havet, Frédéric; Sampaio, Rudini M. Minimum density of identifying codes of king grids. (English) Zbl 1393.05253 Discrete Math. 341, No. 10, 2708-2719 (2018). MSC: 05C99 05C76 94B99 05B40 PDFBibTeX XMLCite \textit{R. Dantas} et al., Discrete Math. 341, No. 10, 2708--2719 (2018; Zbl 1393.05253) Full Text: DOI HAL
Cohen, Nathann; Havet, Frédéric On the minimum size of an identifying code over all orientations of a graph. (English) Zbl 1392.05105 Electron. J. Comb. 25, No. 1, Research Paper P1.49, 23 p. (2018). MSC: 05C85 05C69 68Q17 PDFBibTeX XMLCite \textit{N. Cohen} and \textit{F. Havet}, Electron. J. Comb. 25, No. 1, Research Paper P1.49, 23 p. (2018; Zbl 1392.05105) Full Text: Link
Dantas, Rennan; Sampaio, Rudini M.; Havet, Frédéric Minimum density of identifying codes of king grids. (English) Zbl 1383.05184 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 51-56 (2017). MSC: 05C42 05C76 PDFBibTeX XMLCite \textit{R. Dantas} et al., Electron. Notes Discrete Math. 62, 51--56 (2017; Zbl 1383.05184) Full Text: DOI HAL
Bouznif, Marwane; Havet, Frédéric; Preissmann, Myriam Minimum-density identifying codes in square grids. (English) Zbl 1477.68206 Dondi, Riccardo (ed.) et al., Algorithmic aspects in information and management. 11th international conference, AAIM 2016, Bergamo, Italy, July 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9778, 77-88 (2016). MSC: 68R10 05C12 05C42 PDFBibTeX XMLCite \textit{M. Bouznif} et al., Lect. Notes Comput. Sci. 9778, 77--88 (2016; Zbl 1477.68206) Full Text: DOI HAL
Havet, Frédéric; Thomassé, Stéphan Median orders of tournaments: A tool for the second neighborhood problem and Sumner’s conjecture. (English) Zbl 0969.05029 J. Graph Theory 35, No. 4, 244-256 (2000). Reviewer: Matúš Harminc (Košice) MSC: 05C20 PDFBibTeX XMLCite \textit{F. Havet} and \textit{S. Thomassé}, J. Graph Theory 35, No. 4, 244--256 (2000; Zbl 0969.05029) Full Text: DOI