Background
Boros, Endre was born on September 21, 1953 in Budapest, Hungary. Son of Endre and Terezia Boros. came to the United States, 1986.
- Photos
- Works
- Photos
- Works
Endre Boros
Edit ProfileEducation
Master of Science in Mathematics, Eotvos Lorand U., 1978; Doctor of Philosophy, Eotvos Lorand U., 1985.
Career
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. Boros & Szőnyi (1986) settled a conjecture by Beniamino Segre about the cyclic structure of finite projective planes, and Boros (1988) provided the best known bound for a question posed by Paul Erdős about blocking sets of Galois planes.
Boros & Gurvich (1996) proved 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 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 Boros et al. (2003), and in Khachiyan et al.
(2008) resolved the complexity of the longstanding open problem of generating all vertices of polyhedra. Boros et al. (2008) uses a network flow based approach for quadratic binary optimization.
In the area of the theory of Horn functions, Boros, Crama & Hammer (1990) proved 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.
Achievements
Membership
Member Society for Industrial and Applied Mathematics, American Mathematics Society, Math Program Society, Institute Management Sciences.
Connections
Married Zsuzsanna Szabolcsi, August 30, 1979. Children: Diana, Flora.
-
Born
-
Nationality
American -
Ethnicity