A Hybrid Algorithm for Convex Semidefinite Optimization S Laue ICML 2012, 177--184, 2012 | 68 | 2012 |

Efficient embedding of scale-free graphs in the hyperbolic plane T Bläsius, T Friedrich, A Krohmer, S Laue IEEE/ACM Transactions on Networking, 2018 | 40 | 2018 |

Approximating parameterized convex optimization problems J Giesen, M Jaggi, S Laue ACM Transactions on Algorithms (TALG) 9 (1), 1-17, 2012 | 27 | 2012 |

Computing Higher Order Derivatives of Matrix and Tensor Expressions. S Laue, M Mitterreiter, J Giesen NeurIPS, 2755-2764, 2018 | 25 | 2018 |

A linear algorithm for integer programming in the plane F Eisenbrand, S Laue Mathematical programming 102 (2), 249-259, 2005 | 24 | 2005 |

Approximating Concavely Parameterized Optimization Problems J Giesen, S Laue, JK Mueller, S Swiercy NIPS 2012, 2114-2122, 2012 | 23 | 2012 |

Geometric Set Cover and Hitting Sets for Polytopes in S Laue STACS 2008, 479-490, 2008 | 23 | 2008 |

Generating massive complex networks with hyperbolic geometry faster in practice M von Looz, MS Özdayi, S Laue, H Meyerhenke High Performance Extreme Computing Conference (HPEC), 2016 IEEE, 1-6, 2016 | 21 | 2016 |

A comparison of models of word meaning in context G Dinu, S Thater, S Laue Proceedings of the 2012 Conference of the North American Chapter of the …, 2012 | 21 | 2012 |

Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets S Funke, S Laue STACS 2007, 272-283, 2007 | 21 | 2007 |

Approximating parameterized convex optimization problems J Giesen, M Jaggi, S Laue Algorithms–ESA 2010, 524-535, 2010 | 16 | 2010 |

Regularization Paths with Guarantees for Convex Semidefinite Optimization. J Giesen, M Jaggi, S Laue AISTATS, 432-439, 2012 | 14 | 2012 |

A simple and efficient tensor calculus S Laue, M Mitterreiter, J Giesen Proceedings of the AAAI Conference on Artificial Intelligence 34 (04), 4527-4534, 2020 | 11 | 2020 |

Optimizing over the Growing Spectrahedron. J Giesen, M Jaggi, S Laue ESA, 503-514, 2012 | 11 | 2012 |

Personal routes with high-dimensional costs and dynamic approximation guarantees S Funke, S Laue, S Storandt 16th International Symposium on Experimental Algorithms (SEA 2017), 2017 | 10 | 2017 |

Approximating k-hop minimum spanning trees in Euclidean metrics S Laue, D Matijević Information Processing Letters 107 (3), 96-101, 2008 | 10 | 2008 |

Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours S Funke, S Laue, Z Lotker, R Naujoks Ad Hoc Networks 9 (6), 1028-1035, 2011 | 9 | 2011 |

Distributed Convex Optimization with Many Convex Constraints J Giesen, S Laue arXiv preprint arXiv:1610.02967, 2016 | 8 | 2016 |

Robust and Efficient Kernel Hyperparameter Paths with Guarantees J Giesen, S Laue, P Wieschollek Proceedings of the 31st International Conference on Machine Learning (ICML …, 2014 | 8 | 2014 |

Deducing individual driving preferences for user-aware navigation S Funke, S Laue, S Storandt Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances …, 2016 | 7 | 2016 |