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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2016
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016
2014
2013
2012
2011
Ann. Oper. Res., 2011
Encyclopedia of mathematics and its applications 142, Cambridge University Press, ISBN: 978-0-521-84751-3, 2011
2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
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
Discret. Appl. Math., 2008
2007
J. Heuristics, 2007
Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization.
Ann. Oper. Res., 2007
2006
Discret. Appl. Math., 2006
Logical analysis of data - An overview: From combinatorial optimization to medical applications.
Ann. Oper. Res., 2006
2005
Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions.
Math. Oper. Res., 2005
Comb. Probab. Comput., 2005
2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
2003
2002
Discret. Math., 2002
Comput. Optim. Appl., 2002
Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions.
Ann. Oper. Res., 2002
2001
Electron. Notes Discret. Math., 2001
Discret. Appl. Math., 2001
2000
SIAM J. Discret. Math., 2000
SIAM J. Discret. Math., 2000
J. Univers. Comput. Sci., 2000
Discret. Appl. Math., 2000
1999
Discret. Appl. Math., 1999
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization.
Discret. Appl. Math., 1999
1998
1997
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle.
SIAM J. Comput., 1997
1996
1995
IEEE Trans. Knowl. Data Eng., 1995
1994
SIAM J. Discret. Math., 1994
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
Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation.
Artif. Intell., 1993
1992
Transp. Sci., 1992
IEEE Trans. Computers, 1992
SIAM J. Discret. Math., 1992
ZOR Methods Model. Oper. Res., 1992
Proceedings of the Computer Science and Operations Research, 1992
1991
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds.
Ann. Oper. Res., 1991
Proceedings of the ISA '91 Algorithms, 1991
1990
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices.
Math. Oper. Res., 1990
Ann. Math. Artif. Intell., 1990
1989
Discret. Math., 1989
1988
SIAM J. Discret. Math., 1988
1986
1985
Boolean techniques for matroidal decomposition of independence systems and applications to graphs.
Discret. Math., 1985
1984
Math. Program., 1984
1982
1981
1980
1979
1975
1974
1972
1969