C. Alcaraz, E. Miciolino, and S. Wolthusen, Structural Controllability of Networks for Non-interactive Adversarial Vertex Removal, Proceedings of the Eighth International Conference on Critical Information Infrastructures Security, pp.129-132, 2013.
DOI : 10.1007/978-3-319-03964-0_11

C. Alcaraz, E. Miciolino, and S. Wolthusen, Multi-round Attacks on Structural Controllability Properties for Non-complete Random Graphs, Proceedings of the Sixteenth Information Security Conference, 2014.
DOI : 10.1007/978-3-319-27659-5_10

D. Atkins, T. Haynes, and M. Henning, Placing monitoring devices in electric power networks modeled by block graphs, Ars Combinatorica, vol.79, 2006.

A. Barabasi, R. Albert, and H. Jeong, Scale-free characteristics of random networks: The topology of the world-wide web, Physica A: Statistical Mechanics and its Applications, pp.1-4, 2000.

J. Brueni and L. Heath, The PMU Placement Problem, SIAM Journal on Discrete Mathematics, vol.19, issue.3, pp.744-761, 2005.
DOI : 10.1137/S0895480103432556

M. Dorfling and M. Henning, A note on power domination in grid graphs, Discrete Applied Mathematics, vol.154, issue.6, pp.1023-1027, 2006.
DOI : 10.1016/j.dam.2005.08.006

Y. Dourisboure and C. Gavoille, Tree-decompositions with bags of small diameter, Discrete Mathematics, vol.307, issue.16, pp.2008-2029, 2008.
DOI : 10.1016/j.disc.2005.12.060
URL : https://hal.archives-ouvertes.fr/hal-00307800

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

J. Guo and R. Niedermeier, Exact algorithms and applications for treelike weighted set cover, Journal of Discrete Mathematics, vol.4, issue.4, pp.608-622, 2006.

J. Guo, R. Niedermeier, and D. Raible, Improved Algorithms and Complexity Results for Power Domination in Graphs, Algorithmica, vol.10, issue.4, pp.177-202, 2008.
DOI : 10.1007/s00453-007-9147-x

T. Haynes, S. Hedetniemi, S. Hedetniemi, and M. Henning, Domination in Graphs Applied to Electric Power Networks, SIAM Journal on Discrete Mathematics, vol.15, issue.4, pp.519-529, 2002.
DOI : 10.1137/S0895480100375831

R. Kalman, Mathematical Description of Linear Dynamical Systems, Journal of the Society for Industrial and Applied Mathematics Series A Control, vol.1, issue.2, pp.152-192, 1963.
DOI : 10.1137/0301010

J. Kneis, D. Molle, S. Richter, and P. Rossmanith, Parameterized power domination complexity, Information Processing Letters, vol.98, issue.4, pp.145-149, 2006.
DOI : 10.1016/j.ipl.2006.01.007

H. Mayeda, On structural controllability theorem, IEEE Transactions on Automatic Control, vol.26, issue.3, pp.795-798, 1981.
DOI : 10.1109/TAC.1981.1102707

K. Pai, J. Chang, and Y. Wang, Restricted power domination and fault-tolerant power domination on grids, Discrete Applied Mathematics, vol.158, issue.10, pp.1079-1089, 2010.
DOI : 10.1016/j.dam.2010.03.001

C. Palmer and J. Steffan, Generating network topologies that obey power laws, Globecom '00, IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), pp.434-438, 2000.
DOI : 10.1109/GLOCOM.2000.892042