The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Editorial: COCOON 2012 special issue (Q486972) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Online unweighted knapsack problem with removal cost (Q486978) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- Geodesic order types (Q486983) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- A generalization of the convex Kakeya problem (Q486985) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Analysis of the strategy ``hiring above the \(m\)-th best candidate'' (Q486994) (← links)
- Random walks, bisections and gossiping in circulant graphs (Q486995) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- Guest editorial: Selected papers of European symposium of algorithms (Q486999) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Resource buying games (Q487012) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Routing regardless of network stability (Q487016) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
- Contention resolution under selfishness (Q487024) (← links)
- Preface: Algorithms and computation (ISAAC 2012) (Q487025) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- The minimum vulnerability problem (Q487032) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Linear-space data structures for range minority query in arrays (Q494786) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Register loading via linear programming (Q494793) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
