The following pages link to Endre Boros (Q226794):
Displaying 50 items.
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- Sprague-Grundy function of symmetric hypergraphs (Q2424909) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← links)
- Geršgorin variations. III: On a theme of Brualdi and Varga (Q2463607) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- On defining sets for projective planes (Q2576848) (← links)
- A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
- Peter L. Hammer (1936-2006) (Q2644371) (← links)
- Unique key Horn functions (Q2672584) (← links)
- Dual-bounded generating problems: Partial and multiple transversals of a hypergraph (Q2719122) (← links)
- A satisfiability formulation of problems on level graphs (Q2741531) (← links)
- (Q2754179) (← links)
- Minimization of half-products (Q2757557) (← links)
- A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games (Q2942443) (← links)
- Markov decision processes and stochastic games with total effective payoff (Q2954987) (← links)
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (Q3012799) (← links)
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities (Q3149887) (← links)
- (Q3368659) (← links)
- (Q3396612) (← links)
- (Q3408846) (← links)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames (Q3503628) (← links)
- On Berge Multiplication for Monotone Boolean Dualization (Q3521907) (← links)
- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information (Q3569829) (← links)
- Generating Minimal k-Vertex Connected Spanning Subgraphs (Q3608847) (← links)
- (Q3614023) (← links)
- (Q3619946) (← links)
- (Q3622253) (← links)
- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (Q3638034) (← links)
- (Q3691417) (← links)
- (Q3691686) (← links)
- On the complexity of the surrogate dual of 0–1 programming (Q3725870) (← links)
- (Q3741409) (← links)
- (Q3790204) (← links)
- 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 (Q3831789) (← links)
- (Q3870914) (← links)
- (Q3885777) (← links)
- On the Existence of a Feasible Flow in a Stochastic Transportation Network (Q3981512) (← links)
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization (Q4012442) (← links)
- (Q4035367) (← links)
- (Q4173889) (← links)
- (Q4188360) (← links)
- On minimal imperfect graphs with circular symmetry (Q4242951) (← links)
- (Q4283436) (← links)
- A Complexity Index for Satisfiability Problems (Q4286227) (← links)
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations (Q4317698) (← links)
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle (Q4337435) (← links)
