H. L. Bodlaender and T. Kloks, Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs, Journal of Algorithms, vol.21, issue.2, pp.358-402, 1996.
DOI : 10.1006/jagm.1996.0049

H. L. Bodlaender and T. Hagerup, Parallel Algorithms with Optimal Speedup for Bounded Treewidth, SIAM Journal on Computing, vol.27, issue.6, pp.1725-1746, 1998.
DOI : 10.1137/S0097539795289859

A. Maheshwari and N. Zeh, I/O-Efficient Algorithms for Graphs of Bounded Treewidth, Algorithmica, vol.9, issue.1, pp.413-469, 2009.
DOI : 10.1007/s00453-007-9131-5

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

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.423-434, 2009.
DOI : 10.1016/j.jcss.2009.04.001

F. V. Fomin, D. Lokshtanov, N. Misra, and S. Saurabh, Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.470-479, 2012.
DOI : 10.1109/FOCS.2012.62

E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith et al., Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions, Proc. ICALP 2013, pp.613-624, 2013.
DOI : 10.1007/978-3-642-39206-1_52
URL : https://hal.archives-ouvertes.fr/hal-01383776

A. Drucker, New limits to classical and quantum instance compression, Proc. FOCS 2012, pp.609-618, 2012.

T. Hagerup, Simpler Linear-Time Kernelization for Planar Dominating Set, Proc. IPEC 2012, pp.181-193, 2012.
DOI : 10.1007/s00224-007-9032-7

R. Van-bevern, S. Hartung, F. Kammer, R. Niedermeier, and M. Weller, Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs, Proc. IPEC 2012, pp.194-206, 2012.
DOI : 10.1145/1233481.1233493

L. Arge, M. T. Goodrich, M. Nelson, and N. Sitchinava, Fundamental parallel algorithms for private-cache chip multiprocessors, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, SPAA '08, pp.197-206, 2008.
DOI : 10.1145/1378533.1378573

A. Aggarwal, . Vitter, and S. Jeffrey, The input/output complexity of sorting and related problems, Communications of the ACM, vol.31, issue.9, pp.1116-1127, 1988.
DOI : 10.1145/48529.48535
URL : https://hal.archives-ouvertes.fr/inria-00075827

H. L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Bidimensionality and Kernels, Proc. SODA 2010, pp.503-510, 2010.
DOI : 10.1137/1.9781611973075.43

C. Komusiewicz and R. Niedermeier, New Races in Parameterized Algorithmics, MFCS 2012, pp.19-30, 2012.
DOI : 10.1007/978-3-642-32589-2_2

G. Greiner, Sparse Matrix Computations and their I/O Complexity. Dissertation, 2012.

Y. J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff et al., External-memory graph algorithms, Proc. SODA, pp.139-149, 1995.

I. Katriel and U. Meyer, Elementary Graph Algorithms in External Memory, LNCS, vol.2625, pp.62-84, 2003.
DOI : 10.1007/3-540-36574-5_4

L. Arge, M. T. Goodrich, and N. Sitchinava, Parallel external memory graph algorithms, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pp.1-11, 2010.
DOI : 10.1109/IPDPS.2010.5470440

N. Dadoun and D. G. Kirkpatrick, Parallel construction of subdivision hierarchies, Journal of Computer and System Sciences, vol.39, issue.2, pp.153-165, 1989.
DOI : 10.1016/0022-0000(89)90042-1

U. Vishkin, Randomized speed-ups in parallel computation, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.230-239, 1984.
DOI : 10.1145/800057.808686

E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith et al., Linear kernels and single-exponential algorithms via protrusion decompositions, p.835, 2012.
DOI : 10.1007/978-3-642-39206-1_52
URL : https://hal.archives-ouvertes.fr/hal-01383776

R. Jacob, T. Lieber, and N. Sitchinava, On the Complexity of List Ranking in the Parallel External Memory Model, Proc. MFCS. (2014)
DOI : 10.1007/978-3-662-44465-8_33