Can't Touch This: Consistent Network Updates for Multiple Policies. - Szymon Dudycz; Arne Ludwig; Stefan Schmid 001 (DSN, 2016)

Towards Transiently Secure Updates in Asynchronous SDNs. - Apoorv Shukla; Stefan Schmid 001; Anja Feldmann; Arne Ludwig; Szymon Dudycz; Andre Schuetze (SIGCOMM, 2016)

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

A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. - Szymon Dudycz; Jan Marcinkowski; Katarzyna E. Paluch 001; Bartosz Rybicki (IPCO, 2017)

Congestion-Free Rerouting of Flows on DAGs. - Saeed Akhoondian Amiri; Szymon Dudycz; Stefan Schmid 001; Sebastian Wiederrecht (ICALP, 2018)

Optimal General Matchings. - Szymon Dudycz; Katarzyna Paluch 001 (WG, 2018)

Short Schedules for Fast Flow Rerouting. - Saeed Akhoondian Amiri; Szymon Dudycz; Mahmoud Parham; Stefan Schmid 001; Sebastian Wiederrecht (CoRR, 2018)

Efficient Loop-Free Rerouting of Multiple SDN Flows. - Arsany Basta; Andreas Blenk; Szymon Dudycz; Arne Ludwig; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2018)

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

Tight Approximation Ratio for Minimum Maximal Matching. - Szymon Dudycz; Mateusz Lewandowski; Jan Marcinkowski (IPCO, 2019)

On Polynomial-Time Congestion-Free Software-Defined Network Updates. - Saeed Akhoondian Amiri; Szymon Dudycz; Mahmoud Parham; Stefan Schmid 001; Sebastian Wiederrecht (Networking, 2019)

Tight Approximation for Proportional Approval Voting. - Szymon Dudycz; Pasin Manurangsi; Jan Marcinkowski; Krzysztof Sornat (IJCAI, 2020)

To Close Is Easier Than To Open: Dual Parameterization To k-Median. - Jaroslaw Byrka; Szymon Dudycz; Pasin Manurangsi; Jan Marcinkowski; Michal Wlodarczyk 001 (WAOA, 2020)

Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems. - Szymon Dudycz; Pasin Manurangsi; Jan Marcinkowski (WAOA, 2021)