Endre Boros
Endre Boros
Distinguished Professor, MSIS Department, Rutgers University
Verified email at
Cited by
Cited by
Pseudo-boolean optimization
E Boros, PL Hammer
Discrete applied mathematics 123 (1-3), 155-225, 2002
An implementation of logical analysis of data
E Boros, PL Hammer, T Ibaraki, A Kogan, E Mayoraz, I Muchnik
IEEE Transactions on knowledge and Data Engineering 12 (2), 292-306, 2000
Logical analysis of numerical data
E Boros, PL Hammer, T Ibaraki, A Kogan
Mathematical programming 79 (1), 163-190, 1997
Generating all vertices of a polyhedron is hard
L Khachiyan, E Boros, K Borys, V Gurvich, K Elbassioni
Twentieth Anniversary Volume:, 1-17, 2009
Local search heuristics for quadratic unconstrained binary optimization (QUBO)
E Boros, PL Hammer, G Tavares
Journal of Heuristics 13 (2), 99-132, 2007
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
E Boros, A Prékopa
Mathematics of Operations Research 14 (2), 317-342, 1989
Polynomial-time inference of all valid implications for Horn and related formulae
E Boros, Y Crama, PL Hammer
Annals of Mathematics and Artificial Intelligence 1 (1), 21-32, 1990
On short paths interdiction problems: Total and node-wise limited interdiction
L Khachiyan, E Boros, K Borys, K Elbassioni, V Gurvich, G Rudolf, J Zhao
Theory of Computing Systems 43 (2), 204-233, 2008
Perfect graphs, kernels, and cores of cooperative games
E Boros, V Gurvich
Discrete mathematics 306 (19-20), 2336-2354, 2006
On the complexity of generating maximal frequent and minimal infrequent sets
E Boros, V Gurvich, L Khachiyan, K Makino
Annual Symposium on Theoretical Aspects of Computer Science, 133-141, 2002
Recognition of q-Horn formulae in linear time
E Boros, PL Hammer, X Sun
Discrete Applied Mathematics 55 (1), 1-13, 1994
The number of triangles covering the center of an n-set
E Boros, Z Füredi
Geometriae Dedicata 17 (1), 69-77, 1984
A graph cut algorithm for higher-order Markov random fields
A Fix, A Gruber, E Boros, R Zabih
2011 International Conference on Computer Vision, 1020-1027, 2011
Error-free and best-fit extensions of partially defined Boolean functions
E Boros, T Ibaraki, K Makino
Information and Computation 140 (2), 254-283, 1998
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
E Boros, PL Hammer
Annals of Operations Research 33 (3), 151-180, 1991
Preprocessing of unconstrained quadratic binary optimization
E Boros, PL Hammer, G Tavares
On the sharpness of a theorem of B. Segre
E Boros, T Szőnyi
Combinatorica 6 (3), 261-268, 1986
On the complexity of some enumeration problems for matroids
L Khachiyan, E Boros, K Elbassioni, V Gurvich, K Makino
SIAM Journal on Discrete Mathematics 19 (4), 966-984, 2005
Dual subimplicants of positive Boolean functions
E Boros, V Gurvich, PL Hammer
Optimization Methods and Software 10 (2), 147-156, 1998
Polynomial-time recognition of 2-monotonic positive Boolean functions given by an oracle
E Boros, PL Hammer, T Ibaraki, K Kawakami
SIAM Journal on Computing 26 (1), 93-109, 1997
The system can't perform the operation now. Try again later.
Articles 1–20