论文列表及评分结果

Fast Compatibility Testing for Rooted Phylogenetic Trees.

电商所评分:6

点击查看评分详情!

Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees.

电商所评分:3

点击查看评分详情!

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.

电商所评分:4

点击查看评分详情!

Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees.

电商所评分:1

点击查看评分详情!

Shortest (A+B)-Path Packing Via Hafnian.

电商所评分:2

点击查看评分详情!

Sampling in Space Restricted Settings.

电商所评分:5

点击查看评分详情!

Faster Information Gathering in Ad-Hoc Radio Tree Networks.

电商所评分:9

点击查看评分详情!

Minimizing Latency of Capacitated k-Tours.

电商所评分:1

点击查看评分详情!

A Clustering-Based Approach to Kinetic Closest Pair.

电商所评分:6

点击查看评分详情!

Guest Editorial: Special Issue on Parameterized and Exact Computation.

电商所评分:8

点击查看评分详情!

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions.

电商所评分:9

点击查看评分详情!

Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables.

电商所评分:1

点击查看评分详情!

Evaluation of Circuits Over Nilpotent and Polycyclic Groups.

电商所评分:9

点击查看评分详情!

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.

电商所评分:9

点击查看评分详情!

Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms.

电商所评分:10

点击查看评分详情!

Upper Domination: Towards a Dichotomy Through Boundary Properties.

电商所评分:2

点击查看评分详情!

Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking.

电商所评分:10

点击查看评分详情!

Lempel-Ziv-78 Compressed String Dictionaries.

电商所评分:3

点击查看评分详情!

Dynamic Parameterized Problems.

电商所评分:3

点击查看评分详情!

An Algorithmic Framework for Labeling Network Maps.

电商所评分:7

点击查看评分详情!

The A Priori Traveling Repairman Problem.

电商所评分:7

点击查看评分详情!

Fréchet Distance Between a Line and Avatar Point Set.

电商所评分:10

点击查看评分详情!

The Induced Separation Dimension of a Graph.

电商所评分:1

点击查看评分详情!

Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ, λ)) Genetic Algorithm.

电商所评分:2

点击查看评分详情!

Editor's Note: Special Issue on Combinatorial Pattern Matching.

电商所评分:7

点击查看评分详情!

Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems.

电商所评分:1

点击查看评分详情!

The Ordered Covering Problem.

电商所评分:2

点击查看评分详情!

Complexity of Secure Sets.

电商所评分:8

点击查看评分详情!

Guest Editors' Foreword.

电商所评分:2

点击查看评分详情!

Optimal Mutation Rates for the (1+ λ ) EA on OneMax Through Asymptotically Tight Drift Analysis.

电商所评分:4

点击查看评分详情!