default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErnst Althaus
Person information
- affiliation: University of Mainz, Germany
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c43]Xenia Heilmann, Mattia Cerrato, Ernst Althaus:
Differentially Private Sum-Product Networks. ICML 2024- [c42]Ernst Althaus
, Daniela Schnurbusch:
Reducing Treewidth for SAT-Related Problems Using Simple Liftings. ISCO 2024: 175-191 - [i5]Ernst Althaus, Lisa Hartung, Rebecca Steiner:
A Random Walk Approach to Broadcasting on Random Recursive Trees. CoRR abs/2405.04385 (2024) - 2023
- [c41]Lukas-Malte Bammert, Stefan Kramer, Mattia Cerrato, Ernst Althaus:
Privacy-Preserving Learning of Random Forests Without Revealing the Trees. DS 2023: 372-386 - [i4]Ernst Althaus, Benjamin Merlin Bumpus, James P. Fairbanks, Daniel Rosiak:
Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves. CoRR abs/2302.05575 (2023) - 2022
- [c40]Ernst Althaus, Stefan Funke, Moritz Schrauth:
Privacy Preserving Queries of Shortest Path Distances. ALGOCLOUD 2022: 94-101 - [c39]Ernst Althaus, Petra Berenbrink, André Brinkmann, Rebecca Steiner:
On the Optimality of the Greedy Garbage Collection Strategy for SSDs. ICDCS 2022: 78-88 - 2021
- [c38]Ernst Althaus, Andreas Hildebrandt, Domenico Mosca:
Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars. AlCoB 2021: 3-15 - [c37]Anna Katharina Hildebrandt, Ernst Althaus, Andreas Hildebrandt:
Privately Querying Privacy: Privacy Estimation with Guaranteed Privacy of User and Database Party. ALGOCLOUD 2021: 56-72 - [c36]Christian Häcker, Panagiotis Bouros, Theodoros Chondrogiannis, Ernst Althaus:
Most Diverse Near-Shortest Paths. SIGSPATIAL/GIS 2021: 229-239 - [c35]Ernst Althaus, Daniela Schnurbusch, Julian Wüschner, Sarah Ziegler:
On Tamaki's Algorithm to Compute Treewidths. SEA 2021: 9:1-9:18 - [i3]Ernst Althaus, Mohammad Sadeq Dousti, Stefan Kramer:
Fast Private Parameter Learning and Evaluation for Sum-Product Networks. CoRR abs/2104.07353 (2021) - 2020
- [j16]Ernst Althaus, Felix Rauterberg, Sarah Ziegler:
Computing Euclidean Steiner trees over segments. EURO J. Comput. Optim. 8(3): 309-325 (2020)
2010 – 2019
- 2019
- [i2]Ernst Althaus, Sarah Ziegler:
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm. CoRR abs/1912.09144 (2019) - 2018
- [j15]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): 77-92 (2018) - 2017
- [j14]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: 123-160 (2017) - [c34]Ernst Althaus, Andreas Hildebrandt, Domenico Mosca:
Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness. STAF Workshops 2017: 43-59 - 2015
- [c33]Ernst Althaus, Björn Beber, Joschka Kupilas, Christoph Scholl:
Improving Interpolants for Linear Arithmetic. ATVA 2015: 48-63 - 2014
- [j13]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): 765-771 (2014) - [c32]Ernst Althaus, Andreas Hildebrandt, Anna Katharina Hildebrandt:
A Greedy Algorithm for Hierarchical Complete Linkage Clustering. AlCoB 2014: 25-34 - [c31]Ernst Althaus, Markus Blumenstock, Alexej Disterhoft, Andreas Hildebrandt, Markus Krupp:
Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem. COCOA 2014: 268-282 - [c30]Christoph Scholl, Florian Pigorsch, Stefan Disch, Ernst Althaus:
Simple interpolants for linear arithmetic. DATE 2014: 1-6 - 2013
- [j12]Ernst Althaus, Joschka Kupilas, Rouven Naujoks:
On the low-dimensional Steiner minimum tree problem in Hamming metric. Theor. Comput. Sci. 505: 2-10 (2013) - [c29]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: 56-67 - 2012
- [j11]Ernst Althaus, Daniel Dumitriu:
Certifying feasibility and objective value of linear programs. Oper. Res. Lett. 40(4): 292-297 (2012) - 2011
- [j10]Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre:
Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61(2): 342-361 (2011) - [c28]Ernst Althaus, Bernd Becker, Daniel Dumitriu, Stefan Kupferschmid:
Integration of an LP Solver into Interval Constraint Propagation. COCOA 2011: 343-356 - [c27]Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks:
Symbolic Worst Case Execution Times. ICTAC 2011: 25-44 - [c26]Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks:
Precise and efficient parametric path analysis. LCTES 2011: 141-150 - [c25]Ernst Althaus, Joschka Kupilas, Rouven Naujoks:
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric. TAMC 2011: 308-319 - [c24]Ernst Althaus, Rouven Naujoks, Eike Thaden:
A Column Generation Approach to Scheduling of Periodic Tasks. SEA 2011: 340-351 - 2010
- [j9]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: 424 (2010) - [i1]Ernst Althaus, Peter Hachenberger:
Fully Automatic Trunk Packing with Free Placements. CoRR abs/1008.3773 (2010)
2000 – 2009
- 2009
- [c23]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 - [c22]Anke Meyer-Bäse, Susanne Cappendijk, Ernst Althaus:
Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli. BIOCOMP 2009: 510-513 - [c21]Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert:
Integer Linear Programming in Computational Biology. Efficient Algorithms 2009: 199-218 - [c20]Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach:
Superposition Modulo Linear Arithmetic SUP(LA). FroCoS 2009: 84-99 - [c19]Anke Meyer-Bäse, Susanne Cappendijk, Ernst Althaus:
Global uniform stability analysis of biological networks with different time-scales under perturbations. IJCNN 2009: 2098-2102 - [c18]Ernst Althaus, Daniel Dumitriu:
Fast and Accurate Bounds on Linear Programs. SEA 2009: 40-50 - 2008
- [j8]Ernst Althaus, Stefan Canzar:
A Lagrangian relaxation approach for the multiple sequence alignment problem. J. Comb. Optim. 16(2): 127-154 (2008) - [c17]Ernst Althaus, Stefan Canzar:
LASA: A Tool for Non-heuristic Alignment of Multiple Sequences. BIRD 2008: 489-498 - [c16]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: 1273-1277 - [c15]Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre:
Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221 - [c14]Ernst Althaus, Rouven Naujoks:
Reconstructing Phylogenetic Networks with One Recombination. WEA 2008: 275-288 - 2007
- [c13]Ernst Althaus, Stefan Canzar:
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem. COCOA 2007: 267-278 - [c12]Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth:
Trunk Packing Revisited. WEA 2007: 420-432 - 2006
- [j7]Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert:
A branch-and-cut algorithm for multiple sequence alignment. Math. Program. 105(2-3): 387-425 (2006) - [j6]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): 287-299 (2006) - [c11]Ernst Althaus, Rouven Naujoks:
Computing steiner minimum trees in Hamming metric. SODA 2006: 172-181 - 2005
- [j5]Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella:
Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005) - 2004
- [c10]Ernst Althaus, Nikiforos Karamanis, Alexander Koller:
Computing Locally Coherent Discourses. ACL 2004: 399-406 - [c9]Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn:
Point containment in the integer hull of a polyhedron. SODA 2004: 929-933 - 2003
- [j4]Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient graph algorithm for dominance constraints. J. Algorithms 48(1): 194-219 (2003) - [c8]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: 1889-1894 - [c7]Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand:
Improving Linear Programming Approaches for the Steiner Tree Problem. WEA 2003: 1-14 - 2002
- [j3]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): 597-612 (2002) - [c6]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: 4-16 - [c5]Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87 - [c4]Ernst Althaus, Christian Fink:
A Polyhedral Approach to Surface Reconstruction from Planar Contours. IPCO 2002: 258-272 - 2001
- [j2]Ernst Althaus, Kurt Mehlhorn:
Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM J. Comput. 31(1): 27-66 (2001) - [c3]Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient algorithm for the configuration problem of dominance graphs. SODA 2001: 815-824 - 2000
- [b1]Ernst Althaus:
Curve reconstruction and the traveling salesman problem. Saarland University, Saarbrücken, Germany, 2000, pp. 1-104 - [c2]Ernst Althaus, Oliver Kohlbacher, Hans-Peter Lenhof, Peter Müller:
A combinatorial approach to protein docking with flexible side-chains. RECOMB 2000: 15-24 - [c1]Ernst Althaus, Kurt Mehlhorn:
TSP-based curve reconstruction in polynomial time. SODA 2000: 686-695
1990 – 1999
- 1998
- [j1]Ernst Althaus, Kurt Mehlhorn:
Maximum Network Flow with Floating Point Arithmetic. Inf. Process. Lett. 66(3): 109-113 (1998)
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 2025-01-21 00:06 CET 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:
