default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPablo San Segundo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Pablo San Segundo
, Fabio Furini, David Álvarez, Panos M. Pardalos:
CliSAT: A new exact algorithm for hard maximum clique problems. Eur. J. Oper. Res. 307(3): 1008-1025 (2023)- 2022
- [j27]Pablo San Segundo, Fabio Furini, Rafael León:
A new branch-and-filter exact algorithm for binary constraint satisfaction problems. Eur. J. Oper. Res. 299(2): 448-467 (2022) - [j26]Jann Michael Weinand, Kenneth Sörensen, Pablo San Segundo, Max Kleinebrahm, Russell McKenna:
Research trends in combinatorial optimization. Int. Trans. Oper. Res. 29(2): 667-705 (2022) - 2021
- [j25]Stefano Coniglio, Fabio Furini, Pablo San Segundo:
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. Eur. J. Oper. Res. 289(2): 435-455 (2021) - [j24]Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao:
A branch-and-cut algorithm for the Edge Interdiction Clique Problem. Eur. J. Oper. Res. 294(1): 54-69 (2021)
2010 – 2019
- 2019
- [j23]Pablo San Segundo, Fabio Furini, Jorge Artieda:
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem. Comput. Oper. Res. 110: 18-33 (2019) - [j22]Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo:
The maximum clique interdiction problem. Eur. J. Oper. Res. 277(1): 112-127 (2019) - [j21]Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic:
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278(1): 76-90 (2019) - [p1]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:
Applications for ultrascale systems. Ultrascale Computing Systems 2019: 189-244 - 2018
- [j20]Pablo San Segundo, Jorge Artieda, Darren Strash:
Efficiently enumerating all maximal cliques with bit-parallelism. Comput. Oper. Res. 92: 37-46 (2018) - [i1]Pablo San Segundo, Jorge Artieda, Darren Strash:
Efficiently Enumerating all Maximal Cliques with Bit-Parallelism. CoRR abs/1801.00202 (2018) - 2017
- [j19]Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos:
Erratum to: Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 46(1): 240 (2017) - [j18]Pablo San Segundo, Alvaro Lopez, Jorge Artieda, Panos M. Pardalos:
A parallel maximum clique algorithm for large and massive sparse graphs. Optim. Lett. 11(2): 343-358 (2017) - [j17]Pablo San Segundo, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos:
An enhanced bitstring encoding for exact maximum clique search in sparse graphs. Optim. Methods Softw. 32(2): 312-335 (2017) - 2016
- [j16]Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos:
Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 45(3): 868-880 (2016) - [j15]Pablo San Segundo, Alvaro Lopez, Panos M. Pardalos:
A new exact maximum clique algorithm for large and massive sparse graphs. Comput. Oper. Res. 66: 81-94 (2016) - [j14]Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn, Panos M. Pardalos:
Improved Infra-Chromatic Bound for Exact Maximum Clique Search. Informatica 27(2): 463-487 (2016) - [j13]Larisa Komosko, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos:
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations. J. Comb. Optim. 31(4): 1665-1677 (2016) - [c10]Pablo San Segundo, Jorge Artieda, Rafael León, Cristóbal Tapia:
An Enhanced Infra-Chromatic Bound for the Maximum Clique Problem. MOD 2016: 306-316 - 2015
- [j12]Pablo San Segundo, Jorge Artieda:
A novel clique formulation for the visual feature matching problem. Appl. Intell. 43(2): 325-342 (2015) - [j11]Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn:
Infra-chromatic bound for exact maximum clique search. Comput. Oper. Res. 64: 293-303 (2015) - [c9]Alexey Nikolaev, Mikhail Batsyn, Pablo San Segundo:
Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem. LION 2015: 275-280 - 2014
- [j10]Pablo San Segundo, Cristóbal Tapia:
Relaxed approximate coloring in exact maximum clique search. Comput. Oper. Res. 44: 185-192 (2014) - [c8]Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn:
Initial Sorting of Vertices in the Maximum Clique Problem Reviewed. LION 2014: 111-120 - 2013
- [j9]Pablo San Segundo, Fernando Matía, Diego Rodríguez-Losada, Miguel Hernando:
An improved bit parallel exact maximum clique algorithm. Optim. Lett. 7(3): 467-479 (2013) - [j8]Diego Rodríguez-Losada, Pablo San Segundo, Miguel Hernando, Paloma de la Puente, Alberto Valero-Gomez:
GPU-Mapping: Robotic Map Building with Graphical Multiprocessors. IEEE Robotics Autom. Mag. 20(2): 40-51 (2013) - [j7]Pablo San Segundo, Diego Rodríguez-Losada:
Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm. IEEE Trans. Robotics 29(5): 1332-1339 (2013) - 2012
- [j6]Pablo San Segundo:
A new DSATUR-based algorithm for exact vertex coloring. Comput. Oper. Res. 39(7): 1724-1733 (2012) - 2011
- [j5]Fernando Matía, Basil M. Al-Hadithi, Agustín Jiménez, Pablo San Segundo:
An affine fuzzy model with local and global interpretations. Appl. Soft Comput. 11(6): 4226-4235 (2011) - [j4]Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez:
An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2): 571-581 (2011) - [j3]Pablo San Segundo:
New decision rules for exact search in N-Queens. J. Glob. Optim. 51(3): 497-514 (2011) - 2010
- [j2]Pablo San Segundo, Diego Rodríguez-Losada, Fernando Matía, Ramón Galán:
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver. Appl. Intell. 32(3): 311-329 (2010) - [c7]Pablo San Segundo, Cristóbal Tapia:
A New Implicit Branching Strategy for Exact Maximum Clique. ICTAI (1) 2010: 352-357
2000 – 2009
- 2009
- [j1]Diego Rodríguez-Losada, Pablo San Segundo, Fernando Matía, Luis Pedraza:
Dual FastSLAM: Dual Factorization of the Particle Filter Based Solution of the Simultaneous Localization and Mapping Problem. J. Intell. Robotic Syst. 55(2-3): 109-134 (2009) - [c6]Pablo San Segundo, Agustín Jiménez:
Using Graphs to Derive CSP Heuristics and its Application to Sudoku. ICTAI 2009: 538-545 - 2008
- [c5]Pablo San Segundo, Cristóbal Tapia, Julio Puente, Diego Rodríguez-Losada:
A New Exact Bit-Parallel Algorithm for SAT. ICTAI (2) 2008: 59-65 - [c4]Luis Pedraza, Diego Rodríguez-Losada, Pablo San Segundo, Fernando Matía:
Building maps of large environments using splines and geometric analysis. IROS 2008: 1600-1605 - 2007
- [c3]Pablo San Segundo, Diego Rodríguez-Losada, Ramón Galán, Fernando Matía, Agustín Jiménez:
Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search. ICTAI (1) 2007: 53-59 - 2006
- [c2]Pablo San Segundo, Ramón Galán, Fernando Matía, Diego Rodríguez-Losada, Agustín Jiménez:
Efficient Search Using Bitboard Models. ICTAI 2006: 132-138 - 2005
- [c1]Pablo San Segundo, Ramón Galán:
Bitboards: A New Approach. Artificial Intelligence and Applications 2005: 394-399
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
