Karol Wegrzycki
Orcid: 0000-0001-9746-5733Affiliations:
- Saarland University, Saarbrücken, Germany
According to our database1,
Karol Wegrzycki
authored at least 37 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Algorithmica, January, 2024
CoRR, 2024
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach.
CoRR, 2024
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime.
CoRR, 2024
A polynomial-time OPT<sup>ɛ</sup>-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
The Tractability Border of Reachability in Simple Vector Addition Systems with States.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.
SIAM J. Comput., December, 2023
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.
SIAM J. Discret. Math., September, 2023
J. Comput. Geom., 2023
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints.
CoRR, 2023
A polynomial-time OPT<sup>ε</sup>-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.
CoRR, 2023
Electron. J. Comb., 2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the Foundations of Software Science and Computation Structures, 2023
2022
Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995<sup>n</sup>) time.
CoRR, 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2019
Theory Comput. Syst., 2019
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2017
Proceedings of the 26th International Conference on World Wide Web, 2017
2016
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.
Proceedings of the 2016 Recommender Systems Challenge, 2016
Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016