论文列表及评分结果
Foreword: Special Issue on Parameterized and Exact Computation.
电商所评分：6
Hierarchical Partial Planarity.
电商所评分：10
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm.
电商所评分：3
On the Complexity Landscape of Connected f-Factor Problems.
电商所评分：5
Longest Common Substring with Approximately k Mismatches.
电商所评分：6
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner.
电商所评分：2
Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case.
电商所评分：4
Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles).
电商所评分：5
A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length.
电商所评分：10
Two Problems in Max-Size Popular Matchings.
电商所评分：4
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.
电商所评分：10
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.
电商所评分：9
Full Characterization of a Class of Graphs Tailored for Software Watermarking.
电商所评分：5
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms.
电商所评分：5
Can We Recover the Cover?
电商所评分：1
Correction to: Longest Common Substring with Approximately k Mismatches.
电商所评分：10
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds.
电商所评分：6
A Faster Algorithm for Truth Discovery via Range Cover.
电商所评分：10
Rectangle Transformation Problem.
电商所评分：3
Subquadratic Algorithms for Succinct Stable Matching.
电商所评分：4
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line.
电商所评分：9
A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines.
电商所评分：1
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms.
电商所评分：1
Optimality Program in Segment and String Graphs.
电商所评分：9
Stable Secretaries.
电商所评分：3
Faster Approximate Diameter and Distance Oracles in Planar Graphs.
电商所评分：9
Dynamic Space Efficient Hashing.
电商所评分：3
Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly.
电商所评分：7
An Algorithm to Compute the Nucleolus of Shortest Path Games.
电商所评分：6
Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation.
电商所评分：9