default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Rost
Person information
- affiliation (PhD 2019): Technical University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Anya Chaturvedi
, Chandra Chekuri, Mengxue Liu, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber:
Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands. IEEE/ACM Trans. Netw. 32(2): 1435-1450 (2024)- 2022
- [j9]Anya Chaturvedi, Chandra Chekuri, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber:
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands. SIGMETRICS Perform. Evaluation Rev. 49(3): 22-27 (2022) - 2021
- [c18]Robin Münk, Matthias Rost, Harald Räcke, Stefan Schmid:
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. Networking 2021: 1-3 - [c17]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. SPAA 2021: 221-231 - [i12]Robin Münk, Matthias Rost, Stefan Schmid, Harald Räcke:
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. CoRR abs/2104.09249 (2021) - [i11]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. CoRR abs/2105.07006 (2021) - 2020
- [j8]Matthias Rost, Stefan Schmid:
On the Hardness and Inapproximability of Virtual Network Embeddings. IEEE/ACM Trans. Netw. 28(2): 791-803 (2020) - [c16]Niklas Semmler, Matthias Rost, Georgios Smaragdakis, Anja Feldmann:
Edge replication strategies for wide-area distributed processing. EdgeSys@EuroSys 2020: 1-6 - [c15]Balázs Németh, Yvonne-Anne Pignolet, Matthias Rost, Stefan Schmid, Balázs Vass:
Cost-Efficient Embedding of Virtual Networks With and Without Routing Flexibility. Networking 2020: 476-484 - [i10]Anya Chaturvedi, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber:
Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks. CoRR abs/2005.04533 (2020)
2010 – 2019
- 2019
- [b1]Matthias Rost:
Virtual network embeddings: Theoretical foundations and provably good algorithms. Technical University of Berlin, Germany, 2019 - [j7]Matthias Rost, Elias Döhne, Stefan Schmid:
Parametrized complexity of virtual network embeddings: dynamic & linear programming approximations. Comput. Commun. Rev. 49(1): 3-10 (2019) - [j6]Matthias Rost, Stefan Schmid:
Virtual Network Embedding Approximations: Leveraging Randomized Rounding. IEEE/ACM Trans. Netw. 27(5): 2071-2084 (2019) - [c14]Mengxue Liu, Andréa W. Richa, Matthias Rost, Stefan Schmid:
A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling. INFOCOM 2019: 46-54 - [c13]Susanna Schwarzmann, Paula Breitbach, Thomas Zinner, Matthias Rost:
Modeling Adaptive Video Streaming Using Discrete-Time Analysis. ITC 2019: 121-129 - 2018
- [j5]Tamás Lukovszki, Matthias Rost, Stefan Schmid:
Approximate and incremental network function placement. J. Parallel Distributed Comput. 120: 159-169 (2018) - [j4]Arne Ludwig, Szymon Dudycz, Matthias Rost, Stefan Schmid:
Transiently Policy-Compliant Network Updates. IEEE/ACM Trans. Netw. 26(6): 2569-2582 (2018) - [c12]Balázs Németh, Mark Szalay, Janos Doka, Matthias Rost, Stefan Schmid, László Toka, Balázs Sonkoly:
Fast and efficient network service embedding method with adaptive offloading to the edge. INFOCOM Workshops 2018: 178-183 - [c11]Matthias Rost, Stefan Schmid:
Charting the Complexity Landscape of Virtual Network Embeddings. Networking 2018: 55-63 - [c10]Matthias Rost, Stefan Schmid:
Virtual Network Embedding Approximations: Leveraging Randomized Rounding. Networking 2018: 370-378 - [i9]Matthias Rost, Stefan Schmid:
NP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants. CoRR abs/1801.03162 (2018) - [i8]Matthias Rost, Stefan Schmid:
Virtual Network Embedding Approximations: Leveraging Randomized Rounding. CoRR abs/1803.03622 (2018) - [i7]Matthias Rost, Stefan Schmid:
(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem. CoRR abs/1803.04452 (2018) - 2017
- [i6]Tamás Lukovszki, Matthias Rost, Stefan Schmid:
Approximate and Incremental Network Function Placement. CoRR abs/1706.06496 (2017) - 2016
- [j3]Tamás Lukovszki, Matthias Rost, Stefan Schmid:
It's a Match!: Near-Optimal and Incremental Middlebox Deployment. Comput. Commun. Rev. 46(1): 30-36 (2016) - [c9]Balázs Németh, Balázs Sonkoly, Matthias Rost, Stefan Schmid:
Efficient service graph embedding: A practical approach. NFV-SDN 2016: 19-25 - [c8]Arne Ludwig, Szymon Dudycz, Matthias Rost, Stefan Schmid:
Transiently Secure Network Updates. SIGMETRICS 2016: 273-284 - [c7]Guy Even, Matthias Rost, Stefan Schmid:
An Approximation Algorithm for Path Computation and Function Placement in SDNs. SIROCCO 2016: 374-390 - [c6]Vasileios Kotronis, Rowan Klöti, Matthias Rost, Panagiotis Georgopoulos, Bernhard Ager, Stefan Schmid, Xenofontas A. Dimitropoulos:
Stitching Inter-Domain Paths over IXPs. SOSR 2016: 17 - [i5]Guy Even, Matthias Rost, Stefan Schmid:
An Approximation Algorithm for Path Computation and Function Placement in SDNs. CoRR abs/1603.09158 (2016) - [i4]Matthias Rost, Stefan Schmid:
Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding. CoRR abs/1604.02180 (2016) - [i3]Vasileios Kotronis, Rowan Klöti, Matthias Rost, Panagiotis Georgopoulos, Bernhard Ager, Stefan Schmid, Xenofontas A. Dimitropoulos:
Stitching Inter-Domain Paths over IXPs. CoRR abs/1611.02642 (2016) - [i2]Vasileios Kotronis, Rowan Klöti, Matthias Rost, Panagiotis Georgopoulos, Bernhard Ager, Stefan Schmid, Xenofontas A. Dimitropoulos:
Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services. CoRR abs/1611.03407 (2016) - 2015
- [j2]Matthias Rost, Carlo Fuerst, Stefan Schmid:
Beyond the Stars: Revisiting Virtual Cluster Embeddings. Comput. Commun. Rev. 45(3): 12-18 (2015) - [j1]Sahel Sahhaf, Wouter Tavernier, Matthias Rost, Stefan Schmid, Didier Colle, Mario Pickavet, Piet Demeester:
Network service chaining with optimized network function embedding supporting service decompositions. Comput. Networks 93: 492-505 (2015) - [c5]Vasileios Kotronis, Rowan Klöti, Matthias Rost, Panagiotis Georgopoulos, Bernhard Ager, Stefan Schmid, Xenofontas A. Dimitropoulos:
Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services. SIGMETRICS 2015: 429-430 - 2014
- [c4]Pontus Sköldström, Balázs Sonkoly, András Gulyás, Felician Németh, Mario Kind, Fritz-Joachim Westphal, Wolfgang John, Jokin Garay, Eduardo Jacob, Dávid Jocha, János Elek, Róbert Szabó, Wouter Tavernier, George Agapiou, Antonio Manzalini, Matthias Rost, Nadi Sarrar, Stefan Schmid:
Towards Unified Programmability of Cloud and Carrier Infrastructure. EWSDN 2014: 55-60 - [c3]Arne Ludwig, Matthias Rost, Damien Foucard, Stefan Schmid:
Good Network Updates for Bad Packets: Waypoint Enforcement Beyond Destination-Based Routing Policies. HotNets 2014: 15:1-15:7 - [c2]Matthias Rost, Stefan Schmid, Anja Feldmann:
It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities. IPDPS 2014: 17-26 - 2013
- [c1]Matthias Rost, Stefan Schmid:
VirtuCast: Multicast and Aggregation with In-Network Processing - An Exact Single-Commodity Algorithm. OPODIS 2013: 221-235 - [i1]Matthias Rost, Stefan Schmid:
The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation. CoRR abs/1310.0346 (2013)
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-08-27 22:55 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:
