论文列表及评分结果

Online Constrained Forest and Prize-Collecting Network Design.

电商所评分:9

点击查看评分详情!

Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks.

电商所评分:3

点击查看评分详情!

Comparison-Based Buffer Management in QoS Switches.

电商所评分:8

点击查看评分详情!

Guest Editorial: Special Issue on Theoretical Informatics.

电商所评分:10

点击查看评分详情!

De-anonymization of Heterogeneous Random Graphs in Quasilinear Time.

电商所评分:5

点击查看评分详情!

Fault-Tolerant Approximate Shortest-Path Trees.

电商所评分:6

点击查看评分详情!

Optimal Composition Ordering Problems for Piecewise Linear Functions.

电商所评分:4

点击查看评分详情!

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.

电商所评分:10

点击查看评分详情!

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity.

电商所评分:6

点击查看评分详情!

The Densest Subgraph Problem with a Convex/Concave Size Function.

电商所评分:3

点击查看评分详情!

A Polynomial Kernel for Trivially Perfect Editing.

电商所评分:3

点击查看评分详情!

An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication.

电商所评分:8

点击查看评分详情!

The Subset Assignment Problem for Data Placement in Caches.

电商所评分:8

点击查看评分详情!

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.

电商所评分:6

点击查看评分详情!

Optimization with Demand Oracles.

电商所评分:6

点击查看评分详情!

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.

电商所评分:3

点击查看评分详情!

Optimal Online Two-Way Trading with Bounded Number of Transactions.

电商所评分:5

点击查看评分详情!

Improved Parameterized Algorithms for Network Query Problems.

电商所评分:7

点击查看评分详情!

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams.

电商所评分:9

点击查看评分详情!

Covering Uncertain Points in a Tree.

电商所评分:5

点击查看评分详情!

Maximum Induced Matching Algorithms via Vertex Ordering Characterizations.

电商所评分:6

点击查看评分详情!

A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs.

电商所评分:4

点击查看评分详情!

Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane.

电商所评分:4

点击查看评分详情!

Clustered Planarity with Pipes.

电商所评分:6

点击查看评分详情!

Universal Slope Sets for 1-Bend Planar Drawings.

电商所评分:7

点击查看评分详情!

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

电商所评分:7

点击查看评分详情!

New and Simple Algorithms for Stable Flow Problems.

电商所评分:2

点击查看评分详情!

Randomised Enumeration of Small Witnesses Using a Decision Oracle.

电商所评分:1

点击查看评分详情!

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases.

电商所评分:8

点击查看评分详情!

Quantifying Competitiveness in Paging with Locality of Reference.

电商所评分:4

点击查看评分详情!