# Kathleen Romanik

According to our database

Collaborative distances:

^{1}, Kathleen Romanik authored at least 14 papers between 1992 and 2001.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2001

Optimal Robot Localization in Trees.

Inf. Comput., 2001

1998

A Visibility Representation for Graphs in Three Dimensions.

J. Graph Algorithms Appl., 1998

1997

Approximate Testing and Its Relationship to Learning.

Theor. Comput. Sci., 1997

A Practical Approximation Algorithm for the LMS Line Estimator.

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments.

Inf. Comput., 1996

Optimal Robot Localization in Trees.

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Testing Orthogonal Shapes.

Comput. Geom., 1995

Localizing a Robot with Minimum Travel.

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Directed rectangle visibility graphs have unbounded dimension.

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Testing Geometric Objects.

Comput. Geom., 1994

Directed VR-Representable Graphs have Unbounded Dimension.

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Using computational learning theory to analyze the testing complexity of program segments.

Proceedings of the Seventeenth Annual International Computer Software and Applications Conference, 1993

Testing Simple Polygons.

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Approximate Testing and Learnability.

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992