Maktaba

Item request has been placed!

Item request cannot be made.

Processing Request

Dissertation/ Thesis

Innovative graph-theory based data analysis approaches for functional neuroimaging data tailored to application in neuropsychiatry

Authors : Ramkiran, Shukti;

Subjects: info:eu-repo/classification/ddc/610; Tourette syndrome; basal gangliaDE

Source: Aachen : RWTH Aachen University 1 Online-Ressource : Illustrationen (2025). doi:10.18154/RWTH-2026-00554 = Dissertation, Rheinisch-Westfälische Technische Hochschule Aachen, 2025

Record details

Read More Add to Saved list

Academic Journal

On the Partitioning of MMC Control Systems Using Graph Theory

Authors : Jahn, Ilka; Chaffey, Geraint; Prieto-Araujo, Eduardo

Subjects: DE

Source: IEEE open journal of power electronics 3, 611-620 (2022). doi:10.1109/OJPEL.2022.3204558

Record details

Read More Add to Saved list

Conference

Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth

Authors : Adler, Isolde; Fluck, Eva

Subjects: Mathematics of computing → Graph theory; cops-and-robber game; homomorphism distinguishing closureDE

Source: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 306, 6:1-6:18 (2024). doi:10.4230/LIPICS.MFCS.2024.6 ; 49th

Record details

Read More Add to Saved list

Conference

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

Authors : Seppelt, Tim Frederik

Subjects: Courcelle’s Theorem; Mathematics of computing → Combinatorics; Mathematics of computing → Graph theoryDE

Source: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 (2024).

Record details

Read More Add to Saved list

Conference

The Complexity of Homomorphism Reconstructibility

Authors : Böker, Jan Wilhelm; Härtel, Louis; Runde, Nina Katrin

Subjects: Mathematics of computing → Graph theory; Theory of computation → Graph algorithms analysis; Theory of computation → Parameterized complexity and exact algorithmsDE

Source: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19 ; 41st International

Record details

Read More Add to Saved list

Conference

Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth

Authors : Fluck, Eva; Seppelt, Tim Frederik; Spitzer, Gian Luca

Subjects: Mathematics of computing → Graph theory; Theory of computation → Finite Model Theory; TreewidthDE

Source: Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 288, 27:[1]-27:17 (2024). doi:10.4230/LIPIcs.CSL.2024.27 ; 32nd EACSL Annual

Record details

Read More Add to Saved list

Conference

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors

Authors : Seppelt, Tim Frederik

Subjects: Mathematics of computing → Combinatorics; Mathematics of computing → Graph theory; graph minorDE

Source: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics: LIPIcs 272, 82:1-82:15 (2023). doi:10.4230/LIPIcs.MFCS.2023.82 ; 48th International

Record details

Read More Add to Saved list

Conference

An Investigation of the Recoverable Robust Assignment Problem

Authors : Fischer, Dennis; Hartmann, Tim A.; Lendl, Stefan

Subjects: info:eu-repo/classification/ddc/004; Mathematics of computing → Graph theory; RNCDE

Source: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, LIPIcs - Leibniz International Proceedings in Informatics 214, 19:1-19:14 (2021). doi:10.4230/LIPIcs.IPEC.2021.19 ; 16th International

Record details

Read More Add to Saved list

Conference

Graph Similarity and Homomorphism Densities

Authors : Böker, Jan Wilhelm

Subjects: Mathematics of computing → Graph theory; cut distance; graph similarityDE

Source: Saarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz international proceedings in informatics 198, 17 pages803851 bytes (2021). doi:10.4230/LIPIcs.ICALP.2021.32 ; 48th

Record details

Read More Add to Saved list

Conference

Logarithmic Weisfeiler-Leman Identifies All Planar Graphs

Authors : Grohe, Martin; Kiefer, Sandra

Subjects: Mathematics of computing → Graph theory; Theory of computation → Finite Model Theory; Weisfeiler-Leman algorithmDE

Source: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, LIPIcs - Leibniz International Proceedings in Informatics 198, 134:1-134:20 (2021). doi:10.4230/LIPICS.ICALP.2021.134 ; 48th

Record details

Read More Add to Saved list

Search Results

Your Filters

Innovative graph-theory based data analysis approaches for functional neuroimaging data tailored to application in neuropsychiatry

On the Partitioning of MMC Control Systems Using Graph Theory

Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

The Complexity of Homomorphism Reconstructibility

Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors

An Investigation of the Recoverable Robust Assignment Problem

Graph Similarity and Homomorphism Densities

Logarithmic Weisfeiler-Leman Identifies All Planar Graphs

Contact

Follow us