Pablo San Segundo

According to our database, Pablo San Segundo authored at least 39 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

CliSAT: A new exact algorithm for hard maximum clique problems.

Pablo San Segundo, Fabio Furini, David Álvarez, Panos M. Pardalos

Eur. J. Oper. Res., June, 2023

2022

Research trends in combinatorial optimization.

Jann Michael Weinand, Kenneth Sörensen, Pablo San Segundo, Max Kleinebrahm, Russell McKenna

Int. Trans. Oper. Res., 2022

A new branch-and-filter exact algorithm for binary constraint satisfaction problems.

Pablo San Segundo, Fabio Furini, Rafael León

Eur. J. Oper. Res., 2022

2021

A branch-and-cut algorithm for the Edge Interdiction Clique Problem.

Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao

Eur. J. Oper. Res., 2021

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts.

Stefano Coniglio, Fabio Furini, Pablo San Segundo

Eur. J. Oper. Res., 2021

2019

A new branch-and-bound algorithm for the maximum edge-weighted clique problem.

Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic

Eur. J. Oper. Res., 2019

The maximum clique interdiction problem.

Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo

Eur. J. Oper. Res., 2019

A new branch-and-bound algorithm for the Maximum Weighted Clique Problem.

Pablo San Segundo, Fabio Furini, Jorge Artieda

Comput. Oper. Res., 2019

Applications for ultrascale systems.

Svetozar Margenov, Thomas Rauber, Emanouil I. Atanassov, Francisco Almeida, Vicente Blanco Pérez, Raimondas Ciegis, Alberto Cabrera Pérez, Neki Frasheri, Stanislav Harizanov, Rima Kriauziene, Gudula Rünger, Pablo San Segundo, Adimas Starikovicius, Sándor Szabó, Bogdán Zaválnij

Proceedings of the Ultrascale Computing Systems, 2019

2018

Efficiently enumerating all maximal cliques with bit-parallelism.

Pablo San Segundo, Jorge Artieda, Darren Strash

Comput. Oper. Res., 2018

2017

An enhanced bitstring encoding for exact maximum clique search in sparse graphs.

Pablo San Segundo, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos

Optim. Methods Softw., 2017

A parallel maximum clique algorithm for large and massive sparse graphs.

Pablo San Segundo, Alvaro Lopez, Jorge Artieda, Panos M. Pardalos

Optim. Lett., 2017

Erratum to: Improved initial vertex ordering for exact maximum clique search.

Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos

Appl. Intell., 2017

2016

A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations.

Larisa Komosko, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos

J. Comb. Optim., 2016

Improved Infra-Chromatic Bound for Exact Maximum Clique Search.

Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn, Panos M. Pardalos

Informatica, 2016

A new exact maximum clique algorithm for large and massive sparse graphs.

Pablo San Segundo, Alvaro Lopez, Panos M. Pardalos

Comput. Oper. Res., 2016

Improved initial vertex ordering for exact maximum clique search.

Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos

Appl. Intell., 2016

An Enhanced Infra-Chromatic Bound for the Maximum Clique Problem.

Pablo San Segundo, Jorge Artieda, Rafael León, Cristóbal Tapia

Proceedings of the Machine Learning, Optimization, and Big Data, 2016

2015

Infra-chromatic bound for exact maximum clique search.

Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn

Comput. Oper. Res., 2015

A novel clique formulation for the visual feature matching problem.

Pablo San Segundo, Jorge Artieda

Appl. Intell., 2015

Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem.

Alexey Nikolaev, Mikhail Batsyn, Pablo San Segundo

Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

2014

Relaxed approximate coloring in exact maximum clique search.

Pablo San Segundo, Cristóbal Tapia

Comput. Oper. Res., 2014

Initial Sorting of Vertices in the Maximum Clique Problem Reviewed.

Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn

Proceedings of the Learning and Intelligent Optimization, 2014

2013

Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm.

Pablo San Segundo, Diego Rodríguez-Losada

IEEE Trans. Robotics, 2013

GPU-Mapping: Robotic Map Building with Graphical Multiprocessors.

Diego Rodríguez-Losada, Pablo San Segundo, Miguel Hernando, Paloma de la Puente, Alberto Valero-Gomez

IEEE Robotics Autom. Mag., 2013

An improved bit parallel exact maximum clique algorithm.

Pablo San Segundo, Fernando Matía, Diego Rodríguez-Losada, Miguel Hernando

Optim. Lett., 2013

2012

A new DSATUR-based algorithm for exact vertex coloring.

Pablo San Segundo

Comput. Oper. Res., 2012

2011

New decision rules for exact search in N-Queens.

Pablo San Segundo

J. Glob. Optim., 2011

An exact bit-parallel algorithm for the maximum clique problem.

Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez

Comput. Oper. Res., 2011

An affine fuzzy model with local and global interpretations.

Fernando Matía, Basil M. Al-Hadithi, Agustín Jiménez, Pablo San Segundo

Appl. Soft Comput., 2011

2010

Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver.

Pablo San Segundo, Diego Rodríguez-Losada, Fernando Matía, Ramón Galán

Appl. Intell., 2010

A New Implicit Branching Strategy for Exact Maximum Clique.

Pablo San Segundo, Cristóbal Tapia

Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

2009

Dual FastSLAM: Dual Factorization of the Particle Filter Based Solution of the Simultaneous Localization and Mapping Problem.

Diego Rodríguez-Losada, Pablo San Segundo, Fernando Matía, Luis Pedraza

J. Intell. Robotic Syst., 2009

Using Graphs to Derive CSP Heuristics and its Application to Sudoku.

Pablo San Segundo, Agustín Jiménez

Proceedings of the ICTAI 2009, 2009

2008

Building maps of large environments using splines and geometric analysis.

Luis Pedraza, Diego Rodríguez-Losada, Pablo San Segundo, Fernando Matía

Proceedings of the 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2008

A New Exact Bit-Parallel Algorithm for SAT.

Pablo San Segundo, Cristóbal Tapia, Julio Puente, Diego Rodríguez-Losada

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007

Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search.

Pablo San Segundo, Diego Rodríguez-Losada, Ramón Galán, Fernando Matía, Agustín Jiménez

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006

Efficient Search Using Bitboard Models.

Pablo San Segundo, Ramón Galán, Fernando Matía, Diego Rodríguez-Losada, Agustín Jiménez

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

2005

Bitboards: A New Approach.

Pablo San Segundo, Ramón Galán

Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005