Kanstantsin Pashkovich

According to our database, Kanstantsin Pashkovich authored at least 35 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints.

Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Single Sample Prophet Inequality for Uniform Matroids of Rank 2.

Kanstantsin Pashkovich, Alice Sayutina

CoRR, 2023

Non-Adaptive Matroid Prophet Inequalities.

Kanstantsin Pashkovich, Alice Sayutina

CoRR, 2023

2022

The aggregation closure is polyhedral for packing and covering integer programs.

Kanstantsin Pashkovich, Laurent Poirrier, Haripriya Pulyassary

Math. Program., 2022

Computing the nucleolus of weighted voting games in pseudo-polynomial time.

Kanstantsin Pashkovich

Math. Program., 2022

A Two-Step Approach to Optimal Dynamic Pricing in Multi-Demand Combinatorial Markets.

Kanstantsin Pashkovich, Xinyue Xie

CoRR, 2022

2021

Bounds on the Number of 2-Level Polytopes, Cones, and Configurations.

Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich

Discret. Comput. Geom., 2021

2020

Simple games versus weighted voting games: bounding the critical threshold value.

Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma

Soc. Choice Welf., 2020

Three-dimensional stable matching with cyclic preferences.

Kanstantsin Pashkovich, Laurent Poirrier

Optim. Lett., 2020

Computing the nucleolus of weighted cooperative matching games in polynomial time.

Jochen Könemann, Kanstantsin Pashkovich, Justin Toth

Math. Program., 2020

On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap.

Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade

CoRR, 2020

On the Approximability of the Stable Matching Problem with Ties of Size Two.

Robert Chiang, Kanstantsin Pashkovich

Algorithmica, 2020

Approximating Stable Matchings with Ties of Bounded Size.

Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

2019

On the Circuit Diameter of Some Combinatorial Polytopes.

Sean Kafer, Kanstantsin Pashkovich, Laura Sanità

SIAM J. Discret. Math., 2019

Enumeration of 2-level polytopes.

Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich

Math. Program. Comput., 2019

2018

Delta Minors, Delta Free Clutters, and Entanglement.

Ahmad Abdi, Kanstantsin Pashkovich

SIAM J. Discret. Math., 2018

Ideal Clutters That Do Not Pack.

Ahmad Abdi, Kanstantsin Pashkovich, Gérard Cornuéjols

Math. Oper. Res., 2018

On Critical Threshold Value for Simple Games.

Kanstantsin Pashkovich

CoRR, 2018

On the approximability of the stable marriage problem with one-sided ties.

Felix Bauckholt, Kanstantsin Pashkovich, Laura Sanità

CoRR, 2018

2017

Four-dimensional polytopes of minimum positive semidefinite rank.

João Gouveia, Kanstantsin Pashkovich, Richard Z. Robinson, Rekha R. Thomas

J. Comb. Theory, Ser. A, 2017

Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs.

Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich

Discret. Comput. Geom., 2017

On the Integrality Gap of the Prize-Collecting Steiner Forest LP.

Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen

Proceedings of the Approximation, 2017

2016

Cut Dominants and Forbidden Minors.

Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich

SIAM J. Discret. Math., 2016

An elementary integrality proof of Rothblum's stable matching formulation.

Jochen Könemann, Kanstantsin Pashkovich, Justin Toth

Oper. Res. Lett., 2016

The projected faces property and polyhedral relations.

Michele Conforti, Kanstantsin Pashkovich

Math. Program., 2016

The Power of Locality: An Elementary Integrality Proof of Rothblum's Stable Matching Formulation.

Jochen Könemann, Kanstantsin Pashkovich, Justin Toth

CoRR, 2016

Fast Approximation Algorithms for the Generalized Survivable Network Design Problem.

Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Hidden vertices in extensions of polytopes.

Kanstantsin Pashkovich, Stefan Weltge

Oper. Res. Lett., 2015

Uncapacitated flow-based extended formulations.

Samuel Fiorini, Kanstantsin Pashkovich

Math. Program., 2015

Stable sets and graphs with no even holes.

Michele Conforti, Bert Gerards, Kanstantsin Pashkovich

Math. Program., 2015

Small Extended Formulations for Cyclic Polytopes.

Yuri Bogomolov, Samuel Fiorini, Aleksandr N. Maksimenko, Kanstantsin Pashkovich

Discret. Comput. Geom., 2015

2014

Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results.

Kanstantsin Pashkovich

Math. Oper. Res., 2014

2013

Combinatorial bounds on nonnegative rank and extended formulations.

Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis

Discret. Math., 2013

2012

Symmetry Matters for Sizes of Extended Formulations.

Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis

SIAM J. Discret. Math., 2012

2011

Constructing Extended Formulations from Reflection Relations.

Volker Kaibel, Kanstantsin Pashkovich

Proceedings of the Integer Programming and Combinatoral Optimization, 2011