direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

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







Room:
TEL 509
Phone:
+49 30 314 241 66
E-Mail:
h.molter 'at' tu-berlin.de
Research Interests:
parameterized complexity
temporal and multi-layer graph problems
graph theory
Office hour
Tuesday 17-18

Journal Publications

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, 2018. Accepted for publication.
Bibtex entry Link to 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

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), 2018. Accepted for publication.
Bibtex entry Link to 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), Springer International Publishing, 2018. Accepted for publication.
Bibtex entry Link to 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), Springer International Publishing, 2018. Accepted for publication.
Bibtex entry Link to 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), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. Accepted for publication.
Bibtex entry Link to 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), 2018. Accepted for publication.
Bibtex entry Link to 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), 2018. Accepted for publication.
Bibtex entry Link to 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