Endre Boros
{{short description|Hungarian-American mathematician}}
{{Infobox scientist
| name = Endre Boros
| native_name =
| native_name_lang =
| image =
| image_size =
| alt =
| caption =
| birth_date = {{birth date and age|1953|09|21}}
| birth_place =
| death_date =
| death_place =
| death_cause =
| resting_place =
| resting_place_coordinates =
| other_names =
| residence =
| citizenship =
| nationality = Hungarian
| fields = Mathematics
| workplaces = Rutgers University
| patrons =
| education =
| alma_mater =
| thesis_title =
| thesis_url =
| thesis_year =
| doctoral_advisor =
| academic_advisors =
| doctoral_students =
| notable_students =
| known_for = Director of the Center for Operations Research
| influences =
| influenced =
| awards =
| author_abbrev_bot =
| author_abbrev_zoo =
| spouse =
| partner =
| children =
| signature =
| signature_alt =
| website =
| footnotes =
}}
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).{{cite web|url=http://rutcor.rutgers.edu/EBoros.htm |title=Endre Boros |publisher=Rutcor.rutgers.edu |date= |access-date=2012-11-28}} 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.{{cite web|url=http://www.journals.elsevier.com/discrete-applied-mathematics/editorial-board/endre-boros/ |title=Endre Boros, Editor-in-Chief - Discrete Applied Mathematics |publisher=Journals.elsevier.com |date= |access-date=2012-11-28}}{{cite web|url=https://www.springer.com/business+%26+management/operations+research/journal/10479 |title=Annals of Operations Research – incl. option to publish open access |publisher=Springer.com |date= |access-date=2012-11-28}}
Results
{{harvtxt|Boros|Szőnyi|1986}} settled a conjecture by Beniamino Segre about the cyclic structure of finite projective planes, and {{harvtxt|Boros|1988}} provided the best known bound for a question posed by Paul Erdős about blocking sets of Galois planes. {{harvtxt|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 {{harvtxt|Boros|Gurvich|Khachiyan|Makino|2003}}, and in {{harvtxt|Khachiyan|Boros|Borys|Elbassioni|2008}} resolved the complexity of the longstanding open problem of generating all vertices of polyhedra.
{{harvtxt|Boros|Hammer|Sun|Tavares|2008}} uses a network flow based approach for quadratic binary optimization.
In the area of the theory of Horn functions, {{harvtxt|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.
Selected publications
- {{citation
| last1 = Boros | first1 = E.
| last2 = Szőnyi | first2 = T.
| doi = 10.1007/BF02579386 | doi-access =
| issue = 3
| journal = Combinatorica
| mr = 875293
| pages = 261–268
| title = On the sharpness of a theorem of B. Segre
| volume = 6
| year = 1986| s2cid = 37521776
}}.
- {{citation
| last = Boros | first = Endre
| journal = Ars Combinatoria
| mr = 944353
| pages = 111–113
| title = PG(2,ps), p > 2 has property B(p + 2)
| volume = 25
| year = 1988}}.
- {{citation
| last1 = Boros | first1 = Endre
| last2 = Gurvich | first2 = Vladimir
| doi = 10.1016/0012-365X(95)00096-F
| issue = 1–3
| journal = Discrete Mathematics
| mr = 1415280
| pages = 35–55
| title = Perfect graphs are kernel solvable
| volume = 159
| year = 1996| doi-access =
}}.
- {{citation
| last1 = Boros | first1 = E.
| last2 = Gurvich | first2 = V.
| last3 = Khachiyan | first3 = L. | authorlink3=Leonid Khachiyan
| last4 = Makino | first4 = K.
| doi = 10.1023/A:1024605820527 | doi-access=
| issue = 3
| journal = Annals of Mathematics and Artificial Intelligence
| mr = 2017545
| pages = 211–221
| title = On maximal frequent and minimal infrequent sets in binary matrices
| volume = 39
| year = 2003| s2cid = 2953353
}}.
- {{citation
| last1 = Khachiyan | first1 = Leonid | authorlink1=Leonid Khachiyan
| last2 = Boros | first2 = Endre
| last3 = Borys | first3 = Konrad
| last4 = Elbassioni | first4 = Khaled
| last5 = Gurvich | first5 = Vladimir
| doi = 10.1007/s00454-008-9050-5
| issue = 1–3
| journal = Discrete & Computational Geometry
| mr = 2383757
| pages = 174–190
| title = Generating all vertices of a polyhedron is hard
| volume = 39
| year = 2008| doi-access = free
}}.
- {{citation
| last1 = Boros | first1 = Endre
| last2 = Hammer | first2 = Peter L. | authorlink2=Peter Hammer
| last3 = Sun | first3 = Richard
| last4 = Tavares | first4 = Gabriel
| doi = 10.1016/j.disopt.2007.02.001
| issue = 2
| journal = Discrete Optimization
| mr = 2408438
| pages = 501–529
| title = A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
| volume = 5
| year = 2008| doi-access = free
}}.
- {{citation
| last1 = Boros | first1 = Endre
| last2 = Crama | first2 = Yves
| last3 = Hammer | first3 = Peter L. | authorlink3=Peter Hammer
| doi = 10.1007/BF01531068 | doi-access=
| journal = Annals of Mathematics and Artificial Intelligence
| pages = 21–32
| title = Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae
| volume = 1
| issue = 1–4
| year = 1990| s2cid = 12249959
}}.
References
{{reflist}}
External links
- {{MathGenealogy |name=Endre Boros}}
- {{DBLP |name=Endre Boros}}
{{Authority control}}
{{DEFAULTSORT:Boros, Endre}}
Category:Hungarian emigrants to the United States
Category:Rutgers University faculty