In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
David Bremner, Ferran Hurtado, Suneeta Ramaswami, ...
In this paper we describe the Senseval 2 Basque lexicalsample task. The task comprised 40 words (15 nouns, 15 verbs and 10 adjectives) selected from Euskal Hiztegia...
Eneko Agirre, Elena Garcia, Mikel Lersundi, David ...
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...