Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs, SODA, pp.377-391, 2016. ,
Scheduling split intervals, SIAM Journal on Computing, vol.36, issue.1, pp.1-15, 2006. ,
Decomposable searching problems, Information Processing Letters, vol.8, issue.5, pp.244-251, 1979. ,
An introduction to chordal graphs and clique trees, The IMA Volumes in Mathematics and its Applications, vol.56, pp.1-29, 1993. ,
, Graph theory, 2008.
Into the square: On the complexity of some quadratic-time solvable problems, Electronic Notes in Theoretical Computer Science, vol.322, pp.51-67, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01390131
Models of core/periphery structures, Social networks, vol.21, issue.4, pp.375-395, 2000. ,
Identifying codes in hereditary classes of graphs and VC-dimension, SIAM Journal on Discrete Mathematics, vol.29, issue.4, pp.2047-2064, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01038012
The algorithmic use of hypertree structure and maximum neighbourhood orderings, Discrete Applied Mathematics, vol.82, issue.1-3, pp.43-77, 1998. ,
Distance approximating trees for chordal and dually chordal graphs, Journal of Algorithms, vol.30, issue.1, pp.166-184, 1999. ,
Tree spanners on chordal graphs: complexity and algorithms, Theoretical Computer Science, vol.310, issue.1, pp.329-354, 2004. ,
Rooted directed path graphs are leaf powers, Discrete Mathematics, vol.310, issue.4, pp.897-910, 2010. ,
Multivariate analysis of orthogonal range searching and graph distances parameterized by treewidth, IPEC, 2018. ,
Quasi-optimal range searching in spaces of finite VC-dimension. Discrete & Computational Geometry, vol.4, pp.467-489, 1989. ,
Disjoint sets problem, 1992. ,
Diameter determination on restricted graph families, Discrete Applied Mathematics, vol.113, issue.2-3, pp.143-166, 2001. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00090363
Improved compact routing scheme for chordal graphs, International Symposium on Distributed Computing, pp.252-264, 2002. ,
Estimating all pairs shortest paths in restricted graph families: a unified approach, Journal of Algorithms, vol.57, issue.1, pp.1-21, 2005. ,
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters, 2nd Symposium on Simplicity in Algorithms, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01974190
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension, 2019. ,
Central limit theorems for empirical measures. The Annals of Probability, pp.899-929, 1978. ,
Characterizations of strongly chordal graphs, Discrete Mathematics, vol.43, issue.2-3, pp.173-189, 1983. ,
Algorithmic graph theory and perfect graphs, vol.57, 2004. ,
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, vol.234, issue.1-2, pp.59-84, 2000. ,
Linear-time certifying recognition algorithms and forbidden induced subgraphs, Nord. J. Comput, vol.14, issue.1-2, pp.87-108, 2007. ,
Domination on cocomparability graphs, SIAM Journal on Discrete Mathematics, vol.6, issue.3, pp.400-417, 1993. ,
Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999. ,
presentation at NSF-CBMS Conference at Colby College, 1977. ,
A simple linear-time algorithm for computing the center of an interval graph, International Journal of Computer Mathematics, vol.34, issue.3-4, pp.121-128, 1990. ,
Fast approximation algorithms for the diameter and radius of sparse graphs, STOC, pp.515-524, 2013. ,
On the density of families of sets, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.145-147, 1972. ,
The interval number of a planar graph: Three intervals suffice, Journal of Combinatorial Theory, Series B, vol.35, issue.3, pp.224-239, 1983. ,
A combinatorial problem; stability and order for models and theories in infinitary languages, Pacific Journal of Mathematics, vol.41, issue.1, pp.247-261, 1972. ,
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984. ,