An efficient scaling procedure for gain networks. - Klaus Truemper (Networks, 1976)

Unimodular matrices of flow problems with additional constraints. - Klaus Truemper (Networks, 1977)

Optimal flows in nonlinear gain networks. - Klaus Truemper (Networks, 1978)

Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks. - Klaus Truemper; Y. Soun (Math. Oper. Res., 1979)

On Whitney's 2-isomorphism theorem for graphs. - Klaus Truemper (J. Graph Theory, 1980)

Single Commodity Representation of Multicommodity Networks. - Y. Soun; Klaus Truemper (SIAM J. Algebraic Discret. Methods, 1980)

Polynomial algorithms for a class of linear programs. - Jean François Maurras; Klaus Truemper; M. Akgül (Math. Program., 1981)

On the Efficiency of Representability Tests for Matroids. - Klaus Truemper (Eur. J. Comb., 1982)

Alpha-balanced graphs and matrices and GF(3)-representability of matroids. - Klaus Truemper (J. Comb. Theory B, 1982)

Partial Matroid Representations. - Klaus Truemper (Eur. J. Comb., 1984)

A decomposition theory for matroids. I. General results. - Klaus Truemper (J. Comb. Theory B, 1985)

A decomposition theory for matroids. II. Minimal violation matroids. - Klaus Truemper (J. Comb. Theory B, 1985)

A decomposition of the matroids with the max-flow min-cut property. - Fan T. Tseng; Klaus Truemper (Discret. Appl. Math., 1986)

A decomposition theory for matroids III. Decomposition conditions. - Klaus Truemper (J. Comb. Theory B, 1986)

On matroid separations of graphs. - Klaus Truemper (J. Graph Theory, 1987)

Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes. - Klaus Truemper (Math. Oper. Res., 1987)

Addendum. - Fan T. Tseng; Klaus Truemper (Discret. Appl. Math., 1988)

A decomposition theory for matroids IV. Decomposition of graphs. - Klaus Truemper (J. Comb. Theory B, 1988)

Decomposition and optimization over cycles in binary matroids. - Martin Grötschel; Klaus Truemper (J. Comb. Theory B, 1989)

On the delta-wye reduction for planar graphs. - Klaus Truemper (J. Graph Theory, 1989)

A decomposition theory for matroids. V. Testing of matrix total unimodularity. - Klaus Truemper (J. Comb. Theory B, 1990)

Matroid decomposition. - Klaus Truemper (Academic Press, 1992)

A decomposition theory for matroids. VI. Almost regular matroids. - Klaus Truemper (J. Comb. Theory B, 1992)

A decomposition theory for matroids. VII. Analysis of minimal violation matrices. - Klaus Truemper (J. Comb. Theory B, 1992)

From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. - Michele Conforti; Gérard Cornuéjols; Klaus Truemper (Math. Oper. Res., 1994)

FasTraC: A Decentralized Traffic Control System Based on Logic Programming. - Giovanni Felici; Giovanni Rinaldi; Klaus Truemper (CADE, 1996)

A Petersen on a Pentagon. - Paul D. Seymour; Klaus Truemper (J. Comb. Theory B, 1998)

A Method for Controlling Errors in Two-Class Classification. - Giovanni Felici; Fushing Sun; Klaus Truemper (COMPSAC, 1999)

Effective Spell Checking by Learning User Behavior. - Y. Zhao; Klaus Truemper (Appl. Artif. Intell., 1999)

Learning to Ask Relevant Questions. - Janell Straach; Klaus Truemper (Artif. Intell., 1999)

Application of a New Logic Domain Method for the Diagnosis of Hepatocellular Carcinoma. - Paola Di Giacomo; Giovanni Felici; Riccardo Maceratini; Klaus Truemper (MedInfo, 2001)

A MINSAT Approach for Learning in Logic Domains. - Giovanni Felici; Klaus Truemper (INFORMS J. Comput., 2002)

Learning in a Compiler for MINSAT Algorithms. - Anja Remshagen; Klaus Truemper (Theory Pract. Log. Program., 2003)

An Effective QBF Solver for Planning Problems. - Charles Otwell; Anja Remshagen; Klaus Truemper (MSV/AMCS, 2004)

An Effective Algorithm for the Futile Questioning Problem. - Anja Remshagen; Klaus Truemper (J. Autom. Reason., 2005)

The Complexity of Futile Questioning. - Anja Remshagen; Klaus Truemper (FCS, 2007)

An Alternative Representation for QBF. - Anja Remshagen; Klaus Truemper (IC-AI, 2009)

Discretization of Target Attributes for Subgroup Discovery. - Katherine Moreland; Klaus Truemper (MLDM, 2009)

The Needles-in-Haystack Problem. - Katherine Moreland; Klaus Truemper (MLDM, 2009)

Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization. - Klaus Truemper (MLDM, 2009)

Logic Integer Programming Models for Signaling Networks. - Utz-Uwe Haus; Kathrin Niermann; Klaus Truemper; Robert Weismantel (J. Comput. Biol., 2009)

Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks. - Utz-Uwe Haus; Klaus Truemper; Robert Weismantel (J. Satisf. Boolean Model. Comput., 2009)

Implementation of a unimodularity test. - Matthias Walter; Klaus Truemper (Math. Program. Comput., 2013)