George Osipov
Postdoktor
Publikationer
2026
Concise representations and complexity results for welfare-maximizing combinatorial assignment
Autonomous Agents and Multi-Agent Systems, Vol. 40, Artikel 30
(Artikel i tidskrift)
https://dx.doi.org/10.1007/s10458-026-09753-9
Algorithms and complexity of difference logic
Journal of computer and system sciences (Print), Vol. 159, Artikel 103780
(Artikel i tidskrift)
https://dx.doi.org/10.1016/j.jcss.2026.103780
2025
Parameterized Approximability for Modular Linear Equations
33RD ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, ESA 2025, Artikel 88
(Konferensbidrag)
Parameterized Approximability for Modular Linear Equations
Proc. 33rd Annual European Symposium on Algorithms (ESA-2025), Artikel 88
(Konferensbidrag)
https://dx.doi.org/10.4230/LIPICS.ESA.2025.88
Almost Consistent Systems of Linear Equations
ACM Transactions on Algorithms, Vol. 21, Artikel 44
(Artikel i tidskrift)
https://dx.doi.org/10.1145/3733107