S. Modelling-particle, 18 2.7.1 Modelling the load for the field solve phase 18 2.7.2 Modelling the load for the particle push phase, p.20

M. Multilevel-graph, 21 3.1.1 Constructing dual graphs The single-constraint problem, p.24

C. Space, 26 3.2.2 Basic idea of an algorithm for computing the Hilbert mapping The single-constraint domain decomposition problem, Two constraints, p.31

W. Splitting and N. Into, Proof: Problem is efficiently solvable, Remarks, p.41

.. Mixed-constraint-problems, 59 4.6.1 Mixed-constraint algorithm, p.61

]. B. Aspvall, M. M. Halldórsson, and F. Manne, Approximations for the general block distribution of a matrix, Theoretical Computer Science, vol.262, issue.1-2, pp.145-160, 2001.
DOI : 10.1016/S0304-3975(00)00187-0

M. Bader, Raumfüllende Kurven -begleitendes Skriptum zum entsprechenden Kapitel der Vorlesung Algorithmen des wissenschaftlichen Rechnens, Summer Term, 2004.

C. K. Birdsall and A. B. Langdon, Plasma Physics via Computer simulation, 1985.
DOI : 10.1887/0750301171

S. Boettcher and S. Mertens, Analysis of the Karmarkar-Karp differencing algorithm, The European Physical Journal B, vol.135, issue.1, 2008.
DOI : 10.1140/epjb/e2008-00320-9

A. R. Butz, Alternative Algorithm for Hilbert's Space-Filling Curve, IEEE Transactions on Computers, vol.20, issue.4, pp.424-426, 1971.
DOI : 10.1109/T-C.1971.223258

E. A. Carmona and L. J. Chandler, On parallel PIC versatility and the structure of parallel PIC approaches. Concurrency -Practice and Experience, pp.1377-1405, 1997.

J. Cioni, D. Issautier, F. Poupaud, and L. Fezoui, A 2-D Vlasov-Maxwell solver on unstructured meshes, Proceedings of the Third International Conference on Mathematical and Numerical Aspects of Wave Propagation, pp.187-204, 1995.

D. Issautier, F. Poupaud, J. Cioni, and L. Fezoui, A 2-D Vlasov-Maxwell solver on unstructured meshes, Third International Conference on Numerical Aspects of Wave Propagation, 1997.

C. Gotsman and M. Lindenbaum, On the metric properties of discrete space-filling curves, IEEE Transactions on Image Processing, vol.5, issue.5, pp.794-797, 1996.
DOI : 10.1109/83.499920

M. Grigni and F. Manne, On the complexity of the generalized block distribution, Workshop on Parallel Algorithms for Irregularly Structured Problems, pp.319-326, 1996.
DOI : 10.1007/BFb0030123

B. Hayes, The Easiest Hard Problem, American Scientist, vol.90, issue.2, 2002.
DOI : 10.1511/2002.2.113

B. Hendrickson and T. G. Kolda, Graph partitioning models for parallel computing, Parallel Computing, vol.26, issue.12, pp.1519-1534, 2000.
DOI : 10.1016/S0167-8191(00)00048-X

B. Hendrickson and A. Pothen, Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science, Lecture Notes in Computer Science, vol.4395, pp.260-280
DOI : 10.1007/978-3-540-71351-7_21

R. W. Hockney and J. W. Eastwood, Computer Simulation Using Particles, 1981.

J. Hungershöfer and J. Wierum, On the Quality of Partitions Based on Space-Filling Curves, ICCS '02: Proceedings of the International Conference on Computational Science-Part III, pp.36-45, 2002.
DOI : 10.1007/3-540-47789-6_4

K. Tseng and J. Wu, Parallel dsmc method using dynamic domain decomposition, International Journal for Numerical Methods in Engineering, vol.63, pp.37-76, 2005.

G. B. Jacobs and J. S. Hesthaven, High-order nodal discontinuous Galerkin particle-in-cell method on unstructured grids, Journal of Computational Physics, vol.214, issue.1, pp.96-121, 2006.
DOI : 10.1016/j.jcp.2005.09.008

G. Jin and J. Mellor-crummey, SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion, ACM Transactions on Mathematical Software, vol.31, issue.1, pp.120-148, 2005.
DOI : 10.1145/1055531.1055537

N. Karmarker and R. M. Karp, The differencing method of set partitioning, 1983.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

G. Karypis and V. Kumar, Metis -a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices -user manual. online, 1998.

G. Karypis and V. Kumar, Multilevel Algorithms for Multi-Constraint Graph Partitioning, Proceedings of the IEEE/ACM SC98 Conference, 1998.
DOI : 10.1109/SC.1998.10018

B. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-308, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

J. Lawder, Calculation of mappings between one and n-dimensional values using the Hilbert space-filling curve, 2000.

S. Lanteri, M. Bernacki, and S. Piperno, Time-domain parallel simulation of heterogeneous wave propagation on unstructured grids using explicit, nondiffusive, discontinuous Galerkin methods, Journal of Computational Acoustics, vol.14, issue.1, pp.57-81, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00607725

S. Lanteri, M. Bernacki, L. Fezoui, and S. Piperno, Parallel discontinuous Galerkin unstructured mesh solvers for the calculation of three-dimensional wave propagation problems, Applied Mathematical Modelling, vol.30, pp.744-763, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00607722

H. Meyerhenke, B. Monien, and T. Sauerwald, A new diffusion-based multilevel algorithm for computing graph partitions of very high quality, 2008 IEEE International Symposium on Parallel and Distributed Processing, 2008.
DOI : 10.1109/IPDPS.2008.4536237

C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization, Algorithms and Complexity, 1998.

G. Rozenberg and A. Salomaa, Mathematical Theory of L Systems, 1980.

H. Sagan, Space Filling Curves, 1994.
DOI : 10.1007/978-1-4612-0871-6

S. Schamberger and J. Wierum, Graph Partitioning in Scientific Simulations: Multilevel Schemes versus Space-Filling Curves, PaCT, pp.165-179, 2003.
DOI : 10.1007/978-3-540-45145-7_14

B. Thidé, Electromagnetic Field Theory. online Book, 2007.

C. Walshaw, M. Cross, and K. Mcmanus, Multiphase mesh partitioning, Applied Mathematical Modelling, vol.25, issue.2, pp.123-140, 2000.
DOI : 10.1016/S0307-904X(00)00041-X

URL : http://doi.org/10.1016/s0307-904x(00)00041-x

J. Wu and K. Tseng, Parallel DSMC method using dynamic domain decomposition, International Journal for Numerical Methods in Engineering, vol.18, issue.1, pp.37-76, 2005.
DOI : 10.1002/nme.1232

G. Zumbusch, On the quality of space-filling curve induced partitions, Zeitschrift für angewandte Mathematik und Mechanik, pp.25-28, 2001.