PAPERS IN REFEREED JOURNALS 

                  1.      A counter example to a conjecture of D.J. Rose on minimum triangulation, J. Math. Anal. and Appl. 42, 3 (1973), 594-595.

                  2.      Efficient generation of optimal prefix code: equiprobable words using unequal cost letters, (with M.R. Garey and S. Even) JACM 22, 2 (1975), 202-214.

                  3.      Constuction in combinatorial games with cycles, (with A.S. Fraenkel), Colloquia Mathematics Societatis Janos Bolvai, 10 Proc. Intern. Colloq. Infinite and Sets, Keszthely, Hungary, (1973), 2, 667-699, North Holland, 1975.

                  4.      Optimal sequential arrangement of evaluation trees for Boolean functions, (with Y. Breitbart), Information Science 11 (1976), 1-12.

                  5.      Interpolation search ­ A log log N search, (with A. Itai and H. Avni), CACM, 21 (1978), 550-553.

                  6.      Understanding the complexity of interpolation search, (with E.M. Reingold), Info.Proc. let. 6 (1977), 219-222.

                  7.      Finding two disjoint paths between two pairs of vertices in a graph, (with Y. Shiloach), JACM 25 (1978), 1-9.

                  8.      Generalized Fibonacci maximum path graphs, (with M.C. Golumbic), Discrete Mathematics, 28 (1979), 237-245.

                  9.      The edge inducibility of graphs, (with. C.Golumbic), Acta Mathematica, 35 (1980), 393-398.

              10.      Deficient generalized Fibonacci maximum path graphs, (with S.Zaks), Discrete Mathematics, 34 (1981) 153-164.

              11.       Min­Max tree partitioning, (with S.R. Schach), JACM, 28 (1981), 5-15.

              12.      Mean flow scheduling and optimal construction of a tree­like communication network, (with Y. Yesha) Network, 11 (1981) 87-92.

              13.      The complexity of identifying redundant and essential elements, (with S. Moran), Journal of Algorithms, 2 (1981) 22- 30.

              14.      A shifting algorithm for Min­Max tree Partitioning, (with R.I. Becker and S.R. Schach), JACM, 29 (1982) 58-76.

              15.      On the complexity of optimal edge labelings for trees, (with S. Zaks) in Theoretical Computer Science, 19 (1982) 1-16.

              16.      Maximum disjoint paths of bounded and definite length, (with A. Itai and Y. Shiloach), in Networks, 12 (1982) 277-286.

              17.       An efficient implementation of an algorithm for min-max tree partitioning, (with R.I. Becker and S.R. Schach), Quaest Informaticae, 2 (1982) 23-26.

              18.      Efficient optimization of monotonic functions on trees, (with Y. Shiloach), SIAM Journal of Algebric and Discrete Methods, 4 (1983) 512-516.

              19.      Shifting Algorithms for tree partitioning with general weighting functions, (with R.I. Backer), Journal of Algorithms, 4 (1983) 101-120.

              20.      Circuit partitioning with size and connection contraints, (with M. Snir), Networks, 13 (1983) 365-375.

              21.      Is text compression by prefixes and suffixes practical?, (with A.S. Fraenkel and M. Mor), Acta Informatica, 20 (1983) 371-389.

              22.      Optimum split trees, Journal of Algorithms, 5 (1984) 367-374.

              23.      Heuristics for finding a maximum number of disjoint bounded paths, (with D. Ronen), Networks, 14 (1984) 531-544.

              24.      K­Cluster and dominating set in pefect graphs, (with D.G. Corneil), Discrete Applied Mathematics, 9 (1984) 27-39.

              25.      On scheduling the construction of a tree, (with A. Israeli), Annals, of Discrete Mathematics, 20 (1984) 325-326.

              26.      Cographs: recognition, applications and algorithms, (with D.G. Corneil and L. Stewart­Burlingham), Congresus Numeratium, 43 (1984) 249-258.

              27.      Finding the two­core of a tree, (with R.I. Becker), Discrete Applied Mathematics, 11 (1985) 103-113.

              28.      Linear recognition of cographs, (with D.G. Corneil and L. Stewart­Burlingham), SIAM J. of Computing, 14 (1985) 926-934.

              29.      Efficient implementation of a shifting algorithms, (with U. Vishkin), Discrete Applied Mathematics, 12 (1985) 71-80.

              30.      Digraphs with maximum number of paths and cycles, Networks, 17 (1987) 295-305.

              31.      Better understanding of Batcher's merging networks, Discrete applied Mathematics 25 (1989) 257-271.

              32.      The periodic balanced sorting network, (with M. Dowd, L. Rudolph and M. Saks), JACM 36 (1989) 738-757.

              33.      Best location of service centers in a tree like network under budget constraints (with J. McHugh), Discrete Math. 86 (1990) 199-214, also appears in Topics on Domination by S. T. Heletniemi and R. C. Laskar, Annals of Discrete Mathematics, Vol. 48.

              34.      Towards a bound for the compression of the LZW Algorithms (with A.K. Srivastava and S. Gupta) Congresus Numeratium, 76 (1990) 89-100.

              35.      Structure and Semantics in OODB class Specifications, (with J. Geller and E. J. Neuhold), invited paper, SIGMOD record, special issue on Semantic Issues in Multi­database Systems, 20 (1991) 40-43.

              36.      Arithmetic interpolation search for Alphabetic tables, (with G. Loizos) IEEE trans.on Computers (1992) 493-499.

              37.      Structural Schema Integration with Full and Partial Correspondence using the Dual Model, (with J. Geller, E. Neuhold, and A. Sheth), Information Systems, 17 (6) 1992, pp. 443-464.

              38.      Structural Integration: Concepts and Case Study, (with J. Geller, P. Cannata, A. Sheth, and E.J. Neuhold) Journal of Systems Integration, 1993, 3(2), pp. 131-161.

              39.      A shifting algorithm for constrained Min­Max partition on trees, (with E. Agasi and R.I. Becker), Discrete Applied Mathematics 45(1993) 1-28.

              40.      Most uniform path partitioning and its use in image processing, (with M. Lucertini and B. Simeone) in Discrete Applied Mathematics, 45 (1993) 1­-2.

              41.      The Shifting Algorithm Technique for the Partitioning of Trees, (with R. I. Becker) Discrete Applied Mathematics, 62 (1995) 15­-34 (Invited paper for a special issue on Partitioning)

              42.      Computing Access Relevance for Path­Method Generation in OODBs and IM­OODB, (with A. Mehta, J. Geller, P. Fankhauser), Journal of Intelligent Information Systems, 7, 75­-100 (1996)

              43.      The OODB path­method generator (PMG) using access weights and precomputed Access relevance, (with Ashish Mehta, James Geller and Erich Neuhold), VLDB Journal, 7, 25­-47 (1998).

              44.      An OODB Part­Whole model:semantics, notation and implementation, (with M. Halper and J. Geller), Data and Knowledge Engineering, 27, 59-­95 (1998).

              45.      The new class of g­Chain Periodic Sorters, (with R. Becker, D. Nassimi), Journal of Parallel and Distributed Computing, 54, 206-­222, (1998).

              46.      Controlled vocabularies in OODBs: Modeling Issues and Implementation, (with Li­min Liu, M. Halper and J. Geller), Distributed and Parallel Databases, 7(1), pp. 37­-65, (1999).

              47.      A Methodology for Partitioning a Vocabulary Hierarchy into Trees, (with H. Gu, J. Geller, M. Halper and M. Singh), Artificial Intelligence in Medicine, 15(1), pp. 77­-98, (1999).

              48.      Benefits of an Object­oriented Database Representation for Controlled Medical Terminologies, (with H. Gu, J. Geller, and M. Halper) Journal of the American Medical Informatics Association, 6(4), pp. 283­-303, (1999).

              49.      Representing the UMLS as an OODB: Modeling Issues and Advantages, (with H. Gu, J. Geller, and M. Halper, L. Liu, and J. Cimino ), Journal of the American Medial Informatics Association, pp. 66­-80, (2000).

                  1.      Partitioning an Object-Oriented Terminology Schema,(with H. Gu, J. Geller, M. Halper, F. Kuo, and J. Cimino ), Methods in Medical Informatics, 40(3), pp. 204­-212, (2001).

                  2.      Using OODB Modeling to Partition a Vocabulary into Structurally and Semantically Uniform Concept Groups, (with L. Liu, J. Geller, and M. Halper), IEEE Transactions on Knowledge and Data Engineering, 14(4), pp. 850-866, 2002.

                  3.      Partitioning the UMLS Semantic Network, (with Z. Chen, M. Halper, J. Geller, H. Gu), IEEE Transactions on Information Technology in Biomedicine, 6(2), pp. 102-108, 2002.

                  4.      Evaluation and Application of a Semantic Network Partition, (with J. Geller, M. Halper, Z. Chen and H. Gu), IEEE Transactions on Information Technology in Biomedicine, 6(2), pp. 109-115, 2002.

                  5.      Semantic refinement and error correction in large terminological knowledge bases, (with James Geller, Huanying Gu, and Michael Halper), Data & Knowledge Engineering, 45(1), 2003, pp. 1-32.

                  6.      The cohesive metaschema: a higher-level abstraction of the UMLS Semantic Network, (with Zong Chen, Michael Halper, James Geller, Li Zhang and Yi Peng), Journal of Biomedical Informatics, 35(3), June 2003, pp. 194-212.

                  7.      Enhancing OODB semantics to support browsing in an OODB vocabulary representation, (with Li-min Liu, James Geller), Concurrency and Computation: Practice and Experience, 15(9), August 2003, pp. 845-869.

                  8.      Frameworks for Incorporating Semantic Relationships into Object-oriented Systems, (with M. Halper, L. Liu, and J. Geller), Concurrency and Computation: Practice and Experience, 15, December 2003, pp.1337-1362.

                  9.      Guest Editors’ Introduction to the special issue: Research on structural issues of the UMLS --- past, present and future, (with J. Geller), Journal of Biomedical Informatics, 36(6), December 2003, pp. 409-413.

              10.      Consistency Across the Hierarchies of the UMLS Semantic Network and Metathesaurus, (with J. J. Cimino and H. Min), Journal of Biomedical Informatics, 36(6), December 2003, pp. 450-461.

              11.      Designing Metaschemas for the UMLS Enriched Semantic Network, (with L. Zhang, M. Halper, J. Geller), Journal of Biomedical Informatics (JBI), 36(6), December 2003, pp. 433-449.

              12.      An Enriched Unified Medical Language System Semantic Network with a Multiple Subsumption Hierarchy, (with L. Zhang, M. Halper, J. Geller and J. J. Cimino), Journal of the American Medial Informatics Association, 11(3), March 2004, pp.195-206.

              13.      Contextual Partitioning for Comprehension of OODB Schemas, (with H. Gu, M. Halper, J. Geller and E. Neuhold), Knowledge and Information Systems(KAIS), 6(3), May 2004, pp.315-344.

              14.      Auditing Concept Categorizations in the UMLS, (with H. Gu, G. Elhanan, H. Min, L. Zhang, and Y. Peng), Artificial Intelligence in Medicine, 31(1), May 2004, pp. 29-44.

              15.      A lexical metaschema for the UMLS semantic network, (with L. Zhang, M. Halper, J. Geller and G. Hripcsak), Artificial Intelligence in Medicine, 33(1), January 2005, pp.41-59.

              16.      Guest Editors’ Introduction to the special issue on Ontologies: Ontology Challenges: A Thumbnail Historical Perspective, (with J. Geller and J. Lee), Knowledge and Information Systems, 6(4), pp.375-379, July 2004.

              17.      An expert study evaluating the UMLS lexical metaschema, (with L. Zhang, G. Hripcsak, M. Halper and J. Geller), Artificial Intelligence in Medicine, 34(3), pp. 219-233, July 2005.

              18.      Relationship Structures and Semantic Type Assignments of the UMLS Enriched Semantic Network, (with L. Zhang, M. Halper, J. Geller and J. J. Cimino), JAMIA, 2005 Nov-Dec;12(6):657-66. Epub 2005 July 27.