George Karakostas

Orcid: 0000-0002-1978-1252

According to our database1, George Karakostas authored at least 62 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Wireless and Service Allocation for Mobile Computation Offloading With Task Deadlines.
IEEE Trans. Mob. Comput., May, 2024

Digital Twin Model Selection for Feature Accuracy.
IEEE Internet Things J., April, 2024

Task Class Partitioning for Mobile Computation Offloading.
IEEE Internet Things J., January, 2024

2023
Digital Twin Placement for Minimum Application Request Delay With Data Age Targets.
IEEE Internet Things J., July, 2023

Thermal-aware Workload Distribution for Data Centers with Demand Variations.
CoRR, 2023

Linearized Data Center Workload and Cooling Management.
CoRR, 2023

Digital Twin Model Selection for Feature Accuracy in Wireless Edge Networks.
Proceedings of the 34th IEEE Annual International Symposium on Personal, 2023

Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines.
Proceedings of the Approximation, 2023

2022
Digital Twins From a Networking Perspective.
IEEE Internet Things J., 2022

Joint Wireless and Service Allocation for Mobile Computation Offloading with Job Completion Time and Cost Constraints.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

Resource Time-Sharing for IoT Applications with Deadlines.
Proceedings of the Algorithmics of Wireless Networks, 2022

2021
Preemptive Mobile Computation Offloading With Hard Deadlines and Concurrent Local Execution.
IEEE Trans. Green Commun. Netw., 2021

Treasure evacuation with one robot on a disk.
Theor. Comput. Sci., 2021

Single-item lot-sizing with quantity discount and bounded inventory.
Oper. Res. Lett., 2021

2020
Optimal Mobile Computation Offloading with Hard Deadline Constraints.
IEEE Trans. Mob. Comput., 2020

Optimal multi-part mobile computation offloading with hard deadline constraints.
Comput. Commun., 2020

Efficient Mobile Computation Offloading with Hard Task Deadlines and Concurrent Local Execution.
Proceedings of the IEEE Global Communications Conference, 2020

2019
Secure and trusted partial grey-box verification.
Int. J. Inf. Sec., 2019

Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models.
Discret. Math. Theor. Comput. Sci., 2019

Optimal Multi-Decision Mobile Computation Offloading With Hard Task Deadlines.
Proceedings of the 2019 IEEE Symposium on Computers and Communications, 2019

2018
Know when to persist: Deriving value from a stream buffer.
Theor. Comput. Sci., 2018

The effect of vehicle route uncertainty in green roadside communication.
Proceedings of the 2018 IEEE Wireless Communications and Networking Conference, 2018

2017
Combining Capital and Operating Expenditure Costs in Vehicular Roadside Unit Placement.
IEEE Trans. Veh. Technol., 2017

Energy Aware Offloading for Competing Users on a Shared Communication Channel.
IEEE Trans. Mob. Comput., 2017

Capacity augmentation in energy-efficient vehicular roadside infrastructure.
Proceedings of the 8th IEEE Annual Ubiquitous Computing, 2017

2016
Fractional Packing and Covering Problems.
Encyclopedia of Algorithms, 2016

Variable-Bit-Rate Transmission Schedule Generation in Green Vehicular Roadside Units.
IEEE Trans. Veh. Technol., 2016

Vehicle-to-Vehicle Forwarding in Green Roadside Infrastructure.
IEEE Trans. Veh. Technol., 2016

Secure and trusted white-box verification.
CoRR, 2016

Search-and-Fetch with One Robot on a Disk - (Track: Wireless and Geometry).
Proceedings of the Algorithms for Sensor Systems, 2016

Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract).
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Energy-Efficient Scheduling in Green Vehicular Infrastructure With Multiple Roadside Units.
IEEE Trans. Veh. Technol., 2015

Energy efficient offloading for competing users on a shared communication channel.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Social exchange networks with distant bargaining.
Theor. Comput. Sci., 2014

Emergency Connectivity in Ad-hoc Networks with Selfish Nodes.
Algorithmica, 2014

2013
Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure.
IEEE Trans. Veh. Technol., 2013

Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Dynamics of a Localized Reputation-Based Network Protocol.
Proceedings of the International Conference on Parallel and Distributed Computing, 2013

On/off sleep scheduling in energy efficient vehicular roadside infrastructure.
Proceedings of IEEE International Conference on Communications, 2013

Scheduling in green vehicular infrastructure with multiple roadside units.
Proceedings of IEEE International Conference on Communications, 2013

2012
On derandomization and average-case complexity of monotone functions.
Theor. Comput. Sci., 2012

An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates.
ACM Trans. Algorithms, 2012

Analysis of a Forwarding Game without Payments.
Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

2010
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009
A better approximation ratio for the vertex cover problem.
ACM Trans. Algorithms, 2009

Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
Algorithmica, 2009

Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.
Algorithmica, 2009

General Pseudo-random Generators from Weaker Models of Computation.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Fractional Packing and Covering Problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Faster approximation schemes for fractional multicommodity flow problems.
ACM Trans. Algorithms, 2008

Maximizing throughput in queueing networks with limited flexibility.
Eur. J. Oper. Res., 2008

2007
Equilibria for networks with malicious users.
Math. Program., 2007

Selfish Routing with Oblivious Users.
Proceedings of the Structural Information and Communication Complexity, 2007

2006
A 2 + <i>epsilon</i> approximation algorithm for the <i>k</i>-MST problem.
Math. Program., 2006

2004
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

The Efficiency of Optimal Taxes.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
On the complexity of intersecting finite state automata and N L versus N P.
Theor. Comput. Sci., 2003

Approximation Schemes for Minimum Latency Problems.
SIAM J. Comput., 2003

2002
Exploitation of different types of locality for Web caches.
Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 2002

2000
A 2+epsilon approximation algorithm for the <i>k</i>-MST problem.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Effective Caching of Web Objects using Zipf's Law.
Proceedings of the 2000 IEEE International Conference on Multimedia and Expo, 2000

On the Complexity of Intersecting Finite State Automata.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000


  Loading...