{"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-03-18T14:05:19","modified_gmt":"2026-03-18T13:05:19","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> <p><span>Marcel N\u00f6hre<\/span><\/p>\n<p><span>Raum 0440<\/span><br \/><a href=\"https:\/\/www.uni-kassel.de\/uni\/\">Universit\u00e4t Kassel<\/a><br \/><a href=\"https:\/\/www.uni-kassel.de\/eecs\/\">Fachbereich Elektrotechnik\/Informatik<\/a><br \/><a href=\"https:\/\/www.kde.cs.uni-kassel.de\/\">Fachgebiet Wissensverarbeitung<\/a><br \/><span>Wilhelmsh\u00f6her Allee 73<\/span><br \/><span>34121 Kassel<\/span><br \/><span>Tel.: +49 561 804-6253<\/span><br \/><span>Email: <\/span><a href=\"mailto:noehre@cs.uni-kassel.de\">noehre@cs.uni-kassel.de<\/a><br \/><span>ORCID: <\/span><a href=\"https:\/\/orcid.org\/0009-0005-4089-2925\">0009-0005-4089-2925<\/a><br \/>Code: <a href=\"https:\/\/github.com\/marcelnoehre\">https:\/\/github.com\/marcelnoehre<\/a><\/p>\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><\/div>\n<div>\n<h2>Publications and Preprints<\/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\">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><\/div>\n<div>\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 \u2013 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 \u2013 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 0440Universit\u00e4t KasselFachbereich Elektrotechnik\/InformatikFachgebiet WissensverarbeitungWilhelmsh\u00f6her Allee 7334121 KasselTel.: +49 561 804-6253Email: noehre@cs.uni-kassel.deORCID: 0009-0005-4089-2925Code: https:\/\/github.com\/marcelnoehre About Me I am a researcher interested in algorithms for computing line diagrams of concept lattices. By investigating structural<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":12,"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.2","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":10,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10383\/revisions"}],"predecessor-version":[{"id":10501,"href":"https:\/\/www.kde.cs.uni-kassel.de\/en\/wp-json\/wp\/v2\/pages\/10383\/revisions\/10501"}],"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}]}}