| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Manuch, J. & Gaur, D. | Fitting Protein Chains to Cubic Lattice is NP-complete | 2008 | To appear in Journal of Bioinformatics and Computational Biology | article | |
| Gaur, D. & Makino, K. | On the fractional chromatic number of monotone self-dual boolean functions | 2008 | Accepted in Discrete Mathematics, pending revisions. | article | |
| Gaur, D., Krishnamurti, R. & Kohli, R. | Conflict resolution in the scheduling of television commercials | 2008 | To appear in Operations Research | article | |
| Manuch, Já. & Gaur, D. R. | Fitting Protein Chains to Cubic Lattice is NP-Complete | 2007 | Proceedings of 5th Asia-Pacific Bioinformatics Conference, APBC 2007, 15-17 January 2007, Hong Kong, China. (Acceptance rate: 35/104) | inproceedings | URL |
| Gaur, D. R., Krishnamurti, R. & Kohli, R. | The capacitated max $k$--cut problem | 2007 | Mathematical Programming, Series A | article | URL |
| Gaur, D. R. & Bhattacharya, B. K. | Covering points by axis parallel lines | 2007 | 23rd European Workshop on Computational Geometry | conference | URL |
| Gaur, D. & Makino, K. | On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions | 2007 | FAW 2007 (Acceptance rate: 35/140) | inproceedings | DOI |
| Gaur, D. & Krishnamurti, R. | Self-Duality of Bounded Monotone Boolean Functions and related problems | 2007 | To appear in Discrete Applied Math. | article | DOI |
| Ben-Moshe, B., Bhattacharya, B., Das, S., Gaur, D. R. & Shi, Q. | Computing a planar widest empty $-siphon in $o(n^3)$ time | 2007 | Proceedings of the Canadian Conference on Compuational Geometry (CCCG) | inproceedings | |
| Krishnamurti, R., Gaur, D. R., Ghosh, S. & Sachs, H. | (NOTE) Berge's Theorem for the Maximum Charge Problem | 2006 | Discrete Optimization | article | DOI |
| Gaur, D. R., Krishnamurti, R. & Manuch, Já. | Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times | 2006 | Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK | inproceedings | |
| Gaur, D. & Krishnamurti, R. | LP rounding and Extensions | 2006 | Handbook of Approximation Algorithms and Metaheuristics | incollection | |
| Proceedings of the 8th PIMS Graduate Mathematics Modelling Camp, Edited by Elena Braverman and D. Gaur | 2005 | proceedings | URL | ||
| Gaur, D. R. & Krishnamurti, R. | Faster approximation algorithms for scheduling tasks with a choice of start times | 2005 | CCCG | inproceedings | URL |
| Gaur, D. R. & Krishnamurti, R. | The Capacitated max-k-cut Problem | 2005 | Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part IV | inproceedings | URL |
| Daya Gaur (Mentor), Zac Friggstad, J. G., Liu, C., Mizani, M., Radia, H., Ren, J., Thomas, D., Wang, P., Xu, L., Xu, O., Yin, Y. & Zhang, Z. | Problems in Facility Location Optimization | 2005 | Proceedings of the 8th PIMS Graduate Mathematics Modelling Camp | inproceedings | |
| Gaur, D. R. & Krishnamurti, R. | Average Case Self-Duality of Monotone Boolean Functions | 2004 | Advances in Artificial Intelligence, 17th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2004, London, Ontario, Canada, May 17-19, 2004, Proceedings | inproceedings | DOI |
| Gaur, D. R. & Krishnamurti, R. | Scheduling Intervals Using Independent Sets in Claw-Free Graphs | 2003 | Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part I | inproceedings | URL |
| Gaur, D. R., Gupta, A. & Krishnamurti, R. | A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times | 2003 | Inf. Process. Lett | article | DOI |
| Czumaj, A., Gsieniec, L., Gaur, D. R., Krishnamurti, R., Rytter, W. & Zito, M. | On polynomial-time approximation algorithms for the variable length scheduling problem | 2003 | Theoretical Computer Science | article | DOI |
| Gaur, D. R., Ibaraki, T. & Krishnamurti, R. | Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem | 2002 | Journal of Algorithms | article | DOI |
| Gaur, D. R. & Krishnamurti, R. | Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability | 2001 | J. Comb. Optim | article | DOI |
| Gaur, D. R. & Krishnamurti, R. | Self-Duality of Bounded Monotone Boolean Functions and Related Problems | 2000 | Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 2000, Proceedings | inproceedings | URL |
| Gaur, D. R., Ibaraki, T. & Krishnamurti, R. | Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem | 2000 | Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings | inproceedings | |
| Krishnamurti, R. & Gaur, D. R. | An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems | 1999 | Inf. Process. Lett | article | URL |
Created by JabRef on 19/12/2007.