论文列表及评分结果
Tight Bounds for Online Coloring of Basic Graph Classes.
电商所评分：2
Polynomial Treedepth Bounds in Linear Colorings.
电商所评分：1
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata.
电商所评分：8
Fault-Tolerant Covering Problems in Metric Spaces.
电商所评分：6
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games.
电商所评分：7
Covert Computation in Self-Assembled Circuits.
电商所评分：5
On the Tree Augmentation Problem.
电商所评分：5
Constrained Minimum Passage Time in Random Geometric Graphs.
电商所评分：1
On the Complexity of Colouring Antiprismatic Graphs.
电商所评分：6
Non-Greedy Online Steiner Trees on Outerplanar Graphs.
电商所评分：8
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth.
电商所评分：10
High Entropy Random Selection Protocols.
电商所评分：5
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location.
电商所评分：5
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
电商所评分：9
Simultaneous Feedback Edge Set: A Parameterized Perspective.
电商所评分：1
The Inverse Voronoi Problem in Graphs II: Trees.
电商所评分：6
Multiplicative Up-Drift.
电商所评分：6
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs.
电商所评分：2
Towards a Polynomial Kernel for Directed Feedback Vertex Set.
电商所评分：3
The Complex Parameter Landscape of the Compact Genetic Algorithm.
电商所评分：7
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint.
电商所评分：8
The Runtime of the Compact Genetic Algorithm on Jump Functions.
电商所评分：6
Budget Feasible Mechanisms on Matroids.
电商所评分：5
Matching Cut in Graphs with Large Minimum Degree.
电商所评分：8
The Price of Defense.
电商所评分：4
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.
电商所评分：4
Travelling on Graphs with Small Highway Dimension.
电商所评分：8
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint.
电商所评分：9
Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities.
电商所评分：1
Packing Arc-Disjoint Cycles in Tournaments.
电商所评分：6