Chandan K. Dubey

Inf. Process. Lett., 2016

2014

Generating a Quadratic Forms from a Given Genus.

[BibT_eX]

[DOI]

CoRR, 2014

Computing the $p$-adic Canonical Quadratic Form in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2014

Sampling a Uniformly Random Solution of a Quadratic Equation over Quotient Rings.

[BibT_eX]

[DOI]

CoRR, 2014

Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2011

Hardness results for approximating the bandwidth.

[BibT_eX]

[DOI]

Uriel Feige

Walter Unger

J. Comput. Syst. Sci., 2011

Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2009

Critically indecomposable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

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

Conditionally Critical Indecomposable Graphs.

[BibT_eX]

[DOI]