Sledovat
Martin Koutecký
Martin Koutecký
E-mailová adresa ověřena na: iuuk.mff.cuni.cz - Domovská stránka
Název
Citace
Citace
Rok
An algorithmic theory of integer programming
F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn
arXiv preprint arXiv:1904.01361, 2019
802019
Scheduling meets n-fold integer programming
D Knop, M Koutecký
Journal of Scheduling 21, 493-503, 2018
802018
Combinatorial n-fold integer programming and applications
D Knop, M Koutecký, M Mnich
Mathematical Programming 184 (1), 1-34, 2020
692020
A parameterized strongly polynomial algorithm for block structured integer programs
M Koutecký, A Levin, S Onn
arXiv preprint arXiv:1802.05859, 2018
692018
Voting and bribing in single-exponential time
D Knop, M Koutecký, M Mnich
ACM Transactions on Economics and Computation (TEAC) 8 (3), 1-28, 2020
612020
Opinion diffusion and campaigning on society graphs
P Faliszewski, R Gonen, M Koutecký, N Talmon
Journal of Logic and Computation 32 (6), 1162-1194, 2022
532022
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
D Knop, M Koutecký, T Masařík, T Toufar
Logical Methods in Computer Science 15, 2019
392019
Integer programming in parameterized complexity: Five miniatures
T Gavenčiak, M Koutecký, D Knop
Discrete Optimization 44, 100596, 2022
32*2022
Parameterized complexity of distance labeling and uniform channel assignment problems
J Fiala, T Gavenčiak, D Knop, M Koutecký, J Kratochvíl
Discrete Applied Mathematics 248, 46-55, 2018
19*2018
Evaluating and Tuning n-fold Integer Programming
K Altmanová, D Knop, M Koutecký
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019
182019
Extension complexity, MSO logic, and treewidth
P Kolman, M Koutecký, HR Tiwary
Discrete Mathematics & Theoretical Computer Science 22 (Discrete Algorithms), 2020
17*2020
A unifying framework for manipulation problems
D Knop, M Koutecký, M Mnich
arXiv preprint arXiv:1801.09584, 2018
172018
Extended formulation for CSP that is compact for instances of bounded treewidth
P Kolman, M Koutecký
arXiv preprint arXiv:1502.05361, 2015
162015
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
TF Chan, JW Cooper, M Koutecky, D Král, K Pekarkova
SIAM Journal on Computing 51 (3), 664-700, 2022
152022
Parameterized resiliency problems
J Crampton, G Gutin, M Koutecký, R Watrigant
Theoretical Computer Science 795, 478-491, 2019
12*2019
Multitype integer monoid optimization and applications
D Knop, M Koutecký, A Levin, M Mnich, S Onn
arXiv preprint arXiv:1909.07326, 2019
122019
New bounds on augmenting steps of block-structured integer programs
L Chen, L Xu, W Shi, M Koutecký
arXiv preprint arXiv:1805.03741, 2018
122018
Parameterized algorithms for MILPs with small treedepth
C Brand, M Koutecký, S Ordyniak
Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12249 …, 2021
102021
Parameterized shifted combinatorial optimization
J Gajarský, P Hliněný, M Koutecký, S Onn
Journal of Computer and System Sciences 99, 53-71, 2019
82019
Improved analysis of online balanced clustering
M Bienkowski, M Böhm, M Koutecký, T Rothvoß, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 224-233, 2021
72021
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20