Chris Worman

According to our database, Chris Worman authored at least 7 papers between 2003 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2008

Searching Trees with Sources and Targets.

Chris Worman, Boting Yang

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

Polygon Decomposition and the Orthogonal Art Gallery Problem.

Chris Worman, J. Mark Keil

Int. J. Comput. Geom. Appl., 2007

On the Tileability of Polygons with Colored Dominoes.

Chris Worman, Boting Yang

Discret. Math. Theor. Comput. Sci., 2007

2005

On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons.

Chris Worman, Boting Yang

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On the Computation and Chromatic Number of Colored Domino Tilings.

Chris Worman, Boting Yang

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Tiling layouts with dominoes.

Chris Worman, Mark D. Watson

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Decomposing Polygons Into Diameter Bounded Components.

Chris Worman

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003