default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMalte Renken
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Vincent Froese, Malte Renken:
Terrain-like graphs and the median Genocchi numbers. Eur. J. Comb. 115: 103780 (2024)- [j11]Hendrik Molter, Malte Renken, Philipp Zschoche:
Temporal reachability minimization: Delaying vs. deleting. J. Comput. Syst. Sci. 144: 103549 (2024) - [j10]Arnaud Casteigts
, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. SIAM J. Comput. 53(2): 346-388 (2024) - [c19]Till Fluschnik, Leon Kellerhals, Malte Renken:
Locally Rainbow Paths. AAAI 2024: 8013-8021 - [i20]Till Fluschnik, Leon Kellerhals, Malte Renken:
Locally Rainbow Paths. CoRR abs/2402.12905 (2024) - 2023
- [b1]Malte Renken:
Algorithmic and structural aspects of temporal graphs. Technical University of Berlin, Germany, 2023 - [j9]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. 135: 1-14 (2023) - [j8]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37(3): 1674-1703 (2023) - [c18]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - [c17]Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller:
Finding Degree-Constrained Acyclic Orientations. IPEC 2023: 19:1-19:14 - 2022
- [j7]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback edge sets in temporal graphs. Discret. Appl. Math. 307: 65-78 (2022) - [c16]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND 2022: 17:1-17:17 - [c15]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Delay-Robust Routes in Temporal Graphs. STACS 2022: 30:1-30:15 - [c14]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT 2022: 29:1-29:19 - [i19]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR abs/2201.05011 (2022) - [i18]Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Delay-Robust Routes in Temporal Graphs. CoRR abs/2201.05390 (2022) - [i17]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. CoRR abs/2205.14888 (2022) - [i16]Vincent Froese, Malte Renken:
Terrain-like Graphs and the Median Genocchi Numbers. CoRR abs/2210.16281 (2022) - 2021
- [j6]Vincent Froese, Malte Renken:
Persistent Graphs and Cyclic Polytope Triangulations. Comb. 41(3): 407-423 (2021) - [j5]Vincent Froese, Malte Renken:
A Fast Shortest Path Algorithm on Terrain-like Graphs. Discret. Comput. Geom. 66(2): 737-750 (2021) - [j4]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9(S1): S83-S105 (2021) - [j3]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage graph problems on a global budget. Theor. Comput. Sci. 868: 46-64 (2021) - [c13]Leon Kellerhals, Malte Renken, Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems. ESA 2021: 55:1-55:17 - [c12]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. FCT 2021: 385-398 - [c11]Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. FOCS 2021: 319-326 - [c10]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP 2021: 26:1-26:14 - [c9]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. IJCAI 2021: 45-51 - [c8]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. MFCS 2021: 75:1-75:18 - [c7]Hendrik Molter, Malte Renken, Philipp Zschoche:
Temporal Reachability Minimization: Delaying vs. Deleting. MFCS 2021: 76:1-76:15 - [i15]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021) - [i14]Hendrik Molter, Malte Renken, Philipp Zschoche:
Temporal Reachability Minimization: Delaying vs. Deleting. CoRR abs/2102.10814 (2021) - [i13]Leon Kellerhals, Malte Renken, Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems. CoRR abs/2105.04856 (2021) - [i12]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. CoRR abs/2105.05987 (2021) - [i11]Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. CoRR abs/2105.12003 (2021) - [i10]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR abs/2107.04321 (2021) - 2020
- [j2]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing temporal graphs using dynamic time warping. Soc. Netw. Anal. Min. 10(1): 50 (2020) - [j1]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. 806: 197-218 (2020) - [c6]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms 2020: 49-77 - [c5]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback Edge Sets in Temporal Graphs. WG 2020: 200-212 - [i9]Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback Edge Sets in Temporal Graphs. CoRR abs/2003.13641 (2020) - [i8]Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR abs/2004.13491 (2020) - [i7]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a geometric lens to find k disjoint shortest paths. CoRR abs/2007.12502 (2020) - [i6]Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. CoRR abs/2011.03738 (2020)
2010 – 2019
- 2019
- [c4]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing Temporal Graphs Using Dynamic Time Warping. COMPLEX NETWORKS (2) 2019: 469-480 - [c3]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Enumerating Isolated Cliques in Temporal Networks. COMPLEX NETWORKS (2) 2019: 519-531 - [i5]Vincent Froese, Malte Renken:
Advancing Through Terrains. CoRR abs/1904.08746 (2019) - [i4]Hendrik Molter, Rolf Niedermeier, Malte Renken:
Enumerating Isolated Cliques in Temporal Networks. CoRR abs/1909.06292 (2019) - [i3]Vincent Froese, Malte Renken:
Terrain Visibility Graphs and Cyclic Polytope Triangulations. CoRR abs/1911.05012 (2019) - [i2]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage Problems on a Global Budget. CoRR abs/1912.04392 (2019) - 2018
- [i1]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing Temporal Graphs Using Dynamic Time Warping. CoRR abs/1810.06240 (2018) - 2017
- [c2]Malte Renken, Amin Ahmadi, Ralf Borndörfer, Güvenç Sahin, Thomas Schlechte:
Demand-Driven Line Planning with Selfish Routing. OR 2017: 687-692 - 2016
- [c1]Ralf Borndörfer, Oytun Arslan, Ziena Elijazyfer, Hakan Güler, Malte Renken, Güvenç Sahin, Thomas Schlechte:
Line Planning on Path Networks with Application to the Istanbul Metrobüs. OR 2016: 235-241
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
