Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Ferran
Last name:	Hurtado
DBLP:	h/FerranHurtado
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 184  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl. A class of point-sets with few k-sets.	Comput. Geom. 2000, Volume 16	(0)	2000
	Conference paper Prosenjit Bose, Narcís Coll, Ferran Hurtado, Joan Antoni Sellarès. A General Approximation Algorithm for Planar Maps with Applications.	Int. J. Comput. Geometry Appl. 2007, Volume 17	(0)	2007
	Conference paper Peter Braß, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw. A Lower Bound on the Area of a 3-Coloured Disc Packing.	Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada 2007	(0)	2007
	Conference paper Peter Braß, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw. A Lower Bound on the Area of a 3-Coloured Disk Packing	CoRR 2008, Volume 0	(0)	2008
	Conference paper Peter Braß, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw. A Lower Bound on the Area of a 3-Coloured Disk Packing.	Int. J. Comput. Geometry Appl. 2010, Volume 20	(0)	2010
	Conference paper Oswin Aichholzer, Ferran Hurtado, Marc Noy. A lower bound on the number of triangulations of planar point sets.	Comput. Geom. 2004, Volume 29	(0)	2004
	Conference paper Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood. A polynomial bound for untangling geometric planar graphs	CoRR 2007, Volume 0	(0)	2007
	Conference paper Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood. A Polynomial Bound for Untangling Geometric Planar Graphs.	Discrete Computational Geometry 2009, Volume 42	(0)	2009
	Conference paper Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood. A Polynomial Bound for Untangling Geometric Planar Graphs.	Electronic Notes in Discrete Mathematics 2008, Volume 31	(0)	2008
	Conference paper Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia. A Problem on Hinged Dissections with Colours.	Graphs and Combinatorics 2004, Volume 20	(0)	2004

Show item 1 to 10 of 184  

Your query returned 184 matches in the database.