Pseudo-Boolean Programming. - Peter L. Hammer; Sergiu Rudeanu (Oper. Res., 1969)

On the Maximization of a Pseudo-Boolean Function. - Peter L. Hammer; Uri N. Peled (J. ACM, 1972)

A note on the monotonicity of pseudo-Boolean functions. - Peter Ladislaw Hammer (Z. Oper. Research, 1974)

Coefficient reduction for inequalities in 0-1 variables. - Gordon H. Bradley; Peter L. Hammer; Laurence A. Wolsey (Math. Program., 1974)

Facet of regular 0-1 polytopes. - Peter L. Hammer; Ellis L. Johnson; Uri N. Peled (Math. Program., 1975)

An Algorithm to Dualize a Regular Switching Function. - Peter L. Hammer; Uri N. Peled; Moshe Asher Pollatschek (IEEE Trans. Computers, 1979)

A note on Hamiltonian split graphs. - Rainer E. Burkard; Peter L. Hammer (J. Comb. Theory B, 1980)

The splittance of a graph. - Peter L. Hammer; Bruno Simeone (Comb., 1981)

Computing low-capacity 0-1 knapsack polytopes. - Peter L. Hammer; Uri N. Peled (Z. Oper. Research, 1982)

Roof duality, complementation and persistency in quadratic 0-1 optimization. - Peter L. Hammer; Pierre Hansen; Bruno Simeone (Math. Program., 1984)

The struction of a graph: Application to CN-free graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Dominique de Werra (Comb., 1985)

Boolean techniques for matroidal decomposition of independence systems and applications to graphs. - Claude Benzaken; Peter L. Hammer (Discret. Math., 1985)

Split graphs of Dilworth number 2. - Claude Benzaken; Peter L. Hammer; Dominique de Werra (Discret. Math., 1985)

Stability in CAN-free graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Dominique de Werra (J. Comb. Theory B, 1985)

Threshold characterization of graphs with dilworth number two. - Claude Benzaken; Peter L. Hammer; Dominique de Werra (J. Graph Theory, 1985)

Strong unimodularity for matrices and hypergraphs. - Yves Crama; Peter L. Hammer; Toshihide Ibaraki (Discret. Appl. Math., 1986)

Stability in Circular Arc Graphs. - Martin Charles Golumbic; Peter L. Hammer (J. Algorithms, 1988)

From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions. - Peter L. Hammer; Bruno Simeone; Thomas M. Liebling; Dominique de Werra (SIAM J. Discret. Math., 1988)

On clustering problems with connected optima in euclidean spaces. - Endre Boros; Peter L. Hammer (Discret. Math., 1989)

Bimatroidal independence systems. - Yves Crama; Peter Ladislaw Hammer (ZOR Methods Model. Oper. Res., 1989)

Some properties of 2-threshold graphs. - Peter Ladislaw Hammer; Nadimpalli V. R. Mahadev; Uri N. Peled (Networks, 1989)

Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. - Endre Boros; Yves Crama; Peter L. Hammer (Ann. Math. Artif. Intell., 1990)

On Renamable Horn and Generalized Horn Functions. - Vijay Chandru; Collette R. Coullard; Peter L. Hammer; M. Montanuz; Xiaorong Sun (Ann. Math. Artif. Intell., 1990)

Completely separable graphs. - Peter L. Hammer; Frédéric Maffray (Discret. Appl. Math., 1990)

Difference graphs. - Peter L. Hammer; Uri N. Peled; Xiaorong Sun (Discret. Appl. Math., 1990)

More characterizations of triangulated graphs. - Claude Benzaken; Yves Crama; Pierre Duchet; Peter L. Hammer; Frédéric Maffray (J. Graph Theory, 1990)

Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices. - Yves Crama; Peter L. Hammer; Toshihide Ibaraki (Math. Oper. Res., 1990)

Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. - Endre Boros; Peter L. Hammer; Toshihide Ibaraki; Kazuhiko Kawakami (ISA, 1991)

