# George Karakostas

According to our database

Collaborative distances:

^{1}, George Karakostas authored at least 56 papers between 1999 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

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.

Discrete Mathematics & Theoretical Computer Science, 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. Vehicular Technology, 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

Search-and-Fetch with 2 Robots on a Disk - Wireless and Face-to-Face Communication Models.

Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

2016

Variable-Bit-Rate Transmission Schedule Generation in Green Vehicular Roadside Units.

IEEE Trans. Vehicular Technology, 2016

Vehicle-to-Vehicle Forwarding in Green Roadside Infrastructure.

IEEE Trans. Vehicular Technology, 2016

Know When to Persist: Deriving Value from a Stream Buffer.

CoRR, 2016

Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models.

CoRR, 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. Vehicular Technology, 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. Vehicular Technology, 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

Social Exchange Networks with Distant Bargaining.

Proceedings of the Computing and Combinatorics, 19th International Conference, 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

An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates.

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 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.

European Journal of Operational Research, 2008

Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes.

Proceedings of the LATIN 2008: Theoretical Informatics, 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

Math. Program., 2006

Maximizing Throughput in Queueing Networks with Limited Flexibility.

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

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

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

A Better Approximation Ratio for the Vertex Cover Problem.

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

A better approximation ratio for the Vertex Cover problem

Electronic Colloquium on Computational Complexity (ECCC), 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

Equilibria for Networks with Malicious Users.

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Faster approximation schemes for fractional multicommodity flow problems.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

*k*-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

1999

Approximation Schemes for Minimum Latency Problems.

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999