Daya Ram Gaur

Orcid: 0000-0001-6876-6000

According to our database1, Daya Ram Gaur authored at least 53 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
A Hybrid Quantum Algorithm for Load Flow.
CoRR, 2023

Empirical Evaluation of A Quantum Accelerated Approach for The Central Path Method in Linear Programming.
Proceedings of the Joint Proceedings of Workshops at the 49th International Conference on Very Large Data Bases (VLDB 2023), Vancouver, Canada, August 28, 2023

Resource Management in Device-to-Device Communications.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Quantum Bitcoin Mining.
Entropy, 2022

A primal-dual approximation algorithm for Minsat.
Discret. Appl. Math., 2022

Binary Orthogonal Non-negative Matrix Factorization.
CoRR, 2022

Integer Programs for Contention Aware Connected Dominating Sets in Wireless Multi-Hop Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

Binary Orthogonal Non-negative Matrix Factorization.
Proceedings of the Neural Information Processing - 29th International Conference, 2022

2021
Conditions for Advantageous Quantum Bitcoin Mining.
CoRR, 2021

Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization.
CoRR, 2021

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

Improved approximation algorithms for cumulative VRP with stochastic demands.
Discret. Appl. Math., 2020

Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Evolutionary hot-spots in software systems.
Proceedings of the ICSE '20: 42nd International Conference on Software Engineering, Companion Volume, Seoul, South Korea, 27 June, 2020

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

2019
Interference Minimization for Device-to-Device Communications: A Combinatorial Approach.
Proceedings of the 2019 IEEE Wireless Communications and Networking Conference, 2019

2018
A design structure matrix approach for measuring co-change-modularity of software products.
Proceedings of the 15th International Conference on Mining Software Repositories, 2018

Order Preserving Barrier Coverage with Weighted Sensors on a Line.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

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

2017
A heuristic for cumulative vehicle routing using column generation.
Discret. Appl. Math., 2017

2016
Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Approximation Algorithms for Cumulative VRP with Stochastic Demands.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line.
Proceedings of the Algorithms for Sensor Systems, 2016

2015
On a class of covering problems with variable capacities in wireless networks.
Theor. Comput. Sci., 2015

Star Bi-Coloring of Bipartite Graphs using Column Generation.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Cumulative Vehicle Routing Problem: A Column Generation Approach.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
On Resolution Like Proofs of Monotone Self-Dual Functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2013
Routing vehicles to minimize fuel consumption.
Oper. Res. Lett., 2013

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

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

On the fractional chromatic number of monotone self-dual Boolean functions.
Discret. Math., 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

Fitting protein Chains to cubic Lattice is NP-Complete.
J. Bioinform. Comput. Biol., 2008

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

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

Computing a planar widest empty alpha-siphon in o(n<sup>3</sup>) time.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

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

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times.
Proceedings of the Algorithms and Complexity in Durham 2006, 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 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

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

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

1997
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1995
An Architecture for Building Multi-Agent Systems.
Proceedings of the Fifth Scandinavian Conference on Artificial Intelligence, 1995


  Loading...