Tzvetalin S. Vassilev

According to our database, Tzvetalin S. Vassilev authored at least 8 papers between 2002 and 2016.

Collaborative distances:

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

2016

On Certain Sums Involving the Legendre Symbol.

Borislav Karaivanov, Tzvetalin S. Vassilev

Integers, 2016

2014

Decontaminating Planar Regions by Sweeping with Barrier Curves.

Borislav Karaivanov, Minko Markov, Jack Snoeyink, Tzvetalin S. Vassilev

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

A Linear Time Algorithm for Computing Longest Paths in 2-Trees.

Minko Markov, Tzvetalin S. Vassilev, Krassimir Manev

Ars Comb., 2013

2008

The relative neighbourhood graph is a part of every 30degree-triangulation.

J. Mark Keil, Tzvetalin S. Vassilev

Inf. Process. Lett., 2008

2006

Algorithms for optimal area triangulations of a convex polygon.

J. Mark Keil, Tzvetalin S. Vassilev

Comput. Geom., 2006

2005

The relative neighbourhood graph is a part of every 30°-triangulation.

J. Mark Keil, Tzvetalin S. Vassilev

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2003

An algorithm for the MaxMin area triangulation of a convex polygon.

J. Mark Keil, Tzvetalin S. Vassilev

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

2002

Solution of an outstanding conjecture: the non-existence of universal cycles with <i>k</i>=<i>n</i>-2.

Brett Stevens, Paul Buskell, Paule Ecimovic, Cristian Ivanescu, Abid Muslim Malik, Anamaria Savu, Tzvetalin S. Vassilev, Helen Verrall, Boting Yang, Zhiduo Zhao

Discret. Math., 2002