Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem. - Mieczyslaw Wodecki; Wojciech Bozejko; Michal Karpinski; Maciej Pacut (PPAM (2), 2013)

How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings. - Carlo Fuerst; Maciej Pacut; Paolo Costa; Stefan Schmid 001 (ICNP, 2015)

Hardness of Virtual Network Embedding with Replica Selection. - Carlo Fuerst; Maciej Pacut; Stefan Schmid 001 (CoRR, 2015)

Online Balanced Repartitioning. - Chen Avin; Andreas Loukas; Maciej Pacut; Stefan Schmid 001 (DISC, 2016)

Online Tree Caching. - Marcin Bienkowski; Jan Marcinkowski; Maciej Pacut; Stefan Schmid 001; Aleksandra Spyra (SPAA, 2017)

Data locality and replica aware virtual cluster embeddings. - Carlo Fuerst; Maciej Pacut; Stefan Schmid 001 (Theor. Comput. Sci., 2017)

On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures. - Klaus-Tycho Foerster; Maciej Pacut; Stefan Schmid 001 (Comput. Commun. Rev., 2019)

An Optimal Algorithm for Online Multiple Knapsack. - Marcin Bienkowski; Maciej Pacut; Krzysztof Piecuch (ICALP, 2020)

Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning. - Maciej Pacut; Mahmoud Parham; Stefan Schmid 001 (PODC, 2020)

Dynamic Balanced Graph Partitioning. - Chen Avin; Marcin Bienkowski; Andreas Loukas; Maciej Pacut; Stefan Schmid 001 (SIAM J. Discret. Math., 2020)

Optimal Online Balanced Graph Partitioning. - Maciej Pacut; Mahmoud Parham; Stefan Schmid 001 (INFOCOM, 2021)

Locality in Online Algorithms. - Maciej Pacut; Mahmoud Parham; Joel Rybicki; Stefan Schmid 001; Jukka Suomela; Aleksandr Tereshchenko (CoRR, 2021)

Online List Access with Precedence Constraints. - Maciej Pacut; Juan Vanerio; Vamsi Addanki; Arash Pourdamghani; Gábor Rétvári; Stefan Schmid 001 (CoRR, 2021)

Self-Adjusting Packet Classification. - Maciej Pacut; Juan Vanerio; Vamsi Addanki; Arash Pourdamghani; Gábor Rétvári; Stefan Schmid 001 (CoRR, 2021)

Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion. - Maciej Pacut; Wenkai Dai; Alexandre Labbe; Klaus-Tycho Foerster; Stefan Schmid 001 (Perform. Evaluation, 2021)

Brief Announcement: Temporal Locality in Online Algorithms. - Maciej Pacut; Mahmoud Parham; Joel Rybicki; Stefan Schmid 001; Jukka Suomela; Aleksandr Tereshchenko (DISC, 2022)

Online Algorithms with Randomly Infused Advice. - Yuval Emek; Yuval Gil; Maciej Pacut; Stefan Schmid 001 (ESA, 2023)

Self-Adjusting Partially Ordered Lists. - Vamsi Addanki; Maciej Pacut; Arash Pourdamghani; Gábor Rétvári; Stefan Schmid 001; Juan Vanerio (INFOCOM, 2023)

RIFO: Pushing the Efficiency of Programmable Packet Schedulers. - Habib Mostafaei; Maciej Pacut; Stefan Schmid 001 (CoRR, 2023)

Self-adjusting grid networks. - Chen Avin; Ingo van Duijn; Maciej Pacut; Stefan Schmid 001 (Inf. Comput., 2023)

Learning Minimum Linear Arrangement of Cliques and Lines. - Julien Dallot; Maciej Pacut; Marcin Bienkowski; Darya Melnyk; Stefan Schmid 001 (ICDCS, 2024)

Dependency-Aware Online Caching. - Julien Dallot; Amirmehdi Jafari Fesharaki; Maciej Pacut; Stefan Schmid 001 (INFOCOM, 2024)

Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions. - Vamsi Addanki; Maciej Pacut; Stefan Schmid 001 (NSDI, 2024)