Adam Kurpisz

ACM Trans. Comput. Theory, March, 2024

2023

Sum of Squares Bounds for the Empty Integral Hull Problem.

[BibT_eX]

[DOI]

Elias Samuel Wirth

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Improved Approximations for Translational Packing of Convex Polygons.

[BibT_eX]

[DOI]

Silvan Suter

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

A technique for obtaining true approximations for k-center with covering constraints.

[BibT_eX]

[DOI]

Math. Program., 2022

Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials.

[BibT_eX]

[DOI]

Mareike Dressler

Timo de Wolff

Found. Comput. Math., 2022

Fair and Fast k-Center Clustering for Data Summarization.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization.

[BibT_eX]

[DOI]

Aaron Potechin

Elias Samuel Wirth

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2019

New Dependencies of Hierarchies in Polynomial Optimization.

[BibT_eX]

[DOI]

Timo de Wolff

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Sum-Of-Squares Bounds via Boolean Function Analysis.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Semidefinite and linear programming integrality gaps for scheduling identical machines.

[BibT_eX]

[DOI]

Math. Program., 2018

Sum-of-squares rank upper bounds for matching problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

2017

An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem.

[BibT_eX]

[DOI]

Math. Program., 2017

On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

2016

Sum-of-squares hierarchy lower bounds for symmetric formulations.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Approximability of the robust representatives selection problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Inform friends, do not inform enemies.

[BibT_eX]

[DOI]

Michal Morayne

IMA J. Math. Control. Inf., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Improved Approximation for the Maximum Duo-Preservation String Mapping Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Approximation Schemes for Robust Makespan Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2014, 2014

2013

Approximating the min-max (regret) selecting items problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

2012

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems.

[BibT_eX]

[DOI]

Georgios Stamoulis

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Recoverable Robust Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2012, 2012

Parallel Machine Scheduling under Uncertainty.

[BibT_eX]

[DOI]