论文列表及评分结果

New Algorithm for Ordered Tree-to-Tree Correction Problem.

电商所评分:3

点击查看评分详情!

Deterministic Dictionaries.

电商所评分:4

点击查看评分详情!

The Complexity of Gene Placement.

电商所评分:1

点击查看评分详情!

Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs.

电商所评分:4

点击查看评分详情!

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.

电商所评分:5

点击查看评分详情!

Algorithms for Leader Election by Cellular Automata.

电商所评分:4

点击查看评分详情!

An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.

电商所评分:1

点击查看评分详情!

Computing Chow Forms and Some Applications.

电商所评分:6

点击查看评分详情!

Approximation Algorithms for Independent Sets in Map Graphs.

电商所评分:4

点击查看评分详情!

The k-Client Problem.

电商所评分:3

点击查看评分详情!

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning.

电商所评分:3

点击查看评分详情!

An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.

电商所评分:3

点击查看评分详情!

Efficient and Practical Algorithms for Sequential Modular Decomposition.

电商所评分:8

点击查看评分详情!

Vertex Cover: Further Observations and Further Improvements.

电商所评分:9

点击查看评分详情!

z-Approximations.

电商所评分:2

点击查看评分详情!

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles.

电商所评分:1

点击查看评分详情!

Fly Cheaply: On the Minimum Fuel Consumption Problem.

电商所评分:8

点击查看评分详情!

On the Common Substring Alignment Problem.

电商所评分:9

点击查看评分详情!

Approximation Algorithms for the Achromatic Number.

电商所评分:9

点击查看评分详情!

Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms.

电商所评分:7

点击查看评分详情!

The 2-Center Problem with Obstacles.

电商所评分:8

点击查看评分详情!

On Graph Powers for Leaf-Labeled Trees.

电商所评分:9

点击查看评分详情!

Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.

电商所评分:1

点击查看评分详情!

General Partitioning on Random Graphs.

电商所评分:8

点击查看评分详情!

Optimality and Greed in Dynamic Allocation.

电商所评分:4

点击查看评分详情!

On Bipartite and Multipartite Clique Problems.

电商所评分:6

点击查看评分详情!

Oblivious Gossiping on Tori.

电商所评分:10

点击查看评分详情!

The Exact Path Length Problem.

电商所评分:10

点击查看评分详情!

Improved Approximation Algorithms for MAX SAT.

电商所评分:2

点击查看评分详情!

Locating Sources to Meet Flow Demands in Undirected Networks.

电商所评分:6

点击查看评分详情!