Peter L. Hammer

From MaRDI portal
Person:188437

Available identifiers

zbMath Open hammer.peter-lWikidataQ431220 ScholiaQ431220MaRDI QIDQ188437

List of research outcomes

PublicationDate of PublicationType
On domination elimination orderings and domination graphs2024-01-05Paper
Distance-Based Classification Methods2023-04-21Paper
A polynomial algorithm for balancing acyclic data flow graphs2018-09-14Paper
https://portal.mardi4nfdi.de/entity/Q34536702015-11-30Paper
Maximum weight archipelago subgraph problem2015-01-22Paper
Logical analysis of data: classification with justification2011-11-17Paper
A new imputation method for incomplete binary data2011-06-28Paper
Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization2011-05-20Paper
Algebraic and topological closure conditions for classes of pseudo-Boolean functions2010-04-28Paper
Using a similarity measure for credible classification2009-06-30Paper
A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)2008-10-29Paper
https://portal.mardi4nfdi.de/entity/Q35157832008-07-29Paper
Approximation of the quadratic set covering problem2008-05-14Paper
Maximum patterns in datasets2008-03-28Paper
Comprehensive vs. comprehensible classifiers in logical analysis of data2008-03-28Paper
https://portal.mardi4nfdi.de/entity/Q34361352007-05-08Paper
Pattern-based feature selection in genomics and proteomics2007-02-05Paper
Logical analysis of data -- an overview: from combinatorial optimization to medical applications2007-02-05Paper
A Boolean measure of similarity2007-01-09Paper
Modeling country risk ratings using partial orders2006-10-27Paper
Spanned patterns for the logical analysis of data2006-04-28Paper
Accelerated algorithm for pattern detection in logical analysis of data2006-04-28Paper
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions2005-11-11Paper
Bisplit graphs2005-10-10Paper
Construction of a Maximum Stable Set with $k$-Extensions2005-06-07Paper
Consensus algorithms for the generation of all maximal bicliques2005-01-31Paper
Pareto-optimal patterns in logical analysis of data2004-11-12Paper
Saturated systems of homogeneous boxes and the logical analysis of numerical data2004-11-12Paper
The maximum box problem and its application to data analysis2004-01-19Paper
Struction revisited2003-12-04Paper
A heuristic for Boolean optimization problems2003-08-28Paper
Coronary risk prediction by logical analysis of data2003-05-11Paper
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions2003-03-10Paper
Maximizing the Product of Two Linear Functions In 0-1 Variables2003-03-04Paper
Disjunctive and conjunctive representations in finite lattices and convexity spaces2002-12-02Paper
Pseudo-Boolean optimization2002-09-17Paper
Dual subimplicants of positive Boolean functions2001-11-16Paper
https://portal.mardi4nfdi.de/entity/Q27415312001-09-24Paper
Disjunctive and conjunctive normal forms of pseudo-Boolean functions2001-07-26Paper
https://portal.mardi4nfdi.de/entity/Q45208212001-02-27Paper
Maximally disjoint solutions of the set covering problem2001-01-01Paper
Combinatorial problems related to origin-destination matrices.2001-01-01Paper
Equational characterizations of Boolean function classes2000-11-07Paper
Convexity and logical analysis of data2000-08-21Paper
Boolean Normal Forms, Shellability, and Reliability Computations2000-07-20Paper
Evaluation, Strength, and Relevance of Variables of Boolean Functions2000-07-20Paper
Optimal compression of propositional Horn knowledge bases: Complexity and approximation2000-04-24Paper
On connected Boolean functions2000-02-14Paper
On the stability number of claw-free \(P_5\)-free and more general graphs1999-09-22Paper
Logical analysis of Chinese labor productivity patterns1999-06-10Paper
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization1999-05-25Paper
Horn functions and submodular Boolean functions1998-07-23Paper
Efficient Methods For Solving Quadratic 0–1 Knapsack Problems1998-06-08Paper
Variable and term removal from Boolean formulae1998-01-26Paper
Polynomial-time inference of all valid implications for Horn and related formulae1997-12-14Paper
On renamable Horn and generalized Horn functions1997-12-14Paper
Matroids arisen from matrogenic graphs1997-09-24Paper
Logical analysis of numerical data1997-08-28Paper
https://portal.mardi4nfdi.de/entity/Q43479011997-08-11Paper
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle1997-08-03Paper
Bipartite dimensions and bipartite degrees of graphs1997-05-04Paper
Laplacian spectra and spanning trees of threshold graphs1997-04-21Paper
Boolean regression1996-05-02Paper
Decomposability of partially defined Boolean functions1996-03-11Paper
Recognition of \(q\)-Horn formulae in linear time1995-09-10Paper
On Universal Threshold Graphs1995-03-09Paper
Predicting Cause-Effect Relationships from Incomplete Discrete Observations1994-12-20Paper
A Complexity Index for Satisfiability Problems1994-08-16Paper
Bipartite bithreshold graphs1994-06-26Paper
Balancing problems in acyclic networks1994-06-15Paper
Preperfect graphs1993-09-15Paper
https://portal.mardi4nfdi.de/entity/Q52895541993-08-23Paper
https://portal.mardi4nfdi.de/entity/Q52895811993-08-23Paper
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions1993-06-29Paper
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem1993-01-16Paper
Horn functions and their DNFs1993-01-04Paper
Approximations of pseudo-Boolean functions; applications to game theory1992-09-27Paper
Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39904231992-06-28Paper
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39721311992-06-25Paper
Cut-threshold graphs1991-01-01Paper
Completely separable graphs1990-01-01Paper
Upper-bounds for quadratic 0-1 maximization1990-01-01Paper
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices1990-01-01Paper
Difference graphs1990-01-01Paper
More characterizations of triangulated graphs1990-01-01Paper
On clustering problems with connected optima in Euclidean spaces1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32008851989-01-01Paper
Some properties of 2-threshold graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47296111989-01-01Paper
Bimatroidal independence systems1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30351381988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34814871988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34915891988-01-01Paper
Stability in circular arc graphs1988-01-01Paper
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37585591987-01-01Paper
Product form parametric representation of the solutions to a quadratic boolean equation1987-01-01Paper
Strong unimodularity for matrices and hypergraphs1986-01-01Paper
Stability in CAN-free graphs1985-01-01Paper
Split graphs of Dilworth number 21985-01-01Paper
Boolean techniques for matroidal decomposition of independence systems and applications to graphs1985-01-01Paper
The struction of a graph: Application to CN-free graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33188081985-01-01Paper
Bithreshold Graphs1985-01-01Paper
Threshold characterization of graphs with dilworth number two1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32218861984-01-01Paper
Node-weighted graphs having the König-Egerváry property1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36825091984-01-01Paper
Roof duality, complementation and persistency in quadratic 0–1 optimization1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37151361984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33155571983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221221983-01-01Paper
Computing low-capacity 0–1 knapsack polytopes1982-01-01Paper
Vertices Belonging to All or to No Maximum Stable Sets of a Graph1982-01-01Paper
The splittance of a graph1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33185411981-01-01Paper
Threshold Numbers and Threshold Completions1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39074071981-01-01Paper
Threshold Sequences1981-01-01Paper
A note on Hamiltonian split graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38821891980-01-01Paper
Quasimonotone Boolean Functions and Bistellar Graphs1980-01-01Paper
Threshold Numbers and Threshold Completions1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39043821980-01-01Paper
Quadratic knapsack problems1980-01-01Paper
Boolean Elements in Combinatorial Optimization1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30501321979-01-01Paper
An Algorithm to Dualize a Regular Switching Function1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32070001978-01-01Paper
Linear Separation of Dominating Sets in Graphs1978-01-01Paper
The Dilworth Number of a Graph1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42001131978-01-01Paper
Split Graphs Having Dilworth Number Two1977-01-01Paper
The Role of Master Polytopes in the Unit Cube1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41651641977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41906751977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41935141977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41108201976-01-01Paper
Constraint Pairing In Integer Programming1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40607321975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40706291975-01-01Paper
Facet of regular 0–1 polytopes1975-01-01Paper
Coefficient reduction for inequalities in 0–1 variables1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40474571974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40607331974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40854931974-01-01Paper
A note on the monotonicity of pseudo-Boolean functions1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56858611973-01-01Paper
Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56686121972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56704491972-01-01Paper
On the Maximization of a Pseudo-Boolean Function1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56799271972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56821531972-01-01Paper
Applications of pseudo-Boolean methods to economic problems1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56821541971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56130111970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56165901970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44012251969-01-01Paper
Pseudo-Boolean Programming1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55632231969-01-01Paper
Time‐minimizing transportation problems1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55383001968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56505101968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55417611967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55439371967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55549911967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55938051967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55165441966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55197441966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55212601966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55346931966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55355411966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55959691966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55973361966-01-01Paper
Pseudo-Boolean programming and applications. Presented at the colloquium on mathematics and cybernetics in the economy, Berlin, October 19641965-01-01Paper
Some Network Flow Problems Solved with Pseudo-Boolean Programming1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53439581965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55126831965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55126841965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55126851965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55197151965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53363451964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53363461964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53413341964-01-01Paper
On the Generalized Transportation Problem1964-01-01Paper
Application of pseudo-Boolean programming to the theory of graphs1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55550021964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57313011964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53398941963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55196891963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55968421963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57288751963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57296311963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32934211962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32946391962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32770141961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53285541961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55576091961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55576101961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57272151961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32829671960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55576081960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38474511959-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Peter L. Hammer