Daya Ram Gaur Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli: Erratum to: The capacitated max k-cut problem. Math. Program. 126(1): 191 (2011)
2009
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSalimur Choudhury, Daya Ram Gaur, Ramesh Krishnamurti: An Approximation Algorithm for Max k-Uncut with Capacity Constraints. CSO (2) 2009: 934-938
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Kazuhisa Makino: On the fractional chromatic number of monotone self-dual Boolean functions. Discrete Mathematics 309(4): 867-877 (2009)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli: Conflict Resolution in the Scheduling of Television Commercials. Operations Research 57(5): 1098-1105 (2009)
2008
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: Self-duality of bounded monotone boolean functions and related problems. Discrete Applied Mathematics 156(10): 1598-1605 (2008)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJán Manuch, Daya Ram Gaur: Fitting protein Chains to cubic Lattice is NP-Complete. J. Bioinformatics and Computational Biology 6(1): 93-106 (2008)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli: The capacitated max k -cut problem. Math. Program. 115(1): 65-72 (2008)
2007
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJán Manuch, Daya Ram Gaur: Fitting Protein Chains to Cubic Lattice is NP-Complete. APBC 2007: 153-164
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi: Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Kazuhisa Makino: On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. FAW 2007: 148-159
2006
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti, Ján Manuch: Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD 2006: 85-94
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs: Berge's theorem for the maximum charge problem. Discrete Optimization 3(2): 174-178 (2006)
2005
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: Faster approximation algorithms for scheduling tasks with a choice of start times. CCCG 2005: 11-14
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: The Capacitated max-k-cut Problem. ICCSA (4) 2005: 670-679
2004
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: Average Case Self-Duality of Monotone Boolean Functions. Canadian Conference on AI 2004: 322-338
2003
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: Scheduling Intervals Using Independent Sets in Claw-Free Graphs. ICCSA (1) 2003: 254-262
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Arvind Gupta, Ramesh Krishnamurti: A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf. Process. Lett. 86(2): 87-91 (2003)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArtur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito: On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. 302(1-3): 489-495 (2003)
2002
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti: Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. J. Algorithms 43(1): 138-152 (2002)
2001
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. J. Comb. Optim. 5(2): 167-173 (2001)
2000
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: Self-Duality of Bounded Monotone Boolean Functions and Related Problems. ALT 2000: 209-223
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti: Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. ESA 2000: 211-219
1999
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, Ramesh Krishnamurti: Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. ISAAC 1999: 49-55
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamesh Krishnamurti, Daya Ram Gaur: An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems. Inf. Process. Lett. 72(5-6): 183-188 (1999)
1997
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaya Ram Gaur, W. Ken Jackson, William S. Havens: Detecting Unsatisfiable CSPs by Coloring the Micro-Structure. AAAI/IAAI 1997: 215
1995
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWilliam S. Havens, Daya Ram Gaur, Russell Ovans: An Architecture for Building Multi-Agent Systems. SCAI 1995: 416-420

Coauthor Index

1Boaz Ben-Moshe [18]
2Binay K. Bhattacharya [18]
3Salimur Choudhury [25]
4Artur Czumaj [9]
5Sandip Das [18]
6Leszek Gasieniec [9]
7Subir Kumar Ghosh [15]
8Arvind Gupta [10]
9William S. Havens [1] [2]
10Toshihide Ibaraki [5] [8]
11W. Ken Jackson [2]
12Rajeev Kohli [20] [23] [26]
13Ramesh Krishnamurti [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [20] [22] [23] [25] [26]
14Kazuhisa Makino [17] [24]
15Ján Manuch [16] [19] [21]
16Russell Ovans [1]
17Wojciech Rytter [9]
18Horst Sachs [15]
19Qiaosheng Shi [18]
20Michele Zito [9]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page