Utz-Uwe Haus

According to our database1, Utz-Uwe Haus authored at least 26 papers between 2001 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Scenario Aggregation using Binary Decision Diagrams for Stochastic Programs with Endogenous Uncertainty.
CoRR, 2017

Compact representations of all members of an independence system.
Ann. Math. Artif. Intell., 2017

2015
Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems.
Oper. Res. Lett., 2015

Model-Driven Automatic Tiling with Cache Associativity Lattices.
CoRR, 2015

2014
Representations of All Solutions of Boolean Programming Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2013
A polynomial time approximation algorithm for the two-commodity splittable flow problem.
Math. Methods Oper. Res., 2013

2012
Split cuts for robust mixed-integer optimization.
Oper. Res. Lett., 2012

Discovering all associations in discrete data using frequent minimally infrequent attribute sets.
Discret. Appl. Math., 2012

Minimal cut sets in a metabolic network are elementary modes in a dual network.
Bioinform., 2012

Bi-tone and k-tone decompositions of Boolean functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2011
Integrating Signals from the T-Cell Receptor and the Interleukin-2 Receptor.
PLoS Comput. Biol., 2011

Graph problems arising from parameter identification of discrete dynamical systems.
Math. Methods Oper. Res., 2011

2010
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction.
J. Comput. Biol., 2010

Ubiquitous monotone and almost-monotone Boolean functions in systems biology.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2010

2009
Hypergraphs and Cellular Networks.
PLoS Comput. Biol., 2009

Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks.
J. Satisf. Boolean Model. Comput., 2009

Logic Integer Programming Models for Signaling Networks.
J. Comput. Biol., 2009

2008
Computing Knock-Out Strategies in Metabolic Networks.
J. Comput. Biol., 2008

Throughput-Optimal Sequences for Cyclically Operated Plants.
Discret. Event Dyn. Syst., 2008

Global analysis of combined reaction distillation processes.
Comput. Chem. Eng., 2008

2007
A Logical Model Provides Insights into T Cell Receptor Signaling.
PLoS Comput. Biol., 2007

A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization.
Comput. Chem. Eng., 2007

2004
On the Way to Perfection: Primal Operations for Stable Sets in Graphs.
Proceedings of the Sharpest Cut, 2004

2003
A primal all-integer algorithm based on irreducible solutions.
Math. Program., 2003

2002
A Primal Approach to the Stable Set Problem.
Proceedings of the Algorithms, 2002

2001
The integral basis method for integer programming.
Math. Methods Oper. Res., 2001


  Loading...