The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. - Endre Boros; Peter L. Hammer (Ann. Oper. Res., 1991)

Acknowledgement. - Peter L. Hammer; Pierre Hansen; Fred S. Roberts (Discret. Appl. Math., 1991)

Cut-threshold graphs. - Peter L. Hammer; Frédéric Maffray; Maurice Queyranne (Discret. Appl. Math., 1991)

Boolean-Combinatorial Bounding of Maximum 2-Satisfiability. - Jean-Marie Bourjolly; Peter L. Hammer; William R. Pulleyblank; Bruno Simeone (Computer Science and Operations Research, 1992)

Horn Functions and Their DNFs. - Peter L. Hammer; Alexander Kogan (Inf. Process. Lett., 1992)

Approximations of pseudo-Boolean functions; applications to game theory. - Peter L. Hammer; Ron Holzman (ZOR Methods Model. Oper. Res., 1992)

Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. - Endre Boros; Yves Crama; Peter L. Hammer (SIAM J. Discret. Math., 1992)

A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs. - Endre Boros; Peter L. Hammer; Ron Shamir (IEEE Trans. Computers, 1992)

Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem. - Perino M. Dearing; Peter L. Hammer; Bruno Simeone (Transp. Sci., 1992)

Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation. - Peter L. Hammer; Alexander Kogan (Artif. Intell., 1993)

Preperfect graphs. - Peter L. Hammer; Frédéric Maffray (Comb., 1993)

Bipartite bithreshold graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Math., 1993)

Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions. - Endre Boros; Peter L. Hammer (Math. Oper. Res., 1993)

Graph-Based Methods for Horn Knowledge Compressiom. - Peter L. Hammer; Alexander Kogan (HICSS (3), 1994)

On Domination Elimination Orderings and Domination Graphs (Extended Abstract). - Elias Dahlhaus; Peter L. Hammer; Frédéric Maffray; Stephan Olariu (WG, 1994)

On Universal Threshold Graphs. - Peter L. Hammer; Alexander K. Kelmans (Comb. Probab. Comput., 1994)

Balancing Problems in Acyclic Networks. - Endre Boros; Peter L. Hammer; Mark E. Hartmann; Ron Shamir (Discret. Appl. Math., 1994)

Recognition of q-Horn Formulae in Linear Time. - Endre Boros; Peter L. Hammer; Xiaorong Sun (Discret. Appl. Math., 1994)

A Complexity Index for Satisfiability Problems. - Endre Boros; Yves Crama; Peter L. Hammer; Michael E. Saks (SIAM J. Comput., 1994)

Predicting Cause-Effect Relationships from Incomplete Discrete Observations. - Endre Boros; Peter L. Hammer; John N. Hooker (SIAM J. Discret. Math., 1994)

Boolean regression. - Endre Boros; Peter L. Hammer; John N. Hooker (Ann. Oper. Res., 1995)

Decomposability of Partially Defined Boolean Functions. - Endre Boros; Vladimir Gurvich; Peter L. Hammer; Toshihide Ibaraki; Alexander Kogan (Discret. Appl. Math., 1995)

Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression. - Peter L. Hammer; Alexander Kogan (IEEE Trans. Knowl. Data Eng., 1995)

Laplacian Spectra and Spanning Trees of Threshold Graphs. - Peter L. Hammer; Alexander K. Kelmans (Discret. Appl. Math., 1996)

Bipartite dimensions and bipartite degrees of graphs. - Peter C. Fishburn; Peter L. Hammer (Discret. Math., 1996)

Essential and redundant rules in Horn knowledge bases. - Peter L. Hammer; Alexander Kogan (Decis. Support Syst., 1996)

Variable and Term Removal From Boolean Formulae. - Yves Crama; Oya Ekin; Peter L. Hammer (Discret. Appl. Math., 1997)

