Jaroslaw Byrka
Orcid: 0000-0002-3387-0913
According to our database1,
Jaroslaw Byrka
authored at least 62 papers
between 2005 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025
2024
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree.
SIAM J. Comput., June, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
2021
2020
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
2019
ACM Trans. Algorithms, 2019
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
SIAM J. Discret. Math., 2018
Algorithmica, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
An Improved Approximation for <i>k</i>-Median and Positive Correlation in Budgeted Optimization.
ACM Trans. Algorithms, 2017
2016
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties).
Theory Comput. Syst., 2016
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
J. Sched., 2015
An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation.
CoRR, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015
2014
An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization.
CoRR, 2014
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
2013
CoRR, 2013
Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013
2012
CoRR, 2012
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Algorithmica, 2012
Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Dynamic valuation function based definition of the primary spectrum user in collocated cellular networks.
Proceedings of the 7th International Conference on Cognitive Radio Oriented Wireless Networks, 2012
2010
Theor. Comput. Sci., 2010
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
SIAM J. Comput., 2010
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
J. Discrete Algorithms, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
J. Discrete Algorithms, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Graph Drawing, 16th International Symposium, 2008
2007
Oper. Res. Lett., 2007
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
Proceedings of the Approximation, 2007
2005
Proceedings of the Algorithms, 2005