VirtuCast: Multicast and Aggregation with In-Network Processing - An Exact Single-Commodity Algorithm. - Matthias Rost; Stefan Schmid 001 (OPODIS, 2013)

The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation. - Matthias Rost; Stefan Schmid 001 (CoRR, 2013)

Towards Unified Programmability of Cloud and Carrier Infrastructure. - 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ó; et al. (EWSDN, 2014)

Good Network Updates for Bad Packets: Waypoint Enforcement Beyond Destination-Based Routing Policies. - Arne Ludwig; Matthias Rost; Damien Foucard; Stefan Schmid 001 (HotNets, 2014)

It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities. - Matthias Rost; Stefan Schmid 001; Anja Feldmann (IPDPS, 2014)

Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services. - Vasileios Kotronis; Rowan Klöti; Matthias Rost; Panagiotis Georgopoulos; Bernhard Ager; Stefan Schmid 001; Xenofontas A. Dimitropoulos (SIGMETRICS, 2015)

Beyond the Stars: Revisiting Virtual Cluster Embeddings. - Matthias Rost; Carlo Fuerst; Stefan Schmid 001 (Comput. Commun. Rev., 2015)

Network service chaining with optimized network function embedding supporting service decompositions. - Sahel Sahhaf; Wouter Tavernier; Matthias Rost; Stefan Schmid 001; Didier Colle; Mario Pickavet; Piet Demeester (Comput. Networks, 2015)

Efficient service graph embedding: A practical approach. - Balázs Németh 001; Balázs Sonkoly; Matthias Rost; Stefan Schmid 001 (NFV-SDN, 2016)

Transiently Secure Network Updates. - Arne Ludwig; Szymon Dudycz; Matthias Rost; Stefan Schmid 001 (SIGMETRICS, 2016)

An Approximation Algorithm for Path Computation and Function Placement in SDNs. - Guy Even; Matthias Rost; Stefan Schmid 001 (SIROCCO, 2016)

Stitching Inter-Domain Paths over IXPs. - Vasileios Kotronis; Rowan Klöti; Matthias Rost; Panagiotis Georgopoulos; Bernhard Ager; Stefan Schmid 001; Xenofontas A. Dimitropoulos (SOSR, 2016)

It's a Match!: Near-Optimal and Incremental Middlebox Deployment. - Tamás Lukovszki; Matthias Rost; Stefan Schmid 001 (Comput. Commun. Rev., 2016)

Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding. - Matthias Rost; Stefan Schmid 001 (CoRR, 2016)

Fast and efficient network service embedding method with adaptive offloading to the edge. - Balázs Németh 001; Mark Szalay; Janos Doka; Matthias Rost; Stefan Schmid 001; László Toka; Balázs Sonkoly (INFOCOM Workshops, 2018)

Charting the Complexity Landscape of Virtual Network Embeddings. - Matthias Rost; Stefan Schmid 001 (Networking, 2018)

NP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants. - Matthias Rost; Stefan Schmid 001 (CoRR, 2018)

(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem. - Matthias Rost; Stefan Schmid 001 (CoRR, 2018)

Approximate and incremental network function placement. - Tamás Lukovszki; Matthias Rost; Stefan Schmid 001 (J. Parallel Distributed Comput., 2018)

Transiently Policy-Compliant Network Updates. - Arne Ludwig; Szymon Dudycz; Matthias Rost; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2018)

A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling. - Mengxue Liu; Andréa W. Richa; Matthias Rost; Stefan Schmid 001 (INFOCOM, 2019)

Modeling Adaptive Video Streaming Using Discrete-Time Analysis. - Susanna Schwarzmann; Paula Breitbach; Thomas Zinner; Matthias Rost (ITC, 2019)

Parametrized complexity of virtual network embeddings: dynamic & linear programming approximations. - Matthias Rost; Elias Döhne; Stefan Schmid 001 (Comput. Commun. Rev., 2019)

Virtual Network Embedding Approximations: Leveraging Randomized Rounding. - Matthias Rost; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2019)

Virtual network embeddings: Theoretical foundations and provably good algorithms. - Matthias Rost (2019)

Edge replication strategies for wide-area distributed processing. - Niklas Semmler; Matthias Rost; Georgios Smaragdakis; Anja Feldmann (EdgeSys@EuroSys, 2020)

Cost-Efficient Embedding of Virtual Networks With and Without Routing Flexibility. - Balázs Németh 001; Yvonne-Anne Pignolet; Matthias Rost; Stefan Schmid 001; Balázs Vass (Networking, 2020)

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks. - Anya Chaturvedi; Andréa W. Richa; Matthias Rost; Stefan Schmid 001; Jamison Weber (CoRR, 2020)

On the Hardness and Inapproximability of Virtual Network Embeddings. - Matthias Rost; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2020)

It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. - Robin Münk; Matthias Rost; Harald Räcke; Stefan Schmid 001 (Networking, 2021)

Optimal Virtual Network Embeddings for Tree Topologies. - Aleksander Figiel; Leon Kellerhals; Rolf Niedermeier; Matthias Rost; Stefan Schmid 001; Philipp Zschoche (SPAA, 2021)

Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands. - Anya Chaturvedi; Chandra Chekuri; Andréa W. Richa; Matthias Rost; Stefan Schmid 001; Jamison Weber (SIGMETRICS Perform. Evaluation Rev., 2022)

Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands. - Anya Chaturvedi; Chandra Chekuri; Mengxue Liu; Andréa W. Richa; Matthias Rost; Stefan Schmid 001; Jamison Weber (IEEE/ACM Trans. Netw., 2024)