论文列表及评分结果
Approximate Minimum Selection with Unreliable Comparisons.
电商所评分：2
Maximum Box Problem on Stochastic Points.
电商所评分：4
Computing The Maximum Exponent in a Stream.
电商所评分：3
Level-Planar Drawings with Few Slopes.
电商所评分：1
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.
电商所评分：6
Approximating Dynamic Weighted Vertex Cover with Soft Capacities.
电商所评分：5
On Perturbation Resilience of Non-uniform k-Center.
电商所评分：6
Tight Bounds for Online Weighted Tree Augmentation.
电商所评分：6
Bounded-Angle Minimum Spanning Trees.
电商所评分：3
Structural Parameterizations of Clique Coloring.
电商所评分：5
A Polynomial Kernel for Diamond-Free Editing.
电商所评分：6
Bounding the Inefficiency of Compromise in Opinion Formation.
电商所评分：2
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness.
电商所评分：4
Approximation Schemes for the Generalized Extensible Bin Packing Problem.
电商所评分：2
On the Parameterized Complexity of Maximum Degree Contraction Problem.
电商所评分：10
Enumeration of Maximal Common Subsequences Between Two Strings.
电商所评分：2
Additive Approximation of Generalized Turán Questions.
电商所评分：2
Fast Exact Algorithms Using Hadamard Product of Polynomials.
电商所评分：1
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW).
电商所评分：9
Mechanisms for (Mis)allocating Scientific Credit.
电商所评分：9
On Proper Labellings of Graphs with Minimum Label Sum.
电商所评分：1
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs.
电商所评分：8
Dynamic Averaging Load Balancing on Cycles.
电商所评分：5
Matching Regular Expressions on uncertain data.
电商所评分：2
Fast and Longest Rollercoasters.
电商所评分：2
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.
电商所评分：3
Posimodular Function Optimization.
电商所评分：9
Contraction Bidimensionality of Geometric Intersection Graphs.
电商所评分：7
Parameter Analysis for Guarding Terrains.
电商所评分：7
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees.
电商所评分：3