Kanstantsin Pashkovich

From MaRDI portal
(Redirected from Person:263203)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Linear contracts for supermodular functions based on graphs2026-02-27Paper
Non-adaptive prophet inequalities for minor-closed classes of matroids
Discrete Applied Mathematics
2026-02-24Paper
Online algorithm for fractional matchings with edge arrivals in graphs of maximum degree three2026-02-10Paper
Budget-feasible mechanism design: simpler, better mechanisms and general payment constraints2025-11-04Paper
Single sample prophet inequality for uniform matroids of rank 2
Operations Research Letters
2025-05-06Paper
Matroid Bayesian online selection2025-01-31Paper
Approximating stable matchings with ties of bounded size
(available as arXiv preprint)
2022-12-21Paper
Computing the nucleolus of weighted voting games in pseudo-polynomial time
Mathematical Programming. Series A. Series B
2022-10-24Paper
The aggregation closure is polyhedral for packing and covering integer programs
Mathematical Programming. Series A. Series B
2022-10-24Paper
On the integrality gap of the prize-collecting Steiner forest LP
(available as arXiv preprint)
2021-07-28Paper
Bounds on the number of 2-level polytopes, cones, and configurations
Discrete & Computational Geometry
2021-04-20Paper
Three-dimensional stable matching with cyclic preferences
Optimization Letters
2021-02-17Paper
On the approximability of the stable matching problem with ties of size two
Algorithmica
2020-09-03Paper
Computing the nucleolus of weighted cooperative matching games in polynomial time
Mathematical Programming. Series A. Series B
2020-08-28Paper
Simple games versus weighted voting games: bounding the critical threshold value
Social Choice and Welfare
2020-04-08Paper
Simple games versus weighted voting games: bounding the critical threshold value
Social Choice and Welfare
2020-04-08Paper
Ideal clutters that do not pack
Mathematics of Operations Research
2020-03-12Paper
Computing the nucleolus of weighted cooperative matching games in polynomial time
Lecture Notes in Computer Science
2020-02-06Paper
Enumeration of 2-level polytopes
Mathematical Programming Computation
2019-05-03Paper
An elementary integrality proof of Rothblum's stable matching formulation
Operations Research Letters
2019-01-15Paper
On the circuit diameter of some combinatorial polytopes
SIAM Journal on Discrete Mathematics
2019-01-07Paper
Hidden vertices in extensions of polytopes
Operations Research Letters
2018-10-01Paper
Delta minors, delta free clutters, and entanglement
SIAM Journal on Discrete Mathematics
2018-07-25Paper
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
(available as arXiv preprint)
2018-04-19Paper
Smaller extended formulations for the spanning tree polytope of bounded-genus graphs
Discrete & Computational Geometry
2017-05-11Paper
Cut dominants and forbidden minors
SIAM Journal on Discrete Mathematics
2016-09-06Paper
Every rational polyhedron has finite split rank: new proof2016-06-18Paper
The projected faces property and polyhedral relations
Mathematical Programming. Series A. Series B
2016-04-04Paper
Enumeration of 2-level polytopes
Lecture Notes in Computer Science
2015-11-19Paper
Stable sets and graphs with no even holes
Mathematical Programming. Series A. Series B
2015-10-14Paper
Uncapacitated flow-based extended formulations
Mathematical Programming. Series A. Series B
2015-10-14Paper
Constructing extended formulations from reflection relations
Facets of Combinatorial Optimization
2015-07-22Paper
Small extended formulations for cyclic polytopes
Discrete & Computational Geometry
2015-06-26Paper
Tight lower bounds on the sizes of symmetric extensions of permutahedra and similar results
Mathematics of Operations Research
2015-04-24Paper
Which nonnegative matrices are slack matrices?
Linear Algebra and its Applications
2014-02-19Paper
Symmetry Matters for Sizes of Extended Formulations
SIAM Journal on Discrete Mathematics
2013-01-04Paper
Combinatorial bounds on nonnegative rank and extended formulations
Discrete Mathematics
2012-11-22Paper
Constructing extended formulations from reflection relations
Integer Programming and Combinatoral Optimization
2011-06-24Paper
Symmetry matters for the sizes of extended formulations
Integer Programming and Combinatorial Optimization
2010-06-22Paper


Research outcomes over time


This page was built for person: Kanstantsin Pashkovich