Reconstruction of convex 2D discrete sets in polynomial time

By Kuba A.   Balogh E.  

Theoretical Computer Science, Vol. 283, Iss. 1, 2002-06 ,pp. : 223-242

Elsevier

Access to resources Recommend Favorite

On Stubborn Sets in the Verification of Linear Time Temporal Properties

By Varpaaniemi Kimmo  

Formal Methods in System Design, Vol. 26, Iss. 1, 2005-01 ,pp. : 45-67

Springer Publishing Company

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

Linear-Time Recognition of Helly Circular-Arc Models and Graphs

By Joeris Benson   Lin Min   McConnell Ross   Spinrad Jeremy   Szwarcfiter Jayme  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 215-239

Springer Publishing Company

Access to resources Recommend Favorite

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs

By Hong Seok-Hee   Nagamochi Hiroshi  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 433-460

Springer Publishing Company

Access to resources Recommend Favorite