direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Hendrik Molter, PhD student
Address:
Technische Universität Berlin
Fakultät IV
Sekr. TEL 5-1
Ernst-Reuter-Platz 7
10587 Berlin







Room:
TEL 508
Phone:
+49 30 314 258 12
E-Mail:
h.molter 'at' tu-berlin.de
Research Interests:
parameterized algorithms and complexity
temporal and multi-layer graph problems
graph theory

Journal Publications

2020

Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, and Rolf Niedermeier.
Diminishable Parameterized Problems and Strict Polynomial Kernelization.
Computability, 9(1):1–24, 2020.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Malte Renken and Philipp Zschoche.
Temporal graph classes: A view through temporal separators.
Theoretical Computer Science, 806:197–218, Elsevier, 2020.
Bibtex entry Link to publication
Link to original publication
Philipp Zschoche and Till Fluschnik and Hendrik Molter and Rolf Niedermeier.
The Complexity of Finding Small Separators in Temporal Graphs.
Journal of Computer and System Sciences, 107:72–92, Elsevier, 2020.
Bibtex entry Link to publication
Link to original publication
Marcelo Garlet Millani and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Efficient Algorithms for Measuring the Funnel-likeness of DAGs.
Journal of Combinatorial Optimization, 39:216–245, 2020.
Bibtex entry Link to publication
Link to original publication
Junjie Luo and Hendrik Molter and André Nichterlein and Rolf Niedermeier.
Parameterized Dynamic Cluster Editing.
Algorithmica, Springer, 2020. Accepted for publication.
Bibtex entry Link to publication
Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, and Rolf Niedermeier.
Diminishable Parameterized Problems and Strict Polynomial Kernelization.
Computability, 9(1):1–24, 2020.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Malte Renken and Philipp Zschoche.
Temporal graph classes: A view through temporal separators.
Theoretical Computer Science, 806:197–218, Elsevier, 2020.
Bibtex entry Link to publication
Link to original publication
Philipp Zschoche and Till Fluschnik and Hendrik Molter and Rolf Niedermeier.
The Complexity of Finding Small Separators in Temporal Graphs.
Journal of Computer and System Sciences, 107:72–92, Elsevier, 2020.
Bibtex entry Link to publication
Link to original publication
Marcelo Garlet Millani and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Efficient Algorithms for Measuring the Funnel-likeness of DAGs.
Journal of Combinatorial Optimization, 39:216–245, 2020.
Bibtex entry Link to publication
Link to original publication
Junjie Luo and Hendrik Molter and André Nichterlein and Rolf Niedermeier.
Parameterized Dynamic Cluster Editing.
Algorithmica, Springer, 2020. Accepted for publication.
Bibtex entry Link to publication

2019

Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher.
Listing All Maximal k-Plexes in Temporal Graphs.
ACM Journal of Experimental Algorithmics, 24(1):1–13, ACM, 2019.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Assessing the Computational Complexity of Multi-Layer Subgraph Detection.
Network Science, 7(2):215–241, Cambridge University Press, 2019.
Bibtex entry Link to publication
Link to original publication
Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher.
Listing All Maximal k-Plexes in Temporal Graphs.
ACM Journal of Experimental Algorithmics, 24(1):1–13, ACM, 2019.
Bibtex entry Link to publication
Link to original publication
Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Assessing the Computational Complexity of Multi-Layer Subgraph Detection.
Network Science, 7(2):215–241, Cambridge University Press, 2019.
Bibtex entry Link to publication
Link to original publication

2018

René van Bevern and Till Fluschnik and George B. Mertzios and Hendrik Molter and Manuel Sorge and Ondrej Suchý.
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discrete Optimization, 30:20–50, 2018.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Till Fluschnik and George B. Mertzios and Hendrik Molter and Manuel Sorge and Ondrej Suchý.
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discrete Optimization, 30:20–50, 2018.
Bibtex entry Link to publication
Link to original publication

2017

Anne-Sophie Himmel and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.
Social Network Analysis and Mining, 7(1):35:1–35:16, 2017.
Bibtex entry Link to publication
Link to original publication

Conference Publications

2020

George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Viktor Zamaraev and Philipp Zschoche.
Computing Maximum Matchings in Temporal Graphs.
In Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS '20), pages 27:1–27:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Roman Haag and Hendrik Molter and Rolf Niedermeier and Malte Renken.
Feedback Edge Sets in Temporal Graphs.
In Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '20), Springer, 2020. Accepted for publication.
Bibtex entry Link to publication
Sebastian Buß and Hendrik Molter and Rolf Niedermeier and Maciej Rymar.
Algorithmic Aspects of Temporal Betweenness.
In Proceedings of the 26th SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '20), 2020. Accepted for publication.
Bibtex entry Link to publication
George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Viktor Zamaraev and Philipp Zschoche.
Computing Maximum Matchings in Temporal Graphs.
In Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS '20), pages 27:1–27:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Roman Haag and Hendrik Molter and Rolf Niedermeier and Malte Renken.
Feedback Edge Sets in Temporal Graphs.
In Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '20), Springer, 2020. Accepted for publication.
Bibtex entry Link to publication
Sebastian Buß and Hendrik Molter and Rolf Niedermeier and Maciej Rymar.
Algorithmic Aspects of Temporal Betweenness.
In Proceedings of the 26th SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '20), 2020. Accepted for publication.
Bibtex entry Link to publication

2019

