ACO Beats EA on a Dynamic Pseudo-Boolean Function. - Timo Kötzing; Hendrik Molter (PPSN (1), 2012)

Firefighting as a Game. - Carme Àlvarez; Maria J. Blesa; Hendrik Molter (WAW, 2014)

Enumerating maximal cliques in temporal graphs. - Anne-Sophie Himmel; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (ASONAM, 2016)

Finding Secluded Places of Special Interest in Graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (IPEC, 2016)

Firefighting as a Strategic Game. - Carme Àlvarez; Maria J. Blesa; Hendrik Molter (Internet Math., 2016)

Assessing the Computational Complexity of Multi-layer Subgraph Detection. - Robert Bredereck; Christian Komusiewicz; Stefan Kratsch; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (CIAC, 2017)

The Minimum Shared Edges Problem on Grid-Like Graphs. - Till Fluschnik; Meike Hatzel; Steffen Härtlein; Hendrik Molter; Henning Seidler (WG, 2017)

A Parameterized View on Multi-Layer Cluster Editing. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (CoRR, 2017)

The Computational Complexity of Finding Separators in Temporal Graphs. - Philipp Zschoche; Till Fluschnik; Hendrik Molter; Rolf Niedermeier (CoRR, 2017)

Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. - Anne-Sophie Himmel; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (Soc. Netw. Anal. Min., 2017)

Listing All Maximal k-Plexes in Temporal Graphs. - Matthias Bentert; Anne-Sophie Himmel; Hendrik Molter; Marco Morik; Rolf Niedermeier; René Saitenmacher (ASONAM, 2018)

The Parameterized Complexity of Centrality Improvement in Networks. - Clemens Hoffmann 002; Hendrik Molter; Manuel Sorge (SOFSEM, 2018)

Temporal Graph Classes: A View Through Temporal Separators. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Philipp Zschoche (WG, 2018)

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Discret. Optim., 2018)

Enumerating Isolated Cliques in Temporal Networks. - Hendrik Molter; Rolf Niedermeier; Malte Renken (COMPLEX NETWORKS (2), 2019)

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. - Arnaud Casteigts; Anne-Sophie Himmel; Hendrik Molter; Philipp Zschoche (CoRR, 2019)

Listing All Maximal k-Plexes in Temporal Graphs. - Matthias Bentert; Anne-Sophie Himmel; Hendrik Molter; Marco Morik; Rolf Niedermeier; René Saitenmacher (ACM J. Exp. Algorithmics, 2019)

Assessing the computational complexity of multilayer subgraph detection. - Robert Bredereck; Christian Komusiewicz; Stefan Kratsch; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (Netw. Sci., 2019)

As Time Goes By: Reflections on Treewidth for Temporal Graphs. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Malte Renken; Philipp Zschoche (Treewidth, Kernels, and Algorithms, 2020)

Diminishable parameterized problems and strict polynomial kernelization. - Henning Fernau; Till Fluschnik; Danny Hermelin; Andreas Krebs; Hendrik Molter; Rolf Niedermeier (Comput., 2020)

Efficient algorithms for measuring the funnel-likeness of DAGs. - Marcelo Garlet Millani; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (J. Comb. Optim., 2020)

The complexity of finding small separators in temporal graphs. - Philipp Zschoche; Till Fluschnik; Hendrik Molter; Rolf Niedermeier (J. Comput. Syst. Sci., 2020)

h-Index manipulation by undoing merges. - René van Bevern; Christian Komusiewicz; Hendrik Molter; Rolf Niedermeier; Manuel Sorge; Toby Walsh (Quant. Sci. Stud., 2020)

Temporal graph classes: A view through temporal separators. - Till Fluschnik; Hendrik Molter; Rolf Niedermeier; Malte Renken; Philipp Zschoche (Theor. Comput. Sci., 2020)

Classic graph problems made temporal - a parameterized complexity analysis. - Hendrik Molter (2020)

Finding Temporal Paths Under Waiting Time Constraints. - Arnaud Casteigts; Anne-Sophie Himmel; Hendrik Molter; Philipp Zschoche (Algorithmica, 2021)

Parameterized Dynamic Cluster Editing. - Junjie Luo 001; Hendrik Molter; André Nichterlein; Rolf Niedermeier (Algorithmica, 2021)

Equitable Scheduling for the Total Completion Time Objective. - Danny Hermelin; Hendrik Molter; Rolf Niedermeier; Dvir Shabtay (CoRR, 2021)

Sliding window temporal graph coloring. - George B. Mertzios; Hendrik Molter; Viktor Zamaraev (J. Comput. Syst. Sci., 2021)

A Parameterized Complexity View on Collapsing k-Cores. - Junjie Luo 001; Hendrik Molter; Ondrej Suchý 001 (Theory Comput. Syst., 2021)

Isolation concepts applied to temporal clique enumeration. - Hendrik Molter; Rolf Niedermeier; Malte Renken (Netw. Sci., 2021)

