N. Alon, D. Lokshtanov, S. Saurabh, F. N. Fast, R. Alon et al., Color-coding Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference Cité page 163. [8] V. Berry and F. Nicolas. Maximum agreement and compatible supertrees Kernels for feedback arc set in tournaments, Automata, Languages and Programming Journal of the Association for Computing Machinery Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 4 of LIPIcs, pp.49-58, 1995.

S. Bessy, F. V. Fomin, S. Gaspers, C. Paul, A. Perez et al., Kernels for feedback arc set in tournaments, Journal of Computer and System Sciences, vol.77, issue.6, 2010.
DOI : 10.1016/j.jcss.2010.10.001
URL : https://hal.archives-ouvertes.fr/lirmm-00738221

S. Bessy, C. Paul, and A. Perez, Polynomial Kernels for 3-Leaf Power Graph Modification Problems, International Workshop On Combinatorial Algorithms (IWOCA), pp.72-82, 2009.
DOI : 10.1007/978-3-642-10217-2_10
URL : https://hal.archives-ouvertes.fr/lirmm-00533517

S. Bessy, C. Paul, and A. Perez, Polynomial kernels for 3-leaf power graph modification problems, Discrete Applied Mathematics, vol.158, issue.16, pp.1732-1744, 2010.
DOI : 10.1016/j.dam.2010.07.002
URL : https://hal.archives-ouvertes.fr/lirmm-00533517

S. Bessy and A. Perez, Polynomial kernels for proper interval completion and a related problem, International Symposium on Fundamentals of Computation Theory (FCT), number 6914, pp.1732-1744, 2011.
DOI : 10.1007/978-3-642-22953-4_20
URL : http://arxiv.org/abs/1103.5599

H. L. Bodlaender, Kernelization: New Upper and Lower Bound Techniques, International Workshop on Parameterized and Exact Computation (IWPEC), pp.17-37, 2009.
DOI : 10.1007/978-3-642-11269-0_2

H. L. Bodlaender, L. Cai, J. Chen, M. R. Fellows, J. A. Telle et al., Open problems in parameterized and exact computation, International Workshop on Parameterized and Exact Computation (IWPEC), pp.40-168, 2006.

H. L. Bodlaender, R. Downey, M. Fellows, and D. Hermelin, On problems without polynomial kernels, number 5125 in LNCS, pp.563-574, 2008.
DOI : 10.1016/j.jcss.2009.04.001

H. L. Bodlaender, B. M. Jansen, and S. Kratsch, Cross-composition : A new technique for kernelization lower bounds, Symposium on Theoretical Aspects of Computer Science (STACS), volume 9 of Leibniz International Proceedings in Informatics, pp.165-176, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573603

H. L. Bodlaender, B. M. Jansen, and S. Kratsch, Kernel bounds for path and cycle problems, pp.2011-2038

H. L. Bodlaender, S. Thomassé, and A. Yeo, Kernel bounds for disjoint cycles and disjoint paths, European Symposium on Algorithms (ESA), pp.635-646, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00806805

H. L. Bodlaender and T. C. Van-dijk, A Cubic Kernel for Feedback Vertex Set and Loop Cutset, Theory of Computing Systems, pp.566-597, 2010.
DOI : 10.1007/s00224-009-9234-2

N. Bousquet, J. Daligault, and S. Thomassé, Multicut is FPT, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.459-468, 2011.
DOI : 10.1145/1993636.1993698
URL : https://hal.archives-ouvertes.fr/lirmm-00741933

N. Bousquet, J. Daligault, S. Thomassé, and A. Yeo, A polynomial kernel for multicut in trees, Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz International Proceedings in Informatics, pp.183-194, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359171

A. Brandstädt and V. B. Le, Structure and linear time recognition of 3-leaf powers, Information Processing Letters, vol.98, issue.4, pp.133-138, 2006.
DOI : 10.1016/j.ipl.2006.01.004

A. Brandstädt, V. B. Le, and R. Sritharan, Structure and linear-time recognition of 4-leaf powers, ACM Transactions on Algorithms, vol.5, issue.1, pp.1-22, 2008.
DOI : 10.1145/1435375.1435386

D. Brügmann, C. Komusiewicz, and H. Moser, On Generating Triangle-Free Graphs, Electronic Notes in Discrete Mathematics, vol.32, issue.117, pp.51-58, 2009.
DOI : 10.1016/j.endm.2009.02.008

B. Bui-xuan, J. A. Telle, and M. Vatshelle, Boolean-Width of Graphs, International Workshop on Parameterized and Exact Computation (IWPEC), pp.61-74, 2009.
DOI : 10.1007/978-3-642-11269-0_5
URL : https://hal.archives-ouvertes.fr/hal-00555494

J. Byrka, S. Guillemot, and J. Jansson, New results on optimizing rooted triplets consistency, Discrete Applied Mathematics, vol.158, issue.11, pp.1136-1147, 2010.
DOI : 10.1016/j.dam.2010.03.004
URL : https://hal.archives-ouvertes.fr/hal-00824940

L. Cai, Fixed-parameter tractability of graph modification problems for hereditary properties, Information Processing Letters, vol.58, issue.4, pp.171-176, 1996.
DOI : 10.1016/0020-0190(96)00050-6

L. Cai and J. Chen, On Fixed-Parameter Tractability and Approximability of NP Optimization Problems, Journal of Computer and System Sciences, vol.54, issue.3, pp.465-474, 1997.
DOI : 10.1006/jcss.1997.1490

L. S. Chandran and F. Grandoni, Refined memorization for vertex cover, Information Processing Letters, vol.93, issue.3, pp.123-131, 2005.
DOI : 10.1016/j.ipl.2004.10.003

M. Chang and M. Ko, The 3-Steiner Root Problem, International Workshop on Graph Theoretical Concepts in Computer Science (WG), pp.109-120, 2007.
DOI : 10.1007/978-3-540-74839-7_11

P. Charbit, S. Thomassé, and A. Yeo, The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments, Combinatorics, Probability and Computing, vol.16, issue.01, pp.1-4, 2007.
DOI : 10.1017/S0963548306007887
URL : https://hal.archives-ouvertes.fr/lirmm-00140321

J. Chen, Y. Liu, and S. Lu, Directed feedback vertex set problem is FPT, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, number 07281 in Dagstuhl Seminar Proceedings, 2007.

J. Chen and J. Meng, A 2k Kernel for the Cluster Editing Problem, International Computing and Combinatorics Conference, pp.459-468, 2010.
DOI : 10.1007/978-3-642-14031-0_49

B. Chor, M. R. Fellows, and D. Juedes, Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps, International Workshop on Graph Theoretical Concepts in Computer Science (WG), pp.257-269, 2004.
DOI : 10.1007/978-3-540-30559-0_22

N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh et al., Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem, Journal of Computer and System Sciences, vol.76, issue.7, pp.650-662, 2010.
DOI : 10.1016/j.jcss.2010.01.001
URL : https://hal.archives-ouvertes.fr/hal-00504734

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.4-5, 1971.
DOI : 10.1145/800157.805047

D. Coppersmith, L. Fleischer, and A. Rudra, Ordering by weighted number of wins gives a good ranking for weighted tournaments, ACM Transactions on Algorithms, vol.6, issue.3, pp.2010-116
DOI : 10.1145/1798596.1798608

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk, On multiway cut parameterized above lower bounds, International Symposium on Parameterized and Exact Computation (IPEC), pp.2011-2040
DOI : 10.1007/978-3-642-28050-4_1
URL : http://arxiv.org/abs/1107.1585

J. Daligault, C. Paul, A. Perez, and S. Thomassé, Treewidth reduction for the parameterized Multicut problem, 2010.

P. Damaschke, Fixed-Parameter Enumerability of Cluster Editing and??Related Problems, Theory of Computing Systems, pp.261-283, 2010.
DOI : 10.1007/s00224-008-9130-1

G. B. Dantzig, D. R. Fulkerson, and S. M. Iohnson, Solution of a Large-Scale Traveling-Salesman Problem, Journal of the Operations Research Society of America, vol.2, issue.4, p.393, 1954.
DOI : 10.1287/opre.2.4.393

F. Dehne, M. Langston, X. Luo, S. Pitre, P. Shaw et al., The Cluster Editing Problem: Implementations and Experiments, International Workshop on Parameterized and Exact Computation (IWPEC), pp.13-24, 2006.
DOI : 10.1007/11847250_2

H. Dell and D. Van-melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, ACM Symposium on Theory of Computing (STOC), pp.251-260, 2010.

E. D. Demaine, M. Hajiaghayi, and D. Marx, Open problems ? parameterized complexity and approximation algorithms, Number 09511 in Dagstuhl Seminar Proceedings, pp.10-157, 2010.

X. Deng, P. Hell, and J. Huang, Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs, SIAM Journal on Computing, vol.25, issue.2, pp.390-403, 1996.
DOI : 10.1137/S0097539792269095

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

M. Dom, J. Guo, F. Hüffner, and R. Niedermeier, Error Compensation in Leaf Root Problems, International Symposium on Algorithms and Computation (ISAAC), number 3341 in Lecture Notes in Computer Science, pp.389-401, 2004.
DOI : 10.1007/978-3-540-30551-4_35

M. Dom, J. Guo, F. Hüffner, and R. Niedermeier, Error Compensation in Leaf Root Problems, Algorithmica, vol.44, issue.49, pp.363-381, 2006.
DOI : 10.1007/978-3-540-30551-4_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.6472

M. Dom, J. Guo, F. Hüffner, and R. Niedermeier, Closest 4-leaf power is fixed-parameter tractable, Discrete Applied Mathematics, vol.156, issue.18, pp.3345-3361, 2008.
DOI : 10.1016/j.dam.2008.01.007
URL : http://doi.org/10.1016/j.dam.2008.01.007

M. Dom, D. Lokshtanov, and S. Saurabh, Incompressibility through Colors and IDs, In Automata , Languages and Programming LNCS, vol.5555, issue.37, pp.378-389, 2009.
DOI : 10.1007/978-3-642-02927-1_32

R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W[1], Theoretical Computer Science, vol.141, issue.1-2, pp.109-131, 1995.
DOI : 10.1016/0304-3975(94)00097-3

R. G. Downey and M. R. Fellows, Parameterized Complexity, pp.48-167, 1999.
DOI : 10.1007/978-1-4612-0515-9

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

J. Egerváry, Matrixok kombinatoricus tuladjdonsagairol Matematikai és Fizikai Lapok, pp.16-28, 1931.

E. S. El-mallah and C. Colbourn, The complexity of some edge deletion problems, IEEE Transactions on Circuits and Systems, vol.35, issue.3, pp.354-362, 1988.
DOI : 10.1109/31.1748

M. R. Fellows, M. Langston, F. Rosamond, and P. Shaw, Efficient Parameterized Preprocessing for Cluster Editing, International Symposium on Fundamentals of Computation Theory (FCT), number 4639 in Lecture Notes in Computer Science, pp.312-321, 2007.
DOI : 10.1007/978-3-540-74240-1_27

M. R. Fellows, D. Lokshtanov, N. Misra, M. Mnich, F. A. Rosamond et al., The complexity ecology of parameters : An illustration using bounded max leaf number, Theory of Computing Systems, pp.822-848, 2009.

H. Fernau and D. Raible, A parameterized perspective on packing paths of length two, Journal of Combinatorial Optimization, vol.49, issue.4, pp.319-341, 2009.
DOI : 10.1007/s10878-009-9230-0

J. Flum and M. Grohe, Parameterized Complexity Theory. Text in Theoretical Computer Science, 2006.

F. V. Fomin, S. Gaspers, S. Saurabh, and S. Thomassé, A Linear Vertex Kernel for Maximum Internal Spanning Tree, International Symposium on Algorithms and Computation (ISAAC), pp.275-282, 2009.
DOI : 10.1007/978-3-642-10631-6_29
URL : https://hal.archives-ouvertes.fr/lirmm-00432674

F. V. Fomin and D. Kratsch, Exact Exponential Algorithms, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00085561

F. V. Fomin, D. Lokshtanov, N. Misra, G. Philip, and S. Saurabh, Hitting Forbidden Minors: Approximation and Kernelization, Symposium on Theoretical Aspects of Computer Science (STACS), volume 9 of Leibniz International Proceedings in Informatics, pp.189-200, 2011.
DOI : 10.1137/140997889
URL : https://hal.archives-ouvertes.fr/hal-00573641

F. V. Fomin, D. Lokshtanov, V. Raman, and S. Saurabh, Fast local search algorithm for weighted feedback arc set in tournaments, AAAI Conference on Artificial Intelligence, pp.65-70, 2010.

L. R. Ford, D. R. Fulkerson, and N. J. , Flows in networks, 1962.

L. Fortnow and R. Santhanam, Infeasibility of instance compression and succinct PCPs for NP, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.133-142, 2008.
DOI : 10.1145/1374376.1374398

P. Galinier, M. Habib, and C. Paul, Chordal graphs and their clique graphs, International Workshop on Graph Theoretical Concepts in Computer Science (WG), pp.358-371, 1995.
DOI : 10.1007/3-540-60618-1_88

M. R. Garey and D. S. Jonhson, Computers and intractability : a guide to the theory on NP- Completeness, pp.4-36, 1979.

N. Garg, V. V. Vazirani, and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica, vol.11, issue.5, pp.3-20, 1997.
DOI : 10.1007/BF02523685

F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-56, 1974.
DOI : 10.1016/0095-8956(74)90094-X

E. Gioan, C. Paul, M. Tedder, and D. G. , Practical and efficient split decomposition via graph-labelled trees. CoRR, abs/1104, pp.2011-171
DOI : 10.1007/s00453-013-9752-9
URL : https://hal.archives-ouvertes.fr/lirmm-00805193

M. C. Golumbic, H. Kaplan, and R. Shamir, On the Complexity of DNA Physical Mapping, Advances in Applied Mathematics, vol.15, issue.3, 1994.
DOI : 10.1006/aama.1994.1009

A. D. Gordon, Consensus super tree containing overlapping sets of labeled leaves, Journal of Classification, vol.3, pp.31-39

G. Gottlob and S. T. Lee, A logical approach to multicut problems, Information Processing Letters, vol.103, issue.4, pp.136-141, 2007.
DOI : 10.1016/j.ipl.2007.03.005

J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier, Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation, Theory of Computing Systems, pp.373-392, 2005.
DOI : 10.1007/s00224-004-1178-y

J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier, Data reduction and exact algorithms for clique cover, ACM Journal of Experimental Algorithmics, vol.13, issue.22, 2008.

S. Guillemot and V. Berry, Fixed-parameter tractability of the maximum agreement supertree problem, IEEE/ACM Trans. Comput. Biology Bioinform, vol.7, issue.2, pp.2010-116
URL : https://hal.archives-ouvertes.fr/lirmm-00130406

S. Guillemot and M. Mnich, Kernel and Fast Algorithm for Dense Triplet Inconsistency, Theory and Applications of Models of Computation, pp.247-257, 2010.
DOI : 10.1007/978-3-642-13562-0_23
URL : http://hdl.handle.net/11858/00-001M-0000-0024-468A-3

S. Guillemot, C. Paul, and A. Perez, On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems, International Symposium on Parameterized and Exact Computation (IPEC), pp.147-157, 2010.
DOI : 10.1007/978-3-540-77918-6_21
URL : https://hal.archives-ouvertes.fr/hal-00821612

J. Guo, A More Effective Linear Kernelization for Cluster Editing, International Symposium Combinatorics, pp.36-47, 2007.
DOI : 10.1007/978-3-540-74450-4_4

J. Guo, A more effective linear kernelization for cluster editing, Theoretical Computer Science, vol.410, pp.8-10718, 2009.

J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Journal of Computer and System Sciences, vol.72, issue.8, pp.1386-1396, 2006.
DOI : 10.1016/j.jcss.2006.02.001

J. Guo and R. Niedermeier, Invitation to data reduction and problem kernelization, ACM SIGACT News, vol.38, issue.1, pp.31-45, 2007.
DOI : 10.1145/1233481.1233493

G. Gutin, E. J. Kim, M. Mnich, and A. Yeo, Betweenness parameterized above tight lower bound, Journal of Computer and System Sciences, vol.76, issue.8, pp.872-878, 2010.
DOI : 10.1016/j.jcss.2010.05.001
URL : http://doi.org/10.1016/j.jcss.2010.05.001

G. Gutin, E. J. Kim, S. Szeider, and A. Yeo, Solving MAX-2-SAT above a tight lower bound. CoRR, abs/0907, 2009.

G. Gutin, A. Rafiey, S. Szeider, and A. Yeo, The linear arrangement problem parameterized above guaranteed value, Mathematical Systems Theory, vol.41, 2007.

G. Gutin, L. Van-iersel, M. Mnich, and A. Yeo, All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables, European Symposium on Algorithms (ESA), pp.326-337, 2010.
DOI : 10.1007/978-3-642-15775-2_28

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

P. Hall, On representatives of subsets, Journal of the London Mathematical Society, vol.10, issue.37, pp.26-30, 1935.

P. Heggernes, C. Paul, J. A. Telle, and Y. Villanger, 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

F. Hüffner, C. Komusiewicz, H. Moser, and R. Niedermeier, Fixed-parameter algorithms for cluster vertex deletion, Theory of Computing Systems, pp.196-217, 2010.

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.8482

B. M. Jansen and H. L. Bodlaender, Vertex Cover Kernelization Revisited, Symposium on Theoretical Aspects of Computer Science 180 BIBLIOGRAPHIE (STACS), volume 9 of Leibniz International Proceedings in Informatics, pp.177-188, 2011.
DOI : 10.1007/s00224-012-9393-4
URL : https://hal.archives-ouvertes.fr/hal-00573608

B. M. Jansen and S. Kratsch, Data reduction for graph coloring problems. CoRR, abs/1104, p.27, 2011.

I. A. Kanj, M. J. Pelsmajer, and M. Schaefer, Parameterized Algorithms for Feedback Vertex Set, International Workshop on Parameterized and Exact Computation (IWPEC), pp.235-247, 2004.
DOI : 10.1007/978-3-540-28639-4_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.9745

H. Kaplan, R. Shamir, and R. E. Tarjan, Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.780-791, 1994.
DOI : 10.1109/SFCS.1994.365715

H. Kaplan, R. Shamir, and R. E. Tarjan, 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

R. M. Karp, Reducibility among combinatorial problems, Proceedings of the Workshop on Complexity of Computations (Yorktown Heights, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

R. M. Karp, Mapping the genome, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.278-285, 1993.
DOI : 10.1145/167088.167170

M. Karpinski and W. Schudy, Approximation Schemes for the Betweenness??Problem in Tournaments and Related Ranking Problems, pp.116-132, 2009.
DOI : 10.1137/0208008

M. Karpinski and W. Schudy, Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament, International Symposium on Algorithms and Computation (ISAAC), pp.3-14, 2010.
DOI : 10.1007/978-3-642-17517-6_3

C. Kenyon-mathieu and W. Schudy, How to rank with few errors, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.95-103, 2007.
DOI : 10.1145/1250790.1250806

C. Komusiewicz and J. Uhlmann, A Cubic-Vertex Kernel for Flip Consensus Tree, Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 2 of LIPIcs, pp.280-291, 2008.
DOI : 10.1007/s00453-012-9663-1
URL : https://hal.archives-ouvertes.fr/hal-01171577

D. König, Gráfok és mátrixok Matematikai és Fizikai Lapok, pp.116-119, 1931.

J. Kratochvil, P. D. Manuel, and M. Miller, Generalized domination in chordal graphs, 1995.

S. Kratsch, Polynomial kernelizations for MIN F + pi 1 and MAX NP, Symposium on Theoretical Aspects of Computer Science (STACS), volume 3 of Leibniz International Proceedings in Informatics, pp.601-612, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00360229

S. Kratsch and M. Wahlström, Two Edge Modification Problems without Polynomial Kernels, International Workshop on Parameterized and Exact Computation, pp.264-275, 2009.
DOI : 10.1007/978-3-642-11269-0_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.4294

S. Kratsch and M. Wahlström, Compression via Matroids, ACM Transactions on Algorithms, vol.10, issue.4, p.167, 2011.
DOI : 10.1145/2635810

M. R. Krom, The decision problem for formulas in prenex conjunctive normal form with binary disjunctions, The Journal of Symbolic Logic, vol.21, issue.02, pp.210-216, 1970.
DOI : 10.1002/malq.19670130104

V. B. Le and N. N. Tuy, Hardness Results and Efficient Algorithms for Graph Powers, International Workshop on Graph Theoretical Concepts in Computer Science (WG), pp.238-249, 2009.
DOI : 10.1007/978-3-642-11409-0_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.4353

L. Levin, Universal sequential search problems. Problems of Information Transmission (translated from Problemy Peredachi Informatsii (Russian)), 1973

G. H. Lin, P. E. Kearney, and T. Jiang, Phylogenetic k-Root and Steiner k-Root, International Symposium on Algorithms and Computation (ISAAC), number 1969 in Lecture Notes in Computer Science, pp.539-551, 2000.
DOI : 10.1007/3-540-40996-3_46
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.3974

Y. Liu, J. Wang, J. Guo, and J. Chen, Cograph editing : Complexity and parameterized algorithms, pp.1732-1744, 2010.
DOI : 10.1007/978-3-642-22685-4_10

D. Lokshtanov, Wheel-Free Deletion Is W[2]-Hard, In International Workshop on Parameterized and Exact Computation Lecture Notes in Computer Science, vol.5018, pp.141-147, 2008.
DOI : 10.1007/978-3-540-79723-4_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.2410

D. Lokshtanov and S. Saurabh, Kernel : Lower and Upper bounds, pp.31-33, 2009.

D. Lokshtanov, S. Saurabh, and S. Sikdar, Simpler Parameterized Algorithm for OCT, In International Workshop On Combinatorial Algorithms Lecture Notes in Computer Science, vol.5874, pp.380-384, 2009.
DOI : 10.1007/978-3-642-10217-2_37

P. J. Looges and S. Olariu, Optimal greedy algorithms for indifference graphs, Proceedings IEEE Southeastcon '92, pp.15-25, 1993.
DOI : 10.1109/SECON.1992.202324
URL : http://doi.org/10.1016/0898-1221(93)90308-i

D. Marx, Chordal Deletion Is Fixed-Parameter Tractable, International Workshop on Graph Theoretical Concepts in Computer Science (WG), pp.37-48, 2006.
DOI : 10.1007/11917496_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.7774

D. Marx, Chordal Deletion is Fixed-Parameter Tractable, Algorithmica, vol.2, issue.1, pp.747-768, 2010.
DOI : 10.1007/s00453-008-9233-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.7774

D. Marx, What's next ? http://www.lorentzcenter, p.155, 2010.

D. Marx, B. O. Sullivan, and I. Razgon, Treewidth reduction for constrained separation and bipartization problems, Symposium on Theoretical Aspects of Computer Science (STACS), Leibniz International Proceedings in Informatics, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455767

D. Marx and I. Razgon, Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem, European Symposium on Algorithms (ESA), pp.647-658, 2009.
DOI : 10.1007/978-3-642-04128-0_58

S. Mishra, V. Raman, S. Saurabh, and S. Sikdar, The complexity of könig subgraph problems and above-guarantee vertex cover

J. Nederlof, Fast Polynomial-Space Algorithms Using M??bius Inversion: Improving on Steiner Tree and Related Problems, In Automata, Languages and Programming Lecture Notes in Computer Science, vol.5555, pp.713-725, 2009.
DOI : 10.1007/978-3-642-02927-1_59

R. Niedermeier, Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications), pp.24-48, 2006.

R. Niedermeier and P. Rossmanith, A general method to speed up fixed-parameter-tractable algorithms, Information Processing Letters, vol.73, issue.3-4, pp.125-129, 2000.
DOI : 10.1016/S0020-0190(00)00004-1

R. Niedermeier and P. Rossmanith, On efficient fixed-parameter algorithms for weighted vertex cover, Journal of Algorithms, vol.47, issue.2, pp.63-77, 2003.
DOI : 10.1016/S0196-6774(03)00005-1

S. Oum and P. D. Seymour, Approximating clique-width and branch-width, Journal of Combinatorial Theory, Series B, vol.96, issue.4, pp.514-528, 2006.
DOI : 10.1016/j.jctb.2005.10.006
URL : http://doi.org/10.1016/j.jctb.2005.10.006

C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization : algorithms and complexity, 1982.

C. Paul, A. Perez, and S. Thomassé, Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem, International Symposium on Mathematical Foundations of Computer Science (MFCS), number 6907 in Lecture Notes in Computer Science, pp.497-507, 2011.
DOI : 10.1007/978-3-642-22993-0_45

C. Paul, A. Perez, and S. Thomassé, Conflict packing yields linear vertex-kernels for rooted triplet inconsistency and other problems. CoRR, abs/1101, pp.146-149, 2011.

F. Protti, M. Dantas, J. L. Silva, and . Szwarcfiter, Applying modular decomposition to parameterized cluster editing problems. Theory of Computing Systems, pp.9-48, 2007.

V. Raman and S. Saurabh, Parameterized algorithms for feedback set problems and their duals in tournaments, Theoretical Computer Science, vol.351, issue.3, pp.446-458, 2006.
DOI : 10.1016/j.tcs.2005.10.010

I. Rapaport, K. Suchan, and I. Todinca, Minimal proper interval completions, Information Processing Letters, vol.106, issue.5, pp.195-202, 2008.
DOI : 10.1016/j.ipl.2007.11.013
URL : https://hal.archives-ouvertes.fr/hal-00085565

I. Razgon and B. O. Sullivan, Directed feedback vertex set is fixed-parameter tractable, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, number 07281 in Dagstuhl Seminar Proceedings, pp.10-47, 2007.

I. Razgon and B. O. Sullivan, Almost 2-SAT is fixed-parameter tractable, Journal of Computer and System Sciences, vol.75, issue.8, pp.435-450, 2009.
DOI : 10.1016/j.jcss.2009.04.002

B. Reed, K. Smith, and A. Vetta, Finding odd cycle transversals, Operations Research Letters, vol.32, issue.4, pp.299-301, 2004.
DOI : 10.1016/j.orl.2003.10.009

N. Robertson and P. D. Seymour, 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

N. Robertson, P. D. Seymour, and R. Thomas, 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

Y. Saab, A fast and effective algorithm for the feedback arc set problem, Journal of Heuristics, vol.7, issue.3, pp.235-250, 2001.
DOI : 10.1023/A:1011315014322

S. Saurabh, Chromatic coding and universal (hyper-)graph coloring families. Parameterized Complexity News, pp.49-58, 2009.

C. Semple and M. Steel, Phylogenetics, volume 24 of Oxford Lecture Series in Mathematics and Its Applications, 2003.

R. Shamir, R. Sharan, and D. Tsur, Cluster graph modification problems, Discrete Applied Mathematics, vol.144, issue.1-2, pp.173-182, 2004.
DOI : 10.1016/j.dam.2004.01.007

R. Sharan, Graph modification problems and their applications to genomic research, pp.10-47, 2002.

A. Soleimanfallah and A. Yeo, A kernel of order 2k ? c for vertex cover, Discrete Mathematics, vol.311, pp.10-11892, 2011.

R. Tarjan and M. Yannakakis, 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.
DOI : 10.1137/0213035

S. Thomassé, A 4k 2 kernel for feedback vertex set, ACM Transactions on Algorithms, vol.6, issue.116, pp.10-167, 2010.

R. Van-bevern, H. Moser, and R. Niedermeier, Kernelization through Tidying, Latin American Theoretical Informatics Symposium (LATIN), pp.527-538, 2010.
DOI : 10.1007/978-3-642-12200-2_46

A. Van-zuylen, R. Hegde, K. Jain, and D. P. Williamson, Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.405-414, 2007.
DOI : 10.1287/moor.1090.0385

V. V. Vazirani, Approximation algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7

J. Wang, D. Ning, Q. Feng, and J. Chen, An improved kernelization for -packing, Information Processing Letters, vol.110, issue.5, pp.188-192, 2010.
DOI : 10.1016/j.ipl.2009.12.002

G. Wegner, Eigenschaften der nerven homologische-einfactor familien in R n, pp.77-79, 1967.

M. Yannakakis, 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

F. Une-partition-sûre-pour-le-problème, . Arc, and I. Set, Les arcs non représentés sont des arcs avant, i.e. v i v j avec i < j, p.120

F. Une-partition-sûre-pour-le-problème, . Arc, . In, and . Tournaments, Les arcs non représentés sont des arcs avant, i.e. v i v j avec i < j . Ainsi, les arcs 1 et 3 peuvent être certifiés avec le même sommet, l'arc 2 étant certifié avec un sommet différent, p.131

F. N. Abu-khzam, A kernelization algorithm for d-Hitting Set, Journal of Computer and System Sciences, vol.76, issue.7, pp.524-531, 2010.
DOI : 10.1016/j.jcss.2009.09.002

N. Ailon, M. Charikar, and A. Newman, Aggregating inconsistent information: ranking and clustering, ACM Symposium on Theory of Computing (STOC), pp.684-693, 2005.
DOI : 10.1145/1060590.1060692

N. Alon, Ranking Tournaments, SIAM Journal on Discrete Mathematics, vol.20, issue.1, pp.137-142, 2006.
DOI : 10.1137/050623905

N. Alon, D. Lokshtanov, and S. Saurabh, Fast FAST, ICALP, pp.49-58, 2009.
DOI : 10.1007/978-3-642-02927-1_6

J. Bartholdi, I. , C. A. Tovey, and M. A. Trick, Voting schemes for which it can be difficult to tell who won the election, Social Choice and Welfare, vol.35, issue.2, pp.157-165, 1989.
DOI : 10.1007/BF00303169

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.75423-434, 2009.
DOI : 10.1016/j.jcss.2009.04.001
URL : http://doi.org/10.1016/j.jcss.2009.04.001

J. Borda, Mémoire sur lesélectionslesélections au scrutin, Histoire de l'Académie Royale des Sciences, p.1781

N. Bousquet, J. Daligault, S. Thomassé, and A. Yeo, A polynomial kernel for multicut in trees, Symposium on Theoretical Aspects of Computer Science (STACS), pp.183-194, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359171

I. Charon and O. Hudry, A survey on the linear ordering problem for weighted or unweighted tournaments, 4OR, vol.29, issue.2, pp.5-60, 2007.
DOI : 10.1007/s10288-007-0036-6

W. W. Cohen, R. E. Schapire, and Y. Singer, Learning to order things, Advances in neural information processing systems (NIPS), pp.451-457, 1997.

M. Condorcet, Essai sur l'application de l'analysè a la probabilité des décisions renduesàrenduesà la pluralité des voix, p.1785

D. Coppersmith, L. Fleischer, and A. Rudra, Ordering by weighted number of wins gives a good ranking for weighted tournaments, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.776-782, 2006.
DOI : 10.1145/1798596.1798608

H. Dell and D. Van-melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomialtime hierarchy collapses, STOC, pp.251-260, 2010.

M. Dom, J. Guo, F. Hüffner, R. Niedermeier, and A. Truß, Fixed-parameter tractability results for feedback set problems in tournaments, Conference on Algorithms and Complexity (CIAC), pp.320-331, 2006.

M. Dom, D. Lokshtanov, and S. Saurabh, Incompressibility through Colors and IDs, ICALP, pp.378-389, 2009.
DOI : 10.1007/978-3-642-02927-1_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1154

C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, Rank aggregation revisited

C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, Rank aggregation methods for the Web, Proceedings of the tenth international conference on World Wide Web , WWW '01, 2001.
DOI : 10.1145/371920.372165
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.8702

P. Erdös and J. W. Moon, On sets of consistent arcs in a tournament, Bulletin canadien de math??matiques, vol.8, issue.0, pp.269-271, 1965.
DOI : 10.4153/CMB-1965-017-1

F. V. Fomin, D. Lokshtanov, V. Raman, and S. Saurabh, Fast local search algorithm for weighted feedback arc set in tournaments, AAAI, pp.65-70, 2010.

H. A. Jung, On subgraphs without cycles in tournaments. Combinatorial Theory and its Applications II, pp.675-677, 1970.

M. Karpinski and W. Schudy, Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament, 2010.
DOI : 10.1007/978-3-642-17517-6_3

J. Kemeny and J. Snell, Mathematical models in the social sciences, Blaisdell, 1962.

C. Kenyon-mathieu and W. Schudy, How to rank with few errors, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.95-103, 2007.
DOI : 10.1145/1250790.1250806
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.5602

R. M. Mcconnell and F. De-montgolfier, Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.198-209, 2005.
DOI : 10.1016/j.dam.2004.02.017
URL : https://hal.archives-ouvertes.fr/hal-00159571

