| Publication | Date of Publication | Type |
|---|
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
(available as arXiv preprint) | N/A | Paper |
Incompatibility graphs in data mining
Top | 2026-09-23 | Paper |
Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions (edit)
Mathematics of Operations Research | 2026-03-20 | Paper |
Markov decision processes and stochastic games with total effective payoff
Annals of Operations Research | 2025-12-19 | Paper |
Conformality of minimal transversals of maximal cliques
Discrete Mathematics | 2025-09-16 | Paper |
Conformal hypergraphs: duality and implications for the upper clique transversal problem
Journal of Graph Theory | 2025-07-08 | Paper |
Computing remoteness functions of Moore, Wythoff, and Euclid's games
International Journal of Game Theory | 2025-01-30 | Paper |
Impartial games with decreasing Sprague-Grundy function and their hypergraph compound
International Journal of Game Theory | 2025-01-30 | Paper |
Generating minimal redundant and maximal irredundant subhypergraphs
Discrete Applied Mathematics | 2024-09-26 | Paper |
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
International Journal of Game Theory | 2024-08-01 | Paper |
Recognizing distributed approval voting forms and correspondences
Annals of Operations Research | 2024-07-16 | Paper |
Envy-free relaxations for goods, chores, and mixed items
Theoretical Computer Science | 2024-06-03 | Paper |
Hypergraph Horn functions
SIAM Journal on Discrete Mathematics | 2024-05-08 | Paper |
Matroid Horn functions
Journal of Combinatorial Theory. Series A | 2024-01-15 | Paper |
| Computing Remoteness Functions of Moore, Wythoff, and Euclid's games | 2023-11-05 | Paper |
Boolean analysis of incomplete examples
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Autarkies and Persistencies for QUBO
The Quadratic Unconstrained Binary Optimization Problem | 2022-11-15 | Paper |
Unique key Horn functions
Theoretical Computer Science | 2022-06-13 | Paper |
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
Journal of Graph Theory | 2022-03-31 | Paper |
Approximating minimum representations of key Horn functions
SIAM Journal on Computing | 2022-03-11 | Paper |
| Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions | 2021-10-20 | Paper |
On the Sprague-Grundy function of extensions of proper \textsc{nim}
International Journal of Game Theory | 2021-09-24 | Paper |
Generating clause sequences of a CNF formula
Theoretical Computer Science | 2021-01-19 | Paper |
| Recognizing distributed approval voting forms and correspondences | 2020-10-29 | Paper |
| On the degree sequences of dual graphs on surfaces | 2020-08-02 | Paper |
Compact quadratizations for pseudo-Boolean functions
Journal of Combinatorial Optimization | 2020-03-24 | Paper |
Sprague-Grundy function of matroids and related hypergraphs
Theoretical Computer Science | 2019-11-13 | Paper |
Decomposing 1-Sperner hypergraphs
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Decomposing 1-Sperner hypergraphs
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
| On graphs whose maximal cliques and stable sets intersect | 2019-07-25 | Paper |
Sprague-Grundy function of symmetric hypergraphs
Journal of Combinatorial Theory. Series A | 2019-06-25 | Paper |
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
Information and Computation | 2019-05-29 | Paper |
Separable discrete functions: recognition and sufficient conditions
Discrete Mathematics | 2019-03-25 | Paper |
| On the Sprague-Grundy function of compound games | 2019-03-19 | Paper |
Approximation schemes for stochastic mean payoff games with perfect information and few random positions
Algorithmica | 2019-01-11 | Paper |
A polynomial algorithm for balancing acyclic data flow graphs
IEEE Transactions on Computers | 2018-09-14 | Paper |
A potential reduction algorithm for two-person zero-sum mean payoff stochastic games
Dynamic Games and Applications | 2018-06-05 | Paper |
A three-person deterministic graphical game without Nash equilibria
Discrete Applied Mathematics | 2018-05-24 | Paper |
Vector connectivity in graphs
Networks | 2018-05-23 | Paper |
| Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs | 2018-05-09 | Paper |
On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
Discrete Applied Mathematics | 2018-03-21 | Paper |
A convex programming-based algorithm for mean payoff stochastic games with perfect information
Optimization Letters | 2017-12-15 | Paper |
| Strong duality in Horn minimization | 2017-11-22 | Paper |
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames
International Journal of Game Theory | 2017-04-27 | Paper |
A nested family of k-total effective rewards for positional games
International Journal of Game Theory | 2017-04-12 | Paper |
Quadratic reformulations of nonlinear binary optimization problems
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
| Markov decision processes and stochastic games with total effective payoff | 2017-01-24 | Paper |
| Tetris Hypergraphs and Combinations of Impartial Games | 2017-01-10 | Paper |
On equistable, split, CIS, and related classes of graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Equistarable bipartite graphs
Discrete Mathematics | 2016-04-27 | Paper |
Quadratization of symmetric pseudo-Boolean functions
Discrete Applied Mathematics | 2016-03-18 | Paper |
A potential reduction algorithm for ergodic two-person zero-sum limiting average payoff stochastic games
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
Discrete Mathematics | 2015-08-05 | Paper |
| On the Sprague-Grundy Function of Tetris Extensions of Proper {\sc Nim} | 2015-04-27 | Paper |
Polynomially computable bounds for the probability of the union of events
Mathematics of Operations Research | 2015-04-24 | Paper |
Hardness results for approximate pure Horn CNF formulae minimization
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
Chess-like games may have no uniform Nash equilibria even in mixed strategies
Game Theory | 2014-09-30 | Paper |
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
Operations Research Letters | 2014-05-14 | Paper |
On CIS circulants
Discrete Mathematics | 2014-01-27 | Paper |
A decomposition method for CNF minimality proofs
Theoretical Computer Science | 2014-01-13 | Paper |
A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
International Journal of Game Theory | 2013-11-11 | Paper |
On canonical forms for zero-sum stochastic mean payoff games
Dynamic Games and Applications | 2013-09-16 | Paper |
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Vector connectivity in graphs
Lecture Notes in Computer Science | 2013-05-28 | Paper |
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence | 2012-12-07 | Paper |
On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
Discrete Mathematics | 2012-04-13 | Paper |
Total tightness implies Nash-solvability for three-person game forms
Discrete Mathematics | 2012-03-29 | Paper |
Optimal sequential inspection policies
Annals of Operations Research | 2011-11-17 | Paper |
Logical analysis of data: classification with justification
Annals of Operations Research | 2011-11-17 | Paper |
The negative cycles polyhedron and hardness of checking some polyhedral properties
Annals of Operations Research | 2011-11-17 | Paper |
Nash-solvable two-person symmetric cycle game forms
Discrete Applied Mathematics | 2011-10-27 | Paper |
Stochastic mean payoff games: smoothed analysis and approximation schemes
Automata, Languages and Programming | 2011-07-06 | Paper |
Left-to-right multiplication for monotone Boolean dualization
SIAM Journal on Computing | 2011-04-04 | Paper |
Friendship two-graphs
Graphs and Combinatorics | 2010-11-12 | Paper |
Generating all vertices of a polyhedron is hard
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics | 2010-05-05 | Paper |
Acyclic, or totally tight, two-person game forms: characterization and main properties
Discrete Mathematics | 2010-04-27 | Paper |
Not complementary connected and not CIS d-graphs form weakly monotone families
Discrete Mathematics | 2010-04-27 | Paper |
On effectivity functions of game forms
Games and Economic Behavior | 2010-03-10 | Paper |
A large-scale linear programming model for finding optimal container inspection strategies
Naval Research Logistics | 2010-03-09 | Paper |
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters | 2010-01-29 | Paper |
Minimal and locally minimal games and game forms
Discrete Mathematics | 2009-12-10 | Paper |
Vertex- and edge-minimal and locally minimal graphs
Discrete Mathematics | 2009-12-09 | Paper |
A note on ``optimal resource allocation for security in reliability systems''
European Journal of Operational Research | 2009-12-07 | Paper |
| scientific article; zbMATH DE number 5605114 (Why is no real title available?) | 2009-09-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
Automata, Languages and Programming | 2009-07-14 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
| scientific article; zbMATH DE number 5548206 (Why is no real title available?) | 2009-04-28 | Paper |
| Generating all vertices of a polyhedron is hard | 2009-04-14 | Paper |
| On split and almost CIS-graphs | 2009-03-16 | Paper |
Generating Minimal k-Vertex Connected Spanning Subgraphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Generating 3-vertex connected spanning subgraphs
Discrete Mathematics | 2009-01-28 | Paper |
A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Discrete Optimization | 2008-10-29 | Paper |
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
Discrete Applied Mathematics | 2008-09-10 | Paper |
Scientific contributions of Leo Khachiyan (a short overview)
Discrete Applied Mathematics | 2008-09-10 | Paper |
Scheduling vessels and container-yard operations with conflicting objectives
Annals of Operations Research | 2008-09-03 | Paper |
On Berge Multiplication for Monotone Boolean Dualization
Automata, Languages and Programming | 2008-08-28 | Paper |
Generating cut conjunctions in graphs and related problems
Algorithmica | 2008-07-01 | Paper |
