Kathleen Romanik

According to our database, Kathleen Romanik authored at least 14 papers between 1992 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

Optimal Robot Localization in Trees.

Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen

Inf. Comput., 2001

1998

A Visibility Representation for Graphs in Three Dimensions.

Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle

J. Graph Algorithms Appl., 1998

1997

Approximate Testing and Its Relationship to Learning.

Kathleen Romanik

Theor. Comput. Sci., 1997

A Practical Approximation Algorithm for the LMS Line Estimator.

David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu

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.

Kathleen Romanik, Jeffrey Scott Vitter

Inf. Comput., 1996

Optimal Robot Localization in Trees.

Kathleen Romanik, Sven Schuierer

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Testing Orthogonal Shapes.

Kathleen Romanik, Steven Salzberg

Comput. Geom., 1995

Localizing a Robot with Minimum Travel.

Gregory Dudek, Kathleen Romanik, Sue Whitesides

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

Directed rectangle visibility graphs have unbounded dimension.

Kathleen Romanik

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

1994

Testing Geometric Objects.

Kathleen Romanik, Carl Smith

Comput. Geom., 1994

Directed VR-Representable Graphs have Unbounded Dimension.

Kathleen Romanik

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

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

Kathleen Romanik, Jeffrey Scott Vitter

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

Testing Simple Polygons.

Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine

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

1992

Approximate Testing and Learnability.

Kathleen Romanik

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