Personal Information
Name: Jan Haas M.Sc.
Room: A11.204
Phone: +49 371 531 32141
Email: jan-ingo.haas@informatik.tu-chemnitz.de
Current Students
- Masterarbeit (2026) “A Micro-Frontend-Based Web System for AI-Assisted Academic Learning and Self-Assessment”.
- Masterarbeit (2026) “Resource-Constrained SPARQL Query Generation from Natural Language”.
- Masterarbeit (2026) “Enhancing Reading Comprehension of Academic Texts Using Personalized Reading Profiles”.
- Masterarbeit (2026) “Automated Claim Verification for Knowledge Graph Question Answering”.
Advised Students
- Md. Mehedee Zaman Khan: Masterarbeit (2026) “NLP-Based Automation of Systematic Literature Reviews in Computer Science (focus on conduction phase)”.
- Mishbahul Haque: Masterarbeit (2026) “NLP-Based Automation of Systematic Literature Reviews in Computer Science (focus on preparation phase)”.
- Kanika Shah: Masterarbeit (2025) “Optimizing Data Integration and Visualization in Heterogeneous, Distributed Environments”.
- Dharam Mukeshbhai Dhameliya: Masterarbeit (2025) “Development of Real-Time and Historical Data Visualization and Configuration Tool for ROS2 Topics and ETAS Measurement Devices”.
- Artur Vashchenkov: Masterarbeit (2025) “Context‑Aware Caching for Long‑Form User-Assistant Dialogues in Distributed Systems”.
- Sandra Schaftner: Masterarbeit (2025) “Automatic Construction of Scholarly Knowledge Graphs Using Large Language Models”.
- Hongru Ren: Masterarbeit (2024) “Web Of Things Interface Creation of IoT Devices”.
- Upendra Prasad Yadav: Masterarbeit (2024) “Automated Metadata Annotation of Research Data with Homonym Disambiguation”.
- Hovhannes Mkoyan: Masterarbeit (2024) “Exploring Approaches for Large File Uploads in the Web-Browser Context”.
- Christian Graf: Masterarbeit (2024) “Generische beschleunigte Plattform für Bildverarbeitung”.
- Daria Riakina: Masterarbeit (2024) “Knowledge-Graph Based Approaches for Reducing Hallucinations in Large Language Models”.
- Nisanthan Kathirkamanathan: Masterarbeit (2024) “Comparsion of vector indexing algorithms”.