Bellini Lilian

On assignment at Dassault on the Falcon 10X Modeling / prototyping / testing / validation / Process implementation Language: scade / python / bash Standard ARINC 661 DO 178 C Git, jira, agile method

Within the algorithms and combinatorics team of Labri (Bordeaux Laboratory of Research in Computer Science), I conducted research on adjacency labeling schemes. My former internship supervisor has been working on a problem for several years, concerning memory compression of graphs (how to reduce their memory size as much as possible). In 2007, he put forward a hypothesis, a conjecture on the minimum possible compression size and is now seeking to achieve it. My internship aimed to support him in this task. To solve this conjecture, he broke down his problem into many different sub-problems with interesting properties, thinking that if all these sub-problems are solved, a solution for the general problem could emerge. My tasks were therefore to solve his conjecture on a certain number of these sub-problems. Keywords: Graph algorithms Distributed algorithms Planar graphs Graph minor Labeling Combinatorics

As part of a team school project, we had to develop software for the Bordeaux RobotCup team. RobotCup is an international competition where robots play football. The task was to address the following problem: Given a configuration of attackers (position of attackers on the field), where should the defenders be positioned to best counter the attack. The objectives of this project were not focused on code quality or reusability, but on the choices made to solve the problem, the quality of the translation of the problem into a formal problem, the program's response time, and the relevance of the solution. For example, it should not take 10 minutes to provide a solution, even if that solution was excellent.