On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. - Sylvain Guillemot; Christophe Paul; Anthony Perez 001 (IPEC, 2010)

On the (non-)existence of polynomial kernels for Pl-free edge modification problems - Sylvain Guillemot; Christophe Paul; Anthony Perez 001 (CoRR, 2010)

Polynomial kernels for 3-leaf power graph modification problems. - Stéphane Bessy; Christophe Paul; Anthony Perez 001 (Discret. Appl. Math., 2010)

Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (MFCS, 2011)

Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (CoRR, 2011)

Kernels for feedback arc set in tournaments. - Stéphane Bessy; Fedor V. Fomin; Serge Gaspers; Christophe Paul; Anthony Perez 001; Saket Saurabh 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2011)

Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures. (Kernelization algorithms for graph and other structures modification problems). - Anthony Perez 001 (2011)

On the kernelization of ranking r-CSP in tournaments - Anthony Perez 001 (CoRR, 2012)

Detecting Social Capitalists on Twitter Using Similarity Measures. - Nicolas Dugué; Anthony Perez 001 (CompleNet, 2013)

Les capitalistes sociaux sur Twitter : détection via des mesures de similarité. - Nicolas Dugué; Anthony Perez 001 (EGC, 2013)

Exact Algorithms for Weak Roman Domination. - Mathieu Chapelle; Manfred Cochefert; Jean-François Couturier 001; Dieter Kratsch; Mathieu Liedloff; Anthony Perez 001 (IWOCA, 2013)

Linear Vertex-kernels for Several Dense Ranking r -Constraint Satisfaction Problems. - Anthony Perez 001 (TAMC, 2013)

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. - Sylvain Guillemot; Frédéric Havet; Christophe Paul; Anthony Perez 001 (Algorithmica, 2013)

Rôle communautaire des capitalistes sociaux dans Twitter. - Nicolas Dugué; Vincent Labatut; Anthony Perez 001 (CoRR, 2013)

Polynomial kernels for Proper Interval Completion and related problems. - Stéphane Bessy; Anthony Perez 001 (Inf. Comput., 2013)

Identifying the community roles of social capitalists in the Twitter network. - Vincent Labatut; Nicolas Dugué; Anthony Perez 001 (ASONAM, 2014)

On the importance of considering social capitalism when measuring influence on Twitter - Maximilien Danisch; Nicolas Dugué; Anthony Perez 001 (BESC, 2014)

Identification de rôles communautaires dans des réseaux orientés appliquée à Twitter. - Nicolas Dugué; Vincent Labatut; Anthony Perez 001 (EGC, 2014)

Social capitalists on Twitter: detection, evolution and behavioral analysis. - Nicolas Dugué; Anthony Perez 001 (Soc. Netw. Anal. Min., 2014)

A reliable and evolutive web application to detect social capitalists. - Nicolas Dugué; Anthony Perez 001; Maximilien Danisch; Florian Bridoux; Amélie Daviau; Tennessy Kolubako; Simon Munier; Hugo Durbano (ASONAM, 2015)

An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. - Christophe Crespelle; Anthony Perez 001; Ioan Todinca (WG, 2015)

On the kernelization of ranking r-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments. - Anthony Perez 001 (Discret. Appl. Math., 2015)

A community role approach to assess social capitalists visibility in the Twitter network. - Nicolas Dugué; Vincent Labatut; Anthony Perez 001 (Soc. Netw. Anal. Min., 2015)

Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2016)

Bringing a Feature Selection Metric from Machine Learning to Complex Networks. - Nicolas Dugué; Jean-Charles Lamirel; Anthony Perez 001 (COMPLEX NETWORKS (2), 2018)

Exact algorithms for weak Roman domination. - Mathieu Chapelle; Manfred Cochefert; Jean-François Couturier 001; Dieter Kratsch; Romain Letourneur; Mathieu Liedloff; Anthony Perez 001 (Discret. Appl. Math., 2018)

An O(n2) time algorithm for the minimal permutation completion problem. - Christophe Crespelle; Anthony Perez 001; Ioan Todinca (Discret. Appl. Math., 2019)

SINr: Fast Computing of Sparse Interpretable Node Representations is not a Sin! - Thibault Prouteau; Victor Connes; Nicolas Dugué; Anthony Perez 001; Jean-Charles Lamirel; Nathalie Camelin; Sylvain Meignier (IDA, 2021)

Polynomial Kernels for Strictly Chordal Edge Modification Problems. - Maël Dumas; Anthony Perez 001; Ioan Todinca (IPEC, 2021)

GeST: A New Image Segmentation Technique based on Graph Embedding. - Anthony Perez 001 (VISIGRAPP (4: VISAPP), 2021)

Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. - Christophe Crespelle; Benjamin Gras 002; Anthony Perez 001 (WG, 2021)

On the Complexity of Broadcast Domination and Multipacking in Digraphs. - Florent Foucaud; Benjamin Gras 002; Anthony Perez 001; Florian Sikora (Algorithmica, 2021)

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. - Jean-Charles Lamirel; Younes Gueddari; Yuqi Wang; Pascal Cuxac; Anthony Perez 001; Nicolas Dugué (Scientometrics, 2021)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (ISAAC, 2022)

An Improved Kernelization Algorithm for Trivially Perfect Editing. - Maël Dumas; Anthony Perez 001 (IPEC, 2023)

Superpixels algorithms through network community detection. - Anthony Perez 001 (CoRR, 2023)

A Cubic Vertex-Kernel for Trivially Perfect Editing. - Maël Dumas; Anthony Perez 001; Ioan Todinca (Algorithmica, 2023)

Detecting K2,3 as an Induced Minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (IWOCA, 2024)

Detecting K2, 3 as an induced minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (CoRR, 2024)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (SIAM J. Discret. Math., 2024)

Sufficient Conditions for Polynomial-Time Detection of Induced Minors. - Clément Dallard; Maël Dumas; Claire Hilaire; Anthony Perez 001 (SOFSEM (1), 2025)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs. - Maël Dumas; Anthony Perez 001; Mathis Rocton; Ioan Todinca (Discret. Math. Theor. Comput. Sci., 2025)