The SCEAS System
| |||||||

## Search the dblp DataBase
Jerzy W. Jaromczyk:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jerzy W. Jaromczyk, Yang Wang
**Local optimization of triangular surface meshes for general quadrics in lp norm.**[Citation Graph (0, 0)][DBLP] CCCG, 2001, pp:113-116 [Conf] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**A Note on Relative Neighborhood Graphs.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1987, pp:233-241 [Conf] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**Skewed Projections with an Application to Line Stabbing in R3.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1988, pp:362-370 [Conf] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**An Efficient Algorithm for the Euclidean Two-Center Problem.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1994, pp:303-311 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] CSB, 2004, pp:464-467 [Conf] - Joseph Ibershoff, Jerzy W. Jaromczyk, Danny van Noort
**Simulations of Microreactors: The Order of Things.**[Citation Graph (0, 0)][DBLP] DNA, 2006, pp:286-297 [Conf] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets.**[Citation Graph (0, 0)][DBLP] EWCG, 2000, pp:93-97 [Conf] - Jerzy W. Jaromczyk
**Lower Bounds for Problems Defined by Polynomial Inequalities.**[Citation Graph (0, 0)][DBLP] FCT, 1981, pp:165-172 [Conf] - Jerzy W. Jaromczyk, Grzegorz Swiatek
**A Theory of Even Functionals and Their Algorithmic Applications.**[Citation Graph (0, 0)][DBLP] ICALP, 1993, pp:126-136 [Conf] - Danny van Noort, Yuan Hong, Joseph Ibershoff, Jerzy W. Jaromczyk
**Simulation and Visualization for DNA Computing in Microreactors.**[Citation Graph (0, 0)][DBLP] ICNC (2), 2005, pp:1206-1217 [Conf] - Jerzy W. Jaromczyk, Zbigniew Lonc
**Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:594-605 [Conf] - Jerzy W. Jaromczyk, V. Wiktor Marek
**Investigating Logical Properties of the Rule-Based Expert Systems Using Combinatorial and Geometrical Techniques I.**[Citation Graph (0, 0)][DBLP] ISMIS, 1987, pp:96-106 [Conf] - Alex Dekhtyar, Ionut Emil Iacob, Jerzy W. Jaromczyk, Kevin Kiernan, Neil Moore, Dorothy C. Porter
**Building image-based electronic editions using the edition production technology.**[Citation Graph (0, 0)][DBLP] JCDL, 2005, pp:406- [Conf] - Jerzy W. Jaromczyk
**An Extension of Rabin's Complete Proof Concept.**[Citation Graph (0, 0)][DBLP] MFCS, 1981, pp:321-326 [Conf] - Jerzy W. Jaromczyk
**Lower Bounds for Polygon Simplicity Testing and Other Problems.**[Citation Graph (0, 0)][DBLP] MFCS, 1984, pp:339-347 [Conf] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure.**[Citation Graph (0, 0)][DBLP] WADS, 1995, pp:13-25 [Conf] - Jerzy W. Jaromczyk, Miroslaw Kowaluk, Neil Moore
**A web interface to image-based concurrent markup using image maps.**[Citation Graph (0, 0)][DBLP] WIDM, 2004, pp:152-159 [Conf] - Jerzy W. Jaromczyk, Grzegorz W. Wasilkowski
**Numerical Stability of a Convex Hull Algorithm for Simple Polygons.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1993, v:10, n:6, pp:457-472 [Journal] - Jerzy W. Jaromczyk, Grzegorz W. Wasilkowski
**Computing Convex Hull in a Floating Point Arithmetic.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1994, v:4, n:, pp:283-292 [Journal] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**Sets of lines and cutting out polyhedral objects.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2003, v:25, n:1-2, pp:67-95 [Journal] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**Editorial.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:27, n:1, pp:1-0 [Journal] - Jerzy W. Jaromczyk, Miroslaw Kowaluk
**A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1999, v:14, n:4, pp:187-196 [Journal] - Robert L. (Scot) Drysdale III, Jerzy W. Jaromczyk
**A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:32, n:6, pp:301-303 [Journal] - Jerzy W. Jaromczyk
**Linear Decision Trees are too Weak for Convex Hull Problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1981, v:12, n:3, pp:138-141 [Journal] - Jerzy W. Jaromczyk, Grzegorz Swiatek
**A role of lower semicontinuous functions in the combinatorial complexity of geometric problems.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1991, v:7, n:2, pp:174-183 [Journal] - Alex Dekhtyar, Ionut Emil Iacob, Jerzy W. Jaromczyk, Kevin Kiernan, Neil Moore, Dorothy C. Porter
**Support for XML markup of image-based electronic editions.**[Citation Graph (0, 0)][DBLP] Int. J. on Digital Libraries, 2006, v:6, n:1, pp:55-69 [Journal] - Jerzy W. Jaromczyk, Grzegorz Swiatek
**A Theory of Even Functionals and Their Algorithmic Applications.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:154, n:1, pp:41-56 [Journal] **Making the SAT decision Based on a DNA Computation.**[Citation Graph (, )][DBLP]**The genetic algorithm scheme for consensus sequences.**[Citation Graph (, )][DBLP]**MedSurv: a software application for creating, conducting and managing medical surveys and questionnaires.**[Citation Graph (, )][DBLP]**Visualizing and sharing results in bioinformatics projects: GBrowse and GenBank exports.**[Citation Graph (, )][DBLP]**Constructing the relative neighborhood graph in 3-dimensional Euclidean space.**[Citation Graph (, )][DBLP]
Search in 0.088secs, Finished in 0.090secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |