36 citations · 111 across the 22 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022★ 23 cited
Listing Maximal k-Plexes in Large Real-World Graphs
Zhengren Wang, Yi Zhou, Mingyu Xiao +1
Listing dense subgraphs in large graphs plays a key task in varieties of network analysis applications like community detection. Clique, as the densest model, has been widely inves…
cs.DS2021
Quasi-Isometric Graph Simplifications
Khí-Uí Soo, Bakhadyr Khoussainov, Simone Linz
Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries a…
cs.DS2014★ 13 cited
Dynamic Algorithms for Interval Scheduling on a Single Machine
Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho +1
We investigate dynamic algorithms for the interval scheduling problem. Our algorithm runs in amortised time for query operation and for insertion and rem…