Ernst Althaus

According to our database, Ernst Althaus authored at least 62 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

A Random Walk Approach to Broadcasting on Random Recursive Trees.

Ernst Althaus, Lisa Hartung, Rebecca Steiner

CoRR, 2024

Reducing Treewidth for SAT-Related Problems Using Simple Liftings.

Ernst Althaus, Daniela Schnurbusch

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

Differentially Private Sum-Product Networks.

Xenia Heilmann, Mattia Cerrato, Ernst Althaus

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves.

Ernst Althaus, Benjamin Merlin Bumpus, James P. Fairbanks, Daniel Rosiak

CoRR, 2023

Privacy-Preserving Learning of Random Forests Without Revealing the Trees.

Lukas-Malte Bammert, Stefan Kramer, Mattia Cerrato, Ernst Althaus

Proceedings of the Discovery Science - 26th International Conference, 2023

2022

On the Optimality of the Greedy Garbage Collection Strategy for SSDs.

Ernst Althaus, Petra Berenbrink, André Brinkmann, Rebecca Steiner

Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Privacy Preserving Queries of Shortest Path Distances.

Ernst Althaus, Stefan Funke, Moritz Schrauth

Proceedings of the Algorithmic Aspects of Cloud Computing - 7th International Symposium, 2022

2021

Fast Private Parameter Learning and Evaluation for Sum-Product Networks.

Ernst Althaus, Mohammad Sadeq Dousti, Stefan Kramer

CoRR, 2021

On Tamaki's Algorithm to Compute Treewidths.

Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, Sarah Ziegler

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

Most Diverse Near-Shortest Paths.

Christian Häcker, Panagiotis Bouros, Theodoros Chondrogiannis, Ernst Althaus

Proceedings of the SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, 2021

Privately Querying Privacy: Privacy Estimation with Guaranteed Privacy of User and Database Party.

Anna Katharina Hildebrandt, Ernst Althaus, Andreas Hildebrandt

Proceedings of the Algorithmic Aspects of Cloud Computing - 6th International Symposium, 2021

Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars.

Ernst Althaus, Andreas Hildebrandt, Domenico Mosca

Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

2020

Computing Euclidean Steiner trees over segments.

Ernst Althaus, Felix Rauterberg, Sarah Ziegler

EURO J. Comput. Optim., 2020

2019

Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm.

Ernst Althaus, Sarah Ziegler

CoRR, 2019

2018

Scheduling shared continuous resources on many-cores.

Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß

J. Sched., 2018

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, Uwe Waldmann, Boris Wirtz

Sci. Comput. Program., 2017

Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness.

Ernst Althaus, Andreas Hildebrandt, Domenico Mosca

Proceedings of the Software Technologies: Applications and Foundations, 2017

2015

Improving Interpolants for Linear Arithmetic.

Ernst Althaus, Björn Beber, Joschka Kupilas, Christoph Scholl

Proceedings of the Automated Technology for Verification and Analysis, 2015

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

J. Comput. Chem., 2014

Simple interpolants for linear arithmetic.

Christoph Scholl, Florian Pigorsch, Stefan Disch, Ernst Althaus

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2014

Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem.

Ernst Althaus, Markus Blumenstock, Alexej Disterhoft, Andreas Hildebrandt, Markus Krupp

Proceedings of the Combinatorial Optimization and Applications, 2014

A Greedy Algorithm for Hierarchical Complete Linkage Clustering.

Ernst Althaus, Andreas Hildebrandt, Anna Katharina Hildebrandt

Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2013

On the low-dimensional Steiner minimum tree problem in Hamming metric.

Ernst Althaus, Joschka Kupilas, Rouven Naujoks

Theor. Comput. Sci., 2013

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

Proceedings of the German Conference on Bioinformatics 2013, 2013

2012

Certifying feasibility and objective value of linear programs.

Ernst Althaus, Daniel Dumitriu

Oper. Res. Lett., 2012

2011

Approximation Algorithms for the Interval Constrained Coloring Problem.

Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre

Algorithmica, 2011

A Column Generation Approach to Scheduling of Periodic Tasks.

Ernst Althaus, Rouven Naujoks, Eike Thaden

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Precise and efficient parametric path analysis.

Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks

Proceedings of the ACM SIGPLAN/SIGBED 2011 conference on Languages, 2011

Symbolic Worst Case Execution Times.

Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks

Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Integration of an LP Solver into Interval Constraint Propagation.

Ernst Althaus, Bernd Becker, Daniel Dumitriu, Stefan Kupferschmid

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Fully Automatic Trunk Packing with Free Placements

Ernst Althaus, Peter Hachenberger

CoRR, 2010

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

2009

Fast and Accurate Bounds on Linear Programs.

Ernst Althaus, Daniel Dumitriu

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Global uniform stability analysis of biological networks with different time-scales under perturbations.

Anke Meyer-Bäse, Susanne Cappendijk, Ernst Althaus

Proceedings of the International Joint Conference on Neural Networks, 2009

Superposition Modulo Linear Arithmetic SUP(LA).

Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach

Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Integer Linear Programming in Computational Biology.

Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert

Proceedings of the Efficient Algorithms, 2009

Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli.

Anke Meyer-Bäse, Susanne Cappendijk, Ernst Althaus

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

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

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

2008

A Lagrangian relaxation approach for the multiple sequence alignment problem.

Ernst Althaus, Stefan Canzar

J. Comb. Optim., 2008

Reconstructing Phylogenetic Networks with One Recombination.

Ernst Althaus, Rouven Naujoks

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Approximating the Interval Constrained Coloring Problem.

Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre

Proceedings of the Algorithm Theory, 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

Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

LASA: A Tool for Non-heuristic Alignment of Multiple Sequences.

Ernst Althaus, Stefan Canzar

Proceedings of the Bioinformatics Research and Development, 2008

2007

Trunk Packing Revisited.

Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

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

A branch-and-cut algorithm for multiple sequence alignment.

Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert

Math. Program., 2006

Computing steiner minimum trees in Hamming metric.

Ernst Althaus, Rouven Naujoks

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Approximating <i>k</i>-hop minimum-spanning trees.

Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella

Oper. Res. Lett., 2005

2004

Point containment in the integer hull of a polyhedron.

Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Computing Locally Coherent Discourses.

Ernst Althaus, Nikiforos Karamanis, Alexander Koller

Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, 2004

2003

An efficient graph algorithm for dominance constraints.

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel

J. Algorithms, 2003

Improving Linear Programming Approaches for the Steiner Tree Problem.

Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Power efficient range assignment in ad-hoc wireless networks.

Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky

Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

2002

A Combinatorial Approach to Protein Docking with Flexible Side Chains.

Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller

J. Comput. Biol., 2002

A Polyhedral Approach to Surface Reconstruction from Planar Contours.

Ernst Althaus, Christian Fink

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

SCIL - Symbolic Constraints in Integer Linear Programming.

Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn

Proceedings of the Algorithms, 2002

Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.

Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert

Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

2001

Traveling Salesman-Based Curve Reconstruction in Polynomial Time.

Ernst Althaus, Kurt Mehlhorn

SIAM J. Comput., 2001

An efficient algorithm for the configuration problem of dominance graphs.

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Curve reconstruction and the traveling salesman problem.

Ernst Althaus

PhD thesis, 2000

TSP-based curve reconstruction in polynomial time.

Ernst Althaus, Kurt Mehlhorn

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998

Maximum Network Flow with Floating Point Arithmetic.

Ernst Althaus, Kurt Mehlhorn

Inf. Process. Lett., 1998