yusuke1997/dblp-id-title huggingface dataset:
Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem
On the Integrality Gap of the Prize-Collecting Steiner Forest LP
Fourier Growth of Regular Branching Programs
Reconstructive Dispersers and Hitting Set Generators
Approximations of Independent Sets in Graphs
On Sketching the q to p Norms
Revisiting Alphabet Reduction in Dinur's PCP
Spectral Sparsification in Dynamic Graph Streams
On the Error Parameter of Dispersers
Fast Mixing via Polymers for Random Graphs with Unbounded Degree
Approximate Degree and the Complexity of Depth Three Circuits
On the Amortized Complexity of Approximate Counting
Testing Graph Blow-Up
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs
Satisfiability and Derandomization for Small Polynomial Threshold Circuits
Synergy Between Circuit Obfuscation and Circuit Minimization
Private Counting of Distinct Elements in the Turnstile Model and Extensions
Extracting Mergers and Projections of Partitions
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
Optimal Resource Augmentations for Online Knapsack
Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors
The Online Clique Avoidance Game on Random Graphs
On the Total Perimeter of Homothetic Convex Bodies in a Convex Container
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut
Submodular Dominance and Applications
On Low-Risk Heavy Hitters and Sparse Recovery Schemes
It's a Small World for Random Surfers
Local Convergence and Stability of Tight Bridge-Addable Graph Classes
The Quest for Strong Inapproximability Results with Perfect Completeness
Trace Reconstruction from Local Statistical Queries
The String of Diamonds Is Tight for Rumor Spreading
On Multilinear Forms: Bias, Correlation, and Tensor Rank
Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs
Searching for Falsified Clause in Random (log{n})-CNFs Is Hard for Randomized Communication
Stochastic Steiner Tree with Non-uniform Inflation
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
Small-Bias Spaces for Group Products
Approximating Maximum Subgraphs without Short Cycles
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent
Smoothed Analysis on Connected Graphs
Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
Space Complexity vs. Query Complexity
Bag-Of-Tasks Scheduling on Related Machines
Scheduling under uncertainty: Optimizing against a randomizing adversary
Maximum Coverage Problem with Group Budget Constraints and Applications
On Connectivity in Random Graph Models with Limited Dependencies
Limitations of Local Filters of Lipschitz and Monotone Functions
A Combination of Testability and Decodability by Tensor Products
New and Improved Bounds for the Minimum Set Cover Problem
Approximation Schemes for Covering and Scheduling on Related Machines
A Local Computation Approximation Scheme to Maximum Matching
Hyperbolic Concentration, Anti-Concentration, and Discrepancy
A Tight Lower Bound for High Frequency Moment Estimation with Small Error
An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem
Counting Hypergraph Matchings up to Uniqueness Threshold
Matrix Multiplication Verification Using Coding Theory
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract)
Increasing the Output Length of Zero-Error Dispersers
Multiple Traveling Salesmen in Asymmetric Metrics
Rectangle Tiling Binary Arrays
Network Design with Coverage Costs
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
Almost Optimal Distribution-Free Sample-Based Testing of k-Modality
On Constrained Hypergraph Coloring and Scheduling
Extractors and Lower Bounds for Locally Samplable Sources
Fooling Parity Tests with Parity Gates
A New Fully Polynomial Approximation Scheme for the Knapsack Problem
On Black-Box Meta Complexity and Function Inversion
Improved Composition Theorems for Functions and Relations
Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback
Testing the Independence Number of Hypergraphs
The t -Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints
On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs
A Lower Bound on List Size for List Decoding
The Steiner Tree Problem and Its Generalizations
On the hardness of approximating N P witnesses
Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Towards Simpler Sorting Networks and Monotone Circuits for Majority
Improving Integrality Gaps via Chvátal-Gomory Rounding
Optimal Rate List Decoding via Derivative Codes
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
Tighter Connections between Derandomization and Circuit Lower Bounds
Facility Location and the Geometric Minimum-Diameter Spanning Tree
Fine Grained Analysis of High Dimensional Random Walks
Testing Boolean Function Isomorphism
An Approximate Version of the Tree Packing Conjecture via Random Embeddings
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
Approximating Minimum-Cost Connected T-Joins
The Condensation Phase Transition in the Regular k-SAT Model
On the Power of Regular and Permutation Branching Programs
A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
Independent Sets in Random Graphs from the Weighted Second Moment Method
On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR
Improved Approximation Algorithms for the EPR Hamiltonian
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
Query Complexity in Errorless Hardness Amplification
Stable Approximation Algorithms for Dominating Set and Independent Set
Better Gap-Hamming Lower Bounds via Better Round Elimination
On Approximating Node-Disjoint Paths in Grids
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Efficient Interactive Proofs for Non-Deterministic Bounded Space
On Multiple Input Problems in Property Testing
The Minrank of Random Graphs
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits
Hardness of Vertex Deletion and Project Scheduling
Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices
Towards Resistance Sparsifiers
Triangles Improve 0.878 Approximation for Maxcut
Finding a Maximum Independent Set in a Sparse Random Graph
Internal Compression of Protocols to Entropy
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
Better and Simpler Learning-Augmented Online Caching
Interactive Coding with Unbounded Noise
Online Time-Windows TSP with Predictions
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
Zero Knowledge LTCs and Their Applications
Communication with Partial Noiseless Feedback
Tensor Rank is Hard to Approximate
Streaming Algorithms with One-Sided Estimation
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
Better Size Estimation for Sparse Matrix Products
The Complexity of Partial Function Extension for Coverage Functions
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem
Polar Codes with Exponentially Small Error at Finite Block Length
Parallel Repetition of k-Player Projection Games
Space Optimal Vertex Cover in Dynamic Streams
On Perturbation Resilience of Non-Uniform k-Center
Improved Streaming Algorithm for the Klee's Measure Problem and Generalizations
Inapproximability of NP-Complete Variants of Nash Equilibrium
Stable Matching with Evolving Preferences
Solving Linear Programs with Differential Privacy
An Explicit VC-Theorem for Low-Degree Polynomials
Sparse and Lopsided Set Disjointness via Information Theory
Online Flow Time Scheduling in the Presence of Preemption Overhead
Adaptive Lower Bound for Testing Monotonicity on the Line
On Nontrivial Approximation of CSPs
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems
Random Tensors and Planted Cliques
Pseudorandom Generators and Typically-Correct Derandomization
Bias Reduction for Sum Estimation
On the Query Complexity of Testing Orientations for Being Eulerian
Communication Complexity of Statistical Distance
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree
Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions
A Fast Binary Splitting Approach to Non-Adaptive Group Testing
On Axis-Parallel Tests for Tensor Product Codes
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs
Satisfying Degree-d Equations over GF[2] n
Absolutely Sound Testing of Lifted Codes
Flipping out with Many Flips: Hardness of Testing k-Monotonicity
Combinatorial Limitations of Average-Radius List Decoding
A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs
Approximate Pure Nash Equilibria in Weighted Congestion Games
Polylogarithmic Inapproximability of the Radio Broadcast Problem
Fast and Perfect Sampling of Subgraphs and Polymer Systems
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
Improved Approximation Bounds for the Minimum Constraint Removal Problem
Connectivity of Random High Dimensional Geometric Graphs
Unconstraining Graph-Constrained Group Testing
Distributional Online Weighted Paging with Limited Horizon
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
The Diameter of Randomly Perturbed Digraphs and Some Applications.
Extractors Using Hardness Amplification
Budgeted Allocations in the Full-Information Setting
Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
Algorithmic Contiguity from Low-Degree Conjecture and Applications in Correlated Random Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems
Vertex Isoperimetry and Independent Set Stability for Tensor Powers of Cliques
A Constant-Factor Approximation for Weighted Bond Cover
Approximate Degree, Secret Sharing, and Concentration Phenomena
Search and Classification of High Dimensional Data
Approximating Dense Max 2-CSPs
Inapproximability of Survivable Networks
Improved Diversity Maximization Algorithms for Matching and Pseudoforest
Packing Element-Disjoint Steiner Trees
Two Approximation Algorithms for 3-Cycle Covers
High Entropy Random Selection Protocols
Efficient Removal Lemmas for Matrices
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees
Approximation Algorithms and Lower Bounds for Graph Burning
Improved 3LIN Hardness via Linear Label Cover
Approximation Algorithms for Network Design and Facility Location with Service Capacities
Sharp Thresholds for the Overlap Gap Property: Ising p-Spin Glass and Random k-SAT
Successive Minimum Spanning Trees
Two Randomized Mechanisms for Combinatorial Auctions
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces
A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words
Encouraging Cooperation in Sharing Supermodular Costs
Hardness of Approximation for H-Free Edge Modification Problems
Approximation Algorithms and Hardness for Domination with Propagation
Improved NP-Inapproximability for 2-Variable Linear Equations
Testing Periodicity
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
Lower Bounds on Same-Set Inner Product in Correlated Spaces
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
Greedy approximation algorithms for finding dense components in a graph
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree
Perfect Sampling for Hard Spheres from Strong Spatial Mixing
The Complexity of Ferromagnetic Two-spin Systems with External Fields
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases
Algorithmic Aspects of Property Testing in the Dense Graphs Model
Improved approximations for tour and tree covers
Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
Randomly Coloring Graphs of Logarithmically Bounded Pathwidth
Generalized Assignment of Time-Sensitive Item Groups
On the Coin Weighing Problem with the Presence of Noise
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks
Bounds on the Norms of Uniform Low Degree Graph Matrices
Randomness-Efficient Sampling Within NC 1
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l 1 Embeddability of Negative Type Metrics
Testing Connectedness of Images
Stochastic and Robust Scheduling in the Cloud
On the Testability of Graph Partition Properties
Private Data Stream Analysis for Universal Symmetric Norm Estimation
Streaming Algorithms for Network Design
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025, Berkeley, CA, USA, August 11-13, 2025
Structured-Seed Local Pseudorandom Generators and Their Applications
Distributed Testing of Graph Isomorphism in the CONGEST Model
Hilbert Functions and Low-Degree Randomness Extractors
Improved Inapproximability Results for Maximum k-Colorable Subgraph
Maximizing job benefits on-line
When Are Welfare Guarantees Robust?
On the Value of Preemption in Scheduling
Sink-Free Orientations: A Local Sampler with Applications
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs
Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings
Quantum Property Testing in Sparse Directed Graphs
Average Case Polyhedral Complexity of the Maximum Stable Set Problem
Routing and Admission Control in Networks with Advance Reservations
The Structure of Winning Strategies in Parallel Repetition Games
The Euclidean Distortion of Flat Tori
Dense Fast Random Projections and Lean Walsh Transforms
Thresholds in Random Motif Graphs
Min-Cost Bipartite Perfect Matching with Delays
The Effect of Boundary Conditions on Mixing Rates of Markov Chains
An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits
Syntactic Separation of Subset Satisfiability Problems
Deletion Codes in the High-noise and High-rate Regimes
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
Soft Edge Coloring
Almost Optimal Testers for Concise Representations
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
Tight Lower Bounds for Testing Linear Isomorphism
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs
Sampling Bounds for Stochastic Optimization
Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums
Terminal Embeddings
Online Set Cover with Set Requests
Estimating the Distance to a Monotone Function
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Improved Approximation Algorithms for Metric Facility Location Problems
Bandwidth and Low Dimensional Embedding
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, Atlanta, Georgia, USA, September 11-13, 2023
New Tools for Graph Coloring
Small Sample Spaces Cannot Fool Low Degree Polynomials
Online Square-into-Square Packing
Maximum Gradient Embeddings and Monotone Clustering
On Approximating Target Set Selection
Truthful Mechanisms via Greedy Iterative Packing
Tarski Lower Bounds from Multi-Dimensional Herringbones
Connectivity of Random Annulus Graphs and the Geometric Block Model
Lifted Multiplicity Codes and the Disjoint Repair Group Property
Approximating Linear Threshold Predicates
Matching-Vector Families and LDCs over Large Modulo
Maximizing Throughput in Flow Shop Real-Time Scheduling
Expanderizing Higher Order Random Walks
Public Key Locally Decodable Codes with Short Keys
Zero-One Laws for Sliding Windows and Universal Sketches
Tensor Products of Weakly Smooth Codes Are Robust
List-Decoding Homomorphism Codes with Arbitrary Codomains
Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes
Fooling Near-Maximal Decision Trees
An Analysis of Random-Walk Cuckoo Hashing
Approximation Algorithms for Directed Weighted Spanners
The Maximum Exposure Problem
Certifying Equality With Limited Interaction
Constrained Monotone Function Maximization and the Supermodular Degree
Testing Lipschitz Functions on Hypergrid Domains
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs
LP-Relaxations for Tree Augmentation
Stochastic Unsplittable Flows
Deterministic 7/8-Approximation for the Metric Maximum TSP
On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs
Rumor Spreading on Random Regular Graphs and Expanders
Simultaneous Source Location
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows
Hierarchy Theorems for Property Testing
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Exchangeability and Realizability: De Finetti Theorems on Graphs
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
A Unified Approach to Discrepancy Minimization
Finding the KT Partition of a Weighted Graph in Near-Linear Time
What Is the Minimum Number of Random Bits Required for Computability and Efficiency in Anonymous Networks?
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Additive Approximation for Near-Perfect Phylogeny Construction
Corruption and Recovery-Efficient Locally Decodable Codes
Better Approximations for the Minimum Common Integer Partition Problem
Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness
Scheduling with Outliers
Periodicity and Cyclic Shifts via Linear Sketches
On the List Recoverability of Randomly Punctured Codes
Consistency of Local Density Matrices Is QMA-Complete
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs
Estimating Parameters Associated with Monotone Properties
Robust Locally Testable Codes and Products of Codes
Round and Bipartize for Vertex Cover Approximation
Finding Small Sparse Cuts by Random Walk
The Online Stochastic Generalized Assignment Problem
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs
Sampling Hypersurfaces through Diffusion
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
An Extension of Plücker Relations with Applications to Subdeterminant Maximization
Directed Poincaré Inequalities and L¹ Monotonicity Testing of Lipschitz Functions
Real-Time Message Routing and Scheduling
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints
Lowest Degree k-Spanner: Approximation and Hardness
On Some Computations on Sparse Polynomials
More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More
Everywhere-Tight Information Cost Tradeoffs for Augmented Index
Min-Power Strong Connectivity
Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem
Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube
iBGP and Constrained Connectivity
Improved Explicit Hitting-Sets for ROABPs
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
An O (log n ) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
Pseudorandomness for Regular Branching Programs via Fourier Analysis
Public Coin Interactive Proofs for Label-Invariant Distribution Properties
Minimizing Maximum Flow-time on Related Machines
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
Improved Lower Bounds for the Universal and a priori TSP
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions
Streaming Coreset Constructions for M-Estimators
Approximation Algorithms for the Unsplittable Flow Problem
A Tight (3/2+ε) Approximation for Skewed Strip Packing
The Sketching Complexity of Pattern Matching
The GaussianSketch for Almost Relative Error Kernel Distance
Pinning down the Strong Wilber 1 Bound for Binary Search Trees
Approximating Minimum Linear Ordering Problems
Lower Bounds for 2-Query LCCs over Large Alphabet
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions
Pseudorandom Bit Generators That Fool Modular Sums
Approximation Algorithms for Demand Strip Packing
Belief Propagation on Replica Symmetric Random Factor Graph Models
Santa Claus Meets Hypergraph Matchings
Capacitated Network Design on Undirected Graphs
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
Min-Sum Clustering (With Outliers)
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number
On Approximating Degree-Bounded Network Design Problems
Two-Source Extractors Secure against Quantum Adversaries
Streaming Complexity of SVMs
Approximating Large Frequency Moments with Pick-and-Drop Sampling
Sublinear Algorithms for Approximating String Compressibility
Designing Networks with Existing Traffic to Support Fast Restoration
Dynamic Pricing of Servers on Trees
Local Decoding and Testing for Homomorphisms