Volgen
Pablo San Segundo
Pablo San Segundo
Associate Professor (UPM-Spain)
Geverifieerd e-mailadres voor upm.es - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
An exact bit-parallel algorithm for the maximum clique problem
P San Segundo, D Rodríguez-Losada, A Jiménez
Computers & Operations Research 38 (2), 571-581, 2011
1732011
An improved bit parallel exact maximum clique algorithm
P San Segundo, F Matia, D Rodriguez-Losada, M Hernando
Optimization Letters 7 (3), 467-479, 2013
1062013
A new DSATUR-based algorithm for exact vertex coloring
P San Segundo
Computers & Operations Research 39 (7), 1724-1733, 2012
732012
A new exact maximum clique algorithm for large and massive sparse graphs
P San Segundo, A Lopez, PM Pardalos
Computers & Operations Research 66, 81-94, 2016
652016
Infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn
Computers & Operations Research 64, 293-303, 2015
472015
Relaxed approximate coloring in exact maximum clique search
P San Segundo, C Tapia
Computers & Operations Research 44, 185-192, 2014
462014
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver
P San Segundo, D Rodríguez-Losada, F Matía, R Galán
Applied Intelligence 32 (3), 311-329, 2010
322010
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
S Coniglio, F Furini, P San Segundo
European Journal of Operational Research 289 (2), 435-455, 2021
282021
The maximum clique interdiction problem
F Furini, I Ljubić, S Martin, P San Segundo
European Journal of Operational Research 277 (1), 112-127, 2019
262019
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
P San Segundo, S Coniglio, F Furini, I Ljubić
European Journal of Operational Research 278 (1), 76-90, 2019
232019
Robust global feature based data association with a sparse bit optimized maximum clique algorithm
P San Segundo, D Rodriguez-Losada
IEEE Transactions on Robotics 29 (5), 1332-1339, 2013
232013
Efficiently enumerating all maximal cliques with bit-parallelism
P San Segundo, J Artieda, D Strash
Computers & Operations Research 92, 37-46, 2018
202018
Efficient search using bitboard models
P San Segundo, R Galán, F Matia, D Rodriguez-Losada, A Jimenez
2006 18th IEEE International Conference on Tools with Artificial …, 2006
202006
Improved infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn, PM Pardalos
Informatica 27 (2), 463-487, 2016
182016
A novel clique formulation for the visual feature matching problem
P San Segundo, J Artieda
Applied Intelligence 43 (2), 325-342, 2015
182015
Improved initial vertex ordering for exact maximum clique search
PS Segundo, A Lopez, M Batsyn, A Nikolaev, PM Pardalos
Applied Intelligence 45 (3), 868-880, 2016
172016
Gpu-mapping: Robotic map building with graphical multiprocessors
D Rodriguez-Losada, P San Segundo, M Hernando, P de la Puente, ...
IEEE Robotics & Automation Magazine 20 (2), 40-51, 2013
152013
A new branch-and-bound algorithm for the maximum weighted clique problem
P San Segundo, F Furini, J Artieda
Computers & Operations Research 110, 18-33, 2019
142019
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
L Komosko, M Batsyn, PS Segundo, PM Pardalos
Journal of Combinatorial Optimization 31 (4), 1665-1677, 2016
142016
An affine fuzzy model with local and global interpretations
F Matía, BM Al-Hadithi, A Jiménez, P San Segundo
Applied Soft Computing 11 (6), 4226-4235, 2011
122011
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20