Martin Koutecký

From MaRDI portal
Person:907217

Available identifiers

zbMath Open koutecky.martinDBLP159/1762WikidataQ62036723 ScholiaQ62036723MaRDI QIDQ907217

List of research outcomes





PublicationDate of PublicationType
Parameterized algorithms for block-structured integer programs with large entries2024-11-28Paper
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming2024-11-07Paper
Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming2024-06-24Paper
Reducibility bounds of objective functions over the integers2024-06-17Paper
A polyhedral perspective on tropical convolutions2023-12-22Paper
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines2023-11-14Paper
Heuristics for opinion diffusion via local elections2023-08-14Paper
High-multiplicity \(N\)-fold IP via configuration LP2023-05-25Paper
Correction to: Opinion diffusion and campaigning on society graphs2023-05-16Paper
https://portal.mardi4nfdi.de/entity/Q58745012023-02-07Paper
Improved analysis of online balanced clustering2022-10-19Paper
A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)2022-09-12Paper
Opinion diffusion and campaigning on society graphs2022-09-08Paper
Integer programming in parameterized complexity: five miniatures2022-06-09Paper
Approximate separable multichoice optimization over monotone systems2022-06-09Paper
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming2022-06-08Paper
https://portal.mardi4nfdi.de/entity/Q50710292022-04-19Paper
Parameterized complexity of configuration integer programs2022-03-11Paper
A note on the approximability of deepest-descent circuit steps2021-12-13Paper
Integer Programming in Parameterized Complexity: Three Miniatures.2021-08-04Paper
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs2021-07-28Paper
Uniform and monotone line sum optimization2021-05-31Paper
https://portal.mardi4nfdi.de/entity/Q33866302021-01-05Paper
https://portal.mardi4nfdi.de/entity/Q51407192020-12-16Paper
Combinatorial \(n\)-fold integer programming and applications2020-10-21Paper
A Note on the Approximability of Deepest-Descent Circuit Steps2020-10-21Paper
https://portal.mardi4nfdi.de/entity/Q51117432020-05-27Paper
Approximating max-cut under graph-MSO constraints2020-02-10Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity2020-01-03Paper
Parameterized resiliency problems2019-10-18Paper
Scheduling meets \(n\)-fold integer programming2019-08-08Paper
Parameterized shifted combinatorial optimization2018-12-10Paper
Parameterized complexity of distance labeling and uniform channel assignment problems2018-09-17Paper
https://portal.mardi4nfdi.de/entity/Q46366462018-04-19Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity2018-01-04Paper
Parameterized shifted combinatorial optimization2017-10-23Paper
Extension Complexity, MSO Logic, and Treewidth2017-10-17Paper
Parameterized Resiliency Problems via Integer Linear Programming2017-07-21Paper
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems2016-09-02Paper
Extended formulation for CSP that is compact for instances of bounded treewidth2016-01-25Paper

Research outcomes over time

This page was built for person: Martin Koutecký