Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Hendrik Molter
Observed names:
H. Gregor Molter,
Molter Hendrik,
Molter, Hendrik
Institutions:
Ben-Gurion University of the Negev,
Hasso Plattner Institute
Observed institutions:
Ben-Gurion University of the Negev,
Hasso Plattner Institute,
Durham University,
Technische Universität Berlin,
Saarland University,
Universitat Politècnica de Catalunya
show all 6
ORCID:
0000-0002-4590-798X
Observed ORCID:
0000-0002-4590-798X
OpenAlex ID:
A5102795134
The complexity of finding small separators in temporal graphs
2019
·
Philipp Zschoche
, Till Fluschnik
, et al.
·
Journal of Computer and System Sciences
·
126
PDF
Finding Temporal Paths Under Waiting Time Constraints
2021
·
Arnaud Casteigts
, Anne-Sophie Himmel
, et al.
·
Algorithmica
·
119
PDF
Temporal Graph Classes: A View Through Temporal Separators
2018
·
Till Fluschnik
, Hendrik Molter
, et al.
·
Theoretical Computer Science
·
103
PDF
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
2017
·
Anne-Sophie Himmel
, Hendrik Molter
, et al.
·
Social Network Analysis and Mining
·
96
PDF
Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes
2021
·
Esther Ulitzsch
, Qiwei He
, et al.
·
Psychometrika
·
65
PDF
Enumerating maximal cliques in temporal graphs
2016
·
Anne-Sophie Himmel
, Hendrik Molter
, et al.
·
IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
·
56
Algorithmic Aspects of Temporal Betweenness
2020
·
Sebastian Buß
, Hendrik Molter
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
51
Finding Temporal Paths Under Waiting Time Constraints
2019
·
Casteigts, Arnaud
, Himmel, Anne-Sophie
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
50
PDF
Listing All Maximal k -Plexes in Temporal Graphs
2019
·
Matthias Bentert
, Anne-Sophie Himmel
, et al.
·
ACM Journal of Experimental Algorithmics
·
48
ACO Beats EA on a Dynamic Pseudo-Boolean Function
2012
·
Timo Kötzing
, Hendrik Molter
·
Lecture notes in computer science
·
48
Sliding window temporal graph coloring
2021
·
George B. Mertzios
, Hendrik Molter
, et al.
·
Journal of Computer and System Sciences
·
46
Computing Maximum Matchings in Temporal Graphs
2022
·
George B. Mertzios
, Hendrik Molter
, et al.
·
Journal of Computer and System Sciences
·
41
Interference-free walks in time: temporally disjoint paths
2022
·
Nina Klobas
, George B. Mertzios
, et al.
·
Autonomous Agents and Multi-Agent Systems
·
40
PDF
Counting Temporal Paths
2025
·
Jessica Enright
, Kitty Meeks
, et al.
·
Algorithmica
·
34
As Time Goes By: Reflections on Treewidth for Temporal Graphs
2020
·
Till Fluschnik
, Hendrik Molter
, et al.
·
Lecture notes in computer science
·
32
PDF
Delay-Robust Routes in Temporal Graphs
2022
·
Füchsle, Eugen
, Molter, Hendrik
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
30
PDF
Computing Maximum Matchings in Temporal Graphs
2019
·
Mertzios, George B.
, Molter, Hendrik
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
30
PDF
Feedback edge sets in temporal graphs
2021
·
Roman Haag
, Hendrik Molter
, et al.
·
Discrete Applied Mathematics
·
25
Sliding Window Temporal Graph Coloring
2019
·
George B. Mertzios
, Hendrik Molter
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
24
Listing All Maximal k-Plexes in Temporal Graphs
2018
·
Matthias Bentert
, Anne-Sophie Himmel
, et al.
·
IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
·
24
PDF
The complexity of computing optimum labelings for temporal connectivity
2024
·
Nina Klobas
, George B. Mertzios
, et al.
·
Journal of Computer and System Sciences
·
22
Cluster Editing for Multi-Layer and Temporal Graphs
2017
·
Chen, Jiehua
, Molter, Hendrik
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
22
PDF
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
2023
·
Pascal Kunz
, Hendrik Molter
, et al.
·
International Joint Conference on Artificial Intelligence
·
20
PDF
Equitable scheduling on a single machine
2022
·
Klaus Heeger
, Danny Hermelin
, et al.
·
Journal of Scheduling
·
20
PDF
Parameterized Dynamic Cluster Editing
2020
·
Junjie Luo
, Hendrik Molter
, et al.
·
Algorithmica
·
20
PDF
Show more works
View as search
Works count:
95
Citation count:
1,681
H-index:
22
I10-index:
49
Year
Topic
Type