Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Article
|
Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic AlgorithmAlgorithmica, 2018-05, Vol.80, p.1658-1709 [Peer Reviewed Journal]Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-017-0354-9Digital Resources/Online E-Resources |
|
2 |
Material Type: Article
|
Finding Temporal Paths Under Waiting Time ConstraintsAlgorithmica, 2021-09, Vol.83 (9), p.2754-2802 [Peer Reviewed Journal]The Author(s) 2021 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00831-wDigital Resources/Online E-Resources |
|
3 |
Material Type: Article
|
Multiplicative Drift AnalysisAlgorithmica, 2012-12, Vol.64 (4), p.673-697 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2012 ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9622-xFull text available |
|
4 |
Material Type: Article
|
Temporal Network Optimization Subject to Connectivity ConstraintsAlgorithmica, 2019-04, Vol.81 (4), p.1416-1449 [Peer Reviewed Journal]The Author(s) 2018 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-018-0478-6Digital Resources/Online E-Resources |
|
5 |
Material Type: Article
|
The Runtime of the Compact Genetic Algorithm on Jump FunctionsAlgorithmica, 2021-10, Vol.83 (10), p.3059-3107 [Peer Reviewed Journal]Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00780-wDigital Resources/Online E-Resources |
|
6 |
Material Type: Article
|
On Structural Parameterizations of the Bounded-Degree Vertex Deletion ProblemAlgorithmica, 2021-01, Vol.83 (1), p.297-336 [Peer Reviewed Journal]The Author(s) 2020 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00758-8Digital Resources/Online E-Resources |
|
7 |
Material Type: Article
|
Compact Distributed Certification of Planar GraphsAlgorithmica, 2021-07, Vol.83 (7), p.2215-2244 [Peer Reviewed Journal]Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00823-wDigital Resources/Online E-Resources |
|
8 |
Material Type: Article
|
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump FunctionsAlgorithmica, 2022-06 [Peer Reviewed Journal]Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00907-7Digital Resources/Online E-Resources |
|
9 |
Material Type: Article
|
Publisher Correction: Longest Common Substring with Approximately k MismatchesAlgorithmica, 2023, Vol.85 (10), p.3323-3323 [Peer Reviewed Journal]The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01119-xDigital Resources/Online E-Resources |
|
10 |
Material Type: Article
|
On the Tractability of Optimization Problems on H-GraphsAlgorithmica, 2020-09, Vol.82 (9), p.2432-2473 [Peer Reviewed Journal]The Author(s) 2020 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00692-9Digital Resources/Online E-Resources |
|
11 |
Material Type: Article
|
Traversability, Reconfiguration, and Reachability in the Gadget FrameworkAlgorithmica, 2023-11, Vol.85 (11), p.3453-3486 [Peer Reviewed Journal]The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01140-0Digital Resources/Online E-Resources |
|
12 |
Material Type: Article
|
Black-Box Search by Unbiased VariationAlgorithmica, 2012-12, Vol.64 (4), p.623-642 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2012 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9616-8Full text available |
|
13 |
Material Type: Article
|
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String ProblemsAlgorithmica, 2023-05, Vol.85 (5), p.1251-1286 [Peer Reviewed Journal]The Author(s) 2022 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-022-01066-zDigital Resources/Online E-Resources |
|
14 |
Material Type: Article
|
Multiplicative Up-DriftAlgorithmica, 2021-10, Vol.83 (10), p.3017-3058 [Peer Reviewed Journal]The Author(s) 2020 ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00775-7Digital Resources/Online E-Resources |
|
15 |
Material Type: Article
|
Queue Layouts of Planar 3-TreesAlgorithmica, 2020-09, Vol.82 (9), p.2564-2585 [Peer Reviewed Journal]The Author(s) 2020 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00697-4Digital Resources/Online E-Resources |
|
16 |
Material Type: Article
|
Faster algorithms for counting subgraphs in sparse graphsAlgorithmica, 2021, Vol.83 (8), p.2578-2605 [Peer Reviewed Journal]The Author(s) 2021 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00811-0Digital Resources/Online E-Resources |
|
17 |
Material Type: Article
|
Improved Online Algorithms for Knapsack and GAP in the Random Order ModelAlgorithmica, 2021, Vol.83 (6), p.1750-1785 [Peer Reviewed Journal]The Author(s) 2021 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00801-2Digital Resources/Online E-Resources |
|
18 |
Material Type: Article
|
The Power of Cut-Based Parameters for Computing Edge-Disjoint PathsAlgorithmica, 2021, Vol.83 (2), p.726-752 [Peer Reviewed Journal]The Author(s) 2020 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00772-wDigital Resources/Online E-Resources |
|
19 |
Material Type: Article
|
A Tight Runtime Analysis for the (µ + λ) EAAlgorithmica, 2021-04, Vol.83 (4), p.1054-1095 [Peer Reviewed Journal]Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00731-5Digital Resources/Online E-Resources |
|
20 |
Material Type: Article
|
Theoretical analysis of git bisectAlgorithmica, 2024-05 [Peer Reviewed Journal]Attribution ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01194-0Digital Resources/Online E-Resources |