default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Kurpisz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c20]Piotr Tempczyk, Lukasz Garncarek, Dominik Filipiak, Adam Kurpisz:
A Wiener Process Perspective on Local Intrinsic Dimension Estimation Methods. AAAI 2025: 20859-20866- 2024
- [j12]Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory 16(1): 3:1-3:16 (2024) - [i13]Piotr Tempczyk, Lukasz Garncarek, Dominik Filipiak, Adam Kurpisz:
A Wiener process perspective on local intrinsic dimension estimation methods. CoRR abs/2406.17125 (2024) - [i12]Luca M. Hartmann, Orcun Karaca, Tinus Dorfling, Tobias Geyer, Adam Kurpisz:
On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control. CoRR abs/2412.11666 (2024) - 2023
- [c19]Adam Kurpisz, Silvan Suter:
Improved Approximations for Translational Packing of Convex Polygons. ESA 2023: 76:1-76:14 - [c18]Adam Kurpisz, Elias Samuel Wirth:
Sum of Squares Bounds for the Empty Integral Hull Problem. ISSAC 2023: 443-451 - [i11]Adam Kurpisz, Silvan Suter:
Improved Approximations for Translational Packing of Convex Polygons. CoRR abs/2308.08523 (2023) - 2022
- [j11]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials. Found. Comput. Math. 22(2): 365-387 (2022) - [j10]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A technique for obtaining true approximations for k-center with covering constraints. Math. Program. 192(1): 3-27 (2022) - [c17]Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen:
Fair and Fast k-Center Clustering for Data Summarization. ICML 2022: 669-702 - 2021
- [c16]Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth:
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. ICALP 2021: 90:1-90:20 - [i10]Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth:
SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization. CoRR abs/2107.04100 (2021) - 2020
- [j9]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. 182(1): 369-397 (2020) - [c15]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO 2020: 52-65 - [i9]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR abs/2007.03946 (2020)
2010 – 2019
- 2019
- [c14]Adam Kurpisz:
Sum-Of-Squares Bounds via Boolean Function Analysis. ICALP 2019: 79:1-79:15 - [c13]Adam Kurpisz, Timo de Wolff:
New Dependencies of Hierarchies in Polynomial Optimization. ISSAC 2019: 251-258 - [i8]Adam Kurpisz, Timo de Wolff:
New Dependencies of Hierarchies in Polynomial Optimization. CoRR abs/1903.04996 (2019) - 2018
- [j8]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. 36(3): 831-844 (2018) - [j7]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172(1-2): 231-248 (2018) - [c12]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. MFCS 2018: 82:1-82:17 - [i7]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. CoRR abs/1802.10004 (2018) - 2017
- [j6]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. 42(1): 135-143 (2017) - [j5]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. 166(1-2): 1-17 (2017) - 2016
- [c11]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP 2016: 78:1-78:14 - [c10]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO 2016: 152-163 - [c9]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO 2016: 362-374 - [c8]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO 2016: 403-413 - [i6]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR abs/1605.03019 (2016) - [i5]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j4]Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Approximability of the robust representatives selection problem. Oper. Res. Lett. 43(1): 16-19 (2015) - [c7]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA 2015: 853-864 - [c6]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. ICALP (1) 2015: 872-885 - [i4]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. CoRR abs/1510.01891 (2015) - [i3]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. CoRR abs/1511.08644 (2015) - 2014
- [j3]Adam Kurpisz, Michal Morayne:
Inform friends, do not inform enemies. IMA J. Math. Control. Inf. 31(3): 435-440 (2014) - [c5]Adam Kurpisz:
Approximation Schemes for Robust Makespan Scheduling Problems. OR 2014: 327-333 - [c4]Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI 2014: 14-25 - [i2]Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Approximability of the robust representatives selection problem. CoRR abs/1405.5381 (2014) - [i1]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. CoRR abs/1407.1746 (2014) - 2013
- [j2]Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Approximating the min-max (regret) selecting items problem. Inf. Process. Lett. 113(1-2): 23-29 (2013) - 2012
- [j1]Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217(1): 36-43 (2012) - [c3]Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Parallel Machine Scheduling under Uncertainty. IPMU (4) 2012: 74-83 - [c2]Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Recoverable Robust Combinatorial Optimization Problems. OR 2012: 147-153 - [c1]Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis:
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA 2012: 159-172
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-20 23:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
