Pablo San Segundo

Home * People * Pablo San Segundo



Pablo San Segundo Carrillo, a Spanish chess grandmaster, Spanish chess champion in 1997 and member of the Olympic team since 1994, computer scientist and associate professor at the Universidad Politécnica de Madrid (UPM). His research interests include heuristics, combinatorics, game theory, graph theory, and AI search- and optimization problems in general, specially applying bitboards. In their 2005 paper, Bitboards: A New Approach, Pablo San Segundo and Ramón Galán mention Bitscan by Modulo for finding 1-bits in a very efficient and practically no space consuming way, at that time not aware of De Bruijn multiplication as proposed by Charles Leiserson et al. in 1998 , which is however mentioned in Segundo et al. 2011 on BBMC.

=BITSCAN= Pablo San Segundo has released BITSCAN, an efficient C++ library for bitstrings which is optimized for scanning bit vectors of any size, and which he used to implement BBMC (BB-MaxClique), a state of the art maximum clique algorithm. BBMC encodes the graph problem as bitstrings and uses bitmasks to implement the basic computations in the search. BITSCAN is publicly available a GitHub repository.

=GRAPH= GRAPH, a small C++ library with a number of data types for bit-encoded graphs using BITSCAN has been released.

=Selected Publications=

2005 ...

 * Pablo San Segundo, Ramón Galán (2005). Bitboards: A New Approach. AIA 2005
 * Pablo San Segundo, Ramón Galán, Fernando Matía, Diego Rodríguez-Losada, Agustín Jiménez (2006). Efficient Search Using Bitboard Models. ICTAI 2006
 * Pablo San Segundo, Diego Rodríguez-Losada, Ramón Galán, Fernando Matía, Agustín Jiménez (2007). Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search. ICTAI 2007
 * Pablo San Segundo, Agustín Jiménez (2007). Using Graphs to Derive CSP Heuristics and its Application to Sudoku. ICTAI 2009

2010 ...

 * Pablo San Segundo, Diego Rodríguez-Losada, Fernando Matía, Ramón Galán (2010). Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver. Applied Intelligence Vol. 32 No. 3
 * Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez (2011). An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research, Vol. 38, No. 2
 * Pablo San Segundo (2011). New decision rules for exact search in N-Queens. Journal of Global Optimization, Vol. 51, No. 3
 * Pablo San Segundo (2012). A new DSATUR-based algorithm for exact vertex coloring[. [https://dblp.uni-trier.de/db/journals/cor/cor39.html Computers & Operations Research, Vol. 39, No. 7
 * Pablo San Segundo, Diego Rodríguez-Losada (2013). Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm. IEEE Transactions on Robotics, Vol. 29, No. 5

2015 ...

 * Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn (2015). Infra-chromatic bound for exact maximum clique search. Computers & Operations Research, Vol. 64, No. 4
 * Larisa Komosko, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos (2016). A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations. Journal of Combinatorial Optimization, Vol. 31
 * Pablo San Segundo, Jorge Artieda, Darren Strash (2017). Efficiently Enumerating all Maximal Cliques with Bit-Parallelism. arXiv:1801.00202

=External Links=
 * psanse (Pablo San Segundo) · GitHub
 * Pablo San Segundo Carrillo from Wikipedia.es (Spanish)
 * The chess games of Pablo San Segundo-Carrillo from chessgames.com
 * Donostia-San Sebastian Chess Festival by David Llada, ChessBase news, June 17, 2009

=References= Up one Level