David Chalupa

According to our database1, David Chalupa authored at least 15 papers between 2011 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
GraphCombEx: a software tool for exploration of combinatorial optimisation properties of large graphs.
Soft Comput., 2019

2018
On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring.
J. Exp. Theor. Artif. Intell., 2018

An order-based algorithm for minimum dominating set with application in graph mining.
Inf. Sci., 2018

Analysis of Iterated Greedy Heuristic for Vertex Clique Covering.
Computing and Informatics, 2018

Hybrid Bridge-Based Memetic Algorithms for Finding Bottlenecks in Complex Networks.
Big Data Research, 2018

2017
Computational methods for finding long simple cycles in complex networks.
Knowl.-Based Syst., 2017

Mining k-reachable sets in real-world networks using domination in shortcut graphs.
J. Comput. Science, 2017

2016
On Combinatorial Optimisation in Analysis of Protein-Protein Interaction and Protein Folding Networks.
Proceedings of the Applications of Evolutionary Computation - 19th European Conference, 2016

2015
Construction of Near-Optimal Vertex Clique Covering for Real-World Networks.
Computing and Informatics, 2015

2013
Adaptation of a multiagent evolutionary algorithm to NK landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

2012
Metaheuristically Optimized Multicriteria Clustering for Medium-Scale Networks.
Proceedings of the Soft Computing Models in Industrial and Environmental Applications, 2012

On the efficiency of an order-based representation in the clique covering problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Population-based and learning-based metaheuristic algorithms for the graph coloring problem.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011


  Loading...