dr Adam Kurpisz

[11]	Mareike Dressler , Adam Kurpisz, and Timo de Wolff. Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials. Foundations of Computational Mathematics , 22(2): 365-387, 2022. Paper available at: link. Paper also available at: link.

[10]	Georg Anegg and Haris Angelidakis and Adam Kurpisz and Rico Zenklusen. A Technique for Obtaining True Approximations for k-Center with Covering Constraints. Mathematical Programming, 192(1): 3-27, 2022 Paper available at: link. Paper also available at: link.

[9]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. Sum-of-squares hierarchy lower bounds for symmetric formulations. Mathematical Programming, 182(1): 369-397, 2020 Paper available at: link. Paper also available at: link.

[8]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. Sum-of-squares rank upper bounds for matching problems. Journal of Combinatorial Optimization, 36(3):831-844, 2018. Paper available at: link.

[7]	Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, and Andreas Wiese. Semidefinite and linear programming integrality gaps for scheduling identical machines. Mathematical Programming, 172(1-2):231-248, 2018. Paper available at: link.

[6]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Mathematical Programming, 166(1-2):1-17, 2017. Paper available at: link.

[5]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Mathematics of Operations Research, 42(1):135-143, 2017. Paper available at: link. Paper also available at: link.

[4]	Adam Kasperski, Adam Kurpisz, and Pawel Zieliński. Approximability of the robust representatives selection problem. Operations Research Letters, 43(1):16-19, 2015. Paper available at: link.

[3]	Adam Kurpisz and Michal Morayne. Inform friends, do not inform enemies. IMA Journal of Mathematical Control and Information, 31(3):435-440, 2014. Paper available at: link.

[2]	Adam Kasperski, Adam Kurpisz, and Pawel Zieliński. Approximating the min-max (regret) selecting items problem. Information Processing Letters, 113(1-2):23-29, 2013. Paper available at: link.

[1]	Adam Kasperski, Adam Kurpisz, and Pawel Zieliński. Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. European Journal of Operational Research, 217(1):36-43, 2012. Paper available at: link.

[19]	Adam Kurpisz and Silvan Suter. Improved Approximations for Translational Packing of Convex Polygons. In 31st European Symposium on Algorithms, ESA 2023, Amsterdam, The Netherlands, September 4-6. Paper available at: link. Paper also available at: link.

[18]	Adam Kurpisz and Elias Wirth. New Dependencies of Hierarchies in Polynomial Optimization. In 48th International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27. Paper available at: link.

[17]	Haris Angelidakis, Adam Kurpisz, Leon Sering, and Rico Zenklusen. Fair and Fast k-Center Clustering for Data Summarization. In 39th International Conference on Machine Learning, ICML 2022, Baltimore, US, July 17-23 Paper available at: link.

[16]

Adam Kurpisz, Aaron Potechin and Elias Wirth. SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, Glagow, Scotland, July 2-16 Paper available at: link. Paper also available at: link.

[15]

Georg Anegg, Haris Angelidakis, Adam Kurpisz and Rico Zenklusen. A Technique for Obtaining True Approximations for k-Center with Covering Constraints. In 21th Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, London, UK, June 8-12 Paper available at: link. Paper also available at: link.

[14]	Adam Kurpisz. Sum-Of-Squares Bounds via Boolean Function Analysis. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Patras, Greece, July 9-12, pages 79:1-79:15. Paper available at: link.

[13]	Adam Kurpisz and Timo de Wolff. New Dependencies of Hierarchies in Polynomial Optimization. In 44th International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, pages 251-258. Paper available at: link. Paper also available at: link.

[12]

Mareike Dressler, Adam Kurpisz, and Timo de Wolff. Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK, August 27-31, pages 82:1-82:17. Paper available at: link.

[11]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, July 11-15, pages 78:1-78:14. Paper available at: link.

[10]

Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, and Andreas Wiese. Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. In 18th Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, Liége, Belgium, June 1-3, pages 152-163. Paper available at: link.

[9]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. In 18th Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, Liége, Belgium, June 1-3, pages 362-374. Paper available at: link.

[8]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. Sum-of-Squares Rank Upper Bounds for Matching Problems. In 4th International Symposium on Combinatorial Optimization, ISCO 2016, Vietri sul Mare, Italy, May 16-18, pages 403-413. Paper available at: link.

[7]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. In 26th Annual European Symposium on Algorithms, Patras, Greece, September 14-16, pages 853-864. Paper available at: link.

[6]	Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. In 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, Kyoto, Japan, July 6-10, pages 872-885. Paper available at: link.

[5]	Adam Kurpisz. Approximation Schemes for Robust Makespan Scheduling Problems. In International Conference of the German Operations Research Society, GOR 2014, Aachen, Germany, September 2-5, pages 327-333. Paper available at: link.

[4]	Nicolas Boria, Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. In 14th Workshop on Algorithms in Bioinformatics, WABI 2014, Wroclaw, Poland, September 8-10, pages 14-25. Paper available at: link.

[3]	Adam Kasperski, Adam Kurpisz, and Pawel Zieliński. Parallel Machine Scheduling under Uncertainty. In 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Catania, Italy, July 9-13, pages 74-83. Paper available at: link.

[2]	Adam Kasperski, Adam Kurpisz, and Pawel Zieliński. Recoverable Robust Combinatorial Optimization Problems. In International Conference of the German Operations Research Society GOR 2012, Hannover, Germany, September 5-7, pages 147-153. Paper available at: link.

[1]	Adam Kurpisz, Monaldo Mastrolilli, and Georgios Stamoulis. Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. In 10th Workshop on Approximation and Online Algorithms, WAOA 2012, Ljubljana, Slovenia, September 13-14, pages 159-172. Paper available at: link.