default search action
Andreas Karrenbauer
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation: University of Konstanz, Zukunftskolleg, Germany
- affiliation: EPFL, Institute of Mathematics, Lausanne, Switzerland
- affiliation (PhD 2007): Saarland University, Informatics Campus, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i17]Sophia Saller, Jana Koehler, Andreas Karrenbauer:
A Systematic Review of Approximability Results for Traveling Salesman Problems leveraging the TSP-T3CO Definition Scheme. CoRR abs/2311.00604 (2023) - 2022
- [j21]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev
, Kurt Mehlhorn, Giovanna Morigi
Physarum-inspired multi-commodity flow dynamics. Theor. Comput. Sci. 920: 1-20 (2022) - [i16]Andreas Karrenbauer, Leonie Krull, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek:
Improving Order with Queues. CoRR abs/2207.02476 (2022) - 2021
- [j20]Anna Maria Feit
AZERTY amélioré: computational design on a national scale. Commun. ACM 64(2): 48-58 (2021) - [j19]Niraj Ramesh Dayama
Foraging-based optimization of menu systems. Int. J. Hum. Comput. Stud. 151: 102624 (2021) - [j18]Ruben Becker
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM J. Comput. 50(3): 815-856 (2021) - [c33]Jeff Giliberti
Improved Online Algorithm for Fractional Knapsack in the Random Order Model. WAOA 2021: 188-205 - [i15]Jeff Giliberti, Andreas Karrenbauer:
Improved Online Algorithm for Fractional Knapsack in the Random Order Model. CoRR abs/2109.04428 (2021) - [i14]Hamidreza Kamkari, Andreas Karrenbauer, Mohammadamin Sharifi:
Physarum Inspired Dynamics to Solve Semi-Definite Programs. CoRR abs/2111.02291 (2021) - 2020
- [j17]Weiqiang Liu, Maximilian John, Andreas Karrenbauer, Adam Allerhand, Fabrizio Lombardi, Michael Shulte, David J. Miller, Zhen Xiang, George Kesidis, Antti Oulasvirta, Niraj Ramesh Dayama, Morteza Shiripour:
Scanning the Issue. Proc. IEEE 108(3): 400-401 (2020) - [j16]Antti Oulasvirta
Combinatorial Optimization of Graphical User Interface Designs. Proc. IEEE 108(3): 434-464 (2020) - [j15]Enrico Facca
Convergence of the non-uniform directed Physarum model. Theor. Comput. Sci. 816: 184-194 (2020) - [j14]Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the non-uniform Physarum dynamics. Theor. Comput. Sci. 816: 260-269 (2020) - [c32]Andreas Karrenbauer, Elizaveta Kovalevskaya:
Reading Articles Online. COCOA 2020: 639-654 - [i13]Niraj Ramesh Dayama, Morteza Shiripour, Antti Oulasvirta, Evgeny Ivanko, Andreas Karrenbauer:
Foraging-based Optimization of Menu Systems. CoRR abs/2005.01292 (2020) - [i12]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande:
Physarum Multi-Commodity Flow Dynamics. CoRR abs/2009.01498 (2020) - [i11]Andreas Karrenbauer, Elizaveta Kovalevskaya:
Reading Articles Online. CoRR abs/2012.04343 (2020)
2010 – 2019
- 2019
- [j13]Ruben Becker
Two results on slime mold computations. Theor. Comput. Sci. 773: 79-106 (2019) - [c31]Maximilian John, Andreas Karrenbauer:
Dynamic Sparsification for Quadratic Assignment Problems. MOTOR 2019: 232-246 - [i10]Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the Non-Uniform Physarum Dynamics. CoRR abs/1901.07231 (2019) - [i9]Enrico Facca, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Convergence of the Non-Uniform Directed Physarum Model. CoRR abs/1906.07781 (2019) - 2018
- [j12]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. SIAM J. Comput. 47(6): 2078-2117 (2018) - [c30]Jan-Hendrik Lange, Andreas Karrenbauer, Bjoern Andres:
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering. ICML 2018: 2898-2907 - [c29]Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker:
From DQBF to QBF by Dependency Elimination. MBMV 2018 - 2017
- [j11]Antti Oulasvirta
Computational Support for Functionality Selection in Interaction Design. ACM Trans. Comput. Hum. Interact. 24(5): 34:1-34:30 (2017) - [c28]Ralf Wimmer
From DQBF to QBF by Dependency Elimination. SAT 2017: 326-343 - [c27]Ruben Becker
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC 2017: 7:1-7:16 - [i8]Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Two Results on Slime Mold Computations. CoRR abs/1707.06631 (2017) - 2016
- [c26]Ruben Becker, Maximilian Fickert
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. ALENEX 2016: 151-159 - [c25]Ulrik Brandes, Eugenia Holm, Andreas Karrenbauer:
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks. COCOA 2016: 175-186 - [c24]Maximilian John, Andreas Karrenbauer
A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases. ISCO 2016: 414-425 - [c23]L. Sunil Chandran, Davis Issac, Andreas Karrenbauer:
On the Parameterized Complexity of Biclique Cover and Partition. IPEC 2016: 11:1-11:13 - [i7]Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs/1607.05127 (2016) - [i6]Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn:
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. CoRR abs/1612.04689 (2016) - 2015
- [j10]Jaroslaw Byrka, Andreas Karrenbauer
The interval constrained 3-coloring problem. Theor. Comput. Sci. 593: 42-50 (2015) - [c22]Fidaa Abed
On Guillotine Cutting Sequences. APPROX-RANDOM 2015: 1-19 - [c21]Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn, Girish Varma:
P. polycephalum Can Compute Shortest Paths. BICT 2015: 587 - [c20]Mohsen Ghaffari, Andreas Karrenbauer
Near-Optimal Distributed Maximum Flow: Extended Abstract. PODC 2015: 81-90 - [i5]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. CoRR abs/1508.04747 (2015) - 2014
- [c19]Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. ESA 2014: 235-246 - [c18]Ruben Becker
A Simple Efficient Interior Point Method for Min-Cost Flow. ISAAC 2014: 753-765 - [c17]Andreas Karrenbauer, Antti Oulasvirta:
Improvements to keyboard optimization with integer programming. UIST 2014: 621-626 - 2013
- [c16]Luca Becchetti
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. ICALP (2) 2013: 472-483 - [c15]Andreas Karrenbauer
Blinking Molecule Tracking. SEA 2013: 308-319 - [i4]Ruben Becker, Andreas Karrenbauer:
A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem. CoRR abs/1312.3905 (2013) - 2012
- [j9]Sabine Cornelsen, Andreas Karrenbauer
Accelerated Bend Minimization. J. Graph Algorithms Appl. 16(3): 635-650 (2012) - [c14]Sabine Cornelsen, Andreas Karrenbauer
Leveling the Grid. ALENEX 2012: 45-54 - [i3]Shujun Li, Andreas Karrenbauer, Dietmar Saupe, C.-C. Jay Kuo:
Recovering Missing Coefficients in DCT-Transformed Images. CoRR abs/1209.1673 (2012) - [i2]Andreas Karrenbauer, Dominik Wöll:
Blinking Molecule Tracking. CoRR abs/1212.5877 (2012) - 2011
- [j8]Ernst Althaus, Stefan Canzar
Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61(2): 342-361 (2011) - [c13]Sabine Cornelsen, Andreas Karrenbauer
Accelerated Bend Minimization. GD 2011: 111-122 - [c12]Shujun Li
Recovering missing coefficients in DCT-transformed images. ICIP 2011: 1537-1540 - 2010
- [j7]Ernst Althaus, Stefan Canzar
Computing H/D-Exchange rates of single residues from data of proteolytic fragments. BMC Bioinform. 11: 424 (2010) - [j6]Marc Albrecht, Andreas Karrenbauer
Sorted Sector Covering Combined with Image Condensation - An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs. IEICE Trans. Electron. 93-C(11): 1556-1563 (2010) - [j5]Johannes Hatzl, Andreas Karrenbauer
A combinatorial algorithm for the 1-median problem in Rd with the Chebyshev norm. Oper. Res. Lett. 38(5): 383-385 (2010) - [c11]Jaroslaw Byrka, Andreas Karrenbauer
The Interval Constrained 3-Coloring Problem. LATIN 2010: 591-602 - [c10]Andreas Karrenbauer
A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks. WAOA 2010: 166-177
2000 – 2009
- 2009
- [j4]Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu:
Multiline Addressing by Network Flow. Algorithmica 53(4): 583-596 (2009) - [j3]Friedrich Eisenbrand, Andreas Karrenbauer
Algorithms for longer OLED lifetime. ACM J. Exp. Algorithmics 14 (2009) - [c9]Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-Bäse, Jeremiah Tiptopn, Huimin Zhang:
Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments. BIOCOMP 2009: 496-502 - [c8]Andreas Karrenbauer
Matching Techniques Ride to Rescue OLED Displays. COCOA 2009: 110-122 - [c7]Andreas Karrenbauer
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling. ESA 2009: 432-443 - [i1]Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità:
The interval constrained 3-coloring problem. CoRR abs/0907.3563 (2009) - 2008
- [j2]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Energy-Aware Stage Illumination. Int. J. Comput. Geom. Appl. 18(1/2): 107-129 (2008) - [c6]Ernst Althaus, Stefan Canzar
Computing H/D-exchange speeds of single residues from data of peptic fragments. SAC 2008: 1273-1277 - [c5]Ernst Althaus, Stefan Canzar
Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221 - 2007
- [b1]Andreas Karrenbauer:
Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays. Saarland University, 2007 - [j1]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Packing a Truck - Now with a Twist! Int. J. Comput. Geom. Appl. 17(5): 505-527 (2007) - [c4]Friedrich Eisenbrand, Andreas Karrenbauer
Algorithms for Longer OLED Lifetime. WEA 2007: 338-351 - 2006
- [c3]Friedrich Eisenbrand, Andreas Karrenbauer
Multiline Addressing by Network Flow. ESA 2006: 744-755 - 2005
- [c2]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Energy-aware stage illumination. SCG 2005: 336-345 - [c1]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer
Packing a trunk: now with a twist! Symposium on Solid and Physical Modeling 2005: 197-206
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: