43 citations · 74 across the 4 of their papers we have counts for
4 papers
An Integer Programming Approach to Compute Lower Bounds for Ramsey Numbers Using Circulant Graphs
Stefano Coniglio, Fabio Furini, Ivana Ljubić +3
The Ramsey number is the smallest order at which every red-blue edge coloring of a complete graph must contain a blue clique (a complete subgraph) of size or a red cli…
Loop Closure via Maximal Cliques in 3D LiDAR-Based SLAM
Javier Laserna, Saurabh Gupta, Oscar Martinez Mozos +2
Reliable loop closure detection remains a critical challenge in 3D LiDAR-based SLAM, especially under sensor noise, environmental ambiguity, and viewpoint variation conditions. RAN…
Research trends in combinatorial optimisation
Jann Michael Weinand, Kenneth Sörensen, Pablo San Segundo +2
Real-world problems are becoming highly complex and, therefore, have to be solved with combinatorial optimisation (CO) techniques. Motivated by the strong increase of publications…
Efficiently Enumerating all Maximal Cliques with Bit-Parallelism
Pablo San Segundo, Jorge Artieda, Darren Strash
The maximal clique enumeration (MCE) problem has numerous applications in biology, chemistry, sociology, and graph modeling. Though this problem is well studied, most current resea…