{"id":10383,"date":"2025-11-07T15:45:12","date_gmt":"2025-11-07T14:45:12","guid":{"rendered":"https:\/\/www.kde.cs.uni-kassel.de\/?page_id=10383"},"modified":"2026-09-11T15:17:11","modified_gmt":"2026-09-11T13:17:11","slug":"noehre","status":"publish","type":"page","link":"https:\/\/www.kde.cs.uni-kassel.de\/en\/noehre","title":{"rendered":"Marcel N\u00f6hre"},"content":{"rendered":"<div id=\"trailimageid\"><img decoding=\"async\" id=\"ttimg\" src=\"https:\/\/www.kde.cs.uni-kassel.de\/wp-content\/plugins\/bibsonomy-csl\/img\/loading.gif\"><\/div> <div style=\"display: flex; flex-wrap: wrap; justify-content: space-between; gap: 20px; align-items: flex-start;\">\n  <div style=\"flex: 1 1 250px; min-width: 0;\">\n    <p><strong>Marcel N\u00f6hre<\/strong><\/p>\n    <p>\n      <a href=\"https:\/\/map.uni-kassel.de\/?p=1&amp;b=79&amp;f=181&amp;l=31503&amp;lang=de&amp;search_text=0440\"><span>Raum 0440<\/span><\/a><br \/>\n      <a href=\"https:\/\/www.uni-kassel.de\/uni\/\">Universit\u00e4t Kassel<\/a><br \/>\n      <a href=\"https:\/\/www.uni-kassel.de\/eecs\/\">Fachbereich Elektrotechnik\/Informatik<\/a><br \/>\n      <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/\">Fachgebiet Wissensverarbeitung<\/a><br \/>\n      <span>Wilhelmsh\u00f6her Allee 73<\/span><br \/>\n      <span>34121 Kassel<\/span><br \/>\n      <span>Tel.: +49 561 804-6253<\/span><br \/>\n      <span>Email: <\/span><a href=\"mailto:noehre@cs.uni-kassel.de\">noehre@cs.uni-kassel.de<\/a><br \/>\n      <span>ORCID: <\/span><a href=\"https:\/\/orcid.org\/0009-0005-4089-2925\">0009-0005-4089-2925<\/a><br \/>\n      Code: <a href=\"https:\/\/github.com\/marcelnoehre\">https:\/\/github.com\/marcelnoehre<\/a>\n    <\/p>\n  <\/div>\n  <div style=\"flex: 0 0 auto;\">\n    <img decoding=\"async\" src=\"https:\/\/www.kde.cs.uni-kassel.de\/wp-content\/uploads\/2026\/09\/marcel-200x300.jpg\" alt=\"Marcel N\u00f6hre\" style=\"max-width: 100%; height: auto; width: 195px; border-radius: 4px;\" \/>\n  <\/div>\n<\/div>\n<h2>About Me<\/h2>\n<div><span>I am a researcher interested in algorithms for computing line diagrams of concept lattices. By investigating structural and order-theoretic properties of these lattices, I aim to derive layouts that represent the underlying structure of the data.<\/span><\/div>\n<div>\n<h2>Publications<\/h2>\n<p><ul class=\"bibsonomycsl_publications\"><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">Sharma, A., N\u00f6hre, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Exploring ESC Winners with Nested Diagrams<\/span><\/span>, https:\/\/arxiv.org\/abs\/2608.13630, (2026). https:\/\/doi.org\/https:\/\/doi.org\/10.48550\/arXiv.2608.13630.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_abstract\"><a rel=\"abs-25b186a4ea264c5ba2551e03f9d76fdc\"  href=\"#\">Abstract<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2608.13630\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-25b186a4ea264c5ba2551e03f9d76fdc\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-25b186a4ea264c5ba2551e03f9d76fdc\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.48550\/arXiv.2608.13630\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/25b186a4ea264c5ba2551e03f9d76fdc\/noehre\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-25b186a4ea264c5ba2551e03f9d76fdc\">We present ConceptFlow, a scikit-learn-compatible Python library for Formal Concept Analysis that constructs and renders nested line diagrams from many-valued formal contexts. Given a many-valued context and a partition of its attributes into conceptual scales, ConceptFlow performs conceptual scaling, computes the factor lattices, identifies filled nodes of the corresponding subdirect product, and produces an interactive visualization. We apply ConceptFlow to the winners of the Eurovision Song Contest from 1975 to 2025, exploring relationships between voting patterns and musical characteristics. Voting support is captured by an outer scale spanning regional, cultural, historical, and political dimensions, while an inner scale captures musical characteristics via tempo and key. The resulting nested line diagram reveals implications across both scales, exposing dependencies between how winning entries were voted for and the musical properties they share.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-25b186a4ea264c5ba2551e03f9d76fdc\"><p>@misc{sharma2026exploringescwinnersnested,<br\/>  abstract = {We present ConceptFlow, a scikit-learn-compatible Python library for Formal Concept Analysis that constructs and renders nested line diagrams from many-valued formal contexts. Given a many-valued context and a partition of its attributes into conceptual scales, ConceptFlow performs conceptual scaling, computes the factor lattices, identifies filled nodes of the corresponding subdirect product, and produces an interactive visualization. We apply ConceptFlow to the winners of the Eurovision Song Contest from 1975 to 2025, exploring relationships between voting patterns and musical characteristics. Voting support is captured by an outer scale spanning regional, cultural, historical, and political dimensions, while an inner scale captures musical characteristics via tempo and key. The resulting nested line diagram reveals implications across both scales, exposing dependencies between how winning entries were voted for and the musical properties they share.},<br\/>  author = {Sharma, Anurag and N\u00f6hre, Marcel and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  month = {08},<br\/>  title = {Exploring ESC Winners with Nested Diagrams},<br\/>  year = 2026<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-25b186a4ea264c5ba2551e03f9d76fdc\"><p>%0 Generic<br\/>%1 sharma2026exploringescwinnersnested<br\/>%A Sharma, Anurag<br\/>%A N\u00f6hre, Marcel<br\/>%A Stumme, Gerd<br\/>%D 2026<br\/>%R https:\/\/doi.org\/10.48550\/arXiv.2608.13630<br\/>%T Exploring ESC Winners with Nested Diagrams<br\/>%U https:\/\/arxiv.org\/abs\/2608.13630<br\/>%X We present ConceptFlow, a scikit-learn-compatible Python library for Formal Concept Analysis that constructs and renders nested line diagrams from many-valued formal contexts. Given a many-valued context and a partition of its attributes into conceptual scales, ConceptFlow performs conceptual scaling, computes the factor lattices, identifies filled nodes of the corresponding subdirect product, and produces an interactive visualization. We apply ConceptFlow to the winners of the Eurovision Song Contest from 1975 to 2025, exploring relationships between voting patterns and musical characteristics. Voting support is captured by an outer scale spanning regional, cultural, historical, and political dimensions, while an inner scale captures musical characteristics via tempo and key. The resulting nested line diagram reveals implications across both scales, exposing dependencies between how winning entries were voted for and the musical properties they share.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">N\u00f6hre, M., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">Node Labeling in Line Diagrams of Ordered Sets<\/span><\/span>, https:\/\/arxiv.org\/abs\/2607.23283, (2026). https:\/\/doi.org\/https:\/\/doi.org\/10.48550\/arXiv.2607.23283.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_abstract\"><a rel=\"abs-9c2373753575468da9e7ed3fa1c5afe7\"  href=\"#\">Abstract<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/arxiv.org\/abs\/2607.23283\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-9c2373753575468da9e7ed3fa1c5afe7\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-9c2373753575468da9e7ed3fa1c5afe7\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.48550\/arXiv.2607.23283\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/9c2373753575468da9e7ed3fa1c5afe7\/noehre\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-9c2373753575468da9e7ed3fa1c5afe7\">We propose a flexible, two-phase algorithm for labeling line diagrams of ordered sets, in which the nodes of direct neighbors in the order relation are connected by a straight, upward-pointing line. In contrast to the labeling of diagrams of arbitrary graphs, we benefit from the fact that all edges in line diagrams of ordered sets are more or less vertical. In this paper, we study the placement of all labels such that they do not intersect with any nodes, lines, or other labels while minimizing the distances between the nodes and their labels. Our approach starts by filtering the fixed-position model using line diagram-specific readability criteria. For labels that cannot be placed adjacent to their node (overflow labels), we exploit the free space in the graph's interior or the infinite space surrounding the drawing and link the labels with their respective node by straight binding lines that should not cross other nodes or labels if possible. To balance quality and runtime, we derive an initial placement of the overflow labels using a cost function over a sparse grid of candidates, followed by a force-based refinement step to fine-tune the layout. Furthermore, we demonstrate the flexibility of this approach by applying it to the visual constraints of line diagrams in the field of Formal Concept Analysis (FCA), where certain labels have to be placed above their node and others below. This special version of the algorithm shows that a pre-filtering in the first phase and minimal adjustments for the cost function and force-based model are sufficient to handle the dual labeling requirements of concept lattices.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-9c2373753575468da9e7ed3fa1c5afe7\"><p>@misc{n\u00f6hre2026nodelabelinglinediagrams,<br\/>  abstract = {We propose a flexible, two-phase algorithm for labeling line diagrams of ordered sets, in which the nodes of direct neighbors in the order relation are connected by a straight, upward-pointing line. In contrast to the labeling of diagrams of arbitrary graphs, we benefit from the fact that all edges in line diagrams of ordered sets are more or less vertical. In this paper, we study the placement of all labels such that they do not intersect with any nodes, lines, or other labels while minimizing the distances between the nodes and their labels. Our approach starts by filtering the fixed-position model using line diagram-specific readability criteria. For labels that cannot be placed adjacent to their node (overflow labels), we exploit the free space in the graph's interior or the infinite space surrounding the drawing and link the labels with their respective node by straight binding lines that should not cross other nodes or labels if possible. To balance quality and runtime, we derive an initial placement of the overflow labels using a cost function over a sparse grid of candidates, followed by a force-based refinement step to fine-tune the layout. Furthermore, we demonstrate the flexibility of this approach by applying it to the visual constraints of line diagrams in the field of Formal Concept Analysis (FCA), where certain labels have to be placed above their node and others below. This special version of the algorithm shows that a pre-filtering in the first phase and minimal adjustments for the cost function and force-based model are sufficient to handle the dual labeling requirements of concept lattices.},<br\/>  author = {N\u00f6hre, Marcel and Stumme, Gerd},<br\/>  howpublished = {arXiv},<br\/>  keywords = {itegpub},<br\/>  month = {07},<br\/>  title = {Node Labeling in Line Diagrams of Ordered Sets},<br\/>  year = 2026<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-9c2373753575468da9e7ed3fa1c5afe7\"><p>%0 Generic<br\/>%1 n\u00f6hre2026nodelabelinglinediagrams<br\/>%A N\u00f6hre, Marcel<br\/>%A Stumme, Gerd<br\/>%D 2026<br\/>%R https:\/\/doi.org\/10.48550\/arXiv.2607.23283<br\/>%T Node Labeling in Line Diagrams of Ordered Sets<br\/>%U https:\/\/arxiv.org\/abs\/2607.23283<br\/>%X We propose a flexible, two-phase algorithm for labeling line diagrams of ordered sets, in which the nodes of direct neighbors in the order relation are connected by a straight, upward-pointing line. In contrast to the labeling of diagrams of arbitrary graphs, we benefit from the fact that all edges in line diagrams of ordered sets are more or less vertical. In this paper, we study the placement of all labels such that they do not intersect with any nodes, lines, or other labels while minimizing the distances between the nodes and their labels. Our approach starts by filtering the fixed-position model using line diagram-specific readability criteria. For labels that cannot be placed adjacent to their node (overflow labels), we exploit the free space in the graph's interior or the infinite space surrounding the drawing and link the labels with their respective node by straight binding lines that should not cross other nodes or labels if possible. To balance quality and runtime, we derive an initial placement of the overflow labels using a cost function over a sparse grid of candidates, followed by a force-based refinement step to fine-tune the layout. Furthermore, we demonstrate the flexibility of this approach by applying it to the visual constraints of line diagrams in the field of Formal Concept Analysis (FCA), where certain labels have to be placed above their node and others below. This special version of the algorithm shows that a pre-filtering in the first phase and minimal adjustments for the cost function and force-based model are sufficient to handle the dual labeling requirements of concept lattices.<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">N\u00f6hre, M., D\u00fcrrschnabel, D., Ganter, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">A Visual Benchmark of DimFlux: Comparison of Line Diagrams for Concept Lattices<\/span><\/span>, https:\/\/doi.org\/10.5281\/zenodo.20280441, (2026). https:\/\/doi.org\/10.5281\/zenodo.20280441.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.5281\/zenodo.20280441\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-4bee1a402eae5ffc2993a0c4c1b44545\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-4bee1a402eae5ffc2993a0c4c1b44545\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/dx.doi.org\/10.5281\/zenodo.20280441\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/4bee1a402eae5ffc2993a0c4c1b44545\/noehre\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-4bee1a402eae5ffc2993a0c4c1b44545\"><p>@misc{nohre_2026_20280441,<br\/>  author = {N\u00f6hre, Marcel and D\u00fcrrschnabel, Dominik and Ganter, Bernhard and Stumme, Gerd},<br\/>  keywords = {itegpub},<br\/>  month = {05},<br\/>  publisher = {Zenodo},<br\/>  title = {A Visual Benchmark of DimFlux: Comparison of Line Diagrams for Concept Lattices},<br\/>  year = 2026<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-4bee1a402eae5ffc2993a0c4c1b44545\"><p>%0 Generic<br\/>%1 nohre_2026_20280441<br\/>%A N\u00f6hre, Marcel<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Ganter, Bernhard<br\/>%A Stumme, Gerd<br\/>%D 2026<br\/>%I Zenodo<br\/>%R 10.5281\/zenodo.20280441<br\/>%T A Visual Benchmark of DimFlux: Comparison of Line Diagrams for Concept Lattices<br\/>%U https:\/\/doi.org\/10.5281\/zenodo.20280441<br\/><\/p><\/div><\/div><\/li><li class=\"bibsonomycsl_pubitem\"><div class=\"bibsonomycsl_entry\"><div class=\"csl-bib-body\">\n  <div class=\"csl-entry\"><div class=\"csl-left-margin\"><span style=\"display: none;\">1.<\/span><\/div><div class=\"csl-right-inline\"><span class=\"csl-author\">N\u00f6hre, M., D\u00fcrrschnabel, D., Ganter, B., Stumme, G.: <\/span><span class=\"csl-title\"><span class=\"csl-title\">DimFlux: Force-directed additive line diagrams<\/span>.<\/span> International Journal of Approximate Reasoning. 197, 109734 (2026). https:\/\/doi.org\/https:\/\/doi.org\/10.1016\/j.ijar.2026.109734.<\/div><\/div>\n<\/div><span class=\"bibsonomycsl_export bibsonomycsl_abstract\"><a rel=\"abs-c7c28385ecadcf457fcef74719be3228\"  href=\"#\">Abstract<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X2600109X\" target=\"_blank\">URL<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_bibtex\"><a rel=\"bib-c7c28385ecadcf457fcef74719be3228\" href=\"#\">BibTeX<\/a><\/span><span class=\"bibsonomycsl_export bibsonomycsl_endnote\"><a rel=\"end-c7c28385ecadcf457fcef74719be3228\" href=\"#\">EndNote<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/doi.org\/10.1016\/j.ijar.2026.109734\" target=\"_blank\">DOI<\/a><\/span><span class=\"bibsonomycsl_url\"><a href=\"https:\/\/www.bibsonomy.org\/bibtex\/c7c28385ecadcf457fcef74719be3228\/noehre\" target=\"_blank\">BibSonomy<\/a><\/span><div style=\"clear: left\"> <\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_abstract\" style=\"display:none;\" id=\"abs-c7c28385ecadcf457fcef74719be3228\">The visualization of concept lattices is a central problem in the field of Formal Concept Analysis. Force-directed algorithms, as popular in graph drawing, are a promising approach, treating lattice diagrams as physical models, optimizing node positions based on forces derived from the lattice structure. We build on the work of Zschalig, who, however, limited himself to attribute-additive diagrams. We use a more general additivity, in which both the attributes and the objects contribute to the positions of the concept nodes. We replace the planarity enhancer used by Zschalig to obtain a starting diagram for force-directed optimization with the DimDraw algorithm, which generates structured order diagrams on its own. The combination results in DimFlux, an algorithm that leverages the advantages of DimDraw but generates additive diagrams in which readability is increased by maximizing the conflict distance between nodes and non-incident edges.<\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_bibtex\" style=\"display:none;\" id=\"bib-c7c28385ecadcf457fcef74719be3228\"><p>@article{NOHRE2026109734,<br\/>  abstract = {The visualization of concept lattices is a central problem in the field of Formal Concept Analysis. Force-directed algorithms, as popular in graph drawing, are a promising approach, treating lattice diagrams as physical models, optimizing node positions based on forces derived from the lattice structure. We build on the work of Zschalig, who, however, limited himself to attribute-additive diagrams. We use a more general additivity, in which both the attributes and the objects contribute to the positions of the concept nodes. We replace the planarity enhancer used by Zschalig to obtain a starting diagram for force-directed optimization with the DimDraw algorithm, which generates structured order diagrams on its own. The combination results in DimFlux, an algorithm that leverages the advantages of DimDraw but generates additive diagrams in which readability is increased by maximizing the conflict distance between nodes and non-incident edges.},<br\/>  author = {N\u00f6hre, Marcel and D\u00fcrrschnabel, Dominik and Ganter, Bernhard and Stumme, Gerd},<br\/>  journal = {International Journal of Approximate Reasoning},<br\/>  keywords = {itegpub},<br\/>  pages = 109734,<br\/>  title = {DimFlux: Force-directed additive line diagrams},<br\/>  volume = 197,<br\/>  year = 2026<br\/>}<br\/><\/p><\/div><div class=\"bibsonomycsl_collapse bibsonomycsl_pub_endnote\" style=\"display:none;\" id=\"end-c7c28385ecadcf457fcef74719be3228\"><p>%0 Journal Article<br\/>%1 NOHRE2026109734<br\/>%A N\u00f6hre, Marcel<br\/>%A D\u00fcrrschnabel, Dominik<br\/>%A Ganter, Bernhard<br\/>%A Stumme, Gerd<br\/>%D 2026<br\/>%J International Journal of Approximate Reasoning<br\/>%P 109734<br\/>%R https:\/\/doi.org\/10.1016\/j.ijar.2026.109734<br\/>%T DimFlux: Force-directed additive line diagrams<br\/>%U https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X2600109X<br\/>%V 197<br\/>%X The visualization of concept lattices is a central problem in the field of Formal Concept Analysis. Force-directed algorithms, as popular in graph drawing, are a promising approach, treating lattice diagrams as physical models, optimizing node positions based on forces derived from the lattice structure. We build on the work of Zschalig, who, however, limited himself to attribute-additive diagrams. We use a more general additivity, in which both the attributes and the objects contribute to the positions of the concept nodes. We replace the planarity enhancer used by Zschalig to obtain a starting diagram for force-directed optimization with the DimDraw algorithm, which generates structured order diagrams on its own. The combination results in DimFlux, an algorithm that leverages the advantages of DimDraw but generates additive diagrams in which readability is increased by maximizing the conflict distance between nodes and non-incident edges.<br\/><\/p><\/div><\/div><\/li><\/ul><\/p>\n<\/div>\n<div>\n<h2>Awards<\/h2>\n<table>\n<tbody>\n<tr>\n<td><em><strong>EUREKA Award<\/strong><\/em><\/td>\n<td>Most surprising or impactful insight (<a href=\"https:\/\/concepts2026.org\/\">CONCEPTS 2026<\/a>)<\/td>\n<\/tr>\n<tr>\n<td><em><strong>Creative Topic (3rd)<\/strong><\/em><\/td>\n<td>Visualize voting patterns across years in the Eurovision Song Contest (<a href=\"https:\/\/graphdrawing.github.io\/gd2026\/\">GD 2026<\/a>)<\/td>\n<\/tr>\n<tr>\n<td><em><strong>Manual Challenge (2nd)<\/strong><\/em><\/td>\n<td>Minimizing k in k-plane drawings (<a href=\"https:\/\/graphdrawing.github.io\/gd2026\/\">GD 2026<\/a>)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<div>\n<h2>Teaching<\/h2>\n<table>\n<tbody>\n<tr>\n<td>Summer Term 2026<\/td>\n<td><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2026\/ln\">Labor Netzwerke<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<div>\n<h2><\/h2>\n<h2 id=\"supervision\">Supervision<\/h2>\n<p>Reach out if you&#8217;re interested in a project, bachelor&#8217;s thesis, or master&#8217;s thesis. Check the <a href=\"https:\/\/www.kde.cs.uni-kassel.de\/lehre\/ss2026\/arbeiten\">predefined topics<\/a>, or get in touch with your own idea. Below is a list of topics I have already supervised:<\/p>\n<ul>\n<li>Drawing Line Diagrams of Concept Lattices using Linear Transformations<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h2>Curriculum Vitae<\/h2>\n<h3><span class=\"cv-date\">Academic Positions<\/span><\/h3>\n<ul>\n<li><span class=\"cv-date\"><strong>Research Associate<\/strong> (<\/span><span class=\"cv-date\">Since 11\/2025)<br \/><\/span>Knowledge and Data Engineering Group<br \/>University of Kassel, Germany<\/li>\n<\/ul>\n<h3><span class=\"cv-date\">Education<\/span><\/h3>\n<ul>\n<li><strong>Master of Science (M.Sc.) <\/strong>(2023 &#8211; 2025)<br \/>Applied Computer Science<br \/>University of Hildesheim, Germany<br \/>Thesis: <em><em><em>The Robustness of Topological Data Analysis under Imputation-Induced Perturbations<\/em><\/em><\/em><\/li>\n<li><strong>Bachelor of Science (B.Sc.) <\/strong>(2019 &#8211; 2023)<br \/>Applied Computer Science<br \/>University of Hildesheim, Germany<br \/>Thesis: <em>Swagger in the IIP-Ecosphere for Asset Administration Shells in Industry 4.0<\/em><\/li>\n<\/ul>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Marcel N\u00f6hre Raum 0440 Universit\u00e4t Kassel Fachbereich Elektrotechnik\/Informatik Fachgebiet Wissensverarbeitung Wilhelmsh\u00f6her Allee 73 34121 Kassel Tel.: +49 561 804-6253 Email: noehre@cs.uni-kassel.de ORCID: 0009-0005-4089-2925 Code: https:\/\/github.com\/marcelnoehre About Me I am a researcher interested in algorithms for<a class=\"moretag\" href=\"https:\/\/www.kde.cs.uni-kassel.de\/en\/noehre\"> Read more&hellip;<\/a><\/p>\n","protected":false},"author":15,"featured_media":0,"parent":0,"menu_order":17,"comment_status":"closed","ping_status":"closed","template":"employee_template.php","meta":{"footnotes":""},"class_list":["post-10383","page","type-page","status-publish","hentry"],"translation":{"provider":"WPGlobus","version":"3.0.5","language":"en","enabled_languages":["de","en"],"languages":{"de":{"title":true,"content":true,"excerpt":false},"en":{"title":false,"content":false,"excerpt":false}}},"_links":{"self":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10383","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/users\/15"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/comments?post=10383"}],"version-history":[{"count":24,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10383\/revisions"}],"predecessor-version":[{"id":10841,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10383\/revisions\/10841"}],"wp:attachment":[{"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/media?parent=10383"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}