|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 8 keywords
|
|
|
|
|
Results
Found 26 publication records. Showing 26 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli |
Erratum to: The capacitated max k-cut problem.  |
Math. Program.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Kazuhisa Makino |
On the fractional chromatic number of monotone self-dual Boolean functions. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli |
Conflict Resolution in the Scheduling of Television Commercials. |
Operations Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Salimur Choudhury, Daya Ram Gaur, Ramesh Krishnamurti |
An Approximation Algorithm for Max k-Uncut with Capacity Constraints. |
CSO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ján Manuch, Daya Ram Gaur |
Fitting protein Chains to cubic Lattice is NP-Complete. |
J. Bioinformatics and Computational Biology |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Self-duality of bounded monotone boolean functions and related problems. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli |
The capacitated max k -cut problem. |
Math. Program. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Kazuhisa Makino |
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. |
FAW |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Ján Manuch, Daya Ram Gaur |
Fitting Protein Chains to Cubic Lattice is NP-Complete. |
APBC |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs |
Berge's theorem for the maximum charge problem. |
Discrete Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch |
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Faster approximation algorithms for scheduling tasks with a choice of start times. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
The Capacitated max-k-cut Problem. |
ICCSA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Average Case Self-Duality of Monotone Boolean Functions. |
Canadian Conference on AI |
2004 |
DBLP DOI BibTeX RDF |
Machine Learning, Knowledge Representation, Satisfiability, Self-duality, Monotone Boolean Functions |
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Scheduling Intervals Using Independent Sets in Claw-Free Graphs. |
ICCSA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. |
J. Comb. Optim. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization |
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Self-Duality of Bounded Monotone Boolean Functions and Related Problems. |
ALT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Krishnamurti, Daya Ram Gaur |
An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut |
| 1 | Daya Ram Gaur, W. Ken Jackson, William S. Havens |
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure. |
AAAI/IAAI |
1997 |
DBLP BibTeX RDF |
|
| 1 | William S. Havens, Daya Ram Gaur, Russell Ovans |
An Architecture for Building Multi-Agent Systems. |
SCAI |
1995 |
DBLP BibTeX RDF |
|
Displaying result #1 - #26 of 26 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")