Folgen
Endre Boros
Endre Boros
Distinguished Professor, MSIS Department, Rutgers University
Bestätigte E-Mail-Adresse bei rutgers.edu
Titel
Zitiert von
Zitiert von
Jahr
Pseudo-boolean optimization
E Boros, PL Hammer
Discrete applied mathematics 123 (1-3), 155-225, 2002
11702002
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
5692000
Logical analysis of numerical data
E Boros, PL Hammer, T Ibaraki, A Kogan
Mathematical programming 79 (1), 163-190, 1997
3501997
Generating all vertices of a polyhedron is hard
L Khachiyan, E Boros, K Borys, V Gurvich, K Elbassioni
Twentieth Anniversary Volume: Discrete & Computational Geometry, 1-17, 2009
2542009
Local search heuristics for quadratic unconstrained binary optimization (QUBO)
E Boros, PL Hammer, G Tavares
Journal of Heuristics 13, 99-132, 2007
1862007
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
1571989
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, 21-32, 1990
1451990
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
1432008
Perfect graphs, kernels, and cores of cooperative games
E Boros, V Gurvich
Discrete mathematics 306 (19-20), 2336-2354, 2006
1272006
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
1252002
Recognition of q-Horn formulae in linear time
E Boros, PL Hammer, X Sun
Discrete Applied Mathematics 55 (1), 1-13, 1994
1191994
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
1191991
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
1182011
The number of triangles covering the center of an n-set
E Boros, Z Füredi
Geometriae Dedicata 17, 69-77, 1984
1171984
Preprocessing of unconstrained quadratic binary optimization
E Boros, PL Hammer, G Tavares
Technical Report RRR 10-2006, RUTCOR, 2006
1152006
On the sharpness of a theorem of B. Segre
E Boros, T Szőnyi
Combinatorica 6, 261-268, 1986
1001986
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
992005
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
981998
Dual subimplicants of positive Boolean functions
E Boros, V Gurvich, PL Hammer
Optimization Methods and Software 10 (2), 147-156, 1998
981998
Perfect graphs are kernel solvable
E Boros, V Gurvich
Discrete Mathematics 159 (1-3), 35-55, 1996
921996
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20