The following pages link to Jesse T. Geneson (Q1040838):
Displayed 50 items.
- (Q397149) (redirect page) (← links)
- Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs (Q397151) (← links)
- Bounding sequence extremal functions with formations (Q405315) (← links)
- Metric dimension and pattern avoidance in graphs (Q777351) (← links)
- Almost all permutation matrices have bounded saturation functions (Q831345) (← links)
- Extremal functions of forbidden double permutation matrices (Q1040839) (← links)
- Forbidden arithmetic progressions in permutations of subsets of the integers (Q1732783) (← links)
- A note on the price of bandit feedback for mistake-bounded online learning (Q2034409) (← links)
- Extremal results for graphs of bounded metric dimension (Q2065772) (← links)
- Optimizing the trade-off between number of cops and capture time in cops and robbers (Q2073651) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Peripherality in networks: theory and applications (Q2141369) (← links)
- Truncated metric dimension for finite graphs (Q2166223) (← links)
- Constructing sparse Davenport-Schinzel sequences (Q2182209) (← links)
- Sharper bounds and structural results for minimally nonlinear 0-1 matrices (Q2209895) (← links)
- Extremal functions of forbidden multidimensional matrices (Q2404366) (← links)
- Forbidden formations in multidimensional 0-1 matrices (Q2422218) (← links)
- Linear bounds on matrix extremal functions using visibility hypergraphs (Q2515587) (← links)
- A relationship between generalized Davenport-Schinzel sequences and interval chains (Q2517665) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- On k-visibility graphs (Q2941750) (← links)
- Using Markov chains to determine expected propagation time for probabilistic zero forcing (Q3299342) (← links)
- Fixed Points of Competitive Threshold-Linear Networks (Q3379579) (← links)
- A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem (Q4991648) (← links)
- The damage throttling number of a graph (Q5000318) (← links)
- (Q5090528) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← links)
- Skew throttling (Q5139699) (← links)
- (Q5887423) (← links)
- Online learning of smooth functions (Q6057845) (← links)
- Stable fixed points of combinatorial threshold-linear networks (Q6138049) (← links)
- Improved bounds on maximum sets of letters in sequences with forbidden alternations (Q6247740) (← links)
- Sequences of formation width $4$ and alternation length $5$ (Q6259068) (← links)
- Improved lower bounds on extremal functions of multidimensional permutation matrices (Q6263093) (← links)
- Bounding extremal functions of forbidden $0-1$ matrices using $(r,s)$-formations (Q6271660) (← links)
- Asymptotic bounds on renewal process stopping times (Q6273067) (← links)
- Bounds for approximating lower envelopes with polynomials of degree at most $d$ (Q6274289) (← links)
- An anti-incursion algorithm for unknown probabilistic adversaries on connected graphs (Q6281630) (← links)
- Further results on discrete unitary invariance (Q6290378) (← links)
- Variations of the cop and robber game on graphs (Q6293283) (← links)
- Improved lower bound on generalized Erdos-Ginzburg-Ziv constants (Q6294904) (← links)
- Forbidden formations in 0-1 matrices (Q6301559) (← links)
- Intersections, circuits, and colorability of line segments (Q6305689) (← links)
- A note on long rainbow arithmetic progressions (Q6309966) (← links)
- Ramsey numbers of ordered graphs under graph operations (Q6313414) (← links)
- Expected capture time and throttling number for cop versus gambler (Q6314105) (← links)
- Throttling numbers for adversaries on connected graphs (Q6320635) (← links)
- Formations and generalized Davenport-Schinzel sequences (Q6325814) (← links)
- An algorithm for bounding extremal functions of forbidden sequences (Q6330853) (← links)
- Broadcast Dimension of Graphs (Q6340748) (← links)