论文列表及评分结果
Turbocharging Treewidth Heuristics.
电商所评分：2
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts.
电商所评分：5
Binary Search in Graphs Revisited.
电商所评分：10
The ( $$1+\lambda $$ 1 + λ ) Evolutionary Algorithm with Self-Adjusting Mutation Rate.
电商所评分：5
Study of a Combinatorial Game in Graphs Through Linear Programming.
电商所评分：4
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs.
电商所评分：3
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals.
电商所评分：4
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities.
电商所评分：10
Level-Based Analysis of the Univariate Marginal Distribution Algorithm.
电商所评分：7
Editor's Note.
电商所评分：7
Correction to: Counting Minimum Weight Arborescences.
电商所评分：1
Characterizing and Recognizing 4-Map Graphs.
电商所评分：4
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph.
电商所评分：7
New Tools and Connections for Exponential-Time Approximation.
电商所评分：1
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants.
电商所评分：5
The k-Server Problem with Advice in d Dimensions and on the Sphere.
电商所评分：10
Backdoors for Linear Temporal Logic.
电商所评分：3
Edge-Orders.
电商所评分：8
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds.
电商所评分：9
Building an Optimal Point-Location Structure in O( sort (n)) I/Os.
电商所评分：9
Online Dominating Set.
电商所评分：1
Dynamic Graph Stream Algorithms in o(n) Space.
电商所评分：4
Streaming Pattern Matching with d Wildcards.
电商所评分：10
When Can Graph Hyperbolicity be Computed in Linear Time?
电商所评分：4
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
电商所评分：3
Succinct Summing over Sliding Windows.
电商所评分：9
Computing Dense Tensor Decompositions with Optimal Dimension Trees.
电商所评分：8
Mind the Gap! - Online Dictionary Matching with One Gap.
电商所评分：3
Approximate Span Programs.
电商所评分：10
A Simple Greedy Algorithm for Dynamic Graph Orientation.
电商所评分：9