DSpace at KOASAS
Browsing DSpace

Browse by Subject LINEAR-TIME

A to Z

All 0-9

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:

Showing results 1 to 5 of 5

1
An FPT 2-Approximation for Tree-Cut Decomposition

Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M., ALGORITHMICA, v.80, no.1, pp.116 - 135, 2018-01

2
AN OPTIMAL ALGORITHM FOR FINDING THE EDGE VISIBILITY POLYGON UNDER LIMITED VISIBILITY

KIM, SH; PARK, JH; CHOI, SH; Shin, Sung-Yong; Chwa, Kyung Yong, INFORMATION PROCESSING LETTERS, v.53, no.6, pp.359 - 365, 1995-03

3
Point location in zones of k-flats in arrangements

deBerg, M; vanKreveld, M; Cheong, Otfried; Snoeyink, J, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.6, no.3, pp.131 - 143, 1996-06

4
Reachability by paths of bounded curvature in a convex polygon

Ahn, Hee-Kap; Cheong, Otfried; Matousek, Jiri; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.45, no.1-2, pp.21 - 32, 2012-01

5
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable

Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, IEEE TRANSACTIONS ON INFORMATION THEORY, v.63, no.11, pp.7178 - 7205, 2017-11

Discover

rss_1.0 rss_2.0 atom_1.0