Endre Boros
Full C.V.
Director
of
RUTCOR
Rutgers
University
Center
for
Operations
Research
640 Bartholomew Road
Piscataway,
NJ
08854-8003
Room
123
Tel:
(732)
445-3041
Fax:
(732)
445-5472
e-mail:
Endre.Boros at rutcor.rutgers.edu
Education
MS.
in
Mathematics,
Eotvos
Lorand
University,
Budapest,
Hungary, 1978;
Thesis
title:
On Sperner Spaces;
advisor:
Ferenc
Karteszi
Doctorate
(Ph.D.)
in
Mathematics,
Eotvos
Lorand
University,
Budapest, Hungary,
1985;
Thesis
title:
Surrogate Constraints in 0-1 Programming;
advisor:
Andras
Prekopa
Editorial
Activities
Editor-in-Chief of Discrete
Applied Mathematics (2007- ) and of Annals of
Operations Research (2007-
).
Associate Editor of the Annals of
Mathematics and Artificial Intelligence (1999- ).
Member of the Editorial Boards
of Computational Management Science (2003- ), Discrete
Optimization
(2003-), and Constraints (1995- ).
Guest Editor (with Yves Crama,
Pierre Hansen, Frederic Maffray, Bruno Simeone and Dominique de Werra)
of the special volume of the Annals of
Operations Research
dedicated to the memory of Peter L. Hammer
(1936-2006).
Guest Editor (with Vladimir
Gurvich) of the special issue of DAM dedicated to the memory of
Leonid Khachiyan (1952-2005).
Courses Taught
01:711:453
Theory
of
Linear
Optimization
01:711:465 Integer Programming
16:711:513 Discrete Optimization
16:711:517 Computational Methods of Operations Research
16:711:553 Boolean Functions
16:711:611 Pseudo-Boolean Functions
Research Areas
Discrete Optimization, Integer
Programming, Unconstrained Binary Optimization, and their applications
in VLSI design, etc.
Theory of Boolean Functions,
Satisfiability, Dualization, and Horn functions.
Theory of Partially Defined
Boolean Functions, and Machine Learning
Enumeration Methods, and their
Applications in Data Mining, Reliability Theory, etc.
Graph Theory, Game Theory and
Combinatorics
Publications
Some Recent Publications in
Refereed Journals:
Endre
Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On Nash
equilibria and improvement cycles in pure positional
strategies for Chess-like and Backgammon-like -person
games. Discrete Mathematics 312 (4),
2012, 772-788
E.
Boros, Y. Crama, D. de Werra, P. Hansen, F. Maffray, Editors. The Mathematics of Peter L. Hammer
(1936-2006): Graphs,
Optimization, and Boolean Models, volume 188 of Annals
of
Operations
Research,
Springer,
New York, NY, 2011, 427 pages.
E.
Boros,
K.
Elbassioni,
V.
Gurvich,
H.R.Tiwary:
The negative cycles polyhedron and hardness of checking
some
polyhedral
properties. Annals of
Operations Research 188, 63-76, 2011 (Special Volume in
honor of
P.L.
Hammer).
Endre
Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan,
and
Kazuhisa Makino:
Logical Analysis of Data: Classification with
Justification. Annals
of
Operations
Research 188, 2011,
33-62.
Endre
Boros,
Vladimir
Gurvich,
Kazuhisa
Makino,
Wei
Shao: Nash-solvability of symmetric cycle
game
forms.
Discrete Applied Mathematics 159
(15),
1461-1487,
2011.
E. Boros,
K. Elbassioni, M. Fouz, V. Gurvich, K.
Makino, and B. Manthey: Stochastic mean payoff games:
Smoothed analysis and
approximation schemes. In ICALP 2011, Part
I, LNCS 6755, p.
147-158, 2011 (L. Aceto, M. Henzinger and J. Sgall,
eds.), 2011.
Endre
Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Every
stochastic
game with perfect information admits a canonical
form. GAMENETS 2011, Shanghai, China,
April 2011.
E.
Boros: Horn Functions, In: Boolean Functions: Theory, Algorithms,
and Applications
(Y. Crama and P.L.
Hammer, eds.) Cambridge
University Press, 2011.
Noam
Goldberg,
Jonathan
Word,
Endre
Boros,
Paul
Kantor: Optimal sequential inspection
policies. Annals
of
Operations
Research DOI 10.1007/s1079-010-0799-6.
Endre Boros, Vladimir A.
Gurvich and Igor E. Zverovich: Friendship two-graphs. Graphs
and Combinatorics 26, 2010.
Endre Boros, Khaled Elbassioni, Vladimir Gurvich,
Kazuhisa Makino: A pumping algorithm for ergodic stochastic mean payoff
games with perfect information. In Integer
Programming and Combinatorial Optimization, Proceedings of the 14th
International Conference, IPCO 2010 (F. Eisenbrand and F.B.
Shepherd, Eds) Lausanne, Switzerland, June 2010, LNCS 6080, 341-354,
2010.
Endre Boros,
Khaled Elbassioni, Kazuhisa Makino: Left-to-right multiplication for
monotone Boolean dualization. SIAM Journal on
Computing 39
(7), 3424-3439, 2010.
Endre Boros,
Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On effectivity functions of game forms . Games and Economic
Behavior 68,
512-531, 2010.
Paul Kantor and
Endre Boros: Deceptive Detection Methods for Effective Security with
Inadequate Budgets: The Testing Power. Risk
Analysis
30 (4), 663-673, 2010.
Diogo V.
Andrage, Endre Boros, Vladimir Gurvich: Not complementary connected and not CIS d-graphs form
weakly monotone families. Discrete Mathematics 310 (5), 1089-1096,
2010.
Endre Boros,
Vladimir Gurvich, Kazuhisa Makino and David Papp: Acyclic,
or
totally
tight,
two-person
game
forms;
characterization and main
properties. Discrete Mathematics 310 (6-7),
1135-1151, 2010.
Endre Boros,
Ondrej Cepek, Alexander Kogan, Petr Kucera: Exclusive and essential sets of implicates of Boolean
functions. Discrete Applied Mathematics 158 (2), 81-96,
2010.
Endre Boros,
Ondrej Cepek, Alexander Kogan, Petr Kucera: A subclass of Horn CNFs
optimally compressible in polynomial time. Annals of Mathematics and Artificial Intelligence 57 (3-4),
249-291, 2009.
E. Boros and
K. Makino: A fast and simple parallel algorithm for the monotone
duality problem. In ICALP '09: Proceedings of the 36th International Colloquium on Automata, languages and
Programming, LNCS 5555 (2009).
Endre Boros,
L. Fedzhora, P.B. Kantor, K. Saeger, P. Stroud: Large scale LP model for finding optimal container
inspection strategies. Naval Research Logistics, Vol. 56
(5), 404-420, 2009.
E. Boros, V.
Gurvich, and K. Makino: Minimal and locally minimal games and game
forms. Discrete Mathematics 309 (13), 4456-4468, 2009.
Endre Boros
and Vladimir Gurvich: Vertex- and edge-minimal and locally minimal graphs. Discrete Mathematics 309 (12),
3853-3865, 2009.
T. Unluyurt
and E. Boros: A note on optimal resource allocation for security in
reliability systems. European Journal of Operational Research 199,
601-603, 2009.
E. Boros, V.
Gurvich and I.Zverovich: On split and almost CIS-graphs. Australasian
Journal of Combinatorics 43, 163-180, 2009.
E. Boros, R.
Brualdi, Y. Crama,
and A.J. Hoffman: Gersgorin variations III: On a theme of Brualdi
and Varga. Linear Algebra and Its Applications 428, 14-19, 2008.
Leonid
Khachiyan, Endre Boros,
Konrad Borys, Khaled Elbassioni, and Vladimir Gurvich: Generating all
vertices of a polyhedron is hard. Discrete and
Computational Geometry, 174-190, 2008.
Endre Boros, Peter L. Hammer, R.
Sun and Gabriel Tavares: A max-flow approach to improved lower
bounds for quqadratic 0-1 minimization. Discrete
Optimization 5 (2), 501-529, 2008.
Leonid
Khachiyan, Endre Boros,
Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Gabor Rudolf and
Jihui Zhao: On short paths interdiction problems: Total and node-wise
limited interdiction. Theory of
Computing Systems 43 (2), 204-233, 2008.
Endre Boros,
Vladimir Gurvich
and Igor Zverovich: Neighborhood hypergraphs of bipartite graphs.
Journal of Graph Theory, 69-95,
2008.
Boros, E.,
Elbassioni, K.,
Gurvich, V. & Khachiyan, L.: On Enumerating Minimal Dicuts and
Strongly Connected Subgraphs. Algorithmica 50, 159-172, 2008.
K. Haraguchi, M.
Yagiura, E.
Boros and T. Ibaraki: A Randomness Based Analysis on the Data Size
Needed for Removing Deceptive Patterns. IEICE
Transactions on Information and Systems, E91-D (2008) 781-788.
L.
Khachiyan, E. Boros, K. Elbassioni and V. Gurvich: Generating all
minimal integral solutions to AND-OR systems of monotone inequalities:
Conjunctions are simpler than disjunctions. Discrete
Applied Mathematics 156
(11),
2020-2034,
2008.
E. Boros, L.
Khachiyan, K. Borys, K. Elbassioni, V. Gurvich and K. Makino:
Enumerating cut conjunctions in graphs and related problems. Algorithmica
51 (3),
239-263, 2008.
E. Boros, L.
Lei, Y. Zhao and H. Zhong: Scheduling vessels and container-yard
operations with conflicting objectives. Annals of
Operations Research 161,
149-170,
2008.
E. Boros,
P.L. Hammer and G.
Tavares: Local search heuristics for Quadratic Unconstrained
Binary Optimization (QUBO). J.
Heuristics 13, 2007, pp.
99-132.
RUTCOR Research Reports (RRR):
Endre
Boros,
Vladimir Gurvich, and Vladimir Oudalov: A Polynomial
Algorithm for a Two Parameter Extension of the Wythoff NIM Based on the
Perron-Frobenius Theory, 19-2011.
E.
Boros,
A. Scozzari, F. Tardella, and P. Veneziani: Polynomially
Computable Bounds for the Probability of the Union of Events,
13-2011.
Endre
Boros,
Ondřej
Čepek,
and Vladimir Gurvich: Total
Tightness
Implies
Nash-solvability for Three-person Game Forms.
RRR
11-2011.
Endre
Boros,
Khaled
Elbassioni,
Vladimir Gurvich, Kazuhisa Makino: A Lower
Bound for Discounting Algorithms Solving Two-person Zero-sum Limit
Average
Payoff Stochastic Games. RRR 22-2010.
Endre
Boros,
Khaled
Elbassioni,
Vladimir Gurvich, and Kazuhisa Makino: On
Nash
Equilibria and Improvement Cycles in Pure Positional Strategies for
Chess-like
and Backgammon-like n-person Games.
RRR 14-2010.
Endre Boros,
Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino: A
potential reduction algorithm for ergodic mean payoff
stochastic games with perfect information. RRR 5-2010.
Endre Boros,
Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino, Igor E. Zverovich: Separable
discrete
functions.
RRR 26-2009.
Endre Boros,
Robert Rand: Terminal games with 3 terminals have proper Nash
equilibria in pure positional strategies. RRR 22-2009.
Endre Boros,
Vladimir Gurvich: Why chess and backgammon can be solved in pure
positional uniformly optimal stretegies. RRR 21-2009.
Endre Boros,
Vladimir Gurvich, Kazuhisa Makino, Wei Shao: Nash solvable bidirected
cyclic two-person game forms. RRR 20-2009.
Endre Boros,
Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino: A pumping
algorithm for ergodic stochastic mean payoff games with perfect
information. RRR 19-2009.
Endre Boros,
Vladimir Gurvich, Khaled Elbassioni, and Kazuhisa Makino: Every
Stochastic
Game
with
Perfect
Information
Admits a
Canonical Form. RRR
9-2009.
Endre Boros,
Vladimir Gurvich, and Matthew Oster: More
Extremal
Properties
of
de
Bruijn
Sequences.
RRR 8-2009.
Endre Boros,
Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan,
Kazuhisa Makino: Logical
Analysis
of
Data:
Classification
with
Justification. RRR
5-2009.
Endre Boros,
Vladimir A. Gurvich, Igor E. Zverovich, and Wei Shao: Assignability
of
3-dimensional
totally
tight
matrices. RRR
2-2009.
E.
Boros,
K.
Elbassioni,
V.
Gurvich,
K.
Makino, and V. Oudalov: Computer-generated theorems on Nash
solvability of bimatrix games based on excluding certain $2 \times
2$ subgames. RRR 31-2007.
E.
Boros,
V.
Gurvich,
and
I.
Zverovich:
On split graphs and graphs whose maximal
cliques and stable sets intersect, except a unique pair. RRR
29-2007.
Endre
Boros
and
Vladimir
Gurvich:
On
complexity of algorithms for modeling disease transmission and optimal
vaccination strategy. RRR 16-2007.
Diogo
V.
Andrade,
Endre
Boros
and
Vladimir
Gurvich: On
graphs whose maximal cliques and stable sets intersect. RRR
17-2006.
Endre
Boros,
Peter
L.
Hammer
and
Gabriel
Tavares: Preprocessing
of Unconstrained Quadratic Binary Optimization. RRR
10-2006.
E.
Boros
and
L.
Everett:
Linear
Programming
Approach for Optimal Protein Encoding. RRR 14-2005.
Diogo
Andrade,
Endre
Boros
and
Vladimir
Gurvich:
Even-hole-free
and Balanced Circulants. RRR 8-2005.