Peter L. Hammer

Affiliations:
  • Rutgers University, USA


According to our database1, Peter L. Hammer authored at least 133 papers between 1969 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
A Classification Model to Predict the Rate of Decline of Kidney Function.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2014
Maximum weight archipelago subgraph problem.
Ann. Oper. Res., 2014

2013
Boolean Functions.
Discret. Appl. Math., 2013

2012
A logical analysis of banks' financial strength ratings.
Expert Syst. Appl., 2012

2011
A new imputation method for incomplete binary data.
Discret. Appl. Math., 2011

Reverse-engineering country risk ratings: a combinatorial non-recursive model.
Ann. Oper. Res., 2011

Logical analysis of data: classification with justification.
Ann. Oper. Res., 2011

Boolean Functions - Theory, Algorithms, and Applications.
Encyclopedia of mathematics and its applications 142, Cambridge University Press, ISBN: 978-0-521-84751-3, 2011

2010
Synthesis of Multilevel Boolean Networks.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Proof Theory.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Learning Boolean Functions with Queries.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Compositions and Clones of Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Hardware Equivalence and Property Verification.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Optimization Methods in Logic.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Probabilistic Analysis of Satisfiability Algorithms.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Boolean Aspects of Network Reliability.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Vectorial Boolean Functions for Cryptography.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Boolean Functions for Cryptography and Error-Correcting Codes.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Fourier Transforms and Threshold Circuit Complexity.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Binary Decision Diagrams.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Decomposition of Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Decision Lists and Related Classes of Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Neural Networks and Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Probabilistic Learning and Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Circuit Complexity.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009
Using a similarity measure for credible classification.
Discret. Appl. Math., 2009

Algebraic and topological closure conditions for classes of pseudo-Boolean functions.
Discret. Appl. Math., 2009

2008
Logical Analysis of Data (LAD) model for the early diagnosis of acute ischemic stroke.
BMC Medical Informatics Decis. Mak., 2008

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO).
Discret. Optim., 2008

Maximum patterns in datasets.
Discret. Appl. Math., 2008

Comprehensive vs. comprehensible classifiers in logical analysis of data.
Discret. Appl. Math., 2008

2007
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO).
J. Heuristics, 2007

Approximation of the Quadratic Set Covering problem.
Discret. Optim., 2007

Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization.
Ann. Oper. Res., 2007

2006
Pattern-based clustering and attribute analysis.
Soft Comput., 2006

Modeling country risk ratings using partial orders.
Eur. J. Oper. Res., 2006

Preface.
Discret. Math., 2006

A Boolean measure of similarity.
Discret. Appl. Math., 2006

Preface.
Discret. Appl. Math., 2006

Accelerated algorithm for pattern detection in logical analysis of data.
Discret. Appl. Math., 2006

Spanned patterns for the logical analysis of data.
Discret. Appl. Math., 2006

Logical analysis of data - An overview: From combinatorial optimization to medical applications.
Ann. Oper. Res., 2006

Pattern-based feature selection in genomics and proteomics.
Ann. Oper. Res., 2006

2005
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions.
Math. Oper. Res., 2005

Bisplit graphs.
Discret. Math., 2005

Construction of a Maximum Stable Set with $k$-Extensions.
Comb. Probab. Comput., 2005

Logical analysis of diffuse large B-cell lymphomas.
Artif. Intell. Medicine, 2005

2004
Saturated systems of homogeneous boxes and the logical analysis of numerical data.
Discret. Appl. Math., 2004

Pareto-optimal patterns in logical analysis of data.
Discret. Appl. Math., 2004

Disjunctive analogues of submodular and supermodular pseudo-Boolean functions.
Discret. Appl. Math., 2004

Introduction to special volume of Discrete Applied Mathematics.
Discret. Appl. Math., 2004

Consensus algorithms for the generation of all maximal bicliques.
Discret. Appl. Math., 2004

2003
A Heuristic for Boolean Optimization Problems.
J. Heuristics, 2003

Struction revisited.
Discret. Appl. Math., 2003

Coronary Risk Prediction by Logical Analysis of Data.
Ann. Oper. Res., 2003

2002
Disjunctive and conjunctive representations in finite lattices and convexity spaces.
Discret. Math., 2002

Pseudo-Boolean optimization.
Discret. Appl. Math., 2002

The Maximum Box Problem and its Application to Data Analysis.
Comput. Optim. Appl., 2002

Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions.
Ann. Oper. Res., 2002

2001
Maximally Disjoint Solutions of the Set Covering Problem.
J. Heuristics, 2001

A Satisfiability Formulation of Problems on Level Graphs.
Electron. Notes Discret. Math., 2001

Combinatorial problems related to origin-destination matrices.
Discret. Appl. Math., 2001

2000
An Implementation of Logical Analysis of Data.
IEEE Trans. Knowl. Data Eng., 2000

Convexity and logical analysis of data.
Theor. Comput. Sci., 2000

Evaluation, Strength, and Relevance of Variables of Boolean Functions.
SIAM J. Discret. Math., 2000

Boolean Normal Forms, Shellability, and Reliability Computations.
SIAM J. Discret. Math., 2000

