| Publication | Date of Publication | Type |
|---|
| Hypergraph Horn functions | 2024-05-08 | Paper |
| Matroid Horn functions | 2024-01-15 | Paper |
| Computing Remoteness Functions of Moore, Wythoff, and Euclid's games | 2023-11-05 | Paper |
| Boolean analysis of incomplete examples | 2022-12-09 | Paper |
| Autarkies and Persistencies for QUBO | 2022-11-15 | Paper |
| Unique key Horn functions | 2022-06-13 | Paper |
| Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs | 2022-03-31 | Paper |
| Approximating Minimum Representations of Key Horn Functions | 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} | 2021-09-24 | Paper |
| Generating clause sequences of a CNF formula | 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 | 2020-03-24 | Paper |
| Sprague-Grundy function of matroids and related hypergraphs | 2019-11-13 | Paper |
| Decomposing 1-Sperner hypergraphs | 2019-08-05 | Paper |
| On graphs whose maximal cliques and stable sets intersect | 2019-07-25 | Paper |
| Sprague-Grundy function of symmetric hypergraphs | 2019-06-25 | Paper |
| A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions | 2019-05-29 | Paper |
| Separable discrete functions: recognition and sufficient conditions | 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 | 2019-01-11 | Paper |
| A polynomial algorithm for balancing acyclic data flow graphs | 2018-09-14 | Paper |
| A potential reduction algorithm for two-person zero-sum mean payoff stochastic games | 2018-06-05 | Paper |
| A three-person deterministic graphical game without Nash equilibria | 2018-05-24 | Paper |
| Vector connectivity in graphs | 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} | 2018-03-21 | Paper |
| A convex programming-based algorithm for mean payoff stochastic games with perfect information | 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 | 2017-04-27 | Paper |
| A nested family of \(k\)-total effective rewards for positional games | 2017-04-12 | Paper |
| Quadratic reformulations of nonlinear binary optimization problems | 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 | 2016-11-24 | Paper |
| Equistarable bipartite graphs | 2016-04-27 | Paper |
| Quadratization of symmetric pseudo-Boolean functions | 2016-03-18 | Paper |
| A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games | 2015-09-11 | Paper |
| Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games | 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 | 2015-04-24 | Paper |
| Hardness results for approximate pure Horn CNF formulae minimization | 2015-02-05 | Paper |
| Chess-like games may have no uniform Nash equilibria even in mixed strategies | 2014-09-30 | Paper |
| On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness | 2014-05-14 | Paper |
| On CIS circulants | 2014-01-27 | Paper |
| A decomposition method for CNF minimality proofs | 2014-01-13 | Paper |
| A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory | 2013-11-11 | Paper |
| On canonical forms for zero-sum stochastic mean payoff games | 2013-09-16 | Paper |
| A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions | 2013-08-06 | Paper |
| Vector Connectivity in Graphs | 2013-05-28 | Paper |
| A subclass of Horn CNFs optimally compressible in polynomial time | 2012-12-07 | Paper |
| On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games | 2012-04-13 | Paper |
| Total tightness implies Nash-solvability for three-person game forms | 2012-03-29 | Paper |
| Optimal sequential inspection policies | 2011-11-17 | Paper |
| Logical analysis of data: classification with justification | 2011-11-17 | Paper |
| The negative cycles polyhedron and hardness of checking some polyhedral properties | 2011-11-17 | Paper |
| Nash-solvable two-person symmetric cycle game forms | 2011-10-27 | Paper |
| Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes | 2011-07-06 | Paper |
| Left-to-Right Multiplication for Monotone Boolean Dualization | 2011-04-04 | Paper |
| Friendship two-graphs | 2010-11-12 | Paper |
| Generating all vertices of a polyhedron is hard | 2010-08-16 | Paper |
| A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information | 2010-06-22 | Paper |
| Exclusive and essential sets of implicates of Boolean functions | 2010-05-05 | Paper |
| Acyclic, or totally tight, two-person game forms: characterization and main properties | 2010-04-27 | Paper |
| Not complementary connected and not CIS \(d\)-graphs form weakly monotone families | 2010-04-27 | Paper |
| On effectivity functions of game forms | 2010-03-10 | Paper |
| A large‐scale linear programming model for finding optimal container inspection strategies | 2010-03-09 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| A global parallel algorithm for the hypergraph transversal problem | 2010-01-29 | Paper |
| Minimal and locally minimal games and game forms | 2009-12-10 | Paper |
| Vertex- and edge-minimal and locally minimal graphs | 2009-12-09 | Paper |
| A note on ``optimal resource allocation for security in reliability systems | 2009-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396612 | 2009-09-19 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| A Fast and Simple Parallel Algorithm for the Monotone Duality Problem | 2009-07-14 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3622253 | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619946 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3614023 | 2009-03-16 | Paper |
| Generating Minimal k-Vertex Connected Spanning Subgraphs | 2009-03-06 | Paper |
| Generating 3-vertex connected spanning subgraphs | 2009-01-28 | Paper |
| A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) | 2008-10-29 | Paper |
| Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions | 2008-09-10 | Paper |
| Scientific contributions of Leo Khachiyan (a short overview) | 2008-09-10 | Paper |
| Scheduling vessels and container-yard operations with conflicting objectives | 2008-09-03 | Paper |
| On Berge Multiplication for Monotone Boolean Dualization | 2008-08-28 | Paper |
| Generating cut conjunctions in graphs and related problems | 2008-07-01 | Paper |
| On short paths interdiction problems: Total and node-wise limited interdiction | 2008-06-17 | Paper |
| A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames | 2008-06-05 | Paper |
| Neighborhood hypergraphs of bipartite graphs | 2008-05-14 | Paper |
| ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) | 2008-04-29 | Paper |
| Generating all vertices of a polyhedron is hard | 2008-04-16 | Paper |
| Enumerating Spanning and Connected Subsets in Graphs and Matroids | 2008-03-11 | Paper |
| On enumerating minimal dicuts and strongly connected subgraphs | 2008-02-18 | Paper |
| Geršgorin variations. III: On a theme of Brualdi and Varga | 2007-12-14 | Paper |
| On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs | 2007-09-18 | Paper |
| Peter L. Hammer (1936-2006) | 2007-08-31 | Paper |
| Peter Ladislaw Hammer | 2007-08-23 | Paper |
| Peter Ladislaw Hammer (December 23, 1936 to December 27, 2006) | 2007-07-19 | Paper |
| Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data | 2007-07-16 | Paper |
| Enumerating disjunctions and conjunctions of paths and cuts in reliability theory | 2007-02-19 | Paper |
| Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms | 2007-02-07 | Paper |
| An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation | 2007-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3408846 | 2006-11-15 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Perfect graphs, kernels, and cores of cooperative games | 2006-10-30 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| On the Complexity of Some Enumeration Problems for Matroids | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3368659 | 2006-02-08 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| On defining sets for projective planes | 2005-12-29 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| On 3-simplicial vertices in planar graphs | 2005-04-19 | Paper |
| Stable matchings in three-sided systems with cyclic preferences | 2005-02-22 | Paper |
| Block linear majorants in quadratic 0--1 optimization | 2005-01-31 | Paper |
| Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis | 2004-11-12 | Paper |
| Dual-bounded generating problems: Weighted transversals of a hypergraph | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736834 | 2004-08-11 | Paper |
| Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices | 2004-03-11 | Paper |
| Difference graphs | 2004-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449202 | 2004-02-08 | Paper |
| On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. | 2003-12-04 | Paper |
| An inequality for polymatroid functions and its applications. | 2003-10-14 | Paper |
| On maximal frequent and minimal infrequent sets in binary matrices | 2003-08-21 | Paper |
| Finding essential attributes from binary data | 2003-08-21 | Paper |
| Variations on extending partially defined Boolean functions with missing bits. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708565 | 2003-06-18 | Paper |
| Recursive generation of partitionable graphs | 2003-03-19 | Paper |
| Covering non-uniform hypergraphs | 2002-12-10 | Paper |
| On the number of vertices belonging to all maximum stable sets of a graph | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536430 | 2002-11-25 | Paper |
| Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities | 2002-09-29 | Paper |
| Pseudo-Boolean optimization | 2002-09-17 | Paper |
| Logical analysis of binary data with missing bits | 2002-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535012 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529572 | 2002-05-05 | Paper |
| Generating dual-bounded hypergraphs | 2002-01-01 | Paper |
| Minimization of Half-Products | 2001-11-26 | Paper |
| Dual subimplicants of positive Boolean functions | 2001-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754179 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741531 | 2001-09-24 | Paper |
| Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph | 2001-06-21 | Paper |
| Combinatorial problems related to origin-destination matrices. | 2001-01-01 | Paper |
| Boolean Normal Forms, Shellability, and Reliability Computations | 2000-07-20 | Paper |
| Diagnosing double regular systems | 2000-06-07 | Paper |
| Stable effectivity functions and perfect graphs | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242951 | 1999-08-31 | Paper |
| Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization | 1999-05-25 | Paper |
| Stable families of coalitions and normal hypergraphs | 1999-04-27 | Paper |
| Horn minimization by iterative decomposition | 1999-02-02 | Paper |
| Maximum renamable Horn sub-CNFs | 1999-01-01 | Paper |
| Error-free and best-fit extensions of partially defined Boolean functions | 1998-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370222 | 1998-05-25 | Paper |
| A corrected version of the Duchet kernel conjecture | 1998-04-08 | Paper |
| Polynomial-time inference of all valid implications for Horn and related formulae | 1997-12-14 | Paper |
| Logical analysis of numerical data | 1997-08-28 | Paper |
| Powers of circulants in bottleneck algebra | 1997-08-19 | Paper |
| Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle | 1997-08-03 | Paper |
| On perfect \(0,\pm 1\) matrices | 1997-06-10 | Paper |
| On the number of flats spanned by a set of points in \(PG(d,q)\) | 1997-05-13 | Paper |
| Perfect graphs are kernel solvable | 1997-05-04 | Paper |
| Optimality of Nested Partitions and Its Application to Cluster Analysis | 1997-04-27 | Paper |
| Boolean regression | 1996-05-02 | Paper |
| Decomposability of partially defined Boolean functions | 1996-03-11 | Paper |
| Unconstrained multilayer switchbox routing | 1996-02-01 | Paper |
| Recognition of \(q\)-Horn formulae in linear time | 1995-09-10 | Paper |
| Predicting Cause-Effect Relationships from Incomplete Discrete Observations | 1994-12-20 | Paper |
| A Complexity Index for Satisfiability Problems | 1994-08-16 | Paper |
| Balancing problems in acyclic networks | 1994-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283436 | 1994-03-10 | Paper |
| Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035367 | 1993-05-18 | Paper |
| Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization | 1992-09-27 | Paper |
| The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds | 1992-06-27 | Paper |
| The existence of non-trivial hyperfactorizations of \(K_{2n}\) | 1992-06-27 | Paper |
| On the Existence of a Feasible Flow in a Stochastic Transportation Network | 1992-06-26 | Paper |
| Maximal intersecting families and affine regular polygons in \(PG(2,q)\) | 1992-06-25 | Paper |
| On shift stable hypergraphs | 1991-01-01 | Paper |
| Upper-bounds for quadratic 0-1 maximization | 1990-01-01 | Paper |
| On representing Sylvester-Gallai designs | 1989-01-01 | Paper |
| Probabilistic bounds and algorithms for the maximum satisfiability problem | 1989-01-01 | Paper |
| On clustering problems with connected optima in Euclidean spaces | 1989-01-01 | Paper |
| Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur | 1989-01-01 | Paper |
| Rectangular dissections of a square | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790204 | 1988-01-01 | Paper |
| Sperner extensions of affine spaces | 1987-01-01 | Paper |
| On a linear diophantine problem for geometrical type sequences | 1987-01-01 | Paper |
| A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area | 1986-01-01 | Paper |
| On the sharpness of a theorem of B. Segre | 1986-01-01 | Paper |
| On the complexity of the surrogate dual of 0–1 programming | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741409 | 1986-01-01 | Paper |
| Network flows and non-guillotine cutting patterns | 1984-01-01 | Paper |
| The number of triangles covering the center of an \(n\)-set | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691417 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691686 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4173889 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4188360 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870914 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885777 | 1977-01-01 | Paper |
| On the Sprague-Grundy function of compound games | 0001-01-03 | Paper |
| Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem | 0001-01-03 | Paper |
