selected scholarly activity
-
chapters
- Mobile Computation Offloading with Hard Task Completion Times. Wireless Networks(United Kingdom). 203-231. 2022
- Resource Time-Sharing for IoT Applications with Deadlines. Lecture Notes in Computer Science. 91-107. 2022
- Approximation schemes for fractional multicommodity flow problems. 1079-1095. 2016
- Fractional Packing and Covering Problems. 778-782. 2016
- Fractional Packing and Covering Problems. 1-6. 2015
- Fractional Packing and Covering Problems. 326-329. 2008
-
conferences
- Thermal-aware Workload Distribution for Data Centers with Demand Variations. Proceedings of the 14th International Green and Sustainable Computing Conference. 63-66. 2023
- Digital Twin Model Selection for Feature Accuracy in Wireless Edge Networks. 2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). 2023
- Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines. Leibniz International Proceedings in Informatics. 2023
- Joint Wireless and Service Allocation for Mobile Computation Offloading with Job Completion Time and Cost Constraints. IEEE Wireless Communications and Networking Conference, WCNC. 1278-1283. 2022
- Efficient Mobile Computation Offloading with Hard Task Deadlines and Concurrent Local Execution. GLOBECOM 2020 - 2020 IEEE Global Communications Conference. 2020
- Optimal Multi-Decision Mobile Computation Offloading With Hard Task Deadlines. Proceedings - International Symposium on Computers and Communications. 390-397. 2019
- Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models. Discrete Mathematics & Theoretical Computer Science. 2019
- The effect of vehicle route uncertainty in green roadside communication. IEEE Wireless Communications and Networking Conference, WCNC. 1-6. 2018
- Capacity augmentation in energy-efficient vehicular roadside infrastructure. 2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON). 597-603. 2017
- Search-and-Fetch with 2 Robots on a Disk. Proceedings of the 6th International Conference on Operations Research and Enterprise Systems. 15-26. 2017
- Search-and-Fetch with One Robot on a Disk. Lecture Notes in Computer Science. 80-94. 2017
- Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract).. AAIM. 101-112. 2016
- Energy efficient offloading for competing users on a shared communication channel. 2013 National Conference on Communications, NCC 2013. 3192-3197. 2015
- Social exchange networks with distant bargaining. Theoretical Computer Science. 263-274. 2014
- Dynamics of a Localized Reputation-Based Network Protocol. 2013 International Conference on Parallel and Distributed Computing, Applications and Technologies. 147-152. 2013
- On/off sleep scheduling in energy efficient vehicular roadside infrastructure. 2013 National Conference on Communications, NCC 2013. 6266-6271. 2013
- Scheduling in green vehicular infrastructure with multiple roadside units. 2013 National Conference on Communications, NCC 2013. 4431-+. 2013
- Social Exchange Networks with Distant Bargaining. Lecture Notes in Computer Science. 29-40. 2013
- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information. Lecture Notes in Computer Science. 110-121. 2013
- Analysis of a Forwarding Game without Payments. 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies. 691-696. 2012
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. Lecture Notes in Computer Science. 162-173. 2010
- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Algorithmica. 225-249. 2009
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates. Lecture Notes in Computer Science. 238-248. 2009
- General Pseudo-random Generators from Weaker Models of Computation. Lecture Notes in Computer Science. 1094-1103. 2009
- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes. Lecture Notes in Computer Science. 350-361. 2008
- Selfish Routing with Oblivious Users. Lecture Notes in Computer Science. 318-327. 2007
- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Lecture Notes in Computer Science. 23-32. 2006
- Maximizing Throughput in Queueing Networks with Limited Flexibility. Lecture Notes in Computer Science. 398-409. 2006
- A Better Approximation Ratio for the Vertex Cover Problem. Lecture Notes in Computer Science. 1043-1050. 2005
- Better approximation ratio for the vertex cover problem. Lecture Notes in Computer Science. 1043-1050. 2005
- The Efficiency of Optimal Taxes. Lecture Notes in Computer Science. 3-12. 2005
- Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 268-276. 2004
- Equilibria for Networks with Malicious Users. Lecture Notes in Computer Science. 696-704. 2003
- Exploitation of different types of locality for Web caches. Proceedings - International Symposium on Computers and Communications. 207-212. 2002
- Faster approximation schemes for fractional multicommodity flow problems. ACM Transactions on Algorithms (TALG). 166-173. 2002
- Faster approximation schemes for fractional multicommodity flow-problems. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 166-173. 2002
- 2+ε approximation algorithm for the k-MST problem. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 754-759. 2000
- A 2+ε approximation algorithm for the k-MST problem. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS. 754-759. 2000
- Effective caching of Web objects using Zipf's law. 2000 IEEE International Conference on Multimedia and Expo. ICME2000. Proceedings. Latest Advances in the Fast Changing World of Multimedia (Cat. No.00TH8532). 727-730. 2000
- On the complexity of intersecting finite state automata. Proceedings of the Annual IEEE Conference on Computational Complexity. 229-234. 2000
- Approximation schemes for minimum latency problems. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 688-693. 1999
-
journal articles
- Wireless and Service Allocation for Mobile Computation Offloading With Task Deadlines. IEEE Transactions on Mobile Computing. 23:5054-5068. 2024
- Digital Twin Model Selection for Feature Accuracy. IEEE Internet of Things Journal. 11:11415-11426. 2024
- Task Class Partitioning for Mobile Computation Offloading. IEEE Internet of Things Journal. 11:2534-2549. 2024
- Linearized Data Center Workload and Cooling Management. IEEE Transactions on Automation Science and Engineering. PP:1-13. 2024
- Digital Twins From a Networking Perspective. IEEE Internet of Things Journal. 9:23525-23544. 2022
- Single-item lot-sizing with quantity discount and bounded inventory. Operations Research Letters. 49:877-882. 2021
- Preemptive Mobile Computation Offloading With Hard Deadlines and Concurrent Local Execution. IEEE Transactions on Green Communications and Networking. 5:950-963. 2021
- Treasure evacuation with one robot on a disk. Theoretical Computer Science. 852:18-28. 2021
- Optimal Mobile Computation Offloading with Hard Deadline Constraints. IEEE Transactions on Mobile Computing. 19:2160-2173. 2020
- Optimal multi-part mobile computation offloading with hard deadline constraints. Computer Communications. 160:614-622. 2020
- Secure and trusted partial grey-box verification. International Journal of Information Security. 18:677-700. 2019
- Know when to persist: Deriving value from a stream buffer. Theoretical Computer Science. 717:47-61. 2018
- Combining Capital and Operating Expenditure Costs in Vehicular Roadside Unit Placement. IEEE Transactions on Vehicular Technology. 66:7317-7331. 2017
- Energy Aware Offloading for Competing Users on a Shared Communication Channel. IEEE Transactions on Mobile Computing. 16:87-96. 2017
- Search-and-Fetch with 2 Robots on a Disk - Wireless and Face-to-Face Communication Models. June. 13:15-26. 2017
- Secure and trusted white-box verification. CoRR. abs/1605.03932. 2016
- Variable-Bit-Rate Transmission Schedule Generation in Green Vehicular Roadside Units. IEEE Transactions on Vehicular Technology. 65:1590-1604. 2016
- Vehicle-to-Vehicle Forwarding in Green Roadside Infrastructure. IEEE Transactions on Vehicular Technology. 65:780-795. 2016
- Know When to Persist: Deriving Value from a Stream Buffer. Lecture Notes in Computer Science. 9778:101-112. 2016
- Energy-Efficient Scheduling in Green Vehicular Infrastructure With Multiple Roadside Units. IEEE Transactions on Vehicular Technology. 64:1942-1957. 2015
- Energy Provisioning and Operating Costs in Hybrid Solar-Powered Infrastructure. IEEE Transactions on Sustainable Energy. 5:986-994. 2014
- Emergency Connectivity in Ad-hoc Networks with Selfish Nodes. Algorithmica. 68:358-389. 2014
- Equilibrium Flows and Path Dilation for a Network Forwarding Game. Journal of Internet Technology. 15:125-134. 2014
- Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure. IEEE Transactions on Vehicular Technology. 62:1289-1302. 2013
- An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. ACM Transactions on Algorithms (TALG). 8:1-16. 2012
- On derandomization and average-case complexity of monotone functions. Theoretical Computer Science. 434:35-44. 2012
- On the degradation of performance for traffic networks with oblivious users. Transportation Research Part B: Methodological. 45:364-371. 2011
- A better approximation ratio for the vertex cover problem. ACM Transactions on Algorithms (TALG). 5:1-8. 2009
- Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. Algorithmica. 53:132-153. 2009
- Maximizing throughput in queueing networks with limited flexibility. European Journal of Operational Research. 187:98-112. 2008
- Faster approximation schemes for fractional multicommodity flow problems. ACM Transactions on Algorithms (TALG). 4:1-17. 2008
- Equilibria for networks with malicious users. Mathematical programming. 110:591-613. 2007
- A 2 + ɛ approximation algorithm for the k-MST problem. Mathematical programming. 107:491-504. 2006
- On the complexity of intersecting finite state automata and NL versus NP. Theoretical Computer Science. 302:257-274. 2003
- Approximation Schemes for Minimum Latency Problems. SIAM journal on computing (Print). 32:1317-1337. 2003
- Proof for effective and efficient web caching. Electronics Letters. 38:490-490. 2002
-
preprints
-
theses
- Digital Twin Placement for Minimum Application Request Delay With Data Age Targets. IEEE Internet of Things Journal. 2023