文章引用情况
1
Range-max queries on uncertain data2
Does adding more agents make a difference? A case study of cover time for the rotor-router3
Parameterized algorithms algorithms for recognizing monopolar and 2-subcolorable graphs4
Kernels for deletion to classes of acyclic digraphs5
On the complexity of trial and error for constraint satisfaction problems6
k-distinct in- and out-branchings in digraphs7
Algorithmic identification of probabilities is hard8
On discrete preferences and coordination9
Expressive power of entity-linking frameworks10
Strong bounds for evolution in networks