The following pages link to Hendrik Molter (Q823868):
Displaying 45 items.
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Diminishable parameterized problems and strict polynomial kernelization (Q1670737) (← links)
- The minimum shared edges problem on grid-like graphs (Q1687922) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- The complexity of finding temporal separators under waiting time constraints (Q2059911) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Towards classifying the polynomial-time solvability of temporal betweenness centrality (Q2672438) (← links)
- Firefighting as a Game (Q2945277) (← links)
- h-Index Manipulation by Undoing Merges (Q4576225) (← links)
- (Q4634388) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- (Q5009469) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Diminishable parameterized problems and strict polynomial kernelization (Q5118456) (← links)
- The Parameterized Complexity of Centrality Improvement in Networks (Q5127175) (← links)
- Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362) (← links)
- Firefighting as a Strategic Game (Q5856433) (← links)
- Computing maximum matchings in temporal graphs. (Q5874299) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Feedback edge sets in temporal graphs (Q5918410) (← links)
- Feedback edge sets in temporal graphs (Q5918593) (← links)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality (Q6107024) (← links)
- Temporal Reachability Minimization: Delaying vs. Deleting (Q6113364) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- The Complexity of Transitively Orienting Temporal Graphs (Q6168495) (← links)
- Delay-robust routes in temporal graphs (Q6490978) (← links)
- On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- Minimizing the weighted number of tardy jobs via \((\max,+)\)-convolutions (Q6580559) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6584065) (← links)
- Counting temporal paths (Q6615135) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
