Finding an Unknown Acyclic Orientation of a Given Graph

Finding bipartite subgraphs efficiently

Finding cores of random 2-SAT formulae via Poisson cloning

Finding Descriptions of Polytopes via Extended Formulations and Liftings

Finding Hidden Cliques in Linear Time with High Probability

Finding Large Monochromatic Diameter Two Subgraphs

Finding many D-optimal designs by randomised decomposition and switching

Finding regular insertion encodings for permutation classes

Finding Short Cycles in an Embedded Graph in Polynomial Time

Fine-Wilf graphs and the generalized Fine-Wilf theorem

Finite Analogs of Szemerédi's Theorem

Finite automata and pattern avoidance in words

Finite canonization

Finite connectivity in infinite matroids

Finite Eulerian posets which are binomial, Sheffer or triangular

Finite Form of the Quintuple Product Identity

Finite Gelfand Pair Approaches for Ehrenfest Diffusion Model

Finite Implication Algebras

Finite irreflexive homomorphism-homogeneous binary relational systems

Finite metric spaces--combinatorics, geometry and algorithms