, Degree constrained subgraphs, vol.156, pp.1168-1174, 2008.
Degree-Constrained Subgraph Problems: Hardness and Approximation Results, ALGO/WAOA 2008, vol.5426, pp.29-42, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00331747
Hardness and Approximation of Traffic Grooming, Theoretical Computer Science, vol.410, pp.3751-3760, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00158341
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem, IWPEC 2008, vol.5018, pp.13-29, 2008. ,
Approximation Algorithms for NP-Complete Problems on Planar Graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994. ,
Induced Subgraphs of the Power of a Cycle, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.452-455, 1989. ,
Long Cycles in Graphs with no Subgraphs of Minimal Degree 3, Discrete Mathematics, vol.75, pp.47-53, 1989. ,
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract), Proc. of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.292-301, 1996. ,
The ring grooming problem, Networks, vol.44, pp.194-202, 2004. ,
, Graph Theory, vol.173, 2005.
Planar Subgraph Isomorphism Revisited, Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.5, pp.263-274, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00455215
, Parameterized Complexity, 1999.
Cycles in Graphs Without Proper Subgraphs of Minimum Degree 3, Ars Combinatorica, vol.25, pp.195-201, 1988. ,
Subgraphs of Minimal Degree k, Discrete Mathematics, vol.85, issue.1, pp.53-58, 1990. ,
An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems, Proc. of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp.448-456, 1983. ,
The Rectilinear Steiner Tree Problem is NP-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977. ,
On Approximating the Longest Path in a Graph, Algorithmica, vol.18, issue.1, pp.82-98, 1997. ,
, Studies in Connectivity, 1991.
Efficient generation of plane triangulations without repetitions, ICALP 2001, vol.2076, pp.433-443, 2001. ,
A separator theorem for planar graphs, SIAM Journal on Applied Mathematics, vol.36, pp.177-189, 1979. ,
Approximating Directed Weighted-Degree Constrained Networks, APPROX and RANDOM 2008, vol.5171, pp.219-232, 2008. ,
On approximating the d-girth of a graph (manuscript) ,
A Constant Factor Approximation for Minimum ?-Edge-Connected k-Subgraph with Metric Costs, APPROX and RANDOM 2008, vol.5171, pp.233-246, 2008. ,
A census of planar triangulations, Canadian Journal of Mathematics, vol.14, pp.21-38, 1962. ,