Maximum Network Flow with Floating Point Arithmetic. - Ernst Althaus; Kurt Mehlhorn (Inf. Process. Lett., 1998)

TSP-based curve reconstruction in polynomial time. - Ernst Althaus; Kurt Mehlhorn (SODA, 2000)

Curve reconstruction and the traveling salesman problem. - Ernst Althaus (2000)

An efficient algorithm for the configuration problem of dominance graphs. - Ernst Althaus; Denys Duchier; Alexander Koller; Kurt Mehlhorn; Joachim Niehren; Sven Thiel (SODA, 2001)

Traveling Salesman-Based Curve Reconstruction in Polynomial Time. - Ernst Althaus; Kurt Mehlhorn (SIAM J. Comput., 2001)

Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. - Ernst Althaus; Alberto Caprara; Hans-Peter Lenhof; Knut Reinert (ECCB, 2002)

SCIL - Symbolic Constraints in Integer Linear Programming. - Ernst Althaus; Alexander Bockmayr; Matthias Elf; Michael Jünger; Thomas Kasper; Kurt Mehlhorn (ESA, 2002)

A Polyhedral Approach to Surface Reconstruction from Planar Contours. - Ernst Althaus; Christian Fink (IPCO, 2002)

A Combinatorial Approach to Protein Docking with Flexible Side Chains. - Ernst Althaus; Oliver Kohlbacher; Hans-Peter Lenhof; Peter Müller 008 (J. Comput. Biol., 2002)

Power efficient range assignment in ad-hoc wireless networks. - Ernst Althaus; Gruia Calinescu; Ion I. Mandoiu; Sushil K. Prasad; N. Tchervenski; Alexander Zelikovsky (WCNC, 2003)

Improving Linear Programming Approaches for the Steiner Tree Problem. - Ernst Althaus; Tobias Polzin; Siavash Vahdati Daneshmand (WEA, 2003)

An efficient graph algorithm for dominance constraints. - Ernst Althaus; Denys Duchier; Alexander Koller; Kurt Mehlhorn; Joachim Niehren; Sven Thiel (J. Algorithms, 2003)

Computing Locally Coherent Discourses. - Ernst Althaus; Nikiforos Karamanis; Alexander Koller (ACL, 2004)

Point containment in the integer hull of a polyhedron. - Ernst Althaus; Friedrich Eisenbrand; Stefan Funke; Kurt Mehlhorn (SODA, 2004)

Approximating k-hop minimum-spanning trees. - Ernst Althaus; Stefan Funke; Sariel Har-Peled; Jochen Könemann; Edgar A. Ramos; Martin Skutella (Oper. Res. Lett., 2005)

Computing steiner minimum trees in Hamming metric. - Ernst Althaus; Rouven Naujoks (SODA, 2006)

A branch-and-cut algorithm for multiple sequence alignment. - Ernst Althaus; Alberto Caprara; Hans-Peter Lenhof; Knut Reinert (Math. Program., 2006)

Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. - Ernst Althaus; Gruia Calinescu; Ion I. Mandoiu; Sushil K. Prasad; N. Tchervenski; Alexander Zelikovsky (Wirel. Networks, 2006)

Trunk Packing Revisited. - Ernst Althaus; Tobias Baumann; Elmar Schömer; Kai Werth (WEA, 2007)

LASA: A Tool for Non-heuristic Alignment of Multiple Sequences. - Ernst Althaus; Stefan Canzar (BIRD, 2008)

Computing H/D-exchange speeds of single residues from data of peptic fragments. - Ernst Althaus; Stefan Canzar; Mark R. Emmett; Andreas Karrenbauer; Alan G. Marshall; Anke Meyer-Bäse; Huimin Zhang (SAC, 2008)

Approximating the Interval Constrained Coloring Problem. - Ernst Althaus; Stefan Canzar; Khaled M. Elbassioni; Andreas Karrenbauer; Julián Mestre (SWAT, 2008)

Reconstructing Phylogenetic Networks with One Recombination. - Ernst Althaus; Rouven Naujoks (WEA, 2008)

A Lagrangian relaxation approach for the multiple sequence alignment problem. - Ernst Althaus; Stefan Canzar (J. Comb. Optim., 2008)

Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments. - Ernst Althaus; Stefan Canzar; Carsten Ehrler; Mark R. Emmett; Andreas Karrenbauer; Alan G. Marshall; Anke Meyer-Bäse; Jeremiah Tiptopn; Huimin Zhang (BIOCOMP, 2009)

Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli. - Anke Meyer-Bäse; Susanne Cappendijk; Ernst Althaus (BIOCOMP, 2009)

Integer Linear Programming in Computational Biology. - Ernst Althaus; Gunnar W. Klau; Oliver Kohlbacher; Hans-Peter Lenhof; Knut Reinert (Efficient Algorithms, 2009)

Superposition Modulo Linear Arithmetic SUP(LA). - Ernst Althaus; Evgeny Kruglov; Christoph Weidenbach (FroCoS, 2009)

Global uniform stability analysis of biological networks with different time-scales under perturbations. - Anke Meyer-Bäse; Susanne Cappendijk; Ernst Althaus (IJCNN, 2009)

Fast and Accurate Bounds on Linear Programs. - Ernst Althaus; Daniel Dumitriu (SEA, 2009)

Computing H/D-Exchange rates of single residues from data of proteolytic fragments. - Ernst Althaus; Stefan Canzar; Carsten Ehrler; Mark R. Emmett; Andreas Karrenbauer; Alan G. Marshall; Anke Meyer-Bäse; Jeremiah D. Tipton; Huimin Zhang (BMC Bioinform., 2010)

