Planar disjoint-paths completion, Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC), pp.80-93, 2011. ,
DOI : 10.1007/978-3-642-28050-4_7
URL : https://hal.archives-ouvertes.fr/lirmm-01370272
Decreasing the diameter of bounded degree graphs, Journal of Graph Theory, vol.11, issue.3, pp.161-172, 2000. ,
DOI : 10.1002/jgt.3190110315
Quickly excluding a forest, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.274-283, 1991. ,
DOI : 10.1016/0095-8956(91)90068-U
URL : http://doi.org/10.1016/0095-8956(91)90068-u
Improved approximability and nonapproximability results for graph diameter decreasing problems, Theoretical Computer Science, vol.417, pp.12-22, 2012. ,
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints, Algorithmica, vol.45, issue.2, pp.209-226, 2006. ,
DOI : 10.1007/s00453-005-1183-9
A polynomial-time algorithm for outerplanar diameter improvement, 1403. ,
DOI : 10.1007/978-3-319-20297-6_9
URL : https://hal.archives-ouvertes.fr/hal-01178222
Parameterized Algorithms, 2015. ,
DOI : 10.1007/978-3-319-21275-3
A characterisation of eccentric sequences of maximal outerplanar graphs, The Australasian Journal of Combinatorics, vol.58, p.376, 2014. ,
Improving the diameter of a planar graph, 1993. ,
Design networks with bounded pairwise distance, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.750-759, 1999. ,
DOI : 10.1145/301250.301447
Parameterized Complexity, 1999. ,
DOI : 10.1007/978-1-4612-0515-9
How to decrease the diameter of trianglefree graphs, Combinatorica, vol.18, issue.4, pp.493-501, 1998. ,
Parameterized Complexity Theory, 2006. ,
Augmenting graphs to minimize the diameter, Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC), pp.383-393, 2013. ,
DOI : 10.1007/978-3-642-45030-3_36
URL : http://arxiv.org/abs/1309.5172
Computers and intractability. A guide to the theory of NP-completeness, 1979. ,
On the Complexity of DNA Physical Mapping, Advances in Applied Mathematics, vol.15, issue.3, pp.251-261, 1994. ,
DOI : 10.1006/aama.1994.1009
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size, Algorithmica, vol.14, issue.2, pp.416-453, 2012. ,
DOI : 10.1007/BF01215352
Interval completion with few edges, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.374-381, 2007. ,
DOI : 10.1145/1250790.1250847
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.7325
Augmenting Outerplanar Graphs to Meet Diameter Requirements, Journal of Graph Theory, vol.11, issue.3, pp.392-416, 2013. ,
DOI : 10.1002/jgt.3190110315
2-connecting outerplanar graphs without blowing up the path- width. Theoretical Computer Science, to appear, 2014. ,
Augmenting Outerplanar Graphs, Journal of Algorithms, vol.21, issue.1, pp.1-25, 1996. ,
DOI : 10.1006/jagm.1996.0034
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs, SIAM Journal on Computing, vol.28, issue.5, pp.1906-1922, 1999. ,
DOI : 10.1137/S0097539796303044
Invitation to Fixed-Parameter Algorithms, 2006. ,
DOI : 10.1093/acprof:oso/9780198566076.001.0001
Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995. ,
DOI : 10.1006/jctb.1995.1006
Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004. ,
DOI : 10.1016/j.jctb.2004.08.001
Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981. ,
DOI : 10.1137/0602010