Pages that link to "Item:Q5901668"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901668):
Displaying 24 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- A study on monotone self-dual Boolean functions (Q523743) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Asymptotically optimal dualization algorithms (Q2354515) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints (Q4652611) (← links)
- (Q5090998) (← links)
- (Q5150622) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)