Shashank K. Mehta

Mahesh Sreekumar Rajasree

Proceedings of the 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2022

2020

A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

2019

Depth First Search in the Semi-streaming Model.

[BibT_eX]

[DOI]

Shahbaz Khan

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

The QAP-polytope and the graph isomorphism problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Maximum Distance Sub-Lattice Problem.

[BibT_eX]

[DOI]

Mahesh Sreekumar Rajasree

Rajendra Kumar

CoRR, 2018

2016

Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs.

[BibT_eX]

[DOI]

Sumit Singh

J. Comb. Optim., 2016

2014

A Divide and Conquer Method to Compute Binomial Ideals.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A Geometric Approach to Graph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Completely Positive formulation of the Graph Isomorphism Problem

[BibT_eX]

[DOI]

CoRR, 2013

Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.

[BibT_eX]

[DOI]

Sumit Singh

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2011

A saturation algorithm for homogeneous binomial ideals.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2011

2010

Generalized Reduction to Compute toric ideals.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

2009

Critically indecomposable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Polynomial irreducibility testing through Minkowski summand computation.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Implied Set Closure and Its Application to Memory Consistency Verification.

[BibT_eX]

[DOI]

Surender Baswana

Vishal Powar

Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007

Symbolic Path Sensitization Analysis and Applications.

[BibT_eX]

[DOI]

Jian Kang

Proceedings of the 16th Asian Test Symposium, 2007

2006

Algorithms on Graphs with Small Dominating Targets.

[BibT_eX]

[DOI]

Divesh Aggarwal

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

On Indecomposability Preserving Elimination Sequences.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Some Algorithms on Conditionally Critical Indecomposable Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Domination Search on Graphs with Low Dominating-Target-Number.

[BibT_eX]

[DOI]

Divesh Aggarwal

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Conditionally Critical Indecomposable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

End-to-End Delay Heuristics for Adaptive Optical Wireless Networks.

[BibT_eX]

[DOI]

Ahmed M. Mahdy

Proceedings of the 12th International Workshop on Modeling, 2004

A nonparametric classifier for unsegmented text.

[BibT_eX]

[DOI]

George Nagy

Ashutosh Joshi

Mukkai S. Krishnamoorthy

Proceedings of the Document Recognition and Retrieval XI, 2004

Broadband Optical Wireless Internet: Delay Optimization.

[BibT_eX]

[DOI]

Ahmed M. Mahdy

Proceedings of the 1st International Conference on Broadband Networks (BROADNETS 2004), 2004

2003

Modeling Fault Coverage of Random Test Patterns.

[BibT_eX]

[DOI]

Hailong Cui

J. Electron. Test., 2003

Indirect Symbolic Correlation Approach to Unsegmented Text Recognition.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2003

2002

A Novel Method to Improve the Test Efficiency of VLSI Tests.

[BibT_eX]

[DOI]

Hailong Cui

Proceedings of the 7th Asia and South Pacific Design Automation Conference (ASP-DAC 2002), 2002

2001

Design Verification and Functional Testing of FiniteState Machines.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on VLSI Design (VLSI Design 2001), 2001

2000

Exploiting don't cares to enhance functional tests.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE International Test Conference 2000, 2000

1999

A synthesis for testability scheme for finite state machines using clock control.

[BibT_eX]

[DOI]

Kent L. Einspahr

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999

Empirical Computation of Reject Ratio in VLSI Testing.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999

1998

Synthesis of Sequential Circuits with Clock Control to Improve Testability.

[BibT_eX]

[DOI]

Kent L. Einspahr

Proceedings of the 7th Asian Test Symposium (ATS '98), 2-4 December 1998, Singapore, 1998

1997

Synthesis for Testability by Two-Clock Control.

[BibT_eX]

[DOI]

Kent L. Einspahr

Proceedings of the 10th International Conference on VLSI Design (VLSI Design 1997), 1997

1993

An analog neural network to solve the hamiltonian cycle problem.

[BibT_eX]

[DOI]

Laszlo Fulop

Neural Networks, 1993

1991

Constrained Integer Approximation to Planar Line Intersection.

[BibT_eX]

[DOI]

Maharaj Mukherjee

George Nagy

Inf. Process. Lett., 1991

1990

A neural algorithm to solve the Hamiltonian cycle problem.

[BibT_eX]

[DOI]