Pablo San Segundo Carrillo

Experience of Pablo San Segundo Carrillo

Pablo San Segundo is currently an associate professor of the Polytechnic University of Madrid, where he received the Elechtronics Engineering and Ph. D. degrees. His main research interests lie in Artificial Intelligence (planning, heuristics and search problems in general) and combinatorial optimization. Major highlights of his research activity lie in combinatorial optimization. In particular he is the developer of two of the most successful recent exact algorithms for the vertex coloring and maximum clique problems, both acknowledged by the scientific community in relevant publications. He has also designed an almost-perfect heuristic for the N-Queens problem and worked on different constraint-satisfaction problems.
He has also been involved in national and EU funded projects as well as many industrial projects, and in 2012 founded the start-up Biicode together with other professors at the UPM, oriented to improve the software industry. He is also a chess lover and supporter: became an International Chess Grand Master in 1995, has been a member of the Spanish Olympic Team for 14 years (1994-2008), Spanish Chess Champion in 1997 and two times Spanish Team Chess Champion (2009, 2011).

Email: pablo.sansegundo@upm.es

Category: Prof. Titular

Position:  

Research Group: Intelligent Control

H-Index (Scopus): 12

Articles by Relevance (Most Cited in Scopus)

Authors

Title

Year

Publication

Citations

San Segundo P. Rodriguez-Losada D. Jimenez Avello A.
An exact bit-parallel algorithm for the maximum clique problem
2011
Computers and Operations Research
102
San Segundo P. Matía F. Rodriguez-Losada D. Hernando M.
An improved bit parallel exact maximum clique algorithm
2013
Optimization Letters
55
San Segundo P.
A new DSATUR-based algorithm for exact vertex coloring
2012
Computers and Operations Research
38
San Segundo P. Lopez A. Pardalos P.M.
A new exact maximum clique algorithm for large and massive sparse graphs
2016
Computers and Operations Research
34
San Segundo P. Nikolaev A. Batsyn M.
Infra-chromatic bound for exact maximum clique search
2015
Computers and Operations Research
32

Articles by Date


Books by Relevance (Most Cited in Scopus)

Books by Date


Conferences by Date