Hendrik Molter

1. Feedback Edge Sets in Temporal Graphs
   2020/03/30 by Roman Haag, Hendrik Molter, Haag, Roman +5 · 2 citations
   Computer Science · #Caching and Content Delivery #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Error Correcting Code Techniques #FOS: Computer and information sciences #Opportunistic and Delay-Tolerant Networks
2. Adapting the Bron-Kerbosch Algorithm for Enumerating Maximal Cliques in\n Temporal Graphs
   2016/05/12 by Anne-Sophie Himmel, Himmel, Anne-Sophie, Hendrik Molter +5 · 1 citation
   Computer Science · Physics and Astronomy · Social Sciences · #Complex Network Analysis Techniques #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Human Mobility and Location-Based Analysis #Opportunistic and Delay-Tolerant Networks #Social and Information Networks (cs.SI)
3. The Complexity of Transitively Orienting Temporal Graphs
   2021/02/12 by George B. Mertzios, Mertzios, George B., Hendrik Molter +7 · 1 citation
   Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Opportunistic and Delay-Tolerant Networks #Topological and Geometric Data Analysis
4. Diminishable Parameterized Problems and Strict Polynomial Kernelization
   2016/11/11 by Henning Fernau, Till Fluschnik, Fernau, Henning +9 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #semigroups and automata theory