Feedback Vertex Set in Mixed Graphs

Finding a Feasible Flow in a Strongly Connected Network

Finding approximate palindromes in strings

Finding Cliques of a Graph using Prime Numbers

Finding Connected Components on Map-reduce in Logarithmic Rounds

Finding Cycles and Trees in Sublinear Time

Finding Dense Subgraphs in G(n,1/2)

Finding Endogenously Formed Communities

Finding heaviest H-subgraphs in real weighted graphs, with applications

Finding Induced Subgraphs via Minimal Triangulations

Finding large and small dense subgraphs

Finding Light Spanners in Bounded Pathwidth Graphs

Finding Matches in Unlabelled Streams

Finding paths of length k in O*(2^k) time

Finding small separators in linear time via treewidth reduction

Finding Small Sparse Cuts Locally by Random Walk

Finding Sparse Cuts Locally Using Evolving Sets

Finding the most biased coin with fewest flips

Finding topological subgraphs is fixed-parameter tractable

Finding total unimodularity in optimization problems solved by linear programs