Dinesh P. Mehta

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 8

Top Topics

Pattern Matching

Distance Metric

Computational Complexity

Neighborhood Graph

Top Venues

J. Chem. Inf. Model.

Int. J. Found. Comput. Sci.

Publications

Akshit Sharma, Dinesh P. Mehta, Bo Wu
Understanding High-Performance Subgraph Pattern Matching: A Systems Perspective. GRADES/NDA (2024)
Sara Bourbour, Dinesh P. Mehta, William C. Navidi
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST). Networks 76 (3) (2020)
Christopher Richards, Dinesh P. Mehta
Navigating free-floating minefields via time-varying Voronoi graphs. Networks 73 (2) (2019)
Dinesh P. Mehta, Jack Rosenthal
AlgoBOWL: A Competition-Based Group Project for Algorithms Courses. ITiCSE (2019)
Daniel Mawhirter, Bo Wu, Dinesh P. Mehta, Chao Ai
ApproxG: Fast Approximate Parallel Graphlet Counting Through Accuracy Control. CCGrid (2018)
Dinesh P. Mehta, Anthony M. Dean, Tina M. Kouri
Chemical Kinetics: A CS Perspective. Comput. Sci. Eng. 18 (5) (2016)
Dheivya Thiagarajan, Dinesh P. Mehta
Faster Algorithms for Isomer Network Generation. J. Chem. Inf. Model. 56 (12) (2016)
Tina M. Kouri, Daniel Pascua, Dinesh P. Mehta
Random Models and Analyses for Chemical Graphs. Int. J. Found. Comput. Sci. 26 (2) (2015)
Shantanu Dutt, Dinesh P. Mehta, Gi-Joon Nam
New Algorithmic Techniques for Complex EDA Problems. VLSI Design 2014 (2014)
Tina M. Kouri, Mahendra Awale, James K. Slyby, Jean-Louis Reymond, Dinesh P. Mehta
"Social" Network of Isomers Based on Bond Count Distance: Algorithms. J. Chem. Inf. Model. 54 (1) (2014)
Dinesh P. Mehta, Carl Shetters, Donald W. Bouldin
Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs. VLSI Design 2013 (2013)
Tina M. Kouri, Dinesh P. Mehta
Faster reaction mapping through improved naming techniques. ACM J. Exp. Algorithmics 18 (2013)
Dinesh P. Mehta, Tina M. Kouri, Irene Polycarpou
Forming project groups while learning about matching and network flows in algorithms. ITiCSE (2012)
Tina M. Kouri, Dinesh P. Mehta
Improved Automated Reaction Mapping. SEA (2011)
S. Andrew Johnson, Dinesh P. Mehta, Ramakrishna Thurimella
Identifying algorithmic vulnerabilities through simulated annealing. Optim. Lett. 5 (3) (2011)
John D. Crabtree, Dinesh P. Mehta, Tina M. Kouri
An Open-Source Java Platform for Automated Reaction Mapping. J. Chem. Inf. Model. 50 (9) (2010)
John D. Crabtree, Dinesh P. Mehta
Automated reaction mapping. ACM J. Exp. Algorithmics 13 (2008)
Yan Feng, Dinesh P. Mehta
Module relocation to obtain feasible constrained floorplans. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25 (5) (2006)
Yan Feng, Dinesh P. Mehta
Heterogeneous Floorplanning for FPGAs. VLSI Design (2006)
Sahar A. Idwan, Dinesh P. Mehta, Mario Alberto López
Fast Pursuit Of Mobile Nodes Using TPR Trees. Int. J. Found. Comput. Sci. 15 (5) (2004)
Yan Feng, Dinesh P. Mehta, Hannah Honghua Yang
Constrained floorplanning using network flows. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23 (4) (2004)
Kun Gao, Dinesh P. Mehta
Floorplan Classification Algorithms. VLSI Design (2004)
Yan Feng, Dinesh P. Mehta
Constrained Floorplanning with Whitespace. VLSI Design (2004)
Brad Williams, Dinesh P. Mehta, Tracy Camp, William Navidi
Predictive Models to Rebroadcast in Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput. 3 (3) (2004)
Dinesh P. Mehta, Mario Alberto López, Lan Lin
Optimal coverage paths in ad-hoc sensor networks. ICC (2003)
Yan Feng, Dinesh P. Mehta, Hannah Honghua Yang
Constrained "Modern" Floorplanning. ISPD (2003)
Krishna M. Kavi, Dinesh P. Mehta
Mutual Exclusion on Optical Buses. Parallel Process. Lett. 12 (3-4) (2002)
Dinesh P. Mehta, Vijay Raghavan
Decision tree approximations of Boolean functions. Theor. Comput. Sci. 270 (1-2) (2002)
Swanwa Liao, Mario Alberto López, Dinesh P. Mehta
Constrained polygon transformations for incremental floorplanning. ACM Trans. Design Autom. Electr. Syst. 6 (3) (2001)
Dinesh P. Mehta, Naveed A. Sherwani
On the use of flexible, rectilinear blocks to obtain minimum-area floorplans in mixed block and cell designs. ACM Trans. Design Autom. Electr. Syst. 5 (1) (2000)
Dinesh P. Mehta, Vijay Raghavan
Decision Tree Approximations of Boolean Functions. COLT (2000)
Dinesh P. Mehta
Estimating the storage requirements of the rectangular and L-shaped corner stitching data structures. ACM Trans. Design Autom. Electr. Syst. 3 (2) (1998)
Dinesh P. Mehta, Erica D. Wilson
Parallel algorithms for corner stitching. Concurr. Pract. Exp. 10 (15) (1998)
Dinesh P. Mehta
CLOTH MEASURE: A Software Tool for Estimating the Memory Requirements of Corner Stitching Data Structures. VLSI Design 1998 (4) (1998)
Dinesh P. Mehta, George Blust
Corner stitching for simple rectilinear shapes [VLSI layouts]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16 (2) (1997)
Dinesh P. Mehta, Sartaj K. Sahni
Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects. J. Syst. Softw. 39 (3) (1997)
Dinesh P. Mehta, Naveed A. Sherwani, A. Bariya
T3: Physical Design. VLSI Design (1997)
Mario Alberto López, Dinesh P. Mehta
Partitioning Algorithms for Corner Stitching. Great Lakes Symposium on VLSI (1996)
Mario Alberto López, Dinesh P. Mehta
Efficient decomposition of polygons into L-shapes with application to VLSI layouts. ACM Trans. Design Autom. Electr. Syst. 1 (3) (1996)
Dinesh P. Mehta, Naveed A. Sherwani
A Minimum-Area Floorplanning Algorithm for MBC Designs. Great Lakes Symposium on VLSI (1996)
Dinesh P. Mehta, Sartaj Sahni
Computing Display Conflicts in String Visualization. IEEE Trans. Computers 43 (3) (1994)
Dinesh P. Mehta
Estimating the storage requirements of the rectangular and L-shaped corner stitching data structures. Great Lakes Symposium on VLSI (1994)
George Blust, Dinesh P. Mehta
Corner stitching for L-shaped tiles. Great Lakes Symposium on VLSI (1993)
Dinesh P. Mehta, Sartaj Sahni
A Data Structure for Circular String Analysis and Visualization. IEEE Trans. Computers 42 (8) (1993)
Dinesh P. Mehta, Sartaj Sahni
Computing Display Conflicts in String and Circular String Visualization. CPM (1992)
Dinesh P. Mehta, Sartaj Sahni
Models and techniques for the visualization of labeled discrete objects. SAC (1992)