Chandan K. Dubey

15 papers B 1Misc 2Journal 10Unranked 2
YearRankTypeTitle / Venue / Authors
2016 J jnl
Improved hardness results for unique shortest vector problem.
Inf. Process. Lett.
Divesh Aggarwal, Chandan K. Dubey
2014 J jnl
Computing the $p$-adic Canonical Quadratic Form in Polynomial Time.
CoRR
Chandan K. Dubey, Thomas Holenstein
2014 J jnl
Generating a Quadratic Forms from a Given Genus.
CoRR
Chandan K. Dubey, Thomas Holenstein
2014 — conf
Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power.
APPROX-RANDOM
Chandan K. Dubey, Thomas Holenstein
2014 J jnl
Sampling a Uniformly Random Solution of a Quadratic Equation over Quotient Rings.
CoRR
Chandan K. Dubey, Thomas Holenstein
2013 J jnl
Improved hardness results for unique shortest vector problem.
Electron. Colloquium Comput. Complex.
Divesh Aggarwal, Chandan K. Dubey
2011 J jnl
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
CoRR
Chandan K. Dubey, Thomas Holenstein
2011 — conf
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle.
APPROX-RANDOM
Chandan K. Dubey, Thomas Holenstein
2011 J jnl
Hardness results for approximating the bandwidth.
J. Comput. Syst. Sci.
Chandan K. Dubey, Uriel Feige, Walter Unger
2011 J jnl
Improved hardness results for unique shortest vector problem
CoRR
Divesh Aggarwal, Chandan K. Dubey
2009 J jnl
Critically indecomposable graphs.
Discret. Appl. Math.
Chandan K. Dubey, Shashank K. Mehta
2006 B conf
Algorithms on Graphs with Small Dominating Targets.
ISAAC
Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta
2006 Misc conf
On Indecomposability Preserving Elimination Sequences.
COCOON
Chandan K. Dubey, Shashank K. Mehta
2005 Misc conf
Conditionally Critical Indecomposable Graphs.
COCOON
Chandan K. Dubey, Shashank K. Mehta, Jitender S. Deogun
2005 J jnl
Some Algorithms on Conditionally Critical Indecomposable Graphs.
Electron. Notes Discret. Math.
Chandan K. Dubey, Shashank K. Mehta