David Chalupa - Citegraph

Author Info

Name	Affiliation	Papers
DAVID CHALUPA	Slovak University of Technology, Bratislava, Slovakia	19
Collaborators	Citations	PageRank
9	24	6.84
Referers	Referees	References
33	453	309

Search Limit

100453

Publications (19 rows)

Collaborators (9 rows)

Referers (33 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Parameter-free and cooperative local search algorithms for graph colouring	0	0.34	2021
Instance Scale, Numerical Properties And Design Of Metaheuristics: A Study For The Facility Location Problem	1	0.36	2018
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining.	4	0.40	2018
GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs.	1	0.36	2018
A Probabilistic Ant-based Heuristic for the Longest Simple Cycle Problem in Complex Networks.	0	0.34	2018
Hybrid Bridge-Based Memetic Algorithms for Finding Bottlenecks in Complex Networks.	1	0.34	2018
Analysis of Iterated Greedy Heuristic for Vertex Clique Covering.	0	0.34	2018
On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring.	1	0.36	2018
Mining k-reachable sets in real-world networks using domination in shortcut graphs.	3	0.38	2017
A Memetic Algorithm for the Minimum Conductance Graph Partitioning Problem.	1	0.35	2017
Computational methods for finding long simple cycles in complex networks.	4	0.42	2017
An Analysis of a Simple Local Search Algorithm for Graph Colouring.	0	0.34	2017
On Combinatorial Optimisation in Analysis of Protein-Protein Interaction and Protein Folding Networks.	1	0.35	2016
Construction of Near-Optimal Vertex Clique Covering for Real-World Networks.	0	0.34	2015
Solving clique covering in very large sparse random graphs by a technique based on k-fixed coloring tabu search	0	0.34	2013
An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms	0	0.34	2013
Adaptation of a multiagent evolutionary algorithm to NK landscapes	0	0.34	2013
On the efficiency of an order-based representation in the clique covering problem	2	0.40	2012
Population-based and learning-based metaheuristic algorithms for the graph coloring problem	5	0.41	2011

1