论文列表及评分结果
Mim-Width II. The Feedback Vertex Set Problem.
电商所评分：5
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs.
电商所评分：2
Multi-budgeted Directed Cuts.
电商所评分：7
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments.
电商所评分：9
Weak Coverage of a Rectangular Barrier.
电商所评分：4
Local Algorithms for Sparse Spanning Graphs.
电商所评分：3
Making Bidirected Graphs Strongly Connected.
电商所评分：3
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor.
电商所评分：2
On the Convergence Time of a Natural Dynamics for Linear Programming.
电商所评分：4
A Unified Framework for Clustering Constrained Data Without Locality Property.
电商所评分：3
On the Relation of Strong Triadic Closure and Cluster Deletion.
电商所评分：3
Quadratic Vertex Kernel for Rainbow Matching.
电商所评分：7
On Bubble Generators in Directed Graphs.
电商所评分：2
Preface: Special Issue on WADS 2017.
电商所评分：10
Editor's Note: Special Issue on Parameterized and Exact Computation.
电商所评分：3
A Central Limit Theorem for Almost Local Additive Tree Functionals.
电商所评分：3
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata.
电商所评分：7
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon.
电商所评分：4
Online Clique Clustering.
电商所评分：8
Sorting Real Numbers in $O\big (n\sqrt{\log n}\big )$ Time and Linear Space.
电商所评分：10
Extended Learning Graphs for Triangle Finding.
电商所评分：3
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint.
电商所评分：6
Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster.
电商所评分：1
Deterministic Dynamic Matching in O(1) Update Time.
电商所评分：8
Asymptotic Analysis of Regular Sequences.
电商所评分：4
Preface to the Special Issue on Computing and Combinatorics.
电商所评分：6
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions.
电商所评分：7
QuickXsort: A Fast Sorting Scheme in Theory and Practice.
电商所评分：8
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy.
电商所评分：7
Fast Compressed Self-indexes with Deterministic Linear-Time Construction.
电商所评分：1