The following pages link to Paul Horn (Q288966):
Displaying 50 items.
- Heteroscedasticity of residuals: a non-parametric alternative to the goldfeld-quandt peak test (Q90723) (← links)
- A probabilistic approach for lateralization of seizure onset zone in drug-resistant epilepsy with bilateral cerebral pathology (Q288967) (← links)
- Edge-disjoint rainbow spanning trees in complete graphs (Q298338) (← links)
- (Q396931) (redirect page) (← links)
- Two layer 3D floor planning (Q396933) (← links)
- (Q405187) (redirect page) (← links)
- Degree Ramsey numbers of closed blowups of trees (Q405189) (← links)
- (Q528549) (redirect page) (← links)
- On the barrier graph of an arrangement of ray sensors (Q528551) (← links)
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (Q742625) (← links)
- Failure and communication in a synchronized multi-drone system (Q831750) (← links)
- An upper bound on the extremal version of Hajnal's triangle-free game (Q897581) (← links)
- A rank-based goodness-of-fit approach to testing for non-additivity in the two-way layout with no replications (Q956931) (← links)
- On the stochastic ordering of absolute univariate Gaussian random variables (Q1105937) (← links)
- Robust prediction intervals in a regression setting (Q1361537) (← links)
- Gaps in the saturation spectrum of trees (Q1630934) (← links)
- A forest building process on simple graphs (Q1686006) (← links)
- Volume doubling, Poincaré inequality and Gaussian heat kernel estimate for non-negatively curved graphs (Q2009893) (← links)
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- On rainbow-cycle-forbidding edge colorings of finite graphs (Q2287749) (← links)
- Routing number of dense and expanding graphs (Q2288017) (← links)
- Li-Yau inequality on graphs (Q2343970) (← links)
- On independent doubly chorded cycles (Q2352072) (← links)
- Independet cycles and chorded cycles in graphs (Q2443439) (← links)
- Stack domination density (Q2637721) (← links)
- Extremal problems on ray sensor configurations (Q2696617) (← links)
- On the principal permanent rank characteristic sequences of graphs and digraphs (Q2813053) (← links)
- Graphs with many strong orientations (Q2813345) (← links)
- A low-end quantile estimator from a right-skewed distribution (Q2815968) (← links)
- Jumps and nonjumps in multigraphs (Q2848552) (← links)
- Giant components in Kronecker graphs (Q2884009) (← links)
- Diameter of random spanning trees in a given graph (Q2891037) (← links)
- Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors (Q2900592) (← links)
- (Q3068986) (← links)
- Distributing Antidote Using PageRank Vectors (Q3071044) (← links)
- A Prediction Interval for M Estimators* (Q3471430) (← links)
- The Giant Component in a Random Subgraph of a Given Graph (Q3601166) (← links)
- A Dynamic Model for On-Line Social Networks (Q3601176) (← links)
- Who's being swindled?: a case for enlightened naivete (Q3756310) (← links)
- Generating subsets of order statistics with applications to trimmed means and means of trimmings (Q3765215) (← links)
- Some results on pooling (Q3792061) (← links)
- A rank-based contingency table approach to testing for equality of treatment-effect patterns for several groups (Q3836403) (← links)
- The finite distribution of <i>t</i> statistics based on two symmetric order statistics as a sum of orthant probabilities (Q3956221) (← links)
- Quasi-nonparametric upper tolerance regions based on the bootstrap (Q4202662) (← links)
- Rainbow spanning trees in complete graphs colored by one‐factorizations (Q4638631) (← links)
- Degree sum and vertex dominating paths (Q4646935) (← links)
- Multiply Chorded Cycles (Q4979831) (← links)
- Multicommodity Allocation for Dynamic Demands Using PageRank Vectors (Q4985348) (← links)
- Independent dominating sets in graphs of girth five (Q4993127) (← links)
