The following pages link to Endre Boros (Q226794):
Displaying 50 items.
- (Q4370222) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- (Q4449202) (← links)
- Boolean Normal Forms, Shellability, and Reliability Computations (Q4490781) (← links)
- (Q4529572) (← links)
- (Q4535012) (← links)
- (Q4536430) (← links)
- Vector connectivity in graphs (Q4642479) (← links)
- On 3-simplicial vertices in planar graphs (Q4668426) (← links)
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions (Q4697093) (← links)
- (Q4708565) (← links)
- Optimality of Nested Partitions and Its Application to Cluster Analysis (Q4717562) (← links)
- (Q4736834) (← links)
- Recursive generation of partitionable graphs (Q4798118) (← links)
- Vector Connectivity in Graphs (Q4922139) (← links)
- Dual subimplicants of positive Boolean functions (Q4946700) (← links)
- Autarkies and Persistencies for QUBO (Q5050145) (← links)
- Boolean analysis of incomplete examples (Q5054834) (← links)
- Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs (Q5066894) (← links)
- A large‐scale linear programming model for finding optimal container inspection strategies (Q5187940) (← links)
- Algorithms and Computation (Q5191676) (← links)
- Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311106) (← links)
- A polynomial algorithm for balancing acyclic data flow graphs (Q5375371) (← links)
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037) (← links)
- Neighborhood hypergraphs of bipartite graphs (Q5387058) (← links)
- Left-to-Right Multiplication for Monotone Boolean Dualization (Q5390600) (← links)
- Enumerating Spanning and Connected Subsets in Graphs and Matroids (Q5449549) (← links)
- Algorithms – ESA 2004 (Q5464572) (← links)
- On the Complexity of Some Enumeration Problems for Matroids (Q5470804) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492889) (← links)
- Integer Programming and Combinatorial Optimization (Q5712450) (← links)
- Computing and Combinatorics (Q5716999) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- Algorithms - ESA 2003 (Q5897277) (← links)
- Algorithms and Computation (Q5897849) (← links)
- Generating all vertices of a polyhedron is hard (Q5901119) (← links)
- LATIN 2004: Theoretical Informatics (Q5901668) (← links)
- Difference graphs (Q5907056) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Peter Ladislaw Hammer (Q5925274) (← links)
- Combinatorial problems related to origin-destination matrices. (Q5954235) (← links)
- Matroid Horn functions (Q6187338) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
- Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem (Q6512765) (← links)
- Envy-free relaxations for goods, chores, and mixed items (Q6548959) (← links)
- Recognizing distributed approval voting forms and correspondences (Q6573343) (← links)
- Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies (Q6581883) (← links)
- Generating minimal redundant and maximal irredundant subhypergraphs (Q6611070) (← links)
- On Minimal Transversals of Maximal Cliques in Graphs (Q6729141) (← links)
