Kanstantsin Pashkovich

64 papers A* 1A 2B 8Journal 52Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A simple Path-based LP Relaxation for Directed Steiner Tree. CoRR Kanstantsin Pashkovich, Marta Pozzi, Laura Sanità
2026	J	`jnl`	Non-adaptive prophet inequalities for minor-closed classes of matroids. Discret. Appl. Math. Kanstantsin Pashkovich, Alice Sayutina
2026	J	`jnl`	Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three. CoRR Kanstantsin Pashkovich, Thomas Snow
2026	J	`jnl`	Sequential Linear Contracts on Matroids. CoRR Kanstantsin Pashkovich, Jacob Skitsko, Yun Xing
2025	A*	`conf`	An EC Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025	J	`jnl`	An O(log log n)-approximate budget feasible mechanism for subadditive valuations. CoRR Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025	B	`conf`	Linear Contracts for Supermodular Functions Based on Graphs. SAGT Kanstantsin Pashkovich, Jacob Skitsko
2025	J	`jnl`	Multidimensional Budget-Feasible Mechanism Design. CoRR Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025	J	`jnl`	Normalizations of factorizations over convex cones and their effects on extension complexity. CoRR Adam Brown, Kanstantsin Pashkovich, Levent Tunçel
2025	B	`conf`	Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three. WAOA Kanstantsin Pashkovich, Thomas Snow
2025	J	`jnl`	Single sample prophet inequality for uniform matroids of rank 2. Oper. Res. Lett. Kanstantsin Pashkovich, Alice Sayutina
2024	A	`conf`	Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. ITCS Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2024	J	`jnl`	Linear Contracts for Supermodular Functions Based on Graphs. CoRR Kanstantsin Pashkovich, Jacob Skitsko
2024	B	`conf`	Matroid Bayesian Online Selection. SAGT Ian DeHaan, Kanstantsin Pashkovich
2024	J	`jnl`	Matroid Bayesian Online Selection. CoRR Ian DeHaan, Kanstantsin Pashkovich
2023	J	`jnl`	Non-Adaptive Matroid Prophet Inequalities. CoRR Kanstantsin Pashkovich, Alice Sayutina
2023	J	`jnl`	Single Sample Prophet Inequality for Uniform Matroids of Rank 2. CoRR Kanstantsin Pashkovich, Alice Sayutina
2022	J	`jnl`	A Two-Step Approach to Optimal Dynamic Pricing in Multi-Demand Combinatorial Markets. CoRR Kanstantsin Pashkovich, Xinyue Xie
2022	J	`jnl`	Computing the nucleolus of weighted voting games in pseudo-polynomial time. Math. Program. Kanstantsin Pashkovich
2022	J	`jnl`	The aggregation closure is polyhedral for packing and covering integer programs. Math. Program. Kanstantsin Pashkovich, Laurent Poirrier, Haripriya Pulyassary
2021	J	`jnl`	Bounds on the Number of 2-Level Polytopes, Cones, and Configurations. Discret. Comput. Geom. Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich
2020	B	`conf`	Approximating Stable Matchings with Ties of Bounded Size. SAGT Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade
2020	J	`jnl`	Computing the nucleolus of weighted cooperative matching games in polynomial time. Math. Program. Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
2020	J	`jnl`	On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap. CoRR Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade
2020	J	`jnl`	On the Approximability of the Stable Matching Problem with Ties of Size Two. Algorithmica Robert Chiang, Kanstantsin Pashkovich
2020	J	`jnl`	Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
2020	J	`jnl`	Three-dimensional stable matching with cyclic preferences. Optim. Lett. Kanstantsin Pashkovich, Laurent Poirrier
2019	B	`conf`	Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. IPCO Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
2019	J	`jnl`	Enumeration of 2-level polytopes. Math. Program. Comput. Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich
2019	J	`jnl`	On the Circuit Diameter of Some Combinatorial Polytopes. SIAM J. Discret. Math. Sean Kafer, Kanstantsin Pashkovich, Laura Sanità
2018	J	`jnl`	Bounds on the number of 2-level polytopes, cones and configurations. CoRR Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich
2018	J	`jnl`	Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. CoRR Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
2018	J	`jnl`	Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time. CoRR Kanstantsin Pashkovich
2018	J	`jnl`	Delta Minors, Delta Free Clutters, and Entanglement. SIAM J. Discret. Math. Ahmad Abdi, Kanstantsin Pashkovich
2018	J	`jnl`	Ideal Clutters That Do Not Pack. Math. Oper. Res. Ahmad Abdi, Kanstantsin Pashkovich, Gérard Cornuéjols
2018	J	`jnl`	On Critical Threshold Value for Simple Games. CoRR Kanstantsin Pashkovich
2018	J	`jnl`	On the approximability of the stable marriage problem with one-sided ties. CoRR Felix Bauckholt, Kanstantsin Pashkovich, Laura Sanità
2018	J	`jnl`	On the approximability of the stable matching problem with ties of size two. CoRR Robert Chiang, Kanstantsin Pashkovich
2018	J	`jnl`	Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
2018	J	`jnl`	Three-dimensional Stable Matching with Cyclic Preferences. CoRR Kanstantsin Pashkovich, Laurent Poirrier
2017	J	`jnl`	Enumeration of 2-level polytopes. CoRR Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich
2017	J	`jnl`	Four-dimensional polytopes of minimum positive semidefinite rank. J. Comb. Theory A João Gouveia, Kanstantsin Pashkovich, Richard Z. Robinson, Rekha R. Thomas
2017	—	`conf`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017	J	`jnl`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017	J	`jnl`	Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. Discret. Comput. Geom. Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich
2016	J	`jnl`	An elementary integrality proof of Rothblum's stable matching formulation. Oper. Res. Lett. Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
2016	J	`jnl`	Cut Dominants and Forbidden Minors. SIAM J. Discret. Math. Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich
2016	B	`conf`	Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
2016	J	`jnl`	Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
2016	J	`jnl`	Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. CoRR Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich
2016	J	`jnl`	The Power of Locality: An Elementary Integrality Proof of Rothblum's Stable Matching Formulation. CoRR Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
2016	J	`jnl`	The projected faces property and polyhedral relations. Math. Program. Michele Conforti, Kanstantsin Pashkovich
2015	A	`conf`	Enumeration of 2-Level Polytopes. ESA Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich
2015	J	`jnl`	Hidden vertices in extensions of polytopes. Oper. Res. Lett. Kanstantsin Pashkovich, Stefan Weltge
2015	J	`jnl`	Small Extended Formulations for Cyclic Polytopes. Discret. Comput. Geom. Yuri Bogomolov, Samuel Fiorini, Aleksandr N. Maksimenko, Kanstantsin Pashkovich
2015	J	`jnl`	Stable sets and graphs with no even holes. Math. Program. Michele Conforti, Bert Gerards, Kanstantsin Pashkovich
2015	J	`jnl`	Uncapacitated flow-based extended formulations. Math. Program. Samuel Fiorini, Kanstantsin Pashkovich
2014	J	`jnl`	Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results. Math. Oper. Res. Kanstantsin Pashkovich
2013	J	`jnl`	Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
2013	J	`jnl`	Uncapacitated Flow-based Extended Formulations. CoRR Samuel Fiorini, Kanstantsin Pashkovich
2012	J	`jnl`	Symmetry Matters for Sizes of Extended Formulations. SIAM J. Discret. Math. Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
2011	J	`jnl`	Combinatorial Bounds on Nonnegative Rank and Extended Formulations CoRR Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
2011	B	`conf`	Constructing Extended Formulations from Reflection Relations. IPCO Volker Kaibel, Kanstantsin Pashkovich
2010	B	`conf`	Symmetry Matters for the Sizes of Extended Formulations. IPCO Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis