default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 605
Volume 605, November 2015
- Joseph Kempka, Phil McMinn, Dirk Sudholt:
Design and analysis of different alternating variable searches for search-based software testing. 1-20 - Pietro S. Oliveto
, Carsten Witt:
Improved time complexity analysis of the Simple Genetic Algorithm. 21-41 - Youhei Akimoto, Sandra Astete Morales, Olivier Teytaud:
Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. 42-50 - Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
The minimum backlog problem. 51-61 - Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith:
Closure properties and complexity of rational sets of regular languages. 62-79 - Rolf Klein, David Kriesel, Elmar Langetepe:
A local strategy for cleaning expanding cellular domains by simple robots. 80-94 - Krzysztof Krzywdzinski, Katarzyna Rybarczyk:
Distributed algorithms for random graphs. 95-105 - Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore:
R-LINE: A better randomized 2-server algorithm on the line. 106-118 - Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced subgraph isomorphism: Are some patterns substantially easier than others? 119-128 - Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Explore and repair graphs with black holes using mobile entities. 129-145 - Ranita Biswas, Partha Bhowmick:
On different topological classes of spherical geodesic paths and circles in Z3. 146-163
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.
last updated on 2025-01-24 17:03 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:
