6 citations · 12 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 1 cited
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
Ivan Bliznets, Nikolai Karpov
Clustering is a well-known and important problem with numerous applications. The graph-based model is one of the typical cluster models. In the graph model, clusters are generally…
cs.DS2017
An exponential lower bound for cut sparsifiers in planar graphs
Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
Given an edge-weighted graph with a set of terminals, a mimicking network is a graph with the same set of terminals that exactly preserves the sizes of minimum cuts bet…