Let G be a graph with n vertices and maximum degree d. Fix some minor-closed property P
(such as planarity). We say that G is ε-far from P if one has to remove ε dn edges to make it …

Let G be an undirected, bounded degree graph with n vertices. Fix a finite graph H, and
suppose one must remove ε n edges from G to make it H-minor free (for some small constant …

Consider the family of bounded degree graphs in any minor-closed family (such as planar
graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs …

We give a distributed algorithm in the\sf CONGEST model for property testing of planarity
with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et …

Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this
paper, we study this problem in the Centralized Local model, where the goal is to decide …

Let G be an undirected, bounded degree graph with n vertices. Fix a finite graph H, and
suppose one must remove εn edges from G to make it H-minor-free (for some small constant …

Let G be a graph with n vertices and maximum degree d. Fix some minor-closed property P
(such as planarity). We say that G is ε-far from P if one has to remove εdn edges to make it …

Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this
paper, we study this problem in the Centralized Local model, where the goal is to decide …

Network data arises naturally in many domains-from protein-protein interaction networks in
biology to social networks. Modern storage and collection technology make it possible to …

Spectral Methods have had huge influence of modern algorithm design. For algorithmic
problems on graphs, this is done by using a deep connection between random walks and …