Some of the publications below are presented in the electronic format for the purpose of non-commercial dissemination of scientific information. Their availability does not imply that I relinquish my author's rights. You may copy any paper for scholarly, but not commercial purposes, provided you agree to respect the author's copyright.

Publications (journals and conferences)


2016

1. "On degree-coloring of multigraphs"; arXive: 1612.08306; (pdf)
   
   2015
   
2. "Extracting Hidden Groups and their Structure from Streaming Interaction Data" (with Mykola Hayvanovych, Malik Magdon-Ismail, William A. Wallace) arXiv: 1502.04154: (pdf)
   
   2012
   
   
3. "Identifying Long Lived Social Communities Using Structural Properties," (with Malik Magdon-Ismail and James Thompson); Proceedings of 4th International on Advances in Social Networks Analysis and Mining (ASONAM), Istanbul, Turkey, August 2012. (pdf)
4. "Graph Search Beyond Text: Relational Searches in Semantic Hyperlinked Data," (with J. Greenman, B. Gutting, M. Magdon-Ismail, J. Schwartz, W. Wallace) Proceedings of 10th International Conference on Intelligence and Security Informatics (ISI), Washington DC, June 2012. (pdf)
5. "Information Cascades in Social Media in Response to a Crisis: a Preliminary Model and a Case Study," (with Cindy Hui, Yulia Tyshchuk, William Al Wallace , Malik Magdon-Ismail); Proc. 1st International Workshop on Social Web in Disaster Management Workshop at World Wide Web (WWW 2012), Lyon, France, Apr 17, 2012 (pdf)
6. "Defining and Discovering Communities in Social Networks," (with. Kelley, Magdon-Ismail, Mertsalov, and Wallace); Chapter 6 in Handbook of Optimization in Complex Networks, eds. M. Thai and P. Pardalos, 2012; ISBN-978-1-4614-0753-9. (pdf)
7. "Toward Efficient Search for a Fragment Network in a Large Semantic Database," (with J. Greenman, B. Gutting, M. Magdon-Ismail, J. Schwartz, W. Wallace) Proc.6th Annual Network Science Workshop, West Point, April 2012 (pdf)
   
   2011
   
   
8. ``Detecting overlapped functional clusters in resting state fMRI with Connected Iterative Scan: A graph theory based clustering algorithm'' (with Xiaodan Yan, Stephen Kelley, and Bharat B. Biswal); Journal of Neuroscience Methods 199 (2011), pp. 108 - 118. (pdf)
   
9. "Embedding a Forest in a Graph," (with M. Magdon-Ismail), Electronic Journal of Combinatorics (EJC), Volume 18(1), P99, Apr 29, 2011, (pdf)
   
10. "Tracking and Predicting Evolution of Social Communities," (with M. Magdon-Ismail; S. Nambirajan, J. Thompson); Proc. 3rd IEEE International Conference on Social Computing (SocialCom2011), MIT, Boston, MA, Oct 9-11 2011; (pdf)
11. "Aborting a Message Flowing Through Social Communities," (with C. Hui, Malik Magdon-Ismail, W. Wallace); Proc. 3rd IEEE International Conference on Social Computing (SocialCom2011), MIT, Boston, MA, Oct 9-11 2011; (pdf)
12. "Effectiveness of Information Retraction," (with. Hui, Malik Magdon-Ismail, W. Wallace); 1st IEEE International Workshop on Network Science (NSW 2011), West Point, NY, June 22-24, 2010; (pdf)
    
    2010
    
    
13. "Finding Overlapping Communities in Social Networks", (with S. Kelley, M. Magdon-Ismail, and W. Wallace), Proc. 2nd Confernence on Social Computation (SocialCom), pages 104-113, Aug 20-22, Minneapolis, Minnesota, 2010; also appeared (poster) in Proc. Workshop on Social Network Analysis (SNAKDD) at KDD, pages 43-52, July 25-28, Washington, DC, 2010 (pdf)
14. "Weak Ties and the Diffusion of Information in Dynamic Networks", (with C. Hui, M. Magdon-Ismail, and W. Wallace), NetSci 2010, poster presentation, Boston, MA.   (pdf);
15. "Agent Based Simulation of Diffusion of Warnings" (with C. Hui, M. Magdon-Ismail, and W. Wallace), Proc. Agent-Directed Simulation Symposium (ADS), pages (), Orlando FL, April 12-May 14, 2010. ( best paper award )   (pdf)
16. "Simulating the Diffusion of Information: An Agent-Based Modeling Approach" (with C. Hui, M. Magdon-Ismail, and W. Wallace), International Journal of Agent Technologies and Systems, pages (31-46), July-September, 2010, Vol. 2, No. 3.   (pdf)
17. "Measuring Behavioral Trust in Social Networks," (with S. Adali, R. Escriva, M. Hayvanovych, M. Magdon-Ismail, B. Szymanski, W. Wallace and G. Williams); IEEE International Conference on Intelligence and Security Informatics (ISI 2010) pp. 150 - 152, Vancouver, BC, May 23 - 26, 2010.   (pdf)
18. "Measuring Similarity Between Sets of Overlapping Clusters," (with M. Hayvanovych and M. Magdon-Ismail), Proc. Workshop on Social Network Analysis (SNAKDD) at KDD, pages 62-68, July 25-28, Washington, DC, 2010; also appeared in Proc. Workshop on Social Intelligence (SIN) at SocialCom, pages 303-308, Aug 20-22, Minneapolis, Minnesota, 2010   (pdf)
    
    2009
    
    
19. "Models of Communication Dynamics for Simulation of Information Diffusion" (with Konstantin Mertsalov and Malik Magdon-Ismail), Proceedings of Advances in Social Networks Analysis and Mining (ASONAM 2009) pp. 44-49, 2009   (pdf)
20. "Stability of Individual and Group Behavior in a Blog Network" (with Stephen Kelley, Malik Magdon-Ismail, and Konstantin Mertsalov), Proceedings 2009 IEEE International Conference on Intelligence and Security Informatics"; pp. 7-12, 2009   (pdf)
    
21. "graphOnt: An Ontology Based Library for Conversion from Semantic Graphs to JUNG" (with Stephen Kelley, Malik Magdon-Ismail, Konstantin Mertsalov, William Wallace, and Mohammed Zaki), Proceedings 2009 IEEE International Conference on Intelligence and Security Informatics"; pp. 170-172, 2009.   (pdf)
22. "The Impact of Changes in Network Structure on Diffusion of Warnings," (with C. Hui, M. Magdon-Ismail, and W. Wallace); Proc. Workshop on Analysis of Dynamic Networks (SIAM International Conference on Data Mining), 2009   (pdf)
    
    2008
    
    
23. "Reverse Engineering an Agent-Based Hidden Markov Model for Complex Social Systems," (with Hung-Ching (Justin)  Chen;   Malik  Magdon-Ismail,   William A. Wallace), International Journal of Neural Systems, Vol. 18; No 6; pp. 491-526; 2008.   (pdf)
    
24. "Discovery, analysis and monitoring of hidden social networks and their evolution" (with M. Hayvanovych.; A. Hoonlor; S. Kelley; M. Magdon-Ismail; K. Mertsalov; B. Szymanski; W. Wallace); 2008 IEEE Conference on Technologies for Homeland Security; 12-13 May 2008 Page(s):1 - 6; Digital Object Identifier 10.1109/THS.2008.4637294   (pdf)
    
25. "Micro-Simulation of Diffusion of Warnings," (with C. Hui, M. Magdon-Ismail, and W. Wallace); In Proceddings of the 5th International Conference on Information Systems for Crisis Response and Management ISCRAM2008 (Eds. F. Fiedrich and B. Van de Walle); pp. 424-430; 2008.   (pdf)
    
26. "Discovering Hidden Groups in Communication Networks," (with J. Baumes, M. Magdon-Ismail, W. Wallace) a chapter in ``Security Informatics and Terrorism: Patrolling the Web'', 2008, pp.82-108, NATO Science for Peace and Security Series, Sub-series D: Information and Communication Security; eds. Cecilia S. Gal, Paul B. Kantor, and Bracha Shapira.   (pdf)
    
27. "A Generative Model for Statistical Determination of Information Content from Conversation Threads" (with Yingjie Zhou, Malik Magdon-Ismail, and William Wallace), IEEE ISI 2008 International Workshops: PAISI, PACCF, and SOCO 2008; Springer Lecture Notes in Computer Science, No. 5075, pp. 331-342, 2008   (pdf)
    
28. "Communication Dynamics of Blog Networks," (with S.  Kelley,   M.  Magdon-Ismail,   K.  Mertsalov, and   W.  Wallace) Proceedings SIGKDD Workshop on Social Network Mining and Analysis, ACM Digital Library; August 2008.   (pdf)
    
29. "Stable Statistics of the Blogograph,"(with Stephen  Kelley,   Malik  Magdon-Ismail,   Konstantin  Mertsalov); in Proceedings of ISIPS 2008: Interdisciplinary Studies in Information Privacy and Security, May 12, 2008.   (pdf)
    
30. "A Locality Model for the Evolution of Blog Networks," (with Stephen  Kelley,   Malik  Magdon-Ismail,   Konstantin  Mertsalov). in Proceedings of 2008 IEEE International Conference on Intelligence and Security Informatics, pp. 191-193; June 17 - 20, Taipei, Taiwan.   (pdf)
    
    2007
    
    
31. Inferring Agent Dynamics from Social Communication Networks," (with Hung-Ching (Justin)  Chen;   Malik  Magdon-Ismail,   William A. Wallace), Proc. International Conference on Intelligent Data Engineering and Automated Learning (IDEAL), December 16-19, Birmingham, UK, 2007   (pdf)
    
32. "Discover the power of social and hidden curriculum to decision making: Experiments with Enron email and movie newsgroups" (with H.C. (Justin) Chen, M. Magdon-Ismail, Al Wallace). In Proc. International Conference on Machine Learning and Applications (ICMLA), Cincinnati, Ohio, December 13-15 2007.
33. "ViSAGE: A Virtual Laboratory for Simulation and Analysis of Social Group Evolution," (with Hung-Ching  Chen,   Jeffrey  Baumes,   Matthew   Francisco, Malik  Magdon-Ismail,   Al Wallace)   (pdf) ACM Transactions on Autonomous and Adaptive Systems; Vol. 3, Issue 3 (Aug. 2008), pp. 1 - 35.
34. "Learning what makes a society tick," (with Hung-Ching (Justin)  Chen;   Malik  Magdon-Ismail,   William A. Wallace), Proceedings Worksop on Optimization-based Data Mining Techniques with Applications at the Seventh IEEE International Conference on Data Mining (ICDM), October 28-31, Omaha, NE; October 28-31;   (pdf)
    
35. "Inferring Agent Dynamics from Social Communication Network," (with Hung-Ching (Justin)  Chen,   Malik  Magdon-Ismail,   William A. Wallace), Proc. Joint 9th Web Mining (WebKDD) and 1st Social Network Analysis (SNA-KDD) Workshop and KDD 2007, August 12-15, San Jose, CA, 2007.   (pdf)
    
36. "SIGHTS: A Software System for Finding Coalitions and Leaders in a Social Network," (with J. Baumes,   M. Hayvanovych,   S. Kelley,   M. Magdon-Ismail,   K. Mertsalov,   W. Wallace), IEEE International Conference on Intelligence and Security Informatics (ISI 2007); New Brunswick; May 23-24; pp.193-199; 2007   (pdf)
    
37. "Identification of Hidden Groups in Communications," with J. Baumes, M. Magdon-Ismail, W. Wallace; chapter in Handbooks in Information Systems, Volume 2: National Security, 2007; Elsevier.
38. "Clusters in a multigraph with elevated density,"   The Electronic Journal of Combinatorics; Volume 14(1), R10; 2007;   (pdf)
    
39. "Strategies for Cleaning Organizational Emails with an Application to Enron Email Dataset", with Yingjie Zhou, Malik Magdon-Ismail, Al Wallace; 5th Conf. of North American Association for Computational Social and Organizational Science (NAACSOS 07), Emory - Atlanta, Georgia, June 7-9, 2007.   (pdf)
    
    2006
    
    
40. "Social Capital Experiments", (with J. Baumes,   H.-C. Chen,   M. Francisco,   M. Magdon-Ismail,   W. Wallace), 4th Conf. of North American Association for Computational Social and Organizational Science (NAACSOS 06), Notre-Dame, Indiana, June 22 - 23, 2006; (pdf)
    
41. "Finding Hidden Group Structure in a Stream of Communications", (with J. Baumes,   M. Hayvanovych,   M. Magdon-Ismail,   W. Wallace,   M. Zaki), IEEE International Conference on Intelligence and Security Informatics (ISI 2006); San Diego; May 23-24; pp.201-212; 2006   (pdf)
    
42. "Using Agent-Based Modeling to Traverse Frameworks in Theories of the Social," with Matthew Francisco, Jeffery Baumes, Hung-Ching Chen, Malik Magdon-Ismail, Al Wallace, International Conference on Complex Systems (ICCS06), Boston, MA, June 25-30, 2006. postscript, pdf. Slides: postscript, pdf.
43. "Performance Characterization of a Reconfigurable Planar Array Digital Muicrofludic System," (with E. J. Griffith,   S. Akella), IEEE Transactions on Computer-Aided Design of Integrated Circuits and Sustems, Special Issue on Design Automation Methods and Tools for Microfluidic-Based Biochips, Vol. 25, N o. 2, pp. 340-352, Feb. 2006.   (pdf)
    
    2005
    
    
44. "Efficient Identification of Overlapping Communities," (with J. Baumes,   M. Magdon-Ismail), Lecture Notes in Computer Science; ISSN 0302-9743; Vol 3495; pp. 27 - 36; 2005; IEEE International Conference on Intelligence and Security Informatics (ISI 2005); Atlanta; May 19-20; 2005   (pdf)
    
45. "Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs" (with D. Hollinger,  M. Magdon-Ismail), Proceedings of Workshop on Experimental Algorithms, WEA 2005   (pdf)
    
46. "Detecting Conversing Groups of Chatters: A Model, Algorithms and Tests," (with S. Camtepe,  M. Magdon-Ismail, and M. Krishnamoorthy, Proceedings of IADIS International Conference Applied Computing 2005.     (doc)
    
47. "Finding Communities by Clustering a Graph into Overlapping Subgraphs," (with J. Baumes,  M.  Krishnamoorthy, M. Magdon-Ismail,   and N.  Preston), Proceedings of IADIS International Conference Applied Computing 2005; pp. 97 - 104; 2005.   (doc)
    
48. "Dynamics of Bridging and Bonding in Social Groups: A Multi-Agent Model," (with J. Baumes, H.-C. Chen, M. Francisco, M. Magdon-Ismail, A. Wallace); Electronic Proceedings of North American Association for Computational Social and Organizational Science (NAACSOS 2005), Notre Dame, IN, USA, June 26-28, 2005.
49. "Discovering Optimization Algorithms Through Automated Learning," (with E. Breimer,   D. Hollinger,   and D. Lim), DIMACS Series in Discrete Mathematics and Theoretical Computer Science,   Graphs and Discovery, Volume 69, pp. 7 - 25, 2005 (pdf)
    
    2004
    
50. "Identifying Multi-Users in Open Forums," (with H-C. Chen,   and M. Magdon-Ismail), 2nd NSF/NIJ Symposium on Intelligence and Security Informatics (ISI 04), Tuscon, AZ, June 11 - 12, 2004; Springer  (pdf)
    
51. "Discovering Hidden Groups in Communication Networks," (with J. Baumes,   M. Magdon-Ismail,   and W.  Wallace), 2nd NSF/NIJ Symposium on Intelligence and Security Informatics (ISI 04) Tuscon, AZ, June 11 - 12, 2004; Springer   (pdf)
    
    
    2003
    
52. "Statistical Modeling of Social Groups in Communication Networks," (with P. Horn,   M. Magdon-Ismail,   W. Wallace,   J. Riposo,   D. Siebecker,   and B. Yener). Proceedings of NAACSOS ( North American Association for Computational, Social, and Organizational Sciences), June 22 - 25, 2003 (pdf)
    
53. "Locating Hidden Groups in Communication Networks Using Hidden Markov Models," (with M. Magdon-Ismail;   W. Wallace,   and D. Siebecker) Proceedings of the NSF/NIJ Symposium on Intelligence and Security Informatics, June 2003; pp. 126--137.   (pdf)
    
54. "A Learning Algorithm for the Longest Common Subsequence Problem," Proceedings of Algorithms and Experiments (ALENEX2000), pp. 96-105; ("The Journal of Experimental Algorithmics", Volume 8; 2003); (with E. Breimer, D. Lim). (pdf)
55. "The Graph Isomorphism Problem," in Handbook of Graph Theory (CRC Press), pp. 68-78, 2003.
    
    2002
    
56. "Improving Shotgun Sequencing Through Learning," Currents in Computational Molecular Biology, RECOMB 2002, pp. 72 - 73, (with D. Lim). (pdf)
57. "Learning Significant Alignments: An Alternative to Normalized Local Alignment," Proceedings of the International Symposium on Methodologies for Intelligent Systems, pp. 37 - 45; (with E. Breimer), June 2002, Lyon, France. (pdf)
58. "A Supervised Learning Approach for Detecting Significant Local Alignments," Currents in Computational Molecular Biology, RECOMB 2002, pp. 26 - 27, (with E. Breimer). (pdf)
    
    2001
    
59. "A Learning Algorithm for String Assembly," BIOKDD01: Workshop on Data Mining in Bioinformatics (with SIGKDD01 Conference), August 2001. (with D. Lim and M. Magdon-Ismail) (pdf)
60. "A Learning Algorithm for the Shortest Superstring Problem," Proceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technology, pp. 171-175, (March 15 -17, 2001, Durham, North Carolina, USA) (with D. Lim). (pdf)
61. "On the height of a random set of points in a d-dimensional unit cube," Journal of Experimental Mathematics, Vol 10, No 2, (2001), pp. 583-597, (with E. Breimer, B. Kolstad, and M. Magdon-Ismail). (pdf)
    
    2000
    
62. "LINK: A system for graph computation," Software Practice & Experience, 30(11), pp. 1285 - 1302, (2000) (with J. Berry, N. Dean, G. Shannon, and S. Skiena). (pdf)
    
    1999
    
63. "Path Optimization for Graph Partitioning Problems," Discrete Applied Mathematics, (90), pp. 27-50, 1999; (with J. Berry). (pdf)
    
    1998
    
64. "Designing Algorithms by Sampling" Proceedings of Algorithms and Experiments, Trento, Italy, Feb. 9 -11 (1998); also, Discrete Applied Mathematics, 110, (2001), pp. 59 - 75; (with D. Hollinger). (pdf)
    
    1997
    
65. "Graph drawing and manipulation with LINK," in Lecture Notes in Computer Science, 1353, pages 425-437. Springer Verlag, 1997 (with J. Berry, N. Dean, G. Shannon, and S. Skiena). (pdf)
    
    1996
    
66. "Constructing cliques using restricted backtracking," Cliques, Colorings, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, (1996), pp. 89-102, (with R. Rivenburgh). (pdf)
    
    1995
    
67. "Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study," Proceedings of Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, (1995), pp. 223 - 232 (with J. Berry). (pdf)
68. "Inverting Sets and the Packing Problem," Graph Theory, Combinatorics, Algorithms, and Applications, (1995) Vol. 1, pp. 445-456; John Wiley Sons, Inc.; (with V. Faber, M. Knill, T. Spencer). (pdf)
69. "LINK, a workbench for research and education in discrete mathematics," (1995) DIMACS TR 95-15; (with J. Berry, N. Dean, P. Fasel, E. Johnson, J. MacCuish, G. Shannon, S. Skiena).
70. "A Low-Exponential Algorithm for Counting Vertex Covers," Graph Theory, Combinatorics, Algorithms, and Applications, (1995), Vol. 1, pp. 431-444; John Wiley Sons, Inc.; (with D. Berque, T. Spencer) (pdf)
71. "Toward Computing m(4)," Ars Combinatoria, 39 (1995), pp.139 - 148, (with H. Russell). (pdf)
    
    1993
    
72. "An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size," SIAM J. of Discrete Mathematics, (1993) Vol. 6, No. 3, pp. 443-459, (with T. Spencer) (pdf)
73. "Heuristics for the Packing Problem," RPI, Computer Science, Technical Report 93-8, (1993) (with U. Mahadevan)
74. "MAP: an Interactive System for Clone Assembly" (User Manual), RPI, Computer Science, Technical Report 93-16 (1993) (with Mark Mundt, Reid Rivenburgh, Cari Soderland).
75. "Implementing Progress Indicators for Recursive Algorithms, " Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing, February 14-16, 1993, pp. 533 - 538 (with Dave Berque, Jeffrey Edmonds). (pdf)
    
    1992
    
76. "A Problem in Machine-Tool Design," SIAM Review,Vol. 34, No. 1, pp. 114-117, (1992), (with D. Powers).
77. "The SetPlayer System for Symbolic Computation on Power Sets, " Journal of Symbolic Computation, 14, (1992), pp. 645 - 662, (with D. Berque, R. Cecchini, R. Rivenburgh). (pdf)
78. "Monitoring an Algorithm's Execution," Computational Support for Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 15, pp. 153 - 163, (1992), (with D. Berque). (pdf)
    
    1991
    
79. "The SetPlayer System: An Overview and a User Manual," RPI, Computer Science, Technical Report 91-17, June 1991 (with D. Berque, R. Cecchini, R. Rivenburgh)
80. "StringWatcher: An Extensible Device for Analyzing Strings," RPI, Computer Science, Technical Report 91-20, July 1991 (with R. Rivenburgh)
    
    1989
    
81. "A New Parallel Algorithm for the Maximal Independent Set Problem," SIAM J. of Computing, 1989, Vol. 18, No. 2, pp. 419-427 (with T. Spencer) (pdf)
82. "Constructing a Maximal Independent Set in Parallel," SIAM Journal on Discrete Mathematics, 1989, Vol. 2, No. 3, pp. 322-328 (with T. Spencer). (pdf)
    
    1988
    
83. "A Parallel Algorithm for the Bisection Width in Trees," Comp. Math. Applic., Vol. 15, No. 4, pp. 259-266, 1988 (with Z. Miller).
84. "Cutting a Graph into Two Dissimilar Halves," Journal of Graph Theory, 1988, Vol. 12, No. 1, pp. 121-131 (with P. Erdòs, J. Pach, and J. Spencer). (pdf)
    
    1987
    
85. "A New Heuristic Approach to the Permutation Flowshop Problem," International Conference on Optimization Techniques and Applications , Singapore, April 8-10, 1987, pp. 525-531 (with Eng-Joo Lee and Pitu Mirchandani).
86. "Parallel Algorithms for Three Graph Problems," Congressus Numerantium, January 1987, Vol. 54, pp. 111-121.
    
    1986
    
87. "Two Problems in Algorithmic Graph Theory," in Notes of New York Graph Theory Day, XII, 1986 (p. 25).
88. "Heuristics for the Graph Bisection Problem," RPI, Computer Science Department, Technical Report 86-8, 1986 (with Sukriti Lath and John W. Roberts).
    
    1985
    
89. "Lower and Upper Bounds for the Bisection Width of a Random Graph," Congressus Numerantium, Vol. 49, 1985, 19-25 (with J.F. Lynch).
    
    1984
    
90. "A Non-Factorial Algorithm for Canonical Numbering of a Graph," Journal of Algorithms, 1984, Vol. 5, pp. 345-362 (with D. Corneil).
91. "An Approximate Algorithm for the Edge-Coloring Problem," Congressus Numerantium, December 1984, Vol. 43, pp. 317-362.
92. "On the Minimal Cut Problem," In Progress in Graph Theory, 1984, ed. by J. Adrian Bondy and U.S.R. Murty, pp. 295-305, Academic Press, Canada (with R. Gardner).   (pdf)
93. "The Development of Combinatorics in the USSR (A Brief Historical and Mathematical Survey)," Monograph Series on Soviet Union; Delphic Association, Inc., 1984.
94. "Edge-Coloring of Multigraphs; Recoloring Technique," Journal of Graph Theory, 1984, Vol. 8, No. 1, pp. 121-137.
    
    1983
    
95. "Heuristic Improvement Technique for Bisection of VLSI Networks, " Proceedings of IEEE International Conference on Computer Design: VLSI in Computers, 1983 (with M. Burstein); also,IBM Research Report, 10069 (#44763), 7/12/83, 9 pages. (pdf)
96. "A Non-factorial Algorithm for the Graph Isomorphism Problem," Discrete Applied Mathematics, 1983, Vol. 6, pp. 229-236.
    
    1982
    
97. "A Method for the Construction of Class Two Graphs," Congressus Numerantium, 1982, Vol. 32, 365-374.
98. "On Graph Certificates," Congressus Numerantium, 1982, Vol. 35, pp. 181-189 (with D. neil).
    
    1981
    
99. "Construction of Class Two Graphs with Maximum Vertex Degree 3," J. of Combinatorial Theory, Series B, 1981, Vol. 31, No. 3, pp. 282-291.
    
    Before 1980
    
100. Critical Graphs with an Even Number of Vertices, Sakharth. SSR Mech. Acad. Moambe, 1979, Vol. 94, pp. 25-27 (in Russian).
101. On Graphs with Degree 3 and Chromatic Index 4, Sakharth. Mech. Acad. Moambe, 1979, Vol. 93, pp. 29-31, (in Russian).
102. A Composition of a Construction Project According to Variable Schemes, Housing Construction, 1979, Vol. 10 (in Russian), (with O. Jgamadze and I. Klipker.)
103. Minimization of power knots for the assembly of complex tools, Vycizl. Mat. i Vycizl. Tehn., 1978, Vol 4, pp. 9-13, (in Russian), (with B.M. Borshevsky, and E.J. Tomchuk).
104. Structure of Multigraphs with Restrictions on the Chromatic Class, Discret. Analiz, 1977, Vol. 30, pp. 3-12, (in Russian).
105. A Minimal Placement of a Tree on the Line, Techn. Rep. Phys. Techn. Institute of Low Temperatures, Kharkov, 1976 (in Russian), (with I. Klipker); a photocopy: (pdf)
106. An Algorithm for a Minimal Placement of a Tree on a Line,Sakharth. SSR Mech. Acad. Moambe, 1976, Vol. 83, pp. 553-556 (in Russian), (with I. Klipker).
107. Placement of Uniform Trees on the Line, Gamqueneb. Mat. Inst. Sem. Mohsen. Aontacie, 1975, Vol. 10, pp. 65-71 (in Russian), (with I. Klipker).
108. A Remark on the Chromatic Class of a Multigraph, Mat. i. Vycisl. Tehn., 1974, Vol. 5, pp. 128-130, (in Russian).
109. On Multigraphs of almost Maximal Chromatic Class, Discret. Analiz, 1973, Vol. 23, pp. 3-7, (in Russian).
110. Odd Cycles of a Multigraph with a Large Chromatic Class, Upravliaemye Systemy, 1972, Vol. 10, pp. 46-47 (in Russian).
111. On a combinatorial problem that arises when designing a drilling unit, Vestnike Kharkov Gos. Univ. (ser. Ekonomika), 1972 (in Russian), (with L. Levitska).
112. A Reinforcement for the theorem of Gouila-Uri, Vycizl. Mat. i Vycizl. Tehn., 1971, Vol. 2, pp. 56-61, (in Russian), (with L. Stanovsky and L. Levitska)
113. On the Length of a Minimal Round of a Strongly Connected Graph, Kibernetica, 1969, pp. 79-82 (in Russian), English Translation: Cybernetics, 1972, Vol. 5, No. 1, pp. 95-98 (with V. Vizing).
114. Estimations for a Radius and Diameter of a Strongly Connected Graph, Upravliaemye Systemy, 1969, Vol. 2, pp. 92-99 (in Russian).
115. On Minimal Universal Trees, Mat. Zametki, 1968, Vol. 4, pp. 371-378 (in Russian) English Translation: Mathematical Notes, 1968, Vol. 4., No. 3, pp. 713-718 (with E. Livschitz).
116. The Diameter of a Strongly Connected Graph, Dokl. Akad. Nauk., 1966, Vol. 170, No. 4, pp. 767- 769, (in Russian). English Translation: Sov. Math Doklady, 1966, Vol. 7, No. 5, pp. 1267- 1270.
117. Applications of the Method of Contractions to Strongly Connected Graphs, Narodn. Mathem. Konf. Molod., Part II, Akad. Nauk Ukr. SSR, Kiev, 1965, pp. 155-161 (in Russian).
118. Some Applications of the Contraction Operation to Strongly Connected Graphs, Uspehi Matematicheskyh Nauk 1965, Vol. 20, No. 5, pp. 203-205 (in Russian).
119. Stable Equivalences of Finite Graphs, Dopovidi Akad. Nauk Ukr. SSR, 1965, pp. 1009-1011 (in Ukrainian).
     
     Submitted
120. "Graph Search Beyond Text" (with Christopher J. Gatti, Malik Magdon-Ismail, John Schwartz, and William Wallace) (submitted for publication)
121. "Experimental Analysis of Heuristic Algorithms for Structural Controllability of Graphs" (with Lily Briggs and Mukkai Krishnamoorthy) (submitted for publication)
122. "Bounds for symmetric difference and twist of sets" (submitted for publication)