„Algorithms & Data Structures“
Suchergebnisse
3.154 Treffer
-
Evaluating the practicality of quantum optimization algorithms for prototypical industrial applications
-
NISQ-friendly measurement-based quantum clustering algorithms
-
On “an improved algorithm for finding the median distributively” [1]
-
Approximation in (Poly-) Logarithmic Space
-
Parameterized Multi-Scenario Single-Machine Scheduling Problems
-
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
-
Faster Algorithms for Computing the R* Consensus Tree
-
Approximating Maximum Agreement Forest on Multiple Binary Trees
-
Colouring (Pr + Ps)-Free Graphs
-
Compressed Subsequence Matching and Packed Tree Coloring
-
Direct Sum Fails for Zero-Error Average Communication
-
The Complexity of L(p, q)-Edge-Labelling
-
Gapped Indexing for Consecutive Occurrences
-
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects
-
Improved parallel mask refreshing algorithms: generic solutions with parametrized non-interference and automated optimizations
-
Batch Coloring of Graphs
-
Rooted Maximum Agreement Supertrees
-
Internal and external algorithms for the points-in-regions problem—the inside join of geo-relational algebra
-
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
-
Algorithms and Complexity on Indexing Founder Graphs