N. Alon, G. Gutin, E. J. Kim, S. Szeider, and A. Yeo, Solving MAX-r-SAT above a tight lower bound, Proc. 21st SODA. ACM/SIAM, 2010.
DOI : 10.1007/s00453-010-9428-7
URL : http://arxiv.org/abs/0907.4573

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

N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995.
DOI : 10.1145/210332.210337

E. Althaus, S. Canzar, K. Elbassioni, A. Karrenbauer, and J. Mestre, Approximating the Interval Constrained Coloring Problem, Proc. 11th SWAT, pp.210-221, 2008.
DOI : 10.1007/978-3-540-69903-3_20
URL : https://hal.archives-ouvertes.fr/hal-00388513

E. Althaus, S. Canzar, M. R. Emmett, A. Karrenbauer, A. G. Marshall et al., Computing H/D-exchange speeds of single residues from data of peptic fragments, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.1273-1277, 2008.
DOI : 10.1145/1363686.1363981
URL : https://hal.archives-ouvertes.fr/hal-00388515

N. Betzler, On Problem Kernels for Possible Winner Determination under the k-Approval Protocol, 2009.
DOI : 10.1007/978-3-642-15155-2_12

N. Betzler and B. Dorn, Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules, Proc. 34th MFCS, pp.124-136, 2009.
DOI : 10.1016/j.artint.2008.11.005

N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. , Fixed-Parameter Algorithms for Kemeny Scores, Theor. Comput. Sci, issue.45, pp.4104454-4570, 2009.
DOI : 10.1007/978-3-540-68880-8_8

N. Betzler, J. Guo, C. Komusiewicz, and R. Niedermeier, Average parameterization and partial kernelization for computing medians, Proc. 9th LATIN, 2010.
DOI : 10.1007/978-3-642-12200-2_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.8046

N. Betzler, S. Hemmann, and R. Niedermeier, A multivariate complexity analysis of determining possible winners given incomplete votes, Proc. 21st IJCAI, pp.53-58, 2009.

H. L. Bodlaender, Kernelization: New Upper and Lower Bound Techniques, Proc. 4th IWPEC, pp.17-37, 2009.
DOI : 10.1007/978-3-642-11269-0_2

H. L. Bodlaender and A. M. Koster, Combinatorial Optimization on Graphs of Bounded Treewidth, The Computer Journal, vol.51, issue.3, pp.255-269, 2008.
DOI : 10.1093/comjnl/bxm037

P. Brass and C. Knauer, TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS, International Journal of Computational Geometry & Applications, vol.12, issue.01n02, pp.115-124, 2002.
DOI : 10.1142/S0218195902000761

R. Bredereck, Fixed-parameter algorithms for computing Kemeny scores?theory and practice, 2009.

J. Byrka, A. Karrenbauer, and L. Sanità, The interval constrained 3-coloring problem, Proc. 9th LATIN, 2010.

S. Cabello, P. Giannopoulos, and C. Knauer, On the parameterized complexity of d-dimensional point set pattern matching, Information Processing Letters, vol.105, issue.2, pp.73-77, 2008.
DOI : 10.1016/j.ipl.2007.08.003

S. Cabello, P. Giannopoulos, C. Knauer, D. Marx, and G. Rote, Geometric clustering, ACM Transactions on Algorithms, vol.7, issue.4, 2008.
DOI : 10.1145/2000807.2000811

L. Cai, Parameterized complexity of vertex colouring, Discrete Applied Mathematics, vol.127, issue.3, pp.415-429, 2003.
DOI : 10.1016/S0166-218X(02)00242-1

L. Cai, X. Huang, C. Liu, F. A. Rosamond, and Y. Song, Parameterized Complexity and Biopolymer Sequence Comparison, The Computer Journal, vol.51, issue.3, pp.270-291, 2008.
DOI : 10.1093/comjnl/bxm035
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.7468

