Martin Koutecký | DeepAI

AI Chat

Featured Co-authors

Nimrod Talmon
43 publications
Piotr Faliszewski
35 publications
Sebastian Ordyniak
31 publications
Dušan Knop
31 publications
Matthias Mnich
28 publications
Asaf Levin
17 publications
Johannes Zink
17 publications
Andreas Emil Feldmann
16 publications
Kim-Manuel Klein
11 publications
Shmuel Onn
11 publications
Viswanath Nagarajan
11 publications

∙ 08/30/2022

Fine-Grained Liquid Democracy for Cumulative Ballots

We investigate efficient ways for the incorporation of liquid democracy ...

0 Matthias Köppe, et al. ∙

∙ 02/10/2022

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

An intensive line of research on fixed parameter tractability of integer...

0 Marcin Briański, et al. ∙

∙ 11/15/2021

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises

An influential 1990 paper of Hochbaum and Shanthikumar made it common wi...

0 Cornelius Brand, et al. ∙

∙ 10/21/2020

A Note on the Approximability of Deepest-Descent Circuit Steps

Linear programs (LPs) can be solved through a polynomial number of so-ca...

0 Steffen Borgwardt, et al. ∙

∙ 10/01/2020

Opinion Diffusion and Campaigning on Society Graphs

We study the effects of campaigning, where the society is partitioned in...

0 Piotr Faliszewski, et al. ∙

∙ 09/24/2020

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines

The task of scheduling jobs to machines while minimizing the total makes...

0 Martin Koutecký, et al. ∙

∙ 05/09/2020

Multi-Party Campaigning

We study a social choice setting of manipulation in elections and extend...

0 Martin Koutecký, et al. ∙

∙ 03/04/2020

Scheduling Kernels via Configuration LP

Makespan minimization (on parallel identical or unrelated machines) is a...

0 Dušan Knop, et al. ∙

∙ 12/07/2019

Parameterized Algorithms for MILPs with Small Treedepth

Solving (mixed) integer linear programs, (M)ILPs for short, is a fundame...

0 Cornelius Brand, et al. ∙

∙ 09/16/2019

Multitype Integer Monoid Optimization and Applications

Configuration integer programs (IP) have been key in the design of algor...

0 Dušan Knop, et al. ∙

∙ 07/15/2019

A row-invariant parameterized algorithm for integer programming

A long line of research on fixed parameter tractability of integer progr...

0 Martin Koutecký, et al. ∙

∙ 04/02/2019

An Algorithmic Theory of Integer Programming

We study the general integer programming problem where the number of var...

0 Friedrich Eisenbrand, et al. ∙

∙ 12/05/2018

Voting and Bribing in Single-Exponential Time

We introduce a general problem about bribery in voting systems. In the R...

0 Dušan Knop, et al. ∙

∙ 03/15/2018

Approximating Max-Cut under Graph-MSO Constraints

We consider the max-cut and max-k-cut problems under graph-based constra...

0 Martin Koutecký, et al. ∙

∙ 02/25/2018

Evaluating and Tuning n-fold Integer Programming

In recent years, algorithmic breakthroughs in stringology, computational...

0 Kateřina Altmanová, et al. ∙

∙ 02/16/2018

A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs

The theory of n-fold integer programming has been recently emerging as a...

0 Martin Koutecký, et al. ∙

∙ 01/29/2018

A Unifying Framework for Manipulation Problems

Manipulation models for electoral systems are a core research theme in s...

0 Dušan Knop, et al. ∙

∙ 11/06/2017

Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity

In the past 30 years, results regarding special classes of integer linea...

0 Tomáš Gavenčiak, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world