معرفی
Julien Baste is an Associate Professor at the University of Lille, France, since September 2020. He teaches computer science at IUT de Lille (Institut Universitaire de Technologie de Lille) and conducts his research as a member of the ORKAD research team within CRIStAL (Centre de Recherche en Informatique, Signal et Automatique de Lille).
Dr. Baste's research interests focus on theoretical aspects of computer science, particularly in Algorithms, reductions, graph theory, parameterized complexity, diversity, and multi-objective optimization. His work bridges theoretical foundations with practical applications, especially in optimization problems related to graph structures and computational complexity.
An analysis of his recent publications reveals a consistent trajectory in parameterized algorithms and graph theory. His work frequently addresses problems parameterized by treewidth, developing fixed-parameter tractable algorithms for various graph problems. He has made significant contributions to understanding the complexity of graph modification problems, matchings, domination problems, and hitting set problems. His research has increasingly incorporated applications in areas like selective deconstruction and optimization of industrial processes, demonstrating the practical relevance of his theoretical work.
Dr. Baste maintains an active research presence through numerous conference participations and collaborations with researchers across Europe. His research profile shows regular publication in top-tier theoretical computer science venues including SODA, IPEC, WG, and various IEEE conferences. The ORKAD research team at CRIStAL provides the institutional context for his ongoing research activities in algorithms and optimization.
