Multidimensional Divide-and-Conquer Maximin Recurrences, SIAM Journal on Discrete Mathematics, vol.8, issue.3, pp.428-447, 1995. ,
DOI : 10.1137/S0895480192232862
URL : https://hal.archives-ouvertes.fr/inria-00076938
An algorithmic view of gene teams, Theoretical Computer Science, vol.320, issue.2-3, pp.2-3, 2004. ,
DOI : 10.1016/j.tcs.2004.02.036
Permutations, with Applications to Modular Decomposition of Graphs, 13th Annual European Symposium on Algorithms, ESA05, pp.779-790, 2005. ,
DOI : 10.1137/060651331
URL : https://hal.archives-ouvertes.fr/hal-00159580
Time bounds for selection, Journal of Computer and System Sciences, vol.7, issue.4, pp.36-44, 1973. ,
DOI : 10.1016/S0022-0000(73)80033-9
URL : http://doi.org/10.1016/s0022-0000(73)80033-9
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem, Information Processing Letters, vol.98, issue.3, pp.87-91, 2006. ,
DOI : 10.1016/j.ipl.2005.12.010
Syntons, metabolons and interactons: an exact graph-theoretical approach for exploring neighbourhood between genomic and functional data, Bioinformatics, vol.21, issue.23, pp.4209-4215, 2005. ,
DOI : 10.1093/bioinformatics/bti711
URL : http://bioinformatics.oxfordjournals.org/cgi/content/short/21/23/4209
Uno and M. Yagiura's Algorithm, 16th International Symposium of Algorithms and Computation, ISAAC05, pp.146-155, 2005. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00106693
The homogeneous set sandwich problem, Information Processing Letters, vol.67, issue.1, pp.31-35, 1998. ,
DOI : 10.1016/S0020-0190(98)00076-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.8158
Partitive hypergraphs, Discrete Mathematics, vol.37, issue.1, pp.35-50, 1981. ,
DOI : 10.1016/0012-365X(81)90138-2
URL : http://doi.org/10.1016/0012-365x(81)90138-2
Introduction to Algorithms, 1990. ,
Identification of maximal common connected sets of interval graphs and tree forests, 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks, 2004. ,
Fast algorithms for identifying maximal common connected sets of interval graphs, Discrete Applied Mathematics, vol.154, issue.12, pp.1709-1721, 2006. ,
DOI : 10.1016/j.dam.2006.02.005
Maintenance of a minimum spanning forest in a dynamic plane graph, Journal of Algorithms, vol.13, issue.1, pp.33-54, 1992. ,
DOI : 10.1016/0196-6774(92)90004-V
Identifying common connected components of graphs, 2003. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00269551
Graph Sandwich Problems, Journal of Algorithms, vol.19, issue.3, pp.449-473, 1995. ,
DOI : 10.1006/jagm.1995.1047
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8158
Common connected components of interval graphs, 15th Annual Symposium on Combinatorial Pattern Matching, pp.347-358, 2004. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00269548
Randomized dynamic graph algorithms with polylogarithmic time per operation, 27th Symposium on Theory of Computing, pp.519-527, 1995. ,
DOI : 10.1145/225058.225269
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.4547
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, 30th Annual ACM Symposium on Theory of Computation, pp.79-89, 1998. ,
DOI : 10.1145/502090.502095
Solution of a Divide-and-Conquer Maximin Recurrence, SIAM Journal on Computing, vol.18, issue.6, pp.1188-1200, 1989. ,
DOI : 10.1137/0218079
Applications of a Planar Separator Theorem, SIAM Journal on Computing, vol.9, issue.3, pp.615-627, 1980. ,
DOI : 10.1137/0209046
Data Structures and Efficient Algorithms, 1984. ,
On a property of the class of n-colorable graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.2, pp.191-193, 1974. ,
DOI : 10.1016/0095-8956(74)90063-X
Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, vol.26, issue.2, pp.290-309, 2000. ,
DOI : 10.1007/s004539910014