Matroids arisen from matrogenic graphs. - Guoli Ding; Peter L. Hammer (Discret. Math., 1997)

Logical analysis of numerical data. - Endre Boros; Peter L. Hammer; Toshihide Ibaraki; Alexander Kogan (Math. Program., 1997)

Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. - Endre Boros; Peter L. Hammer; Toshihide Ibaraki; Kazuhiko Kawakami (SIAM J. Comput., 1997)

Horn Functions and Submodular Boolean Functions. - Oya Ekin; Peter L. Hammer; Uri N. Peled (Theor. Comput. Sci., 1997)

Editorial. - Peter L. Hammer (Discret. Appl. Math., 1998)

Logical analysis of Chinese labor productivity patterns. - Alexander B. Hammer; Peter L. Hammer; Ilya B. Muchnik (Ann. Oper. Res., 1999)

Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization. - Endre Boros; Peter L. Hammer; Michel Minoux; David J. Rader Jr. (Discret. Appl. Math., 1999)

On the Stability Number of Claw-free P5-free and More General Graphs. - Andreas Brandstädt; Peter L. Hammer (Discret. Appl. Math., 1999)

On Connected Boolean Functions. - Oya Ekin; Peter L. Hammer; Alexander Kogan (Discret. Appl. Math., 1999)

Disjunctive and conjunctive normal forms of pseudo-Boolean functions. - Stephan Foldes; Peter L. Hammer (Discret. Appl. Math., 2000)

Equational characterizations of Boolean function classes. - Oya Ekin; Stephan Foldes; Peter L. Hammer; Lisa Hellerstein (Discret. Math., 2000)

Monotone, Horn and Quadratic Pseudo-Boolean Functions. - Stephan Foldes; Peter L. Hammer (J. Univers. Comput. Sci., 2000)

Boolean Normal Forms, Shellability, and Reliability Computations. - Endre Boros; Yves Crama; Oya Ekin; Peter L. Hammer; Toshihide Ibaraki; Alexander Kogan (SIAM J. Discret. Math., 2000)

Evaluation, Strength, and Relevance of Variables of Boolean Functions. - Peter L. Hammer; Alexander Kogan; Uriel G. Rothblum (SIAM J. Discret. Math., 2000)

Convexity and logical analysis of data. - Oya Ekin; Peter L. Hammer; Alexander Kogan (Theor. Comput. Sci., 2000)

An Implementation of Logical Analysis of Data. - Endre Boros; Peter L. Hammer; Toshihide Ibaraki; Alexander Kogan; Eddy Mayoraz; Ilya B. Muchnik (IEEE Trans. Knowl. Data Eng., 2000)

Combinatorial problems related to origin-destination matrices. - Endre Boros; Peter L. Hammer; Federica Ricca; Bruno Simeone (Discret. Appl. Math., 2001)

A Satisfiability Formulation of Problems on Level Graphs. - Bert Randerath; Ewald Speckenmeyer; Endre Boros; Peter L. Hammer; Alexander Kogan; Kazuhisa Makino; Bruno Simeone; Ondrej Cepek (Electron. Notes Discret. Math., 2001)

Maximally Disjoint Solutions of the Set Covering Problem. - Peter L. Hammer; David J. Rader Jr. (J. Heuristics, 2001)

Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions. - Maria A. Osorio; Fred W. Glover; Peter L. Hammer (Ann. Oper. Res., 2002)

The Maximum Box Problem and its Application to Data Analysis. - Jonathan Eckstein; Peter L. Hammer; Ying Liu; Mikhail Nediak; Bruno Simeone (Comput. Optim. Appl., 2002)

Pseudo-Boolean optimization. - Endre Boros; Peter L. Hammer (Discret. Appl. Math., 2002)

Disjunctive and conjunctive representations in finite lattices and convexity spaces. - Stephan Foldes; Peter L. Hammer (Discret. Math., 2002)

