David Chalupa

23 papers A 3B 1Journal 15Unranked 4
YearRankTypeTitle / Venue / Authors
2021 J jnl
Parameter-free and cooperative local search algorithms for graph colouring.
Soft Comput.
David Chalupa, Peter Nielsen
2019 — conf
A Large-Scale Customer-Facility Network Model for Customer Service Centre Location Applications.
ISAT (1)
David Chalupa, Peter Nielsen, Zbigniew Antoni Banaszak, Grzegorz Bocewicz
2019 J jnl
GraphCombEx: a software tool for exploration of combinatorial optimisation properties of large graphs.
Soft Comput.
David Chalupa, Ken A. Hawick
2018 J jnl
A Probabilistic Ant-based Heuristic for the Longest Simple Cycle Problem in Complex Networks.
CoRR
David Chalupa, Phininder Balaghan, Ken A. Hawick
2018 J jnl
An order-based algorithm for minimum dominating set with application in graph mining.
Inf. Sci.
David Chalupa
2018 J jnl
Analysis of Iterated Greedy Heuristic for Vertex Clique Covering.
Comput. Informatics
David Chalupa, Jirí Pospíchal
2018 J jnl
GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs.
CoRR
David Chalupa, Ken A. Hawick
2018 J jnl
Hybrid Bridge-Based Memetic Algorithms for Finding Bottlenecks in Complex Networks.
Big Data Res.
David Chalupa, Ken A. Hawick, James Alfred Walker
2018 J jnl
Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem.
CoRR
David Chalupa, Peter Nielsen
2018 J jnl
On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring.
J. Exp. Theor. Artif. Intell.
David Chalupa
2017 J jnl
A Memetic Algorithm for the Minimum Conductance Graph Partitioning Problem.
CoRR
David Chalupa
2017 J jnl
An Analysis of a Simple Local Search Algorithm for Graph Colouring.
CoRR
David Chalupa
2017 J jnl
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining.
CoRR
David Chalupa
2017 J jnl
Computational methods for finding long simple cycles in complex networks.
Knowl. Based Syst.
David Chalupa, Phininder Balaghan, Ken A. Hawick, Neil A. Gordon
2017 J jnl
Mining k-reachable sets in real-world networks using domination in shortcut graphs.
J. Comput. Sci.
David Chalupa, Christian Blum
2016 — conf
On Combinatorial Optimisation in Analysis of Protein-Protein Interaction and Protein Folding Networks.
EvoApplications (1)
David Chalupa
2015 J jnl
Construction of Near-Optimal Vertex Clique Covering for Real-World Networks.
Comput. Informatics
David Chalupa
2013 — conf
Adaptation of a multiagent evolutionary algorithm to NK landscapes.
GECCO (Companion)
David Chalupa
2013 A conf
An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms.
GECCO
David Chalupa
2013 B conf
Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search.
EvoCOP
David Chalupa
2012 — conf
Metaheuristically Optimized Multicriteria Clustering for Medium-Scale Networks.
SOCO
David Chalupa, Jiri Pospichal
2012 A conf
On the efficiency of an order-based representation in the clique covering problem.
GECCO
David Chalupa
2011 A conf
Population-based and learning-based metaheuristic algorithms for the graph coloring problem.
GECCO
David Chalupa