Skip to Main content Skip to Navigation

inria-00099529v1  Journal articles
Prosenjit BoseHazel EverettSteve Wismath. Properties of Arrangements Graphs
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (6), pp.447-462
inria-00099260v1  Reports
Hazel EverettC.T. HoangK. KilakosM. Noy. Distance segment visibility graphs
[Intern report] A00-R-429 || everett00b, 2000
inria-00103952v1  Conference papers
Otfried CheongHazel EverettSylvain LazardHyo-Sil KimRené Schott. Throwing stones in simple polygons
2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06), Jun 2006, Hong Kong, China, pp.185-193, ⟨10.1007/11775096_18⟩
inria-00100553v1  Book sections
Hazel EverettCelina M. H. de FigueiredoClaudia Linhares SalesFrédéric MaffrayOscar Porto et al.  Even Pairs
Jorge L. Ramirez Alfonsin et Bruce A. Reed. Perfect Graphs, John Wiley and Sons Ltd., 23 p, 2001, Wiley-Interscience Series in Discrete Mathematics and Optimization
inria-00100577v1  Conference papers
Hazel EverettCelina de FigueiredoSulamita KleinBruce Reed. Bull-Reducible Berge Graphs are Perfect
Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p
inria-00108058v1  Conference papers
Siu-Wing ChengOtfried CheongHazel EverettRene van Oostrum. Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons
ACM Symposium on Computational Geometry, Association for Computing Machinery, 1999, Miami Beach, Florida, USA, pp.227-236
inria-00099259v1  Journal articles
Hazel EverettC.T. HoangK. KilakosM. Noy. Planar segment visibility graphs
Computational Geometry, Elsevier, 2000, 16 (4), pp.235-243
inria-00098848v1  Journal articles
Hazel EverettFerran HurtadoMarc Noy. Stabbing information of a simple polygon
Discrete Applied Mathematics, Elsevier, 1999, 91 (1-3), pp.67-92