Dinesh P. Mehta: Personal Home Page
Dinesh P. Mehta
Selected Publications

Dr. Mehta's publications are organized by research area and reverse-chronologically within each area. A research area could either refer to the application (e.g., cheminformatics) or the primary underlying algorithmic technique (e.g., graph algorithms). As a result, a given paper might be listed more than once! Electronic copies of some papers are being provided as a courtesy. In some cases, this may not be the final version that was published. All copyrights should be respected. When both conference and journal versions of a paper are listed, only the journal version is provided as this is usually more complete and better-written!

Application Areas Techniques
Cheminformatics and Materials Science
Data Structures
VLSI Design Automation
Graph Algorithms
Data Analytics
Geometric Algorithms
Mobile Computing
Rule-Based Systems
Iterative/Stochastic
Parallel/High Performance Computing

Publications organized by Application Area

Cheminformatics and Materials Science Applications

  1. Tina Kouri, Mahendra Awale, JK Slyby, Jean-Louis Reymond and Dinesh Mehta,
    Social Network of Isomers Based on Bond Count Distance: Algorithms,
    [American Chemical Society] Journal of Chemical Information and Modeling,
    Vol. 54, January 2014.
  2. Tina Kouri and Dinesh Mehta,
    Faster Reaction Mapping through Improved Naming Techniques ,
    ACM Journal of Experimental Algorithmics,
    Vol. 18, November, 2013, Article 2.5.
  3. Tina Kouri, John Crabtree, Lam Huynh, Anthony Dean, and Dinesh Mehta,
    RCARM: Reaction Classification using Automated Reaction Mapping,
    International Journal of Chemical Kinetics,
    Vol. 45, Issue 2, Feb., 2013.
  4. Tina Kouri and Dinesh Mehta,
    Improved Automated Reaction Mapping,
    10th International Symposium of Experimental Algorithms, May 5-7, 2011, Kolimpari Chania, Greece.
  5. John Crabtree, Dinesh Mehta and Tina Kouri,
    An Open-Source Java Platform for Automated Reaction Mapping,
    [American Chemical Society] Journal of Chemical Information and Modeling,
    Vol. 50, Issue 9, September 2010.
  6. [Book Chapter] Cristian Ciobanu, C.Z. Wang, Dinesh Mehta, and K.M. Ho,
    Predicting the Atomic Configuration of 1- and 2-Dimensional Nanostructures via Global Optimization Methods,
    in Trends in Computational Nanomechanics - Transcending Length and Time Scales,
    Chapter 9, T. Dumitrica (ed), Springer (2010).
  7. Teresa Davies, Dinesh Mehta, J.L. Rodriguez-Lopez, George Gilmer and Cristian Ciobanu,
    A Variable-Number Genetic Algorithm for Growth of 1-Dimensional Nanostructures into their Global Minimum Configuration under Radial Confinement,
    Materials and Manufacturing Processes,
    Vol. 24, No. 3, March, 2009.
  8. John Crabtree and Dinesh Mehta,
    Automated Reaction Mapping,
    ACM Journal of Experimental Algorithmics,
    Vol. 13, February, 2009, Article 1.15.

