Daya Ram Gaur

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Quantum Bitcoin Mining.

[BibT_eX]

[DOI]

Entropy, 2022

A primal-dual approximation algorithm for Minsat.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Binary Orthogonal Non-negative Matrix Factorization.

[BibT_eX]

[DOI]

Sajad Fathi Hafshejani

S. Hossain

CoRR, 2022

Integer Programs for Contention Aware Connected Dominating Sets in Wireless Multi-Hop Networks.

[BibT_eX]

[DOI]

Chowdhury Nawrin Ferdous

Leila Karimi

Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

Binary Orthogonal Non-negative Matrix Factorization.

[BibT_eX]

[DOI]

Sajad Fathi Hafshejani

Shahadat Hossain

Proceedings of the Neural Information Processing - 29th International Conference, 2022

2021

Conditions for Advantageous Quantum Bitcoin Mining.

[BibT_eX]

[DOI]

Robert R. Nerem

CoRR, 2021

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

[BibT_eX]

[DOI]

Sajad Fathi Hafshejani

Shahadat Hossain

CoRR, 2021

2020

Preface: CALDAM 2017.

[BibT_eX]

[DOI]

N. S. Narayanaswamy

Discret. Appl. Math., 2020

Improved approximation algorithms for cumulative VRP with stochastic demands.

[BibT_eX]

[DOI]

Apurva Mudgal

Discret. Appl. Math., 2020

Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products.

[BibT_eX]

[DOI]

Muhammad Khan

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Evolutionary hot-spots in software systems.

[BibT_eX]

[DOI]

Proceedings of the ICSE '20: 42nd International Conference on Software Engineering, Companion Volume, Seoul, South Korea, 27 June, 2020

On the Minimum Satisfiability Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Interference Minimization for Device-to-Device Communications: A Combinatorial Approach.

[BibT_eX]

[DOI]

Peash Ranjan Saha

Salimur Choudhury

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.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Mining Software Repositories, 2018

Order Preserving Barrier Coverage with Weighted Sensors on a Line.

[BibT_eX]

[DOI]

Xiao Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2018

LP Rounding and Extensions.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

A heuristic for cumulative vehicle routing using column generation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs.

[BibT_eX]

[DOI]

Ram Dahal

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Approximation Algorithms for Cumulative VRP with Stochastic Demands.

[BibT_eX]

[DOI]

Apurva Mudgal

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line.

[BibT_eX]

[DOI]

Mark Thom

Proceedings of the Algorithms for Sensor Systems, 2016

2015

On a class of covering problems with variable capacities in wireless networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Star Bi-Coloring of Bipartite Graphs using Column Generation.

[BibT_eX]

Shahadat Hossain

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Cumulative Vehicle Routing Problem: A Column Generation Approach.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2015

2014

On Resolution Like Proofs of Monotone Self-Dual Functions.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2013

Routing vehicles to minimize fuel consumption.

[BibT_eX]

[DOI]

Apurva Mudgal

Oper. Res. Lett., 2013

2011

Erratum to: The capacitated max k-cut problem.

[BibT_eX]

[DOI]

Rajeev Kohli

Math. Program., 2011

2009

Conflict Resolution in the Scheduling of Television Commercials.

[BibT_eX]

[DOI]

Rajeev Kohli

Oper. Res., 2009

On the fractional chromatic number of monotone self-dual Boolean functions.

[BibT_eX]

[DOI]

Kazuhisa Makino

Discret. Math., 2009

An Approximation Algorithm for Max k-Uncut with Capacity Constraints.

[BibT_eX]

[DOI]

Salimur Choudhury

Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

2008

The capacitated max k -cut problem.

[BibT_eX]

[DOI]

Rajeev Kohli

Math. Program., 2008

Fitting protein Chains to cubic Lattice is NP-Complete.

[BibT_eX]

[DOI]

Ján Manuch

J. Bioinform. Comput. Biol., 2008

Self-duality of bounded monotone boolean functions and related problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

LP Rounding and Extensions.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Computing a planar widest empty alpha-siphon in o(n3) time.

[BibT_eX]

[DOI]

Boaz Ben-Moshe

Binay K. Bhattacharya

Sandip Das

Qiaosheng Shi

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Berge's theorem for the maximum charge problem.

[BibT_eX]

[DOI]

Discret. Optim., 2006

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times.

[BibT_eX]

Ján Manuch

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005

The Capacitated max-k-cut Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2005

Faster approximation algorithms for scheduling tasks with a choice of start times.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Average Case Self-Duality of Monotone Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2004

2003

On polynomial-time approximation algorithms for the variable length scheduling problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times.

[BibT_eX]

[DOI]

Arvind Gupta

Inf. Process. Lett., 2003

Scheduling Intervals Using Independent Sets in Claw-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2003

2002

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

[BibT_eX]

[DOI]

Toshihide Ibaraki

J. Algorithms, 2002

2001

Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.

[BibT_eX]

[DOI]

J. Comb. Optim., 2001

2000

Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.

[BibT_eX]

[DOI]

Toshihide Ibaraki

Proceedings of the Algorithms, 2000

1999

An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

1997

Detecting Unsatisfiable CSPs by Coloring the Micro-Structure.

[BibT_eX]

[DOI]

W. Ken Jackson

William S. Havens

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.

[BibT_eX]

William S. Havens