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

scientific article

A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games

article by Endre Boros et al published 2014 in Lecture Notes in Computer Science

A decomposition method for CNF minimality proofs

scientific article published in October 2013

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

A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron–Frobenius theory

A subclass of Horn CNFs optimally compressible in polynomial time

scientific article published in December 2009

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

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

Balancing problems in acyclic networks

Boolean Normal Forms, Shellability, and Reliability Computations

Capturing human intelligence in the net

scientific article published in August 2000

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

scientific article published in 1989

Combinatorial problems related to origin–destination matrices

Decomposability of partially defined Boolean functions

Dual subimplicants of positive Boolean functions

Equistarable bipartite graphs

Exclusive and essential sets of implicates of Boolean functions

scientific article published in January 2010

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

Generating All Vertices of a Polyhedron Is Hard

Generating Cut Conjunctions in Graphs and Related Problems

Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections

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

Generating dual-bounded hypergraphs

Left-to-Right Multiplication for Monotone Boolean Dualization

Logical analysis of binary data with missing bits

article

Logical analysis of data: classification with justification

article

Logical analysis of numerical data

article

Nash-solvable two-person symmetric cycle game forms

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

On CIS circulants

On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n -person games

On clustering problems with connected optima in euclidean spaces

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

On effectivity functions of game forms

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

On perfect 0, ± 1 matrices

Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization

Perfect graphs are kernel solvable

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

Preface

Quadratic reformulations of nonlinear binary optimization problems

Quadratization of symmetric pseudo-Boolean functions

Recognition of q-Horn formulae in linear time

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

Stable matchings in three-sided systems with cyclic preferences

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $$2 \times 2$$ 2 × 2 subgames

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

The negative cycles polyhedron and hardness of checking some polyhedral properties

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

Variations on extending partially defined Boolean functions with missing bits

Vertex- and edge-minimal and locally minimal graphs