Publications

Found 97 results
[ Author(Asc)] Title Type Year
Filters: First Letter Of Title is G  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
T
Tomás AP. Guarding Thin Orthogonal Polygons Is Hard. In: Fundamentals of Computation Theory. Vol 19th International Symposium, FCT 2013, Lecture Notes in Computer Science, Volume 8070. UK, Liverpool: Springer; 2013. 3. p. 305-316p.
Tomás AP. Guarding the vertices of thin orthogonal polygons is NP-hard. In: EGC 2013 – XV Spanish Meeting on Computational Geometry. Vol EGC 2013 – XV Spanish Meeting on Computational Geometry (Informal Proceedings). University of Seville, Spain ed.; 2013. 1. p. 11-14p.
Tavares JN. Generalized holonomies. J. Geom. Phys.. 1998;26:311-328.

Pages

Error | CMUP

Error

The website encountered an unexpected error. Please try again later.