Lifo - Laboratoire d'Informatique Fondamentale d'orléans INSA Centre Val de Loire Université d'Orléans Université d'Orléans

Lifo > Publications de l'année 2022

 English Version


LIFO - Bâtiment IIIA
Rue Léonard de Vinci
B.P. 6759
F-45067 ORLEANS Cedex 2

Email: contact.lifo
Tel: +33 (0)2 38 41 99 29
Fax: +33 (0)2 38 41 71 37

Accès aux publications de l'année : 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023

Revue internationale à comité de lecture

Nirina Andrianarivelo & Pierre Réty, Modular termination of prefix-constrained term rewrite systems, Information Processing Letters, Elsevier. 2022. [URL]
Laurent Beaudou, Florent Foucaud & Reza Naserasr, Smallest $C2l+1$-critical graphs of odd-girth $2k+1$, Discrete Applied Mathematics, Vol. 319. Pp. 564 - 575, Elsevier. 2022. [URL]
Cherifa Ben Khelil, Chiraz Ben Othmane Zribi, Denys Duchier & Yannick Parmentier, Generating Arabic TAG for syntax-semantics analysis, Natural Language Engineering, Cambridge University Press (CUP). 03. 2022. [URL]
Arthur Braida, Simon Martiel & Ioan Todinca, On constant-time quantum annealing and guaranteed approximations for graph optimization problems, Quantum Science and Technology, Vol. 7(4). Pp. 045030, IOP Science. 09. 2022. [URL]
Nicolas Dugué & Anthony Perez, Direction matters in complex networks: A theoretical and applied study for greedy modularity optimization, Physica A: Statistical Mechanics and its Applications. Pp. 127798, Elsevier. 06. 2022. [URL]
Maël Dumas, Anthony Perez & Ioan Todinca, A Cubic Vertex-Kernel for Trivially Perfect Editing, Algorithmica, Springer Verlag. 11. 2022. [URL]
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou & Théo Pierron, Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity, Algorithmica, Vol. 84(5). Pp. 1183-1212, Springer Verlag. 01. 2022. [URL]
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller & Joe Ryan, Monitoring the edges of a graph using distances, Discrete Applied Mathematics, Vol. 319. Pp. 425-438, Elsevier. 2022. [URL]
Florent Foucaud & Tuomo Lehtilä, Revisiting and Improving Upper Bounds for Identifying Codes, SIAM Journal on Discrete Mathematics, Vol. 36(4). Pp. 2619-2634, Society for Industrial and Applied Mathematics. 12. 2022. [URL]
Cristina Morimoto, Aurora Pozo & Marcílio C.P. de Souto, An analysis of the admissibility of the objective functions applied in evolutionary multi-objective clustering, Information Sciences, Vol. 610. Pp. 1143-1162, Elsevier. 09. 2022. [URL]
Nicolas Ollinger & Guillaume Theyssier, Freezing, Bounded-Change and Convergent Cellular Automata, Discrete Mathematics and Theoretical Computer Science, Vol. vol. 24, no. 1, DMTCS. 01. 2022. [URL]
Sébastien Rivault, Mostafa Bamha, Sébastien Limet & Sophie Robert, A Scalable Similarity Join Algorithm Based on MapReduce and LSH, International Journal of Parallel Programming, Springer Verlag. 2022. [URL]
Vincent Ttextquoterightkindt, Federico Della Croce & Mathieu Liedloff, Moderate exponential-time algorithms for scheduling problems, 4OR: A Quarterly Journal of Operations Research, Springer Verlag. 11. 2022. [URL]

Chapitres d'ouvrages scientifiques

Marta Bílková, Sabine Frittella & Daniil Kozhemiachenko, Paraconsistent Gödel Modal Logic, in Automated Reasoning, Lecture Notes in Computer Science, Vol. 13385. Pp. 429-448, Springer International Publishing. 08. 2022. [URL]
Agata Savary, Alena Silvanovich, Anne-Lyse Minard, Nicolas Hiot & Mirian Halfeld Ferrari, Relation Extraction from~Clinical Cases for~a~Knowledge Graph, in New Trends in Database and Information Systems. ADBIS 2022, Communications in Computer and Information Science, Vol. 1652. Pp. 353-365, Springer International Publishing. 08. 2022. [URL]
Genoveva Vargas-Solar, Pierre Marrec & Mirian Halfeld Ferrari Alves, Comparing Graph Data Science Libraries for~Querying and~Analysing Datasets: Towards Data Science Queries on~Graphs, in Service-Oriented Computing -- ICSOC 2021 Workshops, Lecture Notes in Computer Science, Vol. 13236. Pp. 205-216, Springer International Publishing. 08. 2022. [URL]

Thèses et Habilitations à Diriger des Recherches

Dara Ly, Formalisation d'un vérificateur dynamique de propriétés mémoire pour programmes C, Thèse de Doctorat. Université d'Orléans. 12. 2022. [URL]
Ciro Morais Medeiros, Improvements on graph path queries : expression, evaluation, and minimum-weight satisfiability, Thèse de Doctorat. Université d'Orléans. 08. 2022. [URL]
Haoran Wang, Implicit parallelism for neural network acceleration, Thèse de Doctorat. Université d'Orléans. 10. 2022. [URL]

Communications avec actes dans un congrès international

Siva Anantharaman, Sabine Frittella & Benjamin Nguyen, Privacy Analysis with a Distributed Transition System and a Data-Wise Metric, in Privacy in Statistical Databases (PSD). PARIS, France, Lecture Notes in Computer Science, Vol. PSD 2022(LNCS 13643). Pp. 15-30, Springer. 09. 2022. [URL]
Arthur Braida, LOCALITY AND APPROXIMATION IN QUANTUM ANNEALING, in Ecole Jeunes Chercheuses et Chercheurs en Informatique Mathématique. Nice, France. 06. 2022. [URL]
Marta Bílková, Sabine Frittella, Ondrej Majer & Sajad Nazari, Belief Based on Inconsistent Information, in Dynamic Logic: New Trends and Applications, Dynamic Logic. New Trends and Applications. DaLi 2020. Lecture Notes in Computer Science.. Prague, Czech Republic. Pp. 68-86. 03. 2022. [URL]
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing & Tuomo Lehtilä, The Red-Blue Separation Problem on~Graphs, in IWOCA 2022. Trier, Germany, Combinatorial Algorithms. IWOCA 2022. Lecture Notes in Computer Science, Vol. 13270. Pp. 285-298, Springer International Publishing. 06. 2022. [URL]
Jérôme Durand-Lose, On the~Power of~Recursive Word-Functions Without Concatenation, in Descriptional Complexity of Formal Systems. Debrecen, Hungary, Lecture Notes in Computer Science, Vol. 13439. Pp. 30-42, Springer International Publishing. 2022. [URL]
Sofiane Elguendouze, Marcilio de Souto, Adel Hafiane & Anaïs Halftermeyer, Towards Explainable Deep Learning for Image Captioning through Representation Space Perturbation, in International Joint Conference on Neural Networks 2022. Padua, Italy. 07. 2022. [URL]
Olivier Gracianne, Anais Lefeuvre-Halftermeyer & Thi-Bich-Hanh Dao, Presenting an event through the description of related tweets clusters, in International Conference on Tools with Artificial Intelligence (ICTAI). Virtuel, United States. 10. 2022. [URL]
Loïc Grobol, Sophie Prévost & Benoît Crabbé, Is Old French tougher to parse~?, in 20th International Workshop on Treebanks and Linguistic Theories. Sofia, Bulgaria. Pp. 27-34, Association for Computational Linguistics. 03. 2022. [URL]
Loïc Grobol, Mathilde Regnault, Pedro Ortiz Suarez, Benoît Sagot, Laurent Romary & Benoît Crabbé, BERTrade: Using Contextual Embeddings to Parse Old French, in 13th Language Resources and Evaluation Conference. Marseille, France. 06. 2022. [URL]
Mathieu Guilbert, Christel Vrain, Thi-Bich-Hanh Dao & Marcilio de Souto, Anchored Constrained Clustering Ensemble, in IJCNN. Padua, Italy. 07. 2022. [URL]
Antoine Guillaume, Christel Vrain & Wael Elloumi, Random Dilated Shapelet Transform: A New Approach for~Time Series Shapelets, in ICPRAI 2022: Pattern Recognition and Artificial Intelligence. Paris, France, Lecture Notes in Computer Science, Vol. 13363. Pp. 653-664, Springer International Publishing. 06. 2022. [URL]
Cristina Morimoto, Aurora Pozo & Marcílio de Souto, Detecting Nested Structures Through Evolutionary Multi-objective Clustering, in Proc. of the International Conference on the Applications of Evolutionary Computation (EvoApplications 2022). Madrid, Spain, Lecture Notes in Computer Science, Vol. 13224. Pp. 369-385, Springer International Publishing. 04. 2022. [URL]
Nguyen-Viet-Dung Nghiem, Christel Vrain & Thi-Bich-Hanh Dao, Knowledge Integration in Deep Clustering, in European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases ECMLPKDD. Grenoble, France. 09. 2022. [URL]

