论文列表及评分结果
Greed is Good for Deterministic Scale-Free Networks.
电商所评分：4
Parameterized Complexity of Independent Set in H-Free Graphs.
电商所评分：5
A Tight Runtime Analysis for the (μ + λ ) EA.
电商所评分：2
Efficient Online String Matching Based on Characters Distance Text Sampling.
电商所评分：2
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization.
电商所评分：6
Fault Tolerant Approximate BFS Structures with Additive Stretch.
电商所评分：1
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs.
电商所评分：9
The Power of Linear-Time Data Reduction for Maximum Matching.
电商所评分：2
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
电商所评分：1
Enumerating k-Arc-Connected Orientations.
电商所评分：10
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
电商所评分：5
Special Issue on Computing and Combinatorics.
电商所评分：5
On Scheduling Coflows.
电商所评分：9
An Adversarial Model for Scheduling with Testing.
电商所评分：1
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms.
电商所评分：6
Dynamic and Internal Longest Common Substring.
电商所评分：8
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
电商所评分：1
Parameterized Dynamic Cluster Editing.
电商所评分：2
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy.
电商所评分：5
Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation.
电商所评分：7
Iterative Partial Rounding for Vertex Cover with Hard Capacities.
电商所评分：1
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions.
电商所评分：3
Flip Distances Between Graph Orientations.
电商所评分：1
Building a Nest by an Automaton.
电商所评分：5
Learning Privately with Labeled and Unlabeled Examples.
电商所评分：3
List 3-Coloring Graphs with No Induced P6+rP3.
电商所评分：9
Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.
电商所评分：6
Distance and Routing Labeling Schemes for Cube-Free Median Graphs.
电商所评分：4
Guess Free Maximization of Submodular and Linear Sums.
电商所评分：1
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
电商所评分：3