Hendrik Molter

From MaRDI portal
Person:823868

Available identifiers

zbMath Open molter.hendrikMaRDI QIDQ823868

List of research outcomes

PublicationDate of PublicationType
Delay-robust routes in temporal graphs2024-04-23Paper
Finding Temporal Paths Under Waiting Time Constraints.2023-11-14Paper
Temporal Reachability Minimization: Delaying vs. Deleting2023-08-08Paper
The Complexity of Transitively Orienting Temporal Graphs2023-08-08Paper
Computing maximum matchings in temporal graphs2023-07-10Paper
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality2023-07-03Paper
Equitable scheduling on a single machine2023-06-27Paper
Temporal interval cliques and independent sets2023-05-23Paper
On finding separators in temporal split and permutation graphs2023-04-21Paper
Computing maximum matchings in temporal graphs.2023-02-07Paper
Feedback edge sets in temporal graphs2022-12-21Paper
As Time Goes By: Reflections on Treewidth for Temporal Graphs2022-10-19Paper
Parameterized Dynamic Cluster Editing2022-07-21Paper
Cluster Editing in Multi-Layer and Temporal Graphs.2022-07-21Paper
Towards classifying the polynomial-time solvability of temporal betweenness centrality2022-06-08Paper
On finding separators in temporal split and permutation graphs2022-05-20Paper
A parameterized complexity view on collapsing \(k\)-cores2021-12-18Paper
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes2021-12-16Paper
The complexity of finding temporal separators under waiting time constraints2021-12-14Paper
Feedback edge sets in temporal graphs2021-12-07Paper
Finding temporal paths under waiting time constraints2021-09-02Paper
The Complexity of Finding Small Separators in Temporal Graphs2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50094692021-08-04Paper
Sliding window temporal graph coloring2021-06-30Paper
Interference-free Walks in Time: Temporally Disjoint Paths2021-05-18Paper
Firefighting as a Strategic Game2021-03-26Paper
Parameterized dynamic cluster editing2021-02-01Paper
The Parameterized Complexity of Centrality Improvement in Networks2020-10-21Paper
Diminishable parameterized problems and strict polynomial kernelization2020-09-08Paper
Efficient algorithms for measuring the funnel-likeness of DAGs2020-02-03Paper
Temporal graph classes: a view through temporal separators2020-01-16Paper
The complexity of finding small separators in temporal graphs2019-11-29Paper
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs2019-01-14Paper
Temporal graph classes: a view through temporal separators2018-11-22Paper
Diminishable parameterized problems and strict polynomial kernelization2018-09-06Paper
Efficient algorithms for measuring the funnel-likeness of DAGs2018-08-17Paper
h-Index Manipulation by Undoing Merges2018-07-12Paper
https://portal.mardi4nfdi.de/entity/Q46343882018-04-10Paper
The minimum shared edges problem on grid-like graphs2018-01-04Paper
Assessing the Computational Complexity of Multi-layer Subgraph Detection2017-07-21Paper
Firefighting as a Game2015-09-09Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hendrik Molter