Fully Automatic Trunk Packing with Free Placements - Ernst Althaus; Peter Hachenberger (CoRR, 2010)

Integration of an LP Solver into Interval Constraint Propagation. - Ernst Althaus; Bernd Becker 001; Daniel Dumitriu; Stefan Kupferschmid (COCOA, 2011)

Symbolic Worst Case Execution Times. - Ernst Althaus; Sebastian Altmeyer; Rouven Naujoks (ICTAC, 2011)

Precise and efficient parametric path analysis. - Ernst Althaus; Sebastian Altmeyer; Rouven Naujoks (LCTES, 2011)

A Column Generation Approach to Scheduling of Periodic Tasks. - Ernst Althaus; Rouven Naujoks; Eike Thaden (SEA, 2011)

Approximation Algorithms for the Interval Constrained Coloring Problem. - Ernst Althaus; Stefan Canzar; Khaled M. Elbassioni; Andreas Karrenbauer; Julián Mestre (Algorithmica, 2011)

Certifying feasibility and objective value of linear programs. - Ernst Althaus; Daniel Dumitriu (Oper. Res. Lett., 2012)

Efficient Interpretation of Tandem Mass Tags in Top-Down Proteomics. - Anna Katharina Hildebrandt; Ernst Althaus; Hans-Peter Lenhof; Chien-Wen Hung; Andreas Tholey; Andreas Hildebrandt 001 (GCB, 2013)

On the low-dimensional Steiner minimum tree problem in Hamming metric. - Ernst Althaus; Joschka Kupilas; Rouven Naujoks (Theor. Comput. Sci., 2013)

A Greedy Algorithm for Hierarchical Complete Linkage Clustering. - Ernst Althaus; Andreas Hildebrandt 001; Anna Katharina Hildebrandt (AlCoB, 2014)

Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem. - Ernst Althaus; Markus Blumenstock; Alexej Disterhoft; Andreas Hildebrandt 001; Markus Krupp (COCOA, 2014)

Simple interpolants for linear arithmetic. - Christoph Scholl 001; Florian Pigorsch; Stefan Disch; Ernst Althaus (DATE, 2014)

Efficient computation of root mean square deviations under rigid transformations. - Anna Katharina Hildebrandt; Matthias Dietzen; Thomas Lengauer; Hans-Peter Lenhof; Ernst Althaus; Andreas Hildebrandt 001 (J. Comput. Chem., 2014)

Improving Interpolants for Linear Arithmetic. - Ernst Althaus; Björn Beber; Joschka Kupilas; Christoph Scholl 001 (ATVA, 2015)

Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness. - Ernst Althaus; Andreas Hildebrandt 001; Domenico Mosca (STAF Workshops, 2017)

Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement. - Ernst Althaus; Björn Beber; Werner Damm; Stefan Disch; Willem Hagemann; Astrid Rakow; Christoph Scholl 001; Uwe Waldmann; Boris Wirtz (Sci. Comput. Program., 2017)

Scheduling shared continuous resources on many-cores. - Ernst Althaus; André Brinkmann; Peter Kling; Friedhelm Meyer auf der Heide; Lars Nagel 001; Sören Riechers; Jirí Sgall; Tim Süß (J. Sched., 2018)

Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm. - Ernst Althaus; Sarah Ziegler (CoRR, 2019)

Computing Euclidean Steiner trees over segments. - Ernst Althaus; Felix Rauterberg; Sarah Ziegler (EURO J. Comput. Optim., 2020)

Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars. - Ernst Althaus; Andreas Hildebrandt 001; Domenico Mosca (AlCoB, 2021)

Privately Querying Privacy: Privacy Estimation with Guaranteed Privacy of User and Database Party. - Anna Katharina Hildebrandt; Ernst Althaus; Andreas Hildebrandt 001 (ALGOCLOUD, 2021)

Most Diverse Near-Shortest Paths. - Christian Häcker; Panagiotis Bouros; Theodoros Chondrogiannis; Ernst Althaus (SIGSPATIAL/GIS, 2021)

On Tamaki's Algorithm to Compute Treewidths. - Ernst Althaus; Daniela Schnurbusch; Julian Wüschner; Sarah Ziegler (SEA, 2021)

Fast Private Parameter Learning and Evaluation for Sum-Product Networks. - Ernst Althaus; Mohammad Sadeq Dousti; Stefan Kramer 001 (CoRR, 2021)

Privacy Preserving Queries of Shortest Path Distances. - Ernst Althaus; Stefan Funke; Moritz Schrauth (ALGOCLOUD, 2022)

On the Optimality of the Greedy Garbage Collection Strategy for SSDs. - Ernst Althaus; Petra Berenbrink; André Brinkmann; Rebecca Steiner (ICDCS, 2022)

Privacy-Preserving Learning of Random Forests Without Revealing the Trees. - Lukas-Malte Bammert; Stefan Kramer 001; Mattia Cerrato; Ernst Althaus (DS, 2023)

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves. - Ernst Althaus; Benjamin Merlin Bumpus; James P. Fairbanks; Daniel Rosiak (CoRR, 2023)

Differentially Private Sum-Product Networks. - Xenia Heilmann; Mattia Cerrato; Ernst Althaus (ICML, 2024)

Reducing Treewidth for SAT-Related Problems Using Simple Liftings. - Ernst Althaus; Daniela Schnurbusch (ISCO, 2024)

A Random Walk Approach to Broadcasting on Random Recursive Trees. - Ernst Althaus; Lisa Hartung; Rebecca Steiner (CoRR, 2024)

A New Relaxation for Tree-Based Problems and Minimum Power-Cost Spanning Trees. - Luzie Marianczuk; Ernst Althaus; Stefan Irnich; Marc E. Pfetsch (SEA, 2025)