Publications :: Search

Show author

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

Author information
First name:	Christos
Last name:	Levcopoulos
DBLP:	55/673
Rating:	(not rated yet)
Bookmark:

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

Show item 1 to 25 of 97  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos. Quickest Path Queries on Transportation Network.	Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012 2012	(0)	2012
	Journal article Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos. Quickest Path Queries on Transportation Network	CoRR 2010, Volume 0	(0)	2010
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. Restricted Mesh Simplification Using Edge Contractions.	Int. J. Comput. Geometry Appl. 2009, Volume 19	(0)	2009
	Conference paper Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos. Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem.	Int. J. Comput. Geometry Appl. 2008, Volume 18	(0)	2008
	Conference paper Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. Approximate distance oracles for geometric spanners.	ACM Transactions on Algorithms 2008, Volume 4	(0)	2008
	Book chapter Christos Levcopoulos. Minimum Weight Triangulation.	Encyclopedia of Algorithms 2008	(0)	2008
	Book chapter Christos Levcopoulos. Minimum Geometric Spanning Trees.	Encyclopedia of Algorithms 2008	(0)	2008
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. Approximate distance oracles for graphs with dense clusters.	Comput. Geom. 2007, Volume 37	(0)	2007
	Conference paper Joachim Gudmundsson, Christos Levcopoulos. Minimum weight pseudo-triangulations.	Comput. Geom. 2007, Volume 38	(0)	2007
	Conference paper Magdalene G. Borgelt, Christos Levcopoulos. Covering a Set of Points with a Minimum Number of Lines.	Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings 2006	(0)	2006
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. Restricted Mesh Simplification Using Edge Contractions.	Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings 2006	(0)	2006
	Conference paper Rolf Klein, Christos Levcopoulos, Andrzej Lingas. A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.	Comput. Geom. 2006, Volume 34	(0)	2006
	Conference paper Magdalene G. Borgelt, Christos Levcopoulos. Bounds on optimally triangulating connected subsets of the minimum weight convex partition.	(Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005 2005	(0)	2005
	Conference paper Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos. Minimum Weight Triangulation by Cutting Out Triangles.	Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings 2005	(0)	2005
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. Chips on wafers, or packing rectangles into grids.	Comput. Geom. 2005, Volume 30	(0)	2005
	Conference paper Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen. TSP with neighborhoods of varying size.	J. Algorithms 2005, Volume 57	(0)	2005
	Conference paper Joachim Gudmundsson, Christos Levcopoulos. Minimum Weight Pseudo-Triangulations.	FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings 2004	(0)	2004
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. Approximate Distance Oracles for Graphs with Dense Clusters.	Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings 2004	(0)	2004
	Conference paper Magdalene G. Borgelt, Christos Levcopoulos. A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.	Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers 2005	(0)	2004
	Conference paper Magdalene G. Borgelt, Christos Levcopoulos. Tight Time Bounds for the Minimum Local Convex Partition Problem.	Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers 2005	(0)	2004
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. Chips on Wafers.	Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings 2003	(0)	2003
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan. Balanced Partition of Minimum Spanning Trees.	Int. J. Comput. Geometry Appl. 2003, Volume 13	(0)	2003
	Conference paper Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen. TSP with Neighborhoods of Varying Size.	Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings 2002	(0)	2002
	Conference paper Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan. Balanced Partition of Minimum Spanning Trees.	Computational Science - ICCS 2002, International Conference, Amsterdam, The Netherlands, April 21-24, 2002. Proceedings, Part III 2002	(0)	2002
	Conference paper Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. Approximate Distance Oracles Revisited.	Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings 2002	(0)	2002

Show item 1 to 25 of 97  

Your query returned 97 matches in the database.