yusuke1997/dblp-id-title huggingface dataset:
Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes
Complexity and Approximation of the Continuous Network Design Problem
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
Peak Demand Minimization via Sliced Strip Packing
Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs
Pseudo-Derandomizing Learning and Approximation
Tight Bounds for Hashing Block Sources
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems
Pseudorandom Generators for Read-Once Monotone Branching Programs
Better Binary List-Decodable Codes Via Multilevel Concatenation
An Improved Analysis of Mergers
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers
How to Schedule When You Have to Buy Your Energy
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
Greedy Minimization of Weakly Supermodular Set Functions
On the Complexity of Constrained Determinantal Point Processes
Testing Odd Direct Sums Using High Dimensional Expanders
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
On the Approximation Resistance of a Random Predicate
Universal Factor Graphs for Every NP-Hard Boolean CSP
Robust Appointment Scheduling
One for the Price of Two: A Unified Approach for Approximating Covering Problems
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem
QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More
Online Energy Storage Management: an Algorithmic Approach
Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces
Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors
Approximation Algorithms for Intersection Graphs
Fast Simulation of Large-Scale Growth Models
Maximum dispersion and geometric maximum weight cliques
A Polynomial-Time Approximation Algorithm for Complete Interval Minors
On Finding Randomly Planted Cliques in Arbitrary Graphs
Fine-Grained Completeness for Optimization in P
Sublinear Space Graph Algorithms in the Continual Release Model
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas
An approximation algorithm for MAX DICUT with given sizes of parts
On the inapproximability of broadcasting time
Improved FPTAS for Multi-spin Systems
Low Rate Is Insufficient for Local Testability
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels
The Query Complexity of Mastermind with l p Distances
Optimal Competitive Ratio for Optimization Problems with Congestion Effects
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy
Pseudorandomness of Expander Walks via Fourier Analysis on Groups
Social Welfare in One-Sided Matching Markets without Money
Superpolynomial Lower Bounds for Learning Monotone Classes
A Chasm Between Identity and Equivalence Testing with Conditional Queries
The Checkpoint Problem
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
On Capacitated Set Cover Problems
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines
Hardness of Embedding Metric Spaces of Equal Size
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings
A Lower Bound for Distribution-Free Monotonicity Testing
Sketching Distances in Monotone Graph Classes
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees
Resource Minimization Job Scheduling
Efficient Approximation of Convex Recolorings
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Randomness-Efficient Curve Samplers
Nearly Optimal Embeddings of Flat Tori
Succinct Representation of Codes with Applications to Testing
Multiplicative Approximations of Random Walk Transition Probabilities
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster Dynamics
On the Power of Priority Algorithms for Facility Location and Set Cover
Fully Dynamic Bin Packing Revisited
Extractors for Turing-Machine Sources
On the Beck-Fiala Conjecture for Random Set Systems
Finding Heavy Hitters from Lossy or Noisy Data
Hardness of Preemptive Finite Capacity Dial-a-Ride
Robust Correlation Clustering
Approximating Node-Connectivity Augmentation Problems
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
Oblivious Algorithms for the Max-kAND Problem
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
On Minrank and Forbidden Subgraphs
Robust Randomness Amplifiers: Upper and Lower Bounds
Affine Extractors and AC0-Parity
Derandomization of Euclidean Random Walks
Improved Bounds for Randomly Colouring Simple Hypergraphs
Wavelength rerouting in optical networks, or the Venetian routing problem
Planarizing an Unknown Surface
A New Point of NP-Hardness for 2-to-1 Label Cover
Maximum Matching in Semi-streaming with Few Passes
Tight Bounds for Graph Problems in Insertion Streams
Adaptive Sampling for k-Means Clustering
Robust Local Testability of Tensor Products of LDPC Codes
A Generating Function Method for the Average-Case Analysis of DPLL
Min-Max Multiway Cut
Low-Rank Binary Matrix Approximation in Column-Sum Norm
Reconstruction Threshold for the Hardcore Model
Dimension Expanders via Rank Condensers
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions
Bicriteria Approximation Algorithms for Priority Matroid Median
Inflatable Graph Properties and Natural Property Tests
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
Support Testing in the Huge Object Model
Relational Approximations for Subspace Primitives
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings
Near-Optimal UGC-hardness of Approximating Max k-CSP_R
On Bounded Distance Decoding for General Lattices
On the Optimality of Gluing over Scales
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Approximating node connectivity problems via set covers
Range Avoidance for Constant Depth Circuits: Hardness and Algorithms
A Randomized Solver for Linear Systems with Exponential Convergence
Communication Complexity of Collision
General Knapsack Problems in a Dynamic Setting
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
Online Makespan Minimization: The Power of Restart
Sunflowers and Quasi-Sunflowers from Randomness Extractors
Pairwise Independent Random Walks Can Be Slightly Unbounded
Monotonicity Testing and Shortest-Path Routing on the Cube
Permutation Strikes Back: The Power of Recourse in Online Metric Matching
Bounded Independence vs. Moduli
The Swendsen-Wang Dynamics on Trees
Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics
Parallelising Glauber Dynamics
Online Coloring of Short Intervals
Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
Hybrid k-Clustering: Blending k-Median and k-Center
On Optimization and Counting of Non-Broken Bases of Matroids
Beating a Random Assignment
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs
Scheduling Resources for Throughput Maximization
Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Time Lower Bounds for the Metropolis Process and Simulated Annealing
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows
On Sums of INW Pseudorandom Generators
A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings
Fast and Deterministic Approximations for k-Cut
Opaque Sets
Approximation Algorithms for Requirement Cut on Graphs
Efficient Probabilistically Checkable Debates
Properly 2-Colouring Linear Hypergraphs
On the Cost of Essentially Fair Clusterings
String Matching: Communication, Circuits, and Learning
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs
Network-Design with Degree Constraints
Guruswami-Sinop Rounding without Higher Level Lasserre
Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Testing Intersectingness of Uniform Families
Improved FPT Approximation for Sum of Radii Clustering with Mergeable Constraints
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere
Degrees and Network Design: New Problems and Approximations
Dobrushin Conditions and Systematic Scan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, Berkeley, CA, USA, August 16-18, 2017
The Complexity of Approximately Counting Stable Matchings
Distance Approximation in Bounded-Degree and General Sparse Graphs
Packing and Covering delta -Hyperbolic Spaces by Balls
Improved Randomness Extraction from Two Independent Sources
A Discrepancy Lower Bound for Information Complexity
On the Expansion of Group-Based Lifts
Tolerant Linearity Testing and Locally Testable Codes
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs
High Dimensional Expansion Implies Amplified Local Testability
Submodular Norms with Applications To Online Facility Location and Stochastic Probing
On Polynomial Approximations to AC^0
Improved Approximation Algorithms for Multilevel Facility Location Problems
Bicriteria Spanning Tree Problems
Lower Bounds for XOR of Forrelations
Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case
Charting the Replica Symmetric Phase
New Statistical and Computational Results for Learning Junta Distributions
Lower Bounds for CSP Refutation by SDP Hierarchies
Pseudorandomness for Linear Length Branching Programs and Stack Machines
Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks
A Lower Bound for Sampling Disjoint Sets
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
Locally Testable vs. Locally Decodable Codes
Two Structural Results for Low Degree Polynomials and Applications
Approximating Maximum Independent Set in k -Clique-Free Graphs
Random Low Degree Polynomials are Hard to Approximate
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l 1
Absorption Time of the Moran Process
Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem
Approximating Submodular k-Partition via Principal Partition Sequence
Improved Strong Spatial Mixing for Colorings on Trees
Submodular Secretary Problem and Extensions
Approximating Requirement Cut via a Configuration LP
From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations
Double Balanced Sets in High Dimensional Expanders
Communication Complexity of Set-Disjointness for All Probabilities
Testing Outerplanarity of Bounded Degree Graphs
Non-Adaptive Evaluation of k-of- n Functions: Tight Gap and a Unit-Cost PTAS
Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree
Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio
Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates
Oblivious Rounding and the Integrality Gap
Local Computation Algorithms for Knapsack: Impossibility Results, and How to Avoid Them
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2
Improved Online Load Balancing with Known Makespan
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Computationally-Feasible Truthful Auctions for Convex Bundles
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
Non-Uniform Robust Network Design in Planar Graphs
Budget and Profit Approximations for Spanning Tree Interdiction
Two-Sided Error Proximity Oblivious Testing - (Extended Abstract)
A Sequential Algorithm for Generating Random Graphs
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion
Direct Sum Testing: The General Case
On Testing Computability by Small Width OBDDs
On Guillotine Separability of Squares and Rectangles
Permanental Rank vs Determinantal Rank of Random Matrices over Finite Fields
Convergence Issues in Competitive Games
Approximating Directed Weighted-Degree Constrained Networks
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
Multipass Linear Sketches for Geometric LP-Type Problems
Near-Linear Time Samplers for Matroid Independent Sets with Applications
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture
The Number of Random 2-SAT Solutions Is Asymptotically Log-Normal
On the Spectral Expansion of Monotone Subsets of the Hypercube
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs
Exploring and Triangulating a Region by a Swarm of Robots
Chernoff Bound for High-Dimensional Expanders
Approximation Algorithms for Graph Homomorphism Problems
Learning-Augmented Maximum Independent Set
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold
Sharper Bounds for Regularized Data Fitting
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
Clustering in Interfering Binary Mixtures
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes
Discrepancy Without Partial Colorings
Directed Buy-At-Bulk Spanners
Approximation Algorithms for Generalized and Variable-Sized Bin Covering
Locality via Partially Lifted Codes
The Container Selection Problem
On Sketching Approximations for Symmetric Boolean CSPs
A 2-Source Almost-Extractor for Linear Entropy
Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries
Approximate F 2 -Sketching of Valuation Functions
Improved Algorithms for Data Migration
Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains
On Complexity of 1-Center in Various Metrics
On Nonadaptive Security Reductions of Hitting Set Generators
Black-Box Reductions in Mechanism Design
Online k-Median with Consistent Clusters
Hardness of Approximation of (Multi-)LCS over Small Alphabet
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
NP-Hardness of Almost Coloring Almost 3-Colorable Graphs
The Power of Super-logarithmic Number of Players
Improved Approximation Algorithms for the Partial Vertex Cover Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, Princeton, NJ, USA, August 24-26, 2015
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours
Computing Bi-Lipschitz Outlier Embeddings into the Line
An Approximation Scheme for Terrain Guarding
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions
Optimal Random Matchings on Trees and Applications
Efficient Polynomial Identity Testing over Nonassociative Algebras
Power of Preemption on Uniform Parallel Machines
Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration
Where's the Winner? Max-Finding and Sorting with Metric Costs
The Power of Choice in a Generalized Pólya Urn Model
Derandomized Squaring of Graphs
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
Optimal Hitting Sets for Combinatorial Shapes
Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence
Low-Degree Testing over Grids
Approximating k -outconnected Subgraph Problems
Interdiction Problems on Planar Graphs
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces
Approximating Min-sum Set Cover
On the Crossing Spanning Tree Problem
Interactive Error Correcting Codes: New Constructions and Impossibility Bounds
Tight Bounds for Testing k-Linearity
Fast Private Data Release Algorithms for Sparse Queries
Maximum And- vs. Even-SAT
High Order Random Walks: Beyond Spectral Gap
Dynamics for the Mean-field Random-cluster Model
Approximate Nearest Neighbor Search in Metrics of Planar Graphs
Approximation Algorithms for Minimum-Load k-Facility Location
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
Online Algorithms to Minimize Resource Reallocations and Network Communication
On Pseudorandom Generators with Linear Stretch in NC 0
Avoiding Range via Turan-Type Bounds
Scalable Auction Algorithms for Bipartite Maximum Matching Problems
Approximating the Distortion
Simplifying Armoni's PRG
Proximity Oblivious Testing and the Role of Invariances
On Minimizing Generalized Makespan on Unrelated Machines
On Testing and Robust Characterizations of Convexity
Approximating Some Network Design Problems with Node Costs
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time
Testing Computability by Width Two OBDDs
On the Hardness of Average-Case k-SUM
On the Complexity of the Asymmetric VPN Problem
Revenue Maximization in Transportation Networks
Differential Privacy and the Fat-Shattering Dimension of Linear Queries
Streaming Algorithms with Large Approximation Factors
Lower Bounds for Swapping Arthur and Merlin
Learning Random Monotone DNF
Inapproximability of H-Transversal/Packing
Subset Sum in Time 2 n/2 / poly(n)
The Telephone k-Multicast Problem
Improved Hitting Set for Orbit of ROABPs
Computing Opaque Interior Barriers à la Shermer
Approximating Buy-at-Bulk and Shallow-Light k -Steiner Trees
Sketching Approximability of (Weak) Monarchy Predicates
When Can an Expander Code Correct Ω(n) Errors in O(n) Time?
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
A Hypergraph Dictatorship Test with Perfect Completeness
How Long Can Optimal Locally Repairable Codes Be?
Analysis of k-Means++ for Separable Data
Approximating Single Machine Scheduling with Scenarios
The Complexity of Distinguishing Markov Random Fields
Improved Bounds for Coloring Locally Sparse Hypergraphs
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
Testing Membership in Counter Automaton Languages
Parallel Repetition for the GHZ Game: A Simpler Proof
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision
Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier
Tight Bounds on the Threshold for Permuted k-Colorability
A Lottery Model for Center-Type Problems with Outliers
Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region
Dual Charging for Half-Integral TSP
On the Average Sensitivity and Density of k-CNF Formulas
A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
Tolerant Locally Testable Codes
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors
Extractor Lower Bounds, Revisited
Testing Tensor Products of Algebraic Codes
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment
The Niceness of Unique Sink Orientations
Bit-Fixing Extractors for Almost-Logarithmic Entropy
Better Pseudodistributions and Derandomization for Space-Bounded Computation
Improved Bounds in Stochastic Matching and Optimization
On Minrank and the Lovász Theta Function
The Computational Complexity of Estimating MCMC Convergence Time
A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs
On List Recovery of High-Rate Tensor Codes
The Directed Minimum Latency Problem
Improved Bounds for Graph Distances in Scale Free Percolation and Related Models
Improved Algorithms for Time Decay Streams
Scheduling on a Stochastic Number of Machines
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
Approximation Algorithms for Partially Colorable Graphs
Minimum Restricted Diameter Spanning Trees
Improved Extractors for Recognizable and Algebraic Sources
Online Minimum Cost Matching with Recourse on the Line
Approximating CSPs with Outliers
Greedy Heuristics and Linear Relaxations for the Random Hitting Set Problem
The Complexity of Local List Decoding
Approximating Incremental Combinatorial Optimization Problems
Planar Matching in Streams Revisited
Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Variable length sequencing with two lengths
Sparsest Cut and Eigenvalue Multiplicities on Low Degree Abelian Cayley Graphs
Near-Optimal List-Recovery of Linear Code Families
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings
On Linear Programming Relaxations for Unsplittable Flow in Trees
Eigenvalue Bounds for Symmetric Markov Chains on Multislices with Applications
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques
Improved Circular k-Mismatch Sketches
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing
Approximating Two-Stage Stochastic Supplier Problems
Maximal Empty Boxes Amidst Random Points
A Randomized Rounding Approach for DAG Edge Deletion
Edge Coloring with Delays
Covering Simple Orthogonal Polygons with Rectangles
The Network as a Storage Device: Dynamic Routing with Bounded Buffers
Learning Lines with Ordinal Constraints
The Densest k-Subhypergraph Problem
Approximating the Bandwidth of Caterpillars
Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources
Candidate Tree Codes via Pascal Determinant Cubes
A Constant Factor Approximation for Capacitated Min-Max Tree Cover
Tracking the l 2 Norm with Constant Update Time
Approximating Bounded Occurrence Ordering CSPs