The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- On optimally partitioning a text to improve its compression (Q634677) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Geometric spanners for weighted point sets (Q634687) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- A quadratic algorithm for finding next-to-shortest paths in graphs (Q639280) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- Graphical congestion games (Q639291) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- Searching a bitstream in linear time for the longest substring of any given density (Q644795) (← links)
- Sleeping on the job: energy-efficient and robust broadcast for radio networks (Q644799) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- A new algorithm for a field splitting problem in intensity-modulated radiation therapy (Q644801) (← links)
- Subgraphs of 4-regular planar graphs (Q644803) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- Special issue: ISAAC 2008. Selected papers from the 19th annual international symposium on algorithms and computation, Gold Coast, Australia, December 15--17, 2008 (Q649625) (← links)
- Special issue: Algorithms and computation. Selected papers based on the presentations at the 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16--18, 2009. (Q651254) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- How to guard a graph? (Q652526) (← links)
- Tighter approximation bounds for minimum CDS in unit disk graphs (Q652528) (← links)
- Signature theory in holographic algorithms (Q652529) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Another sub-exponential algorithm for the simple stochastic game (Q652540) (← links)
- An improved approximation algorithm for the traveling tournament problem (Q652542) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
