Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Last revision Both sides next revision
staff:andreastoennis [2018/09/25 16:20]
toennis [Teaching]
staff:andreastoennis [2019/09/04 13:15]
toennis [Publikationen]
Line 17: Line 17:
  
 ===== Publikationen ===== ===== Publikationen =====
 +=== Journal Publications ===
 +  * 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 \\ Mathematics of Operations Research ([[https://​pubsonline.informs.org/​doi/​abs/​10.1287/​moor.2019.0993|MOR'​19]]),​ ([[https://​arxiv.org/​abs/​1604.08125|arxiv.org]])
 +
 +
 +  * Primal Beats Dual on Online Packing LPs in the Random-Order Model \\ Thomas Kesselheim, Klaus Radke, Andreas Tönnis and Prof. Berthold Vöcking \\  SIAM J. Comput. 47(5): 1939-1964 ([[https://​epubs.siam.org/​doi/​abs/​10.1137/​15M1033708|SICOMP'​18]]) \\ also appeared in Proc. of the 46th Annual ACM Symposium on Theory of Computing ([[https://​dl.acm.org/​citation.cfm?​id=2591810|STOC'​14]]),​ pp. 303-312.
 +
 === Refereed Conference Proceedings === === Refereed Conference Proceedings ===
 +
 +  * Online Best Reply Algorithms for Resource Allocation Problems \\ Max Klimm, Daniel Schmand and Andreas Tönnis \\ to appear at SAGT'​19,​ ([[https://​arxiv.org/​abs/​1805.02526|arxiv.org]])
  
   * 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 ([[http://​drops.dagstuhl.de/​opus/​volltexte/​2018/​8803/​pdf/​LIPIcs-FUN-2018-12.pdf|FUN'​18]]),​ 12:1-12:17.   * 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 ([[http://​drops.dagstuhl.de/​opus/​volltexte/​2018/​8803/​pdf/​LIPIcs-FUN-2018-12.pdf|FUN'​18]]),​ 12:1-12:17.
Line 28: Line 36:
  
   * 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 ([[https://​link.springer.com/​chapter/​10.1007/​978-3-662-48350-3_57|ESA'​15]]),​ pp. 680-692.   * 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 ([[https://​link.springer.com/​chapter/​10.1007/​978-3-662-48350-3_57|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 ([[https://​dl.acm.org/​citation.cfm?​id=2591810|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 ([[https://​link.springer.com/​chapter/​10.1007/​978-3-642-40450-4_50|ESA'​13]]),​ pp. 589-600.   * 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 ([[https://​link.springer.com/​chapter/​10.1007/​978-3-642-40450-4_50|ESA'​13]]),​ pp. 589-600.
Line 35: Line 41:
 === Current Preprints === === Current Preprints ===
  
-  * Online Best Reply Algorithms for Resource Allocation Problems \\ Max Klimm, Daniel Schmand and Andreas Tönnis ([[https://​arxiv.org/​abs/​1805.02526|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 ([[https://​arxiv.org/​abs/​1604.08125|arxiv.org]])+ 
     ​     ​
 ==== Teaching ==== ==== Teaching ====

Page Tools