2007 |
16 | EE | David M. Mount,
Nathan S. Netanyahu,
Kathleen Romanik,
Ruth Silverman,
Angela Y. Wu:
A practical approximation algorithm for the LMS line estimator.
Computational Statistics & Data Analysis 51(5): 2461-2486 (2007) |
2001 |
15 | EE | Rudolf Fleischer,
Kathleen Romanik,
Sven Schuierer,
Gerhard Trippen:
Optimal Robot Localization in Trees.
Inf. Comput. 171(2): 224-247 (2001) |
1998 |
14 | EE | 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(2): (1998) |
13 | | Gregory Dudek,
Kathleen Romanik,
Sue Whitesides:
Localizing a Robot with Minimum Travel.
SIAM J. Comput. 27(2): 583-604 (1998) |
1997 |
12 | | David M. Mount,
Nathan S. Netanyahu,
Kathleen Romanik,
Ruth Silverman,
Angela Y. Wu:
A Practical Approximation Algorithm for the LMS Line Estimator.
SODA 1997: 473-482 |
11 | | 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: 97-114 (1997) |
10 | EE | Kathleen Romanik:
Directed Rectangle-visibility Graphs Have Unbounded Dimension.
Discrete Applied Mathematics 73(1): 35-39 (1997) |
9 | EE | Kathleen Romanik:
Approximate Testing and Its Relationship to Learning.
Theor. Comput. Sci. 188(1-2): 79-99 (1997) |
1996 |
8 | EE | Kathleen Romanik,
Sven Schuierer:
Optimal Robot Localization in Trees.
Symposium on Computational Geometry 1996: 264-273 |
7 | | Kathleen Romanik,
Jeffrey Scott Vitter:
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments.
Inf. Comput. 128(2): 87-108 (1996) |
1995 |
6 | | Gregory Dudek,
Kathleen Romanik,
Sue Whitesides:
Localizing a Robot with Minimum Travel.
SODA 1995: 437-446 |
5 | | Kathleen Romanik,
Steven Salzberg:
Testing Orthogonal Shapes.
Comput. Geom. 5: 33-49 (1995) |
1994 |
4 | | Kathleen Romanik:
Directed VR-Representable Graphs have Unbounded Dimension.
Graph Drawing 1994: 177-181 |
3 | | Kathleen Romanik,
Carl Smith:
Testing Geometric Objects.
Comput. Geom. 4: 157-176 (1994) |
1993 |
2 | | Esther M. Arkin,
Patrice Belleville,
Joseph S. B. Mitchell,
David M. Mount,
Kathleen Romanik,
Steven Salzberg,
Diane L. Souvaine:
Testing Simple Polygons.
CCCG 1993: 387 |
1992 |
1 | EE | Kathleen Romanik:
Approximate Testing and Learnability.
COLT 1992: 327-332 |