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

Finger Indexed Sets: New Approaches

Finite Volume Spaces and Sparsification

Fixed Block Compression Boosting in FM-Indexes

Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

Fixed Parameter Tractable Algorithm for Firefighting Problem

Fixed-Parameter Algorithms for Computing Kemeny Scores - Theory and Practice

Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

Fixed-Parameter Complexity of Minimum Profile Problems