J. Chen, B. Chor, M. Fellows, X. Huang, D. W. Juedes et al., Tight lower bounds for certain parameterized NP-hard problems, Information and Computation, vol.201, issue.2, pp.216-231, 2005.
DOI : 10.1016/j.ic.2005.05.001

J. Chen, I. A. Kanj, and G. Xia, Improved Parameterized Upper Bounds for Vertex Cover, Proc. 31st MFCS, pp.238-249, 2006.
DOI : 10.1007/11821069_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.831

J. Chen and J. Meng, On Parameterized Intractability: Hardness and Completeness, The Computer Journal, vol.51, issue.1, pp.39-59, 2008.
DOI : 10.1093/comjnl/bxm036
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.8486

V. G. Dein?ko, M. Hoffmann, Y. Okamoto, and G. J. Woeginger, The Traveling Salesman Problem with Few Inner Points, Oper. Res. Lett, vol.34, issue.1, pp.106-110, 2006.
DOI : 10.1007/978-3-540-27798-9_30

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, pp.613-622, 2001.
DOI : 10.1145/371920.372165

M. Fellows, Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology, Proc. IWOCA, pp.2-10, 2009.
DOI : 10.1007/978-3-642-10217-2_2

M. Fellows, D. Lokshtanov, N. Misra, M. Mnich, F. Rosamond et al., The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number, Theory of Computing Systems, vol.92, issue.4, pp.822-848, 2009.
DOI : 10.1007/s00224-009-9167-9

M. R. Fellows, J. Gramm, and R. Niedermeier, On The Parameterized Intractability Of Motif Search Problems*, Combinatorica, vol.26, issue.2, pp.141-167, 2006.
DOI : 10.1007/s00493-006-0011-4

M. R. Fellows, D. Lokshtanov, N. Misra, F. A. Rosamond, and S. Saurabh, Graph Layout Problems Parameterized by Vertex Cover, Proc. 19th ISAAC, pp.294-305, 2008.
DOI : 10.1007/978-3-540-92182-0_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.3606

M. R. Fellows, F. A. Rosamond, F. V. Fomin, D. Lokshtanov, S. Saurabh et al., Local search: Is brute-force avoidable?, Proc. 21st IJCAI, pp.486-491, 2009.
DOI : 10.1016/j.jcss.2011.10.003
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.4797

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

M. Frances and A. Litman, On covering problems of codes, Theory of Computing Systems, vol.30, issue.2, pp.113-119, 1997.
DOI : 10.1007/BF02679443

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, 1979.

P. Giannopoulos, C. Knauer, and G. Rote, The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension, Proc. 4th IWPEC, pp.198-209, 2009.
DOI : 10.1007/978-3-642-11269-0_16

P. Giannopoulos, C. Knauer, and S. Whitesides, Parameterized Complexity of Geometric Problems, The Computer Journal, vol.51, issue.3, pp.372-384, 2008.
DOI : 10.1093/comjnl/bxm053

J. Gramm, J. Guo, and R. Niedermeier, Parameterized Intractability of Distinguishing Substring Selection, Theory of Computing Systems, vol.39, issue.4, pp.545-560, 2006.
DOI : 10.1007/s00224-004-1185-z

J. Gramm, R. Niedermeier, and P. Rossmanith, Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems, Algorithmica, vol.37, issue.1, pp.25-42, 2003.
DOI : 10.1007/s00453-003-1028-3

J. Guo, F. Hüffner, and R. Niedermeier, A Structural View on Parameterizing Problems: Distance from Triviality, Proc. 1st IWPEC, pp.162-173, 2004.
DOI : 10.1007/978-3-540-28639-4_15

J. Guo, H. Moser, and R. Niedermeier, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, Algorithmics of Large and Complex Networks, pp.65-80, 2009.
DOI : 10.2174/157489306775330570
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.1144

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

P. Hlin?n´hlin?n´y, S. Oum, D. Seese, and G. Gottlob, Width Parameters Beyond Tree-width and their Applications, The Computer Journal, vol.51, issue.3, pp.326-362, 2008.
DOI : 10.1093/comjnl/bxm052

