default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSusan Khor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]Susan Khor:
Comparing local search paths with global search paths on protein residue networks: allosteric communication. J. Complex Networks 5(3): 409-432 (2017)- 2016
- [j3]Susan Khor:
Protein residue networks from a local search perspective. J. Complex Networks 4(2): 245-278 (2016) - 2015
- [i9]Susan Khor:
The short-cut network within protein residue networks. CoRR abs/1508.02798 (2015) - 2014
- [i8]Susan Khor:
Protein residue networks from a local search perspective. CoRR abs/1412.2155 (2014) - 2012
- [j2]Susan Khor:
Towards an integrated understanding of the structural characteristics of protein residue networks. Theory Biosci. 131(2): 61-75 (2012) - [i7]Susan Khor:
Speeding up the construction of slow adaptive walks. CoRR abs/1206.5559 (2012) - 2011
- [c10]Susan Khor:
Why aren't protein residue networks smaller worlds? ECAL 2011: 397-403 - [i6]Susan Khor:
Why aren't the small worlds of protein contact networks smaller. CoRR abs/1101.2229 (2011) - [i5]Susan Khor:
What can we learn from slow self-avoiding adaptive walks by an infinite radius search algorithm? CoRR abs/1107.3498 (2011) - 2010
- [j1]Susan Khor:
Concurrency and Network Disassortativity. Artif. Life 16(3): 225-232 (2010) - [i4]Susan Khor:
Static and dynamic characteristics of protein contact networks. CoRR abs/1011.2222 (2010)
2000 – 2009
- 2009
- [c9]Susan Khor:
Exploring the influence of problem structural characteristics on evolutionary algorithm performance. IEEE Congress on Evolutionary Computation 2009: 3345-3352 - [c8]Susan Khor:
Effect of degree distribution on evolutionary search. GECCO 2009: 1857-1858 - [i3]Susan Khor:
Effect of Degree Distribution on Evolutionary Search. CoRR abs/0903.2516 (2009) - [i2]Susan Khor:
Generating Hierarchically Modular Networks via Link Switching. CoRR abs/0903.2598 (2009) - [i1]Susan Khor:
Application of Graph Coloring to Biological Networks. CoRR abs/0912.3461 (2009) - 2008
- [c7]Susan Khor:
Where genetic drift, crossover and mutation play nice in a free mixing single-population genetic algorithm. IEEE Congress on Evolutionary Computation 2008: 62-69 - 2007
- [c6]Susan Khor:
How Different Hierarchical Relationships Impact Evolution. ACAL 2007: 119-130 - [c5]Susan Khor:
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution. GECCO 2007: 277-284 - [c4]Susan Khor:
On solving hierarchical problems with top down control. GECCO (Companion) 2007: 2543-2548 - [c3]Susan Khor:
HIFF-II: A Hierarchically Decomposable Problem with Inter-level Interdependency. ALIFE 2007: 274-281 - [c2]Susan Khor:
Rethinking the Adaptive Capability of Accretive Evolution on Hierarchically Consistent Problems. ALIFE 2007: 409-416 - 2004
- [c1]Susan Khor, Peter Grogono:
Using a Genetic Algorithm and Formal Concept Analysis to Generate Branch Coverage Test Data Automatically. ASE 2004: 346-349
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 2025-01-09 12:52 CET 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:
