The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283) (← links)
- Planar disjoint-paths completion (Q329285) (← links)
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Succinct posets (Q329288) (← links)
- Observability of lattice graphs (Q329291) (← links)
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- Distributed universality (Q329296) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Inference algorithms for pattern-based CRFs on sequence data (Q334918) (← links)
- Extending convex partial drawings of graphs (Q334920) (← links)
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- Online network design with outliers (Q334928) (← links)
- Convergence to equilibrium of logit dynamics for strategic games (Q334931) (← links)
- Strategyproof facility location for concave cost functions (Q334934) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Strict self-assembly of fractals using multiple hands (Q334941) (← links)
- Multi-sided boundary labeling (Q334944) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Guest editorial for information complexity and applications (Q343840) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Special issue: Selected papers based on the presentations at the 17th international conference on computing and combinatorics, COCOON 2011, Dallas, TX, USA, August 14--16, 2011 (Q358119) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- Self-assembling rulers for approximating generalized Sierpinski carpets (Q378210) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- Approximately uniform online checkpointing with bounded memory (Q378218) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Derandomizing the HSSW algorithm for 3-SAT (Q378221) (← links)
- On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
- Asymptotic enumeration of extensional acyclic digraphs (Q378229) (← links)
- Message passing algorithms for MLS-3LIN problem (Q378230) (← links)
- A central limit theorem for the number of degree-\(k\) vertices in random maps (Q378231) (← links)
- Analysis of the ``hiring above the median'' selection strategy for the hiring problem (Q378233) (← links)
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions (Q378238) (← links)
- External-memory multimaps (Q378243) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations (Q378246) (← links)
- The school bus problem on trees (Q378249) (← links)
