default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Chalupa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j9]David Chalupa
, Peter Nielsen:
Parameter-free and cooperative local search algorithms for graph colouring. Soft Comput. 25(24): 15035-15050 (2021)
2010 – 2019
- 2019
- [j8]David Chalupa, Ken A. Hawick:
GraphCombEx: a software tool for exploration of combinatorial optimisation properties of large graphs. Soft Comput. 23(14): 5715-5724 (2019) - [c8]David Chalupa, Peter Nielsen, Zbigniew Antoni Banaszak, Grzegorz Bocewicz:
A Large-Scale Customer-Facility Network Model for Customer Service Centre Location Applications. ISAT (1) 2019: 68-77 - 2018
- [j7]David Chalupa, Ken A. Hawick, James Alfred Walker:
Hybrid Bridge-Based Memetic Algorithms for Finding Bottlenecks in Complex Networks. Big Data Res. 14: 68-80 (2018) - [j6]David Chalupa, Jirí Pospíchal:
Analysis of Iterated Greedy Heuristic for Vertex Clique Covering. Comput. Informatics 37(2): 385-404 (2018) - [j5]David Chalupa:
An order-based algorithm for minimum dominating set with application in graph mining. Inf. Sci. 426: 101-116 (2018) - [j4]David Chalupa:
On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring. J. Exp. Theor. Artif. Intell. 30(1): 53-69 (2018) - [i6]David Chalupa, Peter Nielsen:
Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem. CoRR abs/1801.03419 (2018) - [i5]David Chalupa, Phininder Balaghan, Ken A. Hawick:
A Probabilistic Ant-based Heuristic for the Longest Simple Cycle Problem in Complex Networks. CoRR abs/1801.09227 (2018) - [i4]David Chalupa, Ken A. Hawick:
GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs. CoRR abs/1801.09229 (2018) - 2017
- [j3]David Chalupa, Christian Blum:
Mining k-reachable sets in real-world networks using domination in shortcut graphs. J. Comput. Sci. 22: 1-14 (2017) - [j2]David Chalupa, Phininder Balaghan, Ken A. Hawick, Neil A. Gordon:
Computational methods for finding long simple cycles in complex networks. Knowl. Based Syst. 125: 96-107 (2017) - [i3]David Chalupa:
An Analysis of a Simple Local Search Algorithm for Graph Colouring. CoRR abs/1703.05129 (2017) - [i2]David Chalupa:
A Memetic Algorithm for the Minimum Conductance Graph Partitioning Problem. CoRR abs/1704.02854 (2017) - [i1]David Chalupa:
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining. CoRR abs/1705.00318 (2017) - 2016
- [c7]David Chalupa:
On Combinatorial Optimisation in Analysis of Protein-Protein Interaction and Protein Folding Networks. EvoApplications (1) 2016: 91-105 - 2015
- [j1]David Chalupa:
Construction of Near-Optimal Vertex Clique Covering for Real-World Networks. Comput. Informatics 34(6): 1397-1417 (2015) - 2013
- [c6]David Chalupa:
Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search. EvoCOP 2013: 238-249 - [c5]David Chalupa:
An analytical investigation of block-based mutation operators for order-based stochastic clique covering algorithms. GECCO 2013: 495-502 - [c4]David Chalupa:
Adaptation of a multiagent evolutionary algorithm to NK landscapes. GECCO (Companion) 2013: 1391-1398 - 2012
- [c3]David Chalupa:
On the efficiency of an order-based representation in the clique covering problem. GECCO 2012: 353-360 - [c2]David Chalupa, Jiri Pospichal:
Metaheuristically Optimized Multicriteria Clustering for Medium-Scale Networks. SOCO 2012: 337-346 - 2011
- [c1]David Chalupa:
Population-based and learning-based metaheuristic algorithms for the graph coloring problem. GECCO 2011: 465-472
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
