An order-based algorithm for minimum dominating set with application in graph mining D Chalupa Information Sciences 426, 101-116, 2018 | 44 | 2018 |
A memetic algorithm for the minimum conductance graph partitioning problem D Chalupa arXiv preprint arXiv:1704.02854, 2017 | 14 | 2017 |
Hybrid bridge-based memetic algorithms for finding bottlenecks in complex networks D Chalupa, KA Hawick, JA Walker Big Data Research 14, 68-80, 2018 | 13 | 2018 |
Computational methods for finding long simple cycles in complex networks D Chalupa, P Balaghan, KA Hawick, NA Gordon Knowledge-Based Systems 125, 96-107, 2017 | 12 | 2017 |
Population-based and learning-based metaheuristic algorithms for the graph coloring problem D Chalupa Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011 | 11 | 2011 |
Construction of near-optimal vertex clique covering for real-world networks D Chalupa Computing and Informatics 34 (6), 1397-1417, 2015 | 10 | 2015 |
A simple and robust Monte Carlo hybrid local search algorithm for the facility location problem D Chalupa, P Nielsen Engineering Optimization, 1-14, 2018 | 9 | 2018 |
Mining k-reachable sets in real-world networks using domination in shortcut graphs D Chalupa, C Blum Journal of Computational Science 22, 1-14, 2017 | 8 | 2017 |
On the efficiency of an order-based representation in the clique covering problem D Chalupa Proceedings of the 14th annual conference on Genetic and evolutionary …, 2012 | 7 | 2012 |
On the ability of graph coloring heuristics to find substructures in social networks D Chalupa Information Sciences and Technologies Bulletin of the ACM Slovakia 3 (2), 51-54, 2011 | 7 | 2011 |
Instance scale, numerical properties and design of metaheuristics: A study for the facility location problem D Chalupa, P Nielsen IFAC-PapersOnLine 52 (13), 2219-2224, 2019 | 6 | 2019 |
Two strategies of two-level facility network design for autonomous ground vehicle operations D Chalupa, P Nielsen Production & Manufacturing Research 6 (1), 494-506, 2018 | 6 | 2018 |
Analysis of Iterated Greedy Heuristic for Vertex Clique Covering D Chalupa, J Pospíchal Computing and Informatics 37 (2), 385-404, 2018 | 5 | 2018 |
On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring D Chalupa Journal of Experimental & Theoretical Artificial Intelligence 30 (1), 53-69, 2018 | 5 | 2018 |
Partitioning networks into cliques: a randomized heuristic approach D Chalupa Information Sciences and Technologies Bulletin of the ACM Slovakia 6 (3), 1-8, 2014 | 5 | 2014 |
Parameter-free and cooperative local search algorithms for graph colouring D Chalupa, P Nielsen Soft Computing 25 (24), 15035-15050, 2021 | 4 | 2021 |
On combinatorial optimisation in analysis of protein-protein interaction and protein folding networks D Chalupa European Conference on the Applications of Evolutionary Computation, 91-105, 2016 | 4 | 2016 |
Metaheuristically optimized multicriteria clustering for medium-scale networks D Chalupa, J Pospíchal Soft Computing Models in Industrial and Environmental Applications, 337-346, 2013 | 4 | 2013 |
An optimization strategy based on social insect behavior D Chalupa SOFSEM 2011 SRF, 35-50, 2011 | 4 | 2011 |
A large-scale customer-facility network model for customer service centre location applications D Chalupa, P Nielsen, Z Banaszak, G Bocewicz International Conference on Information Systems Architecture and Technology …, 2019 | 3 | 2019 |