VLSI Design Automation Applications

  1. Dinesh Mehta, Carl Shetters and Don Bouldin,
    Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs,
    VLSI Design
    Vol. 2013, Article ID 249592, 2013.
  2. Yan Feng and Dinesh Mehta,
    Module Relocation to Obtain Feasible Constrained Floorplans,
    IEEE Transactions on Computer-aided Design,
    Vol. 25, No 5, May 2006.
  3. Yan Feng and Dinesh Mehta,
    Heterogeneous Floorplanning for FPGAs,
    VLSI Design 2006, January 2-6 2006, Hyderabad, India
  4. Yan Feng, Dinesh Mehta and Hannah Yang,
    Constrained Floorplanning using Network Flows,
    IEEE Transactions on Computer- aided Design. Vol. 23, No. 4, April 2004.
  5. Yan Feng and Dinesh. Mehta,
    Constrained Floorplanning with Whitespace,
    VLSI Design 2004, January 5-9 2004, Mumbai, India.
  6. Kun Gao and Dinesh P. Mehta,
    Floorplan Classification Algorithms,
    VLSI Design 2004, January 5-9 2004, Mumbai, India
  7. Keishi Sakanushi, Yoji Kajitani and Dinesh P. Mehta,
    The Quarter-State Sequence Floorplan Representation,
    IEEE Transactions on Circuits and Systems - I,
    Vol. 50, No. 3, March 2003.
  8. Sean Liao, Mario Lopez, and Dinesh Mehta,
    Constrained Polygon Transformations for Incremental Floorplanning,
    ACM Transactions on Design Automation of Electronic Systems
    Vol. 6, No. 3, July 2001.
  9. Dinesh Mehta and Naveed Sherwani,
    On the use of Flexible, Rectilinear Blocks to obtain Minimum-Area Floorplans for Mixed Block and Cell Designs,
    ACM Transactions on the Design Automation of Electronic Systems,
    Vol 5, No. 2, January 2000.
  10. Dinesh Mehta,
    Estimating the Memory Requirements of the Rectangular and L-shaped Corner Stitching Data Structures,
    ACM Transactions on the Design Automation of Electronic Systems,
    Vol. 3, No. 2, April 1998.
  11. Dinesh Mehta and Erica Wilson,
    Parallel Algorithms for Corner Stitching,
    Concurrency: Practice and Experience,
    Vol 10(15), 1998.
  12. Dinesh Mehta,
    CLOTH_MEASURE: A Software Tool for Estimating the Memory Requirements of Corner Stitching Data Structures,
    VLSI Design,
    Vol. 7, No. 4, 1998.
  13. Dinesh Mehta and George Blust,
    Corner Stitching for Simple Rectilinear Shapes,
    IEEE Transactions on Computer-aided Design,
    Vol. 16, No. 2, February 1997.
  14. Mario Lopez and Dinesh Mehta,
    Efficient Decomposition of Polygons into L-shapes with Applications to VLSI Layouts,
    ACM Transactions on Design Automation of Electronic Systems,
    Vol. 1, No. 3, July 1996.
  15. Dinesh Mehta and Naveed Sherwani,
    A Minimum-Area Floorplanning Algorithm for Mixed Block and Cell Designs,
    Sixth Great Lakes Symposium on VLSI, 1996.
  16. Mario Lopez and Dinesh Mehta,
    Partitioning Algorithms for Corner Stitching,
    Sixth Great Lakes Symposium on VLSI, 1996.
  17. Dinesh Mehta, Estimating the Memory Requirements of the Rectangular and L-shaped Corner Stitching Data Structures,
    Fourth Great Lakes Symposium on VLSI, 1994.
  18. George Blust and Dinesh Mehta,
    Corner Stitching for L-shaped tiles,
    Third Great Lakes Symposium on VLSI, 1993.

Data Analytics Applications

  1. Dinesh Mehta and Vijay Raghavan,
    Decision Tree Approximations of Boolean Functions,
    Theoretical Computer Science,
    Vol. 270, No 1-2, January 2002.
    Preliminary version appeared in COLT, 2000.
  2. Dinesh Mehta and Sartaj Sahni,
    Models, Techniques, and Algorithms for Finding, Selecting, and Displaying Patterns in Strings and other Discrete Objects,
    The Journal of Systems and Software,
    Vol. 39, December 1997.
  3. Dinesh Mehta and Sartaj Sahni,
    Computing Display Conflicts in String Visualization,
    IEEE Transactions on Computers,
    Volume 43, Number 3, March 1994.
  4. Dinesh Mehta and Sartaj Sahni,
    A Data Structure for Circular String Analysis and Visualization,
    IEEE Transactions on Computers,
    Volume 42, Number 8, August 1993.
  5. Dinesh Mehta and Sartaj Sahni,
    Models and Techniques for the Visualization of Labeled Discrete Objects,
    ACM Symposium on Applied Computing, 1992.
  6. Dinesh Mehta and Sartaj Sahni,
    Computing Display Conflicts in String and Circular String Visualization,
    Third Symposium on Combinatorial Pattern Matching, 1992.

