default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher T. Schwanen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c10]Christopher T. Schwanen
, Wied Pakusa, Wil M. P. van der Aalst:
Coming Home for Blocking Transitions Fast. PETRI NETS 2026: 289-311- [c9]Bianka Bakullari, Alessandro Berti, Harry H. Beyel, Tobias Brockhoff, Eduardo Goulart Rocha, Nina Graves, Hannes Häfke, Tsung-Hao Huang, Benedikt Knopp, István Koren, Humam Kourani, Aaron Küsters, Chiao-Yun Li, Lukas Liss, Lisa Luise Mannel, Jan Niklas Adams, Ali Norouzifar, Gyunam Park, Viki Peeva, Marco Pegoraro, Cameron Pitsch, Mahsa Pourbafrani, Majid Rafiei, Christian Rennert, Daniel Schuster, Christopher T. Schwanen, Leah Tacke genannt Unterberg, Merih Seran Uysal, Miriam Wagner, Sebastiaan J. van Zelst:
A Brief History and Overview of the Chair of Process and Data Science (PADS). Mining a Scientist's Process 2026: 15-29 - [c8]Christopher T. Schwanen, Wied Pakusa:
On Free Choice and Wil(l): From Petri Net Theory to Process Mining. Mining a Scientist's Process 2026: 298-311 - [i3]Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst:
Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets. CoRR abs/2602.02447 (2026) - [i2]Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst:
Computational Complexity of Alignments. CoRR abs/2603.05331 (2026) - 2025
- [c7]Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst:
Alignments meet Linear Algebra. PNSE/ATAED/PeNGE@PETRI NETS 2025: 185-200 - [c6]Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst:
Deciding (Sub-Marking) Reachability in ±b O(P2 + T2) for Sound Acyclic Free-Choice Workflow Nets. Petri Nets 2025: 366-387 - [c5]Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst:
Complexity of Alignments on Sound Free-Choice Workflow Nets. Petri Nets 2025: 388-410 - [c4]Harry H. Beyel, Christopher T. Schwanen, Wil M. P. van der Aalst:
Translucent Alignments. CAiSE (2) 2025: 167-184 - [d1]Harry H. Beyel, Christopher T. Schwanen, Wil M. P. van der Aalst:
Data for "Translucent Alignments". Zenodo, 2025
- 2024
- [c3]Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst:
Process Tree Alignments. EDOC 2024: 300-317 - [c2]Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst:
A Dynamic Programming Approach for Alignments on Process Trees. ICPM Workshops 2024: 84-97 - [i1]Alessandro Berti, István Koren, Jan Niklas Adams, Gyunam Park, Benedikt Knopp, Nina Graves, Majid Rafiei, Lukas Liß, Leah Tacke genannt Unterberg, Yisong Zhang, Christopher T. Schwanen, Marco Pegoraro, Wil M. P. van der Aalst:
OCEL (Object-Centric Event Log) 2.0 Specification. CoRR abs/2403.01975 (2024) - 2023
- [c1]Felix Mannhardt, Sander J. J. Leemans, Christopher T. Schwanen, Massimiliano de Leoni:
Modelling Data-Aware Stochastic Processes - Discovery and Conformance Checking. Petri Nets 2023: 77-98
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-12 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
