Master's theses at the chair i7

Name Submission Examiner Subject
Attila Lischka WS 22/23 Grohe Substructure Counting for Molecular Property Prediction with Neural Networks
Nina Runde WS 22/23 Grohe The Parameterized Complexity of Learning Monadic Second-Order Properties
Amina Khakimova WS 22/23 Grohe Graph Augmentations for Contrasive Learning
Konrad Ostrowski WS 22/23 Löding Comparing Variants of the Passive Learning Algorithm RPNI for Automata on Infinite Words
Abheek Dhingra SS 22 Grohe Ensemble Graph Neural Networks for Constraint Satisfaction Problems
Benedikt Mews SS 22 Grohe Pliability and the Approximability of Maximum Constraint Satisfaction Problems
Lionel Damtev SS 22 Grohe The Computational Power of Transformer Neural Networks
Moritz Rösgen SS 22 Grohe Hierarchical Message Passing for Constraint Satisfaction Problems
Julia Feith SS 22 Grohe Approximate Probabilistic Query Evaluation
Athena Riazsadri WS 21/22 Grohe The Iteration Number of the Weisfeiler-Leman Algorithm
Sebastian Issel WS 21/22 Grohe Variants of the Weisfeiler-Leman Algorithm
Fabian Bender WS 21/22 Grohe The Expressiveness of Convolutions and Random Walks in Graph Learning
Luca Oeljeklaus WS 21/22 Grohe On the Power of the Logarithmic Weisfeiler-Leman Algorithm
Pascal Kühner WS 21/22 Grohe Graph Embeddings based on Homomorphism Counts
Zeno Bitter WS 21/22 Grohe Weisfeiler-Leman invariant subgraph and -relation counts
Louis Härtel SS 21 Grohe Nondeterministic Deep Weisfeiler-Leman
Sebastian Schaub SS 21 Grohe Facility Location and Clustering on Planar and Almost Planar Graphs
Robert Funk SS 21 Löding Simulation Relations for Symbolic Automata
Max Philip Stachon SS 21 Löding Learning and Minimization of omega-Automata in the Presence of Don't Care Words
Erik van Loo WS 20/21 Löding Learning Algorithms for Languages of Infinite Trees
Florian Frantzen WS 20/21 Grohe Connectivity and Routing using Graph Neural Networks
Michael Scholkempber WS 20/21 Grohe Detecting Substructures with Graph Neural Networks
León Bohn SS 20 Löding Simulation Relations for Büchi Automata and their Effect on Determinisation
Stefanie Winkler SS 20 Grohe Graph Autoencoder for Chemical Compounds
Paul Kirchhefer SS 20 Löding Algorithms for the star-height problem for regular languages
Jan Tönshoff WS 19/20 Grohe Unsupervised Machine Learning for Constraint Satisfaction Problems
Jan Uthoff WS 19/20 Löding Comparing different representations of deterministic parity automata
Maximilian Merz WS 19/20 Grohe Algorithms for counting homomorphisms from small treewidth graphs
Paul Yassin Bahloul WS 19/20 Grohe Algorithms for Maximum Matching Width
Marcel Faßbender WS 19/20 Löding Learning Multiplicity Automata in the exact learning model and from shortest counter examples
Christopher Hugenroth SS 19 Löding Separation Problems for Languages of Infinite Words
Andreas Tollkötter SS 18/19 Löding Separation Problems for Languages of Infinite Words
Timo Gervens WS 18/19 Grohe Spectral Graph Similarity
Eva Fluck WS 18/19 Grohe Real-Valued Connectivity Systems
Jan Böker WS 18/19 Grohe Structural Similarity and Homomorphism Counts
Hinrikus Wolf WS 18/19 Grohe Colour Refinement and Fractional Isomorphism on Weighted Structures
Lasse Nitz WS 18/19 Löding Optimizations for the Complementation of Büchi Automata
Christoph Welzel SS 18 Löding Automata-theoretic synthesis for probabilistic environments
Lisa Mannel WS 17/18 Grohe Algorithmic Approaches to Testing Isomorhism of Graphs of bounded treewidth
Patrick Smandzich WS 17/18 Löding Learning Algorithms for Tree Automata
Philipp Niemietz SS 17 Grohe The Complexity of Graph Homomorphism
Christopher Spinrath WS 16/17 Löding Eintscheidungsprobleme für Rationale Relationen über endlichen und unendlichen Wörtern
Martin Ritzert WS 16/17 Grohe PAC-Learning Definable Concepts
Oliver Scheel WS 16/17 Grohe Scheduling mit Verfügbarkeitszeiten und Setupkosten
Jochen Schmücking SS 16 Löding Analyse iterativer Lernverfahren für endliche Automaten
Dirk Hauptmann SS 16 Löding Die Komplexität des Leerheitsproblems für Automaten auf unendlichen Bäumen
Yanfie Wang SS 16 Grohe Explorations of the PATH algorithm
Phillip Keldenich WS 15/16 Grohe Random Robust Graph Isomorphism
Neuen, Daniel WS 15/16 Schweitzer Graph Isomorphism for Geometric Graphs
Tim Adrian Hartmann WS 15/16 Grohe Algorithmen für das Isomorphie-Problem mit Baumweite als Parameter
Gödicke, Maximilian SS 15 Schweitzer The iteration number of the Weisfeiler-Lehman algorithm
Joachim Redies WS 14/15 Grohe Defining PTIME Problems on Planar Graphs