Research
Selected papers:
Online List Access
Distributed online algorithms
Online Network Design
Online Knapsack
Online Graph Partitioning
-
Optimal Online Balanced Graph Partitioning
[cite bibtex]
Maciej Pacut, Mahmoud Parham, Stefan Schmid
IEEE International Conference on Computer Communications
(INFOCOM 2021)
-
Deterministic Lower Bound
for Dynamic Balanced Graph Partitioning
[cite bibtex]
Maciej Pacut, Mahmoud Parham, Stefan Schmid
ACM Symposium on Principles of Distributed Computing: Brief Announcement (PODC 2020)
-
Dynamic Balanced Graph Partitioning
[cite bibtex]
Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid
SIAM Journal on Discrete Mathematics (SIDMA 2020)
-
Online Balanced Repartitioning
[cite bibtex]
Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid
International Symposium on Distributed Computing (DISC 2016)
Online Caching
-
Online Tree Caching
[cite bibtex]
Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017)
Duties / opportunities
Host of networking theory research seminar at Communication Technologies Group, University of Vienna,
PhD student mentorship:
- Arash Pourdamghani, University of Vienna, informal PhD co-advisor (main advisor: prof. Stefan Schmid) 2020–now
- Mahmoud Parham, University of Vienna, Austria, informal PhD co-advisor (main advisor: prof. Stefan Schmid) 2019–now
Internship supervision at University of Vienna:
- Siddhesh Kalekar, IIT Delhi, India, project "Offline list access with precedence constraints", 05.2021–now
- Loric André, ENSTA Paris, France, project "Stochastic list access with precedence constraints", 16.05.2021–10.08.2021 [report]
- Julien Dallot, ENSTA Paris, France, project "Cascade hypothesis", 01.07.2020–14.09.2020 [report]
- Alexandre Labbé, ENSTA Paris, France, project "Demand-aware reconfigurable network design", 18.05.2020–31.07.2020 [report]
Event organization:
Reviewer for Journal on Transactions on Parallel and Distributed Systems, INFOCOM, SIGMETRICS.
Maintainer of classify-reorder C++ algorithm for matching packets to rules.
Short CV
-
2021 – now: researcher in Austrian Science Fund (FWF) project Dependable Network Data Plane for the Cloud (DELTA), I 5025-N
-
2020 – now: researcher in Austrian Science Fund (FWF) project Adversarial Design Framework for Self-Driving Networks, I 4800-N
-
2020 – now: postdoctoral researcher at Communication Technology Group, Faculty of Computer Science, University of Vienna
under supervision of Univ.-Prof. Dr.sc. Stefan Schmid
-
2020 – now: researcher in ERC project Self-adjusting networks
-
2019: PhD in Computer Science at Combinatorial Optimization Group, Department of Mathematics and Computer Science, University of Wrocław, Poland under supervision of dr. hab. Marcin Bieńkowski. PhD thesis "Algorithmic aspects of contemporary networks", reviewers: prof. Guy Even, Tel-Aviv University, dr. hab. Marcin Mucha, University of Warsaw
-
2018: internships at Communication Technology Group, Faculty of Computer Science, University of Vienna
-
2017 – 2018: principal investigator in NCN project Online algorithms for packing and covering problems
-
2014 – 2017: researcher in NCN project Online algorithms for fundamental network problems
-
2014: internships at INET, Department of Telecommunication Systems, Technical University of Berlin
Personal
DBLP
arXiv
Google Scholar
ORCID
github.com/foo
