Pages that link to "Item:Q5383959"

The following pages link to Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Q5383959):

Displaying 50 items.

• Bicriteria Data Compression: Efficient and Usable (Q2921426) (← links)
• Distributed connectivity decomposition (Q2943618) (← links)
• Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time (Q4554938) (← links)
• A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i>-Median (Q5383960) (← links)
• Improved Approximation Algorithm for Two-Dimensional Bin Packing (Q5383961) (← links)
• A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path (Q5383962) (← links)
• Better Approximation Bounds for the Joint Replenishment Problem (Q5383963) (← links)
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach (Q5383964) (← links)
• An Excluded Grid Theorem for Digraphs with Forbidden Minors (Q5383965) (← links)
• Finding small patterns in permutations in linear time (Q5383966) (← links)
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable (Q5383967) (← links)
• Interval Deletion is Fixed-Parameter Tractable (Q5383968) (← links)
• Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms (Q5383969) (← links)
• On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank (Q5383970) (← links)
• Implicit Manifold Reconstruction (Q5383971) (← links)
• Approximating Local Homology from Samples (Q5383972) (← links)
• Robust Satisfiability of Systems of Equations (Q5383973) (← links)
• Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball (Q5383974) (← links)
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (Q5383975) (← links)
• Computing Cut-Based Hierarchical Decompositions in Almost Linear Time (Q5383976) (← links)
• Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (Q5383977) (← links)
• Improved bounds and algorithms for graph cuts and network reliability (Q5383978) (← links)
• Towards (1 + <i>∊</i>)-Approximate Flow Sparsifiers (Q5383979) (← links)
• Uniform random sampling of simple branched coverings of the sphere by itself (Q5383980) (← links)
• MCMC sampling colourings and independent sets of <i>G</i>(<i>n, d</i>/<i>n</i>) near uniqueness threshold (Q5383981) (← links)
• Arboricity and spanning-tree packing in random graphs with an application to load balancing (Q5383982) (← links)
• Clustering and Mixing Times for Segregation Models on ℤ² (Q5383983) (← links)
• A Simple FPTAS for Counting Edge Covers (Q5383984) (← links)
• Space complexity of list <i>H</i>-colouring: a dichotomy (Q5383985) (← links)
• Positivity Problems for Low-Order Linear Recurrence Sequences (Q5383986) (← links)
• Polynomial Solvability of Variants of the Trust-Region Subproblem (Q5383987) (← links)
• On the Lattice Isomorphism Problem (Q5383988) (← links)
• The Complexity of Order Type Isomorphism (Q5383989) (← links)
• Dynamic Task Allocation in Asynchronous Shared Memory (Q5383990) (← links)
• Competitive Analysis via Regularization (Q5383991) (← links)
• First Come First Served for Online Slot Allocation and Huffman Coding (Q5383993) (← links)
• Online Steiner Tree with Deletions (Q5383994) (← links)
• Maintaining Assignments Online: Matching, Scheduling, and Flows (Q5383995) (← links)
• (Nearly) Sample-Optimal Sparse Fourier Transform (Q5383996) (← links)
• Learning Sparse Polynomial Functions (Q5383997) (← links)
• Learning Entangled Single-Sample Gaussians (Q5383998) (← links)
• Exploiting Metric Structure for Efficient Private Query Release (Q5383999) (← links)
• On the compatibility of quartet trees (Q5384000) (← links)
• Packing <i>A</i>-paths in Group-Labelled Graphs via Linear Matroid Parity (Q5384002) (← links)
• Independent Set in <i>P</i>₅-Free Graphs in Polynomial Time (Q5384003) (← links)
• Large induced subgraphs via triangulations and CMSO (Q5384004) (← links)
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. (Q5384007) (← links)
• Approximating <i>k</i>-center in planar graphs (Q5384008) (← links)
• A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage (Q5384009) (← links)
• A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices (Q5384010) (← links)