| Publication | Date of Publication | Type |
|---|
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 |
Logical analysis of data: classification with justification
Annals of Operations Research | 2011-11-17 | Paper |
Optimal sequential inspection policies
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 |
Not complementary connected and not CIS d-graphs form weakly monotone families
Discrete Mathematics | 2010-04-27 | Paper |
Acyclic, or totally tight, two-person game forms: characterization and main properties
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 |
On short paths interdiction problems: Total and node-wise limited interdiction
Theory of Computing Systems | 2008-06-17 | Paper |
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Neighborhood hypergraphs of bipartite graphs
Journal of Graph Theory | 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)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
Generating all vertices of a polyhedron is hard
Discrete & Computational Geometry | 2008-04-16 | Paper |
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On enumerating minimal dicuts and strongly connected subgraphs
Algorithmica | 2008-02-18 | Paper |
Geršgorin variations. III: On a theme of Brualdi and Varga
Linear Algebra and its Applications | 2007-12-14 | Paper |
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Theoretical Computer Science | 2007-09-18 | Paper |
Peter L. Hammer (1936-2006)
4OR | 2007-08-31 | Paper |
Peter Ladislaw Hammer
Discrete Mathematics | 2007-08-23 | Paper |
Peter Ladislaw Hammer (December 23, 1936 to December 27, 2006)
Discrete Applied Mathematics | 2007-07-19 | Paper |
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
Theoretical Computer Science | 2007-07-16 | Paper |
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Discrete Applied Mathematics | 2007-02-19 | Paper |
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Journal of Graph Theory | 2007-02-07 | Paper |
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Discrete Applied Mathematics | 2007-01-09 | Paper |
| Comparison of convex hulls and box hulls. | 2006-11-15 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Perfect graphs, kernels, and cores of cooperative games
Discrete Mathematics | 2006-10-30 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
| Heuristic approaches to the capacitated square covering problem | 2006-02-08 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
On defining sets for projective planes
Discrete Mathematics | 2005-12-29 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
On 3-simplicial vertices in planar graphs
Discussiones Mathematicae Graph Theory | 2005-04-19 | Paper |
Stable matchings in three-sided systems with cyclic preferences
Discrete Mathematics | 2005-02-22 | Paper |
Block linear majorants in quadratic 0--1 optimization
Discrete Applied Mathematics | 2005-01-31 | Paper |
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
Discrete Applied Mathematics | 2004-11-12 | Paper |
Dual-bounded generating problems: Weighted transversals of a hypergraph
Discrete Applied Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2086380 (Why is no real title available?) | 2004-08-11 | Paper |
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Difference graphs
Discrete Mathematics | 2004-02-14 | Paper |
| scientific article; zbMATH DE number 2038737 (Why is no real title available?) | 2004-02-08 | Paper |
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
Mathematical Social Sciences | 2003-12-04 | Paper |
An inequality for polymatroid functions and its applications.
Discrete Applied Mathematics | 2003-10-14 | Paper |
Finding essential attributes from binary data
Annals of Mathematics and Artificial Intelligence | 2003-08-21 | Paper |
On maximal frequent and minimal infrequent sets in binary matrices
Annals of Mathematics and Artificial Intelligence | 2003-08-21 | Paper |
Variations on extending partially defined Boolean functions with missing bits.
Information and Computation | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1929933 (Why is no real title available?) | 2003-06-18 | Paper |
Recursive generation of partitionable graphs
Journal of Graph Theory | 2003-03-19 | Paper |
Covering non-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
On the number of vertices belonging to all maximum stable sets of a graph
Discrete Applied Mathematics | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1759476 (Why is no real title available?) | 2002-11-25 | Paper |
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
SIAM Journal on Computing | 2002-09-29 | Paper |
Pseudo-Boolean optimization
Discrete Applied Mathematics | 2002-09-17 | Paper |
Logical analysis of binary data with missing bits
Artificial Intelligence | 2002-07-24 | Paper |
| scientific article; zbMATH DE number 1754587 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1737291 (Why is no real title available?) | 2002-05-05 | Paper |
Generating dual-bounded hypergraphs
Optimization Methods & Software | 2002-01-01 | Paper |
Minimization of half-products
Mathematics of Operations Research | 2001-11-26 | Paper |
Dual subimplicants of positive Boolean functions
Optimization Methods & Software | 2001-11-16 | Paper |
| scientific article; zbMATH DE number 1670855 (Why is no real title available?) | 2001-11-11 | Paper |
| A satisfiability formulation of problems on level graphs | 2001-09-24 | Paper |
Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
SIAM Journal on Computing | 2001-06-21 | Paper |
Combinatorial problems related to origin-destination matrices.
Discrete Applied Mathematics | 2001-01-01 | Paper |
Boolean Normal Forms, Shellability, and Reliability Computations
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Diagnosing double regular systems
Annals of Mathematics and Artificial Intelligence | 2000-06-07 | Paper |
Stable effectivity functions and perfect graphs
Mathematical Social Sciences | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1286503 (Why is no real title available?) | 1999-08-31 | Paper |
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
Discrete Applied Mathematics | 1999-05-25 | Paper |
Stable families of coalitions and normal hypergraphs
Mathematical Social Sciences | 1999-04-27 | Paper |
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence | 1999-02-02 | Paper |
Maximum renamable Horn sub-CNFs
Discrete Applied Mathematics | 1999-01-01 | Paper |
Error-free and best-fit extensions of partially defined Boolean functions
Information and Computation | 1998-07-27 | Paper |
| scientific article; zbMATH DE number 1104349 (Why is no real title available?) | 1998-05-25 | Paper |
A corrected version of the Duchet kernel conjecture
Discrete Mathematics | 1998-04-08 | Paper |
Polynomial-time inference of all valid implications for Horn and related formulae
Annals of Mathematics and Artificial Intelligence | 1997-12-14 | Paper |
Logical analysis of numerical data
Mathematical Programming. Series A. Series B | 1997-08-28 | Paper |
Powers of circulants in bottleneck algebra
Linear Algebra and its Applications | 1997-08-19 | Paper |
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
SIAM Journal on Computing | 1997-08-03 | Paper |
On perfect \(0,\pm 1\) matrices
Discrete Mathematics | 1997-06-10 | Paper |
On the number of flats spanned by a set of points in \(PG(d,q)\)
Discrete Mathematics | 1997-05-13 | Paper |
Perfect graphs are kernel solvable
Discrete Mathematics | 1997-05-04 | Paper |
Optimality of Nested Partitions and Its Application to Cluster Analysis
SIAM Journal on Optimization | 1997-04-27 | Paper |
Boolean regression
Annals of Operations Research | 1996-05-02 | Paper |
Decomposability of partially defined Boolean functions
Discrete Applied Mathematics | 1996-03-11 | Paper |
Unconstrained multilayer switchbox routing
Annals of Operations Research | 1996-02-01 | Paper |
Recognition of q-Horn formulae in linear time
Discrete Applied Mathematics | 1995-09-10 | Paper |
Predicting Cause-Effect Relationships from Incomplete Discrete Observations
SIAM Journal on Discrete Mathematics | 1994-12-20 | Paper |
A Complexity Index for Satisfiability Problems
SIAM Journal on Computing | 1994-08-16 | Paper |
Balancing problems in acyclic networks
Discrete Applied Mathematics | 1994-06-15 | Paper |
| scientific article; zbMATH DE number 515924 (Why is no real title available?) | 1994-03-10 | Paper |
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
Mathematics of Operations Research | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176260 (Why is no real title available?) | 1993-05-18 | Paper |
Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
SIAM Journal on Discrete Mathematics | 1992-09-27 | Paper |
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
Annals of Operations Research | 1992-06-27 | Paper |
The existence of non-trivial hyperfactorizations of \(K_{2n}\)
Combinatorica | 1992-06-27 | Paper |
On the Existence of a Feasible Flow in a Stochastic Transportation Network
Operations Research | 1992-06-26 | Paper |
Maximal intersecting families and affine regular polygons in PG(2,q)
Journal of Combinatorial Theory. Series A | 1992-06-25 | Paper |
On shift stable hypergraphs
Discrete Mathematics | 1991-01-01 | Paper |
Upper-bounds for quadratic 0-1 maximization
Operations Research Letters | 1990-01-01 | Paper |
On clustering problems with connected optima in Euclidean spaces
Discrete Mathematics | 1989-01-01 | Paper |
On representing Sylvester-Gallai designs
Discrete & Computational Geometry | 1989-01-01 | Paper |
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
Mathematics of Operations Research | 1989-01-01 | Paper |
Probabilistic bounds and algorithms for the maximum satisfiability problem
Annals of Operations Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4054450 (Why is no real title available?) | 1988-01-01 | Paper |
Rectangular dissections of a square
European Journal of Combinatorics | 1988-01-01 | Paper |
Sperner extensions of affine spaces
Geometriae Dedicata | 1987-01-01 | Paper |
On a linear diophantine problem for geometrical type sequences
Discrete Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3976768 (Why is no real title available?) | 1986-01-01 | Paper |
On the complexity of the surrogate dual of 0–1 programming
Zeitschrift für Operations Research | 1986-01-01 | Paper |
On the sharpness of a theorem of B. Segre
Combinatorica | 1986-01-01 | Paper |
A two-stage approach for large-scale sewer systems design with application to the Lake Balaton resort area
European Journal of Operational Research | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3916290 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3916015 (Why is no real title available?) | 1984-01-01 | Paper |
The number of triangles covering the center of an \(n\)-set
Geometriae Dedicata | 1984-01-01 | Paper |
Network flows and non-guillotine cutting patterns
European Journal of Operational Research | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3608712 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3626156 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3674107 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3691360 (Why is no real title available?) | 1977-01-01 | Paper |
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
(available as arXiv preprint) | N/A | Paper |
