Approximate Testing and Learnability. - Kathleen Romanik (COLT, 1992)

Using computational learning theory to analyze the testing complexity of program segments. - Kathleen Romanik; Jeffrey Scott Vitter (COMPSAC, 1993)

Directed VR-Representable Graphs have Unbounded Dimension. - Kathleen Romanik (GD, 1994)

Testing Geometric Objects. - Kathleen Romanik; Carl Smith (Comput. Geom., 1994)

Testing Orthogonal Shapes. - Kathleen Romanik; Steven Salzberg (Comput. Geom., 1995)

Optimal Robot Localization in Trees. - Kathleen Romanik; Sven Schuierer (SCG, 1996)

Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments. - Kathleen Romanik; Jeffrey Scott Vitter (Inf. Comput., 1996)

Testing Simple Polygons. - Esther M. Arkin; Patrice Belleville; Joseph S. B. Mitchell; David M. Mount; Kathleen Romanik; Steven Salzberg; Diane L. Souvaine (Comput. Geom., 1997)

Directed Rectangle-visibility Graphs Have Unbounded Dimension. - Kathleen Romanik (Discret. Appl. Math., 1997)

Approximate Testing and Its Relationship to Learning. - Kathleen Romanik (Theor. Comput. Sci., 1997)

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)

Localizing a Robot with Minimum Travel. - Gregory Dudek; Kathleen Romanik; Sue Whitesides (SIAM J. Comput., 1998)

Optimal Robot Localization in Trees. - Rudolf Fleischer; Kathleen Romanik; Sven Schuierer; Gerhard Trippen (Inf. Comput., 2001)

A practical approximation algorithm for the LMS line estimator. - David M. Mount; Nathan S. Netanyahu; Kathleen Romanik; Ruth Silverman; Angela Y. Wu (Comput. Stat. Data Anal., 2007)