Endre Boros

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Endre Boros (born 21 September 1953) is a Hungarian-American mathematician, a Distinguished Professor at Rutgers University in New Brunswick, New Jersey, and the Director of the Center for Operations Research (RUTCOR).[1] He is the author of 15 book chapters and edited volumes, and 165 research papers. He is Associate Editor of the Annals of Mathematics and Artificial Intelligence, and Editor-in-Chief of both the Annals of Operations Research and Discrete Applied Mathematics.[2][3]

Results and publications[edit]

In 1986, Boros settled (with T. Szőnyi) a conjecture by Beniamino Segre about the cyclic structure of finite projective planes, and in 1988 provided the best known bound for a question posed by Paul Erdős about blocking sets of Galois planes. In 1996 he proved (with V. Gurvich) that perfect graphs are kernel solvable which answered a longstanding open question by C. Berge and P. Duchet (and which is independent of the perfect graph theorem). He settled (with V. Gurvich, L. Khachiyan, and K. Makino) the complexity of generating all maximal frequent and minimal infrequent sets of large data sets answering questions by R.H. Sloan, K. Takata and G. Turán in 2002, and in 2006 resolved (with K. Borys, K. Elbassioni, V. Gurvich, and L. Khachiyan) the complexity of the longstanding open problem of generating all vertices of polyhedral.[citation needed]

His 1989 idea of using a network flow based approach for quadratic binary optimization, and its recent extension (with P.L. Hammer, R. Sun and G. Tavares), created an efficient method which proved useful in computer vision and in particular, in medical image enhancement.[citation needed]

In the area of the theory of Horn functions, he proved in 1990 (with P.L. Hammer and Y. Crama) that all “prime implicates” of a Horn CNF can be generated efficiently, extended Horn logic to q-Horn and showed that this extension forms in some sense the boundary between tractable and intractable logic. He also introduced, with his student, O. Cepek, a biology-inspired theory of Horn logic, and used this to settle the complexity of numerous Horn logic simplification problems.


  1. ^ "Endre Boros". Rutcor.rutgers.edu. Retrieved 2012-11-28. 
  2. ^ "Endre Boros, Editor-in-Chief - Discrete Applied Mathematics". Journals.elsevier.com. Retrieved 2012-11-28. 
  3. ^ "Annals of Operations Research – incl. option to publish open access". Springer.com. Retrieved 2012-11-28. 

External links[edit]