Publications

Journal Articles

The versions that are available on-line may not be quite as recent as the actual published versions. For example, they do not reflect changes to the galleys.

  1. M. B. Dillencourt, Traveling Salesman Cycles Are Not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations, Information Processing Letters, 24(5), March 1987, 339-342.
  2. M. B. Dillencourt, A Non-Hamiltonian Delaunay Triangulation, Information Processing Letters, 25(3), May 1987, 149-151.
  3. M. B. Dillencourt, An Upper Bound on the Shortness Exponent of Inscribable Polytopes, Journal of Combinatorial Theory Series B, 46(1), February 1989, 66-83.
  4. R. E. Webber and M. B. Dillencourt, Compressing Quadtrees via Common Subtree Merging, Pattern Recognition Letters, 9(3), April 1989, 193-200.
  5. M. B. Dillencourt, Realizability of Delaunay Triangulations, Information Processing Letters, 33(6), February 1990, 283-287.
  6. M. B. Dillencourt, Hamiltonian Cycles in Planar Triangulations with No Separating Triangles, Journal of Graph Theory, 14(1), March 1990, 31-49.
  7. M. B. Dillencourt, Toughness and Delaunay Triangulations, Discrete and Computational Geometry, 5(6), 1990, 575-601.
  8. M. B. Dillencourt, An Upper Bound on the Shortness Exponent of 1-tough, Maximal Planar Graphs, Discrete Mathematics, 90(1), June 1991, 93-97.
  9. M. B. Dillencourt, D. M. Mount, and N. S. Netanyahu, A Randomized Algorithm for Slope Selection International Journal of Computational Geometry & Applications, 2(1), March 1992, 1-27.
  10. M. B. Dillencourt, H. Samet and M. Tamminen, A General Approach to Connected-Component Labeling for Arbitrary Image Representations, Journal of the ACM, 39(2), April 1992, 253-280.
  11. M. B. Dillencourt, On the toughness index of planar graphs, Journal of Graph Theory, 18(1), 1994, 103-107.
  12. M. B. Dillencourt and W. D. Smith, A linear-time algorithm for testing the inscribability of trivalent polyhedra, International Journal of Computational Geometry & Applications, 5(1-2), March-June 1995, 21-36.
  13. M. B. Dillencourt and H. Samet, Using Topological Sweep To Extract the Boundaries of Regions in Maps Represented by Region Quadtrees, Algorithmica, 15(1), January 1996, 82-102.
  14. M. B. Dillencourt, Polyhedra of small order and their Hamiltonian properties, Journal of Combinatorial Theory Series B, 66(1), January 1996, 87-122.
  15. M. B. Dillencourt, Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-Complete, Discrete Applied Mathematics, 64(3), February 1996, 207-217.
  16. W. R. Shankle, P. Datta, M. Dillencourt, and M. Pazzani, Improving Dementia Screening Tests with Machine Learning Methods, Alzheimer's Research 2(3), June 1996, 95-99.
  17. L .F. Bic, M. Fukuda, and M. B. Dillencourt, Distributed Computing using Autonomous Objects, IEEE Computer, 29(8), August 1996, 55-61.
  18. M. B. Dillencourt and W. D. Smith, Graph-theoretical conditions for inscribability and Delaunay realizability, Discrete Mathematics, 161(1-3), December 1996, 63-77.
  19. T. K. Dey, M. B. Dillencourt, S. K. Ghosh, and J. M. Cahill, Triangulating with High Connectivity, Computational Geometry: Theory & Applications, 8(1), June 1997, 39-56.
  20. M. Fukuda, L. F. Bic, M. B. Dillencourt, and F. Merchant, Distributed Coordination with MESSENGERS, Science of Computer Programming, 31(2-3), July 1998, 291-311.
  21. M. Fukuda, L. F. Bic, M. B. Dillencourt, and J. M. Cahill, Messages versus Messengers in Distributed Programming, Journal of Parallel and Distributed Computing, 57(2), May 1999, 188-211.
  22. K. L. Morse, L. F. Bic, and M. Dillencourt, Interest Management in Large-Scale Virtual Environments, Presence: Teleoperators and Virtual Environments, 9(1), February 2000, 52-68.
  23. M. B. Dillencourt, D. Eppstein, and D. H. Hirschberg, Geometric Thickness of Complete Graphs, Journal of Graph Algorithms and Applications, 4(3), October 2000, 5-17.
  24. M. Fukuda, L. F. Bic, M. B. Dillencourt, and F Merchant, MESSENGERS: Distributed Programming Using Mobile Agents, Transactions of the Society for Design and Process Science, 5(4), December 2001, 95-112.
  25. L. Pan, M K. Lai, K. Noguchi, J. J. Huseynov, L. F. Bic, and M. B. Dillencourt, Distributed Parallel Computing Using Navigational Programming, International Journal of Parallel Programming, 32(1), February 2004, 1-37.

Conferences

  1. R. N. Meeson, M. B. Dillencourt, and A. M. Rogerson, Executable Data Flow Diagrams, in Advance Papers, First International Workshop on Computer-Aided Software Engineering (CASE '87), Cambridge, MA, May 1987, 445-454.
  2. M. B. Dillencourt, Toughness and Delaunay Triangulations, in Proceedings of the Third ACM Symposium on Computational Geometry, Waterloo, Ontario, June 1987, 186-194.
  3. M. B. Dillencourt and H. Samet, Extracting Region Boundaries from Maps Stored as Linear Quadtrees, in Proceedings of the Third International Conference on Spatial Data Handling, Sydney, Australia, August 1988, 65-77.
  4. M. B. Dillencourt, H. Samet, and M. Tamminen, Connected Component Labeling for Arbitrary Binary Image Representations, Fifth International Conference on Image Analysis and Processing (5CIAP), Positano, Italy, September 1989. (Progress in Image Analysis and Processing, V. Cantoni, L. P. Cordella, S. Levialdi, and G. Sanniti di Baja Eds., World Scientific Publishing Co. Ltd., Singapore, 1990, 131-146).
  5. M. B. Dillencourt, D. M. Mount, and N. S. Netanyahu, A randomized algorithm for slope selection, in Proceedings of the Third Canadian Conference on Computational Geometry, Vancouver, British Columbia August, 1991, 135-140.
  6. V. J. Leung, M. B. Dillencourt, and A. L. Bliss, GraphTool: A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms, in N. Dean and G. E. Shannon, editors, Computational Support for Discrete Mathematics: DIMACS Workshop, New Brunswick, NJ, March 1992. American Mathematical Society, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 15.
  7. M. B. Dillencourt and W. D. Smith, A linear-time algorithm for testing the inscribability of trivalent polyhedra, in Proceedings of the Eighth ACM Symposium on Computational Geometry, Berlin, Germany, June 1992, 177-185.
  8. M. B. Dillencourt, Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-Complete, in Proceedings of the Fourth Canadian Conference on Computational Geometry, St. Johns, Newfoundland, August, 1992, 223-228.
  9. M. B. Dillencourt and W. D. Smith, A Simple Method for Resolving Degeneracies in Delaunay Triangulations, in Automata, Languages, and Programming: Proceedings of the 20th International Colloquium (ICALP 93), Lund, Sweden, July, 1993, 177-188.
  10. M. B. Dillencourt, D. M. Mount, and A. J. Saalfeld, On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions, in Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, August, 1993, 49-54.
  11. R. Jayakrishnan, M. B. Dillencourt, V. Leung, and P. Oreizy, Simulation Framework for Distributed Traffic Control Algorithms in ATMS, 26th International Symposium on Automotive Technology and Automation, Aachen, Germany, September, 1993.
  12. M. B. Dillencourt and W. D. Smith, Graph-theoretical conditions for inscribability and Delaunay realizability, in Proceedings of the Sixth Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, August, 1994, 287-292.
  13. T. K. Dey, M. B. Dillencourt, and S. K. Ghosh, Triangulating with High Connectivity, in Proceedings of the Sixth Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, August, 1994, 339-343.
  14. F. Merchant, L. Bic, P. Borst, M. Corbin, M. B. Dillencourt, M. Fukuda, and P. Sapaty, Simulating Autonomous Objects in a Spatial Database, in 9th European Simulation Multiconference, Prague, Czech Republic, June 1995, 768-772.
  15. M. Fukuda, K. L. Morse, L. Bic, M. Dillencourt, E. Lee, and D. Menzel, A Novel Approach to Toxicology Simulation Based on Autonomous Objects, SCS Western Multiconference, San Diego, January 1996.
  16. M. Fukuda, L. F. Bic, M. B. Dillencourt, and F. Merchant, Intra- and Inter-Object Coordination with MESSENGERS, COORDINATION '96: First International Conference on Coordination Models and Languages\/, Cesena, Italy, April, 1996 179-196.
  17. M. Fukuda, L. F. Bic, and M. B. Dillencourt, Performance of the MESSENGERS Autonomous-Objects Based System, World-Wide Computing and its Applications, WWCA '97, Tsukuba, Japan, March, 1997, 43-57.
  18. M. Fukuda, L. F. Bic, M. B. Dillencourt, and F. Merchant, Messages versus Messengers in Distributed Programming, 17th International Conference on Distributed Computing Systems, ICDCS'97, Baltimore, Maryland, May, 1997.
  19. S. Seiden, M. Dillencourt, S. Irani, R. Borrey, and T. Murphy, Logo Detection in Document Images, International Conference on Imaging Science, Systems, and Technology, CISST'97, Las Vegas, Nevada, June/July, 1997, 446-449.
  20. M. Fukuda, L. F. Bic, M. B. Dillencourt, and F. Merchant, A Hierarchical Mapping Scheme for Mobile Agent Systems , 6th IEEE Workshop on Future Trends of Distributed Computing Systems, FTDCS'97, Tunis, Tunisia, October, 1997, 66-71.
  21. C. Wicke, L. F. Bic, M. B. Dillencourt, and M. Fukuda, Automatic State Capture of Self-Migrating Computations, International Workshop on Computing and Communication in the Presence of Mobility (ICSE '98), Kyoto, Japan, April 1998.
  22. M. Fukuda, L. F. Bic, and M. B. Dillencourt, Global Virtual Time Support for Individual-Based Simulations, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '98), Las Vegas, Nevada, July 1998, 9-16.
  23. M. B. Dillencourt, D. Eppstein, and D. H. Hirschberg, Geometric Thickness of Complete Graphs, Sixth Symposium on Graph Drawing (GD '98), Montreal, Canada, August 1998, 102-110.
  24. C. Wicke, L. F. Bic, M. B. Dillencourt, and M. Fukuda, Automatic State Capture of Self-Migrating Computations in MESSENGERS, Second International Workshop on Mobile Agents (MA'98), Stuttgart, Germany, September 1998, 68-79.
  25. F. Merchant, L. F. Bic, and M. B. Dillencourt, Load Balancing in Individual-Based Spatial Applications, International Conference on Parallel Architectures and Compilation Techniques (PACT`98), Paris, France, October 1998, 350-357.
  26. K. L. Morse, L. F. Bic, and M. B. Dillencourt, Characterizing Scenarios for DDM Performance and Benchmarking RTI's, Spring Simulation Interoperability Workshop, Orlando, Florida, March, 1999, 1-6.
  27. K. L. Morse, L. Bic, M. Dillencourt, and K. Tsai, Multicast Grouping for Dynamic Data Distribution Management, Summer Computer Simulation Conference (SCSC 1999), Chicago, Illinois, July, 1999, 312-318.
  28. C. Wicke, L. F. Bic, and M. B. Dillencourt, Compiling for Fast State Capture of Mobile Agents, Parallel Computing 99 (ParCo99), Delft, The Netherlands, August, 1999, 714-721.
  29. E. Gendelman, L. F. Bic, and M. B. Dillencourt, Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels, 18th IEEE Symposium on Reliable Distributed Systems (SRDS '99), Lausanne, Switzerland, October, 1999, 290-291.
  30. H. Kuang, L. F. Bic, M. B. Dillencourt, and A. C. Chang, PODC: Paradigm-Oriented Distributed Computing, 7th IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems (FTDCS '99), Cape Town, South Africa, December 1999, 169-175.
  31. H. Kuang, L. F. Bic, and M. B. Dillencourt, Paradigm-Oriented Distributed Computing Using Mobile Agents, 20th International Conference on Distributed Computing Systems (ICDCS 2000), Taipei, Taiwan, April, 2000, 11-19.
  32. E. Gendelman, L. F. Bic, and M. B. Dillencourt, An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile-Agent Systems, 20th International Conference on Distributed Computing Systems (ICDCS 2000), Taipei, Taiwan, April, 2000, 564-571.
  33. E. Gendelman, L. F. Bic, and M. B. Dillencourt, Process Interconnection Structures in Dynamically Changing Topologies, 7th International Conference on High-Performance Computing (HiPC 2000), Bangalore, India, December, 2000, 405-414.
  34. H. Kuang, L. F. Bic, and M. B. Dillencourt, SuperBoundary Exchange: A Technique for Reducing Communication in Distributed Implementations of Iterative Computations, 4th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2000), Hong Kong, December, 2000, 421-435.
  35. L. Pan, L. F. Bic, and M. B. Dillencourt, Distributed Sequential Numerical Computing Using Mobile Agents: Moving Computation to Data, 2001 International Conference on Parallel Processing (ICPP '01), Valencia, Spain, September, 2001, 77-84.
  36. E. Gendelman, L. F. Bic, and M. B. Dillencourt, Fast File Access for Fast Agents, Fifth IEEE International Conference on Mobile Agents (MA 2001), Atlanta, Georgia December, 2001, 88-102.
  37. H. Kuang, L. F. Bic, and M. B. Dillencourt, Communication Reduction in Iterative Grid-based Computing Using SuperBoundary Exchange Technique, 20th IASTED International Conference on Applied Informatics, (AI 2002), Innsbruck, Austria February, 2002, 179-184.
  38. L. Pan, L. F. Bic, and M. B. Dillencourt, Shared Variable Programming Beyond Shared Memory: Bridging Distributed Memory with Mobile Agents, 6th World Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA, June, 2002.
  39. H. Kuang, L. F. Bic, and M. B. Dillencourt, Iterative Grid-Based Computing Using Mobile Agents, 31st IEEE International Conference on Parallel Processing (ICPP 2002), Vancouver, BC, Canada, August 2002, 109-117.
  40. L. Pan, M. K. Lai, J. J. Huseynov, L. F. Bic, and M. B. Dillencourt, Distributed Parallel Computing Using Navigational Programming: Orchestrating Computations Around Data, International Conference on Parallel and Distributed Computing and Systems (PDCS 2002), Cambridge, MA, November, 2002, 458-463.
  41. L. Pan, L. F. Bic, M. B. Dillencourt, and M. K. Lai, Mobile Agents-The Right Vehicle for Distributed Sequential Computing, 9th International Conference on High Performance Computing (HiPC 2002), Bangalore, India, December, 2002, 575-586.
  42. L. Pan, L. F. Bic, M. B. Dillencourt, J. J. Huseynov, and M. K. Lai, Facilitating Agent Navigation Using DSM--High Level Designs, 7th World Conference on Integrated Design and Process Technology (IDPT 2003), Beijing, PRC, June, 2003.
  43. L. Pan, L. F. Bic, M. B. Dillencourt, and M. K. Lai, From Distributed Sequential Computing to Distributed Parallel Computing, 5th Workshop on High Performance Scientific and Engineering Computing with Applications (HPSECA-03), Kaohsiung, ROC, October, 2003, 255-262.
  44. L. Pan, L. F. Bic, M. B. Dillencourt, and M. K. Lai, NavP versus SPMD: Two Views of Distributed Computing, International Conference on Parallel and Distributed Computing and Systems (PDCS 2003), Marina del Ray, CA, November, 2003, 666-673.
  45. H. Kuang, L. F. Bic, and M. B. Dillencourt, GIDM: Globally Indexed Distributed Memory, 9th IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), San Juan, Puerto Rico, December 2003, 108-114.

Book Chapters

  1. L. F. Bic, M. B. Dillencourt, and M. Fukuda, Mobile Network Objects, Encyclopedia of Electrical and Electronics Engineering, J. Webster, Ed., John Wiley & Sons, Inc., New York, 1998.
  2. L. Pan, L. F. Bic, M. B. Dillencourt, and M. K. Lai, Distributed Sequential Computing, Parallel and Distributed Scientific and Engineering Computing: Practice and Experience, Y. Pan and L. T. Yang, Eds., Advances in Computation: Theory and Practice Volume 15, Nova Science Publishers, Inc., New York, 2003, 237-254.
Michael B. Dillencourt
Computer Science Department
Donald Bren School of Information and Computer Sciences
University of California, Irvine
444 Computer Science Building
Irvine, CA 92697-3425 USA
dillenco@ics.uci.edu
Last modified: December 16, 2004