GKS Inquiry Functions within PROLOG. - Pete Sykes; Ramesh Krishnamurti (Eurographics, 1985)

The Processor Partitioning Problem In Special-Purpose Partitionable Systems. - Ramesh Krishnamurti; Eva Ma (ICPP (1), 1988)

Average Performance of Heuristics for Satisfiability. - Rajeev Kohli; Ramesh Krishnamurti (SIAM J. Discret. Math., 1989)

Preemptive Scheduling of Independent Jobs on Partitionable Parallel Architectures. - Ramesh Krishnamurti; Bhagirath Narahari (ICPP (1), 1992)

A total-value greedy heuristic for the integer knapsack problem. - Rajeev Kohli; Ramesh Krishnamurti (Oper. Res. Lett., 1992)

Optimal Subcube Assignment for Partitionable Hypercubes. - Ramesh Krishnamurti; Bhagirath Narahari (Parallel Process. Lett., 1992)

An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems. - Ramesh Krishnamurti (IEEE Trans. Computers, 1992)

3 Parallel computer architectures. - Ramesh Krishnamurti; Bhagirath Narahari (Computational Statistics, 1993)

Scheduling Independent Tasks of Partitionable Hypercube Multiprocessors. - Bhagirath Narahari; Ramesh Krishnamurti (IPPS, 1993)

An Efficient Heuristic Scheme for Dynamic Remapping of Parallel Computations. - Alok N. Choudhary; Bhagirath Narahari; Ramesh Krishnamurti (Parallel Comput., 1993)

The Minimum Satisfiability Problem. - Rajeev Kohli; Ramesh Krishnamurti; Prakash Mirchandani (SIAM J. Discret. Math., 1994)

Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. - Rajeev Kohli; Ramesh Krishnamurti (Discret. Appl. Math., 1995)

An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems. - Ramesh Krishnamurti; Bhagirath Narahari (SIAM J. Discret. Math., 1995)

An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems. - Ramesh Krishnamurti; Daya Ram Gaur (Inf. Process. Lett., 1999)

Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. - Daya Ram Gaur; Toshihide Ibaraki; Ramesh Krishnamurti (ESA, 2000)

Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. - Daya Ram Gaur; Ramesh Krishnamurti (J. Comb. Optim., 2001)

Representational Flexibility for Design. - Rudi Stouffs; Ramesh Krishnamurti (AID, 2002)

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. - Daya Ram Gaur; Toshihide Ibaraki; Ramesh Krishnamurti (J. Algorithms, 2002)

Scheduling Intervals Using Independent Sets in Claw-Free Graphs. - Daya Ram Gaur; Ramesh Krishnamurti (ICCSA (1), 2003)

A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. - Daya Ram Gaur; Arvind Gupta; Ramesh Krishnamurti (Inf. Process. Lett., 2003)

Parallel Algorithms For Vehicle Routing Problems. - Arvind Gupta; Ramesh Krishnamurti (Parallel Process. Lett., 2003)

On polynomial-time approximation algorithms for the variable length scheduling problem. - Artur Czumaj; Leszek Gasieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Rytter; Michele Zito 001 (Theor. Comput. Sci., 2003)

Average Case Self-Duality of Monotone Boolean Functions. - Daya Ram Gaur; Ramesh Krishnamurti (Canadian AI, 2004)

Average performance of greedy heuristics for the integer knapsack problem. - Rajeev Kohli; Ramesh Krishnamurti; Prakash Mirchandani (Eur. J. Oper. Res., 2004)

Faster approximation algorithms for scheduling tasks with a choice of start times. - Daya Ram Gaur; Ramesh Krishnamurti (CCCG, 2005)

The Capacitated max-k-cut Problem. - Daya Ram Gaur; Ramesh Krishnamurti (ICCSA (4), 2005)

The ASDMCon Project: The Challenge of Detecting Defects on Construction Sites. - Kui Yue; Daniel Huber; Burcu Akinci; Ramesh Krishnamurti (3DPVT, 2006)

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. - Daya Ram Gaur; Ramesh Krishnamurti; Ján Manuch (ACiD, 2006)

Explicit design space? - Ramesh Krishnamurti (Artif. Intell. Eng. Des. Anal. Manuf., 2006)

Subset-conjunctive rules for breast cancer diagnosis. - Rajeev Kohli; Ramesh Krishnamurti; Kamel Jedidi (Discret. Appl. Math., 2006)

Berge's theorem for the maximum charge problem. - Ramesh Krishnamurti; Daya Ram Gaur; Subir Kumar Ghosh; Horst Sachs (Discret. Optim., 2006)

The multiple TSP with time windows: vehicle bounds based on precedence graphs. - Snezana Mitrovic-Minic; Ramesh Krishnamurti (Oper. Res. Lett., 2006)

View Planning Problem with Combined View and Traveling Cost. - Pengpeng Wang; Ramesh Krishnamurti; Kamal Gupta 001 (ICRA, 2007)

Metric View Planning Problem with Traveling Cost and Visibility Range. - Pengpeng Wang; Ramesh Krishnamurti; Kamal Gupta 001 (ICRA, 2007)

Sortal Structures: Supporting Representational Flexibility for Building Domain Processes. - Rudi Stouffs; Ramesh Krishnamurti; Kuhn Park (Comput. Aided Civ. Infrastructure Eng., 2007)

LP Rounding and Extensions. - Ramesh Krishnamurti; Daya Ram Gaur (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Probabilistic Greedy Heuristics for Satisfiability Problems. - Ramesh Krishnamurti; Rajeev Kohli (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Self-duality of bounded monotone boolean functions and related problems. - Daya Ram Gaur; Ramesh Krishnamurti (Discret. Appl. Math., 2008)

The capacitated max k -cut problem. - Daya Ram Gaur; Ramesh Krishnamurti; Rajeev Kohli (Math. Program., 2008)

An Approximation Algorithm for Max k-Uncut with Capacity Constraints. - Salimur Choudhury; Daya Ram Gaur; Ramesh Krishnamurti (CSO (2), 2009)

Conflict Resolution in the Scheduling of Television Commercials. - Daya Ram Gaur; Ramesh Krishnamurti; Rajeev Kohli (Oper. Res., 2009)

Streaming scalable video over WiMAX networks. - Somsubhra Sharangi; Ramesh Krishnamurti; Mohamed Hefeeda (IWQoS, 2010)

Integration of knowledge-based and generative systems for building characterization and prediction. - Ajla Aksamija; Kui Yue; Hyunjoo Kim; François Grobler; Ramesh Krishnamurti (Artif. Intell. Eng. Des. Anal. Manuf., 2010)

Generalized Watchman Route Problem with Discrete View Cost. - Pengpeng Wang; Ramesh Krishnamurti; Kamal Gupta 001 (Int. J. Comput. Geom. Appl., 2010)

Erratum to: The capacitated max k-cut problem. - Daya Ram Gaur; Ramesh Krishnamurti; Rajeev Kohli (Math. Program., 2011)

Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range. - Pengpeng Wang; Kamal Gupta 001; Ramesh Krishnamurti (IEEE Trans Autom. Sci. Eng., 2011)

Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks. - Somsubhra Sharangi; Ramesh Krishnamurti; Mohamed Hefeeda (IEEE Trans. Multim., 2011)

Estimating the Interior Layout of Buildings Using a Shape Grammar to Capture Building Style. - Kui Yue; Ramesh Krishnamurti; François Grobler (J. Comput. Civ. Eng., 2012)

PTAS for Ordered Instances of Resource Allocation Problems. - Kamyar Khodamoradi; Ramesh Krishnamurti; Arash Rafiey; Georgios Stamoulis (FSTTCS, 2013)

The cyclical scheduling problem. - Binay Bhattacharya; Soudipta Chakraborty; Ehsan Iranmanesh; Ramesh Krishnamurti (Theor. Comput. Sci., 2014)

A Network Model for the Hospital Routing Problem. - Arash Rafiey; Vladyslav Sokol; Ramesh Krishnamurti; Snezana Mitrovic-Minic; Abraham P. Punnen; Krishna Teja Malladi (ICORES, 2015)

Lower Bound for the Unique Games Problem. - Rajeev Kohli; Ramesh Krishnamurti (CoRR, 2015)

Mixed Integer Program Heuristic for Linear Ordering Problem. - Ehsan Iranmanesh; Ramesh Krishnamurti (ICORES, 2016)

Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations. - Kamyar Khodamoradi; Ramesh Krishnamurti (ICORES, 2016)

PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions. - Kamyar Khodamoradi; Ramesh Krishnamurti; Arash Rafiey; Georgios Stamoulis (CoRR, 2016)

Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System. - Ante Custic; Ehsan Iranmanesh; Ramesh Krishnamurti (CALDAM, 2017)

Preface: CALDAM 2015. - Sumit Ganguly; Ramesh Krishnamurti (Discret. Appl. Math., 2017)

LP Rounding and Extensions. - Daya Ram Gaur; Ramesh Krishnamurti (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Consistent Subset Problem with Two Labels. - Kamyar Khodamoradi; Ramesh Krishnamurti; Bodhayan Roy (CALDAM, 2018)

A Multi-resolution Design Methodology Based on Discrete Models. - Manuel Ladron de Guevara; Luis Borunda; Ramesh Krishnamurti (CAAD Futures, 2019)

Primal Heuristic for the Linear Ordering Problem. - Ravi Agrawal; Ehsan Iranmanesh; Ramesh Krishnamurti (ICORES, 2019)

A uniform characterization of augmented shapes. - Rudi Stouffs; Ramesh Krishnamurti (Comput. Aided Des., 2019)

On the Minimum Satisfiability Problem. - Umair Arif; Robert Benkoczi; Daya Ram Gaur; Ramesh Krishnamurti (CALDAM, 2020)

Multimodal Word Sense Disambiguation in Creative Practice. - Manuel Ladron de Guevara; Christopher George; Akshat Gupta; Daragh Byrne; Ramesh Krishnamurti (ICMLA, 2020)

A primal-dual approximation algorithm for Minsat. - Umair Arif; Robert Benkoczi; Daya Ram Gaur; Ramesh Krishnamurti (Discret. Appl. Math., 2022)