Search

by non-specialists and are both highly scalable and replicable. Additionally, analysis workflows and results can conveniently be shared over the Internet, encouraging communication and collaboration. Sequence [...] 3 Computational Biology and Applied Algorithmics Phone +49 681 9325-3016 Email beggel@mpi-inf.mpg.de Sven-Eric Schelhorn DEPT. 3 Computational Biology and Applied Algorithmics Phone +49 681 9325-3028 Email [...] genome sequences of both the virus and its human host. These genome sequences provide the basis for understanding the complex molecular interplay between the pathogen and the patient, knowledge that is crucial

Lifted Disjoint Paths}, AUTHOR = {Hor{\v n}{\'a}kov{\'a}, Andrea and Kaiser, Timo and Swoboda, Paul and Rolinek, Michal and Rosenhahn, Bodo and Henschel, Roberto}, LANGUAGE = {eng}, ISBN = {978-1-6654-2812-5} [...] {Structured Prediction Problem Archive}, AUTHOR = {Swoboda, Paul and Hor{\v n}{\'a}kov{\'a}, Andrea and R{\"o}tzer, Paul and Savchynskyy, Bogdan and Abbas, Ahmed}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2202 [...] Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society Databases and Information Systems

Augusto and Velloso, Eduardo and Bulling, Andreas and Masai, Katsutoshi and Sugiura, Yuta and Ogata, Masa and Kunze, Kai and Inami, Masahiko and Sugimoto, Maki and Rathnayake, Anura and Dias, Tilak}, LANGUAGE [...] AUTHOR = {Loetscher, Tobias and Chen, Celia and Wignall, Sophie and Bulling, Andreas and Hoppe, Sabrina and Churches, Owen and Thomas, Nicole A. and Nicholls, Michael E. R. and Lee, Andrew}, LANGUAGE = {eng} [...] Spatial Neglect}, AUTHOR = {Loetscher, Tobias and Chen, Celia and Hoppe, Sabrina and Bulling, Andreas and Wignall, Sophie and Owen, Churches and Thomas, Nicole and Lee, Andrew}, LANGUAGE = {eng}, DOI = {10

Meeting on Algorithm Engineering and Experiments (ALENEX) , 2012, pp. 45 - 54, DOI: 10.1137/1.9781611972924.4 Accelerated Bend Minimization S. Cornelsen , A. Karrenbauer Journal of Graph Algorithms and Applications [...] in the Algorithms and Complexity department at the Max Planck Institute for Informatics . Education October 2004 - December 2007: Ph.D. student in Computer Science at Saarland University and at the Max [...] Research Departments Algorithms and Complexity People Andreas Karrenbauer Dr.-Ing. Andreas Karrenbauer Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken

Research Departments Algorithms and Complexity People Anita Dürr Anita Dürr Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 328 Phone [...] Monotone Min-Plus Convolution and Balancing Karl Bringmann, Anita Dürr, Adam Polak, ESA 2024 ( Best Paper Award Track A ) Improved bounds for rectangular monotone Min-Plus Product and applications Anita Dürr [...] 106358 (2023) An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs Anita Dürr, Nicolas El Maalouly, Lasse Wulf, APPROX/RANDOM 2023 See my DBLP and Google Scholar pages for the full

{Seufert, Michael and Dietz, Katharina and Wehner, Nikolas and Gei{\ss}ler, Stefan and Sch{\"u}ler, Joshua and Wolz, Manuel and Hotho, Andreas and Casas, Pedro and Ho{\ss}feld, Tobias and Feldmann, Anja} [...] {Feldmann, Anja and Gasser, Oliver and Lichtblau, Franziska and Pujol, Enric and Poese, Ingmar and Dietzel, Christoph and Wagner, Daniel and Wichtlhuber, Matthias and Tapiador, Juan and Vallina-Rodriguez [...] {Feldmann, Anja and Gasser, Oliver and Lichtblau, Franziska and Pujol, Enric and Poese, Ingmar and Dietzel, Christoph and Wagner, Daniel and Wichtlhuber, Matthias and Tapiador, Juan and Vallina-Rodriguez

ng work on the measurement, modeling and optimization of Internet traffic, providing important insights into complex network traffic phenomena. These analyses and modeling led to optimizations that si [...] home offices, analyze throughput and latency of the Internet at selected points, and characterize regional differences and selective bottlenecks. This work also demonstrates that the Internet was able to [...] ts and analyses of changes in Internet traffic during the corona pandemic, which underscore the social relevance of her research. These studies show the enormous increase in video conferencing and home

n for Semantic Image Synthesis}}, AUTHOR = {Sushko, Vadim and Sch{\"o}nfeld, Edgar and Zhang, Dan and Gall, J{\"u}rgen and Schiele, Bernt and Khoreva, Anna}, LANGUAGE = {eng}, ISSN = {0920-5691}, DOI = [...] for Semantic Image Synthesis}, AUTHOR = {Sch{\"o}nfeld, Edgar and Sushko, Vadim and Zhang, Dan and Gall, J{\"u}rgen and Schiele, Bernt and Khoreva, Anna}, LANGUAGE = {eng}, URL = {https://openreview.net/forum [...] {Simple Does It: Weakly Supervised Instance and Semantic Segmentation}, AUTHOR = {Khoreva, Anna and Benenson, Rodrigo and Hosang, Jan and Hein, Matthias and Schiele, Bernt}, LANGUAGE = {eng}, ISBN = {

Fritz and A. Bulling, Proc. of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June, p.4511-4520, (2015). arXiv , PDF @inproceedings{zhang15_cvpr, Author = {Xucong Zhang and Yusuke [...] Yusuke Sugano and Mario Fritz and Bulling, Andreas}, Title = {Appearance-based Gaze Estimation in the Wild}, Booktitle = {Proc. of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)}, Year [...] detector [1] and facial landmark detector [2]. For each participants, the images and annotations are organized by days. For each day's folder, there are the image collected by that participants and corresponding

IMPRS, ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] Departments Algorithms and Complexity Research Approximation Algorithms Approximation Algorithms Most interesting optimization problems are NP-Hard. For such problems, unless P=NP, exact algorithms cannot be [...] efficient. In the field of approximation algorithms, we take the reverse perspective: efficient algorithms cannot be exact. But if we naturally insist on efficient algorithms, how close can we get to an optimal