Hagen Völzer

dblp:10/3990 · DBLP profile ↗
← Back
10ranked-venue papers in the field
2as first author
3since 2021 · last 2026
0000-0003-3547-3847ORCID · verified

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 5Business Process & Enterprise Data · 3 (1 first)Data Mining & Knowledge Discovery · 1Other / Interdisciplinary · 1 (1 first)
YearPublicationVenuePosition
2026 Evaluation of an Architecture for an LLM-Based Analytics System for Exploratory Process Mining
Timothy Sulzer, Hagen Völzer, Barbara Weber
CAiSE (2)2
2023 Supporting Provenance and Data Awareness in Exploratory Process Mining
Francesca Zerbato, Andrea Burattin, Hagen Völzer, Paul Nelson Becker, Elia Boscaini, Barbara Weber
CAiSE3
2023 A Fresh Approach to Analyze Process Outcomes
abstract
We propose a set of techniques to analyze final or intermediate process outcomes. The main novelties are (i) outcome flow diagrams - a visualization of a process as a sequence of global decisions and their contribution to the process outcomes, and (ii) an interactive method to find explanations for process outcomes. We demonstrate the effectiveness of our techniques in the context of an in-depth study on the Road Traffic Fine Management event log, for which we obtain so far undocumented insights.
Hagen Völzer, Francesca Zerbato, Timothy Sulzer, Barbara Weber
ICPM1
2018 Dynamic skipping and blocking, dead path elimination for cyclic workflows, and a local semantics for inclusive gateways
Dirk Fahland, Hagen Völzer
Inf. Syst.2
2016 Preface to BPM 2014
Mathias Weske, Shazia Sadiq, Pnina Soffer, Hagen Völzer
Inf. Syst.4
2015 Multi-View Incident Ticket Clustering for Optimal Ticket Dispatching
abstract
We present a novel technique that optimizes the dispatching of incident tickets to the agents in an IT Service Support Environment. Unlike the common skill-based dispatching, our approach also takes empirical evidence on the agent's speed from historical data into account. Our solution consists of two parts. First, a novel technique clusters historic tickets into incident categories that are discriminative in terms of agent's performance. Second, a dispatching policy selects, for an incoming ticket, the fastest available agent according to the target cluster. We show that, for ticket data collected from several Service Delivery Units, our new dispatching technique can reduce service time between $35\%$ and $44\%$.
Mirela Botezatu, Jasmina Bogojeska, Ioana Giurgiu, Hagen Völzer, Dorothea Wiesmann
KDD4
2015 The relationship between workflow graphs and free-choice workflow nets
Cédric Favre, Dirk Fahland, Hagen Völzer
Inf. Syst.3
2011 Analysis on demand: Instantaneous soundness checking of industrial business process models
Dirk Fahland, Cédric Favre, Jana Koehler, Niels Lohmann, Hagen Völzer, Karsten Wolf
Data Knowl. Eng.5
2009 The refined process structure tree
Jussi Vanhatalo, Hagen Völzer, Jana Koehler
Data Knowl. Eng.2
2004 A constructive proof for FLP
Hagen Völzer
Inf. Process. Lett.1