K. D. Reid and E. T. Parker, Disproof of a conjecture of Erd??s and moser on tournaments, Journal of Combinatorial Theory, vol.9, issue.3, pp.225-238, 1970.
DOI : 10.1016/S0021-9800(70)80061-8

S. Seshu and M. B. Reed, Linear Graphs and Electrical Networks, 1961.

P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika, vol.48, issue.3-4, pp.303-312, 1961.
DOI : 10.1093/biomet/48.3-4.303

E. Speckenmeyer, On feedback problems in digraphs, Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.218-231, 1989.
DOI : 10.1007/3-540-52292-1_16

J. Spencer, Optimal ranking of tournaments. Networks, pp.135-138, 1971.

S. Thomassé, A 4k 2 kernel for feedback vertex set, ACM Transactions on Algorithms, vol.6, issue.2, p.2010

A. Van-zuylen, Deterministic approximation algorithms for ranking and clusterings, 2005.

D. H. Younger, Minimum Feedback Arc Sets for a Directed Graph, IEEE Transactions on Circuit Theory, vol.10, issue.2, pp.238-245, 1963.
DOI : 10.1109/TCT.1963.1082116

]. N. Bousquet, J. Daligault, S. Thomassé, and A. Yeo, A polynomial kernel for multicut in trees, STACS, volume 09001 of Dagstuhl Seminar Proceedings, pp.183-194, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359171

S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar, ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT, computational complexity, vol.15, issue.2, pp.94-114, 2006.
DOI : 10.1007/s00037-006-0210-9

J. Chen, Y. Liu, and S. Lu, An Improved Parameterized Algorithm for??the??Minimum Node Multiway Cut Problem, Algorithmica, vol.3, issue.1, pp.1-13, 2009.
DOI : 10.1007/s00453-007-9130-6

M. Costa, L. Létocart, and F. Roupin, Minimal multicut and maximal integer multiflow: A survey, European Journal of Operational Research, vol.162, issue.1, pp.55-69, 2005.
DOI : 10.1016/j.ejor.2003.10.037
URL : https://hal.archives-ouvertes.fr/hal-01124670

E. D. Demaine, M. Hajiaghayi, and D. Marx, 09511 open problems ? parameterized complexity and approximation algorithms, Parameterized complexity and approximation algorithms, number 09511 in Dagstuhl Seminar Proceedings, 2010.

J. Flum and M. Grohe, Parameterized complexity theory, 2006.

N. Garg, V. V. Vazirani, and M. Yannakakis, Approximate max-flow min-(multi)cut theorems and their applications, STOC, pp.698-707, 1993.
DOI : 10.1137/s0097539793243016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.3217

N. Garg, V. V. Vazirani, and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica, vol.11, issue.5, pp.3-20, 1997.
DOI : 10.1007/BF02523685

G. Gottlob and S. T. Lee, A logical approach to multicut problems, Information Processing Letters, vol.103, issue.4, pp.136-141, 2007.
DOI : 10.1016/j.ipl.2007.03.005

S. Guillemot, FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs, IWPEC, pp.129-140, 2008.
DOI : 10.1007/978-3-540-79723-4_13
URL : https://hal.archives-ouvertes.fr/hal-00824933

J. Guo, F. Hüffner, E. Kenar, R. Niedermeier, and J. Uhlmann, Complexity and Exact Algorithms for Multicut, In SOFSEM, pp.303-312, 2006.
DOI : 10.1007/11611257_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.8925

J. Guo and R. Niedermeier, Fixed-parameter tractability and data reduction for multicut in trees, Networks, vol.47, issue.3, pp.124-135, 2005.
DOI : 10.1002/net.20081

J. Guo and R. Niedermeier, Exact algorithms and applications for Tree-like Weighted Set Cover, Journal of Discrete Algorithms, vol.4, issue.4, pp.608-622, 2006.
DOI : 10.1016/j.jda.2005.07.005
URL : http://doi.org/10.1016/j.jda.2005.07.005

D. Marx, Parameterized graph separation problems, Theoretical Computer Science, vol.351, issue.3, pp.394-406, 2006.
DOI : 10.1016/j.tcs.2005.10.007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.9011

D. Marx, B. O. Sullivan, and I. Razgon, Treewidth reduction for constrained separation and bipartization problems, STACS, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455767

D. Marx and I. Razgon, Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem, ESA, pp.647-658, 2009.
DOI : 10.1007/978-3-642-04128-0_58

K. Menger, Zur allgemeinen kurventheorie, Fund. Math, vol.10, pp.96-115, 1927.
DOI : 10.1007/bf02307626

R. Niedermeier, Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications), 2006.

N. Robertson and P. D. Seymour, 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
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson, P. D. Seymour, and R. Thomas, 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