| 2005 | 
| 21 |   | Sergiu M. Dascalu,
Norm Brown,
Derek A. Eiler,
Herman W. Leong,
Nathan A. Penrod,
Brian T. Westphal,
Yaakov L. Varol:
Software Modeling of S-Metrics Visualizer: Synergetic Interactive Metrics Visualization Tool.
Software Engineering Research and Practice 2005: 870-876 | 
| 20 | EE | Lillian N. Cassel,
Anneke Hacquebard,
Andrew D. McGettrick,
Gordon Davies,
Richard J. LeBlanc,
Charles Riedesel,
Yaakov L. Varol,
Gail T. Finley,
Samuel Mann,
Robert H. Sloan:
A synthesis of computing concepts.
SIGCSE Bulletin 37(4): 162-172 (2005) | 
| 2003 | 
| 19 | EE | Xiaojing Yuan,
Zehang Sun,
Yaakov L. Varol,
George Bebis:
A Distributed Visual Surveillance System.
AVSS 2003: 199-204 | 
| 2002 | 
| 18 |   | Spyros Tragoudas,
Yaakov L. Varol:
Disjoint Paths with Length Constraints.
I. J. Comput. Appl. 9(3): 158-166 (2002) | 
| 17 |   | George Bebis,
Evangelos A. Yfantis,
Sushil J. Louis,
Yaakov L. Varol:
Genetic object recognition using combinations of views.
IEEE Trans. Evolutionary Computation 6(2): 132-146 (2002) | 
| 1999 | 
| 16 |   | Spyros Tragoudas,
Yaakov L. Varol:
Disjoint paths with length constraints.
Computers and Their Applications 1999: 277-280 | 
| 1998 | 
| 15 |   | Sushil J. Louis,
George Bebis,
Satish Uthiram,
Yaakov L. Varol:
Genetic Search for Object Identification.
Evolutionary Programming 1998: 199-208 | 
| 14 | EE | Kaijung Chang,
Yan Huat Tan,
Yaakov L. Varol,
Jiang-Hsing Chu:
A Study on Interleaving Versus Segmentation.
Inf. Process. Lett. 65(6): 319-324 (1998) | 
| 1996 | 
| 13 |   | Spyros Tragoudas,
Yaakov L. Varol:
Computing Disjoint Path with Lenght Constraints.
WG 1996: 375-389 | 
| 1995 | 
| 12 |   | Kaijung Chang,
Yan Huat Tan,
Yaakov L. Varol,
Jiang-Hsing Chu:
Analysis of Load Partitioning: Segmentation vs. Interleave.
Parallel and Distributed Computing and Systems 1995: 202-205 | 
| 1986 | 
| 11 | EE | Raj Sekhar Pamula,
Suchai Thanawastien,
Yaakov L. Varol:
On selecting rollback points for error recovery.
Inf. Sci. 38(3): 283-292 (1986) | 
| 1984 | 
| 10 |   | Yaakov L. Varol,
Susan V. Vrbsky:
Distributed Query Processing Allowing for Redundant Data.
ICDCS 1984: 389-396 | 
| 9 |   | Alan D. Kalvin,
Yaakov L. Varol:
On Two Problems Reducible to Topological Sorting.
Comput. J. 27(2): 176-177 (1984) | 
| 1983 | 
| 8 |   | Alan D. Kalvin,
Yaakov L. Varol:
On the Generation of All Topological Sortings.
J. Algorithms 4(2): 150-162 (1983) | 
| 1981 | 
| 7 |   | Yaakov L. Varol,
Doron Rotem:
An Algorithm to Generate all Topological Sorting Arrangements.
Comput. J. 24(1): 83-84 (1981) | 
| 6 |   | Yaakov L. Varol,
Doron Rotem:
Some Experiences with the Johnson-Trotter Permutation Generation Algorithm.
Comput. J. 24(2): 173-176 (1981) | 
| 5 |   | Lloyd K. Konneker,
Yaakov L. Varol:
A Note on Heuristics for Dynamic Organization of Data Structures.
Inf. Process. Lett. 12(5): 213-216 (1981) | 
| 1980 | 
| 4 |   | Yaakov L. Varol:
On a Subset of all the Permutations of n Marks.
Comput. J. 23(4): 344-346 (1980) | 
| 1978 | 
| 3 | EE | Doron Rotem,
Yaakov L. Varol:
Generation of Binary Trees from Ballot Sequences.
J. ACM 25(3): 396-404 (1978) | 
| 1977 | 
| 2 |   | Yaakov L. Varol:
On the Generation of the Pseudo-Remainder in Polynomial Division.
Comput. J. 20(2): 178-180 (1977) | 
| 1976 | 
| 1 |   | Yaakov L. Varol:
Some Remarks on Computer Acquisition.
Comput. J. 19(2): 127-131 (1976) |