| 2008 |
|---|
| 22 | EE | Daya Ram Gaur,
Ramesh Krishnamurti:
Self-duality of bounded monotone boolean functions and related problems.
Discrete Applied Mathematics 156(10): 1598-1605 (2008) |
| 21 | EE | Ján Manuch,
Daya Ram Gaur:
Fitting protein Chains to cubic Lattice is NP-Complete.
J. Bioinformatics and Computational Biology 6(1): 93-106 (2008) |
| 20 | EE | Daya Ram Gaur,
Ramesh Krishnamurti,
Rajeev Kohli:
The capacitated max k -cut problem.
Math. Program. 115(1): 65-72 (2008) |
| 2007 |
|---|
| 19 | EE | Ján Manuch,
Daya Ram Gaur:
Fitting Protein Chains to Cubic Lattice is NP-Complete.
APBC 2007: 153-164 |
| 18 | | Boaz 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 |
| 17 | EE | Daya Ram Gaur,
Kazuhisa Makino:
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions.
FAW 2007: 148-159 |
| 2006 |
|---|
| 16 | | Daya Ram Gaur,
Ramesh Krishnamurti,
Ján Manuch:
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times.
ACiD 2006: 85-94 |
| 15 | EE | Ramesh 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 |
|---|
| 14 | EE | Daya Ram Gaur,
Ramesh Krishnamurti:
Faster approximation algorithms for scheduling tasks with a choice of start times.
CCCG 2005: 11-14 |
| 13 | EE | Daya Ram Gaur,
Ramesh Krishnamurti:
The Capacitated max-k-cut Problem.
ICCSA (4) 2005: 670-679 |
| 2004 |
|---|
| 12 | EE | Daya Ram Gaur,
Ramesh Krishnamurti:
Average Case Self-Duality of Monotone Boolean Functions.
Canadian Conference on AI 2004: 322-338 |
| 2003 |
|---|
| 11 | EE | Daya Ram Gaur,
Ramesh Krishnamurti:
Scheduling Intervals Using Independent Sets in Claw-Free Graphs.
ICCSA (1) 2003: 254-262 |
| 10 | EE | Daya 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) |
| 9 | EE | Artur 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 |
|---|
| 8 | EE | Daya 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 |
|---|
| 7 | | Daya Ram Gaur,
Ramesh Krishnamurti:
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.
J. Comb. Optim. 5(2): 167-173 (2001) |
| 2000 |
|---|
| 6 | EE | Daya Ram Gaur,
Ramesh Krishnamurti:
Self-Duality of Bounded Monotone Boolean Functions and Related Problems.
ALT 2000: 209-223 |
| 5 | | Daya 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 |
|---|
| 4 | EE | Daya Ram Gaur,
Ramesh Krishnamurti:
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.
ISAAC 1999: 49-55 |
| 3 | EE | Ramesh 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 |
|---|
| 2 | | Daya Ram Gaur,
W. Ken Jackson,
William S. Havens:
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure.
AAAI/IAAI 1997: 215 |
| 1995 |
|---|
| 1 | | William S. Havens,
Daya Ram Gaur,
Russell Ovans:
An Architecture for Building Multi-Agent Systems.
SCAI 1995: 416-420 |
