269 citations · 3k across the 82 of their papers we have counts for
Showing 2015 · math.OCShow all
2 papers · 2 filters
math.OC2015★ 7 cited
On the Linear Extension Complexity of Regular n-gons
Arnaud Vandaele, Nicolas Gillis, François Glineur
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular -gons. Our bounds are based on the equivalence between the computation of (i)…
math.OC2015★ 13 cited
Solving the Maximum Clique Problem with Symmetric Rank-One Nonnegative Matrix Approximation
Melisew Tefera Belachew, Nicolas Gillis
Finding complete subgraphs in a graph, that is, cliques, is a key problem and has many real-world applications, e.g., finding communities in social networks, clustering gene expres…