HM
Hendrik Molter
cs.DScs.DMcs.CCcs.GTcs.MAcs.SIaction sequencesApproximate countingcluster editingcomplex problem solving
On Valency
published · living versionsW_dqvfa3vp·v1 · currentpublished
Recognizing Label-Connected Graphs
with Ralf Klasing, George B. Mertzios, Nils Morawietz, Paul G. Spirakis
1 version
Preprints & journals
49 papers in the corpus · 2016–2025On Kernelization with Access to NP-Oracles2508.10550v1 · Hendrik Molter, Meirav Zehavi2025 · 0 citationsarXiv
Tournament Robustness via Redundancy2506.03701v1 · Klim Efremenko, Hendrik Molter, Meirav Zehavi2025 · 0 citationsarXiv
Treewidth Parameterized by Feedback Vertex Number2504.18302v3 · Hendrik Molter, Meirav Zehavi, Amit Zivan2025 · 0 citationsarXiv
Temporal Graph Realization With Bounded Stretch2504.14258v1 · George B. Mertzios, Hendrik Molter, Nils Morawietz et al.2025 · 0 citationsarXiv
Counting Temporal Paths.40352583 · Enright, Jessica, Meeks, Kitty, Molter, Hendrik2025 · 15 citationsAlgorithmica. 2025;87(5):736-782
Adaptive Manipulation for Coalitions in Knockout Tournaments2412.11799v1 · Juhi Chaudhary, Hendrik Molter, Meirav Zehavi2024 · 1 citationarXiv
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates2408.12967v1 · Matthias Kaul, Matthias Mnich, Hendrik Molter2024 · 0 citationsarXiv
Fair Repetitive Interval Scheduling2407.03987v1 · Klaus Heeger, Danny Hermelin, Yuval Itzhaki et al.2024 · 0 citationsarXiv
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines2404.14208v1 · Klaus Heeger, Hendrik Molter2024 · 0 citationsarXiv
Realizing temporal transportation trees2403.18513v3 · George B. Mertzios, Hendrik Molter, Nils Morawietz et al.2024 · 1 citationarXiv
Parameterized Analysis of Bribery in Challenge the Champ Tournaments2403.17587v1 · Juhi Chaudhary, Hendrik Molter, Meirav Zehavi2024 · 1 citationarXiv
How to Make Knockout Tournaments More Popular?2309.09967v2 · Juhi Chaudhary, Hendrik Molter, Meirav Zehavi2023 · 2 citationsarXiv
Realizing temporal graphs from fastest travel times2302.08860v4 · Nina Klobas, George B. Mertzios, Hendrik Molter et al.2023 · 1 citationarXiv
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?2301.10503v1 · Pascal Kunz, Hendrik Molter, Meirav Zehavi2023 · 5 citationsarXiv
Hardness of Interval Scheduling on Unrelated Machines2206.12825v1 · Danny Hermelin, Yuval Itzhaki, Hendrik Molter et al.2022 · 1 citationarXiv
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions2202.06841v2 · Danny Hermelin, Hendrik Molter, Dvir Shabtay2022 · 2 citationsarXiv
The complexity of computing optimum labelings for temporal connectivity2202.05880v2 · Nina Klobas, George B. Mertzios, Hendrik Molter et al.2022 · 7 citationsarXiv
Delay-Robust Routes in Temporal Graphs2201.05390v1 · Eugen Fuchsle, Hendrik Molter, Rolf Niedermeier et al.2022 · 12 citationsarXiv
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays2201.05011v1 · Eugen Fuchsle, Hendrik Molter, Rolf Niedermeier et al.2022 · 6 citationsarXiv
Fairness in Repetitive Scheduling2112.13824v2 · Danny Hermelin, Hendrik Molter, Rolf Niedermeier et al.2021 · 10 citationsarXiv
Temporal Interval Cliques and Independent Sets2112.06172v3 · Danny Hermelin, Yuval Itzhaki, Hendrik Molter et al.2021 · 2 citationsarXiv
The Complexity of Finding Temporal Separators under Waiting Time Constraints2107.01609v1 · Hendrik Molter2021 · 6 citationsarXiv
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality2105.13055v1 · Maciej Rymar, Hendrik Molter, Andr'e Nichterlein et al.2021 · 8 citationsarXiv
On Finding Separators in Temporal Split and Permutation Graphs2105.12003v1 · Nicolas Maack, Hendrik Molter, Rolf Niedermeier et al.2021 · 6 citationsarXiv
Interference-free Walks in Time: Temporally Disjoint Paths2105.08335v2 · Nina Klobas, George B. Mertzios, Hendrik Molter et al.2021 · 15 citationsarXiv
Temporal Reachability Minimization: Delaying vs. Deleting2102.10814v2 · Hendrik Molter, Malte Renken, Philipp Zschoche2021 · 4 citationsarXiv
The Complexity of Transitively Orienting Temporal Graphs2102.06783v3 · George B. Mertzios, Hendrik Molter, Malte Renken et al.2021 · 4 citationsarXiv
Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes.33544300 · Ulitzsch, Esther, He, Qiwei, Ulitzsch, Vincent et al.2021 · 49 citationsPsychometrika. 2021;86(1):190-214
Equitable Scheduling on a Single Machine2010.04643v2 · Klaus Heeger, Danny Hermelin, George B. Mertzios et al.2020 · 11 citationsarXiv
Algorithmic Aspects of Temporal Betweenness2006.08668v2 · Sebastian Buß, Hendrik Molter, Rolf Niedermeier et al.2020 · 7 citationsNet Sci 12 (2024) 160-188
Feedback Edge Sets in Temporal Graphs2003.13641v2 · Roman Haag, Hendrik Molter, Rolf Niedermeier et al.2020 · 15 citationsarXiv
Enumerating Isolated Cliques in Temporal Networks1909.06292v2 · Hendrik Molter, Rolf Niedermeier, Malte Renken2019 · 13 citationsarXiv
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints1909.06437v5 · Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter et al.2019 · 21 citationsarXiv
Computing Maximum Matchings in Temporal Graphs1905.05304v6 · George B. Mertzios, Hendrik Molter, Rolf Niedermeier et al.2019 · 23 citationsarXiv
Sliding Window Temporal Graph Coloring1811.04753v2 · George B. Mertzios, Hendrik Molter, Viktor Zamaraev2018 · 26 citationsarXiv
Parameterized Dynamic Cluster Editing1810.06625v2 · Junjie Luo, Hendrik Molter, Andr'e Nichterlein et al.2018 · 1 citationarXiv
Listing All Maximal -Plexes in Temporal Graphs1806.10210v4 · Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter et al.2018 · 28 citationsarXiv
A Parameterized Complexity View on Collapsing k-Cores1805.12453v1 · Junjie Luo, Hendrik Molter, Ondrej Suchy2018 · 13 citationsarXiv
Temporal Graph Classes: A View Through Temporal Separators1803.00882v2 · Till Fluschnik, Hendrik Molter, Rolf Niedermeier et al.2018 · 57 citationsarXiv
Efficient Algorithms for Measuring the Funnel-likeness of DAGs1801.10401v1 · Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier et al.2018 · 8 citationsarXiv
The Complexity of Finding Small Separators in Temporal Graphs1711.00963v5 · Philipp Zschoche, Till Fluschnik, Hendrik Molter et al.2017 · 82 citationsarXiv
The Parameterized Complexity of Centrality Improvement in Networks1710.01576v1 · Clemens Hoffmann, Hendrik Molter, Manuel Sorge2017 · 8 citationsarXiv
Cluster Editing for Multi-Layer and Temporal Graphs1709.09100v2 · Jiehua Chen, Hendrik Molter, Manuel Sorge et al.2017 · 9 citationsarXiv
The Minimum Shared Edges Problem on Grid-like Graphs1703.02332v2 · Till Fluschnik, Meike Hatzel, Steffen Hartlein et al.2017 · 4 citationsarXiv
Diminishable Parameterized Problems and Strict Polynomial Kernelization1611.03739v3 · Henning Fernau, Till Fluschnik, Danny Hermelin et al.2016 · 6 citationsarXiv
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs1606.09000v5 · Ren'e van Bevern, Till Fluschnik, George B. Mertzios et al.2016 · 9 citationsDiscrete Optimzation 30:20-50, 2018
Adapting the Bron-Kerbosch Algorithm for Enumerating Maximal Cliques in Temporal Graphs1605.03871v2 · Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier et al.2016 · 73 citationsarXiv
Assessing the Computational Complexity of Multi-Layer Subgraph Detection1604.07724v2 · Robert Bredereck, Christian Komusiewicz, Stefan Kratsch et al.2016 · 8 citationsarXiv
h-Index Manipulation by Undoing Merges1604.04827v3 · Ren'e van Bevern, Christian Komusiewicz, Hendrik Molter et al.2016 · 6 citationsQuantitative Science Studies, 1(4): 1529-1552. 2020
Career total: 104 works. 49 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.