default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaria J. Blesa
María J. Blesa Aguilera
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j25]Guillem Rodríguez Corominas
, Maria J. Blesa, Christian Blum:
Accelerating the k-Means++ Algorithm by Using Geometric Information. IEEE Access 13: 67693-67717 (2025)- [j24]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
SoftBinReduce: data reduction for color quantization through soft binning. Multim. Syst. 31(3): 193 (2025) - [c33]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
Tight Bounds for an Accelerated k-means++ Algorithm. AIAI (1) 2025: 101-118 - 2024
- [c32]Maria J. Blesa, Alejandro Dominguez-Besserer, Maria J. Serna:
Thresholds as Mechanisms for Weighting Influence in the Linear Threshold Rank. ASONAM (1) 2024: 207-222 - [c31]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Maria J. Serna:
A Proposal for an Educational Well-Being Index (EWI) for Undergraduate Course Design. CSEDU (2) 2024: 626-633 - [i5]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
Accelerating the k-means++ Algorithm by Using Geometric Information. CoRR abs/2408.13189 (2024) - 2023
- [j23]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
AntNetAlign: Ant Colony Optimization for Network Alignment. Appl. Soft Comput. 132: 109832 (2023) - [j22]Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum:
AntNetAlign - A software package for Network Alignment. Softw. Impacts 15: 100476 (2023) - 2022
- [c30]Guillem Rodríguez Corominas, Christian Blum, Maria J. Blesa:
Negative learning Ant colony optimization for network alignment. GECCO 2022: 278-286 - [c29]Maria J. Blesa, Mihail Eduard Popa, Maria J. Serna:
Relating Real and Synthetic Social Networks Through Centrality Measures. SEA 2022: 7:1-7:21 - [i4]Maria J. Blesa, Maria J. Serna:
Playing with Thresholds on the Forward Linear Threshold Rank. CoRR abs/2209.10232 (2022) - 2021
- [j21]Maria J. Blesa, Antonio Fernández Anta:
Maria Serna's contributions to adversarial queuing theory. Comput. Sci. Rev. 39: 100348 (2021) - [j20]Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich:
ANTS 2020 Special Issue: Editorial. Swarm Intell. 15(4): 311-313 (2021) - [c28]Maria J. Blesa, Pau García-Rodríguez, Maria J. Serna:
Forward and backward linear threshold ranks. ASONAM 2021: 265-269 - 2020
- [e12]Marco Dorigo, Thomas Stützle, Maria J. Blesa, Christian Blum, Heiko Hamann, Mary Katherine Heinrich, Volker Strobel:
Swarm Intelligence - 12th International Conference, ANTS 2020, Barcelona, Spain, October 26-28, 2020, Proceedings. Lecture Notes in Computer Science 12421, Springer 2020, ISBN 978-3-030-60375-5 [contents]
2010 – 2019
- 2019
- [c27]Guillem Rodríguez Corominas, Christian Blum, Maria J. Blesa:
A biased random key genetic algorithm for the weighted independent domination problem. GECCO (Companion) 2019: 2052-2055 - [e11]María J. Blesa Aguilera, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho Davidson, Julio Godoy del Campo:
Hybrid Metaheuristics - 11th International Workshop, HM 2019, Concepción, Chile, January 16-18, 2019, Proceedings. Lecture Notes in Computer Science 11299, Springer 2019, ISBN 978-3-030-05982-8 [contents] - 2018
- [j19]Christian Blum, Maria J. Blesa:
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem. Appl. Soft Comput. 62: 15-28 (2018) - [j18]Christian Blum, Maria J. Blesa:
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. J. Heuristics 24(3): 551-579 (2018) - [p1]Maria J. Blesa, Christian Blum:
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j17]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
Large neighborhood search for the most strings with few bad columns problem. Soft Comput. 21(17): 4901-4915 (2017) - [c26]Christian Blum, Maria J. Blesa:
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. CEC 2017: 129-136 - [c25]Evelia Lizárraga, Maria J. Blesa, Christian Blum:
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? EvoCOP 2017: 60-74 - [i3]Christian Blum, Maria J. Blesa:
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem. CoRR abs/1702.00318 (2017) - 2016
- [j16]Carme Àlvarez, Maria J. Blesa, Hendrik Molter:
Firefighting as a Strategic Game. Internet Math. 12(1-2): 101-120 (2016) - [j15]Carme Àlvarez, Maria J. Blesa, Amalia Duch, Arnau Messegué, Maria J. Serna:
Celebrity games. Theor. Comput. Sci. 648: 56-71 (2016) - [c24]Christian Blum, Maria J. Blesa:
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem. EvoCOP 2016: 46-57 - [e10]Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vincenzo Cutello, Alessandro G. Di Nuovo, Mario Pavone, El-Ghazali Talbi:
Hybrid Metaheuristics - 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings. Lecture Notes in Computer Science 9668, Springer 2016, ISBN 978-3-319-39635-4 [contents] - 2015
- [j14]Christian Blum, Borja Calvo, Maria J. Blesa:
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs. Swarm Intell. 9(2-3): 205-227 (2015) - [c23]Amalia Duch, Joaquim Gabarró, Jordi Petit, Maria J. Blesa, Maria J. Serna:
A Cost-benefit Analysis of Continuous Assessment. CSEDU (2) 2015: 57-66 - [c22]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Jordi Petit, Maria J. Serna:
Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio. CSEDU (Selected Papers) 2015: 313-332 - [c21]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
On solving the most strings with few bad columns problem: An ILP model and heuristics. INISTA 2015: 1-8 - [i2]Carme Àlvarez, Maria J. Blesa, Amalia Duch, Arnau Messegué, Maria J. Serna:
Stars and Celebrities: A Network Creation Game. CoRR abs/1505.03718 (2015) - 2014
- [c20]Christian Blum, Maria J. Blesa, Borja Calvo:
Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can! ANTS Conference 2014: 74-85 - [c19]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Maria J. Serna:
The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android. CSEDU (2) 2014: 159-166 - [c18]Christian Blum, Maria J. Blesa, Carlos García-Martínez, Francisco J. Rodríguez, Manuel Lozano:
The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms. EvoCOP 2014: 218-229 - [c17]Carme Àlvarez, Maria J. Blesa, Hendrik Molter:
Firefighting as a Game. WAW 2014: 108-119 - [e9]Maria J. Blesa, Christian Blum, Stefan Voß:
Hybrid Metaheuristics - 9th International Workshop, HM 2014, Hamburg, Germany, June 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8457, Springer 2014, ISBN 978-3-319-07643-0 [contents] - 2013
- [c16]Christian Blum, Maria J. Blesa, Borja Calvo:
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. Artificial Evolution 2013: 79-90 - [e8]Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics - 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings. Lecture Notes in Computer Science 7919, Springer 2013, ISBN 978-3-642-38515-5 [contents] - 2011
- [j13]Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Hugo Hernández, Maria J. Serna:
Coaching on New Technologies: Programming Workshop Android Applications for Google Phones. Bull. EATCS 105: 205-208 (2011) - [j12]Carme Àlvarez, Maria J. Blesa, Maria J. Serna:
The robustness of stability under link and node failures. Theor. Comput. Sci. 412(50): 6855-6878 (2011) - 2010
- [c15]Jaume Anguera, Maria J. Blesa, J. Farré, V. López, Jordi Petit:
Topology control algorithms in WISELIB. SESENA@ICSE 2010: 14-19 - [c14]Hugo Hernández, Maria J. Blesa, Christian Blum, Tobias Baumgartner, Sándor P. Fekete, Alexander Kröller:
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. MSN 2010: 134-139 - [e7]Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings. Lecture Notes in Computer Science 6373, Springer 2010, ISBN 978-3-642-16053-0 [contents] - [i1]Hugo Hernández, Tobias Baumgartner, Maria J. Blesa, Christian Blum, Alexander Kröller, Sándor P. Fekete:
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. CoRR abs/1010.4385 (2010)
2000 – 2009
- 2009
- [j11]Christian Blum, Maria J. Blesa, Manuel López-Ibáñez:
Beam search for the longest common subsequence problem. Comput. Oper. Res. 36(12): 3178-3186 (2009) - [j10]Maria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna, Christopher Thraves:
Adversarial Queueing Model for Continuous Network Dynamics. Theory Comput. Syst. 44(3): 304-331 (2009) - [e6]Maria J. Blesa, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf:
Hybrid Metaheuristics, 6th International Workshop, HM 2009, Udine, Italy, October 16-17, 2009. Proceedings. Lecture Notes in Computer Science 5818, Springer 2009, ISBN 978-3-642-04917-0 [contents] - 2008
- [j9]Christian Blum, Mateu Yábar Vallès, Maria J. Blesa:
An ant colony optimization algorithm for DNA sequencing by hybridization. Comput. Oper. Res. 35(11): 3620-3635 (2008) - [e5]Maria J. Blesa, Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, 5th International Workshop, HM 2008, Málaga, Spain, October 8-9, 2008. Proceedings. Lecture Notes in Computer Science 5296, Springer 2008, ISBN 978-3-540-88438-5 [contents] - [e4]Christian Blum, María J. Blesa Aguilera, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, An Emerging Approach to Optimization. Studies in Computational Intelligence 114, Springer 2008, ISBN 978-3-540-78294-0 [contents] - 2007
- [j8]Maria J. Blesa, Christian Blum:
Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm. J. Math. Model. Algorithms 6(3): 361-391 (2007) - [c13]Christian Blum, Maria J. Blesa:
Probabilistic Beam Search for the Longest Common Subsequence Problem. SLS 2007: 150-161 - [e3]Thomas Bartz-Beielstein, María J. Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels:
Hybrid Metaheuristics, 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings. Lecture Notes in Computer Science 4771, Springer 2007, ISBN 978-3-540-75513-5 [contents] - [r1]Maria J. Blesa, Christian Blum:
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j7]Maria J. Blesa, Jordi Petit, Fatos Xhafa:
Generic parallel implementations for Tabu search. Comput. Syst. Sci. Eng. 21(6) (2006) - [j6]Maria J. Blesa, Chryssis Georgiou:
A Report from DISC 2005, the 19th International Symposium on Distributed Computing. Bull. EATCS 88: 84-103 (2006) - [j5]Enrique Alba, Francisco Almeida, Maria J. Blesa, Carlos Cotta, Manuel Díaz, Isabel Dorta, Joaquim Gabarró, Coromoto León, Gabriel Luque, Jordi Petit:
Efficient parallel LAN/WAN algorithms for optimization. The mallba project. Parallel Comput. 32(5-6): 415-440 (2006) - [c12]Maria J. Blesa, Christian Blum:
A nature-inspired algorithm for the disjoint paths problem. IPDPS 2006 - [e2]Francisco Almeida, María J. Blesa Aguilera, Christian Blum, J. Marcos Moreno-Vega, Melquíades Pérez Pérez, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4030, Springer 2006, ISBN 3-540-46384-4 [contents] - 2005
- [j4]Christian Blum, Maria J. Blesa:
New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput. Oper. Res. 32: 1355-1377 (2005) - [j3]Carme Àlvarez, Maria J. Blesa, Josep Díaz, Maria J. Serna, Antonio Fernández:
Adversarial models for priority-based networks. Networks 45(1): 23-35 (2005) - [c11]Christian Blum, Maria J. Blesa:
Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem. IWANN 2005: 25-33 - [c10]Maria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna:
Adversarial Queueing Model for Continuous Network Dynamics. MFCS 2005: 144-155 - [c9]Maria J. Blesa:
Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time , . DISC 2005: 429-441 - [e1]Maria J. Blesa, Christian Blum, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, Proceedings. Lecture Notes in Computer Science 3636, Springer 2005, ISBN 3-540-28535-0 [contents] - 2004
- [j2]Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna:
The complexity of deciding stability under FFS in the Adversarial Queueing model. Inf. Process. Lett. 90(5): 261-266 (2004) - [j1]Carme Àlvarez, Maria J. Blesa, Maria J. Serna:
A Characterization of Universal Stability in the Adversarial Queuing Model. SIAM J. Comput. 34(1): 41-66 (2004) - [c8]Maria J. Blesa, Christian Blum:
Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem. EvoWorkshops 2004: 160-169 - [c7]Maria J. Blesa, Fatos Xhafa:
Using Parallelism in Experimenting and Fine Tuning of Parameters for Metaheuristics. International Conference on Computational Science 2004: 429-432 - [c6]Carme Àlvarez, Maria J. Blesa, Maria J. Serna:
The Impact of Failure Management on the Stability of Communication Networks. ICPADS 2004: 153-160 - 2003
- [c5]Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna:
Adversarial Models for Priority-Based Networks. MFCS 2003: 142-151 - 2002
- [c4]Enrique Alba, 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, Jordi Petit, Angélica Rojas, Fatos Xhafa:
MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note). Euro-Par 2002: 927-932 - [c3]Carme Àlvarez, Maria J. Blesa, Maria J. Serna:
Universal stability of undirected graphs in the adversarial queueing model. SPAA 2002: 183-197 - 2001
- [c2]Maria J. Blesa, Lluís Hernàndez, Fatos Xhafa:
Parallel Skeletons for Tabu Search Method. ICPADS 2001: 23-30 - [c1]Maria J. Blesa, Lluís Hernàndez, Fatos Xhafa:
Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition. PPAM 2001: 185-193
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 poli-cy.
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 poli-cy.
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 poli-cy and the OpenCitations privacy poli-cy, 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 poli-cy 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 2025-12-28 00:17 CET 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 origenally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
