- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Jeannine M Coburn, Matt Gibson, +5 authors Jennifer H Elisseeff
- Smart structures and systems
- 2011

The native extracellular matrix (ECM) consists of an integrated fibrous protein network and proteoglycan-based ground (hydrogel) substance. We designed a novel electrospinning technique to engineer a… (More)

- Matt Gibson, Imran A. Pirwani
- ESA
- 2010

We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, yet the best known… (More)

Given a metric <i>d</i> defined on a set <i>V</i> of points (a metric space), we define the ball B(<i>v, r</i>) centered at <i>u</i> ∈ <i>V</i> and having radius <i>r</i> ≥ 0 to be the set {<i>q</i>… (More)

- Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan
- Algorithmica
- 2009

Given an n-point metric (P,d) and an integer k>0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a randomized algorithm that runs in… (More)

- Erik Krohn, Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan
- JoCG
- 2014

We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by… (More)

- Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan
- APPROX-RANDOM
- 2009

We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by… (More)

- Matt Gibson, Kasturi R. Varadarajan
- Discrete & Computational Geometry
- 2011

We show that any k-fold covering using translates of an arbitrary convex polygon can be decomposed into Ω(k) covers. Such a decomposition can be computed using an efficient (polynomial-time)… (More)

- Matt Gibson, Imran A. Pirwani
- ArXiv
- 2010

AbstractWe consider the problem of ﬁnding a lowest cost dominating set in a given disk graph containingn disks. The problem has been extensively studied on subclasses of disk graphs, yet the best… (More)

- Matt Gibson, Vince Beachley, Jeannine M Coburn, Pierre Alain Bandinelli, Hai-Quan Mao, Jennifer H Elisseeff
- BioMed research international
- 2014

Biomaterials derived from the decellularization of mature tissues retain biological and architectural features that profoundly influence cellular activity. However, the clinical utility of such… (More)

- Matt Gibson, Dongfeng Han, Milan Sonka, Xiaodong Wu
- ISAAC
- 2011

We consider an optimization version of the image segmentation problem, in which we are given a grid graph with weights on the grid cells. We are interested in finding the maximum weight subgraph such… (More)