PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Giannakos, Aristotelis"

Author of the publication

copydeleteadd this publication to your clipboard
Online maximum k-coverage.

, , , , and . Discrete Applied Mathematics, 160 (13-14): 1901-1913 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Giannakos, Aristotelis
add a person with the name Giannakos, Aristotelis
 

Other publications of authors with the same name

On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract)., , and . Euro-Par, Vol. II, volume 1124 of Lecture Notes in Computer Science, page 578-581. Springer, (1996)Data Delivery by Mobile Agents with Energy Constraints over a fixed path., , and . CoRR, (2017)On the Performance of Congestion Games for Optimum Satisfiability Problems., , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 220-231. Springer, (2007)Greedy algorithms for on-line set-covering and related problems., , and . CATS, volume 51 of CRPIT, page 145-151. Australian Computer Society, (2006)A Message-Optimal Sink Mobility Model for Wireless Sensor Networks., , and . ICN, page 287-291. IEEE Computer Society, (2009)Exact and Approximation Algorithms for Densest k-Subgraph., , , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 114-125. Springer, (2013)The max quasi-independent set Problem., , , , , and . CSR, volume 6072 of Lecture Notes in Computer Science, page 60-71. Springer, (2010)Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases., , , , and . ITA, 34 (2): 87-98 (2000)Online maximum k-coverage., , , , and . Discrete Applied Mathematics, 160 (13-14): 1901-1913 (2012)The max quasi-independent set problem., , , , , and . J. Comb. Optim., 23 (1): 94-117 (2012)