default search action
Kanstantsin Pashkovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy:
Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. ITCS 2024: 84:1-84:22 - [c8]Ian DeHaan, Kanstantsin Pashkovich:
Matroid Bayesian Online Selection. SAGT 2024: 405-422 - [i20]Ian DeHaan, Kanstantsin Pashkovich:
Matroid Bayesian Online Selection. CoRR abs/2406.00224 (2024) - 2023
- [i19]Kanstantsin Pashkovich, Alice Sayutina:
Non-Adaptive Matroid Prophet Inequalities. CoRR abs/2301.01700 (2023) - [i18]Kanstantsin Pashkovich, Alice Sayutina:
Single Sample Prophet Inequality for Uniform Matroids of Rank 2. CoRR abs/2306.17716 (2023) - 2022
- [j23]Kanstantsin Pashkovich
:
Computing the nucleolus of weighted voting games in pseudo-polynomial time. Math. Program. 195(1): 1123-1133 (2022) - [j22]Kanstantsin Pashkovich
The aggregation closure is polyhedral for packing and covering integer programs. Math. Program. 195(1): 1135-1147 (2022) - [i17]Kanstantsin Pashkovich, Xinyue Xie:
A Two-Step Approach to Optimal Dynamic Pricing in Multi-Demand Combinatorial Markets. CoRR abs/2201.12869 (2022) - 2021
- [j21]Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich:
Bounds on the Number of 2-Level Polytopes, Cones, and Configurations. Discret. Comput. Geom. 65(3): 587-600 (2021) - 2020
- [j20]Robert Chiang, Kanstantsin Pashkovich:
On the Approximability of the Stable Matching Problem with Ties of Size Two. Algorithmica 82(9): 2668-2686 (2020) - [j19]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
Computing the nucleolus of weighted cooperative matching games in polynomial time. Math. Program. 183(1): 555-581 (2020) - [j18]Kanstantsin Pashkovich, Laurent Poirrier
Three-dimensional stable matching with cyclic preferences. Optim. Lett. 14(8): 2615-2623 (2020) - [j17]Frits Hof, Walter Kern, Sascha Kurz
Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. 54(4): 609-621 (2020) - [c7]Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade:
Approximating Stable Matchings with Ties of Bounded Size. SAGT 2020: 178-192 - [i16]Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade:
On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap. CoRR abs/2005.05228 (2020)
2010 – 2019
- 2019
- [j16]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos
Enumeration of 2-level polytopes. Math. Program. Comput. 11(1): 173-210 (2019) - [j15]Sean Kafer, Kanstantsin Pashkovich, Laura Sanità:
On the Circuit Diameter of Some Combinatorial Polytopes. SIAM J. Discret. Math. 33(1): 1-25 (2019) - [c6]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. IPCO 2019: 413-426 - 2018
- [j14]Ahmad Abdi
Ideal Clutters That Do Not Pack. Math. Oper. Res. 43(2): 533-553 (2018) - [j13]Ahmad Abdi
Delta Minors, Delta Free Clutters, and Entanglement. SIAM J. Discret. Math. 32(3): 1750-1774 (2018) - [i15]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. CoRR abs/1803.03249 (2018) - [i14]Felix Bauckholt, Kanstantsin Pashkovich, Laura Sanità:
On the approximability of the stable marriage problem with one-sided ties. CoRR abs/1805.05391 (2018) - [i13]Kanstantsin Pashkovich:
On Critical Threshold Value for Simple Games. CoRR abs/1806.03170 (2018) - [i12]Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich:
Bounds on the number of 2-level polytopes, cones and configurations. CoRR abs/1806.06011 (2018) - [i11]Kanstantsin Pashkovich, Laurent Poirrier:
Three-dimensional Stable Matching with Cyclic Preferences. CoRR abs/1807.05638 (2018) - [i10]Robert Chiang, Kanstantsin Pashkovich:
On the approximability of the stable matching problem with ties of size two. CoRR abs/1808.04510 (2018) - [i9]Kanstantsin Pashkovich:
Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time. CoRR abs/1810.02670 (2018) - [i8]Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma:
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR abs/1810.08841 (2018) - 2017
- [j12]Samuel Fiorini, Tony Huynh
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. Discret. Comput. Geom. 57(3): 757-761 (2017) - [j11]João Gouveia
Four-dimensional polytopes of minimum positive semidefinite rank. J. Comb. Theory A 145: 184-226 (2017) - [c5]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM 2017: 17:1-17:13 - [i7]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. CoRR abs/1703.01943 (2017) - [i6]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR abs/1706.06565 (2017) - 2016
- [j10]Michele Conforti, Kanstantsin Pashkovich:
The projected faces property and polyhedral relations. Math. Program. 156(1-2): 331-342 (2016) - [j9]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
An elementary integrality proof of Rothblum's stable matching formulation. Oper. Res. Lett. 44(6): 754-756 (2016) - [j8]Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich:
Cut Dominants and Forbidden Minors. SIAM J. Discret. Math. 30(3): 1571-1589 (2016) - [c4]Andreas Emil Feldmann
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC 2016: 33:1-33:12 - [i5]Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR abs/1604.07049 (2016) - [i4]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich:
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. CoRR abs/1604.07976 (2016) - [i3]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
The Power of Locality: An Elementary Integrality Proof of Rothblum's Stable Matching Formulation. CoRR abs/1605.04427 (2016) - 2015
- [j7]Yuri Bogomolov
Small Extended Formulations for Cyclic Polytopes. Discret. Comput. Geom. 53(4): 809-816 (2015) - [j6]Michele Conforti, Bert Gerards, Kanstantsin Pashkovich:
Stable sets and graphs with no even holes. Math. Program. 153(1): 13-39 (2015) - [j5]Samuel Fiorini, Kanstantsin Pashkovich:
Uncapacitated flow-based extended formulations. Math. Program. 153(1): 117-131 (2015) - [j4]Kanstantsin Pashkovich, Stefan Weltge
Hidden vertices in extensions of polytopes. Oper. Res. Lett. 43(2): 161-164 (2015) - [c3]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos
Enumeration of 2-Level Polytopes. ESA 2015: 191-202 - 2014
- [j3]Kanstantsin Pashkovich:
Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results. Math. Oper. Res. 39(4): 1330-1339 (2014) - 2013
- [j2]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. 313(1): 67-83 (2013) - [i2]Samuel Fiorini, Kanstantsin Pashkovich:
Uncapacitated Flow-based Extended Formulations. CoRR abs/1306.3119 (2013) - 2012
- [j1]Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Symmetry Matters for Sizes of Extended Formulations. SIAM J. Discret. Math. 26(3): 1361-1382 (2012) - 2011
- [c2]Volker Kaibel, Kanstantsin Pashkovich:
Constructing Extended Formulations from Reflection Relations. IPCO 2011: 287-300 - [i1]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial Bounds on Nonnegative Rank and Extended Formulations. CoRR abs/1111.0444 (2011) - 2010
- [c1]Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Symmetry Matters for the Sizes of Extended Formulations. IPCO 2010: 135-148
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 2024-09-18 00:11 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: