|
This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies.
For more information visit Aigaion.nl. |  |
?>
?>
Firstname: | G. |
Surname: | Monaco |
Email: | |
Institute: | |
Homepage: | |
Is RU1 member: | NO |
|
|
|
[RACTI-RU1-2017-69] Bilo, V., Caragiannis, Ioannis, Fanelli, A., Flamini, M and Monaco, G., Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, pages 125:1-125:13, 2017. [DOI] |
|
|
[RACTI-RU1-2011-43] Caragiannis, Ioannis and Monaco, G., A 6/5-approximation algorithm for the maximum 3-cover problem, in: Journal of Combinatorial Optimization, 2011. |
|
|
[RACTI-RU1-2010-17] Bilo, V., Caragiannis, Ioannis, Fanelli, A. and Monaco, G., Improved lower bounds on the price of stability of undirected network design games, in: 3rd International Symposium on Algorithmic Game Theory, SAGT 2010, Springer, 2010. |
|
|
[RACTI-RU1-2009-42] Bilo, V., Caragiannis, Ioannis, Fanelli, A., Flamini, M, Kaklamanis, Christos, Monaco, G. and Moscardelli, L, Graphs and Algorithms in Communication Networks, chapter Game-theoretic approaches to optimization problems in communication netwotks., 2009. |
|
|
[RACTI-RU1-2008-59] Caragiannis, Ioannis and Monaco, G., A 6/5-approximation algorithm for the maximum 3-cover problem, in: 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), pages 205-216, 2008. |
|
|
|