Pablo San Segundo

43 papers A 1B 2Journal 31Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Loop Closure via Maximal Cliques in 3D LiDAR-Based SLAM.
CoRR
Javier Laserna, Saurabh Gupta, Óscar Martínez Mozos, Cyrill Stachniss, Pablo San Segundo
2025 J jnl
CliReg: Clique-Based Robust Point Cloud Registration.
IEEE Trans. Robotics
Javier Laserna Moratalla, Pablo San Segundo, David Álvarez
2025 — conf
Loop Closure via Maximal Cliques in 3D LiDAR-Based SLAM.
ECMR
Javier Laserna, Saurabh Gupta, Óscar Martínez Mozos, Cyrill Stachniss, Pablo San Segundo
2023 J jnl
CliSAT: A new exact algorithm for hard maximum clique problems.
Eur. J. Oper. Res.
Pablo San Segundo, Fabio Furini, David Álvarez, Panos M. Pardalos
2022 J jnl
A new branch-and-filter exact algorithm for binary constraint satisfaction problems.
Eur. J. Oper. Res.
Pablo San Segundo, Fabio Furini, Rafael León
2022 J jnl
Research trends in combinatorial optimization.
Int. Trans. Oper. Res.
Jann Michael Weinand, Kenneth Sörensen, Pablo San Segundo, Max Kleinebrahm, Russell McKenna
2021 J jnl
A branch-and-cut algorithm for the Edge Interdiction Clique Problem.
Eur. J. Oper. Res.
Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao
2021 J jnl
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts.
Eur. J. Oper. Res.
Stefano Coniglio, Fabio Furini, Pablo San Segundo
2019 J jnl
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem.
Comput. Oper. Res.
Pablo San Segundo, Fabio Furini, Jorge Artieda
2019 J jnl
A new branch-and-bound algorithm for the maximum edge-weighted clique problem.
Eur. J. Oper. Res.
Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic
2019 — ch.
Applications for ultrascale systems.
Ultrascale Computing 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
2019 J jnl
The maximum clique interdiction problem.
Eur. J. Oper. Res.
Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo
2018 J jnl
Efficiently Enumerating all Maximal Cliques with Bit-Parallelism.
CoRR
Pablo San Segundo, Jorge Artieda, Darren Strash
2018 J jnl
Efficiently enumerating all maximal cliques with bit-parallelism.
Comput. Oper. Res.
Pablo San Segundo, Jorge Artieda, Darren Strash
2017 J jnl
A parallel maximum clique algorithm for large and massive sparse graphs.
Optim. Lett.
Pablo San Segundo, Alvaro Lopez, Jorge Artieda, Panos M. Pardalos
2017 J jnl
An enhanced bitstring encoding for exact maximum clique search in sparse graphs.
Optim. Methods Softw.
Pablo San Segundo, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos
2017 J jnl
Erratum to: Improved initial vertex ordering for exact maximum clique search.
Appl. Intell.
Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos
2016 J jnl
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations.
J. Comb. Optim.
Larisa Komosko, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos
2016 J jnl
A new exact maximum clique algorithm for large and massive sparse graphs.
Comput. Oper. Res.
Pablo San Segundo, Alvaro Lopez, Panos M. Pardalos
2016 — conf
An Enhanced Infra-Chromatic Bound for the Maximum Clique Problem.
MOD
Pablo San Segundo, Jorge Artieda, Rafael León, Cristóbal Tapia
2016 J jnl
Improved Infra-Chromatic Bound for Exact Maximum Clique Search.
Informatica
Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn, Panos M. Pardalos
2016 J jnl
Improved initial vertex ordering for exact maximum clique search.
Appl. Intell.
Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos
2015 J jnl
A novel clique formulation for the visual feature matching problem.
Appl. Intell.
Pablo San Segundo, Jorge Artieda
2015 J jnl
Infra-chromatic bound for exact maximum clique search.
Comput. Oper. Res.
Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn
2015 — conf
Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem.
LION
Alexey Nikolaev, Mikhail Batsyn, Pablo San Segundo
2014 — conf
Initial Sorting of Vertices in the Maximum Clique Problem Reviewed.
LION
Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn
2014 J jnl
Relaxed approximate coloring in exact maximum clique search.
Comput. Oper. Res.
Pablo San Segundo, Cristóbal Tapia
2013 J jnl
An improved bit parallel exact maximum clique algorithm.
Optim. Lett.
Pablo San Segundo, Fernando Matía, Diego Rodríguez-Losada, Miguel Hernando
2013 J jnl
GPU-Mapping: Robotic Map Building with Graphical Multiprocessors.
IEEE Robotics Autom. Mag.
Diego Rodríguez-Losada, Pablo San Segundo, Miguel Hernando, Paloma de la Puente, Alberto Valero-Gomez
2013 J jnl
Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm.
IEEE Trans. Robotics
Pablo San Segundo, Diego Rodríguez-Losada
2012 J jnl
A new DSATUR-based algorithm for exact vertex coloring.
Comput. Oper. Res.
Pablo San Segundo
2011 J jnl
An affine fuzzy model with local and global interpretations.
Appl. Soft Comput.
Fernando Matía, Basil M. Al-Hadithi, Agustín Jiménez, Pablo San Segundo
2011 J jnl
An exact bit-parallel algorithm for the maximum clique problem.
Comput. Oper. Res.
Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez
2011 J jnl
New decision rules for exact search in N-Queens.
J. Glob. Optim.
Pablo San Segundo
2010 — conf
A New Implicit Branching Strategy for Exact Maximum Clique.
ICTAI (1)
Pablo San Segundo, Cristóbal Tapia
2010 J jnl
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver.
Appl. Intell.
Pablo San Segundo, Diego Rodríguez-Losada, Fernando Matía, Ramón Galán
2009 J jnl
Dual FastSLAM: Dual Factorization of the Particle Filter Based Solution of the Simultaneous Localization and Mapping Problem.
J. Intell. Robotic Syst.
Diego Rodríguez-Losada, Pablo San Segundo, Fernando Matía, Luis Pedraza
2009 B conf
Using Graphs to Derive CSP Heuristics and its Application to Sudoku.
ICTAI
Pablo San Segundo, Agustín Jiménez
2008 — conf
A New Exact Bit-Parallel Algorithm for SAT.
ICTAI (2)
Pablo San Segundo, Cristóbal Tapia, Julio Puente, Diego Rodríguez-Losada
2008 A conf
Building maps of large environments using splines and geometric analysis.
IROS
Luis Pedraza, Diego Rodríguez-Losada, Pablo San Segundo, Fernando Matía
2007 — conf
Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search.
ICTAI (1)
Pablo San Segundo, Diego Rodríguez-Losada, Ramón Galán, Fernando Matía, Agustín Jiménez
2006 B conf
Efficient Search Using Bitboard Models.
ICTAI
Pablo San Segundo, Ramón Galán, Fernando Matía, Diego Rodríguez-Losada, Agustín Jiménez
2005 — conf
Bitboards: A New Approach.
Artificial Intelligence and Applications
Pablo San Segundo, Ramón Galán