Daya Ram Gaur

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 23

Top Topics

Integer Program

Negative Matrix Factorization

Vehicle Routing

Constraint Satisfaction

Top Venues

Discret. Appl. Math.

Publications

Sajad Fathi Hafshejani, Daya Ram Gaur, Robert Benkoczi
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method. CALDAM (2024)
Sajad Fathi Hafshejani, Daya Ram Gaur, Robert Benkoczi
On Implementing a Two-Step Interior Point Method for Solving Linear Programs. Algorithms 17 (7) (2024)
Vijay Adoni, Sajad Fathi Hafshejani, Daya Ram Gaur
Empirical Evaluation of A Quantum Accelerated Approach for The Central Path Method in Linear Programming. VLDB Workshops (2023)
Leila Karimi, Vijay Adoni, Daya Ram Gaur
Resource Management in Device-to-Device Communications. CALDAM (2023)
David Neufeld, Sajad Fathi Hafshejani, Daya Ram Gaur, Robert Benkoczi
A Hybrid Quantum Algorithm for Load Flow. CoRR (2023)
Sajad Fathi Hafshejani, Daya Ram Gaur, Shahadat Hossain, Robert Benkoczi
Binary Orthogonal Non-negative Matrix Factorization. ICONIP (5) (2022)
Robert Benkoczi, Daya Ram Gaur, Naya Nagy, Marius Nagy, Shahadat Hossain
Quantum Bitcoin Mining. Entropy 24 (3) (2022)
Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti
A primal-dual approximation algorithm for Minsat. Discret. Appl. Math. 319 (2022)
Chowdhury Nawrin Ferdous, Leila Karimi, Daya Ram Gaur
Integer Programs for Contention Aware Connected Dominating Sets in Wireless Multi-Hop Networks. WCNC (2022)
Sajad Fathi Hafshejani, Daya Ram Gaur, Shahadat Hossain, Robert Benkoczi
Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization. CoRR (2021)
Daya Ram Gaur, Muhammad Khan
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products. ISAIM (2020)
Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti
On the Minimum Satisfiability Problem. CALDAM (2020)
Robert Benkoczi, Daya Ram Gaur, Shahadat Hossain, Muhammad Khan, Ajay Raj Tedlapu
Evolutionary hot-spots in software systems. ICSE (Companion Volume) (2020)
Daya Ram Gaur, Muhammad Khan
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products. CoRR (2020)
Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
Improved approximation algorithms for cumulative VRP with stochastic demands. Discret. Appl. Math. 280 (2020)
Daya Ram Gaur, N. S. Narayanaswamy
Preface: CALDAM 2017. Discret. Appl. Math. 286 (2020)
Peash Ranjan Saha, Salimur Choudhury, Daya Ram Gaur
Interference Minimization for Device-to-Device Communications: A Combinatorial Approach. WCNC (2019)
Robert Benkoczi, Daya Ram Gaur, Shahadat Hossain, Muhammad A. Khan
A design structure matrix approach for measuring co-change-modularity of software products. MSR (2018)
Robert Benkoczi, Daya Ram Gaur, Xiao Zhang
Order Preserving Barrier Coverage with Weighted Sensors on a Line. AAIM (2018)
Daya Ram Gaur, Rishi Ranjan Singh
A heuristic for cumulative vehicle routing using column generation. Discret. Appl. Math. 228 (2017)
Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
Approximation Algorithms for Cumulative VRP with Stochastic Demands. CALDAM (2016)
Robert Benkoczi, Ram Dahal, Daya Ram Gaur
Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs. IWOCA (2016)
Robert Benkoczi, Daya Ram Gaur, Mark Thom
A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line. ALGOSENSORS (2016)
Selim G. Akl, Robert Benkoczi, Daya Ram Gaur, Hossam S. Hassanein, Shahadat Hossain, Mark Thom
On a class of covering problems with variable capacities in wireless networks. Theor. Comput. Sci. 575 (2015)
Daya Ram Gaur, Rishi Ranjan Singh
Cumulative Vehicle Routing Problem: A Column Generation Approach. CALDAM (2015)
Robert Benkoczi, Zachary Friggstad, Daya Ram Gaur, Mark Thom
Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line. ALGOSENSORS (2015)
Daya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh
Star Bi-Coloring of Bipartite Graphs using Column Generation. CTW (2015)
Daya Ram Gaur
On Resolution Like Proofs of Monotone Self-Dual Functions. ISAIM (2014)
Selim G. Akl, Robert Benkoczi, Daya Ram Gaur, Hossam S. Hassanein, Shahadat Hossain, Mark Thom
On a Class of Covering Problems with Variable Capacities in Wireless Networks. WALCOM (2014)
Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
Routing vehicles to minimize fuel consumption. Oper. Res. Lett. 41 (6) (2013)
Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli
-cut problem. Math. Program. 126 (1) (2011)
Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli
Conflict Resolution in the Scheduling of Television Commercials. Oper. Res. 57 (5) (2009)
Salimur Choudhury, Daya Ram Gaur, Ramesh Krishnamurti
An Approximation Algorithm for Max k-Uncut with Capacity Constraints. CSO (2) (2009)
Daya Ram Gaur, Kazuhisa Makino
On the fractional chromatic number of monotone self-dual Boolean functions. Discret. Math. 309 (4) (2009)
Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli
-cut problem. Math. Program. 115 (1) (2008)
Daya Ram Gaur, Ramesh Krishnamurti
Self-duality of bounded monotone boolean functions and related problems. Discret. Appl. Math. 156 (10) (2008)
Ján Manuch, Daya Ram Gaur
Fitting protein Chains to cubic Lattice is NP-Complete. J. Bioinform. Comput. Biol. 6 (1) (2008)
Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
) time. CCCG (2007)
Daya Ram Gaur, Kazuhisa Makino
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. FAW (2007)
Ján Manuch, Daya Ram Gaur
Fitting Protein Chains to Cubic Lattice is NP-Complete. APBC (2007)
Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs
Berge's theorem for the maximum charge problem. Discret. Optim. 3 (2) (2006)
Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD (2006)
Daya Ram Gaur, Ramesh Krishnamurti
Faster approximation algorithms for scheduling tasks with a choice of start times. CCCG (2005)
Daya Ram Gaur, Ramesh Krishnamurti
The Capacitated max-k-cut Problem. ICCSA (4) (2005)
Daya Ram Gaur, Ramesh Krishnamurti
Average Case Self-Duality of Monotone Boolean Functions. Canadian Conference on AI (2004)
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) (2003)
Daya Ram Gaur, Ramesh Krishnamurti
Scheduling Intervals Using Independent Sets in Claw-Free Graphs. ICCSA (1) (2003)
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) (2003)
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) (2002)
Daya Ram Gaur, Ramesh Krishnamurti
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. J. Comb. Optim. 5 (2) (2001)
Daya Ram Gaur, Ramesh Krishnamurti
Self-Duality of Bounded Monotone Boolean Functions and Related Problems. ALT (2000)
Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. ESA (2000)
Ramesh Krishnamurti, Daya Ram Gaur
An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems. Inf. Process. Lett. 72 (5-6) (1999)
Daya Ram Gaur, Ramesh Krishnamurti
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. ISAAC (1999)
Daya Ram Gaur, W. Ken Jackson, William S. Havens
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure. AAAI/IAAI (1997)
William S. Havens, Daya Ram Gaur, Russell Ovans
An Architecture for Building Multi-Agent Systems. SCAI (1995)