Andreas Karrenbauer
Andreas Karrenbauer
Senior Researcher, Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrucken
Потвърден имейл адрес: mpi-inf.mpg.de - Начална страница
Заглавие
Позовавания
Позовавания
Година
Near-optimal approximate shortest paths and transshipment in distributed and streaming models
R Becker, S Forster, A Karrenbauer, C Lenzen
arXiv preprint arXiv:1607.05127, 2016
79*2016
Accelerated bend minimization
S Cornelsen, A Karrenbauer
International Symposium on Graph Drawing, 111-122, 2011
462011
Computing H/D-exchange rates of single residues from data of proteolytic fragments
E Althaus, S Canzar, C Ehrler, MR Emmett, A Karrenbauer, AG Marshall, ...
BMC bioinformatics 11 (1), 1-12, 2010
432010
Near-optimal distributed maximum flow
M Ghaffari, A Karrenbauer, F Kuhn, C Lenzen, B Patt-Shamir
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
412015
Improvements to keyboard optimization with integer programming
A Karrenbauer, A Oulasvirta
Proceedings of the 27th annual ACM symposium on User interface software and …, 2014
372014
A novel method for automatic single molecule tracking of blinking molecules at low intensities
D Wöll, C Kölbl, B Stempfle, A Karrenbauer
Physical Chemistry Chemical Physics 15 (17), 6196-6205, 2013
372013
PACKING A TRUCK—NOW WITH A TWIST!
F Eisenbrand, S Funke, A Karrenbauer, J Reichel, E Schömer
International Journal of Computational Geometry & Applications 17 (05), 505-527, 2007
372007
Sorted Sector Covering Combined with Image Condensation--An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs
M Albrecht, A Karrenbauer, T Jung, C Xu
IEICE transactions on electronics 93 (11), 1556-1563, 2010
352010
Combinatorial optimization of graphical user interface designs
A Oulasvirta, NR Dayama, M Shiripour, M John, A Karrenbauer
Proceedings of the IEEE 108 (3), 434-464, 2020
342020
Physarum can compute shortest paths: Convergence proofs and complexity bounds
L Becchetti, V Bonifaci, M Dirnberger, A Karrenbauer, K Mehlhorn
International Colloquium on Automata, Languages, and Programming, 472-483, 2013
342013
Domain walls and chaos in the disordered SOS model
K Schwarz, A Karrenbauer, G Schehr, H Rieger
Journal of Statistical Mechanics: Theory and Experiment 2009 (08), P08022, 2009
262009
Recovering missing coefficients in DCT-transformed images
S Li, A Karrenbauer, D Saupe, CCJ Kuo
2011 18th IEEE International Conference on Image Processing, 1537-1540, 2011
232011
Nearly tight approximability results for minimum biclique cover and partition
P Chalermsook, S Heydrich, E Holm, A Karrenbauer
European Symposium on Algorithms, 235-246, 2014
222014
Computing H/D-exchange speeds of single residues from data of peptic fragments
E Althaus, S Canzar, MR Emmett, A Karrenbauer, AG Marshall, ...
Proceedings of the 2008 ACM symposium on Applied computing, 1273-1277, 2008
222008
Computational support for functionality selection in interaction design
A Oulasvirta, A Feit, P Lähteenlahti, A Karrenbauer
ACM Transactions on Computer-Human Interaction (TOCHI) 24 (5), 1-30, 2017
182017
On the parameterized complexity of biclique cover and partition
S Chandran, D Issac, A Karrenbauer
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
172017
Algorithms for longer OLED lifetime
F Eisenbrand, A Karrenbauer, C Xu
Journal of Experimental Algorithmics (JEA) 14, 4.3-4.17, 2010
162010
8.4: A New Addressing Scheme for PM OLED Display
C Xu, A Karrenbauer, KM Soh, J Wahl
SID Symposium Digest of Technical Papers 38 (1), 97-100, 2007
152007
Multiline addressing by network flow
F Eisenbrand, A Karrenbauer, M Skutella, C Xu
European Symposium on Algorithms, 744-755, 2006
152006
From DQBF to QBF by dependency elimination
R Wimmer, A Karrenbauer, R Becker, C Scholl, B Becker
International Conference on Theory and Applications of Satisfiability …, 2017
142017
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20