Adam Kurpisz - RankMe

47 papers A* 5A 2B 7C 2Journal 27Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. Math. Oper. Res. Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth
2025	A*	`conf`	A Wiener Process Perspective on Local Intrinsic Dimension Estimation Methods. AAAI Piotr Tempczyk, Lukasz Garncarek, Dominik Filipiak, Adam Kurpisz
2025	J	`jnl`	IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation. CoRR Johannes Schmitt, Gergely Bérczi, Jasper Dekoninck, Jeremy Feusi, Tim Gehrunger, Raphael Appenzeller, Jim Bryan, Niklas Canova, Timo de Wolff, Filippo Gaia, Michel van Garrel, Baran Hashemi, David Holmes, Aitor Iribar Lopez, Victor Jaeck, Martina Jørgensen, Steven Kelk, Stefan Kuhlmann, Adam Kurpisz, Chiara Meroni, Ingmar Metzler, Martin Möller, Samuel Muñoz-Echániz, Robert Nowak, Georg Oberdieck, Daniel Platt, Dylan Possamaï, Gabriel Ribeiro, Raul Sanchez Galan, Zheming Sun, Josef Teichmann, Richard P. Thomas, Charles Vial
2024	J	`jnl`	A Wiener process perspective on local intrinsic dimension estimation methods. CoRR Piotr Tempczyk, Lukasz Garncarek, Dominik Filipiak, Adam Kurpisz
2024	J	`jnl`	On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control. CoRR Luca M. Hartmann, Orcun Karaca, Tinus Dorfling, Tobias Geyer, Adam Kurpisz
2024	J	`jnl`	Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2023	A	`conf`	Improved Approximations for Translational Packing of Convex Polygons. ESA Adam Kurpisz, Silvan Suter
2023	J	`jnl`	Improved Approximations for Translational Packing of Convex Polygons. CoRR Adam Kurpisz, Silvan Suter
2023	B	`conf`	Sum of Squares Bounds for the Empty Integral Hull Problem. ISSAC Adam Kurpisz, Elias Samuel Wirth
2022	J	`jnl`	A technique for obtaining true approximations for k-center with covering constraints. Math. Program. Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2022	A*	`conf`	Fair and Fast k-Center Clustering for Data Summarization. ICML Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
2022	J	`jnl`	Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials. Found. Comput. Math. Mareike Dressler, Adam Kurpisz, Timo de Wolff
2021	A*	`conf`	SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. ICALP Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth
2021	J	`jnl`	SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization. CoRR Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth
2020	B	`conf`	A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2020	J	`jnl`	A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2020	J	`jnl`	Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2019	B	`conf`	New Dependencies of Hierarchies in Polynomial Optimization. ISSAC Adam Kurpisz, Timo de Wolff
2019	J	`jnl`	New Dependencies of Hierarchies in Polynomial Optimization. CoRR Adam Kurpisz, Timo de Wolff
2019	A*	`conf`	Sum-Of-Squares Bounds via Boolean Function Analysis. ICALP Adam Kurpisz
2018	B	`conf`	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. MFCS Mareike Dressler, Adam Kurpisz, Timo de Wolff
2018	J	`jnl`	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. CoRR Mareike Dressler, Adam Kurpisz, Timo de Wolff
2018	J	`jnl`	Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2018	J	`jnl`	Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2017	J	`jnl`	An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2017	J	`jnl`	On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	B	`conf`	Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2016	B	`conf`	Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	C	`conf`	Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	J	`jnl`	Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	A*	`conf`	Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	J	`jnl`	Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	A	`conf`	A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	J	`jnl`	A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	J	`jnl`	Approximability of the robust representatives selection problem. Oper. Res. Lett. Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2015	—	`conf`	On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. ICALP (1) Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	J	`jnl`	On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2014	J	`jnl`	Approximability of the robust representatives selection problem. CoRR Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2014	—	`conf`	Approximation Schemes for Robust Makespan Scheduling Problems. OR Adam Kurpisz
2014	C	`conf`	Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2014	J	`jnl`	Inform friends, do not inform enemies. IMA J. Math. Control. Inf. Adam Kurpisz, Michal Morayne
2014	J	`jnl`	On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2013	J	`jnl`	Approximating the min-max (regret) selecting items problem. Inf. Process. Lett. Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2012	J	`jnl`	Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2012	B	`conf`	Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis
2012	—	`conf`	Parallel Machine Scheduling under Uncertainty. IPMU (4) Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2012	—	`conf`	Recoverable Robust Combinatorial Optimization Problems. OR Adam Kasperski, Adam Kurpisz, Pawel Zielinski