The following pages link to Peter L. Hammer (Q188437):
Displaying 50 items.
- Maximum weight archipelago subgraph problem (Q490157) (← links)
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589) (← links)
- A new imputation method for incomplete binary data (Q548281) (← links)
- Logical analysis of data: classification with justification (Q646700) (← links)
- Preperfect graphs (Q684406) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Stability in CAN-free graphs (Q762505) (← links)
- A Boolean measure of similarity (Q860381) (← links)
- Pattern-based feature selection in genomics and proteomics (Q863610) (← links)
- Logical analysis of data -- an overview: from combinatorial optimization to medical applications (Q863611) (← links)
- Completely separable graphs (Q908944) (← links)
- Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions (Q967323) (← links)
- (Q1028440) (redirect page) (← links)
- Using a similarity measure for credible classification (Q1028441) (← links)
- Split graphs of Dilworth number 2 (Q1063046) (← links)
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs (Q1063611) (← links)
- The struction of a graph: Application to CN-free graphs (Q1068855) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- On clustering problems with connected optima in Euclidean spaces (Q1116236) (← links)
- Bipartite dimensions and bipartite degrees of graphs (Q1126290) (← links)
- The splittance of a graph (Q1167741) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Horn functions and their DNFs (Q1195858) (← links)
- A note on Hamiltonian split graphs (Q1255969) (← links)
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization (Q1276959) (← links)
- Logical analysis of Chinese labor productivity patterns (Q1290188) (← links)
- On the stability number of claw-free \(P_5\)-free and more general graphs (Q1302154) (← links)
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- On renamable Horn and generalized Horn functions (Q1356207) (← links)
- Matroids arisen from matrogenic graphs (Q1356745) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Logical analysis of numerical data (Q1365054) (← links)
- Horn functions and submodular Boolean functions (Q1392203) (← links)
- A heuristic for Boolean optimization problems (Q1402519) (← links)
- Struction revisited (Q1414580) (← links)
- Convexity and logical analysis of data (Q1575707) (← links)
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions (Q1841879) (← links)
- Disjunctive and conjunctive representations in finite lattices and convexity spaces (Q1850038) (← links)
- The maximum box problem and its application to data analysis (Q1856362) (← links)
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (Q1861918) (← links)
- Coronary risk prediction by logical analysis of data (Q1870368) (← links)
- Pareto-optimal patterns in logical analysis of data (Q1885813) (← links)
- Saturated systems of homogeneous boxes and the logical analysis of numerical data (Q1885814) (← links)
