Volume 126, June 2022
Complexity of fixed point counting problems in Boolean networks.

Florian Bridoux Amélia Durbec Kévin Perrot Adrien Richard

电商所评分:4

A secure searchable encryption scheme for cloud using hash-based indexing.

Nitish Andola Sourabh Prakash Vijay Kumar Yadav Raghav S. Venkatesan Shekhar Verma

电商所评分:7

Multistage knapsack.

Evripidis Bampis Bruno Escoffier Alexandre Teiller

电商所评分:1

Medians in median graphs and their cube complexes in linear time.

Laurine Bénéteau Jérémie Chalopin Victor Chepoi Yann Vaxès

电商所评分:7

Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies.

Bart M. P. Jansen Jari J. H. de Kroon

电商所评分:6

A constant-factor approximation for directed latency in quasi-polynomial time.

Zachary Friggstad Chaitanya Swamy

电商所评分:7

Length-bounded cuts: Proper interval graphs and structural parameters.

Matthias Bentert Klaus Heeger Dusan Knop

电商所评分:1

Latency, capacity, and distributed minimum spanning trees.

John Augustine Seth Gilbert Fabian Kuhn Peter Robinson Suman Sourav

电商所评分:10