Full List of Publications

Journal Papers

8
ResearchGate
Chalupa, D., Pospíchal, J.: An Analysis of an Iterated Greedy Heuristic for Vertex Clique Covering. Computing and Informatics, to appear.

7
DOI  ResearchGate
Chalupa, D.: An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining. Information Sciences, 426, 101-116, 2018.

6
DOI  ResearchGate
Chalupa, D.: On Transitions in the Behaviour of Tabu Search Algorithm TabuCol for Graph Colouring. Journal of Experimental & Theoretical Artificial Intelligence, to appear.

5
DOI  ResearchGate
Chalupa, D., Blum, C.: Mining k-Reachable Sets in Real-world Networks Using Domination in Shortcut Graphs. Journal of Computational Science, 22, 1-14, 2017.

4
DOI  ResearchGate
Chalupa, D., Balaghan, P., Hawick, K. A., Gordon, N. A.: Computational Methods for Finding Long Simple Cycles in Complex Networks. Knowledge-Based Systems, 125, 91-105, 2017.

3
paper  ResearchGate  BibTeX
Chalupa, D.: Construction of Near-optimal Vertex Clique Covering for Real-world Networks. Computing and Informatics, 34(6), 1397-1417, 2015.

2
paper  ResearchGate  BibTeX
Chalupa, D.: Partitioning Networks into Cliques: A Randomized Heuristic Approach. Information Sciences and Technologies Bulletin of the ACM Slovakia, 6(3), 1-8, 2014.

1
paper  ResearchGate  BibTeX
Chalupa, D.: On the Ability of Graph Coloring Heuristics to Find Substructures in Social Networks. Information Sciences and Technologies Bulletin of the ACM Slovakia, 3(2): 51-54, 2011.

Conference Papers

9
DOI  ResearchGate  BibTeX
Chalupa, D.: On Combinatorial Optimisation in Analysis of Protein-Protein Interaction and Protein Folding Networks. EvoBIO 2016, 91-105.
The original publication is available at www.springerlink.com.


8
DOI  ResearchGate  BibTeX
Chalupa, D., Pospíchal, J.: On the Growth of Large Independent Sets in Scale-free Networks. Nostradamus 2014, 251-260.
The original publication is available at www.springerlink.com.


7
DOI  ResearchGate  BibTeX
Chalupa, D.: Adaptation of a multiagent evolutionary algorithm to NK landscapes. GECCO (Companion) 2013, 1391-1398.
This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 15th annual conference companion on Genetic and evolutionary computation, http://doi.acm.org/10.1145/2464576.2482719.


6
DOI  ResearchGate  BibTeX
Chalupa, D.: An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms. GECCO 2013, 495-502.
This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 13th annual conference on Genetic and evolutionary computation, http://doi.acm.org/10.1145/2463372.2463436.


5
DOI  ResearchGate  BibTeX
Chalupa, D.: Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-fixed Coloring Tabu Search. EvoCOP 2013, 238-249.
The original publication is available at www.springerlink.com.


4
DOI  ResearchGate  BibTeX
Chalupa, D.: On the efficiency of an order-based representation in the clique covering problem. GECCO 2012, 353-360.
This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 14th annual conference on Genetic and evolutionary computation, http://doi.acm.org/10.1145/2330163.2330215.


3
DOI  ResearchGate  BibTeX
Chalupa, D., Pospíchal, J.: Metaheuristically Optimized Multicriteria Clustering for Medium-Scale Networks. SOCO 2012, 337-346.
The original publication is available at www.springerlink.com.


2
DOI  ResearchGate  BibTeX
Chalupa, D.: Population-based and learning-based metaheuristic algorithms for the graph coloring problem. GECCO 2011, 465-472.
This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 13th annual conference on Genetic and evolutionary computation, http://doi.acm.org/10.1145/2001576.2001641.

1
ResearchGate  BibTeX
Chalupa, D.: An optimization strategy based on social insect behavior. SOFSEM 2011 SRF, 35-50.

Other Papers

2
arXiv
Chalupa, D. A Memetic Algorithm for the Minimum Conductance Graph Partitioning Problem. ArXiv e-prints, arXiv:1704.02854.
1
arXiv
Chalupa, D. An Analysis of a Simple Local Search Algorithm for Graph Colouring. ArXiv e-prints, arXiv:1703.05129. Under review.