Matt Gibson

Orcid: 0000-0001-5777-8313

Affiliations:
  • University of Texas at San Antonio, TX, USA
  • University of Iowa, Iowa City, USA (PhD 2010)


According to our database1, Matt Gibson authored at least 31 papers between 2009 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Optimal Bounds for Weak Consistent Digital Rays in 2D.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

On Vertex Guarding Staircase Polygons.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
The VC-Dimension of Limited Visibility Terrains.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Terrain Visibility Graphs: Persistence Is Not Enough.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
The VC-dimension of visibility on the boundary of monotone polygons.
Comput. Geom., 2019

A Note on Guarding Staircase Polygons.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2017
Guarding Monotone Polygons with Half-Guards.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
On isolating points using unit disks.
J. Comput. Geom., 2016

Constructing Consistent Digital Line Segments.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
A Characterization of Consistent Digital Line Segments in Two Dimensions.
CoRR, 2015

The VC-Dimension of Visibility on the Boundary of a Simple Polygon.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Fast and Accurate Workload Characterization Using Locality Sensitive Hashing.
Proceedings of the 17th IEEE International Conference on High Performance Computing and Communications, 2015

Choosing thresholds for density-based map construction algorithms.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

A Characterization of Visibility Graphs for Pseudo-polygons.
Proceedings of the Algorithms - ESA 2015, 2015

A Characterization of Consistent Digital Line Segments in ℤ2.
Proceedings of the Algorithms - ESA 2015, 2015

Fast and QoS-Aware Heterogeneous Data Center Scheduling Using Locality Sensitive Hashing.
Proceedings of the 7th IEEE International Conference on Cloud Computing Technology and Science, 2015

2014
Guarding Terrains via Local Search.
J. Comput. Geom., 2014

Computing Regions Decomposable into m Stars.
Proceedings of the Algorithms - ESA 2014, 2014

On the VC-Dimension of Visibility in Monotone Polygons.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012
On Clustering to Minimize the Sum of Radii.
SIAM J. Comput., 2012

2011
Optimally Decomposing Coverings with Translates of a Convex Polygon.
Discret. Comput. Geom., 2011

Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

On Isolating Points Using Disks.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Approximation Algorithms for Dominating Set in Disk Graphs
CoRR, 2010

On Metric Clustering to Minimize the Sum of Radii.
Algorithmica, 2010

Algorithms for Dominating Set in Disk Graphs: Breaking the log<i>n</i> Barrier - (Extended Abstract).
Proceedings of the Algorithms, 2010

2009
Quasi-Polynomial Time Approximation Schemes for Target Tracking
CoRR, 2009

Decomposing Coverings and the Planar Sensor Cover Problem.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

An Approximation Scheme for Terrain Guarding.
Proceedings of the Approximation, 2009


  Loading...