Rosa Figueiredo
Présentation
Biographie : I received a Ph.D in Computer Science (specialization Operations Research, Combinatorial Optimization) from the Systems Engineering and Computer Science Program of the Federal University of Rio de Janeiro in 2005. Between 1999 and 2009, I was associate professor in the State University of Rio de Janeiro. From 2009 to 2013 I was a researcher at the Center for Research and Development in Mathematics and Applications (CIDMA) of Department of Mathematics, University of Aveiro. Between 2013 and 2014, I was a post-doctoral researcher at Heudiasyc, University of Technology of Compiègne. Since October 2014 I integrate the LIA (Laboratoire Informatique d'Avignon) as associate professor.
Publications
Publications
|
|
The Capacitated Mobile p-Median Problem with Dynamic DemandROADEF 2026, Université de Tours [UT], Feb 2026, Tours, France |
|
|
Nouvelle modélisation des jeux extensifs basée sur des graphes24ème congrès annuel de la Société Francaise de Recherche Opérationnelle et d'Aide à la Décision, Feb 2023, Rennes, France |
|
|
Découverte de connaissances et apprentissage dans les données graphes : Application aux marchés publics françaisAtelier Decade : DEcouverte de Connaissances et Apprentissage dans les Données graphEs, Jul 2023, Strasbourg, France |
|
|
Pattern Mining for Anomaly Detection in Graphs: Application to Fraud in Public ProcurementEuropean Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD), Sep 2023, Torino, Italy. ⟨10.1007/978-3-031-43427-3_5⟩ |
|
|
Utilisation de graphes pour la détection de corruption dans les marchés publics24ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Feb 2023, Rennes, France |
|
|
Extraction de motifs pour la détection d’anomalies dans des graphes : application à la fraude dans les marchés publicsExtraction et Gestion des Connaissances (EGC), Jan 2023, Lyon, France. pp.289-296 |
|
|
Multiplicity in Signed Graph Partitioning32. European Conference On Operational Research (EURO), Jul 2022, Helsinki, France |
The roll-out of new mobile technologies as a timing game23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France |
|
|
|
The 2-machine robust flow shop problem under budgeted uncertainty22eme Conferénce ROADEF de la société Française de Recherche Opérationnelle et d'Aide à la Décision, Apr 2021, Mulhouse, France |
|
|
Problème de Correlation Clustering avec MédiateursConférence ROADEF 2020, Feb 2020, Montpellier, France |
|
|
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operatorROADEF 2020 - 21e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, LIRMM, Feb 2020, Montpellier, France |
|
|
Real-time energy scheduling for microgrids based on the Contract Collaboration Problem21e congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2020), Feb 2020, Montpellier, France |
|
|
Characterizing measures for the assessment of cluster analysis and community detection11ème Conférence Modèles & Analyse de Réseaux : approches mathématiques et informatiques (MARAMI), Oct 2020, Montpellier (en ligne), France. pp.4 |
|
|
Multiple Partitioning of Multiplex Signed Networks21ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2020, Montpellier, France |
|
|
Real-time command strategies for smart grids based on the Robust Contract-based Collaboration ProblemInternational Network Optimization Conference (INOC 2019), Jun 2019, Avignon, France |
|
|
Optimisation conjointe des investissements réseaux mobiles et des migrations des abonnésROADEF 2019 - 20e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2019, Le Havre, France |
|
|
Optimizing the investments in mobile network technologies and designing of offersINOC 2019 - 9th International Network Optimization Conference, Jun 2019, Avignon, France |
|
|
Bi-level formulation for Minimizing Energy and Link Utilization in ISP Backbone Networks with Multipath Routing ProtocolROADEF 2019 - 20e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, LITIS; LMAH, Feb 2019, Le Havre, France |
Optimizing Network Investments and Designing of Offers for an OperatorPGMODAYS 2019 - 8th Annual Conference of the Gaspard Monge Program for Optimization, Operations Research, and their interactions with Data Sciences, Dec 2019, Paris, France |
|
|
|
Vehicle routing problem for information collection in wireless networksICORES 2019 - 8th International Conference on Operations Research and Enterprise Systems, Feb 2019, Prague, Czech Republic |
|
|
Multiple Optimal Solutions but Single Search: A Study of the Correlation Clustering Problem20ème congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2019, Le Havre, France |
|
|
Exact Algorithms for Fixed Charge Network Design Problem with User-Optimal FlowsIWOBIP 2018 - 2nd International Workshop on Bilevel Programming, Jun 2018, Lille, France |
|
|
Exact Algorithms for Fixed Charge Network Design Problem with User Optimal FlowROADEF 2018 - 19e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2018, Lorient, France |
Study of the European Parliament votes through the multiple partitioning of signed multiplex networks29th European Conference On Operational Research (EURO), Jul 2018, Valencia, Spain |
|
|
|
Analysis of Roll-Calls in the European Parliament by Multiple Partitioning of Multiplex Signed Networks9ème Conférence Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques (MARAMI), Oct 2018, Avignon, France |
Exploiting Antagonistic Relations in Signed Graphs under the Structural Balance HypothesisPGMO Days, Dec 2018, Paris, France |
|
|
|
Signed Graph Analysis for the Interpretation of Voting BehaviorInternational Conference on Knowledge Technologies and Data-driven Business (i-KNOW), Oct 2017, Graz, Austria |
|
|
A distributed GPU-based Correlation Clustering algorithm for large-scale signed social networksBrazilian Symposium on High Performance Computing Systems, Oct 2017, Campinas, Brazil |
|
|
Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament2nd European Network Intelligence Conference (ENIC), Sep 2015, Karlskrona, Sweden. pp.122-129, ⟨10.1109/ENIC.2015.25⟩ |
|
|
A GPU-accelerated local search algorithm for the Correlation Clustering problemProceedings of the Brazilian Symposium on Operations Research, SOBRAPO - Brazilian Society of Operations Research, Aug 2015, Porto de Galinhas, PE, Brazil |
|
|
Informative Value of Negative Links for Graph Partitioning, with an application to European Parliament Votes6ème Conférence Modèles et Analyse de Réseaux : approches mathématiques et informatiques (MARAMI), 2015, Nîmes, France |
Robust Control Command Strategies in a Contract-Based Collaboration Framework.ISMP'2015, 22nd International Symposium on Mathematical Programming, 2015, Pittsburgh, United States |
|
|
|
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows2nd International Symposium on Combinatorial Optimization, Apr 2012, athens, Greece. pp.249-260, ⟨10.1007/978-3-642-32147-4_23⟩ |
|
|
A Tabu Search approach to solve a network design problem with user-optimal flowsALIO/EURO Workshop on Applied Combinatorial Optimization, 2008, Buenos Aires, Argentina |
|
|
Détection automatique de fraude dans les marchés publics : Application aux cas françaisMeetup LIAvignon, Nov 2022, Avignon, France. 2022 |
|
|
FOPPA: A database of French Open Public Procurement Award notices[Research Report] Avignon Université. 2022 |
|
|
2-Edge Connected Balanced Subgraphs for Correlation Clustering Problem[Research Report] Avignon Université. 2020 |
|
|
An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph[Research Report] arXiv:1312.4345. 2013 |