default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Benkoczi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Sajad Fathi Hafshejani
, Daya Ram Gaur, Robert Benkoczi:
On Implementing a Two-Step Interior Point Method for Solving Linear Programs. Algorithms 17(7): 303 (2024)- [c31]Sajad Fathi Hafshejani, Daya Ram Gaur, Robert Benkoczi:
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method. CALDAM 2024: 133-147 - 2023
- [j14]Robert Benkoczi, Oluwaseun F. Lijoka:
Capacity provisioning for evacuation on path networks. Networks 81(1): 75-92 (2023) - [i4]David Neufeld, Sajad Fathi Hafshejani, Daya Ram Gaur, Robert Benkoczi:
A Hybrid Quantum Algorithm for Load Flow. CoRR abs/2310.19953 (2023) - 2022
- [j13]Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti:
A primal-dual approximation algorithm for Minsat. Discret. Appl. Math. 319: 372-381 (2022) - [j12]Robert Benkoczi, Daya Ram Gaur, Naya Nagy, Marius Nagy, Shahadat Hossain:
Quantum Bitcoin Mining. Entropy 24(3): 323 (2022) - [c30]Sajad Fathi Hafshejani, Daya Ram Gaur, Shahadat Hossain, Robert Benkoczi:
Binary Orthogonal Non-negative Matrix Factorization. ICONIP (5) 2022: 28-38 - [i3]Sajad Fathi Hafshejani, Daya Ram Gaur, S. Hossain, Robert Benkoczi:
Binary Orthogonal Non-negative Matrix Factorization. CoRR abs/2210.10660 (2022) - 2021
- [c29]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS 2021: 13:1-13:19 - [i2]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 abs/2109.05685 (2021) - 2020
- [j11]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-sink problem on path networks. Theor. Comput. Sci. 806: 388-401 (2020) - [c28]Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti:
On the Minimum Satisfiability Problem. CALDAM 2020: 269-281 - [c27]Robert Benkoczi, Daya Ram Gaur, Shahadat Hossain, Muhammad Khan, Ajay Raj Tedlapu:
Evolutionary hot-spots in software systems. ICSE (Companion Volume) 2020: 272-273
2010 – 2019
- 2019
- [c26]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC 2019: 42-58 - 2018
- [c25]Robert Benkoczi, Daya Ram Gaur, Xiao Zhang:
Order Preserving Barrier Coverage with Weighted Sensors on a Line. AAIM 2018: 244-255 - [c24]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA 2018: 78-89 - [c23]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: 331-335 - [i1]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Path Networks. CoRR abs/1810.10631 (2018) - 2017
- [c22]Mahmudun Nabi, Robert Benkoczi, Sherin Abdel Hamid, Hossam S. Hassanein:
Resource assignment in vehicular clouds. ICC 2017: 1-6 - 2016
- [c21]Robert Benkoczi, Daya Ram Gaur, Mark Thom:
A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line. ALGOSENSORS 2016: 95-111 - [c20]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
- [j10]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: 42-55 (2015) - [c19]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: 98-111 - 2014
- [c18]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: 138-150 - 2013
- [c17]Stephen Atambire Nsoh, Robert Benkoczi:
Routing and link scheduling with QoS in IEEE 802.16 mesh networks. WCNC 2013: 233-238 - 2012
- [j9]Robert Benkoczi, Binay K. Bhattacharya, Yuzhuang Hu, Chien-Hsin Lin, Qiaosheng Shi, Biing-Feng Wang:
Efficient algorithms for the conditional covering problem. Inf. Comput. 219: 39-57 (2012) - [c16]Shah Mostafa Khaled, Robert Benkoczi, Yuanzhu Peter Chen:
Mesh Network Deployment to Ensure Global Reachability. MUSIC 2012: 207-213 - [c15]Stephen Atambire Nsoh, Robert Benkoczi:
Towards Global Connectivity by Joint Routing and Scheduling in Wireless Mesh Networks. MUSIC 2012: 214-219 - 2010
- [j8]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
Channel Assignment for Multihop Cellular Networks: Minimum Delay. IEEE Trans. Mob. Comput. 9(7): 1022-1034 (2010)
2000 – 2009
- 2009
- [j7]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Single facility collection depots location problem in the plane. Comput. Geom. 42(5): 403-418 (2009) - [j6]Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir:
Collection depots facility location problems in trees. Networks 53(1): 50-62 (2009) - [c14]Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Robert Benkoczi:
An evolutionary approach to planning IEEE 802.16 networks. GECCO 2009: 1929-1930 - [c13]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
Effective Cell Size Scheme in Multi-Hop Cellular Networks. GLOBECOM 2009: 1-6 - 2008
- [c12]Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi:
New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM 2008: 38-49 - [c11]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
Optimal Cell Size in Multi-Hop Cellular Networks. GLOBECOM 2008: 574-578 - 2007
- [j5]Sylvia Tai, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
QoS and data relaying for wireless sensor networks. J. Parallel Distributed Comput. 67(6): 715-726 (2007) - [c10]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
Optimal Channel Assignment in Multi-Hop Cellular Networks. GLOBECOM 2007: 731-735 - [c9]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
On the Average Capacity of Vehicle to Vehicle Networks. GLOBECOM 2007: 1092-1096 - 2006
- [j4]Robert Benkoczi, Binay K. Bhattacharya, David Breton:
Efficient computation of 2-medians in a tree network with positive/negative weights. Discret. Math. 306(14): 1505-1516 (2006) - [j3]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl, Sylvia Tai:
Data relaying with constraints in hierarchical sensor networks. J. Comb. Optim. 11(1): 113-123 (2006) - [c8]Sylvia Tai, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic. GLOBECOM 2006 - [c7]Sylvia Tai, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl:
A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks. ICC 2006: 3432-3437 - [c6]Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl, Robert Benkoczi:
Optimal Multi-hop Cellular Architecture for Wireless Communications. LCN 2006: 738-745 - 2005
- [c5]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Collection depot location problem in the plane. CCCG 2005: 76-79 - [c4]Robert Benkoczi, Binay K. Bhattacharya:
A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. ESA 2005: 271-282 - [c3]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl, Sylvia Tai:
Data relaying with optimal resource management in wireless sensor networks (Extended Abstract). LCN 2005: 617-618 - [c2]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl, Sylvia Tai:
QoS for data relaying in hierarchical wireless sensor networks. Q2SWinet 2005: 47-54 - 2003
- [j2]Robert Benkoczi, Binay K. Bhattacharya, David Breton:
Efficient computation of 2-medians in a tree network with positive/negative weights. Electron. Notes Discret. Math. 15: 39-42 (2003) - [c1]Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227 - 2001
- [j1]Binay K. Bhattacharya, Robert Benkoczi:
On computing the optimal bridge between two convex polygons. Inf. Process. Lett. 79(5): 215-221 (2001)
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-09-10 02:05 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:
