default search action
Klaus Truemper
Person information
- affiliation: University of Texas at Dallas, Richardson, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j33]Matthias Walter
, Klaus Truemper:
Implementation of a unimodularity test. Math. Program. Comput. 5(1): 57-73 (2013) - 2012
- [i2]Matthias Walter, Klaus Truemper:
Implementation of a Unimodularity Test. CoRR abs/1202.4061 (2012)
2000 – 2009
- 2009
- [j32]Utz-Uwe Haus, Kathrin Niermann, Klaus Truemper, Robert Weismantel:
Logic Integer Programming Models for Signaling Networks. J. Comput. Biol. 16(5): 725-743 (2009) - [j31]Utz-Uwe Haus, Klaus Truemper, Robert Weismantel:
Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks. J. Satisf. Boolean Model. Comput. 6(1-3): 13-32 (2009) - [c9]Anja Remshagen, Klaus Truemper:
An Alternative Representation for QBF. IC-AI 2009: 531-536 - [c8]Klaus Truemper:
Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization. MLDM 2009: 1-15 - [c7]Katherine Moreland, Klaus Truemper:
Discretization of Target Attributes for Subgroup Discovery. MLDM 2009: 44-52 - [c6]Katherine Moreland, Klaus Truemper:
The Needles-in-Haystack Problem. MLDM 2009: 516-524 - 2007
- [c5]Anja Remshagen, Klaus Truemper:
The Complexity of Futile Questioning. FCS 2007: 132-138 - 2005
- [j30]Anja Remshagen, Klaus Truemper:
An Effective Algorithm for the Futile Questioning Problem. J. Autom. Reason. 34(1): 31-47 (2005) - 2004
- [c4]Charles Otwell, Anja Remshagen, Klaus Truemper:
An Effective QBF Solver for Planning Problems. MSV/AMCS 2004: 311-316 - 2003
- [j29]Anja Remshagen, Klaus Truemper:
Learning in a Compiler for MINSAT Algorithms. Theory Pract. Log. Program. 3(3): 271-286 (2003) - [i1]Anja Remshagen, Klaus Truemper:
Learning in a Compiler for MINSAT Algorithms. CoRR cs.LO/0312032 (2003) - 2002
- [j28]Giovanni Felici
A MINSAT Approach for Learning in Logic Domains. INFORMS J. Comput. 14(1): 20-36 (2002) - 2001
- [c3]Paola Di Giacomo, Giovanni Felici, Riccardo Maceratini, Klaus Truemper:
Application of a New Logic Domain Method for the Diagnosis of Hepatocellular Carcinoma. MedInfo 2001: 434-438
1990 – 1999
- 1999
- [j27]Y. Zhao, Klaus Truemper:
Effective Spell Checking by Learning User Behavior. Appl. Artif. Intell. 13(8): 725-742 (1999) - [j26]Janell Straach, Klaus Truemper:
Learning to Ask Relevant Questions. Artif. Intell. 111(1-2): 301-327 (1999) - [c2]Giovanni Felici, Fushing Sun, Klaus Truemper:
A Method for Controlling Errors in Two-Class Classification. COMPSAC 1999: 186-191 - 1998
- [j25]Paul D. Seymour
A Petersen on a Pentagon. J. Comb. Theory B 72(1): 63-79 (1998) - 1996
- [c1]Giovanni Felici, Giovanni Rinaldi, Klaus Truemper:
FasTraC: A Decentralized Traffic Control System Based on Logic Programming. CADE 1996: 216-220 - 1994
- [j24]Michele Conforti, Gérard Cornuéjols, Klaus Truemper:
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. Math. Oper. Res. 19(1): 21-23 (1994) - 1992
- [b1]Klaus Truemper:
Matroid decomposition. Academic Press 1992, ISBN 978-0-12-701225-4, pp. I-X, 1-398 - [j23]Klaus Truemper:
A decomposition theory for matroids. VI. Almost regular matroids. J. Comb. Theory B 55(2): 253-301 (1992) - [j22]Klaus Truemper:
A decomposition theory for matroids. VII. Analysis of minimal violation matrices. J. Comb. Theory B 55(2): 302-335 (1992) - 1990
- [j21]Klaus Truemper:
A decomposition theory for matroids. V. Testing of matrix total unimodularity. J. Comb. Theory B 49(2): 241-281 (1990)
1980 – 1989
- 1989
- [j20]Martin Grötschel, Klaus Truemper:
Decomposition and optimization over cycles in binary matroids. J. Comb. Theory B 46(3): 306-337 (1989) - [j19]Klaus Truemper:
On the delta-wye reduction for planar graphs. J. Graph Theory 13(2): 141-148 (1989) - 1988
- [j18]Fan T. Tseng, Klaus Truemper:
Addendum. Discret. Appl. Math. 20(1): 87-88 (1988) - [j17]Klaus Truemper:
A decomposition theory for matroids IV. Decomposition of graphs. J. Comb. Theory B 45(3): 259-292 (1988) - 1987
- [j16]Klaus Truemper:
On matroid separations of graphs. J. Graph Theory 11(4): 531-536 (1987) - [j15]Klaus Truemper:
Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes. Math. Oper. Res. 12(1): 72-96 (1987) - 1986
- [j14]Fan T. Tseng, Klaus Truemper:
A decomposition of the matroids with the max-flow min-cut property. Discret. Appl. Math. 15(2-3): 329-364 (1986) - [j13]Klaus Truemper:
A decomposition theory for matroids III. Decomposition conditions. J. Comb. Theory B 41(3): 275-305 (1986) - 1985
- [j12]Klaus Truemper:
A decomposition theory for matroids. I. General results. J. Comb. Theory B 39(1): 43-76 (1985) - [j11]Klaus Truemper:
A decomposition theory for matroids. II. Minimal violation matroids. J. Comb. Theory B 39(3): 282-297 (1985) - 1984
- [j10]Klaus Truemper:
Partial Matroid Representations. Eur. J. Comb. 5(4): 377-394 (1984) - 1982
- [j9]Klaus Truemper:
On the Efficiency of Representability Tests for Matroids. Eur. J. Comb. 3(3): 275-291 (1982) - [j8]Klaus Truemper:
Alpha-balanced graphs and matrices and GF(3)-representability of matroids. J. Comb. Theory B 32(2): 112-139 (1982) - 1981
- [j7]Jean François Maurras, Klaus Truemper, M. Akgül:
Polynomial algorithms for a class of linear programs. Math. Program. 21(1): 121-136 (1981) - 1980
- [j6]Klaus Truemper:
On Whitney's 2-isomorphism theorem for graphs. J. Graph Theory 4(1): 43-49 (1980) - [j5]Y. Soun, Klaus Truemper:
Single Commodity Representation of Multicommodity Networks. SIAM J. Algebraic Discret. Methods 1(3): 348-358 (1980)
1970 – 1979
- 1979
- [j4]Klaus Truemper, Y. Soun:
Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks. Math. Oper. Res. 4(4): 379-389 (1979) - 1978
- [j3]Klaus Truemper:
Optimal flows in nonlinear gain networks. Networks 8(1): 17-36 (1978) - 1977
- [j2]Klaus Truemper:
Unimodular matrices of flow problems with additional constraints. Networks 7(4): 343-358 (1977) - 1976
- [j1]Klaus Truemper:
An efficient scaling procedure for gain networks. Networks 6(2): 151-159 (1976)
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 2024-06-10 21:27 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: