| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Jerzy W. Jaromczyk Mark L. Farman , Joshua W. Gilkerson , Jerzy W. Jaromczyk, Chuck Staben : RepeatAssembler: A Package for Annotation of Full-Length Repetitive DNA Sequences in Fungal Genomes. CSB 2004 : 464-467 Jerzy W. Jaromczyk, Zbigniew Lonc : Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations. ISAAC 2004 : 594-605 Jerzy W. Jaromczyk, Miroslaw Kowaluk , Neil Moore : A web interface to image-based concurrent markup using image maps. WIDM 2004 : 152-159 Jerzy W. Jaromczyk, Miroslaw Kowaluk : Sets of lines and cutting out polyhedral objects. Comput. Geom. 25 (1-2): 67-95 (2003) Jerzy W. Jaromczyk, Yang Wang : Local optimization of triangular surface meshes for general quadrics in lp norm. CCCG 2001 : 113-116 Jerzy W. Jaromczyk, Miroslaw Kowaluk : The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets. EWCG 2000 : 93-97 Jerzy W. Jaromczyk, Miroslaw Kowaluk : A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem. Comput. Geom. 14 (4): 187-196 (1999) Jerzy W. Jaromczyk, Grzegorz Swiatek : A Theory of Even Functionals and Their Algorithmic Applications. Theor. Comput. Sci. 154 (1): 41-56 (1996) Jerzy W. Jaromczyk, Miroslaw Kowaluk : The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure. WADS 1995 : 13-25 Jerzy W. Jaromczyk, Miroslaw Kowaluk : An Efficient Algorithm for the Euclidean Two-Center Problem. Symposium on Computational Geometry 1994 : 303-311 Jerzy W. Jaromczyk, Grzegorz W. Wasilkowski : Computing Convex Hull in a Floating Point Arithmetic. Comput. Geom. 4 : 283-292 (1994) Jerzy W. Jaromczyk, Grzegorz Swiatek : A Theory of Even Functionals and Their Algorithmic Applications. ICALP 1993 : 126-136 Jerzy W. Jaromczyk, Grzegorz W. Wasilkowski : Numerical Stability of a Convex Hull Algorithm for Simple Polygons. Algorithmica 10 (6): 457-472 (1993) Robert L. (Scot) Drysdale III , Jerzy W. Jaromczyk: A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems. Inf. Process. Lett. 32 (6): 301-303 (1989) Jerzy W. Jaromczyk, Miroslaw Kowaluk : Skewed Projections with an Application to Line Stabbing in R3. Symposium on Computational Geometry 1988 : 362-370 Jerzy W. Jaromczyk, V. Wiktor Marek : Investigating Logical Properties of the Rule-Based Expert Systems Using Combinatorial and Geometrical Techniques I. ISMIS 1987 : 96-106 Jerzy W. Jaromczyk, Miroslaw Kowaluk : A Note on Relative Neighborhood Graphs. Symposium on Computational Geometry 1987 : 233-241 Jerzy W. Jaromczyk: Lower Bounds for Polygon Simplicity Testing and Other Problems. MFCS 1984 : 339-347 Jerzy W. Jaromczyk: Lower Bounds for Problems Defined by Polynomial Inequalities. FCT 1981 : 165-172 Jerzy W. Jaromczyk: An Extension of Rabin's Complete Proof Concept. MFCS 1981 : 321-326 Jerzy W. Jaromczyk: Linear Decision Trees are too Weak for Convex Hull Problem. Inf. Process. Lett. 12 (3): 138-141 (1981) 1 [ 8 ] 2 [ 21 ] 3 [ 21 ] 4 [ 5 ] [ 7 ] [ 12 ] [ 13 ] [ 15 ] [ 16 ] [ 18 ] [ 19 ] 5 [ 20 ] 6 [ 6 ] 7 [ 19 ] 8 [ 21 ] 9 [ 10 ] [ 14 ] 10 [ 17 ] 11 [ 9 ] [ 11 ]  ©2005 Association for Computing Machinery |
