Computing Display Conflicts in String and Circular String Visualization. - Dinesh P. Mehta; Sartaj Sahni (CPM, 1992)

Models and techniques for the visualization of labeled discrete objects. - Dinesh P. Mehta; Sartaj Sahni (SAC, 1992)

Corner stitching for L-shaped tiles. - George Blust; Dinesh P. Mehta (Great Lakes Symposium on VLSI, 1993)

A Data Structure for Circular String Analysis and Visualization. - Dinesh P. Mehta; Sartaj Sahni (IEEE Trans. Computers, 1993)

Computing Display Conflicts in String Visualization. - Dinesh P. Mehta; Sartaj Sahni (IEEE Trans. Computers, 1994)

Partitioning Algorithms for Corner Stitching. - Mario Alberto López; Dinesh P. Mehta (Great Lakes Symposium on VLSI, 1996)

A Minimum-Area Floorplanning Algorithm for MBC Designs. - Dinesh P. Mehta; Naveed A. Sherwani (Great Lakes Symposium on VLSI, 1996)

Efficient decomposition of polygons into L-shapes with application to VLSI layouts. - Mario Alberto López; Dinesh P. Mehta (ACM Trans. Design Autom. Electr. Syst., 1996)

T3: Physical Design. - Dinesh P. Mehta; Naveed A. Sherwani; A. Bariya (VLSI Design, 1997)

Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects. - Dinesh P. Mehta; Sartaj K. Sahni (J. Syst. Softw., 1997)

Corner stitching for simple rectilinear shapes [VLSI layouts]. - Dinesh P. Mehta; George Blust (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997)

Parallel algorithms for corner stitching. - Dinesh P. Mehta; Erica D. Wilson (Concurr. Pract. Exp., 1998)

Estimating the storage requirements of the rectangular and L-shaped corner stitching data structures. - Dinesh P. Mehta (ACM Trans. Design Autom. Electr. Syst., 1998)

CLOTH MEASURE: A Software Tool for Estimating the Memory Requirements of Corner Stitching Data Structures. - Dinesh P. Mehta (VLSI Design, 1998)

On the use of flexible, rectilinear blocks to obtain minimum-area floorplans in mixed block and cell designs. - Dinesh P. Mehta; Naveed A. Sherwani (ACM Trans. Design Autom. Electr. Syst., 2000)

Constrained polygon transformations for incremental floorplanning. - Swanwa Liao; Mario Alberto López; Dinesh P. Mehta (ACM Trans. Design Autom. Electr. Syst., 2001)

Mutual Exclusion on Optical Buses. - Krishna M. Kavi; Dinesh P. Mehta (Parallel Process. Lett., 2002)

Decision tree approximations of Boolean functions. - Dinesh P. Mehta; Vijay Raghavan 002 (Theor. Comput. Sci., 2002)

Optimal coverage paths in ad-hoc sensor networks. - Dinesh P. Mehta; Mario Alberto López; Lan Lin (ICC, 2003)

Constrained "Modern" Floorplanning. - Yan Feng; Dinesh P. Mehta; Hannah Honghua Yang (ISPD, 2003)

Constrained Floorplanning with Whitespace. - Yan Feng; Dinesh P. Mehta (VLSI Design, 2004)

Floorplan Classification Algorithms. - Kun Gao; Dinesh P. Mehta (VLSI Design, 2004)

Fast Pursuit Of Mobile Nodes Using TPR Trees. - Sahar A. Idwan; Dinesh P. Mehta; Mario Alberto López (Int. J. Found. Comput. Sci., 2004)

Constrained floorplanning using network flows. - Yan Feng; Dinesh P. Mehta; Hannah Honghua Yang (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2004)

Predictive Models to Rebroadcast in Mobile Ad Hoc Networks. - Brad Williams; Dinesh P. Mehta; Tracy Camp; William Navidi (IEEE Trans. Mob. Comput., 2004)

Basic Structures. - Dinesh P. Mehta (Handbook of Data Structures and Applications, 2004)

Trees. - Dinesh P. Mehta (Handbook of Data Structures and Applications, 2004)

Layout Data Structures. - Dinesh P. Mehta (Handbook of Data Structures and Applications, 2004)

Heterogeneous Floorplanning for FPGAs. - Yan Feng; Dinesh P. Mehta (VLSI Design, 2006)

Module relocation to obtain feasible constrained floorplans. - Yan Feng; Dinesh P. Mehta (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006)

Automated reaction mapping. - John D. Crabtree; Dinesh P. Mehta (ACM J. Exp. Algorithmics, 2008)

Introduction to Physical Design. - Charles J. Alpert; Dinesh P. Mehta; Sachin S. Sapatnekar (Handbook of Algorithms for Physical Design Automation, 2008)

Recent Advancesin Floorplanning. - Dinesh P. Mehta; Yan Feng (Handbook of Algorithms for Physical Design Automation, 2008)

Basic Data Structures. - Dinesh P. Mehta; Hai Zhou (Handbook of Algorithms for Physical Design Automation, 2008)

An Open-Source Java Platform for Automated Reaction Mapping. - John D. Crabtree; Dinesh P. Mehta; Tina M. Kouri (J. Chem. Inf. Model., 2010)

Improved Automated Reaction Mapping. - Tina M. Kouri; Dinesh P. Mehta (SEA, 2011)

Identifying algorithmic vulnerabilities through simulated annealing. - S. Andrew Johnson; Dinesh P. Mehta; Ramakrishna Thurimella (Optim. Lett., 2011)

Forming project groups while learning about matching and network flows in algorithms. - Dinesh P. Mehta; Tina M. Kouri; Irene Polycarpou (ITiCSE, 2012)

Faster reaction mapping through improved naming techniques. - Tina M. Kouri; Dinesh P. Mehta (ACM J. Exp. Algorithmics, 2013)

Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs. - Dinesh P. Mehta; Carl Shetters; Donald W. Bouldin (VLSI Design, 2013)

"Social" Network of Isomers Based on Bond Count Distance: Algorithms. - Tina M. Kouri; Mahendra Awale; James K. Slyby; Jean-Louis Reymond; Dinesh P. Mehta (J. Chem. Inf. Model., 2014)

New Algorithmic Techniques for Complex EDA Problems. - Shantanu Dutt; Dinesh P. Mehta; Gi-Joon Nam (VLSI Design, 2014)

Random Models and Analyses for Chemical Graphs. - Tina M. Kouri; Daniel Pascua; Dinesh P. Mehta (Int. J. Found. Comput. Sci., 2015)

Chemical Kinetics: A CS Perspective. - Dinesh P. Mehta; Anthony M. Dean; Tina M. Kouri (Comput. Sci. Eng., 2016)

Faster Algorithms for Isomer Network Generation. - Dheivya Thiagarajan; Dinesh P. Mehta (J. Chem. Inf. Model., 2016)

ApproxG: Fast Approximate Parallel Graphlet Counting Through Accuracy Control. - Daniel Mawhirter; Bo Wu 002; Dinesh P. Mehta; Chao Ai (CCGrid, 2018)

AlgoBOWL: A Competition-Based Group Project for Algorithms Courses. - Dinesh P. Mehta; Jack Rosenthal (ITiCSE, 2019)

Navigating free-floating minefields via time-varying Voronoi graphs. - Christopher Richards; Dinesh P. Mehta (Networks, 2019)

Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST). - Sara Bourbour; Dinesh P. Mehta; William C. Navidi (Networks, 2020)

Understanding High-Performance Subgraph Pattern Matching: A Systems Perspective. - Akshit Sharma; Dinesh P. Mehta; Bo Wu 002 (GRADES/NDA, 2024)