Klaus Truemper

Affiliations:
  • University of Texas at Dallas, Richardson, TX, USA


According to our database1, Klaus Truemper authored at least 43 papers between 1976 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Implementation of a unimodularity test.
Math. Program. Comput., 2013

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

Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2009

The Needles-in-Haystack Problem.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2009

Discretization of Target Attributes for Subgroup Discovery.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2009

An Alternative Representation for QBF.
Proceedings of the 2009 International Conference on Artificial Intelligence, 2009

2007
The Complexity of Futile Questioning.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

2005
An Effective Algorithm for the Futile Questioning Problem.
J. Autom. Reason., 2005

2004
An Effective QBF Solver for Planning Problems.
Proceedings of the International Conference on Modeling, 2004

2003
Learning in a Compiler for MINSAT Algorithms.
Theory Pract. Log. Program., 2003

2002
A MINSAT Approach for Learning in Logic Domains.
INFORMS J. Comput., 2002

2001
Application of a New Logic Domain Method for the Diagnosis of Hepatocellular Carcinoma.
Proceedings of the MEDINFO 2001, 2001

1999
Learning to Ask Relevant Questions.
Artif. Intell., 1999

Effective Spell Checking by Learning User Behavior.
Appl. Artif. Intell., 1999

A Method for Controlling Errors in Two-Class Classification.
Proceedings of the 23rd International Computer Software and Applications Conference (COMPSAC '99), 1999

1998
A Petersen on a Pentagon.
J. Comb. Theory B, 1998

1996
FasTraC: A Decentralized Traffic Control System Based on Logic Programming.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1994
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes.
Math. Oper. Res., 1994

1992
A decomposition theory for matroids. VII. Analysis of minimal violation matrices.
J. Comb. Theory B, 1992

A decomposition theory for matroids. VI. Almost regular matroids.
J. Comb. Theory B, 1992

Matroid decomposition.
Academic Press, ISBN: 978-0-12-701225-4, 1992

1990
A decomposition theory for matroids. V. Testing of matrix total unimodularity.
J. Comb. Theory B, 1990

1989
On the delta-wye reduction for planar graphs.
J. Graph Theory, 1989

Decomposition and optimization over cycles in binary matroids.
J. Comb. Theory B, 1989

1988
A decomposition theory for matroids IV. Decomposition of graphs.
J. Comb. Theory B, 1988

Addendum.
Discret. Appl. Math., 1988

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

On matroid separations of graphs.
J. Graph Theory, 1987

1986
A decomposition theory for matroids III. Decomposition conditions.
J. Comb. Theory B, 1986

A decomposition of the matroids with the max-flow min-cut property.
Discret. Appl. Math., 1986

1985
A decomposition theory for matroids. II. Minimal violation matroids.
J. Comb. Theory B, 1985

A decomposition theory for matroids. I. General results.
J. Comb. Theory B, 1985

1984
Partial Matroid Representations.
Eur. J. Comb., 1984

1982
Alpha-balanced graphs and matrices and <i>GF</i>(3)-representability of matroids.
J. Comb. Theory B, 1982

On the Efficiency of Representability Tests for Matroids.
Eur. J. Comb., 1982

1981
Polynomial algorithms for a class of linear programs.
Math. Program., 1981

1980
Single Commodity Representation of Multicommodity Networks.
SIAM J. Algebraic Discret. Methods, 1980

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

1979
Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks.
Math. Oper. Res., 1979

1978
Optimal flows in nonlinear gain networks.
Networks, 1978

1977
Unimodular matrices of flow problems with additional constraints.
Networks, 1977

1976
An efficient scaling procedure for gain networks.
Networks, 1976


  Loading...