The following pages link to Algorithms and Computation (Q2729094):
Displaying 50 items.
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- External-memory multimaps (Q378243) (← links)
- Minimizing interference in ad hoc networks with bounded communication radius (Q456109) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Rank-maximal matchings -- structure and algorithms (Q1733053) (← links)
- Popularity at minimum cost (Q2015798) (← links)
- Some results on point visibility graphs (Q2339447) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Fence patrolling by mobile agents with distinct speeds (Q2353252) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
- Asynchronous rumor spreading on random graphs (Q2408097) (← links)
- Connectivity graphs of uncertainty regions (Q2408099) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks (Q2729095) (← links)
- On the Hyperbolicity of Small-World and Treelike Random Graphs (Q2808837) (← links)
- Geodesic-Preserving Polygon Simplification (Q2872066) (← links)
- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information (Q2872068) (← links)
- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs (Q2872069) (← links)
- Structure and Computation of Straight Skeletons in 3-Space (Q2872070) (← links)
- Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms (Q2872071) (← links)
- Single and Multiple Consecutive Permutation Motif Search (Q2872072) (← links)
- Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching (Q2872073) (← links)
- Less Space: Indexing for Queries with Wildcards (Q2872074) (← links)
- On Determining Deep Holes of Generalized Reed-Solomon Codes (Q2872075) (← links)
- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes (Q2872076) (← links)
- Determinantal Complexities and Field Extensions (Q2872077) (← links)
- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs (Q2872078) (← links)
- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs (Q2872079) (← links)
- The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080) (← links)
- On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2872083) (← links)
- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs (Q2872084) (← links)
- Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds (Q2872085) (← links)
- Better Bounds for Online k-Frame Throughput Maximization in Network Switches (Q2872086) (← links)
- The Solvable Cases of a Scheduling Algorithm (Q2872088) (← links)
- Exact Sublinear Binomial Sampling (Q2872089) (← links)
- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas (Q2872090) (← links)
- Dynamic Point Labeling is Strongly PSPACE-Complete (Q2872091) (← links)
- Unsatisfiable CNF Formulas contain Many Conflicts (Q2872092) (← links)
