The following pages link to Endre Boros (Q226794):
Displaying 50 items.
- Quadratization of symmetric pseudo-Boolean functions (Q260013) (← links)
- Equistarable bipartite graphs (Q279223) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory (Q378342) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- On CIS circulants (Q394314) (← links)
- Total tightness implies Nash-solvability for three-person game forms (Q408181) (← links)
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Chess-like games may have no uniform Nash equilibria even in mixed strategies (Q457857) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames (Q524983) (← links)
- (Q578575) (redirect page) (← links)
- Sperner extensions of affine spaces (Q578578) (← links)
- Friendship two-graphs (Q604993) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Optimal sequential inspection policies (Q646686) (← links)
- Logical analysis of data: classification with justification (Q646700) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- On representing Sylvester-Gallai designs (Q912856) (← links)
- Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- On shift stable hypergraphs (Q923104) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Scheduling vessels and container-yard operations with conflicting objectives (Q940925) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Acyclic, or totally tight, two-person game forms: characterization and main properties (Q966009) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Peter Ladislaw Hammer (December 23, 1936 to December 27, 2006) (Q997059) (← links)
- Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
- A note on ``optimal resource allocation for security in reliability systems'' (Q1042180) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Minimal and locally minimal games and game forms (Q1043974) (← links)
- A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area (Q1064968) (← links)
- The number of triangles covering the center of an \(n\)-set (Q1077716) (← links)
- On the sharpness of a theorem of B. Segre (Q1084336) (← links)
- Rectangular dissections of a square (Q1101117) (← links)
- On clustering problems with connected optima in Euclidean spaces (Q1116236) (← links)
