论文列表及评分结果
Approximately Coloring Graphs Without Long Induced Paths.
电商所评分：6
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.
电商所评分：3
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms.
电商所评分：7
A Tight Lower Bound for Planar Steiner Orientation.
电商所评分：6
An EPTAS for Scheduling on Unrelated Machines of Few Different Types.
电商所评分：8
Flexible Resource Allocation to Interval Jobs.
电商所评分：1
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems.
电商所评分：9
Size Versus Truthfulness in the House Allocation Problem.
电商所评分：4
NodeTrix Planarity Testing with Small Clusters.
电商所评分：1
Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns.
电商所评分：2
The Complexity of Optimization on Grids.
电商所评分：7
Two Approaches to Building Time-Windowed Geometric Data Structures.
电商所评分：9
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities.
电商所评分：2
Subset Feedback Vertex Set in Chordal and Split Graphs.
电商所评分：4
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
电商所评分：4
Deleting Vertices to Graphs of Bounded Genus.
电商所评分：5
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models.
电商所评分：3
An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees.
电商所评分：1
A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs.
电商所评分：5
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State.
电商所评分：2
Non-clairvoyantly Scheduling to Minimize Convex Functions.
电商所评分：5
Improving and Extending the Testing of Distributions for Shape-Restricted Properties.
电商所评分：8
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.
电商所评分：5
Parameterized Complexity of Geometric Covering Problems Having Conflicts.
电商所评分：8
Connected Vertex Cover for (sP1+P5)-Free Graphs.
电商所评分：7
A Polynomial Sized Kernel for Tracking Paths Problem.
电商所评分：8
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts.
电商所评分：1
Extensions of Self-Improving Sorters.
电商所评分：1
Succinct Non-overlapping Indexing.
电商所评分：8
A Fixed-Parameter Perspective on #BIS.
电商所评分：10