default search action
Daya Ram Gaur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Sajad Fathi Hafshejani
, Daya Ram Gaur
On Implementing a Two-Step Interior Point Method for Solving Linear Programs. Algorithms 17(7): 303 (2024) - [j20]Daya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh:
Star Bicolouring of Bipartite Graphs. Algorithms 17(9): 377 (2024) - [c32]Sajad Fathi Hafshejani, Daya Ram Gaur
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method. CALDAM 2024: 133-147 - 2023
- [c31]Leila Karimi, Vijay Adoni, Daya Ram Gaur
Resource Management in Device-to-Device Communications. CALDAM 2023: 41-55 - [c30]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 - [i6]David Neufeld, Sajad Fathi Hafshejani, Daya Ram Gaur
A Hybrid Quantum Algorithm for Load Flow. CoRR abs/2310.19953 (2023) - 2022
- [j19]Umair Arif, Robert Benkoczi, Daya Ram Gaur
A primal-dual approximation algorithm for Minsat. Discret. Appl. Math. 319: 372-381 (2022) - [j18]Robert Benkoczi, Daya Ram Gaur
Quantum Bitcoin Mining. Entropy 24(3): 323 (2022) - [c29]Sajad Fathi Hafshejani
Binary Orthogonal Non-negative Matrix Factorization. ICONIP (5) 2022: 28-38 - [c28]Chowdhury Nawrin Ferdous, Leila Karimi, Daya Ram Gaur
Integer Programs for Contention Aware Connected Dominating Sets in Wireless Multi-Hop Networks. WCNC 2022: 2142-2147 - [i5]Sajad Fathi Hafshejani, Daya Ram Gaur
Binary Orthogonal Non-negative Matrix Factorization. CoRR abs/2210.10660 (2022) - 2021
- [i4]Sajad Fathi Hafshejani, Daya Ram Gaur
Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization. CoRR abs/2109.05685 (2021) - [i3]Robert R. Nerem, Daya Ram Gaur
Conditions for Advantageous Quantum Bitcoin Mining. CoRR abs/2110.00878 (2021) - 2020
- [j17]Daya Ram Gaur
Improved approximation algorithms for cumulative VRP with stochastic demands. Discret. Appl. Math. 280: 133-143 (2020) - [j16]Daya Ram Gaur
Preface: CALDAM 2017. Discret. Appl. Math. 286: 1-2 (2020) - [c27]Umair Arif, Robert Benkoczi, Daya Ram Gaur
On the Minimum Satisfiability Problem. CALDAM 2020: 269-281 - [c26]Robert Benkoczi, Daya Ram Gaur
Evolutionary hot-spots in software systems. ICSE (Companion Volume) 2020: 272-273 - [c25]Daya Ram Gaur, Muhammad Khan:
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products. ISAIM 2020 - [i2]Daya Ram Gaur, Muhammad Khan:
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products. CoRR abs/2002.03766 (2020)
2010 – 2019
- 2019
- [c24]Peash Ranjan Saha, Salimur Choudhury, Daya Ram Gaur
Interference Minimization for Device-to-Device Communications: A Combinatorial Approach. WCNC 2019: 1-6 - 2018
- [c23]Robert Benkoczi, Daya Ram Gaur
Order Preserving Barrier Coverage with Weighted Sensors on a Line. AAIM 2018: 244-255 - [c22]Robert Benkoczi, Daya Ram Gaur
A design structure matrix approach for measuring co-change-modularity of software products. MSR 2018: 331-335 - [p1]Daya Ram Gaur, Ramesh Krishnamurti:
LP Rounding and Extensions. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 113-123 - 2017
- [j15]Daya Ram Gaur
A heuristic for cumulative vehicle routing using column generation. Discret. Appl. Math. 228: 140-157 (2017) - [e1]Daya Ram Gaur, N. S. Narayanaswamy:
Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings. Lecture Notes in Computer Science 10156, Springer 2017, ISBN 978-3-319-53006-2 [contents] - 2016
- [c21]Robert Benkoczi, Daya Ram Gaur
A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line. ALGOSENSORS 2016: 95-111 - [c20]Daya Ram Gaur
Approximation Algorithms for Cumulative VRP with Stochastic Demands. CALDAM 2016: 176-189 - [c19]Robert Benkoczi, Ram Dahal, Daya Ram Gaur
Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs. IWOCA 2016: 347-358 - 2015
- [j14]Selim G. Akl, Robert Benkoczi, Daya Ram Gaur
On a class of covering problems with variable capacities in wireless networks. Theor. Comput. Sci. 575: 42-55 (2015) - [c18]Robert Benkoczi, Zachary Friggstad, Daya Ram Gaur
Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line. ALGOSENSORS 2015: 98-111 - [c17]Daya Ram Gaur, Rishi Ranjan Singh:
Cumulative Vehicle Routing Problem: A Column Generation Approach. CALDAM 2015: 262-274 - [i1]Daya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh:
Star Bi-Coloring of Bipartite Graphs using Column Generation. CTW 2015: 250-253 - 2014
- [c16]Daya Ram Gaur:
On Resolution Like Proofs of Monotone Self-Dual Functions. ISAIM 2014 - [c15]Selim G. Akl, Robert Benkoczi, Daya Ram Gaur
On a Class of Covering Problems with Variable Capacities in Wireless Networks. WALCOM 2014: 138-150 - 2013
- [j13]Daya Ram Gaur
Routing vehicles to minimize fuel consumption. Oper. Res. Lett. 41(6): 576-580 (2013) - 2011
- [j12]Daya Ram Gaur
Erratum to: The capacitated max k-cut problem. Math. Program. 126(1): 191 (2011)
2000 – 2009
- 2009
- [j11]Daya Ram Gaur
On the fractional chromatic number of monotone self-dual Boolean functions. Discret. Math. 309(4): 867-877 (2009) - [j10]Daya Ram Gaur
Conflict Resolution in the Scheduling of Television Commercials. Oper. Res. 57(5): 1098-1105 (2009) - [c14]Salimur Choudhury, Daya Ram Gaur
An Approximation Algorithm for Max k-Uncut with Capacity Constraints. CSO (2) 2009: 934-938 - 2008
- [j9]Daya Ram Gaur
Self-duality of bounded monotone boolean functions and related problems. Discret. Appl. Math. 156(10): 1598-1605 (2008) - [j8]Ján Manuch, Daya Ram Gaur
Fitting protein Chains to cubic Lattice is NP-Complete. J. Bioinform. Comput. Biol. 6(1): 93-106 (2008) - [j7]Daya Ram Gaur
The capacitated max k -cut problem. Math. Program. 115(1): 65-72 (2008) - 2007
- [c13]Ján Manuch, Daya Ram Gaur:
Fitting Protein Chains to Cubic Lattice is NP-Complete. APBC 2007: 153-164 - [c12]Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi:
Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36 - [c11]Daya Ram Gaur
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. FAW 2007: 148-159 - [r1]Ramesh Krishnamurti, Daya Ram Gaur:
LP Rounding and Extensions. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j6]Ramesh Krishnamurti, Daya Ram Gaur
Berge's theorem for the maximum charge problem. Discret. Optim. 3(2): 174-178 (2006) - [c10]Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch:
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD 2006: 85-94 - 2005
- [c9]Daya Ram Gaur, Ramesh Krishnamurti:
Faster approximation algorithms for scheduling tasks with a choice of start times. CCCG 2005: 11-14 - [c8]Daya Ram Gaur
The Capacitated max-k-cut Problem. ICCSA (4) 2005: 670-679 - 2004
- [c7]Daya Ram Gaur, Ramesh Krishnamurti:
Average Case Self-Duality of Monotone Boolean Functions. Canadian AI 2004: 322-338 - 2003
- [j5]Daya Ram Gaur
A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf. Process. Lett. 86(2): 87-91 (2003) - [j4]Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur
On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. 302(1-3): 489-495 (2003) - [c6]Daya Ram Gaur
Scheduling Intervals Using Independent Sets in Claw-Free Graphs. ICCSA (1) 2003: 254-262 - 2002
- [j3]Daya Ram Gaur
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. J. Algorithms 43(1): 138-152 (2002) - 2001
- [j2]Daya Ram Gaur
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. J. Comb. Optim. 5(2): 167-173 (2001) - 2000
- [c5]Daya Ram Gaur, Ramesh Krishnamurti:
Self-Duality of Bounded Monotone Boolean Functions and Related Problems. ALT 2000: 209-223 - [c4]Daya Ram Gaur
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. ESA 2000: 211-219
1990 – 1999
- 1999
- [j1]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) - [c3]Daya Ram Gaur
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. ISAAC 1999: 49-55 - 1997
- [c2]Daya Ram Gaur, W. Ken Jackson, William S. Havens:
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure. AAAI/IAAI 1997: 215 - 1995
- [c1]William S. Havens, Daya Ram Gaur, Russell Ovans:
An Architecture for Building Multi-Agent Systems. SCAI 1995: 416-420
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: