Chandan K. Dubey

Publications by Year

Research Areas

Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Cryptography and Data Security, Mathematical Dynamics and Fractals, Polynomial and algebraic computation

Most-Cited Works

• → Hardness results for approximating the bandwidth(2010)29 cited
• → Algorithms on Graphs with Small Dominating Targets(2006)7 cited
• → Conditionally Critical Indecomposable Graphs(2005)5 cited
• → Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle(2011)5 cited
• → Computing the $p$-adic Canonical Quadratic Form in Polynomial Time(2014)2 cited
• → Sampling a Uniform Random Solution of a Quadratic Equation Modulo $p^k$(2014)2 cited
• → Some Algorithms on Conditionally Critical Indecomposable Graphs(2005)1 cited
• → Critically indecomposable graphs(2008)
• → Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power(2014)