Jan Marcinkowski

Orcid: 0000-0002-6517-0014

According to our database1, Jan Marcinkowski authored at least 15 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Submodularity Gaps for Selected Network Design and Matching Problems.
CoRR, 2023

2022
Online Facility Location with Linear Delay.
Proceedings of the Approximation, 2022

2021
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

2020
Online Dynamic B-Matching: With Applications to Reconfigurable Datacenter Networks.
SIGMETRICS Perform. Evaluation Rev., 2020

A Competitive B-Matching Algorithm for Reconfigurable Datacenter Networks.
CoRR, 2020

To Close Is Easier Than To Open: Dual Parameterization To k-Median.
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Tight Approximation for Proportional Approval Voting.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Tight Approximation Ratio for Minimum Maximal Matching.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Constant-Factor FPT Approximation for Capacitated k-Median.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Loop-Free Route Updates for Software-Defined Networks.
IEEE/ACM Trans. Netw., 2018

Logarithmic price of buffer downscaling on line metrics.
Theor. Comput. Sci., 2018

2017
Online Tree Caching.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Transiently Consistent SDN Updates: Being Greedy is Hard.
Proceedings of the Structural Information and Communication Complexity, 2016

2015
Scheduling Loop-free Network Updates: It's Good to Relax!
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015


  Loading...