Constraint-based notations aim to model processes by capturing their underlying rules instead of a limited number of potential process flows, leaving maximum flexibility for the actor to choose the best-suited order of execution for a particular process instance. Dynamic Condition Response (DCR) graphs are a constraint-based notation that has seen significant industrial adoption. In recent years there have been made significant inroads into the development of process mining algorithms and techniques for DCR Graphs. In this paper, accompanying the keynote of the same name delivered at the workshop Algorithms & Theories for the Analysis of Event Data, we discuss some of these recent advances in process mining with DCR Graphs and conclude by identifying a number of open challenges for DCR-based process mining.