Maria J. Blesa
Orcid: 0000-0001-8246-9926Affiliations:
- Polytechnic University of Catalonia, Barcelona, Spain
According to our database1,
Maria J. Blesa
authored at least 56 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on lsi.upc.es
On csauthors.net:
Bibliography
2023
2022
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
2021
Proceedings of the ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining, Virtual Event, The Netherlands, November 8, 2021
2019
A biased random key genetic algorithm for the weighted independent domination problem.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019
2018
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem.
J. Heuristics, 2018
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem.
Appl. Soft Comput., 2018
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Soft Comput., 2017
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017
2016
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016
2015
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs.
Swarm Intell., 2015
On solving the most strings with few bad columns problem: An ILP model and heuristics.
Proceedings of the International Symposium on Innovations in Intelligent SysTems and Applications, 2015
A Cost-benefit Analysis of Continuous Assessment.
Proceedings of the CSEDU 2015, 2015
Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio.
Proceedings of the Computer Supported Education - 7th International Conference, 2015
2014
Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014
The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android.
Proceedings of the CSEDU 2014, 2014
Proceedings of the Swarm Intelligence - 9th International Conference, 2014
2013
Proceedings of the Artificial Evolution, 2013
2011
Coaching on New Technologies: Programming Workshop Android Applications for Google Phones.
Bull. EATCS, 2011
2010
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib.
Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010
Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications, 2010
2009
Theory Comput. Syst., 2009
2008
Comput. Oper. Res., 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
J. Math. Model. Algorithms, 2007
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
2006
Parallel Comput., 2006
A Report from DISC 2005, the 19th International Symposium on Distributed Computing.
Bull. EATCS, 2006
Generic parallel implementations for Tabu search.
Comput. Syst. Sci. Eng., 2006
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006
2005
New metaheuristic approaches for the edge-weighted <i>k</i>-cardinality tree problem.
Comput. Oper. Res., 2005
Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time <sup>, </sup>.
Proceedings of the Distributed Computing, 19th International Conference, 2005
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem.
Proceedings of the Computational Intelligence and Bioinspired Systems, 2005
2004
SIAM J. Comput., 2004
Inf. Process. Lett., 2004
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004
Proceedings of the Computational Science, 2004
Proceedings of the Applications of Evolutionary Computing, 2004
2002
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002
Proceedings of the Euro-Par 2002, 2002
2001
Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition.
Proceedings of the Parallel Processing and Applied Mathematics, 2001
Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001