Author


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

H-Index (Scopus)
14

Authors

Title

Year

Publication

Citations

San Segundo P. Matía F. Rodriguez-Losada D. Hernando M.
An improved bit parallel exact maximum clique algorithm
2013
Optimization Letters
63
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
48
Coniglio S. Furini F. San Segundo P.
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
2021
European Journal of Operational Research
38
San Segundo P. Tapia C.
Relaxed approximate coloring in exact maximum clique search
2014
Computers and Operations Research
35
San Segundo P. Nikolaev A. Batsyn M.
Infra-chromatic bound for exact maximum clique search
2015
Computers and Operations Research
35

Authors

Title

Date

Publication

Citations

San Segundo P. Furini F. Álvarez D. Pardalos P.M.
CliSAT: A new exact algorithm for hard maximum clique problems
2023-06-16
European Journal of Operational Research
1
San Segundo P. Furini F. Leon R.
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
2022-06-01
European Journal of Operational Research
2
Weinand J.M. Sorensen K. San Segundo P. Kleinebrahm M. McKenna R.
Research trends in combinatorial optimization
2022-03-01
International Transactions in Operational Research
12
Furini F. Ljubic I. San Segundo P. Zhao Y.
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
2021-10-01
European Journal of Operational Research
11
Coniglio S. Furini F. San Segundo P.
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
2021-03-01
European Journal of Operational Research
38

Authors

Title

Year

Citations

Authors

Title

Date

Citations

Authors

Title

Congress

Date

Citations

Furini F. Ljubic I. Martin S. San Segundo P.
Attacking the clique number of a graph
16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2018
2019-01-01
0
Tapia C. San Segundo P. Galan R.
A hybrid bit-encoding for SAT planning based on clique-partitioning
2017 International Conference on Mathematical Methods and Computational Techniques in Science and Engineering, MMCTSE 2017
2017-09-06
0
San Segundo P. Artieda J. Leon R. Tapia C.
An enhanced infra-chromatic bound for the maximum clique problem
2nd International Workshop on Machine Learning, Optimization and Big Data, MOD 2016
2016-01-01
1
Nikolaev A. Batsyn M. San Segundo P.
Reusing the same coloring in the child nodes of the search tree for the maximum clique problem
9th International Conference on Learning and Intelligent Optimization, LION 2015
2015-01-01
7
Tapia C. San Segundo P. Artieda J.
A PDDL-based simulation system
European Conference on Data Mining 2015, ECDM 2015 and International Conferences on Intelligent Systems and Agents 2015, ISA 2015 and Theory and Practice in Modern Computing 2015, TPMC 2015
2015-01-01
4