论文列表及评分结果

Stochastic Dominance and the Bijective Ratio of Online Algorithms.

电商所评分:2

点击查看评分详情!

Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces.

电商所评分:7

点击查看评分详情!

A Constant-Time Algorithm for Middle Levels Gray Codes.

电商所评分:10

点击查看评分详情!

Reachability Oracles for Directed Transmission Graphs.

电商所评分:6

点击查看评分详情!

Testing Proximity to Subspaces: Approximate ℓ ∞ Minimization in Constant Time.

电商所评分:10

点击查看评分详情!

Dividing Splittable Goods Evenly and With Limited Fragmentation.

电商所评分:2

点击查看评分详情!

On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms.

电商所评分:1

点击查看评分详情!

An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees.

电商所评分:8

点击查看评分详情!

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts.

电商所评分:6

点击查看评分详情!

Consensus Strings with Small Maximum Distance and Small Distance Sum.

电商所评分:7

点击查看评分详情!

Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case.

电商所评分:4

点击查看评分详情!

The Parameterised Complexity of Computing the Maximum Modularity of a Graph.

电商所评分:10

点击查看评分详情!

Stable Matching with Uncertain Linear Preferences.

电商所评分:9

点击查看评分详情!

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon.

电商所评分:1

点击查看评分详情!

Correction to: Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space.

电商所评分:10

点击查看评分详情!

Crossing Number for Graphs with Bounded Pathwidth.

电商所评分:6

点击查看评分详情!

Solving and Sampling with Many Solutions.

电商所评分:10

点击查看评分详情!

Energy-Optimal Routes for Battery Electric Vehicles.

电商所评分:3

点击查看评分详情!

Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs.

电商所评分:4

点击查看评分详情!

On the Complexity of Computing Treebreadth.

电商所评分:9

点击查看评分详情!

Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions.

电商所评分:2

点击查看评分详情!

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.

电商所评分:2

点击查看评分详情!

Best-Case and Worst-Case Sparsifiability of Boolean CSPs.

电商所评分:4

点击查看评分详情!

Nested Convex Bodies are Chaseable.

电商所评分:3

点击查看评分详情!

Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem.

电商所评分:1

点击查看评分详情!

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.

电商所评分:8

点击查看评分详情!

High-Dimensional Approximate r-Nets.

电商所评分:6

点击查看评分详情!

Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures).

电商所评分:5

点击查看评分详情!

Analysis of Noisy Evolutionary Optimization When Sampling Fails.

电商所评分:8

点击查看评分详情!

Embedding Small Digraphs and Permutations in Binary Trees and Split Trees.

电商所评分:5

点击查看评分详情!