论文列表及评分结果

A General Bin Packing Game: Interest Taken into Account.

电商所评分:4

点击查看评分详情!

Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs.

电商所评分:10

点击查看评分详情!

A Note on Submodular Function Minimization with Covering Type Linear Constraints.

电商所评分:5

点击查看评分详情!

Approximation Algorithms for the Max-Buying Problem with Limited Supply.

电商所评分:6

点击查看评分详情!

Compact Representation of Graphs of Small Clique-Width.

电商所评分:5

点击查看评分详情!

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.

电商所评分:4

点击查看评分详情!

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks.

电商所评分:6

点击查看评分详情!

Special Issue: Algorithmic Tools in Cryptography.

电商所评分:7

点击查看评分详情!

How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism.

电商所评分:5

点击查看评分详情!

Bounded-Hop Communication Networks.

电商所评分:7

点击查看评分详情!

Metastability of Logit Dynamics for Coordination Games.

电商所评分:6

点击查看评分详情!

Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions.

电商所评分:10

点击查看评分详情!

Algorithms for Communication Scheduling in Data Gathering Network with Data Compression.

电商所评分:2

点击查看评分详情!

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework.

电商所评分:8

点击查看评分详情!

Spanning Trees in Multipartite Geometric Graphs.

电商所评分:4

点击查看评分详情!

Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges.

电商所评分:7

点击查看评分详情!

The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization.

电商所评分:2

点击查看评分详情!

Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat?

电商所评分:9

点击查看评分详情!

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.

电商所评分:9

点击查看评分详情!

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation.

电商所评分:6

点击查看评分详情!

Guest Editorial: Special Issue on Compact Data Structures.

电商所评分:5

点击查看评分详情!

Stable Matching Games: Manipulation via Subgraph Isomorphism.

电商所评分:3

点击查看评分详情!

Improved Bounds in Stochastic Matching and Optimization.

电商所评分:2

点击查看评分详情!

Finding Pairwise Intersections Inside a Query Range.

电商所评分:1

点击查看评分详情!

Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs.

电商所评分:7

点击查看评分详情!

Batch Coloring of Graphs.

电商所评分:3

点击查看评分详情!

Complexity of Token Swapping and Its Variants.

电商所评分:2

点击查看评分详情!

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts.

电商所评分:9

点击查看评分详情!

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.

电商所评分:10

点击查看评分详情!

Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm.

电商所评分:4

点击查看评分详情!