Malte Renken

Orcid: 0000-0002-1450-1901

According to our database1, Malte Renken authored at least 30 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Terrain-like graphs and the median Genocchi numbers.
Eur. J. Comb., January, 2024

Sharp Thresholds in Random Simple Temporal Graphs.
SIAM J. Comput., 2024

Locally Rainbow Paths.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths.
SIAM J. Discret. Math., September, 2023

On finding separators in temporal split and permutation graphs.
J. Comput. Syst. Sci., August, 2023

Algorithmic and structural aspects of temporal graphs.
PhD thesis, 2023

Finding Degree-Constrained Acyclic Orientations.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Giant Components in Random Temporal Graphs.
Proceedings of the Approximation, 2023

2022
Feedback edge sets in temporal graphs.
Discret. Appl. Math., 2022

Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Delay-Robust Routes in Temporal Graphs.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Temporal Connectivity: Coping with Foreseen and Unforeseen Delays.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2021
Isolation concepts applied to temporal clique enumeration.
Netw. Sci., October, 2021

Multistage graph problems on a global budget.
Theor. Comput. Sci., 2021

A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discret. Comput. Geom., 2021

Persistent Graphs and Cyclic Polytope Triangulations.
Comb., 2021

Temporal Reachability Minimization: Delaying vs. Deleting.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Complexity of Transitively Orienting Temporal Graphs.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Two Influence Maximization Games on Graphs Made Temporal.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Using a Geometric Lens to Find k Disjoint Shortest Paths.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Parameterized Algorithms for Diverse Multistage Problems.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Temporal graph classes: A view through temporal separators.
Theor. Comput. Sci., 2020

Comparing temporal graphs using dynamic time warping.
Soc. Netw. Anal. Min., 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019
Multistage Problems on a Global Budget.
CoRR, 2019

Terrain Visibility Graphs and Cyclic Polytope Triangulations.
CoRR, 2019

Advancing Through Terrains.
CoRR, 2019

Enumerating Isolated Cliques in Temporal Networks.
Proceedings of the Complex Networks and Their Applications VIII, 2019

2017
Demand-Driven Line Planning with Selfish Routing.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
Line Planning on Path Networks with Application to the Istanbul Metrobüs.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016


  Loading...