The following pages link to (Q3514516):
Displaying 24 items.
- Semi-supervised learning using ensembles of multiple 1D-embedding-based label boosting (Q2801845) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← links)
- Convex excess in partial cubes (Q2891047) (← links)
- Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
- A combination theorem for combinatorially non-positively curved complexes of hyperbolic groups (Q4958698) (← links)
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes (Q5002757) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism1 (Q5015600) (← links)
- Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry (Q5063338) (← links)
- (Q5091184) (← links)
- (Q5092373) (← links)
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
- Median and injective metric spaces (Q5207971) (← links)
- Dismantlability of weakly systolic complexes and applications (Q5496629) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- Sample Compression Schemes for Balls in Graphs (Q6069434) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Graphs with \(G^p\)-connected medians (Q6120939) (← links)
- The product structure of squaregraphs (Q6143380) (← links)
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs (Q6151151) (← links)
- Graphs with convex balls (Q6163405) (← links)
- \(l_1\)-embeddability of shifted quadrilateral cylinder graphs (Q6184153) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)