default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Bockmayr
Person information
- affiliation: Free University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j31]Kerian Thuillier
, Caroline Baroukh, Alexander Bockmayr, Ludovic Cottret, Loïc Paulevé, Anne Siegel:
MERRIN: MEtabolic regulation rule INference from time series data. Bioinform. 38(Supplement_2): ii127-ii133 (2022)- 2021
- [c38]Kerian Thuillier, Caroline Baroukh, Alexander Bockmayr, Ludovic Cottret, Loïc Paulevé, Anne Siegel:
Learning Boolean Controls in Regulated Metabolic Networks: A Case-Study. CMSB 2021: 159-180
2010 – 2019
- 2019
- [j30]Annika Röhl, Tanguy Riou, Alexander Bockmayr:
Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection. Bioinform. 35(15): 2618-2625 (2019) - [c37]Lin Liu, Alexander Bockmayr:
Hybrid Modeling of Metabolic-Regulatory Networks (Extended Abstract). HSB 2019: 177-180 - 2018
- [j29]Hannes Klarner, Alexander Bockmayr, Heike Siebert:
Erratum to: Computing maximal and minimal trap spaces of Boolean networks. Nat. Comput. 17(2): 437 (2018) - 2017
- [j28]Annika Röhl, Alexander Bockmayr:
A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks. BMC Bioinform. 18(1): 2:1-2:10 (2017) - 2015
- [j27]Yaron A. B. Goldstein, Alexander Bockmayr:
Double and multiple knockout simulations for genome-scale metabolic network reconstructions. Algorithms Mol. Biol. 10: 1 (2015) - [j26]Hannes Klarner, Alexander Bockmayr, Heike Siebert:
Computing maximal and minimal trap spaces of Boolean networks. Nat. Comput. 14(4): 535-544 (2015) - 2014
- [j25]László Dávid, Alexander Bockmayr:
Computing Elementary Flux Modes Involving a Set of Target Reactions. IEEE ACM Trans. Comput. Biol. Bioinform. 11(6): 1099-1107 (2014) - [c36]Hannes Klarner, Alexander Bockmayr, Heike Siebert:
Computing Symbolic Steady States of Boolean Networks. ACRI 2014: 561-570 - 2013
- [j24]Arne C. Müller, Alexander Bockmayr:
Fast thermodynamically constrained flux variability analysis. Bioinform. 29(7): 903-909 (2013) - [j23]Shahrad Jamshidi, Heike Siebert, Alexander Bockmayr:
Preservation of dynamic properties in qualitative modeling frameworks for gene regulatory networks. Biosyst. 112(2): 171-179 (2013) - [c35]Alexander Bockmayr, Heike Siebert:
Bio-Logics: Logical Analysis of Bioregulatory Networks. Programming Logics 2013: 19-34 - [c34]Yaron A. B. Goldstein, Alexander Bockmayr:
A Lattice-Theoretic Framework for Metabolic Pathway Analysis. CMSB 2013: 178-191 - 2012
- [j22]Sayed-Amir Marashi, László Dávid, Alexander Bockmayr:
Analysis of Metabolic Subnetworks by Flux Cone Projection. Algorithms Mol. Biol. 7: 17 (2012) - [j21]Abdelhalim Larhlimi, László Dávid, Joachim Selbig, Alexander Bockmayr:
F2C2: a fast tool for the computation of flux coupling in genome-scale metabolic networks. BMC Bioinform. 13: 57 (2012) - [j20]Hannes Klarner, Heike Siebert, Alexander Bockmayr:
Time Series Dependent Analysis of Unparametrized Thomas Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 9(5): 1338-1351 (2012) - [c33]Shahrad Jamshidi, Heike Siebert, Alexander Bockmayr:
Comparing Discrete and Piecewise Affine Differential Equation Models of Gene Regulatory Networks. IPCAT 2012: 17-24 - 2011
- [j19]Alberto Rezola, Luis F. de Figueiredo, Matthias Brock, Jon Pey, Adam Podhorski, Christoph Wittmann, Stefan Schuster, Alexander Bockmayr, Francisco J. Planes:
Exploring metabolic pathways in genome-scale networks via generating flux modes. Bioinform. 27(4): 534-540 (2011) - [j18]Sayed-Amir Marashi, Alexander Bockmayr:
Flux coupling analysis of metabolic networks is sensitive to missing reactions. Biosyst. 103(1): 57-66 (2011) - [j17]László Dávid, Sayed-Amir Marashi, Abdelhalim Larhlimi, Bettina Mieth, Alexander Bockmayr:
FFCA: a feasibility-based method for flux coupling analysis of metabolic networks. BMC Bioinform. 12: 236 (2011) - [c32]Hannes Klarner, Heike Siebert, Alexander Bockmayr:
Parameter inference for asynchronous logical networks using discrete time series. CMSB 2011: 121-130 - 2010
- [c31]Alexander Bockmayr:
Constraint-Based Modeling in Systems Biology. WCB@ICLP 2010: 1 - [c30]Corinna Heldt, Alexander Bockmayr:
Geometric Constraints for the Phase Problem in X-Ray Crystallography. WCB@ICLP 2010: 20-26
2000 – 2009
- 2009
- [j16]Abdelhalim Larhlimi, Alexander Bockmayr:
A new constraint-based description of the steady-state flux cone of metabolic networks. Discret. Appl. Math. 157(10): 2257-2266 (2009) - [c29]Alexander Bockmayr:
Logic-Based Modeling in Systems Biology. LPNMR 2009: 2 - 2008
- [j15]Heike Siebert, Alexander Bockmayr:
Temporal constraints in the logical analysis of regulatory networks. Theor. Comput. Sci. 391(3): 258-275 (2008) - [c28]Abdelhalim Larhlimi, Alexander Bockmayr:
On Inner and Outer Descriptions of the Steady-State Flux Cone of a Metabolic Network. CMSB 2008: 308-327 - 2007
- [c27]Heike Siebert, Alexander Bockmayr:
Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks. AB 2007: 36-50 - [c26]Heike Siebert, Alexander Bockmayr:
Context Sensitivity in Logical Modeling with Time Delays. CMSB 2007: 64-79 - 2006
- [j14]Alexander Bockmayr, Nicolai Pisaruk:
Detecting infeasibility and generating cuts for mixed integer programming using constraint programming. Comput. Oper. Res. 33(10): 2777-2786 (2006) - [c25]Heike Siebert, Alexander Bockmayr:
Incorporating Time Delays into the Logical Analysis of Gene Regulatory Networks. CMSB 2006: 169-183 - [c24]Abdelhalim Larhlimi, Alexander Bockmayr:
A New Approach to Flux Coupling Analysis of Metabolic Networks. CompLife 2006: 205-215 - 2004
- [j13]Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey:
On unions and dominants of polytopes. Math. Program. 99(2): 223-239 (2004) - [j12]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) - [c23]Alexander Bockmayr, Arnaud Courtois, Damien Eveillard, M. Vezain:
Building and Analysing an Integrative Model of HIV-1 RNA Alternative Splicing. CMSB 2004: 43-57 - 2003
- [c22]Damien Eveillard, Delphine Ropers, Hidde de Jong, Christiane Branlant, Alexander Bockmayr:
Multiscale Modeling of Alternative Splicing Regulation. CMSB 2003: 75-87 - [c21]Alexander Bockmayr:
Constraint Programming in Computational Molecular Biology. EPIA 2003: 1 - 2002
- [c20]Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87 - [c19]Alexander Bockmayr, Arnaud Courtois:
Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems. ICLP 2002: 85-99 - [c18]Alexander Bockmayr, Arnaud Courtois:
Modélisation de systèmes biologiques en programmation concurrente par contraintes hybrides. JFPLC 2002: 167- - 2001
- [j11]Alexander Bockmayr, Friedrich Eisenbrand:
Cutting Planes and the Elementary Closure in Fixed Dimension. Math. Oper. Res. 26(2): 304-312 (2001) - [c17]Alexander Bockmayr, Nicolai Pisaruk, Abderrahmane Aggoun:
Network Flow Problems in Constraint Programming. CP 2001: 196-210 - [p1]Alexander Bockmayr, Volker Weispfenning:
Solving Numerical Constraints. Handbook of Automated Reasoning 2001: 751-842 - [i1]Alexander Bockmayr, Nicolai Pisaruk:
Solving Assembly Line Balancing Problems by Combining IP and CP. CoRR cs.DM/0106002 (2001) - 2000
- [c16]Alexander Bockmayr, Friedrich Eisenbrand:
Combining Logic and Optimization in Cutting Plane Theory. FroCoS 2000: 1-17
1990 – 1999
- 1999
- [j10]Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz:
On the Chvátal Rank of Polytopes in the 0/1 Cube. Discret. Appl. Math. 98(1-2): 21-27 (1999) - [c15]Alexander Bockmayr, Yannis Dimopoulos:
Integer Programs and Valid Inequalities for Planning Problems. ECP 1999: 239-251 - [c14]Alexander Bockmayr, Thomas Kasper:
Branch-and-Infer: an Unifying Framework for Integer Linear Programming and Finite Domain Constraint Programming. JFPLC 1999: 141-142 - 1998
- [j9]Peter Barth, Alexander Bockmayr:
Modelling discrete optimisation problems inconstraint logic programming. Ann. Oper. Res. 81: 467-496 (1998) - [j8]Alexander Bockmayr, Thomas Kasper:
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming. INFORMS J. Comput. 10(3): 287-300 (1998) - [j7]Andreas Werner, Alexander Bockmayr, Stefan Krischer:
How to Realize LSE Narrowing. New Gener. Comput. 16(4): 397-434 (1998) - 1995
- [j6]Alexander Bockmayr, Stefan Krischer, Andreas Werner:
Narrowing Strategies for Arbitrary Canonical Rewrite Systems. Fundam. Informaticae 24(1/2): 125-155 (1995) - [c13]Peter Barth, Alexander Bockmayr:
Finite Domain and Cutting Plane Techniques in CLP(PB). ICLP 1995: 133-147 - 1994
- [c12]Andreas Werner, Alexander Bockmayr, Stefan Krischer:
How to Realize LSE Narrowing. ALP 1994: 59-76 - [c11]Alexander Bockmayr, Andreas Werner:
LSE Narrowing for Decreasing Conditional Term Rewrite Systems. CTRS 1994: 51-70 - [c10]Peter Barth, Alexander Bockmayr:
Global Consistency in CLP(PB). WLP 1994: 130-133 - [c9]Alexander Bockmayr:
Solving Pseudo-Boolean Constraints. Constraint Programming 1994: 22-38 - 1993
- [j5]Alexander Bockmayr:
Conditional Narrowing Modulo a Set of Equations. Appl. Algebra Eng. Commun. Comput. 4: 147-168 (1993) - [c8]Alexander Bockmayr, Franz Josef Radermacher:
Künstliche Intelligenz und Operations Research. KI 1993: 249-254 - [c7]Andreas Werner, Alexander Bockmayr, Stefan Krischer:
A Concept for the Implementation of LSE Narrowing. WLP 1993: 104-107 - 1992
- [c6]Alexander Bockmayr, Stefan Krischer, Andreas Werner:
An Optimal Narrowing Strategy for General Canonical Systems. CTRS 1992: 483-497 - 1991
- [j4]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) - [c5]Stefan Krischer, Alexander Bockmayr:
Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test. RTA 1991: 74-85 - [c4]Alexander Bockmayr:
Logic Programming with Pseudo-Boolean Constraints. WCLP 1991: 327-350 - 1990
- [b1]Alexander Bockmayr:
Beiträge zur Theorie des logisch-funktionalen Programmierens. Karlsruhe Institute of Technology, Germany, 1990, pp. 1-127 - [c3]Alexander Bockmayr:
Algebraic and Logic Aspects of Unification. IWWERT 1990: 171-180 - [c2]Alexander Bockmayr:
Model-Theoretic Aspects of Unification. IWWERT 1990: 181-196
1980 – 1989
- 1989
- [j3]Alexander Bockmayr, Christoph Brzoska:
Bericht über den Workshop TEGA - Terersetzung: Grundlagen und Anwendung. Künstliche Intell. 3(3): 17-19 (1989) - [j2]Alexander Bockmayr, Klaus Estenfeld, Ulrich Furbach, Claus Jäkel:
Ein Konstanzer Prolog-Workshop. Künstliche Intell. 3(4): 15 (1989) - 1988
- [c1]Alexander Bockmayr:
Narrowing with Built-In Theories. ALP 1988: 83-92 - 1987
- [j1]Alexander Bockmayr:
A Note on a Canonical Theory with Undecidable Unification and Matching Problem. J. Autom. Reason. 3(4): 379-381 (1987)
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-04-03 01:23 CEST 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:
