Dusan Knop

Discret. Math. Theor. Comput. Sci., 2024

Solving Multiagent Path Finding on Highly Centralized Networks.

[BibT_eX]

[DOI]

CoRR, 2024

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures.

[BibT_eX]

[DOI]

CoRR, 2024

Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Aggregation of Continuous Preferences in One Dimension.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Individual Rationality in Topological Distance Games Is Surprisingly Hard.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Hedonic diversity games: A complexity picture with more than two colors.

[BibT_eX]

[DOI]

Artif. Intell., December, 2023

Fine-grained view on bribery for group identification.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., June, 2023

Constant factor approximation for tracking paths and fault tolerant feedback vertex set.

[BibT_eX]

[DOI]

Discret. Optim., February, 2023

High-multiplicity N-fold IP via configuration LP.

[BibT_eX]

[DOI]

Math. Program., 2023

Polynomial kernels for tracking shortest paths.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology.

[BibT_eX]

[DOI]

CoRR, 2023

Maximizing Social Welfare in Score-Based Social Distance Games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

Treewidth is NP-Complete on Cubic Graphs (and related results).

[BibT_eX]

[DOI]

CoRR, 2023

Establishing Herd Immunity is Hard Even in Simple Geometric Networks.

[BibT_eX]

[DOI]

Michal Dvorák

Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023

Treewidth Is NP-Complete on Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Bribery Can Get Harder in Structured Multiwinner Approval Election.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Host Community Respecting Refugee Housing.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

The Parameterized Complexity of Network Microaggregation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Target Set Selection in Dense Graph Classes.

[BibT_eX]

[DOI]

Tomás Toufar

SIAM J. Discret. Math., 2022

Length-bounded cuts: Proper interval graphs and structural parameters.

[BibT_eX]

[DOI]

Matthias Bentert

Klaus Heeger

J. Comput. Syst. Sci., 2022

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Integer programming in parameterized complexity: Five miniatures.

[BibT_eX]

[DOI]

Tomas Gavenciak

Discret. Optim., 2022

Scheduling Kernels via Configuration LP.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract).

[BibT_eX]

[DOI]

Ondrej Suchý

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract).

[BibT_eX]

[DOI]

Václav Blazej

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Graph isomorphism restricted by lists.

[BibT_eX]

[DOI]

Pavel Klavík

Peter Zeman

Theor. Comput. Sci., 2021

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

SIAM J. Discret. Math., 2021

Kernelization of Graph Hamiltonicity: Proper H-Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Parameterized complexity of configuration integer programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Local linear set on graphs with bounded twin cover number.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Balancing the Spread of Two Opinions in Sparse Social Networks.

[BibT_eX]

[DOI]

Ondrej Suchý

CoRR, 2021

Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2021

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints.

[BibT_eX]

[DOI]

Artif. Intell., 2021

High-Multiplicity Fair Allocation Made More Practical.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints.

[BibT_eX]

[DOI]

Michal Pilipczuk

Marcin Wrochna

ACM Trans. Comput. Theory, 2020

Voting and Bribing in Single-Exponential Time.

[BibT_eX]

[DOI]

Matthias Mnich

ACM Trans. Economics and Comput., 2020

The Clever Shopper Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Combinatorial n-fold integer programming and applications.

[BibT_eX]

[DOI]

Matthias Mnich

Math. Program., 2020

Partitioning graphs into induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Multidimensional Stable Roommates with Master List.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View.

[BibT_eX]

[DOI]

Radek Husek

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Recognizing Proper Tree-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Parameterized Algorithms for Finding a Collective Set of Items.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Adapting Stable Matchings to Evolving Preferences.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Evaluating and Tuning <i>n</i>-fold Integer Programming.

[BibT_eX]

[DOI]

Katerina Altmanová

ACM J. Exp. Algorithmics, 2019

Multitype Integer Monoid Optimization and Applications.

[BibT_eX]

[DOI]

CoRR, 2019

Complexity of the Steiner Network Problem with Respect to the Number of Terminals.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Parameterized Complexity of Fair Vertex Evaluation Problems.

[BibT_eX]

[DOI]

Tomás Toufar

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Integer Programming and Incidence Treedepth.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Solving Integer Quadratic Programming via Explicit and Structural Restrictions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Scheduling meets n-fold integer programming.

[BibT_eX]

[DOI]

J. Sched., 2018

Computational complexity of distance edge labeling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Parameterized complexity of distance labeling and uniform channel assignment problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Parameterized complexity of fair deletion problems II.

[BibT_eX]

[DOI]

Tomás Toufar

CoRR, 2018

Parameterized Complexity of Length-bounded Cuts and Multicuts.

[BibT_eX]

[DOI]

Algorithmica, 2018

Evaluating and Tuning n-fold Integer Programming.

[BibT_eX]

[DOI]

Katerina Altmanová

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Integer Programming in Parameterized Complexity: Three Miniatures.

[BibT_eX]

[DOI]

Tomas Gavenciak

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Unary Integer Linear Programming with Structural Restrictions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Unifying Framework for Manipulation Problems.

[BibT_eX]

[DOI]

Matthias Mnich

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

IV-matching is strongly NP-hard.

[BibT_eX]

[DOI]

Lukás Folwarczný

Inf. Process. Lett., 2017

Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity.

[BibT_eX]

[DOI]

Tomas Gavenciak

CoRR, 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Anti-Path Cover on Sparse Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2016

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Parameterized complexity of length-bounded cuts and multi-cuts.

[BibT_eX]

[DOI]

Pavel Dvorak

CoRR, 2015

A note on partition into triangles parametrized by tree-width.

[BibT_eX]

[DOI]

CoRR, 2015

Distance constrained labeling on graphs with bounded neighborhood diversity.

[BibT_eX]

[DOI]

CoRR, 2015

Parametrized Complexity of Length-Bounded Cuts and Multi-cuts.

[BibT_eX]

[DOI]

Pavel Dvorak