default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter L. Hammer
Peter Ladislaw Hammer
Person information
- affiliation: Rutgers University, USA
- award (1998): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
[c7]Ersoy Subasi, Munevver Mine Subasi, Michael Lipkowitz, John Roboz, Peter L. Hammer:
A Classification Model to Predict the Rate of Decline of Kidney Function. ISAIM 2016- 2014
- [j110]Peter L. Hammer, Péter Majlender, Bruno Simeone, Béla Vizvári:
Maximum weight archipelago subgraph problem. Ann. Oper. Res. 217(1): 253-262 (2014) - 2013
- [j109]Yves Crama, Peter L. Hammer:
Boolean Functions. Discret. Appl. Math. 161(1-2): 315 (2013) - 2012
- [j108]Peter L. Hammer, Alexander Kogan, Miguel A. Lejeune
:
A logical analysis of banks' financial strength ratings. Expert Syst. Appl. 39(9): 7808-7821 (2012) - [c6]Munevver Mine Subasi, Peter L. Hammer, Ersoy Subasi, Martin Anthony:
A new imputation method for incomplete binary data. ISAIM 2012 - 2011
- [b1]Yves Crama, Peter L. Hammer:
Boolean Functions - Theory, Algorithms, and Applications. Encyclopedia of mathematics and its applications 142, Cambridge University Press 2011, ISBN 978-0-521-84751-3, pp. I-XXI, 1-687 - [j107]Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Logical analysis of data: classification with justification. Ann. Oper. Res. 188(1): 33-61 (2011) - [j106]Peter Ladislaw Hammer, Alexander Kogan, Miguel A. Lejeune:
Reverse-engineering country risk ratings: a combinatorial non-recursive model. Ann. Oper. Res. 188(1): 185-213 (2011) - [j105]Munevver Mine Subasi, Ersoy Subasi, Martin Anthony, Peter L. Hammer:
A new imputation method for incomplete binary data. Discret. Appl. Math. 159(10): 1040-1047 (2011) - 2010
- [p18]Reinhard Pöschel, Ivo G. Rosenberg, Yves Crama, Peter L. Hammer:
Compositions and Clones of Boolean Functions. Boolean Models and Methods 2010: 3-38 - [p17]Jan C. Bioch, Yves Crama, Peter L. Hammer:
Decomposition of Boolean Functions. Boolean Models and Methods 2010: 39-76 - [p16]Alasdair Urquhart, Yves Crama, Peter L. Hammer:
Proof Theory. Boolean Models and Methods 2010: 79-98 - [p15]John Franco, Yves Crama, Peter L. Hammer:
Probabilistic Analysis of Satisfiability Algorithms. Boolean Models and Methods 2010: 99-159 - [p14]John N. Hooker, Yves Crama, Peter L. Hammer:
Optimization Methods in Logic. Boolean Models and Methods 2010: 160-194 - [p13]Martin Anthony, Yves Crama, Peter L. Hammer:
Probabilistic Learning and Boolean Functions. Boolean Models and Methods 2010: 197-220 - [p12]Robert H. Sloan, Balázs Szörényi, György Turán, Yves Crama, Peter L. Hammer:
Learning Boolean Functions with Queries. Boolean Models and Methods 2010: 221-256 - [p11]Claude Carlet, Yves Crama, Peter L. Hammer:
Boolean Functions for Cryptography and Error-Correcting Codes. Boolean Models and Methods 2010: 257-397 - [p10]Claude Carlet, Yves Crama, Peter L. Hammer:
Vectorial Boolean Functions for Cryptography. Boolean Models and Methods 2010: 398-470 - [p9]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer:
Binary Decision Diagrams. Boolean Models and Methods 2010: 473-505 - [p8]Matthias Krause, Ingo Wegener, Yves Crama, Peter L. Hammer:
Circuit Complexity. Boolean Models and Methods 2010: 506-530 - [p7]Jehoshua Bruck, Yves Crama, Peter L. Hammer:
Fourier Transforms and Threshold Circuit Complexity. Boolean Models and Methods 2010: 531-553 - [p6]Martin Anthony, Yves Crama, Peter L. Hammer:
Neural Networks and Boolean Functions. Boolean Models and Methods 2010: 554-576 - [p5]Martin Anthony, Yves Crama, Peter L. Hammer:
Decision Lists and Related Classes of Boolean Functions. Boolean Models and Methods 2010: 577-596 - [p4]Jie-Hong Roland Jiang, Tiziano Villa, Yves Crama, Peter L. Hammer:
Hardware Equivalence and Property Verification. Boolean Models and Methods 2010: 599-674 - [p3]Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Yves Crama, Peter L. Hammer:
Synthesis of Multilevel Boolean Networks. Boolean Models and Methods 2010: 675-722 - [p2]Charles J. Colbourn, Yves Crama, Peter L. Hammer:
Boolean Aspects of Network Reliability. Boolean Models and Methods 2010: 723-759 - [e1]Yves Crama, Peter L. Hammer:
Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press 2010, ISBN 9780511780448 [contents]
2000 – 2009
- 2009
- [j104]Munevver Mine Subasi, Ersoy Subasi, Martin Anthony, Peter L. Hammer:
Using a similarity measure for credible classification. Discret. Appl. Math. 157(5): 1104-1112 (2009) - [j103]Stephan Foldes, Peter L. Hammer:
Algebraic and topological closure conditions for classes of pseudo-Boolean functions. Discret. Appl. Math. 157(13): 2818-2827 (2009) - 2008
- [j102]Tibérius O. Bonates, Peter L. Hammer, Alexander Kogan:
Maximum patterns in datasets. Discret. Appl. Math. 156(6): 846-861 (2008) - [j101]Gabriela Alexe, Sorin Alexe, Peter L. Hammer, Alexander Kogan:
Comprehensive vs. comprehensible classifiers in logical analysis of data. Discret. Appl. Math. 156(6): 870-882 (2008) - [j100]Endre Boros, Peter L. Hammer, Richard Sun, Gabriel Tavares:
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). Discret. Optim. 5(2): 501-529 (2008) - [j99]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:
Logical Analysis of Data (LAD) model for the early diagnosis of acute ischemic stroke. BMC Medical Informatics Decis. Mak. 8: 30 (2008) - 2007
- [j98]Dominique de Werra, Peter L. Hammer:
Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization. Ann. Oper. Res. 149(1): 67-73 (2007) - [j97]Bruno Escoffier, Peter L. Hammer:
Approximation of the Quadratic Set Covering problem. Discret. Optim. 4(3-4): 378-386 (2007) - [j96]Endre Boros, Peter L. Hammer, Gabriel Tavares:
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO). J. Heuristics 13(2): 99-132 (2007) - 2006
- [j95]Gabriela Alexe, Sorin Alexe, Peter L. Hammer, Béla Vizvári:
Pattern-based feature selection in genomics and proteomics. Ann. Oper. Res. 148(1): 189-201 (2006) - [j94]Peter L. Hammer, Tibérius O. Bonates:
Logical analysis of data - An overview: From combinatorial optimization to medical applications. Ann. Oper. Res. 148(1): 203-225 (2006) - [j93]Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan:
Preface. Discret. Appl. Math. 154(7): 1037 (2006) - [j92]Gabriela Alexe, Peter L. Hammer:
Spanned patterns for the logical analysis of data. Discret. Appl. Math. 154(7): 1039-1049 (2006) - [j91]Sorin Alexe, Peter L. Hammer:
Accelerated algorithm for pattern detection in logical analysis of data. Discret. Appl. Math. 154(7): 1050-1063 (2006) - [j90]Martin Anthony, Peter L. Hammer:
A Boolean measure of similarity. Discret. Appl. Math. 154(16): 2242-2246 (2006) - [j89]Peter L. Hammer:
Preface. Discret. Math. 306(10-11): 851-852 (2006) - [j88]Peter L. Hammer, Alexander Kogan, Miguel A. Lejeune:
Modeling country risk ratings using partial orders. Eur. J. Oper. Res. 175(2): 836-859 (2006) - [j87]Gabriela Alexe, Sorin Alexe, Peter L. Hammer:
Pattern-based clustering and attribute analysis. Soft Comput. 10(5): 442-452 (2006) - 2005
- [j86]Gabriela Alexe, Sorin Alexe, D. E. Axelrod, Peter L. Hammer, D. Weissmann:
Logical analysis of diffuse large B-cell lymphomas. Artif. Intell. Medicine 34(3): 235-267 (2005) - [j85]Peter L. Hammer, Igor E. Zverovich:
Construction of a Maximum Stable Set with $k$-Extensions. Comb. Probab. Comput. 14(3): 311-318 (2005) - [j84]Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin:
Bisplit graphs. Discret. Math. 299(1-3): 11-32 (2005) - [j83]Stephan Foldes, Peter L. Hammer:
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions. Math. Oper. Res. 30(2): 453-461 (2005) - 2004
- [j82]Stephan Foldes, Peter L. Hammer:
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. Discret. Appl. Math. 142(1-3): 53-65 (2004) - [j81]Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan:
Introduction to special volume of Discrete Applied Mathematics. Discret. Appl. Math. 144(1-2): 1- (2004) - [j80]Peter L. Hammer, Alexander Kogan, Bruno Simeone, Sándor Szedmák:
Pareto-optimal patterns in logical analysis of data. Discret. Appl. Math. 144(1-2): 79-102 (2004) - [j79]Peter L. Hammer, Yanpei Liu, Bruno Simeone, Sándor Szedmák:
Saturated systems of homogeneous boxes and the logical analysis of numerical data. Discret. Appl. Math. 144(1-2): 103-109 (2004) - [j78]Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone:
Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1): 11-21 (2004) - 2003
- [j77]Sorin Alexe, Eugene Blackstone, Peter L. Hammer, Hemant Ishwaran, Michael S. Lauer, Claire E. Pothier Snader:
Coronary Risk Prediction by Logical Analysis of Data. Ann. Oper. Res. 119(1-4): 15-42 (2003) - [j76]Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra:
Struction revisited. Discret. Appl. Math. 132(1-3): 27-46 (2003) - [j75]Thomas Davoine, Peter L. Hammer, Béla Vizvári:
A Heuristic for Boolean Optimization Problems. J. Heuristics 9(3): 229-247 (2003) - 2002
- [j74]Maria A. Osorio, Fred W. Glover, Peter L. Hammer:
Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions. Ann. Oper. Res. 117(1-4): 71-93 (2002) - [j73]Jonathan Eckstein, Peter L. Hammer, Ying Liu, Mikhail Nediak, Bruno Simeone:
The Maximum Box Problem and its Application to Data Analysis. Comput. Optim. Appl. 23(3): 285-298 (2002) - [j72]Endre Boros, Peter L. Hammer:
Pseudo-Boolean optimization. Discret. Appl. Math. 123(1-3): 155-225 (2002) - [j71]Stephan Foldes, Peter L. Hammer:
Disjunctive and conjunctive representations in finite lattices and convexity spaces. Discret. Math. 258(1-3): 13-25 (2002) - 2001
- [j70]Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone:
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115(1-3): 15-36 (2001) - [j69]Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek:
A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. 9: 269-277 (2001) - [j68]Peter L. Hammer, David J. Rader Jr.:
Maximally Disjoint Solutions of the Set Covering Problem. J. Heuristics 7(2): 131-144 (2001) - 2000
- [j67]Stephan Foldes, Peter L. Hammer:
Disjunctive and conjunctive normal forms of pseudo-Boolean functions. Discret. Appl. Math. 107(1-3): 1-26 (2000) - [j66]Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein:
Equational characterizations of Boolean function classes. Discret. Math. 211: 27-51 (2000) - [j65]Stephan Foldes, Peter L. Hammer:
Monotone, Horn and Quadratic Pseudo-Boolean Functions. J. Univers. Comput. Sci. 6(1): 97-104 (2000) - [j64]Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discret. Math. 13(2): 212-226 (2000) - [j63]Peter L. Hammer, Alexander Kogan, Uriel G. Rothblum:
Evaluation, Strength, and Relevance of Variables of Boolean Functions. SIAM J. Discret. Math. 13(3): 302-312 (2000) - [j62]Oya Ekin, Peter L. Hammer, Alexander Kogan:
Convexity and logical analysis of data. Theor. Comput. Sci. 244(1-2): 95-116 (2000) - [j61]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik:
An Implementation of Logical Analysis of Data. IEEE Trans. Knowl. Data Eng. 12(2): 292-306 (2000)
1990 – 1999
- 1999
- [j60]Alexander B. Hammer, Peter L. Hammer, Ilya B. Muchnik:
Logical analysis of Chinese labor productivity patterns. Ann. Oper. Res. 87: 165-176 (1999) - [j59]Endre Boros, Peter L. Hammer, Michel Minoux, David J. Rader Jr.:
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization. Discret. Appl. Math. 90(1-3): 69-88 (1999) - [j58]Andreas Brandstädt, Peter L. Hammer:
On the Stability Number of Claw-free P5-free and More General Graphs. Discret. Appl. Math. 95(1-3): 163-167 (1999) - [j57]Oya Ekin, Peter L. Hammer, Alexander Kogan:
On Connected Boolean Functions. Discret. Appl. Math. 96-97: 337-362 (1999) - 1998
- [j56]Peter L. Hammer:
Editorial. Discret. Appl. Math. 88(1-3): 1 (1998) - 1997
- [j55]Yves Crama, Oya Ekin, Peter L. Hammer:
Variable and Term Removal From Boolean Formulae. Discret. Appl. Math. 75(3): 217-230 (1997) - [j54]Guoli Ding, Peter L. Hammer:
Matroids arisen from matrogenic graphs. Discret. Math. 165-166: 211-217 (1997) - [j53]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Logical analysis of numerical data. Math. Program. 79: 163-190 (1997) - [j52]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami:
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. SIAM J. Comput. 26(1): 93-109 (1997) - [j51]Oya Ekin, Peter L. Hammer, Uri N. Peled:
Horn Functions and Submodular Boolean Functions. Theor. Comput. Sci. 175(2): 257-270 (1997) - 1996
- [j50]Peter L. Hammer, Alexander K. Kelmans:
Laplacian Spectra and Spanning Trees of Threshold Graphs. Discret. Appl. Math. 65(1-3): 255-273 (1996) - [j49]Peter C. Fishburn, Peter L. Hammer:
Bipartite dimensions and bipartite degrees of graphs. Discret. Math. 160(1-3): 127-148 (1996) - [j48]Peter L. Hammer, Alexander Kogan:
Essential and redundant rules in Horn knowledge bases. Decis. Support Syst. 16(2): 119-130 (1996) - 1995
- [j47]Endre Boros, Peter L. Hammer, John N. Hooker:
Boolean regression. Ann. Oper. Res. 58(3): 201-226 (1995) - [j46]Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. 62(1-3): 51-75 (1995) - [j45]Peter L. Hammer, Alexander Kogan:
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression. IEEE Trans. Knowl. Data Eng. 7(5): 751-762 (1995) - [c5]Peter L. Hammer, Alexander Kogan:
Essential and redundant rules in Horn knowledge bases. HICSS (3) 1995: 209-220 - 1994
- [j44]Peter L. Hammer, Alexander K. Kelmans:
On Universal Threshold Graphs. Comb. Probab. Comput. 3: 327-344 (1994) - [j43]Endre Boros, Peter L. Hammer, Mark E. Hartmann, Ron Shamir:
Balancing Problems in Acyclic Networks. Discret. Appl. Math. 49(1-3): 77-93 (1994) - [j42]Endre Boros, Peter L. Hammer, Xiaorong Sun:
Recognition of q-Horn Formulae in Linear Time. Discret. Appl. Math. 55(1): 1-13 (1994) - [j41]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems. SIAM J. Comput. 23(1): 45-49 (1994) - [j40]Endre Boros, Peter L. Hammer, John N. Hooker:
Predicting Cause-Effect Relationships from Incomplete Discrete Observations. SIAM J. Discret. Math. 7(4): 531-543 (1994) - [c4]Peter L. Hammer, Alexander Kogan:
Graph-Based Methods for Horn Knowledge Compressiom. HICSS (3) 1994: 300-309 - [c3]Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu:
On Domination Elimination Orderings and Domination Graphs (Extended Abstract). WG 1994: 81-92 - 1993
- [j39]Peter L. Hammer, Alexander Kogan:
Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation. Artif. Intell. 64(1): 131-145 (1993) - [j38]Peter L. Hammer, Frédéric Maffray:
Preperfect graphs. Comb. 13(2): 199-208 (1993) - [j37]Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Bipartite bithreshold graphs. Discret. Math. 119(1-3): 79-96 (1993) - [j36]Endre Boros, Peter L. Hammer:
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions. Math. Oper. Res. 18(1): 245-253 (1993) - 1992
- [j35]Peter L. Hammer, Alexander Kogan:
Horn Functions and Their DNFs. Inf. Process. Lett. 44(1): 23-29 (1992) - [j34]Peter L. Hammer, Ron Holzman:
Approximations of pseudo-Boolean functions; applications to game theory. ZOR Methods Model. Oper. Res. 36(1): 3-21 (1992) - [j33]Endre Boros, Yves Crama, Peter L. Hammer:
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. SIAM J. Discret. Math. 5(2): 163-177 (1992) - [j32]Endre Boros, Peter L. Hammer, Ron Shamir:
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs. IEEE Trans. Computers 41(11): 1380-1385 (1992) - [j31]Perino M. Dearing, Peter L. Hammer, Bruno Simeone:
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem. Transp. Sci. 26(2): 138-148 (1992) - [c2]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems. IPCO 1992: 220-226 - [p1]Jean-Marie Bourjolly, Peter L. Hammer, William R. Pulleyblank, Bruno Simeone:
Boolean-Combinatorial Bounding of Maximum 2-Satisfiability. Computer Science and Operations Research 1992: 23-42 - 1991
- [j30]Endre Boros, Peter L. Hammer:
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33(3): 151-180 (1991) - [j29]Peter L. Hammer, Pierre Hansen, Fred S. Roberts:
Acknowledgement. Discret. Appl. Math. 30(2-3): 99 (1991) - [j28]Peter L. Hammer, Frédéric Maffray, Maurice Queyranne:
Cut-threshold graphs. Discret. Appl. Math. 30(2-3): 163-179 (1991) - [c1]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami:
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. ISA 1991: 104-115 - 1990
- [j27]Endre Boros, Yves Crama, Peter L. Hammer:
Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. Ann. Math. Artif. Intell. 1: 21-32 (1990) - [j26]Vijay Chandru, Collette R. Coullard, Peter L. Hammer, M. Montanuz, Xiaorong Sun:
On Renamable Horn and Generalized Horn Functions. Ann. Math. Artif. Intell. 1: 33-47 (1990) - [j25]Peter L. Hammer, Frédéric Maffray:
Completely separable graphs. Discret. Appl. Math. 27(1-2): 85-99 (1990) - [j24]Peter L. Hammer, Uri N. Peled, Xiaorong Sun:
Difference graphs. Discret. Appl. Math. 28(1): 35-44 (1990) - [j23]Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray:
More characterizations of triangulated graphs. J. Graph Theory 14(4): 413-422 (1990) - [j22]Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices. Math. Oper. Res. 15(2): 258-267 (1990)
1980 – 1989
- 1989
- [j21]Endre Boros, Peter L. Hammer:
On clustering problems with connected optima in euclidean spaces. Discret. Math. 75(1-3): 81-88 (1989) - [j20]Yves Crama, Peter Ladislaw Hammer:
Bimatroidal independence systems. ZOR Methods Model. Oper. Res. 33(3): 149-165 (1989) - [j19]Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Some properties of 2-threshold graphs. Networks 19(1): 17-23 (1989) - 1988
- [j18]Martin Charles Golumbic, Peter L. Hammer:
Stability in Circular Arc Graphs. J. Algorithms 9(3): 314-320 (1988) - [j17]Peter L. Hammer, Bruno Simeone, Thomas M. Liebling, Dominique de Werra:
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions. SIAM J. Discret. Math. 1(2): 174-184 (1988) - 1986
- [j16]Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Strong unimodularity for matrices and hypergraphs. Discret. Appl. Math. 15(2-3): 221-239 (1986) - 1985
- [j15]Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
The struction of a graph: Application to CN-free graphs. Comb. 5(2): 141-147 (1985) - [j14]Claude Benzaken, Peter L. Hammer, Dominique de Werra:
Split graphs of Dilworth number 2. Discret. Math. 55(2): 123-127 (1985) - [j13]Claude Benzaken, Peter L. Hammer:
Boolean techniques for matroidal decomposition of independence systems and applications to graphs. Discret. Math. 56(1): 7-34 (1985) - [j12]Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
Stability in CAN-free graphs. J. Comb. Theory B 38(1): 23-30 (1985) - [j11]Claude Benzaken, Peter L. Hammer, Dominique de Werra:
Threshold characterization of graphs with dilworth number two. J. Graph Theory 9(2): 245-267 (1985) - 1984
- [j10]Peter L. Hammer, Pierre Hansen, Bruno Simeone:
Roof duality, complementation and persistency in quadratic 0-1 optimization. Math. Program. 28(2): 121-155 (1984) - 1982
- [j9]Peter L. Hammer, Uri N. Peled:
Computing low-capacity 0-1 knapsack polytopes. Z. Oper. Research 26(1): 243-249 (1982) - 1981
- [j8]Peter L. Hammer, Bruno Simeone:
The splittance of a graph. Comb. 1(3): 275-284 (1981) - 1980
- [j7]Rainer E. Burkard, Peter L. Hammer:
A note on Hamiltonian split graphs. J. Comb. Theory B 28(2): 245-248 (1980)
1970 – 1979
- 1979
- [j6]Peter L. Hammer, Uri N. Peled, Moshe Asher Pollatschek:
An Algorithm to Dualize a Regular Switching Function. IEEE Trans. Computers 28(3): 238-243 (1979) - 1975
- [j5]Peter L. Hammer, Ellis L. Johnson, Uri N. Peled:
Facet of regular 0-1 polytopes. Math. Program. 8(1): 179-206 (1975) - 1974
- [j4]Peter Ladislaw Hammer:
A note on the monotonicity of pseudo-Boolean functions. Z. Oper. Research 18(1): 47-50 (1974) - [j3]Gordon H. Bradley, Peter L. Hammer, Laurence A. Wolsey:
Coefficient reduction for inequalities in 0-1 variables. Math. Program. 7(1): 263-282 (1974) - 1972
- [j2]Peter L. Hammer, Uri N. Peled:
On the Maximization of a Pseudo-Boolean Function. J. ACM 19(2): 265-282 (1972)
1960 – 1969
- 1969
- [j1]Peter L. Hammer, Sergiu Rudeanu:
Pseudo-Boolean Programming. Oper. Res. 17(2): 233-261 (1969)
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 20:22 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:
