E. Boros

发表

Upper-bounds for quadratic 0-1 maximization

Y. Crama, P. Hammer, E. Boros, 1990 .

Pseudo-Boolean optimization

Endre Boros, Peter L. Hammer, P. Hammer, 2002, Discret. Appl. Math..

Probabilistic bounds and algorithms for the maximum satisfiability problem

A. Prékopa, E. Boros, 1990 .

Finding Essential Attributes from Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2003, Annals of Mathematics and Artificial Intelligence.

Sequential Testing of Series-Parallel Systems of Small Depth

E. Boros, T. Ünlüyurt, 2000 .

Logical Analysis of Binary Data with Missing Bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1999, Artif. Intell..

Extensions of Partially Defined Boolean Functions with Missing Data Extensions of Partially Defined Boolean Functions with Missing Data

T. Ibaraki, E. Boros, K. Makino, 1996 .

Generating all vertices of a polyhedron is hard

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006, SODA 2006.

Generating vertices of polyhedra and related monotone generation problems

Khaled M. Elbassioni, E. Boros, 2007 .

Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2006 .

Discounted approximations of undiscounted stochastic games and Markov decision processes are already poor in the almost deterministic case

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2012 .

On Canonical Forms for Two-person Zero-sum Limit Average Payoff Stochastic Games

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2011 .

A Potential Reduction Algorithm for Ergodic Mean Payoff Stochastic Games with Perfect Information

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2010 .

A Pumping Algorithm for Ergodic Mean Payoff Stochastic Games with Perfect Information

Khaled M. Elbassioni, E. Boros, Vladimir GurvichKazuhisa, 2010 .

A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2010 .

Recognizing distributed approval voting forms and correspondences

V. Gurvich, E. Boros, K. Makino, 2020, Annals of Operations Research.

The number of triangles covering the center of an n-set

Z. Füredi, E. Boros, 1984 .

Markov decision processes and stochastic games with total effective payoff

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2018, Annals of Operations Research.

Generalized sandwich problem for Π-and ∆-free multigraphs and its applications to positional extensions of game forms . a

V. Gurvich, E. Boros, 2013 .

Dual subimplicants of positive Boolean functions

P. Hammer, V. Gurvich, E. Boros, 1998 .

Inference and Learning of Graphical Models: Theory and Applications in Computer Vision and Image Analysis

Nikos Komodakis, Endre Boros, Olga Veksler, 2016, Comput. Vis. Image Underst..

Minimal representation of elementary Horn functions

E. Boros, K. Makino, 2018 .

A LINEAR PROGRAMMING MODEL FOR SEQUENTIAL TESTING

P. Hammer, E. Boros, 2008 .

R U T C O R

E. Boros, P. Kantor, 2007 .

Large Scale LP Model for Finding Optimal Container Inspection Strategies

E. Boros, P. Kantor, P. Stroud, 2006 .

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2001, SIAM J. Comput..

Enumerating Spanning and Connected Subsets in Graphs and Matroids

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2007 .

Dual-Bounded Hypergraphs: A Survey∗

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002 .

Nash-solvable bidirected cyclic two-person game forms

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2008 .

Weighted Transversals of a Hypergraph

L. Khachiyan, V. Gurvich, E. Boros, 2001 .

More Extremal Properties of de Bruijn Sequences

V. Gurvich, E. Boros, M. Oster, 2009 .

Variations on extending partially defined Boolean functions with missing bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2003, Inf. Comput..

Feature Selection and Error Tolerance for the Logical Analysis of Data

E. Boros, Kathryn Davidson, C. Bowles, 2005 .

Stable families of coalitions and normal hypergraphs 1 Revised version of RUTCOR Research Report, RR

V. Gurvich, E. Boros, A. Vasin, 1997 .

Properties and solutions of a class of stochastic programming problems with probabilistic constraints by Kunikazu Yoda

E. Boros, D. Ben-Israel, 2013 .

Incompatibility Graphs in Data Mining

E. Boros, B. Simeone, F. Ricca, 2011 .

On generation of cut conjunctions, minimal k-connected spanning subgraphs, minimal connected and spanning subsets and vertices

E. Boros, K. Borys, 2006 .

RRR 10 – 2006 , April , 2006 Preprocessing of Unconstrained Quadratic Binary Optimization

P. Hammer, E. Boros, Gabriel Tavares, 2006 .

On the Sprague-Grundy function of compound games

V. Gurvich, E. Boros, K. Makino, 2019, 1903.08138.

A Nested Family of $k$-total Effective Rewards for Positional Games

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2014 .

A Linear Programming Approach for Optimal Protein Encoding

E. Boros, 2005 .

New algorithms for quadratic unconstrained binary optimization (qubo) with applications in engineering and social sciences

Endre Boros, Peter L. Hammer, Gabriel Tavares, 2008 .

Generating Minimal Valid Inequalities

E. Boros, Emre Yamangil, 2013 .

Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur

Endre Boros, András Prékopa, A. Prékopa, 1989, Math. Oper. Res..

Horn Minimization by Iterative Decomposition Horn Minimization by Iterative Decomposition

E. Boros, A. Kogan, Ond rej Cepe, 2007 .

2009-02 February 2009 Logical Analysis of Data : Classification with Justification 1 by

Y. Crama, P. Hammer, E. Boros, 2009 .

An Implementation of LogicalAnalysis of DataEndre Borosa

P. Hammer, T. Ibaraki, E. Boros, 1996 .

Inventory and Scheduling Problems in Supply Chain Management by SELIM BORA Dissertation Director :

E. Boros, 2012 .

Preface

Endre Boros, Peter L. Hammer, Martin Anthony, 1995, Discret. Appl. Math..

Preface

Endre Boros, Martin Anthony, Alexander Kogan, 2008, Discret. Appl. Math..

Convex separable minimization over partial order constraints

Endre Boros, Ron Shamir, R. Shamir, 1991 .

The existence of non-trivial hyperfactorizations ofK2n

Endre Boros, Scott A. Vanstone, Dieter Jungnickel, 1991, Comb..

On Nash-solvability of chess-like games

V. Gurvich, E. Boros, Robert Rand, 2014 .

Sperner extensions of affine spaces

E. Boros, T. Szönyi, F. Wettl, 1987 .

Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees

Endre Boros, Tamás Badics, E. Boros, 1991, Network Flows And Matching.

Stable effectivity functions and perfect graphs 1 *

V. Gurvich, E. Boros, 2000 .

Stable Eeectivity Functions and Perfect Graphs 1;2

E. Boros, 1999 .

A potential reduction algorithm for two-person zero-sum limiting average payoff stochastic games

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2012 .

The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models

Pierre Hansen, Endre Boros, Yves Crama, 2011, Ann. Oper. Res..

Peter Ladislaw Hammer: December 23, 1936 to December 27, 2006

Endre Boros, Yves Crama, Bruno Simeone, 2007, Discret. Appl. Math..

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden 2×2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidem

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2015, International Journal of Game Theory.

Computer-generated theorems on Nash-solvability of bimatrix games based on excluding certain 2 × 2 subgames

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2007 .

Compact quadratizations for pseudo-Boolean functions

Y. Crama, E. Boros, Elisabeth Rodríguez-Heck, 2019, Journal of Combinatorial Optimization.

Quadratic reformulations of nonlinear binary optimization problems

M. Anthony, Y. Crama, E. Boros, 2016, Mathematical Programming.

Enumeration in Data Management

E. Boros, Nicole Schweikardt, B. Kimelfeld, 2019 .

Some properties of the Boolean Quadric Polytope

E. Boros, I. Lari, 2009 .

Covering Non-uniform Hypergraphs

Raphael Yuster, Zoltán Füredi, Yair Caro, 2001, J. Comb. Theory, Ser. B.

A convex programming-based algorithm for mean payoff stochastic games with perfect information

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2017, Optimization Letters.

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2013, Dynamic Games and Applications.

Diagnosing double regular systems

Endre Boros, Tonguç Ünlüyurt, E. Boros, 1999, Annals of Mathematics and Artificial Intelligence.

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs pdf

Vladimir Gurvich, Endre Boros, Martin Milanic, 2018, J. Graph Theory.

Decomposing 1-Sperner Hypergraphs

Vladimir Gurvich, Endre Boros, Martin Milanič, 2015, Electron. J. Comb..

On equistable, split, CIS, and related classes of graphs

Vladimir Gurvich, Endre Boros, Martin Milanic, 2015, Discret. Appl. Math..

1-Sperner hypergraphs pdf

Vladimir Gurvich, Endre Boros, Martin Milanic, 2015, ArXiv.

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1998, Inf. Comput..

On shift stable hypergraphs

Endre Boros, E. Boros, 1991, Discret. Math..

The ACCAM model: simulating aviation mission readiness for U.S. coast guard stations

Endre Boros, Fred S. Roberts, Brian Nakamura, 2015, 2015 IEEE International Symposium on Technologies for Homeland Security (HST).

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Discret. Appl. Math..

Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis

Endre Boros, Vladimir Menkov, E. Boros, 2004, Discret. Appl. Math..

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Theor. Comput. Sci..

Computing Many Maximal Independent Sets for Hypergraphs in Parallel

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Parallel Process. Lett..

A global parallel algorithm for the hypergraph transversal problem

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Inf. Process. Lett..

A New Algorithm for the Hypergraph Transversal Problem

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2005, COCOON.

On the Complexity of Some Enumeration Problems for Matroids

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2005, SIAM J. Discret. Math..

The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds

Endre Boros, Peter L. Hammer, P. Hammer, 1991, Ann. Oper. Res..

Logical analysis of data: classification with justification

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2011, Ann. Oper. Res..

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2008, Discret. Appl. Math..

Generating dual-bounded hypergraphs

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002, Optim. Methods Softw..

Boolean Normal Forms, Shellability, and Reliability Computations

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 2000, SIAM J. Discret. Math..

Logical analysis of numerical data

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 1997, Math. Program..

Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 1997, SIAM J. Comput..

Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 1991, ISA.

Horn minimization by iterative decomposition

Endre Boros, Alexander Kogan, Ondrej Cepek, 1998, Annals of Mathematics and Artificial Intelligence.

Generating Minimal k-Vertex Connected Spanning Subgraphs

Vladimir Gurvich, Konrad Borys, Gábor Rudolf, 2007, COCOON.

On minimal imperfect graphs with circular symmetry

Vladimir Gurvich, Endre Boros, Myriam Preissmann, 1998, J. Graph Theory.

On Minimally Imperfect Graphs with Circular Symmetry

Vladimir Gurvich, Endre Boros, Myriam Preissmann, 1997 .

Optimization Problems for Port-of-Entry Detection Systems

Paul B. Kantor, Endre Boros, Fred S. Roberts, 2008, Intelligence and Security Informatics.

Pseudo-boolean Optimization Pseudo-boolean Optimization

P. Hammer, E. Boros, Peter L. Hammerb, 2001 .

Tetris Hypergraphs and Combinations of Impartial Games

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2017, 1701.02819.

Perfect graphs, kernels, and cores of cooperative games

Vladimir Gurvich, Endre Boros, V. Gurvich, 2006, Discret. Math..

Polynomial-time inference of all valid implications for Horn and related formulae

Endre Boros, Peter L. Hammer, Yves Crama, 1990, Annals of Mathematics and Artificial Intelligence.

Enumeration in Data Management (Dagstuhl Seminar 19211)

Endre Boros, Reinhard Pichler, Nicole Schweikardt, 2019, Dagstuhl Reports.

On quadratization of pseudo-Boolean functions pdf

Endre Boros, Aritanan Gruber, E. Boros, 2012, ISAIM.

Compact quadratizations for pseudo-Boolean functions

Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck, 2020, J. Comb. Optim..

Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables

Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck, 2018, ISAIM.

Quadratic reformulations of nonlinear binary optimization problems

Endre Boros, Yves Crama, Martin Anthony, 2016, Mathematical Programming.

Quadratization of Symmetric Pseudo-Boolean Functions pdf

Endre Boros, Yves Crama, Martin Anthony, 2014, Discret. Appl. Math..

A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields

Endre Boros, Ramin Zabih, Alexander Fix, 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.

A graph cut algorithm for higher-order Markov Random Fields

Endre Boros, Ramin Zabih, Alexander Fix, 2011, 2011 International Conference on Computer Vision.

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Endre Boros, Peter L. Hammer, Gabriel Tavares, 2007, J. Heuristics.

A subclass of Horn CNFs optimally compressible in polynomial time

Endre Boros, Alexander Kogan, Ondrej Cepek, 2009, Annals of Mathematics and Artificial Intelligence.

Exclusive and essential sets of implicates of Boolean functions

Endre Boros, Alexander Kogan, Ondrej Cepek, 2010, Discret. Appl. Math..

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1995, IFIP TCS.

An Implementation of Logical Analysis of Data

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 2000, IEEE Trans. Knowl. Data Eng..

Recognition of q-Horn Formulae in Linear Time

Endre Boros, Peter L. Hammer, Xiaorong Sun, 1994, Discret. Appl. Math..

Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm

Endre Boros, Tibor Szkaliczki, András Recski, 1999, Comput. Artif. Intell..

Unconstrained multilayer switchbox routing

Endre Boros, András Recski, Ferenc Wettl, 1995, Ann. Oper. Res..

Boolean regression

Endre Boros, Peter L. Hammer, John N. Hooker, 1995, Ann. Oper. Res..

Hardness results for approximate pure Horn CNF formulae minimization

Endre Boros, Aritanan Gruber, E. Boros, 2012, Annals of Mathematics and Artificial Intelligence.

A nested family of $$\varvec{k}$$k-total effective rewards for positional games

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2017, Int. J. Game Theory.

Research

Endre Boros, Robert Rand, E. Boros, 2004 .

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Endre Boros, Peter L. Hammer, Richard Sun, 2008, Discret. Optim..

On perfect 0, +/- 1 matrices,

Endre Boros, Ondrej Cepek, E. Boros, 1997, Discret. Math..

Perfect graphs are kernel solvable

Vladimir Gurvich, Endre Boros, V. Gurvich, 1996, Discret. Math..

Vector connectivity in graphs

Endre Boros, Pim van 't Hof, Martin Milanic, 2013, TAMC.

Equistarable bipartite graphs

Endre Boros, Martin Milanic, Nina Chiarelli, 2015, Discret. Math..

Neighborhood hypergraphs of bipartite graphs

Vladimir Gurvich, Endre Boros, Igor E. Zverovich, 2008, J. Graph Theory.

On 3-simplicial vertices in planar graphs

Endre Boros, Henry Martyn Mulder, Robert E. Jamison, 2004, Discuss. Math. Graph Theory.

Capturing human intelligence in the net

Paul B. Kantor, Endre Boros, Benjamin Melamed, 2000, CACM.

Scheduling vessels and container-yard operations with conflicting objectives

Yao Zhao, Endre Boros, Lei Lei, 2008, Ann. Oper. Res..

A corrected version of the Duchet kernel conjecture

Vladimir Gurvich, Endre Boros, V. Gurvich, 1998, Discret. Math..

On the Sprague–Grundy function of extensions of proper Nim

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2020, International Journal of Game Theory.

Sprague-Grundy function of matroids and related hypergraphs

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2018, Theor. Comput. Sci..

Sprague-Grundy function of symmetric hypergraphs

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2018, J. Comb. Theory, Ser. A.

On the Sprague-Grundyfunction of Exact k-Nim

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2015, Discret. Appl. Math..

Preprocessing of unconstrained quadratic binary optimization

Endre Boros, Peter L. Hammer, Gabriel Tavares, 2006 .

Generating All Vertices of a Polyhedron Is Hard

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006, SODA '06.

A convex programming-based algorithm for mean payoff stochastic games with perfect information

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2016, Optimization Letters.

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions pdf

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2013, ICALP.

Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes

Vladimir Gurvich, Khaled M. Elbassioni, Mahmoud Fouz, 2011, ICALP.

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2010, IPCO.

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

Vladimir Gurvich, Konrad Borys, Gábor Rudolf, 2008, Theory of Computing Systems.

Every stochastic game with perfect information admits a canonical form

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2009 .

Boolean Analysis of Incomplete Examples

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1996, SWAT.

Logical Analysis of Data

Toshihide Ibaraki, Endre Boros, Peter L. Hammer, 2005 .

On defining sets for projective planes

Endre Boros, Tamás Szonyi, Krisztián Tichler, 2005, Discret. Math..

Markov decision processes and stochastic games with total effective payoff

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2018, STACS.

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2013, Dyn. Games Appl..

On CIS circulants

Vladimir Gurvich, Endre Boros, Martin Milanič, 2013, Discret. Math..

Not complementary connected and not CIS d-graphs form weakly monotone families

Vladimir Gurvich, Diogo Vieira Andrade, Endre Boros, 2010, Discret. Math..

Vertex- and edge-minimal and locally minimal graphs

Vladimir Gurvich, Endre Boros, V. Gurvich, 2009, Discret. Math..

On Graphs Whose Maximal Cliques and Stable Sets Intersect

Vladimir Gurvich, Endre Boros, Diogo V. Andrade, 2018 .

Feature selection with applications to text classification

Endre Boros, David J. Neu, E. Boros, 2012 .

Finding Essential Attributes in Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2000, IDEAL.

Envy-free Relaxations for Goods, Chores, and Mixed Items pdf

Endre Boros, Kazuhisa Makino, Naoyuki Kamiyama, 2020, ArXiv.

On the number of vertices belonging to all maximum stable sets of a graph

Endre Boros, Martin Charles Golumbic, Vadim E. Levit, 2002, Discret. Appl. Math..

Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization

Endre Boros, Peter L. Hammer, Michel Minoux, 1999, Discret. Appl. Math..

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2003, Annals of Mathematics and Artificial Intelligence.

Approximating minimum representations of key Horn functions pdf

Endre Boros, Kazuhisa Makino, Kristóf Bérczi, 2018, ISAIM.

The negative cycles polyhedron and hardness of checking some polyhedral properties

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2011, Ann. Oper. Res..

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Generating vertices of polyhedra and related problems of monotone generation

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2009 .

Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra pdf

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2008, ArXiv.

Bounds for the Probability of the Union of Events

Fabio Tardella, Endre Boros, Andrea Scozzari, 2014, ISAIM.

Predicting Cause-Effect Relationships from Incomplete Discrete Observations

Endre Boros, Peter L. Hammer, John N. Hooker, 1994, SIAM J. Discret. Math..

Unique key Horn functions pdf

Endre Boros, Kazuhisa Makino, Kristóf Bérczi, 2020, Theor. Comput. Sci..

Dually conformal hypergraphs

V. Gurvich, E. Boros, Martin Milanič, 2023, ArXiv.

An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2000, Parallel Process. Lett..

Stable effectivity functions and perfect graphs

Vladimir Gurvich, Endre Boros, V. Gurvich, 2000, Math. Soc. Sci..

Stable families of coalitions and normal hypergraphs

V. Gurvich, E. Boros, E. Boros, 1997 .

On split and almost CIS-graphs

Vladimir Gurvich, Endre Boros, Igor E. Zverovich, 2009, Australas. J Comb..

On quadratization of pseudo-Boolean functions

E. Boros, Aritanan Gruber, 2012, ISAIM.

A Complexity Index for Satisfiability Problems

Michael E. Saks, Endre Boros, Peter L. Hammer, 1994, IPCO.

Enumerating Spanning and Connected Subsets in Graphs and Matroids

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006, ESA.

Optimal sequential inspection policies

Paul B. Kantor, Endre Boros, Noam Goldberg, 2011, Ann. Oper. Res..

Block linear majorants in quadratic 0-1 optimization

Endre Boros, Isabella Lari, Bruno Simeone, 2004, Discret. Appl. Math..

Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2004, ESA.

Generating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006 .

Mathematical Programming Society Newsletter Selfish Routing and the Price of Anarchy 1 MPI 2007 ICCOPT-07 15 74 Selfish Routing and the Price of Anarchy

Y. Crama, E. Boros, Bruno Simeone, 2007 .

An Intersection Inequality for Discrete Distributions and Related Generation Problems

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, ICALP.

On the sharpness of a theorem of B. segre

Endre Boros, Tamás Szonyi, E. Boros, 1986, Comb..

On clustering problems with connected optima in euclidean spaces

Endre Boros, Peter L. Hammer, P. Hammer, 1989, Discret. Math..

Extended Complementary Nim

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2015, 1504.06926.

Computing Remoteness Functions of Moore, Wythoff, and Euclid's games

V. Gurvich, E. Boros, K. Makino, 2023, ArXiv.

Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions

Khaled M. Elbassioni, V. Gurvich, E. Boros, 2017, Algorithmica.

Nested Family of Cyclic Games with $k$-total Effective Rewards pdf

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2014, ArXiv.

On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2013, Oper. Res. Lett..

Nash-solvable two-person symmetric cycle game forms

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2011, Discret. Appl. Math..

On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles

Vladimir Gurvich, Endre Boros, V. Gurvich, 2003, Math. Soc. Sci..

Why Chess and Backgammon can be solved in pure positional uniformly optimal strategies

Vladimir Gurvich, Endre Boros, V. Gurvich, 2009 .

Geršgorin variations III: On a theme of Brualdi and Varga

A. Hoffman, Y. Crama, R. Brualdi, 2008 .

A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area

Endre Boros, LászlóBéla Kovács, Ference Inotay, 1986 .

Agent-Based Manufacturing

S. M. Deen, M. Huhns, E. Boros, 2003, Advanced Information Processing.

On Minimal Transversals of Maximal Cliques in Graphs

V. Gurvich, E. Boros, Martin Milanivc, 2024, 2405.10789.

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem

V. Gurvich, E. Boros, Martin Milanivc, 2023, 2309.00098.

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2006, Discret. Appl. Math..

Dual-bounded generating problems: weighted transversals of a hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2004, Discret. Appl. Math..

An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, ESA.

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

V. Gurvich, P. G. Franciosa, E. Boros, 2022, Int. J. Game Theory.

Separable discrete functions: Recognition and sufficient conditions

Vladimir Gurvich, Endre Boros, Ondrej Cepek, 2017, Discret. Math..

A three-person deterministic graphical game without Nash equilibria

Vladimir Gurvich, Endre Boros, Martin Milanic, 2016, Discret. Appl. Math..

A three-person chess-like game without Nash equilibria pdf

Vladimir Gurvich, Endre Boros, Martin Milanic, 2016, ArXiv.

Chess-Like Games May Have No Uniform Nash Equilibria Even in Mixed Strategies

Vladimir Gurvich, Emre Yamangil, Endre Boros, 2013 .

Total tightness implies Nash-solvability for three-person game forms

Vladimir Gurvich, Endre Boros, Ondrej Cepek, 2012, Discret. Math..

Acyclic, or totally tight, two-person game forms: Characterization and main properties

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2010, Discret. Math..

On effectivity functions of game forms

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2010, Games Econ. Behav..

Minimal and locally minimal games and game forms

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2009, Discret. Math..

An Efficient Implementation of a Joint Generation Algorithm

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2004, WEA.

Sandwich problem for Π - and ∆ -free multigraphs and its applications to positional games

Vladimir Gurvich, Endre Boros, V. Gurvich, 2015 .

Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions

Endre Boros, Peter L. Hammer, P. Hammer, 1993, Math. Oper. Res..

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns

Toshihide Ibaraki, Endre Boros, Mutsunori Yagiura, 2008, IEICE Trans. Inf. Syst..