Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement

This manuscript of Habilitation à Diriger des Recherches enlights some results obtained since my PhD, I defended in 2007. The presented results have been mainly published in international conferences and journals. Exponential-time algorithms are given to solve various decision, optimization and enumeration problems. First, we are interested in solving the L(2,1)-labeling problem for which several algorithms are described (based on branching, divide-and-conquer and dynamic programming). Some combinatorial bounds are also established to analyze those algorithms. Then we solve domination-like problems. We develop algorithms to solve a generalization of the dominating set problem and we give algorithms to enumerate minimal dominating sets in some graph classes. As a consequence, the analysis of these algorithms implies combinatorial bounds. Finally, we extend our field of applications of moderately exponential-time algorithms to scheduling problems. By using dynamic programming paradigm and by extending the sort-and-search approach, we are able to solve a family of scheduling problems.Ce manuscrit d’Habilitation à Diriger des Recherches met en lumière quelques résultats obtenus depuis ma thèse de doctorat soutenue en 2007. Ces résultats ont été, pour l’essentiel, publiés dans des conférences et des journaux internationaux. Des algorithmes exponentiels sont donnés pour résoudre des problèmes de décision, d’optimisation et d’énumération. On s’intéresse tout d’abord au problème d’étiquetage L(2,1) d’un graphe, pour lequel différents algorithmes sont décrits (basés sur du branchement, le paradigme diviser-pour-régner, ou la programmation dynamique). Des bornes combinatoires, nécessaires à l’analyse de ces algorithmes, sont également établies. Dans un second temps, nous résolvons des problèmes autour de la domination. Nous développons des algorithmes pour résoudre une généralisation de la domination et nous donnons des algorithmes pour énumérer les ensembles dominants minimaux dans des classes de graphes. L’analyse de ces algorithmes implique des bornes combinatoires. Finalement, nous étendons notre champ d’applications de l’algorithmique modérément exponentielle à des problèmes d’ordonnancement. Par le développement d’approches de type programmation dynamique et la généralisation de la méthode trier-et-chercher, nous proposons la résolution de toute une famille de problèmes d’ordonnancement

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)

This report documents the program and the outcomes of Dagstuhl Seminar 14121 "Computational Complexity of Discrete Problems". The first section gives an overview of the topics covered and the organization of the meeting. Section 2 lists the talks given in chronological order. The last section contains the abstracts of the talks

Fundamental Approaches to Software Engineering

This open access book constitutes the proceedings of the 25th International Conference on Fundamental Approaches to Software Engineering, FASE 2022, which was held during April 4-5, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 17 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. The proceedings also contain 3 contributions from the Test-Comp Competition. The papers deal with the foundations on which software engineering is built, including topics like software engineering as an engineering discipline, requirements engineering, software architectures, software quality, model-driven development, software processes, software evolution, AI-based software engineering, and the specification, design, and implementation of particular classes of systems, such as (self-)adaptive, collaborative, AI, embedded, distributed, mobile, pervasive, cyber-physical, or service-oriented applications

Fundamental Approaches to Software Engineering

This open access book constitutes the proceedings of the 25th International Conference on Fundamental Approaches to Software Engineering, FASE 2022, which was held during April 4-5, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 17 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. The proceedings also contain 3 contributions from the Test-Comp Competition. The papers deal with the foundations on which software engineering is built, including topics like software engineering as an engineering discipline, requirements engineering, software architectures, software quality, model-driven development, software processes, software evolution, AI-based software engineering, and the specification, design, and implementation of particular classes of systems, such as (self-)adaptive, collaborative, AI, embedded, distributed, mobile, pervasive, cyber-physical, or service-oriented applications