Pablo San Segundo

Available identifiers

zbMath Open san-segundo.pabloMaRDI QIDQ281815

List of research outcomes

Publication	Date of Publication	Type
Research trends in combinatorial optimization	2023-11-24	Paper
CliSAT: a new exact algorithm for hard maximum clique problems	2023-07-10	Paper
A new branch-and-filter exact algorithm for binary constraint satisfaction problems	2022-02-23	Paper
A branch-and-cut algorithm for the edge interdiction clique problem	2021-06-08	Paper
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts	2021-06-03	Paper
A new branch-and-bound algorithm for the maximum weighted clique problem	2019-07-12	Paper
A new branch-and-bound algorithm for the maximum edge-weighted clique problem	2019-06-25	Paper
The maximum clique interdiction problem	2019-03-28	Paper
Efficiently enumerating all maximal cliques with bit-parallelism	2018-07-12	Paper
An enhanced bitstring encoding for exact maximum clique search in sparse graphs	2017-06-21	Paper
A parallel maximum clique algorithm for large and massive sparse graphs	2017-05-12	Paper
Infra-chromatic bound for exact maximum clique search	2016-11-17	Paper
A new exact maximum clique algorithm for large and massive sparse graphs	2016-11-17	Paper
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations	2016-05-11	Paper
Relaxed approximate coloring in exact maximum clique search	2015-02-25	Paper
An improved bit parallel exact maximum clique algorithm	2013-03-12	Paper
A new \textsf{DSATUR}-based algorithm for exact vertex coloring	2012-11-15	Paper
New decision rules for exact search in \(N\)-queens	2011-12-15	Paper
Dual fastslam: Dual factorization of the particle filter based solution of the simultaneous localization and mapping problem	2011-01-04	Paper
An exact bit-parallel algorithm for the maximum clique problem	2010-10-15	Paper

Research outcomes over time

This page was built for person: Pablo San Segundo