default search action
George Karakostas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Hong Chen
, Terence D. Todd
Task Class Partitioning for Mobile Computation Offloading. IEEE Internet Things J. 11(2): 2534-2549 (2024) - [j31]Hong Chen
Digital Twin Model Selection for Feature Accuracy. IEEE Internet Things J. 11(7): 11415-11426 (2024) - [j30]Hong Chen
Wireless and Service Allocation for Mobile Computation Offloading With Task Deadlines. IEEE Trans. Mob. Comput. 23(5): 5054-5068 (2024) - 2023
- [j29]Mehrad Vaezi
Digital Twin Placement for Minimum Application Request Delay With Data Age Targets. IEEE Internet Things J. 10(13): 11547-11557 (2023) - [c36]George Karakostas, Stavros G. Kolliopoulos:
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines. APPROX/RANDOM 2023: 5:1-5:17 - [c35]Somayye Rostami
Thermal-aware Workload Distribution for Data Centers with Demand Variations. IGSC 2023: 63-66 - [c34]Hong Chen
Digital Twin Model Selection for Feature Accuracy in Wireless Edge Networks. PIMRC 2023: 1-6 - [i7]Hong Chen, Terence D. Todd, Dongmei Zhao, George Karakostas:
Wireless and Service Allocation for Mobile Computation Offloading with Task Deadlines. CoRR abs/2301.12088 (2023) - [i6]Somayye Rostami, Douglas G. Down, George Karakostas:
Linearized Data Center Workload and Cooling Management. CoRR abs/2304.04731 (2023) - [i5]Somayye Rostami, Douglas G. Down, George Karakostas:
Thermal-aware Workload Distribution for Data Centers with Demand Variations. CoRR abs/2308.12559 (2023) - 2022
- [j28]Mehrad Vaezi, Kiana Noroozi
Digital Twins From a Networking Perspective. IEEE Internet Things J. 9(23): 23525-23544 (2022) - [c33]George Karakostas, Stavros G. Kolliopoulos:
Resource Time-Sharing for IoT Applications with Deadlines. ALGOSENSORS 2022: 91-107 - [c32]Hong Chen
Joint Wireless and Service Allocation for Mobile Computation Offloading with Job Completion Time and Cost Constraints. WCNC 2022: 1278-1283 - 2021
- [j27]Douglas G. Down
Single-item lot-sizing with quantity discount and bounded inventory. Oper. Res. Lett. 49(6): 877-882 (2021) - [j26]Konstantinos Georgiou, George Karakostas, Evangelos Kranakis:
Treasure evacuation with one robot on a disk. Theor. Comput. Sci. 852: 18-28 (2021) - [j25]Peyvand Teymoori, Arvin Hekmati, Terence D. Todd
Preemptive Mobile Computation Offloading With Hard Deadlines and Concurrent Local Execution. IEEE Trans. Green Commun. Netw. 5(2): 950-963 (2021) - 2020
- [j24]Arvin Hekmati, Peyvand Teymoori, Terence D. Todd, Dongmei Zhao, George Karakostas:
Optimal multi-part mobile computation offloading with hard deadline constraints. Comput. Commun. 160: 614-622 (2020) - [j23]Arvin Hekmati
Optimal Mobile Computation Offloading with Hard Deadline Constraints. IEEE Trans. Mob. Comput. 19(9): 2160-2173 (2020) - [c31]Peyvand Teymoori, Terence D. Todd, Dongmei Zhao, George Karakostas:
Efficient Mobile Computation Offloading with Hard Task Deadlines and Concurrent Local Execution. GLOBECOM 2020: 1-6
2010 – 2019
- 2019
- [j22]Konstantinos Georgiou, George Karakostas, Evangelos Kranakis:
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j21]Yixian Cai, George Karakostas
Secure and trusted partial grey-box verification. Int. J. Inf. Sec. 18(6): 677-700 (2019) - [c30]Arvin Hekmati, Peyvand Teymoori, Terence D. Todd, Dongmei Zhao, George Karakostas:
Optimal Multi-Decision Mobile Computation Offloading With Hard Task Deadlines. ISCC 2019: 1-8 - 2018
- [j20]Konstantinos Georgiou, George Karakostas
Know when to persist: Deriving value from a stream buffer. Theor. Comput. Sci. 717: 47-61 (2018) - [c29]Naby Nikookaran, Terence D. Todd, Shiqiang Zhang, George Karakostas:
The effect of vehicle route uncertainty in green roadside communication. WCNC 2018: 1-6 - 2017
- [j19]Erfan Meskar
Energy Aware Offloading for Competing Users on a Shared Communication Channel. IEEE Trans. Mob. Comput. 16(1): 87-96 (2017) - [j18]Naby Nikookaran, George Karakostas
Combining Capital and Operating Expenditure Costs in Vehicular Roadside Unit Placement. IEEE Trans. Veh. Technol. 66(8): 7317-7331 (2017) - [c28]Konstantinos Georgiou, George Karakostas, Evangelos Kranakis:
Search-and-Fetch with 2 Robots on a Disk - Wireless and Face-to-Face Communication Models. ICORES 2017: 15-26 - [c27]Naby Nikookaran, Terence D. Todd, George Karakostas:
Capacity augmentation in energy-efficient vehicular roadside infrastructure. UEMCON 2017: 597-603 - 2016
- [j17]Morteza Azimifar, Terence D. Todd, Amir Khezrian, George Karakostas
Vehicle-to-Vehicle Forwarding in Green Roadside Infrastructure. IEEE Trans. Veh. Technol. 65(2): 780-795 (2016) - [j16]Abdulla A. Hammad, Terence D. Todd, George Karakostas
Variable-Bit-Rate Transmission Schedule Generation in Green Vehicular Roadside Units. IEEE Trans. Veh. Technol. 65(3): 1590-1604 (2016) - [c26]Konstantinos Georgiou, George Karakostas
Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract). AAIM 2016: 101-112 - [c25]Konstantinos Georgiou, George Karakostas
Search-and-Fetch with One Robot on a Disk - (Track: Wireless and Geometry). ALGOSENSORS 2016: 80-94 - [r2]George Karakostas:
Fractional Packing and Covering Problems. Encyclopedia of Algorithms 2016: 778-782 - [i4]Konstantinos Georgiou, George Karakostas, Evangelos Kranakis, Danny Krizanc:
Know When to Persist: Deriving Value from a Stream Buffer. CoRR abs/1604.03009 (2016) - [i3]Yixian Cai, George Karakostas, Alan Wassyng:
Secure and trusted white-box verification. CoRR abs/1605.03932 (2016) - [i2]Konstantinos Georgiou, George Karakostas, Evangelos Kranakis:
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models. CoRR abs/1611.10208 (2016) - 2015
- [j15]Amir Khezrian, Terence D. Todd, George Karakostas
Energy-Efficient Scheduling in Green Vehicular Infrastructure With Multiple Roadside Units. IEEE Trans. Veh. Technol. 64(5): 1942-1957 (2015) - [c24]Erfan Meskar
Energy efficient offloading for competing users on a shared communication channel. ICC 2015: 3192-3197 - 2014
- [j14]George Karakostas
Emergency Connectivity in Ad-hoc Networks with Selfish Nodes. Algorithmica 68(2): 358-389 (2014) - [j13]Konstantinos Georgiou, George Karakostas
Social exchange networks with distant bargaining. Theor. Comput. Sci. 554: 263-274 (2014) - 2013
- [j12]Abdulla A. Hammad, Terence D. Todd, George Karakostas
Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure. IEEE Trans. Veh. Technol. 62(3): 1289-1302 (2013) - [c23]Konstantinos Georgiou, George Karakostas
Social Exchange Networks with Distant Bargaining. COCOON 2013: 29-40 - [c22]Amir Khezrian, Abdulla A. Hammad, Terence D. Todd, George Karakostas
Scheduling in green vehicular infrastructure with multiple roadside units. ICC 2013: 4431-4436 - [c21]Shokouh Mostofi, Abdulla A. Hammad, Terence D. Todd, George Karakostas
On/off sleep scheduling in energy efficient vehicular roadside infrastructure. ICC 2013: 6266-6271 - [c20]George Karakostas
Dynamics of a Localized Reputation-Based Network Protocol. PDCAT 2013: 147-152 - [c19]Kun Hu, Jingjing Huang, George Karakostas
Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information. SAGT 2013: 110-121 - 2012
- [j11]George Karakostas
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. ACM Trans. Algorithms 8(4): 40:1-40:16 (2012) - [j10]George Karakostas
On derandomization and average-case complexity of monotone functions. Theor. Comput. Sci. 434: 35-44 (2012) - [c18]George Karakostas
Analysis of a Forwarding Game without Payments. PDCAT 2012: 691-696 - 2010
- [c17]Dimitris Fotakis
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. SAGT 2010: 162-173
2000 – 2009
- 2009
- [j9]George Karakostas
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. Algorithmica 53(1): 132-153 (2009) - [j8]George Karakostas
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Algorithmica 53(2): 225-249 (2009) - [j7]George Karakostas
A better approximation ratio for the vertex cover problem. ACM Trans. Algorithms 5(4): 41:1-41:8 (2009) - [c16]George Karakostas
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates. COCOON 2009: 238-248 - [c15]George Karakostas
General Pseudo-random Generators from Weaker Models of Computation. ISAAC 2009: 1094-1103 - 2008
- [j6]Douglas G. Down, George Karakostas
Maximizing throughput in queueing networks with limited flexibility. Eur. J. Oper. Res. 187(1): 98-112 (2008) - [j5]George Karakostas
Faster approximation schemes for fractional multicommodity flow problems. ACM Trans. Algorithms 4(1): 13:1-13:17 (2008) - [c14]George Karakostas
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes. LATIN 2008: 350-361 - [r1]George Karakostas
Fractional Packing and Covering Problems. Encyclopedia of Algorithms 2008 - 2007
- [j4]George Karakostas
Equilibria for networks with malicious users. Math. Program. 110(3): 591-613 (2007) - [c13]George Karakostas
Selfish Routing with Oblivious Users. SIROCCO 2007: 318-327 - 2006
- [j3]Sanjeev Arora, George Karakostas
A 2 + epsilon approximation algorithm for the k-MST problem. Math. Program. 107(3): 491-504 (2006) - [c12]George Karakostas
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. COCOON 2006: 23-32 - [c11]Douglas G. Down, George Karakostas
Maximizing Throughput in Queueing Networks with Limited Flexibility. LATIN 2006: 398-409 - 2005
- [c10]George Karakostas
A Better Approximation Ratio for the Vertex Cover Problem. ICALP 2005: 1043-1050 - 2004
- [c9]George Karakostas
The Efficiency of Optimal Taxes. CAAN 2004: 3-12 - [c8]George Karakostas
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. FOCS 2004: 268-276 - [i1]George Karakostas:
A better approximation ratio for the Vertex Cover problem. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j2]Sanjeev Arora, George Karakostas
Approximation Schemes for Minimum Latency Problems. SIAM J. Comput. 32(5): 1317-1337 (2003) - [j1]George Karakostas
On the complexity of intersecting finite state automata and N L versus N P. Theor. Comput. Sci. 302(1-3): 257-274 (2003) - [c7]George Karakostas
Equilibria for Networks with Malicious Users. ISAAC 2003: 696-704 - 2002
- [c6]George Karakostas
Exploitation of different types of locality for Web caches. ISCC 2002: 207-212 - [c5]George Karakostas:
Faster approximation schemes for fractional multicommodity flow problems. SODA 2002: 166-173 - 2000
- [c4]George Karakostas, Richard J. Lipton, Anastasios Viglas:
On the Complexity of Intersecting Finite State Automata. CCC 2000: 229-234 - [c3]Dimitrios N. Serpanos, George Karakostas, Wayne H. Wolf:
Effective Caching of Web Objects using Zipf's Law. IEEE International Conference on Multimedia and Expo (II) 2000: 727-730 - [c2]Sanjeev Arora, George Karakostas:
A 2+epsilon approximation algorithm for the k-MST problem. SODA 2000: 754-759
1990 – 1999
- 1999
- [c1]Sanjeev Arora, George Karakostas
Approximation Schemes for Minimum Latency Problems. STOC 1999: 688-693
Coauthor Index
aka: Terence D. Todd
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-06-19 21:52 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: