论文列表及评分结果
Computing the Largest Bond and the Maximum Connected Cut of a Graph.
电商所评分：6
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.
电商所评分：3
Popular Matchings in Complete Graphs.
电商所评分：6
Approximating the Canadian Traveller Problem with Online Randomization.
电商所评分：10
A Fast Algorithm for the Product Structure of Planar Graphs.
电商所评分：2
Obtaining a Proportional Allocation by Deleting Items.
电商所评分：9
On Structural Parameterizations of the Edge Disjoint Paths Problem.
电商所评分：9
Average-Case Approximation Ratio of Scheduling without Payments.
电商所评分：9
Optimal Matroid Partitioning Problems.
电商所评分：5
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization.
电商所评分：10
Range Majorities and Minorities in Arrays.
电商所评分：4
Dispersing Obnoxious Facilities on a Graph.
电商所评分：8
Improved Online Algorithms for Knapsack and GAP in the Random Order Model.
电商所评分：8
Computing the Rooted Triplet Distance Between Phylogenetic Networks.
电商所评分：6
Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.
电商所评分：6
Special Issue on Algorithms and Data Structures (WADS 2019).
电商所评分：10
Parameterized Counting of Partially Injective Homomorphisms.
电商所评分：4
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.
电商所评分：8
Active-Learning a Convex Body in Low Dimensions.
电商所评分：9
Metric Dimension Parameterized By Treewidth.
电商所评分：9
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem.
电商所评分：7
Independent Sets and Hitting Sets of Bicolored Rectangular Families.
电商所评分：9
Faster algorithms for counting subgraphs in sparse graphs.
电商所评分：1
Finding and Counting Permutations via CSPs.
电商所评分：10
Beating Treewidth for Average-Case Subgraph Isomorphism.
电商所评分：6
Sorting a Permutation by Best Short Swaps.
电商所评分：10
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set.
电商所评分：2
Correlation Clustering in Data Streams.
电商所评分：1
Cluster Deletion on Interval Graphs and Split Related Graphs.
电商所评分：5
A New Lower Bound for Classic Online Bin Packing.
电商所评分：3