Coronary Risk Prediction by Logical Analysis of Data. - Sorin Alexe; Eugene Blackstone; Peter L. Hammer; Hemant Ishwaran; Michael S. Lauer; Claire E. Pothier Snader (Ann. Oper. Res., 2003)

Struction revisited. - Gabriela Alexe; Peter L. Hammer; Vadim V. Lozin; Dominique de Werra (Discret. Appl. Math., 2003)

A Heuristic for Boolean Optimization Problems. - Thomas Davoine; Peter L. Hammer; Béla Vizvári (J. Heuristics, 2003)

Consensus algorithms for the generation of all maximal bicliques. - Gabriela Alexe; Sorin Alexe; Yves Crama; Stephan Foldes; Peter L. Hammer; Bruno Simeone (Discret. Appl. Math., 2004)

Introduction to special volume of Discrete Applied Mathematics. - Martin Anthony; Endre Boros; Peter L. Hammer; Alexander Kogan (Discret. Appl. Math., 2004)

Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. - Stephan Foldes; Peter L. Hammer (Discret. Appl. Math., 2004)

Pareto-optimal patterns in logical analysis of data. - Peter L. Hammer; Alexander Kogan; Bruno Simeone; Sándor Szedmák (Discret. Appl. Math., 2004)

Saturated systems of homogeneous boxes and the logical analysis of numerical data. - Peter L. Hammer; Yanpei Liu; Bruno Simeone; Sándor Szedmák (Discret. Appl. Math., 2004)

Logical analysis of diffuse large B-cell lymphomas. - Gabriela Alexe; Sorin Alexe; D. E. Axelrod; Peter L. Hammer; D. Weissmann (Artif. Intell. Medicine, 2005)

Construction of a Maximum Stable Set with $k$-Extensions. - Peter L. Hammer; Igor E. Zverovich (Comb. Probab. Comput., 2005)

Bisplit graphs. - Andreas Brandstädt; Peter L. Hammer; Van Bang Le; Vadim V. Lozin (Discret. Math., 2005)

Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions. - Stephan Foldes; Peter L. Hammer (Math. Oper. Res., 2005)

Pattern-based feature selection in genomics and proteomics. - Gabriela Alexe; Sorin Alexe; Peter L. Hammer; Béla Vizvári (Ann. Oper. Res., 2006)

Logical analysis of data - An overview: From combinatorial optimization to medical applications. - Peter L. Hammer; Tibérius O. Bonates (Ann. Oper. Res., 2006)

Spanned patterns for the logical analysis of data. - Gabriela Alexe; Peter L. Hammer (Discret. Appl. Math., 2006)

Accelerated algorithm for pattern detection in logical analysis of data. - Sorin Alexe; Peter L. Hammer (Discret. Appl. Math., 2006)

Preface. - Martin Anthony; Endre Boros; Peter L. Hammer; Alexander Kogan (Discret. Appl. Math., 2006)

A Boolean measure of similarity. - Martin Anthony; Peter L. Hammer (Discret. Appl. Math., 2006)

Preface. - Peter L. Hammer (Discret. Math., 2006)

Modeling country risk ratings using partial orders. - Peter L. Hammer; Alexander Kogan; Miguel A. Lejeune (Eur. J. Oper. Res., 2006)

Pattern-based clustering and attribute analysis. - Gabriela Alexe; Sorin Alexe; Peter L. Hammer (Soft Comput., 2006)

Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization. - Dominique de Werra; Peter L. Hammer (Ann. Oper. Res., 2007)

Approximation of the Quadratic Set Covering problem. - Bruno Escoffier; Peter L. Hammer (Discret. Optim., 2007)

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO). - Endre Boros; Peter L. Hammer; Gabriel Tavares (J. Heuristics, 2007)

Comprehensive vs. comprehensible classifiers in logical analysis of data. - Gabriela Alexe; Sorin Alexe; Peter L. Hammer; Alexander Kogan (Discret. Appl. Math., 2008)

Maximum patterns in datasets. - Tibérius O. Bonates; Peter L. Hammer; Alexander Kogan (Discret. Appl. Math., 2008)

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). - Endre Boros; Peter L. Hammer; Richard Sun; Gabriel Tavares (Discret. Optim., 2008)

Logical Analysis of Data (LAD) model for the early diagnosis of acute ischemic stroke. - Anupama Reddy; Honghui Wang; Hua Yu; Tibérius O. Bonates; Vimla Gulabani; Joseph Azok; Gerard Hoehn; Peter L. Hammer; Alison E. Baird; King C. Li (BMC Medical Informatics Decis. Mak., 2008)

Algebraic and topological closure conditions for classes of pseudo-Boolean functions. - Stephan Foldes; Peter L. Hammer (Discret. Appl. Math., 2009)

Using a similarity measure for credible classification. - Munevver Mine Subasi; Ersoy Subasi; Martin Anthony; Peter L. Hammer (Discret. Appl. Math., 2009)

Circuit Complexity. - Matthias Krause 001; Ingo Wegener; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Probabilistic Learning and Boolean Functions. - Martin Anthony; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Neural Networks and Boolean Functions. - Martin Anthony; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Decision Lists and Related Classes of Boolean Functions. - Martin Anthony; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Decomposition of Boolean Functions. - Jan C. Bioch; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Binary Decision Diagrams. - Beate Bollig; Martin Sauerhoff; Detlef Sieling; Ingo Wegener; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Fourier Transforms and Threshold Circuit Complexity. - Jehoshua Bruck; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Boolean Functions for Cryptography and Error-Correcting Codes. - Claude Carlet; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Vectorial Boolean Functions for Cryptography. - Claude Carlet; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Boolean Aspects of Network Reliability. - Charles J. Colbourn; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Probabilistic Analysis of Satisfiability Algorithms. - John Franco; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Optimization Methods in Logic. - John N. Hooker; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Hardware Equivalence and Property Verification. - Jie-Hong Roland Jiang; Tiziano Villa; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Compositions and Clones of Boolean Functions. - Reinhard Pöschel; Ivo G. Rosenberg; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Learning Boolean Functions with Queries. - Robert H. Sloan; Balázs Szörényi; György Turán; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Proof Theory. - Alasdair Urquhart; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Synthesis of Multilevel Boolean Networks. - Tiziano Villa; Robert K. Brayton; Alberto L. Sangiovanni-Vincentelli; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Boolean Functions - Theory, Algorithms, and Applications. - Yves Crama; Peter L. Hammer (Cambridge University Press, 2011)

Logical analysis of data: classification with justification. - Endre Boros; Yves Crama; Peter L. Hammer; Toshihide Ibaraki; Alexander Kogan; Kazuhisa Makino (Ann. Oper. Res., 2011)

Reverse-engineering country risk ratings: a combinatorial non-recursive model. - Peter Ladislaw Hammer; Alexander Kogan; Miguel A. Lejeune (Ann. Oper. Res., 2011)

A new imputation method for incomplete binary data. - Munevver Mine Subasi; Ersoy Subasi; Martin Anthony; Peter L. Hammer (Discret. Appl. Math., 2011)

A logical analysis of banks' financial strength ratings. - Peter L. Hammer; Alexander Kogan; Miguel A. Lejeune (Expert Syst. Appl., 2012)

Boolean Functions. - Yves Crama; Peter L. Hammer (Discret. Appl. Math., 2013)

Maximum weight archipelago subgraph problem. - Peter L. Hammer; Péter Majlender; Bruno Simeone; Béla Vizvári (Ann. Oper. Res., 2014)

A Classification Model to Predict the Rate of Decline of Kidney Function. - Ersoy Subasi; Munevver Mine Subasi; Michael Lipkowitz; John Roboz; Peter L. Hammer (ISAIM, 2016)