Adam Kurpisz

Orcid: 0000-0002-2320-4482

According to our database1, Adam Kurpisz authored at least 28 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems.
ACM Trans. Comput. Theory, March, 2024

A Wiener process perspective on local intrinsic dimension estimation methods.
CoRR, 2024

2023
Sum of Squares Bounds for the Empty Integral Hull Problem.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Improved Approximations for Translational Packing of Convex Polygons.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
A technique for obtaining true approximations for k-center with covering constraints.
Math. Program., 2022

Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials.
Found. Comput. Math., 2022

Fair and Fast k-Center Clustering for Data Summarization.
Proceedings of the International Conference on Machine Learning, 2022

2021
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2019
New Dependencies of Hierarchies in Polynomial Optimization.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Sum-Of-Squares Bounds via Boolean Function Analysis.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Semidefinite and linear programming integrality gaps for scheduling identical machines.
Math. Program., 2018

Sum-of-squares rank upper bounds for matching problems.
J. Comb. Optim., 2018

2017
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem.
Math. Program., 2017

On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy.
Math. Oper. Res., 2017

2016
Sum-of-squares hierarchy lower bounds for symmetric formulations.
Electron. Colloquium Comput. Complex., 2016

Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Approximability of the robust representatives selection problem.
Oper. Res. Lett., 2015

On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Inform friends, do not inform enemies.
IMA J. Math. Control. Inf., 2014

On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities.
CoRR, 2014

Improved Approximation for the Maximum Duo-Preservation String Mapping Problem.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Approximation Schemes for Robust Makespan Scheduling Problems.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Approximating the min-max (regret) selecting items problem.
Inf. Process. Lett., 2013

2012
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty.
Eur. J. Oper. Res., 2012

Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Recoverable Robust Combinatorial Optimization Problems.
Proceedings of the Operations Research Proceedings 2012, 2012

Parallel Machine Scheduling under Uncertainty.
Proceedings of the Advances in Computational Intelligence, 2012


  Loading...