
Search the dblp DataBase
Dragan M. Acketa:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Jovisa D. Zunic, Dragan M. Acketa
Least squares fitting of digital polynominal segments. [Citation Graph (0, 0)][DBLP] DGCI, 1996, pp:1723 [Conf]
 Dragan M. Acketa, Vojislav Mudrinski
A family of 4designs on 38 points. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:53, n:, pp: [Journal]
 Dragan M. Acketa, Vojislav Mudrinski, Snezana MaticKekic
A large collection of designs from a wreath product on 21 points. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:54, n:, pp: [Journal]
 Jovisa D. Zunic, Dragan M. Acketa
A General Coding Scheme for Families of Digital Curve Segments. [Citation Graph (0, 0)][DBLP] Graphical Models and Image Processing, 1998, v:60, n:6, pp:437460 [Journal]
 Dragan M. Acketa, Jovisa D. Zunic
On the Number of Linear Partitions of the (m, n)Grid. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:38, n:3, pp:163168 [Journal]
 Dragan M. Acketa, Jovisa D. Zunic
A Simple Construction of a Digital Convex ngon with Almost Minimal Diameter. [Citation Graph (0, 0)][DBLP] Inf. Sci., 1994, v:77, n:34, pp:275291 [Journal]
 Dragan M. Acketa, Jovisa D. Zunic
On the Maximal Number of Edges of Convex Digital Polygons Included into an m x m Grid. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1995, v:69, n:2, pp:358368 [Journal]
 Dragan M. Acketa
On binary paving matroids. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:70, n:1, pp:109110 [Journal]
 Dragan M. Acketa, Vojislav Mudrinski
Two 5designs on 32 points. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:163, n:13, pp:209210 [Journal]
 Snezana MaticKekic, Dragan M. Acketa, Jovisa D. Zunic
An exact construction of digital convex polygons with minimal diameter. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:150, n:13, pp:303313 [Journal]
Search in 0.024secs, Finished in 0.024secs