Mobile Computing and Networks

  1. Sahar Idwan and Dinesh Mehta,
    Accelerated Pursuit Using Hierarchal Graphs ,
    Proceedings of 2nd Jordan International Conference on Computer Science and Engineering,
    December 5-7 2006, Al-Salt, Jordan.
  2. Sahar Idwan and Dinesh Mehta,
    Fast Probablistic Pursuit of Mobile Entities in Road Networks,
    Proceedings of Grace Hopper Celebration of Women in Computing,
    October 4-7 2006, San Diego, USA.
  3. Sahar Idwan, Dinesh Mehta, Mario Lopez,
    Fast Pursuit of Mobile Nodes using TPR Trees,
    International Journal on the Foundations of Computer Science,
    Vol. 15, No 5, October 2004.
  4. Brad Williams, Dinesh Mehta, Tracy Camp and William Navidi,
    Predictive Models to Re-broadcast in Mobile Ad Hoc Networks,
    IEEE Transactions on Mobile Computing,
    Vol. 3, No. 3, July-September 2004.
  5. Dinesh Mehta, Mario Lopez, and Lan Lin,
    Optimal Coverage Paths in Ad-hoc Sensor Networks,
    IEEE International Conference on Communications,
    May 11-15, Anchorage, Alaska.

Publications organized by Techniques

Data Structures

  1. Tina Kouri and Dinesh Mehta,
    Faster Reaction Mapping through Improved Naming Techniques ,
    ACM Journal of Experimental Algorithmics,
    Vol. 18, November, 2013, Article 2.5.
  2. Tina Kouri and Dinesh Mehta,
    Improved Automated Reaction Mapping,
    10th International Symposium of Experimental Algorithms, May 5-7, 2011, Kolimpari Chania, Greece.
  3. Sahar Idwan, Dinesh Mehta, Mario Lopez,
    Fast Pursuit of Mobile Nodes using TPR Trees,
    International Journal on the Foundations of Computer Science,
    Vol. 15, No 5, October 2004.
  4. Kun Gao and Dinesh P. Mehta,
    Floorplan Classification Algorithms,
    VLSI Design 2004, January 5-9 2004, Mumbai, India
  5. Keishi Sakanushi, Yoji Kajitani and Dinesh P. Mehta,
    The Quarter-State Sequence Floorplan Representation,
    IEEE Transactions on Circuits and Systems - I,
    Vol. 50, No. 3, March 2003.
  6. Dinesh Mehta,
    Estimating the Memory Requirements of the Rectangular and L-shaped Corner Stitching Data Structures,
    ACM Transactions on the Design Automation of Electronic Systems,
    Vol. 3, No. 2, April 1998.
  7. Dinesh Mehta,
    CLOTH_MEASURE: A Software Tool for Estimating the Memory Requirements of Corner Stitching Data Structures,
    VLSI Design,
    Vol. 7, No. 4, 1998.
  8. Dinesh Mehta and George Blust,
    Corner Stitching for Simple Rectilinear Shapes,
    IEEE Transactions on Computer-aided Design,
    Vol. 16, No. 2, February 1997.
  9. Dinesh Mehta, Estimating the Memory Requirements of the Rectangular and L-shaped Corner Stitching Data Structures,
    Fourth Great Lakes Symposium on VLSI, 1994.
  10. George Blust and Dinesh Mehta,
    Corner Stitching for L-shaped tiles,
    Third Great Lakes Symposium on VLSI, 1993.
  11. Dinesh Mehta and Sartaj Sahni,
    A Data Structure for Circular String Analysis and Visualization,
    IEEE Transactions on Computers,
    Volume 42, Number 8, August 1993.

Graph Algorithms

    Dinesh Mehta, Carl Shetters and Don Bouldin,
    Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs,
    VLSI Design
    Vol. 2013, Article ID 249592, 2013.
  1. Tina Kouri, Mahendra Awale, JK Slyby, Jean-Louis Reymond and Dinesh Mehta,
    Social Network of Isomers Based on Bond Count Distance: Algorithms,
    [American Chemical Society] Journal of Chemical Information and Modeling,
    Vol. 54, January 2014.
  2. John Crabtree and Dinesh Mehta,
    Automated Reaction Mapping,
    ACM Journal of Experimental Algorithmics,
    Vol. 13, February, 2009, Article 1.15.
  3. Sahar Idwan and Dinesh Mehta,
    Accelerated Pursuit Using Hierarchal Graphs ,
    Proceedings of 2nd Jordan International Conference on Computer Science and Engineering,
    December 5-7 2006, Al-Salt, Jordan.
  4. Sahar Idwan and Dinesh Mehta,
    Fast Probablistic Pursuit of Mobile Entities in Road Networks,
    Proceedings of Grace Hopper Celebration of Women in Computing,
    October 4-7 2006, San Diego, USA.
  5. Yan Feng, Dinesh Mehta and Hannah Yang,
    Constrained Floorplanning using Network Flows,
    IEEE Transactions on Computer- aided Design. Vol. 23, No. 4, April 2004.
  6. Dinesh Mehta and Naveed Sherwani,
    On the use of Flexible, Rectilinear Blocks to obtain Minimum-Area Floorplans for Mixed Block and Cell Designs,
    ACM Transactions on the Design Automation of Electronic Systems,
    Vol 5, No. 2, January 2000.
  7. Dinesh Mehta, Mario Lopez, and Lan Lin,
    Optimal Coverage Paths in Ad-hoc Sensor Networks,
    IEEE International Conference on Communications,
    May 11-15, Anchorage, Alaska.

Geometric Algorithms

  1. Yan Feng and Dinesh Mehta,
    Module Relocation to Obtain Feasible Constrained Floorplans,
    IEEE Transactions on Computer-aided Design,
    Vol. 25, No 5, May 2006.
  2. Yan Feng and Dinesh. Mehta,
    Constrained Floorplanning with Whitespace,
    VLSI Design 2004, January 5-9 2004, Mumbai, India.
  3. Sean Liao, Mario Lopez, and Dinesh Mehta,
    Constrained Polygon Transformations for Incremental Floorplanning,
    ACM Transactions on Design Automation of Electronic Systems
    Vol. 6, No. 3, July 2001.
  4. Mario Lopez and Dinesh Mehta,
    Efficient Decomposition of Polygons into L-shapes with Applications to VLSI Layouts,
    ACM Transactions on Design Automation of Electronic Systems,
    Vol. 1, No. 3, July 1996.

Rule-based (Expert) Systems

  1. Tina Kouri, John Crabtree, Lam Huynh, Anthony Dean, and Dinesh Mehta,
    RCARM: Reaction Classification using Automated Reaction Mapping,
    International Journal of Chemical Kinetics,
    Vol. 45, Issue 2, Feb., 2013.
  2. John Crabtree, Dinesh Mehta and Tina Kouri,
    An Open-Source Java Platform for Automated Reaction Mapping,
    [American Chemical Society] Journal of Chemical Information and Modeling,
    Vol. 50, Issue 9, September 2010.

Iterative/Stochastic Techniques

  1. Andrew Johnson, Dinesh Mehta and Ramakrishna Thurimella,
    Identifying Algorithmic Vulnerabilities through Simulated Annealing,
    Optimization Letters, Vol. 5, No. 3, August 2011.
  2. [Book Chapter] Cristian Ciobanu, C.Z. Wang, Dinesh Mehta, and K.M. Ho,
    Predicting the Atomic Configuration of 1- and 2-Dimensional Nanostructures via Global Optimization Methods,
    in Trends in Computational Nanomechanics - Transcending Length and Time Scales,
    Chapter 9, T. Dumitrica (ed), Springer (2010).
  3. Teresa Davies, Dinesh Mehta, J.L. Rodriguez-Lopez, George Gilmer and Cristian Ciobanu,
    A Variable-Number Genetic Algorithm for Growth of 1-Dimensional Nanostructures into their Global Minimum Configuration under Radial Confinement,
    Materials and Manufacturing Processes,
    Vol. 24, No. 3, March, 2009.

Parallel/High Performance Computing

  1. Krishna Kavi and Dinesh Mehta,
    Mutual Exclusion on Optical Buses,
    Parallel Processing Letters,
    Vol. 12, Nos. 3 & 4, December 2002.
    Earlier version appeared in ISCA 2000.
  2. Dinesh Mehta and Erica Wilson,
    Parallel Algorithms for Corner Stitching,
    Concurrency: Practice and Experience,
    Vol 10(15), 1998, pp. 1317-1341.


Send comments & questions to dmehta@mines.edu Disclaimer
Last Modified: July 29, 2014