Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Koutecký
Person information
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon:
Fine-Grained Liquid Democracy for Cumulative Ballots. AAMAS 2024: 1029-1037- [c25]Christoph Hunkenschröder
, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. IPCO 2024: 224-237 - [c24]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak:
Parameterized algorithms for block-structured integer programs with large entries. SODA 2024: 740-751 - [c23]Jakub Komárek, Martin Koutecký:
Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization. SEA 2024: 18:1-18:21 - [i30]Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. CoRR abs/2402.17290 (2024) - 2023
- [j23]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Correction to: Opinion diffusion and campaigning on society graphs. J. Log. Comput. 33(3): 706 (2023) - [j22]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - [j21]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6): 595-598 (2023) - [c22]Cornelius Brand, Martin Koutecký, Alexandra Lassota:
A Polyhedral Perspective on Tropical Convolutions. IWOCA 2023: 111-122 - [c21]Rica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon:
Heuristics for Opinion Diffusion via Local Elections. SOFSEM 2023: 144-158 - [i29]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak:
Parameterized algorithms for block-structured integer programs with large entries. CoRR abs/2311.01890 (2023) - 2022
- [j20]Tomas Gavenciak, Martin Koutecký, Dusan Knop:
Integer programming in parameterized complexity: Five miniatures. Discret. Optim. 44(Part): 100596 (2022) - [j19]Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44(Part): 100629 (2022) - [j18]Martin Koutecký:
A Note on Coloring (4K1, C4, C6)-Free Graphs with a C7. Graphs Comb. 38(5): 149 (2022) - [j17]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion diffusion and campaigning on society graphs. J. Log. Comput. 32(6): 1162-1194 (2022) - [j16]Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král, Kristýna Pekárková:
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. SIAM J. Comput. 51(3): 664-700 (2022) - [c20]Dusan Knop, Martin Koutecký:
Scheduling Kernels via Configuration LP. ESA 2022: 73:1-73:15 - [c19]Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder:
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. ICALP 2022: 29:1-29:20 - [i28]Marcin Brianski, Martin Koutecký, Daniel Král, Kristýna Pekárková, Felix Schröder:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. CoRR abs/2202.05299 (2022) - [i27]Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon:
Fine-Grained Liquid Democracy for Cumulative Ballots. CoRR abs/2208.14441 (2022) - 2021
- [j15]Martin Koutecký, Shmuel Onn:
Uniform and monotone line sum optimization. Discret. Appl. Math. 298: 165-170 (2021) - [j14]Martin Koutecký, Shmuel Onn:
Sparse Integer Programming is FPT. Bull. EATCS 134 (2021) - [j13]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. 49(3): 310-315 (2021) - [j12]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49(6): 908-913 (2021) - [c18]Martin Koutecký, Nimrod Talmon:
Multi-Party Campaigning. AAAI 2021: 5506-5513 - [c17]Cornelius Brand, Martin Koutecký, Sebastian Ordyniak:
Parameterized Algorithms for MILPs with Small Treedepth. AAAI 2021: 12249-12257 - [c16]Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. WAOA 2021: 224-233 - [i26]Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. CoRR abs/2107.00145 (2021) - [i25]Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak:
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR abs/2111.08048 (2021) - 2020
- [j11]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j10]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold integer programming and applications. Math. Program. 184(1): 1-34 (2020) - [j9]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. 8(3): 12:1-12:28 (2020) - [c15]Lin Chen, Martin Koutecký, Lei Xu, Weidong Shi:
New Bounds on Augmenting Steps of Block-Structured Integer Programs. ESA 2020: 33:1-33:19 - [c14]Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král', Kristýna Pekárková:
Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming. ICALP 2020: 26:1-26:19 - [c13]Martin Koutecký, Johannes Zink:
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. ISAAC 2020: 18:1-18:17 - [i24]Dusan Knop, Martin Koutecký:
Scheduling Kernels via Configuration LP. CoRR abs/2003.02187 (2020) - [i23]Martin Koutecký, Nimrod Talmon:
Multi-Party Campaigning. CoRR abs/2005.04455 (2020) - [i22]Martin Koutecký, Johannes Zink:
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. CoRR abs/2009.11840 (2020) - [i21]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. CoRR abs/2010.00651 (2020) - [i20]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR abs/2010.10809 (2020) - [i19]Martin Koutecký, Shmuel Onn:
Uniform and Monotone Line Sum Optimization. CoRR abs/2011.09932 (2020)
2010 – 2019
- 2019
- [j8]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99: 53-71 (2019) - [j7]Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. ACM J. Exp. Algorithmics 24(1): 2.2:1-2.2:22 (2019) - [j6]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. 15(4) (2019) - [j5]Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
Parameterized resiliency problems. Theor. Comput. Sci. 795: 478-491 (2019) - [i18]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
An Algorithmic Theory of Integer Programming. CoRR abs/1904.01361 (2019) - [i17]Martin Koutecký, Daniel Král:
A row-invariant parameterized algorithm for integer programming. CoRR abs/1907.06688 (2019) - [i16]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Multitype Integer Monoid Optimization and Applications. CoRR abs/1909.07326 (2019) - [i15]Cornelius Brand, Martin Koutecký, Sebastian Ordyniak:
Parameterized Algorithms for MILPs with Small Treedepth. CoRR abs/1912.03501 (2019) - 2018
- [j4]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. 248: 46-55 (2018) - [j3]Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Approximating max-cut under graph-MSO constraints. Oper. Res. Lett. 46(6): 592-598 (2018) - [j2]Dusan Knop, Martin Koutecký:
Scheduling meets n-fold integer programming. J. Sched. 21(5): 493-503 (2018) - [c12]Dusan Knop, Martin Koutecký, Matthias Mnich:
A Unifying Framework for Manipulation Problems. AAMAS 2018: 256-264 - [c11]Martin Koutecký, Asaf Levin, Shmuel Onn:
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP 2018: 85:1-85:14 - [c10]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. IJCAI 2018: 219-225 - [c9]Tomas Gavenciak, Dusan Knop, Martin Koutecký:
Integer Programming in Parameterized Complexity: Three Miniatures. IPEC 2018: 21:1-21:16 - [c8]Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. SEA 2018: 10:1-10:14 - [i14]Dusan Knop, Martin Koutecký, Matthias Mnich:
A Unifying Framework for Manipulation Problems. CoRR abs/1801.09584 (2018) - [i13]Martin Koutecký, Asaf Levin, Shmuel Onn:
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR abs/1802.05859 (2018) - [i12]Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. CoRR abs/1802.09007 (2018) - [i11]Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Approximating Max-Cut under Graph-MSO Constraints. CoRR abs/1803.05718 (2018) - [i10]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. CoRR abs/1812.01852 (2018) - 2017
- [c7]Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
Parameterized Resiliency Problems via Integer Linear Programming. CIAC 2017: 164-176 - [c6]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. COCOON 2017: 224-236 - [c5]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold Integer Programming and Applications. ESA 2017: 54:1-54:14 - [c4]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. STACS 2017: 46:1-46:14 - [c3]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG 2017: 344-357 - [i9]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. CoRR abs/1702.06844 (2017) - [i8]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. CoRR abs/1703.00544 (2017) - [i7]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold Integer Programming and Applications. CoRR abs/1705.08657 (2017) - [i6]Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate Shifted Combinatorial Optimization. CoRR abs/1706.02075 (2017) - [i5]Tomas Gavenciak, Dusan Knop, Martin Koutecký:
Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. CoRR abs/1711.02032 (2017) - 2016
- [c2]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON 2016: 67-78 - [c1]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth . SWAT 2016: 18:1-18:14 - [i4]Dusan Knop, Martin Koutecký:
Scheduling meets n-fold Integer Programming. CoRR abs/1603.02611 (2016) - 2015
- [j1]Petr Kolman, Martin Koutecký:
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. Electron. J. Comb. 22(4): 4 (2015) - [i3]Petr Kolman, Martin Koutecký:
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. CoRR abs/1502.05361 (2015) - [i2]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR abs/1507.00640 (2015) - [i1]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth. CoRR abs/1507.04907 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
