Robert Benkoczi

Orcid: 0000-0002-7942-0539

According to our database1, Robert Benkoczi authored at least 47 papers between 2001 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
Capacity provisioning for evacuation on path networks.
Networks, January, 2023

A Hybrid Quantum Algorithm for Load Flow.
CoRR, 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

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

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

Locating Evacuation Centers Optimally in Path and Cycle Networks.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Minsum <i>k</i>-sink problem on path networks.
Theor. Comput. Sci., 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
Minmax-Regret Evacuation Planning for Cycle Networks.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
Minsum k-Sink Problem on Path Networks.
CoRR, 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

Minsum k-Sink Problem on Dynamic Flow Path Networks.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

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

2017
Resource assignment in vehicular clouds.
Proceedings of the IEEE International Conference on Communications, 2017

2016
Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 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

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

2013
Routing and link scheduling with QoS in IEEE 802.16 mesh networks.
Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013

2012
Efficient algorithms for the conditional covering problem.
Inf. Comput., 2012

Towards Global Connectivity by Joint Routing and Scheduling in Wireless Mesh Networks.
Proceedings of the Third FTRA International Conference on Mobile, 2012

Mesh Network Deployment to Ensure Global Reachability.
Proceedings of the Third FTRA International Conference on Mobile, 2012

2010
Channel Assignment for Multihop Cellular Networks: Minimum Delay.
IEEE Trans. Mob. Comput., 2010

2009
Collection depots facility location problems in trees.
Networks, 2009

Single facility collection depots location problem in the plane.
Comput. Geom., 2009

Effective Cell Size Scheme in Multi-Hop Cellular Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

An evolutionary approach to planning IEEE 802.16 networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

2008
Optimal Cell Size in Multi-Hop Cellular Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

New Upper Bounds on Continuous Tree Edge-Partition Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
QoS and data relaying for wireless sensor networks.
J. Parallel Distributed Comput., 2007

Optimal Channel Assignment in Multi-Hop Cellular Networks.
Proceedings of the Global Communications Conference, 2007

On the Average Capacity of Vehicle to Vehicle Networks.
Proceedings of the Global Communications Conference, 2007

2006
Data relaying with constraints in hierarchical sensor networks.
J. Comb. Optim., 2006

Optimal Multi-hop Cellular Architecture for Wireless Communications.
Proceedings of the LCN 2006, 2006

A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks.
Proceedings of IEEE International Conference on Communications, 2006

An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
QoS for data relaying in hierarchical wireless sensor networks.
Proceedings of the Q2SWinet'05, 2005

Data relaying with optimal resource management in wireless sensor networks (Extended Abstract).
Proceedings of the 30th Annual IEEE Conference on Local Computer Networks (LCN 2005), 2005

A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time.
Proceedings of the Algorithms, 2005

Collection depot location problem in the plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003
Efficient computation of 2-medians in a tree network with positive/negative weights.
Electron. Notes Discret. Math., 2003

Faster Algorithms for <i>k</i>-Medians in Trees.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2001
On computing the optimal bridge between two convex polygons.
Inf. Process. Lett., 2001


  Loading...