The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ramesh Krishnamurti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ramesh Krishnamurti
    An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:12, pp:1572-1579 [Journal]
  2. Kui Yue, Daniel Huber, Burcu Akinci, Ramesh Krishnamurti
    The ASDMCon Project: The Challenge of Detecting Defects on Construction Sites. [Citation Graph (0, 0)][DBLP]
    3DPVT, 2006, pp:1048-1055 [Conf]
  3. 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]
  4. 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]
  5. 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]
  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. Ramesh Krishnamurti, Eva Ma
    The Processor Partitioning Problem In Special-Purpose Partitionable Systems. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1988, pp:434-443 [Conf]
  11. Ramesh Krishnamurti, Bhagirath Narahari
    Preemptive Scheduling of Independent Jobs on Partitionable Parallel Architectures. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1992, pp:268-275 [Conf]
  12. Bhagirath Narahari, Ramesh Krishnamurti
    Scheduling Independent Tasks of Partitionable Hypercube Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:118-122 [Conf]
  13. 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]
  14. Rajeev Kohli, Ramesh Krishnamurti
    Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:1, pp:37-48 [Journal]
  15. Rajeev Kohli, Ramesh Krishnamurti, Kamel Jedidi
    Subset-conjunctive rules for breast cancer diagnosis. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:7, pp:1100-1112 [Journal]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. Snezana Mitrovic-Minic, Ramesh Krishnamurti
    The multiple TSP with time windows: vehicle bounds based on precedence graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:111-120 [Journal]
  21. Alok N. Choudhary, Bhagirath Narahari, Ramesh Krishnamurti
    An Efficient Heuristic Scheme for Dynamic Remapping of Parallel Computations. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1993, v:19, n:6, pp:621-632 [Journal]
  22. Arvind Gupta, Ramesh Krishnamurti
    Parallel Algorithms For Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2003, v:13, n:4, pp:673-687 [Journal]
  23. Ramesh Krishnamurti, Bhagirath Narahari
    Optimal Subcube Assignment for Partitionable Hypercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:89-95 [Journal]
  24. Rajeev Kohli, Ramesh Krishnamurti
    Average Performance of Heuristics for Satisfiability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:4, pp:508-523 [Journal]
  25. Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani
    The Minimum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:2, pp:275-283 [Journal]
  26. Ramesh Krishnamurti, Bhagirath Narahari
    An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:661-669 [Journal]
  27. 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]
  28. Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani
    Average performance of greedy heuristics for the integer knapsack problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:154, n:1, pp:36-45 [Journal]
  29. Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
    Generalized Watchman Route Problem with Discrete View Cost. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:241-244 [Conf]
  30. Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
    View Planning Problem with Combined View and Traveling Cost. [Citation Graph (0, 0)][DBLP]
    ICRA, 2007, pp:711-716 [Conf]
  31. Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
    Metric View Planning Problem with Traveling Cost and Visibility Range. [Citation Graph (0, 0)][DBLP]
    ICRA, 2007, pp:1292-1297 [Conf]

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


  33. Explicit design space? [Citation Graph (, )][DBLP]


  34. Integration of knowledge-based and generative systems for building characterization and prediction. [Citation Graph (, )][DBLP]


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


Search in 0.003secs, Finished in 0.004secs
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