Anthony Perez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anthony Perez has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Nicolas Dugué
LIUM Computer Science Laboratory, University of Le Mans, Le Mans, France
5 shared publications - Claire Hilaire
University of Primorska
2 shared publications - Clément Dallard
Department of Informatics University of Fribourg Fribourg Switzerland
2 shared publications - Vincent Labatut
Laboratoire Informatique d’Avignon, Avignon, France
2 shared publications Benjamin Gras
Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022
1 shared publication- Benjamin Gras
Universität Trier, Fachbereich IV, Informatikwissenschaften
1 shared publication
Latest Publications
- 7 February 2025
- Published by Springer Nature
- p. 195-208
Sufficient Conditions for Polynomial-Time Detection of Induced Minors
- 7 February 2025
- Published by Springer Nature
- p. 195-208
Sufficient Conditions for Polynomial-Time Detection of Induced Minors
- 17 May 2021
- Published by Springer Nature in Scientometrics
- Vol. 126 (7) , 6273-6300
Analysis of the dynamics and influence of the research work of Prof. Liu Zeyuan in China featuring a new hybrid approach combining community detection with topic tracking
- 17 May 2021
- Published by Springer Nature in Scientometrics
- Vol. 126 (7) , 6273-6300
Analysis of the dynamics and influence of the research work of Prof. Liu Zeyuan in China featuring a new hybrid approach combining community detection with topic tracking
- 26 April 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (9) , 2651-2677
On the Complexity of Broadcast Domination and Multipacking in Digraphs
- 26 April 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (9) , 2651-2677
On the Complexity of Broadcast Domination and Multipacking in Digraphs
- 29 May 2020
- Published by Springer Nature
- Vol. 12126, 264-276
On the Complexity of Broadcast Domination and Multipacking in Digraphs
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph D is a function \(f:V(D)\rightarrow \mathbb {N}\) such that for each vertex v of D, there exists a vertex t with \(f(t)>0\) having a directed path to v of length at most f(t). The cost of f is the sum of f(v) over all vertices v. A multipacking is a set S of vertices of D such that for each vertex v of D and for every integer d, there are at most d vertices from S within directed distance at most d from v. The maximum size of a multipacking of D is a lower bound to the minimum cost of a dominating broadcast of D. Let Broadcast Domination denote the problem of deciding whether a given digraph D has a dominating broadcast of cost at most k, and Multipacking the problem of deciding whether D has a multipacking of size at least k. It is known that Broadcast Domination is polynomial-time solvable for the class of all undirected graphs (that is, symmetric digraphs), while polynomial-time algorithms for Multipacking are known only for a few classes of undirected graphs. We prove that Broadcast Domination and Multipacking are both NP-complete for digraphs, even for planar layered acyclic digraphs of small maximum degree. Moreover, when parameterized by the solution cost/solution size, we show that the problems are respectively W[2]-hard and W[1]-hard. We also show that Broadcast Domination is FPT on acyclic digraphs, and that it does not admit a polynomial kernel for such inputs, unless the polynomial hierarchy collapses to its third level. In addition, we show that both problems are FPT when parameterized by the solution cost/solution size together with the maximum out-degree. Finally, we give for both problems polynomial-time algorithms for some subclasses of acyclic digraphs.- 29 May 2020
- Published by Springer Nature
- Vol. 12126, 264-276
On the Complexity of Broadcast Domination and Multipacking in Digraphs
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph D is a function \(f:V(D)\rightarrow \mathbb {N}\) such that for each vertex v of D, there exists a vertex t with \(f(t)>0\) having a directed path to v of length at most f(t). The cost of f is the sum of f(v) over all vertices v. A multipacking is a set S of vertices of D such that for each vertex v of D and for every integer d, there are at most d vertices from S within directed distance at most d from v. The maximum size of a multipacking of D is a lower bound to the minimum cost of a dominating broadcast of D. Let Broadcast Domination denote the problem of deciding whether a given digraph D has a dominating broadcast of cost at most k, and Multipacking the problem of deciding whether D has a multipacking of size at least k. It is known that Broadcast Domination is polynomial-time solvable for the class of all undirected graphs (that is, symmetric digraphs), while polynomial-time algorithms for Multipacking are known only for a few classes of undirected graphs. We prove that Broadcast Domination and Multipacking are both NP-complete for digraphs, even for planar layered acyclic digraphs of small maximum degree. Moreover, when parameterized by the solution cost/solution size, we show that the problems are respectively W[2]-hard and W[1]-hard. We also show that Broadcast Domination is FPT on acyclic digraphs, and that it does not admit a polynomial kernel for such inputs, unless the polynomial hierarchy collapses to its third level. In addition, we show that both problems are FPT when parameterized by the solution cost/solution size together with the maximum out-degree. Finally, we give for both problems polynomial-time algorithms for some subclasses of acyclic digraphs.- Open Access
- 14 June 2015
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 5 (1) , 1-13
A community role approach to assess social capitalists visibility in the Twitter network
- 14 June 2015
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 5 (1) , 1-13
Open AccessA community role approach to assess social capitalists visibility in the Twitter network
- 11 March 2014
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 4 (1) , 1-15
Social capitalists on Twitter: detection, evolution and behavioral analysis
- 11 March 2014
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 4 (1) , 1-15
Social capitalists on Twitter: detection, evolution and behavioral analysis
- Open Access
Rôle communautaire des capitalistes sociaux dans Twitter
Les capitalistes sociaux sont des utilisateurs de m\'edias sociaux tels que Twitter, appliquant diverses techniques pour obtenir un maximum de visibilit\'e. Ils peuvent \^etre n\'efastes \`a l'\'equilibre du service, dans la mesure o\`u leurs comptes, en gagnant en importance sans r\'eelle raison de contenu, rendent difficile l'acc\`es \`a un contenu pertinent. Dans ce travail, nous nous int\'eressons \`a leur caract\'erisation d'un point de vue purement topologique, i.e. sans consid\'erer la nature des contenus partag\'es. Nous utilisons pour cela la notion de r\^ole communautaire, qui est bas\'ee sur la structure de communaut\'es du r\'eseau \'etudi\'e. Nous apportons des modifications \`a des mesures pr\'ec\'edemment d\'efinies \`a cet effet, et proposons une m\'ethode objective de d\'etection des r\^oles. Nous appliquons ensuite notre m\'ethode \`a l'analyse d'un r\'eseau repr\'esentant Twitter. Nos r\'esultats montrent que les r\^oles que nous identifions via nos mesures se r\'ev\`elent particuli\`erement coh\'erents par rapport aux capitalistes sociaux du r\'eseau Twitter, dont le comportement est clairement identifi\'e---Social capitalists are social media users taking advantage of various methods to maximize their visibility. This results in artificially important accounts, in the sense this importance is not backed by any real content. The risk is then to see those accounts hiding relevant contents and therefore preventing other users to access them. In this work, we want to characterize social capitalists from a purely topological perspective, i.e. without considering the nature of the shared contents. For this purpose, we use the notion of community role, based on the community structure of the studied network. We modify some measures previously designed for this matter, and propose an objective method to determine roles. We then apply this method to the analysis of a Twitter network. Our results show the roles identified through our measures are particularly consistent with Twitter's social capitalists, whose behavior was clearly identified.
Open AccessRôle communautaire des capitalistes sociaux dans Twitter
Les capitalistes sociaux sont des utilisateurs de m\'edias sociaux tels que Twitter, appliquant diverses techniques pour obtenir un maximum de visibilit\'e. Ils peuvent \^etre n\'efastes \`a l'\'equilibre du service, dans la mesure o\`u leurs comptes, en gagnant en importance sans r\'eelle raison de contenu, rendent difficile l'acc\`es \`a un contenu pertinent. Dans ce travail, nous nous int\'eressons \`a leur caract\'erisation d'un point de vue purement topologique, i.e. sans consid\'erer la nature des contenus partag\'es. Nous utilisons pour cela la notion de r\^ole communautaire, qui est bas\'ee sur la structure de communaut\'es du r\'eseau \'etudi\'e. Nous apportons des modifications \`a des mesures pr\'ec\'edemment d\'efinies \`a cet effet, et proposons une m\'ethode objective de d\'etection des r\^oles. Nous appliquons ensuite notre m\'ethode \`a l'analyse d'un r\'eseau repr\'esentant Twitter. Nos r\'esultats montrent que les r\^oles que nous identifions via nos mesures se r\'ev\`elent particuli\`erement coh\'erents par rapport aux capitalistes sociaux du r\'eseau Twitter, dont le comportement est clairement identifi\'e---Social capitalists are social media users taking advantage of various methods to maximize their visibility. This results in artificially important accounts, in the sense this importance is not backed by any real content. The risk is then to see those accounts hiding relevant contents and therefore preventing other users to access them. In this work, we want to characterize social capitalists from a purely topological perspective, i.e. without considering the nature of the shared contents. For this purpose, we use the notion of community role, based on the community structure of the studied network. We modify some measures previously designed for this matter, and propose an objective method to determine roles. We then apply this method to the analysis of a Twitter network. Our results show the roles identified through our measures are particularly consistent with Twitter's social capitalists, whose behavior was clearly identified.
- 1 January 2013
- Published by Springer Nature
- p. 1-12
Detecting Social Capitalists on Twitter Using Similarity Measures
- 1 January 2013
- Published by Springer Nature
- p. 1-12
Detecting Social Capitalists on Twitter Using Similarity Measures
- 21 February 2012
- Published by Springer Nature in Algorithmica
- Vol. 65 (4) , 900-926
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems
- 21 February 2012
- Published by Springer Nature in Algorithmica
- Vol. 65 (4) , 900-926
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems