Aristotelis Giannakos

According to our database1, Aristotelis Giannakos authored at least 12 papers between 1996 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem.
Eur. J. Oper. Res., 2017

Data Delivery by Mobile Agents with Energy Constraints over a fixed path.
CoRR, 2017

An approximation algorithm for the k-fixed depots problem.
Comput. Ind. Eng., 2017

2013
Exact and Approximation Algorithms for Densest <i>k</i>-Subgraph.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012
The max quasi-independent set problem.
J. Comb. Optim., 2012

Online maximum k-coverage.
Discret. Appl. Math., 2012

2009
Greedy Algorithms For On-Line Set-Covering.
Algorithmic Oper. Res., 2009

A Message-Optimal Sink Mobility Model for Wireless Sensor Networks.
Proceedings of the Eighth International Conference on Networks, 2009

2007
On the Performance of Congestion Games for Optimum Satisfiability Problems.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006
Greedy algorithms for on-line set-covering and related problems.
Proceedings of the Theory of Computing 2006, 2006

2000
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases.
RAIRO Theor. Informatics Appl., 2000

1996
On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996


  Loading...