Communications avec actes dans un congrès national

Aymeric Beauchamp, Thi-Bich-Hanh Dao, Samir Loudni & Christel Vrain, Intégration incrémentale de contraintes pour le clustering avec la programmation par contraintes, in Journées Francophones de Programmation par Contraintes (Evènement affilié à PFIA 2022). Saint-Étienne, France. 06. 2022. [URL]

Communications sans actes

Adrien Boiret, Cédric Eichler & Benjamin Nguyen, Privacy Operators for~Semantic Graph Databases as~Graph Rewriting, in International Workshop on Intelligent Data -- From Data to Knowledge (DOING AT ADBIS). Turino, Italy, Communications in Computer and Information Science, Vol. 1652. Pp. 366-377, Springer International Publishing. 09. 2022. [URL]
Mariya Borovikova, Loïc Grobol, Anaïs Halftermeyer & Sylvie Billot, A Methodology for the Comparison of Human Judgments With Metrics for Coreference Resolution, in HumEval at ACL. Dublin, Ireland. Pp. 16-23, Association for Computational Linguistics. 05. 2022. [URL]
Pierre Bouchet, Sophie Jacquot & Christian Toinard, Towards a SaaS application providing an ethical support for human caregiving of people living at home, in Computational Science and Computational Intelligence. Las Vegas, United States. 12. 2022. [URL]
Xavier Bultel, Enseigner les preuves à divulgation nulle sur des chiffrements sans prérequis d'arithmétique, in RESSI 2022 (Rendez-Vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information). Chambon-sur-Lac, France. 05. 2022. [URL]
Xavier Bultel, Zero-Knowledge Proof of Knowledge for Peg Solitaire, in 11th International Conference on Fun with Algorithms (FUN 2022). Favignana, Italy. 05. 2022. [URL]
Xavier Bultel, CCA Secure A Posteriori Openable Encryption in the Standard Model, in The Cryptographer's Track at the RSA Conference (TC-RSA 2022). San Francisco, United States. 03. 2022. [URL]
Xavier Bultel & Cristina Onete, Pairing-free secure-channel establishment in mobile networks with fine-grained lawful interception, in The 37th ACM/SIGAPP Symposium On Applied Computing. Brno, Czech Republic. 04. 2022. [URL]
Maël Dumas, Florent Foucaud, Anthony Perez & Ioan Todinca, On graphs coverable by k shortest paths, in 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Seoul, Korea, Republic Of, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 248. Pp. 40:1-40:15. 12. 2022. [URL]
Olivier Gracianne, Anaïs Halftermeyer & Thi-Bich-Hanh Dao, Des clusters de tweets aux tags de descriptions : présentation d'un évènement par la caractérisation de ses manifestations, in Conférence Nationale en Intelligence Artificielle 2022 (CNIA 2022). Saint-Etienne, France, Actes CNIA 2022. 06. 2022. [URL]
Sébastien Rivault, Mostafa Bamha, Sophie Robert & Sébastien Limet, Towards a Scalable Set Similarity Join using MapReduce and LSH, in International Conference on Computational Science. London, United Kingdom. 06. 2022. [URL]
Sara Taki, Cédric Eichler & Benjamin Nguyen, It 's Too Noisy in~Here: Using Projection to~Improve Differential Privacy on~RDF Graphs, in ADBIS 2022- 26th European Conference on Advances in Databases and Information Systems. Turin, Italy, Communications in Computer and Information Science, Vol. 1652. Pp. 212-221, Springer International Publishing. 09. 2022. [URL]
Sara Taki, Cédric Eichler & Benjamin Nguyen, It 's too noisy in here: using projection to improve Differential Privacy on RDF graphs, in APVP 2022 - 12ème Atelier sur la Protection de la Vie Privée. Châtenay-sur-Seine, France. 06. 2022. [URL]

Autres Publications

Siva Anantharaman, Sabine Frittella & Benjamin Nguyen, Distributed Transition Systems with Tags for Privacy Analysis. 03. 2022. [URL]
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat & Subir Kumar Ghosh, Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond. 10. 2022. [URL]
Samuel Nalin & Guillaume Theyssier, On Turedo Hierarchies and Intrinsic Universality. 05. 2022. [URL]

2023/12/07 généré via HALLO + JabRef.