 | 2011 |
|---|
| 9 |       | Chandan K. Dubey,
Thomas Holenstein:
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle.
APPROX-RANDOM 2011: 184-193 |
| 8 | | Chandan K. Dubey,
Thomas Holenstein:
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
CoRR abs/1106.2619: (2011) |
| 7 | | Divesh Aggarwal,
Chandan K. Dubey:
Improved hardness results for unique shortest vector problem
CoRR abs/1112.1564: (2011) |
| 6 | | Chandan K. Dubey,
Uriel Feige,
Walter Unger:
Hardness results for approximating the bandwidth.
J. Comput. Syst. Sci. 77(1): 62-90 (2011) |
| 2009 |
|---|
| 5 | | Chandan K. Dubey,
Shashank K. Mehta:
Critically indecomposable graphs.
Discrete Applied Mathematics 157(1): 149-163 (2009) |
| 2006 |
|---|
| 4 | | Chandan K. Dubey,
Shashank K. Mehta:
On Indecomposability Preserving Elimination Sequences.
COCOON 2006: 42-51 |
| 3 | | Divesh Aggarwal,
Chandan K. Dubey,
Shashank K. Mehta:
Algorithms on Graphs with Small Dominating Targets.
ISAAC 2006: 141-152 |
| 2005 |
|---|
| 2 | | Chandan K. Dubey,
Shashank K. Mehta,
Jitender S. Deogun:
Conditionally Critical Indecomposable Graphs.
COCOON 2005: 690-700 |
| 1 | | Chandan K. Dubey,
Shashank K. Mehta:
Some Algorithms on Conditionally Critical Indecomposable Graphs.
Electronic Notes in Discrete Mathematics 22: 315-319 (2005) |
Data released under the ODC-BY 1.0 license — See also our legal information page