论文列表及评分结果
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem.
电商所评分：7
Parameterized Complexity of Length-bounded Cuts and Multicuts.
电商所评分：2
The Sandwich Problem for Decompositions and Almost Monotone Properties.
电商所评分：9
Canonical Representations for Circular-Arc Graphs Using Flip Sets.
电商所评分：10
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins.
电商所评分：2
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications.
电商所评分：10
Dynamic Path Queries in Linear Space.
电商所评分：5
Path Refinement in Weighted Regions.
电商所评分：3
Quasimetric Embeddings and Their Applications.
电商所评分：8
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin.
电商所评分：1
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints.
电商所评分：2
$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel.
电商所评分：5
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization.
电商所评分：8
Towards Flexible Demands in Online Leasing Problems.
电商所评分：4
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches.
电商所评分：5
Editorial: Special Issue on Computing and Combinatorics.
电商所评分：3
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems.
电商所评分：9
Cutwidth: Obstructions and Algorithmic Aspects.
电商所评分：5
Fast Approximation Algorithms for p-Centers in Large $$\delta $$ δ -Hyperbolic Graphs.
电商所评分：9
Counting Minimum Weight Arborescences.
电商所评分：8
Lift-and-Project Methods for Set Cover and Knapsack.
电商所评分：1
New Online Algorithms for Story Scheduling in Web Advertising.
电商所评分：3
Sorting by Swaps with Noisy Comparisons.
电商所评分：2
Guest Editorial: Special Issue on Combinatorial Optimization and Applications.
电商所评分：9
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
电商所评分：9
On Almost Monge All Scores Matrices.
电商所评分：7
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation.
电商所评分：8
The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases.
电商所评分：7
Network Pollution Games.
电商所评分：2
A Simple Projection Algorithm for Linear Programming Problems.
电商所评分：10