The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Complexity results for generating subgraphs (Q724239) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- Model-based segmentation and classification of trajectories (Q724245) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- Computing and combinatorics (Q727961) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- Preface-S.I.: LATIN 2014 (Q727966) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- 2-Xor revisited: satisfiability and probabilities of functions (Q727973) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Biased predecessor search (Q727976) (← links)
- Generalised and quotient models for random and/or~trees and application to satisfiability (Q727977) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- A short implicant of a CNF formula with many satisfying assignments (Q727982) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- What's the frequency, Kenneth?: sublinear Fourier sampling off the grid (Q747618) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- Facets for art gallery problems (Q747627) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
- Probabilistic analysis of a grouping algorithm (Q749213) (← links)
- Moving a disc between polygons (Q749237) (← links)
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- Special issue: Theoretical informatics. Selected papers based on the presentations at the 9th Latin American theoretical informatics symposium (LATIN), Oaxaca, Mexico, April 19--23, 2010 (Q763758) (← links)
- Special issue dedicated to the 13th international symposium on parameterized and exact computation (Q786026) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Maximum queue size and hashing with lazy deletion (Q802861) (← links)
