Ramesh Krishnamurti

2008
33	EE	Daya Ram Gaur, Ramesh Krishnamurti: Self-duality of bounded monotone boolean functions and related problems. Discrete Applied Mathematics 156(10): 1598-1605 (2008)
32	EE	Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli: The capacitated max k -cut problem. Math. Program. 115(1): 65-72 (2008)
2007
31		Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta: Generalized Watchman Route Problem with Discrete View Cost. CCCG 2007: 241-244
30	EE	Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta: Metric View Planning Problem with Traveling Cost and Visibility Range. ICRA 2007: 1292-1297
29	EE	Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta: View Planning Problem with Combined View and Traveling Cost. ICRA 2007: 711-716
2006
28	EE	Kui Yue, Daniel Huber, Burcu Akinci, Ramesh Krishnamurti: The ASDMCon Project: The Challenge of Detecting Defects on Construction Sites. 3DPVT 2006: 1048-1055
27		Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch: Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD 2006: 85-94
26	EE	Rajeev Kohli, Ramesh Krishnamurti, Kamel Jedidi: Subset-conjunctive rules for breast cancer diagnosis. Discrete Applied Mathematics 154(7): 1100-1112 (2006)
25	EE	Snezana Mitrovic-Minic, Ramesh Krishnamurti: The multiple TSP with time windows: vehicle bounds based on precedence graphs. Oper. Res. Lett. 34(1): 111-120 (2006)
2005
24	EE	Daya Ram Gaur, Ramesh Krishnamurti: Faster approximation algorithms for scheduling tasks with a choice of start times. CCCG 2005: 11-14
23	EE	Daya Ram Gaur, Ramesh Krishnamurti: The Capacitated max-k-cut Problem. ICCSA (4) 2005: 670-679
2004
22	EE	Daya Ram Gaur, Ramesh Krishnamurti: Average Case Self-Duality of Monotone Boolean Functions. Canadian Conference on AI 2004: 322-338
21	EE	Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani: Average performance of greedy heuristics for the integer knapsack problem. European Journal of Operational Research 154(1): 36-45 (2004)
2003
20	EE	Daya Ram Gaur, Ramesh Krishnamurti: Scheduling Intervals Using Independent Sets in Claw-Free Graphs. ICCSA (1) 2003: 254-262
19	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)
18	EE	Arvind Gupta, Ramesh Krishnamurti: Parallel Algorithms For Vehicle Routing Problems. Parallel Processing Letters 13(4): 673-687 (2003)
17	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
16	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
15		Daya Ram Gaur, Ramesh Krishnamurti: Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. J. Comb. Optim. 5(2): 167-173 (2001)
2000
14	EE	Daya Ram Gaur, Ramesh Krishnamurti: Self-Duality of Bounded Monotone Boolean Functions and Related Problems. ALT 2000: 209-223
13		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
12	EE	Daya Ram Gaur, Ramesh Krishnamurti: Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. ISAAC 1999: 49-55
11	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)
1995
10	EE	Rajeev Kohli, Ramesh Krishnamurti: Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. Discrete Applied Mathematics 56(1): 37-48 (1995)
9	EE	Ramesh Krishnamurti, Bhagirath Narahari: An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems. SIAM J. Discrete Math. 8(4): 661-669 (1995)
1994
8	EE	Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani: The Minimum Satisfiability Problem. SIAM J. Discrete Math. 7(2): 275-283 (1994)
1993
7		Bhagirath Narahari, Ramesh Krishnamurti: Scheduling Independent Tasks of Partitionable Hypercube Multiprocessors. IPPS 1993: 118-122
6		Alok N. Choudhary, Bhagirath Narahari, Ramesh Krishnamurti: An Efficient Heuristic Scheme for Dynamic Remapping of Parallel Computations. Parallel Computing 19(6): 621-632 (1993)
1992
5		Ramesh Krishnamurti, Bhagirath Narahari: Preemptive Scheduling of Independent Jobs on Partitionable Parallel Architectures. ICPP (1) 1992: 268-275
4		Ramesh Krishnamurti: An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems. IEEE Trans. Computers 41(12): 1572-1579 (1992)
3		Ramesh Krishnamurti, Bhagirath Narahari: Optimal Subcube Assignment for Partitionable Hypercubes. Parallel Processing Letters 2: 89-95 (1992)
1989
2		Rajeev Kohli, Ramesh Krishnamurti: Average Performance of Heuristics for Satisfiability. SIAM J. Discrete Math. 2(4): 508-523 (1989)
1988
1		Ramesh Krishnamurti, Eva Ma: The Processor Partitioning Problem In Special-Purpose Partitionable Systems. ICPP (1) 1988: 434-443

Coauthor Index

1	Burcu Akinci	[28]
2	Alok N. Choudhary	[6]
3	Artur Czumaj	[17]
4	Leszek Gasieniec	[17]
5	Daya Ram Gaur	[11] [12] [13] [14] [15] [16] [17] [19] [20] [22] [23] [24] [27] [32] [33]
6	Arvind Gupta	[18] [19]
7	Kamal Gupta	[29] [30] [31]
8	Daniel Huber	[28]
9	Toshihide Ibaraki	[13] [16]
10	Kamel Jedidi	[26]
11	Rajeev Kohli	[2] [8] [10] [21] [26] [32]
12	Eva Ma	[1]
13	Ján Manuch	[27]
14	Prakash Mirchandani	[8] [21]
15	Snezana Mitrovic-Minic	[25]
16	Bhagirath Narahari	[3] [5] [6] [7] [9]
17	Wojciech Rytter	[17]
18	Pengpeng Wang	[29] [30] [31]
19	Kui Yue	[28]
20	Michele Zito	[17]

Colors in the list of coauthors