Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
21 |
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 |
|
22 |
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 |
|
23 |
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 |
|
24 |
Material Type: Article
|
Image Preprocessing in Classification and Identification of Diabetic Eye DiseasesData Science and Engineering, 2021-12, Vol.6 (4), p.455-471 [Peer Reviewed Journal]The Author(s) 2021 ;The Author(s) 2021. ;COPYRIGHT 2021 Springer ;The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 2364-1185 ;EISSN: 2364-1541 ;DOI: 10.1007/s41019-021-00167-z ;PMID: 34423109Full text available |
|
25 |
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 |
|
26 |
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 |
|
27 |
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 |
|
28 |
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 |
|
29 |
Material Type: Article
|
Finding Matching Cuts in H-Free GraphsAlgorithmica, 2023-10, Vol.85 (10), p.3290-3322 [Peer Reviewed Journal]The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01137-9Digital Resources/Online E-Resources |
|
30 |
Material Type: Article
|
Stable Matching with Uncertain Linear PreferencesAlgorithmica, 2020, Vol.82 (5), p.1410-1433 [Peer Reviewed Journal]The Author(s) 2019 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-019-00650-0Digital Resources/Online E-Resources |
|
31 |
Material Type: Article
|
On Maximizing Sums of Non-monotone Submodular and Linear FunctionsAlgorithmica, 2024-04, Vol.86 (4), p.1080-1134 [Peer Reviewed Journal]The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01183-3Digital Resources/Online E-Resources |
|
32 |
Material Type: Article
|
Complexity Issues on of Secondary Domination NumberAlgorithmica, 2024-04, Vol.86 (4), p.1163-1172 [Peer Reviewed Journal]The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01192-2Digital Resources/Online E-Resources |
|
33 |
Material Type: Article
|
The Time Complexity of Consensus Under Oblivious Message AdversariesAlgorithmica, 2024-06, Vol.86 (6), p.1830-1861 [Peer Reviewed Journal]The Author(s) 2024 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-024-01209-4Digital Resources/Online E-Resources |
|
34 |
Material Type: Article
|
Finding Optimal Solutions with Neighborly HelpAlgorithmica, 2024-06, Vol.86 (6), p.1921-1947 [Peer Reviewed Journal]The Author(s) 2024 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01204-1Digital Resources/Online E-Resources |
|
35 |
Material Type: Article
|
Pattern Masking for Dictionary Matching: Theory and PracticeAlgorithmica, 2024-06, Vol.86 (6), p.1948-1978 [Peer Reviewed Journal]The Author(s) 2024 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-024-01213-8Digital Resources/Online E-Resources |
|
36 |
Material Type: Article
|
Minimal Roman Dominating Functions: Extensions and EnumerationAlgorithmica, 2024-06, Vol.86 (6), p.1862-1887 [Peer Reviewed Journal]The Author(s) 2024 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-024-01211-wDigital Resources/Online E-Resources |
|
37 |
Material Type: Article
|
Diverse Pairs of MatchingsAlgorithmica, 2024-06, Vol.86 (6), p.2026-2040 [Peer Reviewed Journal]The Author(s) 2024 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-024-01214-7Digital Resources/Online E-Resources |
|
38 |
Material Type: Article
|
On the Parameterized Intractability of Determinant MaximizationAlgorithmica, 2024-06, Vol.86 (6), p.1731-1763 [Peer Reviewed Journal]The Author(s) 2024 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01205-0Digital Resources/Online E-Resources |
|
39 |
Material Type: Article
|
The Near Exact Bin Covering ProblemAlgorithmica, 2024-06, Vol.86 (6), p.2041-2066 [Peer Reviewed Journal]The Author(s) 2024 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-024-01224-5Digital Resources/Online E-Resources |
|
40 |
Material Type: Article
|
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic AlgorithmsAlgorithmica, 2020-12, Vol.82 (12), p.3676-3706 [Peer Reviewed Journal]The Author(s) 2020 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00743-1Digital Resources/Online E-Resources |