Dinesh P. Mehta

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