Peter L. Hammer

Generating author description...

All published works

Action	Title	Year	Authors
+	Regular functions	2011	Yves Crama Peter L. Hammer
+	A new imputation method for incomplete binary data	2011	Munevver Mine Subasi Ersoy Subasi Martin Anthony Peter L. Hammer
+	A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)	2007	Endre Boros Peter L. Hammer Richard Sun Gabriel Tavares
+	Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)	2007	Endre Boros Peter L. Hammer Gabriel Tavares
+	Bisplit graphs	2005	Andreas Brandstädt Peter L. Hammer Van Bang Lê Vadim Lozin
+	Construction of a Maximum Stable Set with $k$-Extensions	2005	Peter L. Hammer Igor É. Zverovich
+	Introduction to special volume of Discrete Applied Mathematics	2004	Martin Anthony Endre Boros Peter L. Hammer Alexander Kogan
+ PDF Chat	Use of the Logical Analysis of Data Method for Assessing Long-Term Mortality Risk After Exercise Electrocardiography	2002	Michael S. Lauer Sorin Alexe Claire E Snader Eugene H. Blackstone Hemant Ishwaran Peter L. Hammer
+	Maximizing the Product of Two Linear Functions In 0-1 Variables	2002	Peter L. Hammer Pierre Hansen Pãnos M. Pardalos David J. Rader
+ PDF Chat	Equational characterizations of Boolean function classes	2000	Oya Ekin Stephan Foldes Peter L. Hammer Lisa Hellerstein
+	A Picture for Real Arithmetic	2000	Paul Fjelstad Peter L. Hammer
+	On the stability number of claw-free P5-free and more general graphs	1999	Andreas Brandstädt Peter L. Hammer
+	Proceedings of the conference on Discrete metric spaces	1998	Peter L. Hammer Walter Deuber Michel Deza Bruno Leclerc
+	Proceedings of the 7th conference on Formal power series and algebraic combinatorics	1998	Peter L. Hammer Bernard Leclerc J.-Y. Thibon
+	Proceedings of the conference on Chromatic polynomials and related topics	1997	Peter L. Hammer C. C. Chen Khee Meng Koh N. Z. Li Kee L. Teo Gek L. Chia
+	Horn functions and submodular boolean functions	1997	Oya Ekin Peter L. Hammer Uri N. Peled
+	Matroids arisen from matrogenic graphs	1997	Guoli Ding Peter L. Hammer
+	Bipartite dimensions and bipartite degrees of graphs	1996	Peter C. Fishburn Peter L. Hammer
+	Proceedings of the 6th conference on Formal power series and algebraic combinatorics	1996	Rodica Simion Peter L. Hammer
+	Proceedings of the 5th conference on Formal power series and algebraic combinatorics	1996	Peter L. Hammer M. Delest Renzo Pinzani
+	Proceedings of the 4th conference on Formal power series and algebraic combinatorics	1995	Peter L. Hammer Pierre Leroux Christophe Reutenauer
+	Selected papers of the 14th British conference on Combinatorial conference	1995	Douglas R. Woodall Peter L. Hammer
+ PDF Chat	Balancing problems in acyclic networks	1994	Endre Boros Peter L. Hammer Mark Hartmann Ron Shamir
+	Bipartite bithreshold graphs	1993	Peter L. Hammer N. V. R. Mahadev Uri N. Peled
+	Preperfect graphs	1993	Peter L. Hammer Fr�d�ric Maffray
+	Discrete Applied Mathematics	1993	Peter L. Hammer
+	Cut-threshold graphs	1991	Peter L. Hammer Frédéric Maffray Maurice Queyranne
+	On renamable Horn and generalized Horn functions	1990	V. Chandru Collette R. Coullard Peter L. Hammer Miguel Montañez Xiaorong Sun
+	More characterizations of triangulated graphs	1990	C. Benzaken Yves Crama Pierre Duchet Peter L. Hammer Frédéric Maffray
+	Quadratic functions of binary variables	1989	Peter L. Hammer Bruno Simeone
+	Order Relations of Variables in 0-1 Programming	1987	Peter L. Hammer Bruno Simeone
+	Pseudo-Boolean Functions and Their Graphs	1984	Aviezri S. Fraenkel Peter L. Hammer
+	A note on Hamiltonian split graphs	1980	Rainer E. Burkard Peter L. Hammer
+	The Dilworth Number of a Graph	1978	Stéphane Foldes Peter L. Hammer
+	Coefficient reduction for inequalities in 0–1 variables	1974	Gordon H. Bradley Peter L. Hammer Laurence A. Wolsey
+	Coefficient reduction for inequalities in 0-1 variables	1974	Gordon H. Bradley Peter L. Hammer Laurence A. Wolsey
+ PDF Chat	Nichtlineare Optimierung: Neuere Verfahren, Bibliographie, by H. P. Künzi and W. Oettli. 180 pages. Lecture notes in operations research and mathematical systems, Vol. 16. Springer-Verlag, Berlin-Heidelberg-New York, 1969. U.S. $3.30.	1972	Peter L. Hammer
+ PDF Chat	Some remarks on quadratic programming with 0-1 variables	1970	Peter L. Hammer Abraham A. Rubin
+	Minimization of Nonlinear Pseudo-Boolean Functions	1968	Peter L. Hammer Sergiu Rudeanu
+	Linear Pseudo-Boolean Equations and Inequalities	1968	Peter L. Hammer Sergiu Rudeanu
+	Connectedness and Path Problems in Graphs	1968	Peter L. Hammer Sergiu Rudeanu
+	Nonlinear Pseudo-Boolean Equations and Inequalities	1968	Peter L. Hammer Sergiu Rudeanu

Common Coauthors

Coauthor	Papers Together
Endre Boros	4
Sergiu Rudeanu	4
Frédéric Maffray	2
Uri N. Peled	2
Gabriel Tavares	2
Andreas Brandstädt	2
Laurence A. Wolsey	2
Yves Crama	2
Oya Ekin	2
Gordon H. Bradley	2
Martin Anthony	2
Bruno Simeone	2
Ron Shamir	1
Lisa Hellerstein	1
N. Z. Li	1
Rainer E. Burkard	1
Alexander Kogan	1
Abraham A. Rubin	1
Kee L. Teo	1
Pierre Leroux	1
Xiaorong Sun	1
Stephan Foldes	1
Paul Fjelstad	1
Aviezri S. Fraenkel	1
Munevver Mine Subasi	1
Pãnos M. Pardalos	1
Renzo Pinzani	1
Van Bang Lê	1
Claude Benzaken	1
V. Chandru	1
Fr�d�ric Maffray	1
Collette R. Coullard	1
Vadim Lozin	1
Pierre Duchet	1
Claire E Snader	1
Ersoy Subasi	1
Sorin Alexe	1
Douglas R. Woodall	1
Stéphane Foldes	1
Guoli Ding	1
Peter C. Fishburn	1
David J. Rader	1
M. Delest	1
Khee Meng Koh	1
J.-Y. Thibon	1
Bernard Leclerc	1
Richard Sun	1
Igor É. Zverovich	1
Gek L. Chia	1
Walter Deuber	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	On the notion of balance of a signed graph.	1953	Frank Harary	3
+	A Way to Simplify Truth Functions	1955	W. V. Quine	3
+	Strongly Perfect Graphs	1984	C. Berge Pierre Duchet	2
+	One-pass heuristics for large-scale unconstrained binary quadratic problems	2002	Fred Glover Bahram Alidaee César Rego Gary Kochenberger	2
+	Konstruktive Methoden der finiten nichtlinearen Optimierung	1980	Lothar Collatz G. Meinardus Wolfgang Wetterling	2
+	Threshold Sequences	1981	P. L. Hammer Toshihide Ibaraki Bruno Simeone	2
+	A Note on Well-Covered Graphs	1993	Václav Chvátal Peter J. Slater	1
+	Classical Perfect Graphs	1984	Pierre Duchet	1
+	A scatter search approach to unconstrained quadratic binary programs	1999	Mohammad M. Amini Bahram Alidaee Gary A. Kochenberger	1
+	Order Relations of Variables in 0-1 Programming	1987	Peter L. Hammer Bruno Simeone	1
+	Multiple Imputation for Missing Data: Concepts and New Development	2000	Yang Yuan	1
+	On maximal independent sets of vertices in claw-free graphs	1980	George J. Minty	1
+	A Successive Underestimation Method for Concave Minimization Problems	1976	James E. Falk Karla R. Hoffman	1
+	On stable cutsets in graphs	2000	Andreas Brandstädt Feodor F. Dragan Van Bang Lê Thomas Szymczak	1
+	Fonctions D’evaluation Et Penalites Pour Les Programmes Quadratiques En Variables 0–1	1975	Pierre Hansen	1
+	Methods of Nonlinear 0-1 Programming	1979	Pierre Hansen	1
+	Cluster Analysis and Mathematical Programming	1971	M. R. Rao	1
+	Likelihood-Based Methods for Missing Covariates in the Cox Proportional Hazards Model	2001	Amy H. Herring Joseph G. Ibrahim	1
+	Opposition graphs are strict quasi-parity graphs	1989	Chı́nh T. Hoàng Frédéric Maffray	1
+	Bounds on the Reliability Polynomial for Shellable Independence Systems	1982	Michael O. Ball J. Scott Provan	1
+	Complement reducible graphs	1981	Derek G. Corneil H. Lerchs L.Stewart Burlingham	1
+	The discarding of variables in multivariate analysis	1967	E. M. L. Beale M. G. Kendall D. W. Mann	1
+ PDF Chat	Addition Requirements for Rational Functions	1977	David Kirkpatrick Zvi M. Kedem	1
+	The threshold order of a Boolean function	1991	Chi Wang Adrian Williams	1
+ PDF Chat	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming	1995	Michel X. Goemans David P. Williamson	1
+ PDF Chat	A Theorem on <i>k</i>-Saturated Graphs	1965	A. Hajnal	1
+	Extreme degree sequences of simple graphs	1973	Michael Koren	1
+	Threshold Numbers and Threshold Completions	1981	P. L. Hammer Toshihide Ibaraki Uri N. Peled	1
+	On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems	1994	Warren P. Adams P. M. Dearing	1
+	An independent benchmarking of SDP and SOCP solvers	2003	Hans D. Mittelmann	1
+	Hamiltonian threshold graphs	1987	Frank Harary Uri N. Peled	1
+ PDF Chat	The polytope of degree sequences	1989	Uri N. Peled Murali K. Srinivasan	1
+	Numerical evaluation of SBmethod	2003	Christoph Helmberg	1
+	Bipartite dimensions and bipartite degrees of graphs	1996	Peter C. Fishburn Peter L. Hammer	1
+	Threshold characterization of graphs with dilworth number two	1985	C. Benzaken P. L. Hammer D. de Werra	1
+	Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile	1980	Najiba Sbihi	1
+	Shellings of spheres and polytopes	1974	Gopal Danaraj Victor Klee	1
+	Testing for equality between maximum matching and minimum node covering	1977	Fǎnicǎ Gavril	1
+ PDF Chat	Construction of test problems in quadratic bivalent programming	1991	Pãnos M. Pardalos	1
+	Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials	1987	Janet Beissinger Uri N. Peled	1
+ PDF Chat	Outline of an algorithm for integer solutions to linear programs	1958	Ralph E. Gomory	1
+	Coloring graphs with stable cutsets	1983	Alan Tucker	1
+	On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimization	1990	Pierre Hansen S. H. Lu Bruno Simeone	1
+	Ferrers digraphs and threshold graphs	1982	Olivier Cogis	1
+	Aggregating diophantine equations	1972	Fred Glover Robert E. D. Woolsey	1
+	L’algebre de Boole et ses applications en recherche operationnelle	1960	R. Fortet	1
+	MISSING DATA: A CONCEPTUAL REVIEW FOR APPLIED PSYCHOLOGISTS	1994	Philip L. Roth	1
+	A switching algorithm for the solution of quadratic boolean equations	1980	Rossella Petreschi Bruno Simeone	1
+	An Implicit Enumeration Algorithm for Quadratic Integer Programming	1980	Richard D. McBride Jonathan S. Yormark	1
+	Numerical Evaluation of SDPA (Semidefinite Programming Algorithm)	2000	Katsuki Fujisawa Mituhiro Fukuda Masakazu Kojima Kazuhide Nakata	1