Paul Beaujean

According to our database, Paul Beaujean authored at least 5 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

An approximation algorithm for the maximum spectral subgraph problem.

Cristina Bazgan, Paul Beaujean, Éric Gourdin

J. Comb. Optim., 2022

2021

Scaling up graph homomorphism for classification via sampling.

Paul Beaujean, Florian Sikora, Florian Yger

CoRR, 2021

Graph Homomorphism Features: Why Not Sample?

Paul Beaujean, Florian Sikora, Florian Yger

Proceedings of the Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2021

2019

Defense against epidemics in networks. (Défense contre les épidémies dans les réseaux).

Paul Beaujean

PhD thesis, 2019

2018

Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem.

Cristina Bazgan, Paul Beaujean, Éric Gourdin

Proceedings of the Combinatorial Optimization and Applications, 2018