Parallel Skeletons for Tabu Search Method. - Maria J. Blesa; Lluís Hernàndez; Fatos Xhafa (ICPADS, 2001)

Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition. - Maria J. Blesa; Lluís Hernàndez; Fatos Xhafa (PPAM, 2001)

MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note). - Enrique Alba 001; Francisco Almeida; Maria J. Blesa; J. Cabeza; Carlos Cotta; Manuel Díaz; Isabel Dorta; Joaquim Gabarró; Coromoto León; J. Luna; Luz Marina Moreno; C. Pablos; et al. (Euro-Par, 2002)

Universal stability of undirected graphs in the adversarial queueing model. - Carme Àlvarez; Maria J. Blesa; Maria J. Serna (SPAA, 2002)

Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem. - Maria J. Blesa; Christian Blum 001 (EvoWorkshops, 2004)

Using Parallelism in Experimenting and Fine Tuning of Parameters for Metaheuristics. - Maria J. Blesa; Fatos Xhafa (International Conference on Computational Science, 2004)

The Impact of Failure Management on the Stability of Communication Networks. - Carme Àlvarez; Maria J. Blesa; Maria J. Serna (ICPADS, 2004)

The complexity of deciding stability under FFS in the Adversarial Queueing model. - Carme Àlvarez; Maria J. Blesa; Josep Díaz; Antonio Fernández 001; Maria J. Serna (Inf. Process. Lett., 2004)

A Characterization of Universal Stability in the Adversarial Queuing Model. - Carme Àlvarez; Maria J. Blesa; Maria J. Serna (SIAM J. Comput., 2004)

Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem. - Christian Blum 001; Maria J. Blesa (IWANN, 2005)

Adversarial Queueing Model for Continuous Network Dynamics. - Maria J. Blesa; Daniel Calzada; Antonio Fernández 001; Luis López 003; Andrés L. Martínez; Agustín Santos; Maria J. Serna (MFCS, 2005)

Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time , . - Maria J. Blesa (DISC, 2005)

New metaheuristic approaches for the edge-weighted k-cardinality tree problem. - Christian Blum 001; Maria J. Blesa (Comput. Oper. Res., 2005)

Adversarial models for priority-based networks. - Carme Àlvarez; Maria J. Blesa; Josep Díaz; Maria J. Serna; Antonio Fernández 001 (Networks, 2005)

A nature-inspired algorithm for the disjoint paths problem. - Maria J. Blesa; Christian Blum 001 (IPDPS, 2006)

Generic parallel implementations for Tabu search. - Maria J. Blesa; Jordi Petit; Fatos Xhafa (Comput. Syst. Sci. Eng., 2006)

A Report from DISC 2005, the 19th International Symposium on Distributed Computing. - Maria J. Blesa; Chryssis Georgiou (Bull. EATCS, 2006)

Efficient parallel LAN/WAN algorithms for optimization. The mallba project. - Enrique Alba 001; Francisco Almeida; Maria J. Blesa; Carlos Cotta; Manuel Díaz; Isabel Dorta; Joaquim Gabarró; Coromoto León; Gabriel Luque; Jordi Petit (Parallel Comput., 2006)

Probabilistic Beam Search for the Longest Common Subsequence Problem. - Christian Blum 001; Maria J. Blesa (SLS, 2007)

Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm. - Maria J. Blesa; Christian Blum 001 (J. Math. Model. Algorithms, 2007)

On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. - Maria J. Blesa; Christian Blum 001 (Handbook of Approximation Algorithms and Metaheuristics, 2007)

An ant colony optimization algorithm for DNA sequencing by hybridization. - Christian Blum 001; Mateu Yábar Vallès; Maria J. Blesa (Comput. Oper. Res., 2008)

Beam search for the longest common subsequence problem. - Christian Blum 001; Maria J. Blesa; Manuel López-Ibáñez 001 (Comput. Oper. Res., 2009)

Adversarial Queueing Model for Continuous Network Dynamics. - Maria J. Blesa; Daniel Calzada; Antonio Fernández 001; Luis López 003; Andrés L. Martínez; Agustín Santos; Maria J. Serna; Christopher Thraves (Theory Comput. Syst., 2009)

Topology control algorithms in WISELIB. - Jaume Anguera; Maria J. Blesa; J. Farré; V. López; Jordi Petit (SESENA@ICSE, 2010)

A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. - Hugo Hernández; Maria J. Blesa; Christian Blum 001; Tobias Baumgartner 001; Sándor P. Fekete; Alexander Kröller (MSN, 2010)

Coaching on New Technologies: Programming Workshop Android Applications for Google Phones. - Maria J. Blesa; Amalia Duch; Joaquim Gabarró; Hugo Hernández; Maria J. Serna (Bull. EATCS, 2011)

The robustness of stability under link and node failures. - Carme Àlvarez; Maria J. Blesa; Maria J. Serna (Theor. Comput. Sci., 2011)

Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. - Christian Blum 001; Maria J. Blesa; Borja Calvo (Artificial Evolution, 2013)

Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can! - Christian Blum 001; Maria J. Blesa; Borja Calvo (ANTS Conference, 2014)

