Kathleen Romanik

Publication Activity (10 Years)

Years Active: 1992-2007
Publications (10 Years): 0

Publications

David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
A practical approximation algorithm for the LMS line estimator. Comput. Stat. Data Anal. 51 (5) (2007)
Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen
Optimal Robot Localization in Trees. Inf. Comput. 171 (2) (2001)
Gregory Dudek, Kathleen Romanik, Sue Whitesides
Localizing a Robot with Minimum Travel. SIAM J. Comput. 27 (2) (1998)
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
A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2 (3) (1998)
Kathleen Romanik
Directed Rectangle-visibility Graphs Have Unbounded Dimension. Discret. Appl. Math. 73 (1) (1997)
Kathleen Romanik
Approximate Testing and Its Relationship to Learning. Theor. Comput. Sci. 188 (1-2) (1997)
David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
A Practical Approximation Algorithm for the LMS Line Estimator. SODA (1997)
Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
Testing Simple Polygons. Comput. Geom. 8 (1997)
Kathleen Romanik, Jeffrey Scott Vitter
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments. Inf. Comput. 128 (2) (1996)
Kathleen Romanik, Sven Schuierer
Optimal Robot Localization in Trees. SCG (1996)
Kathleen Romanik
Directed rectangle visibility graphs have unbounded dimension. CCCG (1995)
Gregory Dudek, Kathleen Romanik, Sue Whitesides
Localizing a Robot with Minimum Travel. SODA (1995)
Kathleen Romanik, Steven Salzberg
Testing Orthogonal Shapes. Comput. Geom. 5 (1995)
Kathleen Romanik, Carl Smith
Testing Geometric Objects. Comput. Geom. 4 (1994)
Kathleen Romanik
Directed VR-Representable Graphs have Unbounded Dimension. Graph Drawing (1994)
Kathleen Romanik, Jeffrey Scott Vitter
Using computational learning theory to analyze the testing complexity of program segments. COMPSAC (1993)
Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
Testing Simple Polygons. CCCG (1993)
Kathleen Romanik
Approximate Testing and Learnability. COLT (1992)