2008 |
43 | EE | Abdelhalim Larhlimi,
Alexander Bockmayr:
On Inner and Outer Descriptions of the Steady-State Flux Cone of a Metabolic Network.
CMSB 2008: 308-327 |
42 | EE | Heike Siebert,
Alexander Bockmayr:
Temporal constraints in the logical analysis of regulatory networks.
Theor. Comput. Sci. 391(3): 258-275 (2008) |
2007 |
41 | EE | Heike Siebert,
Alexander Bockmayr:
Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks.
AB 2007: 36-50 |
40 | EE | Heike Siebert,
Alexander Bockmayr:
Context Sensitivity in Logical Modeling with Time Delays.
CMSB 2007: 64-79 |
2006 |
39 | EE | Heike Siebert,
Alexander Bockmayr:
Incorporating Time Delays into the Logical Analysis of Gene Regulatory Networks.
CMSB 2006: 169-183 |
38 | EE | Abdelhalim Larhlimi,
Alexander Bockmayr:
A New Approach to Flux Coupling Analysis of Metabolic Networks.
CompLife 2006: 205-215 |
37 | EE | Alexander Bockmayr,
Nicolai Pisaruk:
Detecting infeasibility and generating cuts for mixed integer programming using constraint programming.
Computers & OR 33(10): 2777-2786 (2006) |
2004 |
36 | EE | Alexander Bockmayr,
Arnaud Courtois,
Damien Eveillard,
M. Vezain:
Building and Analysing an Integrative Model of HIV-1 RNA Alternative Splicing.
CMSB 2004: 43-57 |
35 | EE | Egon Balas,
Alexander Bockmayr,
Nicolai Pisaruk,
Laurence A. Wolsey:
On unions and dominants of polytopes.
Math. Program. 99(2): 223-239 (2004) |
34 | EE | Damien Eveillard,
Delphine Ropers,
Hidde de Jong,
Christiane Branlant,
Alexander Bockmayr:
A multi-scale constraint programming model of alternative splicing regulation.
Theor. Comput. Sci. 325(1): 3-24 (2004) |
2003 |
33 | EE | Damien Eveillard,
Delphine Ropers,
Hidde de Jong,
Christiane Branlant,
Alexander Bockmayr:
Multiscale Modeling of Alternative Splicing Regulation.
CMSB 2003: 75-87 |
32 | EE | Alexander Bockmayr:
Constraint Programming in Computational Molecular Biology.
EPIA 2003: 1 |
2002 |
31 | EE | Ernst Althaus,
Alexander Bockmayr,
Matthias Elf,
Michael Jünger,
Thomas Kasper,
Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming.
ESA 2002: 75-87 |
30 | EE | Alexander Bockmayr,
Arnaud Courtois:
Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems.
ICLP 2002: 85-99 |
29 | | Alexander Bockmayr,
Arnaud Courtois:
Modélisation de systèmes biologiques en programmation concurrente par contraintes hybrides.
JFPLC 2002: 167- |
2001 |
28 | EE | Alexander Bockmayr,
Nicolai Pisaruk,
Abderrahmane Aggoun:
Network Flow Problems in Constraint Programming.
CP 2001: 196-210 |
27 | | Alexander Bockmayr,
Volker Weispfenning:
Solving Numerical Constraints.
Handbook of Automated Reasoning 2001: 751-842 |
26 | EE | Alexander Bockmayr,
Nicolai Pisaruk:
Solving Assembly Line Balancing Problems by Combining IP and CP
CoRR cs.DM/0106002: (2001) |
25 | EE | Alexander Bockmayr,
Friedrich Eisenbrand:
Cutting Planes and the Elementary Closure in Fixed Dimension.
Math. Oper. Res. 26(2): 304-312 (2001) |
2000 |
24 | | Alexander Bockmayr,
Friedrich Eisenbrand:
Combining Logic and Optimization in Cutting Plane Theory.
FroCos 2000: 1-17 |
1999 |
23 | | Alexander Bockmayr,
Yannis Dimopoulos:
Integer Programs and Valid Inequalities for Planning Problems.
ECP 1999: 239-251 |
22 | | Alexander Bockmayr,
Thomas Kasper:
Branch-and-Infer: an Unifying Framework for Integer Linear Programming and Finite Domain Constraint Programming.
JFPLC 1999: 141-142 |
21 | EE | Alexander Bockmayr,
Friedrich Eisenbrand,
Mark E. Hartmann,
Andreas S. Schulz:
On the Chvátal Rank of Polytopes in the 0/1 Cube.
Discrete Applied Mathematics 98(1-2): 21-27 (1999) |
1998 |
20 | | Andreas Werner,
Alexander Bockmayr,
Stefan Krischer:
How to Realize LSE Narrowing.
New Generation Comput. 16(4): 397-434 (1998) |
1995 |
19 | | Peter Barth,
Alexander Bockmayr:
Finite Domain and Cutting Plane Techniques in CLP(PB).
ICLP 1995: 133-147 |
18 | | Alexander Bockmayr,
Stefan Krischer,
Andreas Werner:
Narrowing Strategies for Arbitrary Canonical Rewrite Systems.
Fundam. Inform. 24(1/2): 125-155 (1995) |
1994 |
17 | | Andreas Werner,
Alexander Bockmayr,
Stefan Krischer:
How to Realize LSE Narrowing.
ALP 1994: 59-76 |
16 | | Alexander Bockmayr,
Andreas Werner:
LSE Narrowing for Decreasing Conditional Term Rewrite Systems.
CTRS 1994: 51-70 |
15 | | Alexander Bockmayr:
Solving Pseudo-Boolean Constraints
Constraint Programming 1994: 22-38 |
14 | | Peter Barth,
Alexander Bockmayr:
Global Consistency in CLP(PB).
WLP 1994: 130-133 |
1993 |
13 | | Alexander Bockmayr,
Franz Josef Radermacher:
Künstliche Intelligenz und Operations Research.
KI 1993: 249-254 |
12 | | Andreas Werner,
Alexander Bockmayr,
Stefan Krischer:
A Concept for the Implementation of LSE Narrowing.
WLP 1993: 104-107 |
11 | | Alexander Bockmayr:
Conditional Narrowing Modulo of Set of Equations.
Appl. Algebra Eng. Commun. Comput. 4: 147-168 (1993) |
1992 |
10 | | Alexander Bockmayr,
Stefan Krischer,
Andreas Werner:
An Optimal Narrowing Strategy for General Canonical Systems.
CTRS 1992: 483-497 |
1991 |
9 | | Stefan Krischer,
Alexander Bockmayr:
Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test.
RTA 1991: 74-85 |
8 | | Alexander Bockmayr:
Logic Programming with Pseudo-Boolean Constraints.
WCLP 1991: 327-350 |
7 | | Alexander Bockmayr,
Christoph Brzoska,
Peter Deussen,
Igor Varsek:
KA-Prolog: Erweiterungen einer logischen Programmiersprache und ihre effiziente Implementierung.
Inform., Forsch. Entwickl. 6(3): 128-140 (1991) |
1990 |
6 | | Alexander Bockmayr:
Algebraic and Logic Aspects of Unification.
IWWERT 1990: 171-180 |
5 | | Alexander Bockmayr:
Model-Theoretic Aspects of Unification.
IWWERT 1990: 181-196 |
1989 |
4 | | Alexander Bockmayr,
Christoph Brzoska:
Bericht über den Workshop TEGA - Terersetzung: Grundlagen und Anwendung.
KI 3(3): 17-19 (1989) |
3 | | Alexander Bockmayr,
Klaus Estenfeld,
Ulrich Furbach,
Claus Jäkel:
Ein Konstanzer Prolog-Workshop.
KI 3(4): 15 (1989) |
1988 |
2 | | Alexander Bockmayr:
Narrowing with Built-In Theories.
ALP 1988: 83-92 |
1987 |
1 | | Alexander Bockmayr:
A Note on a Canonical Theory with Undecidable Unification and Matching Problem.
J. Autom. Reasoning 3(4): 379-381 (1987) |