Dinesh P. Mehta

Orcid: 0000-0002-7521-5781

According to our database1, Dinesh P. Mehta authored at least 49 papers between 1992 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST).
Networks, 2020

2019
Navigating free-floating minefields via time-varying Voronoi graphs.
Networks, 2019

AlgoBOWL: A Competition-Based Group Project for Algorithms Courses.
Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education, 2019

2018
ApproxG: Fast Approximate Parallel Graphlet Counting Through Accuracy Control.
Proceedings of the 18th IEEE/ACM International Symposium on Cluster, 2018

2016
Faster Algorithms for Isomer Network Generation.
J. Chem. Inf. Model., 2016

Chemical Kinetics: A CS Perspective.
Comput. Sci. Eng., 2016

2015
Random Models and Analyses for Chemical Graphs.
Int. J. Found. Comput. Sci., 2015

2014
New Algorithmic Techniques for Complex EDA Problems.
VLSI Design, 2014

"Social" Network of Isomers Based on Bond Count Distance: Algorithms.
J. Chem. Inf. Model., 2014

2013
Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs.
VLSI Design, 2013

Faster reaction mapping through improved naming techniques.
ACM J. Exp. Algorithmics, 2013

2012
Forming project groups while learning about matching and network flows in algorithms.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

2011
Identifying algorithmic vulnerabilities through simulated annealing.
Optim. Lett., 2011

Improved Automated Reaction Mapping.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010
An Open-Source Java Platform for Automated Reaction Mapping.
J. Chem. Inf. Model., 2010

2008
Basic Data Structures.
Proceedings of the Handbook of Algorithms for Physical Design Automation., 2008

Recent Advancesin Floorplanning.
Proceedings of the Handbook of Algorithms for Physical Design Automation., 2008

Introduction to Physical Design.
Proceedings of the Handbook of Algorithms for Physical Design Automation., 2008

Automated reaction mapping.
ACM J. Exp. Algorithmics, 2008

2006
Module relocation to obtain feasible constrained floorplans.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006

Heterogeneous Floorplanning for FPGAs.
Proceedings of the 19th International Conference on VLSI Design (VLSI Design 2006), 2006

2004
Layout Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Basic Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Predictive Models to Rebroadcast in Mobile Ad Hoc Networks.
IEEE Trans. Mob. Comput., 2004

Constrained floorplanning using network flows.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2004

Fast Pursuit Of Mobile Nodes Using TPR Trees.
Int. J. Found. Comput. Sci., 2004

Floorplan Classification Algorithms.
Proceedings of the 17th International Conference on VLSI Design (VLSI Design 2004), 2004

Constrained Floorplanning with Whitespace.
Proceedings of the 17th International Conference on VLSI Design (VLSI Design 2004), 2004

2003
Constrained "Modern" Floorplanning.
Proceedings of the 2003 International Symposium on Physical Design, 2003

Optimal coverage paths in ad-hoc sensor networks.
Proceedings of IEEE International Conference on Communications, 2003

2002
Decision tree approximations of Boolean functions.
Theor. Comput. Sci., 2002

Mutual Exclusion on Optical Buses.
Parallel Process. Lett., 2002

2001
Constrained polygon transformations for incremental floorplanning.
ACM Trans. Design Autom. Electr. Syst., 2001

2000
On the use of flexible, rectilinear blocks to obtain minimum-area floorplans in mixed block and cell designs.
ACM Trans. Design Autom. Electr. Syst., 2000

1998
CLOTH MEASURE: A Software Tool for Estimating the Memory Requirements of Corner Stitching Data Structures.
VLSI Design, 1998

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

Parallel algorithms for corner stitching.
Concurr. Pract. Exp., 1998

1997
Corner stitching for simple rectilinear shapes [VLSI layouts].
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997

Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objects.
J. Syst. Softw., 1997

T3: Physical Design.
Proceedings of the 10th International Conference on VLSI Design (VLSI Design 1997), 1997

1996
Efficient decomposition of polygons into L-shapes with application to VLSI layouts.
ACM Trans. Design Autom. Electr. Syst., 1996

A Minimum-Area Floorplanning Algorithm for MBC Designs.
Proceedings of the 6th Great Lakes Symposium on VLSI (GLS-VLSI '96), 1996

Partitioning Algorithms for Corner Stitching.
Proceedings of the 6th Great Lakes Symposium on VLSI (GLS-VLSI '96), 1996

1994
Computing Display Conflicts in String Visualization.
IEEE Trans. Computers, 1994

1993
A Data Structure for Circular String Analysis and Visualization.
IEEE Trans. Computers, 1993

Corner stitching for L-shaped tiles.
Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993

1992
Models and techniques for the visualization of labeled discrete objects.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

Computing Display Conflicts in String and Circular String Visualization.
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992


  Loading...