Eduard Eiben

Tiger-Lily Goldsmith

Theor. Comput. Sci., 2024

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.

[BibT_eX]

[DOI]

Inf. Comput., 2024

EF1 and EFX Orientations.

[BibT_eX]

[DOI]

CoRR, 2024

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Bi-objective Optimization in Role Mining.

[BibT_eX]

[DOI]

CoRR, 2024

Determinantal Sieving.

[BibT_eX]

[DOI]

Tomohiro Koana

Magnus Wahlström

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 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

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

The Complexity of Fair Division of Indivisible Items with Externalities.

[BibT_eX]

[DOI]

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

Learning Small Decision Trees for Data of Low Rank-Width.

[BibT_eX]

[DOI]

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

2023

A Polynomial Kernel for 3-Leaf Power Deletion.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

On the parameterized complexity of clustering problems for incomplete data.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., June, 2023

Preference swaps for the stable matching problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Some coordination problems are harder than others.

[BibT_eX]

[DOI]

CoRR, 2023

Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems.

[BibT_eX]

[DOI]

CoRR, 2023

Parameterized complexity of envy-free resource allocation in social networks.

[BibT_eX]

[DOI]

Artif. Intell., 2023

Finding a Highly Connected Steiner Subgraph and its Applications.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.

[BibT_eX]

[DOI]

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

Learning Small Decision Trees with Large Domain.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Minimizing Reachability Times on Temporal Graphs via Shifting Labels.

[BibT_eX]

[DOI]

Argyrios Deligkas

George Skretas

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

The Computational Complexity of Concise Hypersphere Classification.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

The Parameterized Complexity of Coordinated Motion Planning.

[BibT_eX]

[DOI]

Iyad Kanj

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source.

[BibT_eX]

[DOI]

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

A Structural Complexity Analysis of Synchronous Dynamical Systems.

[BibT_eX]

[DOI]

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

2022

Valued Authorization Policy Existence Problem: Theory and Experiments.

[BibT_eX]

[DOI]

ACM Trans. Priv. Secur., 2022

On Covering Segments with Unit Intervals.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set.

[BibT_eX]

[DOI]

CoRR, 2022

Component Order Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

On the Lossy Kernelization for Connected Treedepth Deletion Set.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Generalized Noise Role Mining.

[BibT_eX]

[DOI]

Proceedings of the SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8, 2022

On the Parameterized Complexity of Symmetric Directed Multicut.

[BibT_eX]

[DOI]

Clément Rambaud

Magnus Wahlström

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Unifying Framework for Characterizing and Computing Width Measures.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

The Complexity of Envy-Free Graph Cutting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Parameterized Complexity of Hotelling-Downs with Party Nominees.

[BibT_eX]

[DOI]

Argyrios Deligkas

Tiger-Lily Goldsmith

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Finding a Cluster in Incomplete Data.

[BibT_eX]

[DOI]

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

2021

Bisection of bounded treewidth graphs by convolutions.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Amer E. Mouawad

J. Comput. Syst. Sci., 2021

Measuring what matters: A hybrid approach to dynamic programming with treewidth.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Towards a Polynomial Kernel for Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

Algorithmica, 2021

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

[BibT_eX]

[DOI]

Artif. Intell., 2021

EPTAS for <i>k</i>-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Valued Authorization Policy Existence Problem.

[BibT_eX]

[DOI]

Proceedings of the SACMAT '21: The 26th ACM Symposium on Access Control Models and Technologies, 2021

The Parameterized Complexity of Connected Fair Division.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

The Parameterized Complexity of Clustering Incomplete Data.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

A Colored Path Problem and Its Applications.

[BibT_eX]

[DOI]

Iyad Kanj

ACM Trans. Algorithms, 2020

Toward Cereceda's conjecture for planar graphs.

[BibT_eX]

[DOI]

Carl Feghali

J. Graph Theory, 2020

Using decomposition-parameters for QBF: Mind the prefix!

[BibT_eX]

[DOI]

Sebastian Ordyniak

J. Comput. Syst. Sci., 2020

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

CoRR, 2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

A Polynomial Kernel for Paw-Free Editing.

[BibT_eX]

[DOI]

William Lochet

Saket Saurabh

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

Extending Partial 1-Planar Drawings.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

A Polynomial Kernel for Line Graph Deletion.

[BibT_eX]

[DOI]

William Lochet

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Removing Connected Obstacles in the Plane Is FPT.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the 36th International Symposium on Computational Geometry, 2020

On the Problem of Covering a 3-D Terrain.

[BibT_eX]

[DOI]

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

Manipulating Districts to Win Elections: Fine-Grained Complexity.

[BibT_eX]

[DOI]

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

2019

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Symmetry properties of generalized graph truncations.

[BibT_eX]

[DOI]

Robert Jajcay

Primoz Sparl

J. Comb. Theory B, 2019

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets.

[BibT_eX]

[DOI]

Danny Hermelin

J. Comput. Syst. Sci., 2019

On Clustering Incomplete Data.

[BibT_eX]

[DOI]

CoRR, 2019

Counting Linear Extensions: Parameterizations by Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 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

The Parameterized Complexity of Cascading Portfolio Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Integer Programming and Incidence Treedepth.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 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

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion.

[BibT_eX]

[DOI]

O-joung Kwon

J. Comput. Syst. Sci., 2018

Meta-kernelization using well-structured modulators.

[BibT_eX]

[DOI]

Stefan Szeider

Discret. Appl. Math., 2018

On the complexity of rainbow coloring problems.

[BibT_eX]

[DOI]

Juho Lauri

Discret. Appl. Math., 2018

Towards Cereceda's conjecture for planar graphs.

[BibT_eX]

[DOI]

Carl Feghali

CoRR, 2018

Solving Problems on Graphs of High Rank-Width.

[BibT_eX]

[DOI]

Stefan Szeider

Algorithmica, 2018

Small Resolution Proofs for QBF using Dependency Treewidth.

[BibT_eX]

[DOI]

Sebastian Ordyniak

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Structural Approach to Activity Selection.

[BibT_eX]

[DOI]

Sebastian Ordyniak

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

Unary Integer Linear Programming with Structural Restrictions.

[BibT_eX]

[DOI]

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

How to Navigate Through Obstacles?.

[BibT_eX]

[DOI]

Iyad A. Kanj

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Improved Results for Minimum Constraint Removal.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Lossy Kernels for Hitting Subgraphs.

[BibT_eX]

[DOI]

Danny Hermelin

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 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

Equimatchable Graphs on Surfaces.

[BibT_eX]

[DOI]