Monotone, Horn and Quadratic Pseudo-Boolean Functions.
J. Univers. Comput. Sci., 2000

Equational characterizations of Boolean function classes.
Discret. Math., 2000

Disjunctive and conjunctive normal forms of pseudo-Boolean functions.
Discret. Appl. Math., 2000

1999
On Connected Boolean Functions.
Discret. Appl. Math., 1999

On the Stability Number of Claw-free P<sub>5</sub>-free and More General Graphs.
Discret. Appl. Math., 1999

Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization.
Discret. Appl. Math., 1999

Logical analysis of Chinese labor productivity patterns.
Ann. Oper. Res., 1999

1998
Editorial.
Discret. Appl. Math., 1998

1997
Horn Functions and Submodular Boolean Functions.
Theor. Comput. Sci., 1997

Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle.
SIAM J. Comput., 1997

Logical analysis of numerical data.
Math. Program., 1997

Matroids arisen from matrogenic graphs.
Discret. Math., 1997

Variable and Term Removal From Boolean Formulae.
Discret. Appl. Math., 1997

1996
Essential and redundant rules in Horn knowledge bases.
Decis. Support Syst., 1996

Bipartite dimensions and bipartite degrees of graphs.
Discret. Math., 1996

Laplacian Spectra and Spanning Trees of Threshold Graphs.
Discret. Appl. Math., 1996

1995
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression.
IEEE Trans. Knowl. Data Eng., 1995

Decomposability of Partially Defined Boolean Functions.
Discret. Appl. Math., 1995

Boolean regression.
Ann. Oper. Res., 1995

1994
Predicting Cause-Effect Relationships from Incomplete Discrete Observations.
SIAM J. Discret. Math., 1994

A Complexity Index for Satisfiability Problems.
SIAM J. Comput., 1994

Recognition of q-Horn Formulae in Linear Time.
Discret. Appl. Math., 1994

Balancing Problems in Acyclic Networks.
Discret. Appl. Math., 1994

On Universal Threshold Graphs.
Comb. Probab. Comput., 1994

On Domination Elimination Orderings and Domination Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Graph-Based Methods for Horn Knowledge Compressiom.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions.
Math. Oper. Res., 1993

Bipartite bithreshold graphs.
Discret. Math., 1993

Preperfect graphs.
Comb., 1993

Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation.
Artif. Intell., 1993

1992
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem.
Transp. Sci., 1992

A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs.
IEEE Trans. Computers, 1992

Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization.
SIAM J. Discret. Math., 1992

Approximations of pseudo-Boolean functions; applications to game theory.
ZOR Methods Model. Oper. Res., 1992

Horn Functions and Their DNFs.
Inf. Process. Lett., 1992

Boolean-Combinatorial Bounding of Maximum 2-Satisfiability.
Proceedings of the Computer Science and Operations Research, 1992

1991
Cut-threshold graphs.
Discret. Appl. Math., 1991

Acknowledgement.
Discret. Appl. Math., 1991

The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds.
Ann. Oper. Res., 1991

Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.
Proceedings of the ISA '91 Algorithms, 1991

1990
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices.
Math. Oper. Res., 1990

More characterizations of triangulated graphs.
J. Graph Theory, 1990

Difference graphs.
Discret. Appl. Math., 1990

Completely separable graphs.
Discret. Appl. Math., 1990

On Renamable Horn and Generalized Horn Functions.
Ann. Math. Artif. Intell., 1990

Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae.
Ann. Math. Artif. Intell., 1990

1989
Some properties of 2-threshold graphs.
Networks, 1989

Bimatroidal independence systems.
ZOR Methods Model. Oper. Res., 1989

On clustering problems with connected optima in euclidean spaces.
Discret. Math., 1989

1988
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.
SIAM J. Discret. Math., 1988

Stability in Circular Arc Graphs.
J. Algorithms, 1988

1986
Strong unimodularity for matrices and hypergraphs.
Discret. Appl. Math., 1986

1985
Threshold characterization of graphs with dilworth number two.
J. Graph Theory, 1985

Stability in CAN-free graphs.
J. Comb. Theory, Ser. B, 1985

Split graphs of Dilworth number 2.
Discret. Math., 1985

Boolean techniques for matroidal decomposition of independence systems and applications to graphs.
Discret. Math., 1985

The struction of a graph: Application to CN-free graphs.
Comb., 1985

1984
Roof duality, complementation and persistency in quadratic 0-1 optimization.
Math. Program., 1984

1982
Computing low-capacity 0-1 knapsack polytopes.
Z. Oper. Research, 1982

1981
The splittance of a graph.
Comb., 1981

1980
A note on Hamiltonian split graphs.
J. Comb. Theory, Ser. B, 1980

1979
An Algorithm to Dualize a Regular Switching Function.
IEEE Trans. Computers, 1979

1975
Facet of regular 0-1 polytopes.
Math. Program., 1975

1974
Coefficient reduction for inequalities in 0-1 variables.
Math. Program., 1974

A note on the monotonicity of pseudo-Boolean functions.
Z. Oper. Research, 1974

1972
On the Maximization of a Pseudo-Boolean Function.
J. ACM, 1972

1969
Pseudo-Boolean Programming.
Oper. Res., 1969


  Loading...