The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Caching is hard -- even in the fault model (Q692624) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Further thoughts on the syntenic distance between genomes (Q699762) (← links)
- Fair versus unrestricted bin packing (Q699764) (← links)
- Approximation algorithms for access network design (Q699765) (← links)
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767) (← links)
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- The ordered covering problem (Q722532) (← links)
- Complexity of secure sets (Q722534) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
- Preface to special issue dedicated to the 60th birthday of Gregory Gutin (Q722537) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Guest editorial: Special issue on compact data structures (Q724212) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- The subset assignment problem for data placement in caches (Q724230) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Constructing tree-child networks from distance matrices (Q724232) (← links)
- Planar bus graphs (Q724233) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