Hardness of Interval Scheduling on Unrelated Machines. - Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Dvir Shabtay (IPEC, 2022)

Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. - Eugen Füchsle; Hendrik Molter; Rolf Niedermeier; Malte Renken (SAND, 2022)

Temporal Unit Interval Independent Sets. - Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Rolf Niedermeier (SAND, 2022)

Delay-Robust Routes in Temporal Graphs. - Eugen Füchsle; Hendrik Molter; Rolf Niedermeier; Malte Renken (STACS, 2022)

Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. - Danny Hermelin; Hendrik Molter; Dvir Shabtay (CoRR, 2022)

Feedback edge sets in temporal graphs. - Roman Haag; Hendrik Molter; Rolf Niedermeier; Malte Renken (Discret. Appl. Math., 2022)

The complexity of finding temporal separators under waiting time constraints. - Hendrik Molter (Inf. Process. Lett., 2022)

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? - Pascal Kunz 001; Hendrik Molter; Meirav Zehavi (IJCAI, 2023)

Interference-free walks in time: temporally disjoint paths. - Nina Klobas; George B. Mertzios; Hendrik Molter; Rolf Niedermeier; Philipp Zschoche (Auton. Agents Multi Agent Syst., 2023)

Realizing temporal graphs from fastest travel times. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (CoRR, 2023)

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. - Maciej Rymar; Hendrik Molter; André Nichterlein; Rolf Niedermeier (J. Graph Algorithms Appl., 2023)

Equitable scheduling on a single machine. - Klaus Heeger; Danny Hermelin; George B. Mertzios; Hendrik Molter; Rolf Niedermeier; Dvir Shabtay (J. Sched., 2023)

Temporal interval cliques and independent sets. - Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Rolf Niedermeier (Theor. Comput. Sci., 2023)

On finding separators in temporal split and permutation graphs. - Nicolas Maack; Hendrik Molter; Rolf Niedermeier; Malte Renken (J. Comput. Syst. Sci., 2023)

Computing maximum matchings in temporal graphs. - George B. Mertzios; Hendrik Molter; Rolf Niedermeier; Viktor Zamaraev; Philipp Zschoche (J. Comput. Syst. Sci., 2023)

How to Make Knockout Tournaments More Popular? - Juhi Chaudhary; Hendrik Molter; Meirav Zehavi (AAAI, 2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. - Matthias Kaul; Matthias Mnich; Hendrik Molter (IPEC, 2024)

Realizing temporal transportation trees. - George B. Mertzios; Hendrik Molter; Paul G. Spirakis (CoRR, 2024)

Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. - Danny Hermelin; Hendrik Molter; Dvir Shabtay (INFORMS J. Comput., 2024)

On the parameterized complexity of interval scheduling with eligible machine sets. - Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Dvir Shabtay (J. Comput. Syst. Sci., 2024)

The complexity of computing optimum labelings for temporal connectivity. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (J. Comput. Syst. Sci., 2024)

Temporal reachability minimization: Delaying vs. deleting. - Hendrik Molter; Malte Renken; Philipp Zschoche (J. Comput. Syst. Sci., 2024)

Algorithmic aspects of temporal betweenness. - Sebastian Buß 002; Hendrik Molter; Rolf Niedermeier; Maciej Rymar (Netw. Sci., 2024)

Cluster Editing for Multi-Layer and Temporal Graphs. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments. - Juhi Chaudhary; Hendrik Molter; Meirav Zehavi (AAAI, 2025)

Treewidth Parameterized by Feedback Vertex Number. - Hendrik Molter; Meirav Zehavi; Amit Zivan (ICALP, 2025)

Temporal Graph Realization with Bounded Stretch. - George B. Mertzios; Hendrik Molter; Nils Morawietz; Paul G. Spirakis (MFCS, 2025)

Tournament Robustness via Redundancy. - Klim Efremenko; Hendrik Molter; Meirav Zehavi (EC, 2025)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. - Klaus Heeger; Hendrik Molter (STACS, 2025)

Fairness in repetitive scheduling. - Danny Hermelin; Hendrik Molter; Rolf Niedermeier; Michael L. Pinedo; Dvir Shabtay (Eur. J. Oper. Res., 2025)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments. - Juhi Chaudhary; Hendrik Molter; Meirav Zehavi (J. Artif. Intell. Res., 2025)

The complexity of transitively orienting temporal graphs. - George B. Mertzios; Hendrik Molter; Malte Renken; Paul G. Spirakis; Philipp Zschoche (J. Comput. Syst. Sci., 2025)

Temporal graph realization from fastest paths. - Nina Klobas; George B. Mertzios; Hendrik Molter; Paul G. Spirakis (Theor. Comput. Sci., 2025)

Counting Temporal Paths. - Jessica A. Enright; Kitty Meeks; Hendrik Molter (Algorithmica, 2025)

On Kernelization with Access to NP-Oracles. - Hendrik Molter; Meirav Zehavi (CoRR, 2025)

Fair Repetitive Interval Scheduling. - Klaus Heeger; Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Dvir Shabtay (Algorithmica, 2025)