The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daya Ram Gaur: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daya Ram Gaur, W. Ken Jackson, William S. Havens
    Detecting Unsatisfiable CSPs by Coloring the Micro-Structure. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:215- [Conf]
  2. Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch
    Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:85-94 [Conf]
  3. Daya Ram Gaur, Ramesh Krishnamurti
    Average Case Self-Duality of Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 2004, pp:322-338 [Conf]
  4. Daya Ram Gaur, Ramesh Krishnamurti
    Self-Duality of Bounded Monotone Boolean Functions and Related Problems. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:209-223 [Conf]
  5. Ján Manuch, Daya Ram Gaur
    Fitting Protein Chains to Cubic Lattice is NP-Complete. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:153-164 [Conf]
  6. Daya Ram Gaur, Ramesh Krishnamurti
    Faster approximation algorithms for scheduling tasks with a choice of start times. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:11-14 [Conf]
  7. Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
    Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:211-219 [Conf]
  8. Daya Ram Gaur, Ramesh Krishnamurti
    Scheduling Intervals Using Independent Sets in Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2003, pp:254-262 [Conf]
  9. Daya Ram Gaur, Ramesh Krishnamurti
    The Capacitated max-k-cut Problem. [Citation Graph (0, 0)][DBLP]
    ICCSA (4), 2005, pp:670-679 [Conf]
  10. Daya Ram Gaur, Ramesh Krishnamurti
    Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:49-55 [Conf]
  11. William S. Havens, Daya Ram Gaur, Russell Ovans
    An Architecture for Building Multi-Agent Systems. [Citation Graph (0, 0)][DBLP]
    SCAI, 1995, pp:416-420 [Conf]
  12. Daya Ram Gaur, Arvind Gupta, Ramesh Krishnamurti
    A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:2, pp:87-91 [Journal]
  13. Ramesh Krishnamurti, Daya Ram Gaur
    An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:5-6, pp:183-188 [Journal]
  14. Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
    Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:138-152 [Journal]
  15. Daya Ram Gaur, Ramesh Krishnamurti
    Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:2, pp:167-173 [Journal]
  16. Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
    On polynomial-time approximation algorithms for the variable length scheduling problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:489-495 [Journal]
  17. Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
    Computing a planar widest empty alpha-siphon in o(n3) time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:33-36 [Conf]
  18. Daya Ram Gaur, Kazuhisa Makino
    On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:148-159 [Conf]

  19. An Approximation Algorithm for Max k-Uncut with Capacity Constraints. [Citation Graph (, )][DBLP]


  20. Self-duality of bounded monotone boolean functions and related problems. [Citation Graph (, )][DBLP]


  21. On the fractional chromatic number of monotone self-dual Boolean functions. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002