Hendrik Molter

According to our database, Hendrik Molter authored at least 55 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Realizing temporal transportation trees.

George B. Mertzios, Hendrik Molter, Paul G. Spirakis

CoRR, 2024

Parameterized Analysis of Bribery in Challenge the Champ Tournaments.

Juhi Chaudhary, Hendrik Molter, Meirav Zehavi

CoRR, 2024

How to Make Knockout Tournaments More Popular?

Juhi Chaudhary, Hendrik Molter, Meirav Zehavi

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Computing maximum matchings in temporal graphs.

George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche

J. Comput. Syst. Sci., November, 2023

On finding separators in temporal split and permutation graphs.

Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken

J. Comput. Syst. Sci., August, 2023

Temporal interval cliques and independent sets.

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier

Theor. Comput. Sci., June, 2023

Equitable scheduling on a single machine.

Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay

J. Sched., 2023

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality.

Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier

J. Graph Algorithms Appl., 2023

Realizing temporal graphs from fastest travel times.

Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis

CoRR, 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

Counting Temporal Paths.

Jessica A. Enright, Kitty Meeks, Hendrik Molter

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

Pascal Kunz, Hendrik Molter, Meirav Zehavi

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

The complexity of finding temporal separators under waiting time constraints.

Hendrik Molter

Inf. Process. Lett., 2022

Feedback edge sets in temporal graphs.

Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken

Discret. Appl. Math., 2022

Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights.

Danny Hermelin, Hendrik Molter, Dvir Shabtay

CoRR, 2022

Delay-Robust Routes in Temporal Graphs.

Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Temporal Unit Interval Independent Sets.

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Temporal Connectivity: Coping with Foreseen and Unforeseen Delays.

Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

The Complexity of Computing Optimum Labelings for Temporal Connectivity.

Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Hardness of Interval Scheduling on Unrelated Machines.

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

Isolation concepts applied to temporal clique enumeration.

Hendrik Molter, Rolf Niedermeier, Malte Renken

Netw. Sci., October, 2021

A Parameterized Complexity View on Collapsing k-Cores.

Junjie Luo, Hendrik Molter, Ondrej Suchý

Theory Comput. Syst., 2021

Sliding window temporal graph coloring.

George B. Mertzios, Hendrik Molter, Viktor Zamaraev

J. Comput. Syst. Sci., 2021

Equitable Scheduling for the Total Completion Time Objective.

Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay

CoRR, 2021

Parameterized Dynamic Cluster Editing.

Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier

Algorithmica, 2021

Finding Temporal Paths Under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

Algorithmica, 2021

Temporal Reachability Minimization: Delaying vs. Deleting.

Hendrik Molter, Malte Renken, Philipp Zschoche

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Complexity of Transitively Orienting Temporal Graphs.

George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Classic graph problems made temporal - a parameterized complexity analysis.

Hendrik Molter

PhD thesis, 2020

Temporal graph classes: A view through temporal separators.

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche

Theor. Comput. 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

The complexity of finding small separators in temporal graphs.

Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier

J. Comput. Syst. Sci., 2020

Efficient algorithms for measuring the funnel-likeness of DAGs.

Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

J. Comb. Optim., 2020

Diminishable parameterized problems and strict polynomial kernelization.

Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier

Comput., 2020

Algorithmic Aspects of Temporal Betweenness.

Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Assessing the computational complexity of multilayer subgraph detection.

Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

Netw. Sci., 2019

Listing All Maximal <i>k</i>-Plexes in Temporal Graphs.

Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher

ACM J. Exp. Algorithmics, 2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

CoRR, 2019

Enumerating Isolated Cliques in Temporal Networks.

Hendrik Molter, Rolf Niedermeier, Malte Renken

Proceedings of the Complex Networks and Their Applications VIII, 2019

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ý

Discret. Optim., 2018

Temporal Graph Classes: A View Through Temporal Separators.

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

The Parameterized Complexity of Centrality Improvement in Networks.

Clemens Hoffmann, Hendrik Molter, Manuel Sorge

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Cluster Editing in Multi-Layer and Temporal Graphs.

Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Listing All Maximal k-Plexes in Temporal Graphs.

Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher

Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

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

The Computational Complexity of Finding Separators in Temporal Graphs.

Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier

CoRR, 2017

A Parameterized View on Multi-Layer Cluster Editing.

Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý

CoRR, 2017

The Minimum Shared Edges Problem on Grid-Like Graphs.

Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Assessing the Computational Complexity of Multi-layer Subgraph Detection.

Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Firefighting as a Strategic Game.

Carme Àlvarez, Maria J. Blesa, Hendrik Molter

Internet Math., 2016

Finding Secluded Places of Special Interest in Graphs.

René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Enumerating maximal cliques in temporal graphs.

Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2014

Firefighting as a Game.

Carme Àlvarez, Maria J. Blesa, Hendrik Molter

Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2012

ACO Beats EA on a Dynamic Pseudo-Boolean Function.

Timo Kötzing, Hendrik Molter

Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012