The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android. - Maria J. Blesa; Amalia Duch; Joaquim Gabarró; Maria J. Serna (CSEDU (2), 2014)

The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms. - Christian Blum 001; Maria J. Blesa; Carlos García-Martínez; Francisco J. Rodríguez 003; Manuel Lozano 001 (EvoCOP, 2014)

Firefighting as a Game. - Carme Àlvarez; Maria J. Blesa; Hendrik Molter (WAW, 2014)

Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio. - Maria J. Blesa; Amalia Duch; Joaquim Gabarró; Jordi Petit; Maria J. Serna (CSEDU (Selected Papers), 2015)

A Cost-benefit Analysis of Continuous Assessment. - Amalia Duch; Joaquim Gabarró; Jordi Petit; Maria J. Blesa; Maria J. Serna (CSEDU (2), 2015)

On solving the most strings with few bad columns problem: An ILP model and heuristics. - Evelia Lizárraga; Maria J. Blesa; Christian Blum 001; Günther R. Raidl (INISTA, 2015)

Stars and Celebrities: A Network Creation Game. - Carme Àlvarez; Maria J. Blesa; Amalia Duch; Arnau Messegué; Maria J. Serna (CoRR, 2015)

FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs. - Christian Blum 001; Borja Calvo; Maria J. Blesa (Swarm Intell., 2015)

Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem. - Christian Blum 001; Maria J. Blesa (EvoCOP, 2016)

Firefighting as a Strategic Game. - Carme Àlvarez; Maria J. Blesa; Hendrik Molter (Internet Math., 2016)

Celebrity games. - Carme Àlvarez; Maria J. Blesa; Amalia Duch; Arnau Messegué; Maria J. Serna (Theor. Comput. Sci., 2016)

A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. - Christian Blum 001; Maria J. Blesa (CEC, 2017)

Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? - Evelia Lizárraga; Maria J. Blesa; Christian Blum 001 (EvoCOP, 2017)

Large neighborhood search for the most strings with few bad columns problem. - Evelia Lizárraga; Maria J. Blesa; Christian Blum 001; Günther R. Raidl (Soft Comput., 2017)

On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. - Maria J. Blesa; Christian Blum 001 (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem. - Christian Blum 001; Maria J. Blesa (Appl. Soft Comput., 2018)

A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. - Christian Blum 001; Maria J. Blesa (J. Heuristics, 2018)

A biased random key genetic algorithm for the weighted independent domination problem. - Guillem Rodríguez Corominas; Christian Blum 001; Maria J. Blesa (GECCO (Companion), 2019)

Forward and backward linear threshold ranks. - Maria J. Blesa; Pau García-Rodríguez; Maria J. Serna (ASONAM, 2021)

Maria Serna's contributions to adversarial queuing theory. - Maria J. Blesa; Antonio Fernández Anta (Comput. Sci. Rev., 2021)

ANTS 2020 Special Issue: Editorial. - Marco Dorigo; Thomas Stützle; Maria J. Blesa; Christian Blum 001; Heiko Hamann; Mary Katherine Heinrich (Swarm Intell., 2021)

Negative learning Ant colony optimization for network alignment. - Guillem Rodríguez Corominas; Christian Blum 001; Maria J. Blesa (GECCO, 2022)

Relating Real and Synthetic Social Networks Through Centrality Measures. - Maria J. Blesa; Mihail Eduard Popa; Maria J. Serna (SEA, 2022)

Playing with Thresholds on the Forward Linear Threshold Rank. - Maria J. Blesa; Maria J. Serna (CoRR, 2022)

AntNetAlign: Ant Colony Optimization for Network Alignment. - Guillem Rodríguez Corominas; Maria J. Blesa; Christian Blum 001 (Appl. Soft Comput., 2023)

AntNetAlign - A software package for Network Alignment. - Guillem Rodríguez Corominas; Maria J. Blesa; Christian Blum 001 (Softw. Impacts, 2023)

Thresholds as Mechanisms for Weighting Influence in the Linear Threshold Rank. - Maria J. Blesa; Alejandro Dominguez-Besserer; Maria J. Serna (ASONAM (1), 2024)

A Proposal for an Educational Well-Being Index (EWI) for Undergraduate Course Design. - Maria J. Blesa; Amalia Duch; Joaquim Gabarró; Maria J. Serna (CSEDU (2), 2024)

Tight Bounds for an Accelerated k-means++ Algorithm. - Guillem Rodríguez Corominas; Maria J. Blesa; Christian Blum 001 (AIAI (1), 2025)

Accelerating the k-Means++ Algorithm by Using Geometric Information. - Guillem Rodríguez Corominas; Maria J. Blesa; Christian Blum 001 (IEEE Access, 2025)

SoftBinReduce: data reduction for color quantization through soft binning. - Guillem Rodríguez Corominas; Maria J. Blesa; Christian Blum 001 (Multim. Syst., 2025)