In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1992], Monma and Suri proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that c × c area is sometimes required to embed an n-vertex tree of maximum degree...

Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem forB moving between two configurations insideP (a configuration specifies both a location and a direction of travel). We present an O(n2 log n) time algorithm for determining whether a collisi...

In this paper we introduce two new concepts to the design of packet classification systems. First, we propose most specific filter matching (MSFM), an improvement over the well known Cross Producting algorithm [V. Srinivasan, S. Suri, G. Varghese, M. Waldvogel, Fast and scalable layer four switching, in: Proceedings of ACM SIGCOMM, 1998] that significantly reduces the memory requirement of the ...

Background : Till date there is no published multi-institutional data regarding the epidemiological profile of pediatric brain tumors in India. Aim : The present retrospective study analyses the histological spectrum of pediatric age group brain tumors in seven tertiary care hospitals in India. Material and Methods : Data regarding frequencies of various primary brain tumors (diagnosed accordin...

Early mitral valve (MV) repair is the evidence-based care standard for those with severe degenerative MV regurgitation and has been shown to improve long-term patient outcomes in comparison to non-surgical management (1). Despite evidence favoring the performance of MV repair prior to symptom onset or the appearance of left ventricular (LV) dysfunction, some physicians are hesitant to refer asy...