M. Hoffmann and Y. Okamoto, The minimum weight triangulation problem with few inner points, Computational Geometry, vol.34, issue.3, pp.149-158, 2006.
DOI : 10.1016/j.comgeo.2005.11.006

F. Hüffner, R. Niedermeier, and S. Wernicke, Techniques for Practical Fixed-Parameter Algorithms, The Computer Journal, vol.51, issue.1, pp.7-25, 2008.
DOI : 10.1093/comjnl/bxm040

S. Khuller, R. Bhatia, and R. Pless, On Local Search and Placement of Meters in Networks, SIAM Journal on Computing, vol.32, issue.2, pp.470-487, 2003.
DOI : 10.1137/S0097539799363359

C. Komusiewicz, R. Niedermeier, and J. Uhlmann, Deconstructing Intractability: A Case Study for Interval??Constrained??Coloring, Proc. 20th CPM, pp.207-220, 2009.
DOI : 10.1007/3-540-36478-1_17

S. Kratsch and P. Schweitzer, Graph isomorphism parameterized by feedback vertex set number is fixed-parameter tractable, 2009.

B. Ma and X. Sun, More efficient algorithms for closest string and substring problems, Proc. 12th RECOMB, pp.396-409, 2008.
DOI : 10.1007/978-3-540-78839-3_33
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.496

M. Mahajan and V. Raman, Parameterizing above Guaranteed Values: MaxSat and MaxCut, Journal of Algorithms, vol.31, issue.2, pp.335-354, 1999.
DOI : 10.1006/jagm.1998.0996

M. Mahajan, V. Raman, and S. Sikdar, Parameterizing above or below guaranteed values, Journal of Computer and System Sciences, vol.75, issue.2, pp.137-153, 2009.
DOI : 10.1016/j.jcss.2008.08.004
URL : http://doi.org/10.1016/j.jcss.2008.08.004

D. Marx, Parameterized coloring problems on chordal graphs, Theoretical Computer Science, vol.351, issue.3, pp.407-424, 2006.
DOI : 10.1016/j.tcs.2005.10.008
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.9588

D. Marx, Closest Substring Problems with Small Distances, SIAM Journal on Computing, vol.38, issue.4, pp.1382-1410, 2008.
DOI : 10.1137/060673898

D. Marx, Parameterized Complexity and Approximation Algorithms, The Computer Journal, vol.51, issue.1, pp.60-78, 2008.
DOI : 10.1093/comjnl/bxm048
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.728

D. Marx, Searching the k-change neighborhood for TSP is W[1]-hard, Operations Research Letters, vol.36, issue.1, pp.31-36, 2008.
DOI : 10.1016/j.orl.2007.02.008

H. Moser, R. Niedermeier, and M. Sorge, Algorithms and Experiments for Clique Relaxations???Finding Maximum s-Plexes, Proc. 8th SEA, pp.233-244, 2009.
DOI : 10.1007/978-3-642-02011-7_22

R. Niedermeier, Ubiquitous Parameterization ??? Invitation to Fixed-Parameter Algorithms, Proc. 29th MFCS, pp.84-103, 2004.
DOI : 10.1007/978-3-540-28629-5_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.1362

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6357

N. Simjour, Improved Parameterized Algorithms for the Kemeny Aggregation Problem, Proc. 4th IWPEC, pp.312-323, 2009.
DOI : 10.1007/978-3-642-11269-0_26

C. Sloper and J. A. Telle, An Overview of Techniques for Designing Parameterized Algorithms, The Computer Journal, vol.51, issue.1, pp.122-136, 2008.
DOI : 10.1093/comjnl/bxm038

Y. Song, C. Liu, X. Huang, R. L. Malmberg, Y. Xu et al., Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.423-432, 2006.
DOI : 10.1109/TCBB.2006.52

L. Wang and B. Zhu, Efficient Algorithms for the Closest String and Distinguishing String Selection Problems, Proc. 3rd FAW, pp.261-270, 2009.
DOI : 10.1007/s00453-003-1028-3