Are link-cut trees ever used in practice, for max flow computation or other applications?
There is a paper titled "Dynamic Trees in Practice" which reviews the practical implementation.

The other categories that Link-Cut tree could be used efficiently is in Database Indexing.
You can find this in the book "Database Index Techniques".