Andreas Tönnis M.Sc.

BüroUniversität Bonn
Institut für
Informatik V
Raum 2.070
Endenicher Allee 19a
D-53115 Bonn
Telefon0228-73 60686
Fax
E-Mail atoennis@uni-bonn.de
SprechzeitenNach Vereinbarung

Arbeitsgruppe

Forschungsinteressen

  • Online Algorithms
  • Approximation Algorithms
  • Algorithmic Game Theory

Publikationen

Refereed Conference Proceedings

  • SUPERSET: A (Super) Natural Variant of the Card Game SET
    Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior and Andreas Tönnis
    In Proc. of FUN with Algorithms (FUN'18), 12:1-12:17.
  • A Collection of Lower Bounds for Online Matching on the Line
    Antonios Antoniadis, Carsten Fischer and Andreas Tönnis
    In Proc. of the Latin American Symposium on Theoretical Informatics (LATIN'18), pp. 52-65.
  • Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
    Thomas Kesselheim and Andreas Tönnis
    In Proc. of APPROX/RANDOM 2017 (APPROX'17), 16:1-16:22.
  • Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions
    Thomas Kesselheim and Andreas Tönnis
    In Proc. of the 24rd European Symposium on Algorithms (ESA'16), 51:1-51:17.
  • Online Appointment Scheduling in the Random Order Model
    Oliver Göbel, Thomas Kesselheim and Andreas Tönnis
    In Proc. of the 23rd European Symposium on Algorithms (ESA'15), pp. 680-692.
  • Primal Beats Dual on Online Packing LPs in the Random-Order Model
    Thomas Kesselheim, Klaus Radke, Andreas Tönnis and Prof. Berthold Vöcking
    In Proc. of the 46th Annual ACM Symposium on Theory of Computing (STOC'14), pp. 303-312.
  • An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
    Thomas Kesselheim, Klaus Radke, Andreas Tönnis and Prof. Berthold Vöcking
    In Proc. of the 21st European Symposium on Algorithms (ESA'13), pp. 589-600.

Current Preprints

  • Online Best Reply Algorithms for Resource Allocation Problems
    Max Klimm, Daniel Schmand and Andreas Tönnis (arxiv.org)
  • Hiring Secretaries over Time: The Benefit of Concurrent Employment
    Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik and Andreas Tönnis (arxiv.org)

Teaching

Teaching Assistant

  • Summer 2018: Lab: Efficient Algorithms for Selected Problems
  • Summer 2018: Projektgruppe Entwurf und Implementierung von Algorithmen
  • Summer 2016: Lecture: Algorithmic Game Theory
  • Winter 2015/2016: Seminar: Online Algorithms
  • Summer 2015: Lecture: Algorithmic Game Theory
  • Summer 2014: Lecture: Algorithmic Game Theory
  • Summer 2013: Proseminar: Grundlagen der Algorithmik
  • Winter 2012/2013: Lecture: Berechenbarkeit und Komplexität

Page Tools