The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter L. Hammer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  72. Maximum patterns in datasets. [Citation Graph (, )][DBLP]


  73. Comprehensive vs. comprehensible classifiers in logical analysis of data. [Citation Graph (, )][DBLP]


  74. Cut-threshold graphs. [Citation Graph (, )][DBLP]


  75. Acknowledgement. [Citation Graph (, )][DBLP]


  76. Completely separable graphs. [Citation Graph (, )][DBLP]


  77. Difference graphs. [Citation Graph (, )][DBLP]


  78. Algebraic and topological closure conditions for classes of pseudo-Boolean functions. [Citation Graph (, )][DBLP]


Search in 1.589secs, Finished in 1.591secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002