Angelopoulos, S.: On the Competitiveness of the Online Asymmetric and Euclidean {Steiner} Tree Problems. In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, (Eds.) Bampis, Evripidis; Jansen, Klaus. Lecture Notes in Computer Science. Springer, Berlin (2010) 1-12.
doi: 10.1007/978-3-642-12450-1_1
localid: C1256428004B93B8-8F2385D13F0A6BB4C12576C600448558-Angelopoulos:waoa2009
Angelopoulos, S. and A. Borodin: Randomized Priority Algorithms. In: Theoretical Computer Science 411, 26-28, 2542-2558 (2010).
doi: 10.1016/j.tcs.2010.03.014
localid: C1256428004B93B8-1B91BC8C3527AD3BC1257822004B0A71-Angelopoulos.Borodin:randomized.2010
Angelopoulos, S. and A. Lopez-Ortiz: Intertruptible Algorithms for Multi Problem Solving. In: 21st International Joint Conference on Artificial Intelligence (IJCAI 09) AAAI Press, Menlo Park, California (2009) 380-386.
localid: C1256428004B93B8-411FA5ECACA68ABBC12576C6004392EB-AngLop:ijcai09
Angelopoulos, S.: Online Priority Steiner Tree Problems. In: 11th Symposium on Algorithms and Data Structures (WADS) Lecture Notes in Computer Science. Springer, Berlin/Heidelberg (2009) 37-48.
localid: C1256428004B93B8-0BA2B0A603ECEC7AC12576C6004418BF-Angelopoulos:wads2009
Angelopoulos, S. and P. Schweitzer: Paging and List Update under Bijective Analysis. In: 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), (Eds.) Mathieu, Claire. ACM press, (2009) 1136-1145.
localid: C1256428004B93B8-F8776844570B3510C1257551004A2193-AngSch:2009.bijective
Angelopoulos, S., B. Doerr, A. Huber and K. Panagiotou: Tight bounds for quasirandom rumor spreading. In: The Electronic Journal of Combinatorics 16, 1 (2009).
localid: C1256428004B93B8-B1172843E76CB717C12576CA00573B18-ADHP2009
Angelopoulos, S.: A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. In: Algorithms - ESA 2008 : 16th Annual European Symposium, (Eds.) Halperin, Dan; Mehlhorn, Kurt. Lecture Notes in Computer Science. Springer, Berlin (2008) 76-87.
doi: 10.1007/978-3-540-87744-8_7
localid: C125756E0038A185-3EB6F5B2FD7D2467C1257551004AD9C1-Ang:08.steiner
Angelopoulos, S., R. Dorrigiv and A. Lopez-Ortiz: List Update with Locality of Reference. In: LATIN 2008: Theoretical Informatics : 8th Latin American Symposium, (Eds.) Laber, Eduardo Sany; Bornstein, Claudson; Tito Nogueira, Loana; Faria, Luerbio. Lecture Notes in Computer Science. Springer, Berlin (2008) 399-410.
doi: 10.1007/978-3-540-78773-0_35
localid: C125756E0038A185-EA4BEDD635A6E4F4C1257551004A9DC9-ADLO:08.listupdate
Angelopoulos, S., A. Lopez-Ortiz and A. Hamel: Optimal Scheduling of Contract Algorithms with Soft Deadlines. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence and the Twentieth Innovative Applications of Artificial Intelligence Conference. - Vol. 2 AAAI Press, Menlo Park (2008) 868-873.
localid: C125756E0038A185-621E692B96E2A04EC1257551004B4F84-ALOH:08.soft
Angelopoulos, S.: Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, (Eds.) Bansal, Nikhil; Pruhs, Kirk; Stein, Clifford. SIAM, Philadelphia, USA (2007) 248-257.
localid: C12573CC004A8E26-EF04F0E72F2B7B32C12573D400486F40-Angelopoulos2007SODA1
The Max Planck Society does not take any responsibility for the content of this export.