George B. Mertzios and Hendrik Molter and Viktor Zamaraev.
Sliding Window Temporal Graph Coloring.
In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19), pages 7667–7674. AAAI Press, 2019.
Bibtex entry Link to publication
Link to original publication
Hendrik Molter and Rolf Niedermeier and Malte Renken.
Enumerating Isolated Cliques in Temporal Networks.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 519–531. Springer, 2019.
Bibtex entry Link to publication
Link to original publication
George B. Mertzios and Hendrik Molter and Viktor Zamaraev.
Sliding Window Temporal Graph Coloring.
In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI '19), pages 7667–7674. AAAI Press, 2019.
Bibtex entry Link to publication
Link to original publication
Hendrik Molter and Rolf Niedermeier and Malte Renken.
Enumerating Isolated Cliques in Temporal Networks.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 519–531. Springer, 2019.
Bibtex entry Link to publication
Link to original publication

2018

Clemens Hoffmann and Hendrik Molter and Manuel Sorge.
The Parameterized Complexity of Centrality Improvement in Networks.
In Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '18), pages 111–124. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Marcelo Garlet Millani and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Efficient Algorithms for Measuring the Funnel-likeness of DAGs.
In Proceedings of the 5th International Symposium on Combinatorial Optimization (ISCO '18), pages 183–195. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Philipp Zschoche.
Temporal Graph Classes: A View Through Temporal Separators.
In Proceedings of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '18), pages 216–227. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Henning Fernau and Till Fluschnik and Danny Hermelin and Andreas Krebs and Hendrik Molter and Rolf Niedermeier.
Diminishable Parameterized Problems and Strict Polynomial Kernelization.
In Proceedings of the 14th Conference on Computability in Europe (CiE '18), pages 161–171. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Philipp Zschoche and Till Fluschnik and Hendrik Molter and Rolf Niedermeier.
The Complexity of Finding Small Separators in Temporal Graphs.
In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS '18), pages 45:1–45:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication
Junjie Luo and Hendrik Molter and Ondrej Suchý.
A Parameterized Complexity View on Collapsing k-Cores.
In Proceedings of the 13th International Symposium on Parameterized and Exact Computation (IPEC '18), pages 7:1–7:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication
Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher.
Listing All Maximal k-Plexes in Temporal Graphs.
In Proceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM '18), pages 41–46. IEEE Computer Society, 2018.
Bibtex entry Link to publication
Link to original publication
Jiehua Chen and Hendrik Molter and Manuel Sorge and Ondrej Suchý.
Cluster Editing in Multi-Layer and Temporal Graphs.
In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), pages 24:1–24:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication
Junjie Luo and Hendrik Molter and André Nichterlein and Rolf Niedermeier.
Parameterized Dynamic Cluster Editing.
In Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '18), pages 46:1–46:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication
Clemens Hoffmann and Hendrik Molter and Manuel Sorge.
The Parameterized Complexity of Centrality Improvement in Networks.
In Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '18), pages 111–124. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Marcelo Garlet Millani and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Efficient Algorithms for Measuring the Funnel-likeness of DAGs.
In Proceedings of the 5th International Symposium on Combinatorial Optimization (ISCO '18), pages 183–195. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Philipp Zschoche.
Temporal Graph Classes: A View Through Temporal Separators.
In Proceedings of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '18), pages 216–227. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Henning Fernau and Till Fluschnik and Danny Hermelin and Andreas Krebs and Hendrik Molter and Rolf Niedermeier.
Diminishable Parameterized Problems and Strict Polynomial Kernelization.
In Proceedings of the 14th Conference on Computability in Europe (CiE '18), pages 161–171. Springer International Publishing, 2018.
Bibtex entry Link to publication
Link to original publication
Philipp Zschoche and Till Fluschnik and Hendrik Molter and Rolf Niedermeier.
The Complexity of Finding Small Separators in Temporal Graphs.
In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS '18), pages 45:1–45:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication
Junjie Luo and Hendrik Molter and Ondrej Suchý.
A Parameterized Complexity View on Collapsing k-Cores.
In Proceedings of the 13th International Symposium on Parameterized and Exact Computation (IPEC '18), pages 7:1–7:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication
Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher.
Listing All Maximal k-Plexes in Temporal Graphs.
In Proceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM '18), pages 41–46. IEEE Computer Society, 2018.
Bibtex entry Link to publication
Link to original publication
Jiehua Chen and Hendrik Molter and Manuel Sorge and Ondrej Suchý.
Cluster Editing in Multi-Layer and Temporal Graphs.
In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), pages 24:1–24:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication
Junjie Luo and Hendrik Molter and André Nichterlein and Rolf Niedermeier.
Parameterized Dynamic Cluster Editing.
In Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '18), pages 46:1–46:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.
Bibtex entry Link to publication
Link to original publication

2017

Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Assessing the Computational Complexity of Multi-Layer Subgraph Detection.
In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC '17), pages 128–139. Springer International Publishing, 2017.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Till Fluschnik and George B. Mertzios and Hendrik Molter and Manuel Sorge and Ondrej Suchý.
Finding Secluded Places of Special Interest in Graphs.
In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC '16), pages 5:1–5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Meike Hatzel and Steffen Härtlein and Hendrik Molter and Henning Seidler.
The Minimum Shared Edges Problem on Grid-like Graphs.
In Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '17), pages 249–262. Springer International Publishing, 2017.
Bibtex entry Link to publication
Link to original publication

2016

Anne-Sophie Himmel and Hendrik Molter and Rolf Niedermeier and Manuel Sorge.
Enumerating maximal cliques in temporal graphs.
In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (ASONAM '16), pages 337–344. IEEE Computer Society, 2016.
Bibtex entry Link to publication
Link to original publication
René van Bevern and Hendrik Molter and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge and Toby Walsh.
h-Index Manipulation by Undoing Merges.
In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI '16), pages 895–903. IOS Press, 2016.
Bibtex entry Link to publication
Link to original publication

To top

Zusatzinformationen / Extras