Endre Boros
Orcid: 0000-0001-8206-3168Affiliations:
- Rutgers University, Center for Operations Research (RUTCOR)
According to our database1,
Endre Boros
authored at least 210 papers
between 1986 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
2023
2022
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies.
CoRR, 2022
Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022
2021
Int. J. Game Theory, 2021
2020
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs.
J. Graph Theory, 2020
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020
2019
Theor. Comput. Sci., 2019
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions.
Inf. Comput., 2019
Discret. Math., 2019
2018
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games.
Dyn. Games Appl., 2018
Discret. Appl. Math., 2018
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions.
Algorithmica, 2018
Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018
2017
A convex programming-based algorithm for mean payoff stochastic games with perfect information.
Optim. Lett., 2017
Math. Program., 2017
Int. J. Game Theory, 2017
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
2016
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames.
Int. J. Game Theory, 2016
Inference and Learning of Graphical Models: Theory and Applications in Computer Vision and Image Analysis.
Comput. Vis. Image Underst., 2016
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016
2015
IEEE Trans. Pattern Anal. Mach. Intell., 2015
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games.
Discret. Math., 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
2014
Math. Oper. Res., 2014
Ann. Math. Artif. Intell., 2014
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014
Proceedings of the Operations Research and Enterprise Systems, 2014
Proceedings of the ICORES 2014, 2014
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games.
Proceedings of the Combinatorial Optimization and Applications, 2014
2013
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness.
Oper. Res. Lett., 2013
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory.
Int. J. Game Theory, 2013
2012
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games.
Discret. Math., 2012
Discret. Math., 2012
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012
Proceedings of the Computer Vision - ECCV 2012, 2012
2011
Ann. Oper. Res., 2011
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res., 2011
Proceedings of the IEEE International Conference on Computer Vision, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Acyclic, or totally tight, two-person game forms: Characterization and main properties.
Discret. Math., 2010
Discret. Math., 2010
Discret. Appl. Math., 2010
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
Eur. J. Oper. Res., 2009
Ann. Math. Artif. Intell., 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
2008
Proceedings of the Intelligence and Security Informatics, Techniques and Applications, 2008
Theory Comput. Syst., 2008
IEICE Trans. Inf. Syst., 2008
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO).
Discret. Optim., 2008
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.
Discret. Appl. Math., 2008
Discret. Appl. Math., 2008
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra
CoRR, 2008
Ann. Oper. Res., 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.
Proceedings of the Computer Science, 2008
2007
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.
Theor. Comput. Sci., 2007
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs.
Theor. Comput. Sci., 2007
Parallel Process. Lett., 2007
Inf. Process. Lett., 2007
J. Heuristics, 2007
Obituary Peter L. Hammer (1936-2006).
Bull. EATCS, 2007
Discret. Appl. Math., 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
2006
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.
J. Graph Theory, 2006
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.
Discret. Appl. Math., 2006
Proceedings of the Algorithms, 2006
2005
SIAM J. Discret. Math., 2005
Comparison of Convex Hulls and Box Hulls.
Ars Comb., 2005
Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Discret. Math., 2004
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis.
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.
Proceedings of the Algorithms, 2004
2003
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
Math. Soc. Sci., 2003
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices.
Math. Program., 2003
Inf. Comput., 2003
Discret. Appl. Math., 2003
Ann. Math. Artif. Intell., 2003
Proceedings of The Twelfth Text REtrieval Conference, 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
An Intersection Inequality for Discrete Distributions and Related Generation Problems.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.
Proceedings of the Algorithms, 2003
2002
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
SIAM J. Comput., 2002
Discret. Appl. Math., 2002
Proceedings of The Eleventh Text REtrieval Conference, 2002
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
2001
Electron. Notes Discret. Math., 2001
Discret. Appl. Math., 2001
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
SIAM J. Discret. Math., 2000
SIAM J. Comput., 2000
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension.
Parallel Process. Lett., 2000
Proceedings of The Ninth Text REtrieval Conference, 2000
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
Proceedings of the Theoretical Computer Science, 2000
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
1999
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization.
Discret. Appl. Math., 1999
Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm.
Comput. Artif. Intell., 1999
Proceedings of the SIGIR '99: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1999
1998
Inf. Comput., 1998
1997
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle.
SIAM J. Comput., 1997
Proceedings of The Sixth Text REtrieval Conference, 1997
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997
1996
SIAM J. Optim., 1996
1995
1994
SIAM J. Discret. Math., 1994
1993
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions.
Math. Oper. Res., 1993
1992
IEEE Trans. Computers, 1992
SIAM J. Discret. Math., 1992
1991
Oper. Res., 1991
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds.
Ann. Oper. Res., 1991
Proceedings of the ISA '91 Algorithms, 1991
Proceedings of the Network Flows And Matching, 1991
1990
Ann. Math. Artif. Intell., 1990
1989
Closed Form Two-Sided Bounds for Probabilities that At Least <i>r</i> and Exactly <i>r</i> Out of <i>n</i> Events Occur.
Math. Oper. Res., 1989
J. Comb. Theory, Ser. A, 1989
Discret. Math., 1989
Proceedings of the Reliability Of Computer And Communication Networks, 1989
1988
1987
1986