17 citations · 30 across the 4 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)
Artur Czumaj, Christian Sohler
The problem of characterizing testable graph properties (properties that can be tested with a number of queries independent of the input size) is a fundamental problem in the area…
cs.DS2019
Fully dynamic hierarchical diameter k-clustering and k-center
Melanie Schmidt, Christian Sohler
We develop dynamic data structures for maintaining a hierarchical k-center clustering when the points come from a discrete space . Our first data structure is for…
cs.DS2019
Testable Properties in General Graphs and Random Order Streaming
Artur Czumaj, Hendrik Fichtenberger, Pan Peng +1
We present a novel framework closely linking the areas of property testing and data streaming algorithms in the setting of general graphs. It has been recently shown (Monemizadeh e…