Hardness results for approximating the bandwidth C Dubey, U Feige, W Unger Journal of Computer and System Sciences 77 (1), 62-90, 2011 | 28 | 2011 |

Approximating the closest vector problem using an approximate shortest vector oracle C Dubey, T Holenstein Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011 | 9 | 2011 |

Algorithms on graphs with small dominating targets D Aggarwal, CK Dubey, SK Mehta Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006 | 8 | 2006 |

Algorithms on graphs with small dominating targets D Aggarwal, CK Dubey, SK Mehta Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006 | 8 | 2006 |

Conditionally critical indecomposable graphs CK Dubey, SK Mehta, JS Deogun Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005 | 7 | 2005 |

Improved hardness results for unique shortest vector problem D Aggarwal, C Dubey Information Processing Letters 116 (10), 631-637, 2016 | 6 | 2016 |

Sampling a Uniform Random Solution of a Quadratic Equation Modulo C Dubey, T Holenstein arXiv preprint arXiv:1404.0281, 2014 | 2 | 2014 |

Improved hardness results for unique shortest vector problem D Aggarwal, C Dubey arXiv preprint arXiv:1112.1564, 2011 | 2 | 2011 |

Generating a Quadratic Forms from a Given Genus C Dubey, T Holenstein arXiv preprint arXiv:1409.6913, 2014 | 1 | 2014 |

Computing the -adic Canonical Quadratic Form in Polynomial Time C Dubey, T Holenstein arXiv preprint arXiv:1409.6199, 2014 | 1 | 2014 |

Critically indecomposable graphs CK Dubey, SK Mehta Discrete applied mathematics 157 (1), 149-163, 2009 | 1 | 2009 |

On bandwidth approximation of graphs C Dubey Master’s Thesis, Weizmann Institute of Science, 2008 | 1 | 2008 |

Some algorithms on conditionally critical indecomposable graphs CK Dubey, SK Mehta Electronic Notes in Discrete Mathematics 22, 315-319, 2005 | 1 | 2005 |

Sampling a Uniformly Random Solution of a Quadratic Equation over Quotient Rings C Dubey, T Holenstein arXiv preprint arXiv:1404.0281, 2014 | | 2014 |

Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power C Dubey, T Holenstein Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | | 2014 |

Generating a Lattice of a given Genus CK Dubey ETH Zurich, 2014 | | 2014 |

On indecomposability preserving elimination sequences CK Dubey, SK Mehta Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006 | | 2006 |

Dynamic Rule Based Spam Filtering CK Dubey, C Kirchner | | |

Domination and Connectivity Problems on Graphs with Bounded Dominating Target Number CK Dubey | | |

Infinite Pushdown Games CK Dubey, R Nalam | | |