Ramesh Krishnamurti

Affiliations:
  • Simon Fraser University, Burnaby, Canada


According to our database1, Ramesh Krishnamurti authored at least 62 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Multimodal Word Sense Disambiguation in Creative Practice.
Proceedings of the 19th IEEE International Conference on Machine Learning and Applications, 2020

On the Minimum Satisfiability Problem.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
A uniform characterization of augmented shapes.
Comput. Aided Des., 2019

Primal Heuristic for the Linear Ordering Problem.
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019

2018
Consistent Subset Problem with Two Labels.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

LP Rounding and Extensions.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Preface: CALDAM 2015.
Discret. Appl. Math., 2017

Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions.
CoRR, 2016

Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

Mixed Integer Program Heuristic for Linear Ordering Problem.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

2015
Lower Bound for the Unique Games Problem.
CoRR, 2015

A Network Model for the Hospital Routing Problem.
Proceedings of the ICORES 2015, 2015

2014
The cyclical scheduling problem.
Theor. Comput. Sci., 2014

2013
PTAS for Ordered Instances of Resource Allocation Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2011
Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks.
IEEE Trans. Multim., 2011

Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range.
IEEE Trans Autom. Sci. Eng., 2011

Erratum to: The capacitated max <i>k</i>-cut problem.
Math. Program., 2011

2010
Generalized Watchman Route Problem with Discrete View Cost.
Int. J. Comput. Geom. Appl., 2010

Integration of knowledge-based and generative systems for building characterization and prediction.
Artif. Intell. Eng. Des. Anal. Manuf., 2010

Streaming scalable video over WiMAX networks.
Proceedings of the 18th International Workshop on Quality of Service, 2010

2009
Conflict Resolution in the Scheduling of Television Commercials.
Oper. Res., 2009

An Approximation Algorithm for Max k-Uncut with Capacity Constraints.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

2008
The capacitated max <i>k</i> -cut problem.
Math. Program., 2008

Self-duality of bounded monotone boolean functions and related problems.
Discret. Appl. Math., 2008

2007
Probabilistic Greedy Heuristics for Satisfiability Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

LP Rounding and Extensions.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Sortal Structures: Supporting Representational Flexibility for Building Domain Processes.
Comput. Aided Civ. Infrastructure Eng., 2007

Metric View Planning Problem with Traveling Cost and Visibility Range.
Proceedings of the 2007 IEEE International Conference on Robotics and Automation, 2007

View Planning Problem with Combined View and Traveling Cost.
Proceedings of the 2007 IEEE International Conference on Robotics and Automation, 2007

2006
The multiple TSP with time windows: vehicle bounds based on precedence graphs.
Oper. Res. Lett., 2006

Berge's theorem for the maximum charge problem.
Discret. Optim., 2006

Subset-conjunctive rules for breast cancer diagnosis.
Discret. Appl. Math., 2006

Explicit design space?
Artif. Intell. Eng. Des. Anal. Manuf., 2006

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

The ASDMCon Project: The Challenge of Detecting Defects on Construction Sites.
Proceedings of the 3rd International Symposium on 3D Data Processing, 2006

2005
The Capacitated max-k-cut Problem.
Proceedings of the Computational Science and Its Applications, 2005

Faster approximation algorithms for scheduling tasks with a choice of start times.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Average performance of greedy heuristics for the integer knapsack problem.
Eur. J. Oper. Res., 2004

Average Case Self-Duality of Monotone Boolean Functions.
Proceedings of the Advances in Artificial Intelligence, 2004

2003
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theor. Comput. Sci., 2003

Parallel Algorithms For Vehicle Routing Problems.
Parallel Process. Lett., 2003

A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times.
Inf. Process. Lett., 2003

Scheduling Intervals Using Independent Sets in Claw-Free Graphs.
Proceedings of the Computational Science and Its Applications, 2003

2002
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
J. Algorithms, 2002

Representational Flexibility for Design.
Proceedings of the Artificial Intelligence in Design '02, 2002

2001
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.
J. Comb. Optim., 2001

2000
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
Proceedings of the Algorithms, 2000

1999
An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems.
Inf. Process. Lett., 1999

1995
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems.
SIAM J. Discret. Math., 1995

Joint Performance of Greedy Heuristics for the Integer Knapsack Problem.
Discret. Appl. Math., 1995

1994
The Minimum Satisfiability Problem.
SIAM J. Discret. Math., 1994

1993
An Efficient Heuristic Scheme for Dynamic Remapping of Parallel Computations.
Parallel Comput., 1993

Scheduling Independent Tasks of Partitionable Hypercube Multiprocessors.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

3 Parallel computer architectures.
Proceedings of the Computational Statistics., 1993

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

Optimal Subcube Assignment for Partitionable Hypercubes.
Parallel Process. Lett., 1992

A total-value greedy heuristic for the integer knapsack problem.
Oper. Res. Lett., 1992

Preemptive Scheduling of Independent Jobs on Partitionable Parallel Architectures.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

1989
Average Performance of Heuristics for Satisfiability.
SIAM J. Discret. Math., 1989

1988
The Processor Partitioning Problem In Special-Purpose Partitionable Systems.
Proceedings of the International Conference on Parallel Processing, 1988

1985
GKS Inquiry Functions within PROLOG.
Proceedings of the 6th European Computer Graphics Conference and Exhibition, 1985


  Loading...