2008 |
84 | EE | Tibérius O. Bonates,
Peter L. Hammer,
Alexander Kogan:
Maximum patterns in datasets.
Discrete Applied Mathematics 156(6): 846-861 (2008) |
83 | EE | Gabriela Alexe,
Sorin Alexe,
Peter L. Hammer,
Alexander Kogan:
Comprehensive vs. comprehensible classifiers in logical analysis of data.
Discrete Applied Mathematics 156(6): 870-882 (2008) |
82 | EE | Endre Boros,
Peter L. Hammer,
Richard Sun,
Gabriel Tavares:
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO).
Discrete Optimization 5(2): 501-529 (2008) |
2007 |
81 | EE | Dominique de Werra,
Peter L. Hammer:
Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization.
Annals OR 149(1): 67-73 (2007) |
80 | EE | Bruno Escoffier,
Peter L. Hammer:
Approximation of the Quadratic Set Covering problem.
Discrete Optimization 4(3-4): 378-386 (2007) |
79 | EE | Endre Boros,
Peter L. Hammer,
Gabriel Tavares:
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO).
J. Heuristics 13(2): 99-132 (2007) |
2006 |
78 | EE | Gabriela Alexe,
Sorin Alexe,
Peter L. Hammer,
Béla Vizvári:
Pattern-based feature selection in genomics and proteomics.
Annals OR 148(1): 189-201 (2006) |
77 | EE | Peter L. Hammer,
Tibérius O. Bonates:
Logical analysis of data - An overview: From combinatorial optimization to medical applications.
Annals OR 148(1): 203-225 (2006) |
76 | EE | Martin Anthony,
Peter L. Hammer:
A Boolean measure of similarity.
Discrete Applied Mathematics 154(16): 2242-2246 (2006) |
75 | EE | Martin Anthony,
Endre Boros,
Peter L. Hammer,
Alexander Kogan:
Preface.
Discrete Applied Mathematics 154(7): 1037 (2006) |
74 | EE | Gabriela Alexe,
Peter L. Hammer:
Spanned patterns for the logical analysis of data.
Discrete Applied Mathematics 154(7): 1039-1049 (2006) |
73 | EE | Sorin Alexe,
Peter L. Hammer:
Accelerated algorithm for pattern detection in logical analysis of data.
Discrete Applied Mathematics 154(7): 1050-1063 (2006) |
72 | EE | Peter L. Hammer:
Preface.
Discrete Mathematics 306(10-11): 851-852 (2006) |
71 | EE | Peter L. Hammer,
Alexander Kogan,
Miguel A. Lejeune:
Modeling country risk ratings using partial orders.
European Journal of Operational Research 175(2): 836-859 (2006) |
70 | EE | Gabriela Alexe,
Sorin Alexe,
Peter L. Hammer:
Pattern-based clustering and attribute analysis.
Soft Comput. 10(5): 442-452 (2006) |
2005 |
69 | EE | Gabriela Alexe,
Sorin Alexe,
D. E. Axelrod,
Peter L. Hammer,
D. Weissmann:
Logical analysis of diffuse large B-cell lymphomas.
Artificial Intelligence in Medicine 34(3): 235-267 (2005) |
68 | EE | Peter L. Hammer,
Igor E. Zverovich:
Construction of a Maximum Stable Set with $k$-Extensions.
Combinatorics, Probability & Computing 14(3): 311-318 (2005) |
67 | EE | Andreas Brandstädt,
Peter L. Hammer,
Van Bang Le,
Vadim V. Lozin:
Bisplit graphs.
Discrete Mathematics 299(1-3): 11-32 (2005) |
2004 |
66 | EE | Stephan Foldes,
Peter L. Hammer:
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions.
Discrete Applied Mathematics 142(1-3): 53-65 (2004) |
65 | EE | Martin Anthony,
Endre Boros,
Peter L. Hammer,
Alexander Kogan:
Introduction to special volume of Discrete Applied Mathematics.
Discrete Applied Mathematics 144(1-2): 1- (2004) |
64 | EE | Peter L. Hammer,
Yanpei Liu,
Bruno Simeone,
Sándor Szedmák:
Saturated systems of homogeneous boxes and the logical analysis of numerical data.
Discrete Applied Mathematics 144(1-2): 103-109 (2004) |
63 | EE | Peter L. Hammer,
Alexander Kogan,
Bruno Simeone,
Sándor Szedmák:
Pareto-optimal patterns in logical analysis of data.
Discrete Applied Mathematics 144(1-2): 79-102 (2004) |
62 | EE | Gabriela Alexe,
Sorin Alexe,
Yves Crama,
Stephan Foldes,
Peter L. Hammer,
Bruno Simeone:
Consensus algorithms for the generation of all maximal bicliques.
Discrete Applied Mathematics 145(1): 11-21 (2004) |
2003 |
61 | EE | Sorin Alexe,
Eugene Blackstone,
Peter L. Hammer,
Hemant Ishwaran,
Michael S. Lauer,
Claire E. Pothier Snader:
Coronary Risk Prediction by Logical Analysis of Data.
Annals OR 119(1-4): 15-42 (2003) |
60 | EE | Gabriela Alexe,
Peter L. Hammer,
Vadim V. Lozin,
Dominique de Werra:
Struction revisited.
Discrete Applied Mathematics 132(1-3): 27-46 (2003) |
59 | | Thomas Davoine,
Peter L. Hammer,
Béla Vizvári:
A Heuristic for Boolean Optimization Problems.
J. Heuristics 9(3): 229-247 (2003) |
2002 |
58 | | Endre Boros,
Peter L. Hammer:
Pseudo-Boolean optimization.
Discrete Applied Mathematics 123(1-3): 155-225 (2002) |
57 | EE | Stephan Foldes,
Peter L. Hammer:
Disjunctive and conjunctive representations in finite lattices and convexity spaces.
Discrete Mathematics 258(1-3): 13-25 (2002) |
2001 |
56 | | Endre Boros,
Peter L. Hammer,
Federica Ricca,
Bruno Simeone:
Combinatorial problems related to origin-destination matrices.
Discrete Applied Mathematics 115(1-3): 15-36 (2001) |
55 | EE | 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.
Electronic Notes in Discrete Mathematics 9: 269-277 (2001) |
54 | | Peter L. Hammer,
David J. Rader Jr.:
Maximally Disjoint Solutions of the Set Covering Problem.
J. Heuristics 7(2): 131-144 (2001) |
2000 |
53 | | Stephan Foldes,
Peter L. Hammer:
Disjunctive and conjunctive normal forms of pseudo-Boolean functions.
Discrete Applied Mathematics 107(1-3): 1-26 (2000) |
52 | EE | Oya Ekin,
Stephan Foldes,
Peter L. Hammer,
Lisa Hellerstein:
Equational characterizations of Boolean function classes.
Discrete Mathematics 211: 27-51 (2000) |
51 | EE | 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) |
50 | EE | Stephan Foldes,
Peter L. Hammer:
Monotone, Horn and Quadratic Pseudo-Boolean Functions.
J. UCS 6(1): 97-104 (2000) |
49 | EE | Endre Boros,
Yves Crama,
Oya Ekin,
Peter L. Hammer,
Toshihide Ibaraki,
Alexander Kogan:
Boolean Normal Forms, Shellability, and Reliability Computations.
SIAM J. Discrete Math. 13(2): 212-226 (2000) |
48 | EE | Peter L. Hammer,
Alexander Kogan,
Uriel G. Rothblum:
Evaluation, Strength, and Relevance of Variables of Boolean Functions.
SIAM J. Discrete Math. 13(3): 302-312 (2000) |
47 | EE | Oya Ekin,
Peter L. Hammer,
Alexander Kogan:
Convexity and logical analysis of data.
Theor. Comput. Sci. 244(1-2): 95-116 (2000) |
1999 |
46 | EE | 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.
Discrete Applied Mathematics 90(1-3): 69-88 (1999) |
45 | EE | Andreas Brandstädt,
Peter L. Hammer:
On the Stability Number of Claw-free P5-free and More General Graphs.
Discrete Applied Mathematics 95(1-3): 163-167 (1999) |
44 | EE | Oya Ekin,
Peter L. Hammer,
Alexander Kogan:
On Connected Boolean Functions.
Discrete Applied Mathematics 96-97: 337-362 (1999) |
1998 |
43 | EE | Peter L. Hammer:
Editorial.
Discrete Applied Mathematics 88(1-3): 1 (1998) |
1997 |
42 | EE | Yves Crama,
Oya Ekin,
Peter L. Hammer:
Variable and Term Removal From Boolean Formulae.
Discrete Applied Mathematics 75(3): 217-230 (1997) |
41 | EE | Guoli Ding,
Peter L. Hammer:
Matroids arisen from matrogenic graphs.
Discrete Mathematics 165-166: 211-217 (1997) |
40 | | Endre Boros,
Peter L. Hammer,
Toshihide Ibaraki,
Alexander Kogan:
Logical analysis of numerical data.
Math. Program. 79: 163-190 (1997) |
39 | | 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) |
38 | EE | Oya Ekin,
Peter L. Hammer,
Uri N. Peled:
Horn Functions and Submodular Boolean Functions.
Theor. Comput. Sci. 175(2): 257-270 (1997) |
1996 |
37 | EE | Peter L. Hammer,
Alexander K. Kelmans:
Laplacian Spectra and Spanning Trees of Threshold Graphs.
Discrete Applied Mathematics 65(1-3): 255-273 (1996) |
36 | EE | Peter C. Fishburn,
Peter L. Hammer:
Bipartite dimensions and bipartite degrees of graphs.
Discrete Mathematics 160(1-3): 127-148 (1996) |
1995 |
35 | EE | Peter L. Hammer,
Alexander Kogan:
Essential and redundant rules in Horn knowledge bases.
HICSS (3) 1995: 209- |
34 | EE | Endre Boros,
Vladimir Gurvich,
Peter L. Hammer,
Toshihide Ibaraki,
Alexander Kogan:
Decomposability of Partially Defined Boolean Functions.
Discrete Applied Mathematics 62(1-3): 51-75 (1995) |
33 | EE | Peter L. Hammer,
Alexander Kogan:
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression.
IEEE Trans. Knowl. Data Eng. 7(5): 751-762 (1995) |
1994 |
32 | | Peter L. Hammer,
Alexander Kogan:
Graph-Based Methods for Horn Knowledge Compressiom.
HICSS (3) 1994: 300-309 |
31 | | Elias Dahlhaus,
Peter L. Hammer,
Frédéric Maffray,
Stephan Olariu:
On Domination Elimination Orderings and Domination Graphs (Extended Abstract).
WG 1994: 81-92 |
30 | | Peter L. Hammer,
Alexander K. Kelmans:
On Universal Threshold Graphs.
Combinatorics, Probability & Computing 3: 327-344 (1994) |
29 | | Endre Boros,
Peter L. Hammer,
Mark E. Hartmann,
Ron Shamir:
Balancing Problems in Acyclic Networks.
Discrete Applied Mathematics 49(1-3): 77-93 (1994) |
28 | EE | Endre Boros,
Peter L. Hammer,
Xiaorong Sun:
Recognition of q-Horn Formulae in Linear Time.
Discrete Applied Mathematics 55(1): 1-13 (1994) |
27 | | Endre Boros,
Yves Crama,
Peter L. Hammer,
Michael E. Saks:
A Complexity Index for Satisfiability Problems.
SIAM J. Comput. 23(1): 45-49 (1994) |
26 | EE | Endre Boros,
Peter L. Hammer,
John N. Hooker:
Predicting Cause-Effect Relationships from Incomplete Discrete Observations.
SIAM J. Discrete Math. 7(4): 531-543 (1994) |
1993 |
25 | | Peter L. Hammer,
Alexander Kogan:
Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation.
Artif. Intell. 64(1): 131-145 (1993) |
24 | | Peter L. Hammer,
Frédéric Maffray:
Preperfect graphs.
Combinatorica 13(2): 199-208 (1993) |
23 | EE | Peter L. Hammer,
Nadimpalli V. R. Mahadev,
Uri N. Peled:
Bipartite bithreshold graphs.
Discrete Mathematics 119(1-3): 79-96 (1993) |
1992 |
22 | | Endre Boros,
Yves Crama,
Peter L. Hammer,
Michael E. Saks:
A Complexity Index for Satisfiability Problems.
IPCO 1992: 220-226 |
21 | | Endre Boros,
Peter L. Hammer,
Ron Shamir:
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs.
IEEE Trans. Computers 41(11): 1380-1385 (1992) |
20 | | Peter L. Hammer,
Alexander Kogan:
Horn Functions and Their DNFs.
Inf. Process. Lett. 44(1): 23-29 (1992) |
19 | | Endre Boros,
Yves Crama,
Peter L. Hammer:
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization.
SIAM J. Discrete Math. 5(2): 163-177 (1992) |
1991 |
18 | | Endre Boros,
Peter L. Hammer,
Toshihide Ibaraki,
Kazuhiko Kawakami:
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.
ISA 1991: 104-115 |
17 | EE | Peter L. Hammer,
Frédéric Maffray,
Maurice Queyranne:
Cut-threshold graphs.
Discrete Applied Mathematics 30(2-3): 163-179 (1991) |
16 | EE | Peter L. Hammer,
Pierre Hansen,
Fred S. Roberts:
Acknowledgement.
Discrete Applied Mathematics 30(2-3): 99 (1991) |
1990 |
15 | | V. Chandru,
Collette R. Coullard,
Peter L. Hammer,
M. Montanuz,
X. Sun:
On Renamable Horn and Generalized Horn Functions.
Ann. Math. Artif. Intell. 1: (1990) |
14 | | 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) |
13 | EE | Peter L. Hammer,
Frédéric Maffray:
Completely separable graphs.
Discrete Applied Mathematics 27(1-2): 85-99 (1990) |
12 | EE | Peter L. Hammer,
Uri N. Peled,
Xiaorong Sun:
Difference graphs.
Discrete Applied Mathematics 28(1): 35-44 (1990) |
1989 |
11 | EE | Endre Boros,
Peter L. Hammer:
On clustering problems with connected optima in euclidean spaces.
Discrete Mathematics 75(1-3): 81-88 (1989) |
1988 |
10 | | Martin Charles Golumbic,
Peter L. Hammer:
Stability in Circular Arc Graphs.
J. Algorithms 9(3): 314-320 (1988) |
9 | | Peter L. Hammer,
Bruno Simeone,
Thomas M. Liebling,
Dominique de Werra:
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.
SIAM J. Discrete Math. 1(2): 174-184 (1988) |
1985 |
8 | | Peter L. Hammer,
Nadimpalli V. R. Mahadev,
Dominique de Werra:
The struction of a graph: Application to CN-free graphs.
Combinatorica 5(2): 141-147 (1985) |
7 | EE | Claude Benzaken,
Peter L. Hammer,
Dominique de Werra:
Split graphs of Dilworth number 2.
Discrete Mathematics 55(2): 123-127 (1985) |
6 | EE | Claude Benzaken,
Peter L. Hammer:
Boolean techniques for matroidal decomposition of independence systems and applications to graphs.
Discrete Mathematics 56(1): 7-34 (1985) |
5 | EE | Peter L. Hammer,
Nadimpalli V. R. Mahadev,
Dominique de Werra:
Stability in CAN-free graphs.
J. Comb. Theory, Ser. B 38(1): 23-30 (1985) |
1981 |
4 | | Peter L. Hammer,
Bruno Simeone:
The splittance of a graph.
Combinatorica 1(3): 275-284 (1981) |
1980 |
3 | EE | Rainer E. Burkard,
Peter L. Hammer:
A note on Hamiltonian split graphs.
J. Comb. Theory, Ser. B 28(2): 245-248 (1980) |
1979 |
2 | | Peter L. Hammer,
Uri N. Peled,
M. A. Pollatschek:
An Algorithm to Dualize a Regular Switching Function.
IEEE Trans. Computers 28(3): 238-243 (1979) |
1972 |
1 | EE | Peter L. Hammer,
Uri N. Peled:
On the Maximization of a Pseudo-Boolean Function.
J. ACM 19(2): 265-282 (1972) |