Hendrik Molter

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 107

Top Venues

CoRR

J. Comput. Syst. Sci.

MFCS

Publications

Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
Algorithmic aspects of temporal betweenness. Netw. Sci. 12 (2) (2024)
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR (2024)
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
How to Make Knockout Tournaments More Popular? AAAI (2024)
Klaus Heeger, Hendrik Molter
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. CoRR (2024)
Danny Hermelin, Hendrik Molter, Dvir Shabtay
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. 36 (3) (2024)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Temporal Graph Realization from Fastest Paths. SAND (2024)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
The complexity of computing optimum labelings for temporal connectivity. J. Comput. Syst. Sci. 146 (2024)
Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Fair Repetitive Interval Scheduling. CoRR (2024)
George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Realizing temporal transportation trees. CoRR (2024)
Hendrik Molter, Malte Renken, Philipp Zschoche
Temporal reachability minimization: Delaying vs. deleting. J. Comput. Syst. Sci. 144 (2024)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
On the parameterized complexity of interval scheduling with eligible machine sets. J. Comput. Syst. Sci. 144 (2024)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27 (3) (2023)
Pascal Kunz, Hendrik Molter, Meirav Zehavi
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR (2023)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Realizing temporal graphs from fastest travel times. CoRR (2023)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable scheduling on a single machine. J. Sched. 26 (2) (2023)
Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. 135 (2023)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
Temporal interval cliques and independent sets. Theor. Comput. Sci. 961 (2023)
Pascal Kunz, Hendrik Molter, Meirav Zehavi
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI (2023)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137 (2023)
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
How to Make Knockout Tournaments More Popular? CoRR (2023)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37 (1) (2023)
Jessica A. Enright, Kitty Meeks, Hendrik Molter
Counting Temporal Paths. STACS (2023)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS (2022)
Danny Hermelin, Hendrik Molter, Dvir Shabtay
Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Delay-Robust Routes in Temporal Graphs. STACS (2022)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Hardness of Interval Scheduling on Unrelated Machines. IPEC (2022)
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Delay-Robust Routes in Temporal Graphs. CoRR (2022)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
Temporal Unit Interval Independent Sets. SAND (2022)
Jessica A. Enright, Kitty Meeks, Hendrik Molter
Counting Temporal Paths. CoRR (2022)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Hardness of Interval Scheduling on Unrelated Machines. CoRR (2022)
Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
Feedback edge sets in temporal graphs. Discret. Appl. Math. 307 (2022)
Hendrik Molter
The complexity of finding temporal separators under waiting time constraints. Inf. Process. Lett. 175 (2022)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
The complexity of computing optimum labelings for temporal connectivity. CoRR (2022)
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
The Complexity of Transitively Orienting Temporal Graphs. CoRR (2021)
Junjie Luo, Hendrik Molter, Ondrej Suchý
A Parameterized Complexity View on Collapsing k-Cores. Theory Comput. Syst. 65 (8) (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR (2021)
Hendrik Molter, Malte Renken, Philipp Zschoche
Temporal Reachability Minimization: Delaying vs. Deleting. CoRR (2021)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120 (2021)
Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling for the Total Completion Time Objective. CoRR (2021)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling on a Single Machine. AAAI (2021)
Hendrik Molter
The Complexity of Finding Temporal Separators under Waiting Time Constraints. CoRR (2021)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG (2021)
Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR (2021)
Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
On Finding Separators in Temporal Split and Permutation Graphs. FCT (2021)
Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
Temporal Unit Interval Independent Sets. CoRR (2021)
Hendrik Molter, Malte Renken, Philipp Zschoche
Temporal Reachability Minimization: Delaying vs. Deleting. MFCS (2021)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83 (9) (2021)
Hendrik Molter, Rolf Niedermeier, Malte Renken
Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9 (S1) (2021)
Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Parameterized Dynamic Cluster Editing. Algorithmica 83 (1) (2021)
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
The Complexity of Transitively Orienting Temporal Graphs. MFCS (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI (2021)
Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
On Finding Separators in Temporal Split and Permutation Graphs. CoRR (2021)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR (2020)
Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
Feedback Edge Sets in Temporal Graphs. WG (2020)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms (2020)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling on a Single Machine. CoRR (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. STACS (2020)
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. 39 (1) (2020)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107 (2020)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. ISAAC (2020)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1 (4) (2020)
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
Diminishable parameterized problems and strict polynomial kernelization. Comput. 9 (1) (2020)
Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
Algorithmic Aspects of Temporal Betweenness. CoRR (2020)
Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
Algorithmic Aspects of Temporal Betweenness. KDD (2020)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806 (2020)
Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
Feedback Edge Sets in Temporal Graphs. CoRR (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. CoRR (2019)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7 (2) (2019)
Hendrik Molter, Rolf Niedermeier, Malte Renken
Enumerating Isolated Cliques in Temporal Networks. CoRR (2019)
Hendrik Molter, Rolf Niedermeier, Malte Renken
Enumerating Isolated Cliques in Temporal Networks. COMPLEX NETWORKS (2) (2019)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24 (1) (2019)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. AAAI (2019)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR (2019)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Temporal Graph Classes: A View Through Temporal Separators. WG (2018)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30 (2018)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. CoRR (2018)
Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Parameterized Dynamic Cluster Editing. CoRR (2018)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
Listing All Maximal k-Plexes in Temporal Graphs. CoRR (2018)
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC (2018)
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR (2018)
Junjie Luo, Hendrik Molter, Ondrej Suchý
A Parameterized Complexity View on Collapsing k-Cores. CoRR (2018)
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO (2018)
Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Temporal Graph Classes: A View Through Temporal Separators. CoRR (2018)
Junjie Luo, Hendrik Molter, Ondrej Suchý
A Parameterized Complexity View on Collapsing k-Cores. IPEC (2018)
Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
Parameterized Dynamic Cluster Editing. FSTTCS (2018)
Clemens Hoffmann, Hendrik Molter, Manuel Sorge
The Parameterized Complexity of Centrality Improvement in Networks. SOFSEM (2018)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM (2018)
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE (2018)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The Complexity of Finding Small Separators in Temporal Graphs. MFCS (2018)
Clemens Hoffmann, Hendrik Molter, Manuel Sorge
The Parameterized Complexity of Centrality Improvement in Networks. CoRR (2017)
Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
The Minimum Shared Edges Problem on Grid-like Graphs. CoRR (2017)
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
A Parameterized View on Multi-Layer Cluster Editing. CoRR (2017)
Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
The Minimum Shared Edges Problem on Grid-Like Graphs. WG (2017)
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
The Computational Complexity of Finding Separators in Temporal Graphs. CoRR (2017)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7 (1) (2017)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC (2017)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index Manipulation by Undoing Merges. ECAI (2016)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Enumerating Maximal Cliques in Temporal Graphs. CoRR (2016)

Hendrik Molter.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hendrik Molter