Piercing d -Intervals, Discrete & Computational Geometry, vol.19, issue.3, pp.333-334, 1998. ,
DOI : 10.1007/PL00009349
Covering a hypergraph of subgraphs, Discrete Math, pp.2-3, 2002. ,
The Erd?s?Pósa property for directed graphs ArXiv preprint arXiv, pp.904-0727, 2016. ,
Small Edge Sets Meeting all Triangles of a Graph, Graphs and Combinatorics, vol.26, issue.3, pp.381-392, 2011. ,
DOI : 10.1112/blms/26.4.321
Maximum Number of Fixed Points in Regulatory Boolean Networks, Bulletin of Mathematical Biology, vol.19, issue.5, pp.1398-1409, 2008. ,
DOI : 10.1002/bbpc.19940980916
Positive and Negative Circuits in Discrete Neural Networks, IEEE Transactions on Neural Networks, vol.15, issue.1, pp.77-83, 2004. ,
DOI : 10.1109/TNN.2003.821555
Number of fixed points and disjoint cycles in monotone Boolean networks ArXiv preprint arXiv, pp.1602-03109, 2016. ,
Additivity of the genus of a graph, Bulletin of the American Mathematical Society, vol.68, issue.6, pp.565-568, 1962. ,
DOI : 10.1090/S0002-9904-1962-10847-7
Optimal packings of edge-disjoint odd cycles, Discrete Math, pp.1-3, 2000. ,
The Erd??s???P??sa Property For Long Circuits, Combinatorica, vol.27, issue.2, pp.135-145, 2007. ,
DOI : 10.1007/s00493-007-0047-0
ArXiv preprint https, 2009. ,
Hitting Sets: VC-Dimension and Multicut, 2013. ,
URL : https://hal.archives-ouvertes.fr/tel-01012106
VC-dimension and Erd?s?Pósa property, Discrete Math, pp.2302-2317, 2015. ,
DOI : 10.1016/j.disc.2015.05.026
Long cycles through prescribed vertices have the Erd?s?Pósa property ArXiv preprint arXiv, pp.1412-2894, 2014. ,
An O(log OPT )-approximation for covering and packing minor models of ? r, 2015. ,
An O(log opt)-approximation for covering/packing minor models of ? r, Approximation and Online Algorithms: 13th International Workshop, WAOA 2015, pp.122-132, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01481784
Large-treewidth graph decompositions and applications, 2013. ArXiv preprint arXiv:1304.1577, full version of ,
DOI : 10.1145/2488608.2488645
URL : http://arxiv.org/abs/1304.1577
Polynomial Bounds for the Grid-Minor Theorem ArXiv preprint arXiv:1305.6577, full version of, 2013. ,
DOI : 10.1145/2591796.2591813
URL : http://arxiv.org/abs/1305.6577
Large-treewidth graph decompositions and applications, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.291-300, 2013. ,
DOI : 10.1145/2488608.2488645
URL : http://arxiv.org/abs/1304.1577
Polynomial bounds for the grid-minor theorem, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp.60-69, 2014. ,
DOI : 10.1145/2591796.2591813
URL : http://arxiv.org/abs/1305.6577
Tournament immersion and cutwidth, Journal of Combinatorial Theory, Series B, vol.102, issue.1, pp.93-101, 2012. ,
DOI : 10.1016/j.jctb.2011.05.001
URL : http://doi.org/10.1016/j.jctb.2011.05.001
Packing Non-Zero A-Paths In Group-Labelled Graphs, Combinatorica, vol.26, issue.5, pp.521-532, 2006. ,
DOI : 10.1007/s00493-006-0030-1
A well-quasi-order for tournaments, Journal of Combinatorial Theory, Series B, vol.101, issue.1, pp.47-53, 2011. ,
DOI : 10.1016/j.jctb.2010.10.003
URL : http://doi.org/10.1016/j.jctb.2010.10.003
Unboundedness for generalized odd cyclic transversality, Combinatorics (Eger, vol.52, pp.195-203, 1987. ,
The Erd??s???P??sa property for clique minors in highly connected graphs, Journal of Combinatorial Theory, Series B, vol.102, issue.2, pp.454-469, 2012. ,
DOI : 10.1016/j.jctb.2011.08.001
On tree-partitions of graphs, Discrete Math, pp.1-3, 1996. ,
Packing cycles in graphs, II, Journal of Combinatorial Theory, Series B, vol.87, issue.2, pp.244-253, 2003. ,
DOI : 10.1016/S0095-8956(02)00007-2
URL : http://doi.org/10.1016/s0095-8956(02)00007-2
Packing Cycles in Graphs, Journal of Combinatorial Theory, Series B, vol.86, issue.2, pp.381-407, 2002. ,
DOI : 10.1006/jctb.2002.2134
URL : http://doi.org/10.1006/jctb.2002.2134
On independent circuits contained in a graph, Canad, J. Math, vol.17, pp.347-352, 1965. ,
Approximate min-max relations for odd cycles in planar graphs, pp.35-50, 2005. ,
DOI : 10.1007/11496915_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.3118
A Tighter Erd??s-P??sa Function for Long Cycles, Journal of Graph Theory, vol.41, issue.1, pp.111-116, 2014. ,
DOI : 10.1016/0095-8956(86)90030-4
URL : http://arxiv.org/pdf/1205.0940
Optimal Erd?s?Pósa property for pumpkins, manuscript, 2013. ,
Excluded Forest Minors and the Erd??s???P??sa Property, Combinatorics, Probability and Computing, vol.22, issue.05, pp.700-721, 2013. ,
DOI : 10.1007/978-3-642-23719-5
Quadratic upper bounds on the Erd?s?Pósa property for a generalization of packing and covering cycles, J. Graph Theory, vol.74, issue.4, pp.417-424, 2013. ,
Strengthening Erd?s?Pósa property for minor-closed graph classes, J. Graph Theory, vol.66, issue.3, pp.235-240, 2011. ,
Tournament pathwidth and topological containment, Journal of Combinatorial Theory, Series B, vol.103, issue.3, pp.374-384, 2013. ,
DOI : 10.1016/j.jctb.2013.03.001
URL : http://doi.org/10.1016/j.jctb.2013.03.001
Maximum-minimum sätze und verallgemeinerte faktoren von graphen, Acta Math. Hungar, vol.12, p.3, 1964. ,
DOI : 10.1007/bf02066678
The Erd??s???P??sa property for matroid circuits, Journal of Combinatorial Theory, Series B, vol.99, issue.2, pp.407-419, 2009. ,
DOI : 10.1016/j.jctb.2008.08.004
URL : http://doi.org/10.1016/j.jctb.2008.08.004
Packing and covering immersion models of planar subcubic graphs, 2016. ArXiv preprint arXiv:1602.04042, full version of ,
DOI : 10.1007/978-3-662-53536-3_7
URL : http://arxiv.org/pdf/1602.04042
Packing and Covering Immersion Models of Planar Subcubic Graphs, Graph-Theoretic Concepts in Computer Science: 42nd International Workshop, WG 2016, p.74, 2016. ,
DOI : 10.1016/j.jctb.2014.07.003
URL : https://hal.archives-ouvertes.fr/lirmm-01370310
Linear kernels for edge deletion problems to immersion-closed graph classes, 2016. ,
Ein Neuer Beweis Eines Mengerschen Satzes, Journal of the London Mathematical Society, vol.1, issue.3, pp.188-192, 1938. ,
DOI : 10.1112/jlms/s1-13.3.188
Packing directed circuits exactly, Combinatorica, vol.27, issue.4, pp.397-421, 2011. ,
DOI : 10.1287/moor.27.2.361.328
URL : http://arxiv.org/pdf/1012.2749
A Helly-type problem in trees, Combinatorial Theory and Its Applications, pp.571-584, 1969. ,
Über die auflösung von graphen in vollständige teilgraphen, Ann. Univ. Sci. Budapest. Eötvös Sect. Math, vol.1, pp.113-121, 1958. ,
Tree-partitions of infinite graphs, Discrete Math, pp.1-3, 1991. ,
DOI : 10.1016/0012-365x(91)90436-6
URL : http://doi.org/10.1016/0012-365x(91)90436-6
On Disjoint Directed Cycles with Prescribed Minimum Lengths, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00816135
Packing and covering triangles in graphs, Discrete Math, pp.1-3, 1999. ,
DOI : 10.1016/s0012-365x(98)00183-6
URL : http://doi.org/10.1016/s0012-365x(98)00183-6
Packing and Covering Triangles in Tripartite Graphs, Graphs and Combinatorics, vol.14, issue.1, pp.1-10, 1988. ,
DOI : 10.1007/s003730050010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.4969
Packing and Covering Triangles in K 4-free Planar Graphs, Graphs and Combinatorics, vol.6, issue.5, pp.653-662, 2011. ,
DOI : 10.1007/BF01787705
URL : https://hal.archives-ouvertes.fr/lirmm-00806743
Two disjoint negative cycles in a signed graph, Electronic Notes in Discrete Mathematics, vol.25, pp.107-111, 2006. ,
DOI : 10.1016/j.endm.2006.06.084
A unified Erd?s?Pósa theorem for constrained cycles ArXiv preprints arXiv, pp.1605-07082, 2016. ,
Approximation and kernelization for chordal vertex deletion, Proceedings of the Twenty-Eighth Annual ACM- SIAM Symposium on Discrete Algorithms, pp.1399-1418, 2017. ,
Directed Tree-Width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001. ,
DOI : 10.1006/jctb.2000.2031
URL : http://doi.org/10.1006/jctb.2000.2031
Parity linkage and the Erd?s-Pósa property of odd cycles through prescribed vertices in highly connected graphs ArXiv preprint arXiv, pp.1411-6554, 2014. ,
Transversals of d-Intervals, Discrete & Computational Geometry, vol.18, issue.2, pp.195-203, 1997. ,
DOI : 10.1007/PL00009315
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally, SIAM Journal on Discrete Mathematics, vol.26, issue.3, pp.1121-1133, 2012. ,
DOI : 10.1137/100786423
Half-integral packing of odd cycles through prescribed vertices, Combinatorica, vol.31, issue.5, pp.549-572, 2013. ,
DOI : 10.1007/s00493-011-2551-5
Fixed-parameter tractability for subset feedback set problems with parity constraints, Theoretical Computer Science, vol.576, pp.61-76, 2015. ,
DOI : 10.1016/j.tcs.2015.02.004
Packing cycles through prescribed vertices, Journal of Combinatorial Theory, Series B, vol.101, issue.5, pp.378-381, 2011. ,
DOI : 10.1016/j.jctb.2011.03.004
URL : http://doi.org/10.1016/j.jctb.2011.03.004
Edge-disjoint odd cycles in 4-edge-connected graphs, Journal of Combinatorial Theory, Series B, vol.119, pp.12-27, 2016. ,
DOI : 10.1016/j.jctb.2015.12.002
URL : https://hal.archives-ouvertes.fr/hal-00678188
Packing directed cycles through a specified vertex set, Proceedings of the Twenty-Fourth Annual ACM.-SIAM Symposium on Discrete Algorithms, pp.365-377, 2013. ,
DOI : 10.1137/1.9781611973105.27
The Erd?s?Pósa property for vertex-and edge-disjoint odd cycles in graphs on orientable surfaces, Discrete Math, pp.764-768, 2007. ,
Highly parity linked graphs, Combinatorica, vol.29, issue.2, pp.215-225, 2009. ,
Non-zero disjoint cycles in highly connected group labelled graphs, Journal of Combinatorial Theory, Series B, vol.96, issue.2, pp.296-301, 2006. ,
DOI : 10.1016/j.jctb.2005.08.001
URL : http://doi.org/10.1016/j.jctb.2005.08.001
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs, 28th International Workshop on Graph Theoretic Concepts in Computer Science, pp.282-295, 2002. ,
DOI : 10.1007/3-540-36379-3_25
Edge-disjoint odd cycles in planar graphs, Journal of Combinatorial Theory, Series B, vol.90, issue.1, pp.107-120, 2004. ,
DOI : 10.1016/S0095-8956(03)00078-9
On a conjecture of tuza about packing and covering of triangles, Discrete Math, pp.1-3, 1995. ,
Erd?s?Pósa property of planar-H-minor models with prescribed vertex sets, manuscript, 2015. ,
Packing and Covering Immersions in 4-Edge-Connected Graphs ArXiv preprint arXiv, pp.1505-00867, 2015. ,
Erd?s?Pósa property for the topological minors, manuscript, 2014. ,
On two minimax theorems in graph, Journal of Combinatorial Theory, Series B, vol.21, issue.2, pp.96-103, 1976. ,
DOI : 10.1016/0095-8956(76)90049-6
A Minimax Theorem for Directed Graphs, Journal of the London Mathematical Society, vol.2, issue.3, pp.369-374, 1978. ,
DOI : 10.1112/jlms/s2-17.3.369
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.8733
Approximate min-max relations on plane graphs, Journal of Combinatorial Optimization, vol.16, issue.1, pp.127-134, 2013. ,
DOI : 10.1007/BF01271272
URL : http://doi.org/10.1007/s10878-011-9440-0
???ber die Maximalzahl kantendisjunkterA- Wege, Archiv der Mathematik, vol.28, issue.1, pp.325-336, 1978. ,
DOI : 10.1007/BF01226062
???ber die Maximalzahl kreuzungsfreierH-Wege, Archiv der Mathematik, vol.30, issue.1, pp.387-402, 1978. ,
DOI : 10.1007/BF01226465
An exact characterization of tractable demand patterns for maximum disjoint path problems, Proceedings of the Twenty-Sixth Annual ACM.-SIAM Symposium on Discrete Algorithms, SIAM, pp.642-661, 2015. ,
DOI : 10.1137/1.9781611973730.44
A tight Erd?s-Pósa function for long cycles ArXiv preprint, 2016. ,
Disjoint cycles intersecting a set of vertices, Journal of Combinatorial Theory, Series B, vol.102, issue.5, pp.1134-1141, 2012. ,
DOI : 10.1016/j.jctb.2012.05.004
The Erd??s-P??sa Property for Odd Cycles in Highly Connected Graphs, Combinatorica, vol.21, issue.2, pp.267-278, 2001. ,
DOI : 10.1007/s004930100024
An edge variant of the Erd?s?Pósa property, Discrete Math, pp.2027-2035, 2016. ,
Polynomial Gap Extensions of the Erd?s?Pósa Theorem ArXiv preprint arXiv:1305.7376, full version of, 2013. ,
Polynomial gap extensions of the Erd??s-P??sa theorem, The Seventh European Conference on Combinatorics CRM Series, pp.13-18, 2013. ,
DOI : 10.1007/978-88-7642-475-5_3
Tree Width and Tangles: A New Connectivity Measure and Some Applications, pp.87-162, 1997. ,
Mangoes and blueberries, Combinatorica, vol.19, issue.2, pp.267-296, 1999. ,
The Gallai-Younger conjecture for planar graphs, Combinatorica, vol.16, issue.4, pp.555-566, 1996. ,
Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986. ,
DOI : 10.1016/0095-8956(86)90030-4
Quickly Excluding a Planar Graph, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.323-348, 1994. ,
DOI : 10.1006/jctb.1994.1073
URL : http://doi.org/10.1006/jctb.1994.1073
A Short Proof of Mader's S-Paths Theorem, Journal of Combinatorial Theory, Series B, vol.82, issue.2, pp.319-321, 2001. ,
DOI : 10.1006/jctb.2000.2029
The Path-Packing Structure of Graphs, Integer Programming and Combinatorial Optimization: 10th International IPCO Conference, pp.256-270, 2004. ,
DOI : 10.1007/978-3-540-25960-2_20
Tree-partite graphs and the complexity of algorithms, Lecture Notes in Computer Science, vol.199, pp.412-421, 1985. ,
DOI : 10.1007/BFb0028825
Packing circuits in eulerian digraphs, Combinatorica, vol.64, issue.2, pp.223-231, 1996. ,
DOI : 10.1007/BF01844848
A new proof and generalizations of a theorem of Erd?s and Pósa on graphs without k + 1 independent circuits ,
Girth in graphs, Journal of Combinatorial Theory, Series B, vol.35, issue.2, pp.129-141, 1983. ,
DOI : 10.1016/0095-8956(83)90067-9
On the presence of disjoint subgraphs of a specified type, Journal of Graph Theory, vol.10, issue.1, pp.101-111, 1988. ,
DOI : 10.4153/CJM-1965-035-8
The Erd??s-P??sa Property for Odd Cycles in Graphs of Large Connectivity, Combinatorica, vol.21, issue.2, pp.321-333, 2001. ,
DOI : 10.1007/s004930100028
A conjecture on triangles of graphs, Graphs and Combinatorics, vol.24, issue.4, pp.373-380, 1990. ,
DOI : 10.1007/BF01787705
Some properties of graphs containing k independent circuits, Proceedings of Colloquium Tihany, pp.321-334, 1968. ,
Packing cycles with modularity constraints, Combinatorica, vol.100, issue.2, pp.95-126, 2011. ,
DOI : 10.1016/j.jctb.2009.05.003
The structure of graphs not admitting a fixed immersion, Journal of Combinatorial Theory, Series B, vol.110, pp.47-66, 2015. ,
DOI : 10.1016/j.jctb.2014.07.003