Ernst Althaus

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 16

Top Venues

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Ernst Althaus, Lisa Hartung, Rebecca Steiner
A Random Walk Approach to Broadcasting on Random Recursive Trees. CoRR (2024)
Ernst Althaus, Daniela Schnurbusch
Reducing Treewidth for SAT-Related Problems Using Simple Liftings. ISCO (2024)
Ernst Althaus, Benjamin Merlin Bumpus, James Fairbanks, Daniel Rosiak
Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves. CoRR (2023)
Lukas-Malte Bammert, Stefan Kramer, Mattia Cerrato, Ernst Althaus
Privacy-Preserving Learning of Random Forests Without Revealing the Trees. DS (2023)
Ernst Althaus, Petra Berenbrink, André Brinkmann, Rebecca Steiner
On the Optimality of the Greedy Garbage Collection Strategy for SSDs. ICDCS (2022)
Ernst Althaus, Stefan Funke, Moritz Schrauth
Privacy Preserving Queries of Shortest Path Distances. ALGOCLOUD (2022)
Ernst Althaus, Andreas Hildebrandt, Domenico Mosca
Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars. AlCoB (2021)
Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, Sarah Ziegler
On Tamaki's Algorithm to Compute Treewidths. SEA (2021)
Ernst Althaus, Mohammad Sadeq Dousti, Stefan Kramer
Fast Private Parameter Learning and Evaluation for Sum-Product Networks. CoRR (2021)
Christian Häcker, Panagiotis Bouros, Theodoros Chondrogiannis, Ernst Althaus
Most Diverse Near-Shortest Paths. SIGSPATIAL/GIS (2021)
Anna Katharina Hildebrandt, Ernst Althaus, Andreas Hildebrandt
Privately Querying Privacy: Privacy Estimation with Guaranteed Privacy of User and Database Party. ALGOCLOUD (2021)
Ernst Althaus, Felix Rauterberg, Sarah Ziegler
Computing Euclidean Steiner trees over segments. EURO J. Comput. Optim. 8 (3) (2020)
Ernst Althaus, Sarah Ziegler
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm. CoRR (2019)
Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß
Scheduling shared continuous resources on many-cores. J. Sched. 21 (1) (2018)
Ernst Althaus, Björn Beber, Werner Damm, Stefan Disch, Willem Hagemann, Astrid Rakow, Christoph Scholl, Uwe Waldmann, Boris Wirtz
Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement. Sci. Comput. Program. 148 (2017)
Ernst Althaus, Andreas Hildebrandt, Domenico Mosca
Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness. STAF Workshops (2017)
Ernst Althaus, Björn Beber, Joschka Kupilas, Christoph Scholl
Improving Interpolants for Linear Arithmetic. ATVA (2015)
Anna Katharina Hildebrandt, Matthias Dietzen, Thomas Lengauer, Hans-Peter Lenhof, Ernst Althaus, Andreas Hildebrandt
Efficient computation of root mean square deviations under rigid transformations. J. Comput. Chem. 35 (10) (2014)
Ernst Althaus, Markus Blumenstock, Alexej Disterhoft, Andreas Hildebrandt, Markus Krupp
Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem. COCOA (2014)
Ernst Althaus, Andreas Hildebrandt, Anna Katharina Hildebrandt
A Greedy Algorithm for Hierarchical Complete Linkage Clustering. AlCoB (2014)
Christoph Scholl, Florian Pigorsch, Stefan Disch, Ernst Althaus
Simple interpolants for linear arithmetic. DATE (2014)
Ernst Althaus, Joschka Kupilas, Rouven Naujoks
On the low-dimensional Steiner minimum tree problem in Hamming metric. Theor. Comput. Sci. 505 (2013)
Anna Katharina Hildebrandt, Ernst Althaus, Hans-Peter Lenhof, Chien-Wen Hung, Andreas Tholey, Andreas Hildebrandt
Efficient Interpretation of Tandem Mass Tags in Top-Down Proteomics. GCB (2013)
Ernst Althaus, Daniel Dumitriu
Certifying feasibility and objective value of linear programs. Oper. Res. Lett. 40 (4) (2012)
Ernst Althaus, Bernd Becker, Daniel Dumitriu, Stefan Kupferschmid
Integration of an LP Solver into Interval Constraint Propagation. COCOA (2011)
Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks
Symbolic Worst Case Execution Times. ICTAC (2011)
Ernst Althaus, Joschka Kupilas, Rouven Naujoks
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric. TAMC (2011)
Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks
Precise and efficient parametric path analysis. LCTES (2011)
Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre
Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61 (2) (2011)
Ernst Althaus, Rouven Naujoks, Eike Thaden
A Column Generation Approach to Scheduling of Periodic Tasks. SEA (2011)
Ernst Althaus, Peter Hachenberger
Fully Automatic Trunk Packing with Free Placements CoRR (2010)
Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-Bäse, Jeremiah D. Tipton, Huimin Zhang
Computing H/D-Exchange rates of single residues from data of proteolytic fragments. BMC Bioinform. 11 (2010)
Ernst Althaus, Daniel Dumitriu
Fast and Accurate Bounds on Linear Programs. SEA (2009)
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)
Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach
Superposition Modulo Linear Arithmetic SUP(LA). FroCoS (2009)
Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert
Integer Linear Programming in Computational Biology. Efficient Algorithms (2009)
Anke Meyer-Bäse, Susanne Cappendijk, Ernst Althaus
Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli. BIOCOMP (2009)
Anke Meyer-Bäse, Susanne Cappendijk, Ernst Althaus
Global uniform stability analysis of biological networks with different time-scales under perturbations. IJCNN (2009)
Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre
Approximating the Interval Constrained Coloring Problem. SWAT (2008)
Ernst Althaus, Stefan Canzar, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-Bäse, Huimin Zhang
Computing H/D-exchange speeds of single residues from data of peptic fragments. SAC (2008)
Ernst Althaus, Stefan Canzar
A Lagrangian relaxation approach for the multiple sequence alignment problem. J. Comb. Optim. 16 (2) (2008)
Ernst Althaus, Stefan Canzar
LASA: A Tool for Non-heuristic Alignment of Multiple Sequences. BIRD (2008)
Ernst Althaus, Rouven Naujoks
Reconstructing Phylogenetic Networks with One Recombination. WEA (2008)
Ernst Althaus, Stefan Canzar
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem. COCOA (2007)
Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth
Trunk Packing Revisited. WEA (2007)
Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
A branch-and-cut algorithm for multiple sequence alignment. Math. Program. 105 (2-3) (2006)
Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky
Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. Wirel. Networks 12 (3) (2006)
Ernst Althaus, Rouven Naujoks
Computing steiner minimum trees in Hamming metric. SODA (2006)
Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
-hop minimum-spanning trees. Oper. Res. Lett. 33 (2) (2005)
Ernst Althaus, Nikiforos Karamanis, Alexander Koller
Computing Locally Coherent Discourses. ACL (2004)
Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn
Point containment in the integer hull of a polyhedron. SODA (2004)
Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
An efficient graph algorithm for dominance constraints. J. Algorithms 48 (1) (2003)
Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky
Power efficient range assignment in ad-hoc wireless networks. WCNC (2003)
Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
Improving Linear Programming Approaches for the Steiner Tree Problem. WEA (2003)
Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller
A Combinatorial Approach to Protein Docking with Flexible Side Chains. J. Comput. Biol. 9 (4) (2002)
Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. ECCB (2002)
Ernst Althaus, Christian Fink
A Polyhedral Approach to Surface Reconstruction from Planar Contours. IPCO (2002)
Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
SCIL - Symbolic Constraints in Integer Linear Programming. ESA (2002)
Ernst Althaus, Kurt Mehlhorn
Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM J. Comput. 31 (1) (2001)
Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
An efficient algorithm for the configuration problem of dominance graphs. SODA (2001)
Ernst Althaus, Kurt Mehlhorn
TSP-based curve reconstruction in polynomial time. SODA (2000)
Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller
A combinatorial approach to protein docking with flexible side-chains. RECOMB (2000)
Ernst Althaus, Kurt Mehlhorn
Maximum Network Flow with Floating Point Arithmetic. Inf. Process. Lett. 66 (3) (1998)

Ernst Althaus.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ernst Althaus