Pablo+San+Segundo

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]- and [|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. || toc =BITSCAN= Pablo San Segundo has recently 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 as part of the //Biicode repository//, a [|package manager] for software developers. Comparisons of time performance between BITSCAN, [|Boost] as well as [|STL] bitstring implementations are available.
 * Home * People * Pablo San Segundo**
 * [[image:San_segundo_carrillo_pablo_20081119_olympiade_dresden.jpg link="https://commons.wikimedia.org/wiki/File:San_segundo_carrillo_pablo_20081119_olympiade_dresden.jpg"]] ||~  || **Pablo San Segundo Carrillo**,
 * Pablo San Segundo ||~  ||^   ||

=GRAPH= GRAPH, a small C++ library with a number of data types for bit-encoded graphs using BITSCAN has now been released. At the moment it is in alpha, but here are some features:
 * [[image:ugraph-pablo-exmple-bitstring.png link="http://blog.biicode.com/bit-encoded-graph/"]] ||
 * The figure shows a simple [|undirected graph] with 6 [|vertices] (in red a 3-[|clique]) ||
 * Specific types for sparse bit encoded graphs
 * Uniform random graph generation (contains state of the art efficient generator for sparse graphs)
 * k-Core decomposition analysis
 * Maximum clique solver for massive networks

=Selected Publications=
 * 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], [|pdf]
 * 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]

=External Links= > [|Biicode: Pablo San Segundo - BITSCAN] > [|Biicode: Pablo San Segundo - GRAPH library for bit-encoded graphs]
 * [|Biicode: Pablo San Segundo]
 * [|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= =What links here?= include page="Pablo San Segundo" component="backlinks" limit="40"
 * Up one Level**