معرفی
Guillaume Ducoffe is an Associate Professor at the Faculty of Mathematics and Informatics, University of Bucharest, Romania, and a Senior Research Scientist at the National Institute of Research and Development in Informatics (I.C.I.), Romania. He is also affiliated with a joint research team between ICI and the Research Institute of the University of Bucharest (I.C.U.B.). Previously, he was a PhD student at Université Côte d'Azur, France, under the supervision of David Coudert, within the COATI project-team at Inria Sophia Antipolis.
- PhD, Université Côte d'Azur, France (2016)
- Master's Thesis, MPRI-ENS Cachan (2013)
His research centers on algorithmic graph theory, with emphasis on computation in large graphs, including parameterized algorithms for problems like Diameter and Maximum Matching. He investigates metric tree-likeness in real-life networks through Gromov hyperbolicity, which has implications for routing efficiency and congestion. His work extends to information propagation using game-theoretic models such as coloring and hedonic games, and to online targeting detection, where he develops theoretically sound algorithms to uncover sensitive attribute targeting on the web via reductions to PAC learning of k-juntas. He also explores combinatorial topics like proper connectivity and Randic indices with applications in cryptography and chemistry.
The analysis of his recent publications reveals a strong trend in theoretical computer science, particularly in the design and complexity of graph algorithms, structural graph properties, and their applications in network science and privacy. His work bridges pure graph theory with practical concerns in data centers, web transparency, and social networks.
Guillaume Ducoffe has made significant contributions to both journal and conference literature, publishing in venues such as Discrete Applied Mathematics, SIAM Journal on Discrete Mathematics, ACM SIGMETRICS, and USENIX Security. His research is highly interdisciplinary, combining insights from algorithms, game theory, and network analysis.
He actively supervises and mentors students, though specific names are not listed in the provided materials. He has been involved in research grants, including a postdoc grant from I.C.U.B., and has collaborated with prominent researchers such as David Coudert, Nicolas Nisse, Augustin Chaintreau, and Roxana Geambasu. His teaching includes core courses such as Data Structures and Algorithms, Advanced Graph Algorithms, and Advanced Programming Techniques at the University of Bucharest.
Guillaume Ducoffe is a key member of collaborative research initiatives, including the joint ICI-I.C.U.B. team and the former COATI project at Inria. His work continues to advance the theoretical foundations of graph algorithms while addressing pressing issues in web transparency and network design.
حوزههای پژوهشی
