| Publication | Date of Publication | Type |
|---|
On the complexity of target set selection in simple geometric networks
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-17 | Paper |
Maximizing Social Welfare in Score-Based Social Distance Games
Electronic Proceedings in Theoretical Computer Science | 2024-02-28 | Paper |
Hedonic diversity games: a complexity picture with more than two colors
Artificial Intelligence | 2023-12-14 | Paper |
scientific article; zbMATH DE number 7765394 (Why is no real title available?)
| 2023-11-14 | Paper |
Recognizing Proper Tree-Graphs
| 2023-11-13 | Paper |
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
| 2023-11-13 | Paper |
Establishing herd immunity is hard even in simple geometric networks
Lecture Notes in Computer Science | 2023-10-04 | Paper |
High-multiplicity \(N\)-fold IP via configuration LP
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Multidimensional stable roommates with master list
| 2023-03-21 | Paper |
Constant factor approximation for tracking paths and fault tolerant feedback vertex set
Discrete Optimization | 2023-03-03 | Paper |
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
| 2023-02-03 | Paper |
Treewidth is NP-Complete on Cubic Graphs (and related results)
| 2023-01-24 | Paper |
Graph isomorphism restricted by lists
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
Information and Computation | 2022-12-08 | Paper |
Tight complexity lower bounds for integer linear programming with few constraints
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Polynomial kernels for tracking shortest paths
Information Processing Letters | 2022-10-28 | Paper |
Constant factor approximation for tracking paths and fault tolerant feedback vertex set
Approximation and Online Algorithms | 2022-10-19 | Paper |
scientific article; zbMATH DE number 7561372 (Why is no real title available?)
| 2022-07-21 | Paper |
Parameterized complexity of fair vertex evaluation problems
| 2022-07-21 | Paper |
Tight complexity lower bounds for integer linear programming with few constraints
| 2022-07-18 | Paper |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
| 2022-07-18 | Paper |
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
| 2022-07-03 | Paper |
Integer programming in parameterized complexity: five miniatures
Discrete Optimization | 2022-06-09 | Paper |
Length-bounded cuts: proper interval graphs and structural parameters
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Target Set Selection in Dense Graph Classes
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Parameterized complexity of configuration integer programs
Operations Research Letters | 2022-03-11 | Paper |
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
Artificial Intelligence | 2021-11-02 | Paper |
Integer programming in parameterized complexity: three miniatures
| 2021-08-04 | Paper |
Local linear set on graphs with bounded twin cover number
Information Processing Letters | 2021-06-16 | Paper |
Kernelization of graph Hamiltonicity: proper \(H\)-graphs
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
Graph isomorphism restricted by lists
Theoretical Computer Science | 2021-03-09 | Paper |
Evaluating and tuning \(n\)-fold integer programming
| 2020-12-16 | Paper |
Combinatorial \(n\)-fold integer programming and applications
Mathematical Programming. Series A. Series B | 2020-10-21 | Paper |
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
| 2020-08-05 | Paper |
Combinatorial \(n\)-fold integer programming and applications
| 2020-05-27 | Paper |
The clever shopper problem
Theory of Computing Systems | 2020-02-27 | Paper |
Integer programming and incidence treedepth
| 2020-02-06 | Paper |
Kernelization of graph Hamiltonicity: proper \(H\)-graphs
| 2020-01-16 | Paper |
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
Logical Methods in Computer Science | 2020-01-03 | Paper |
Partitioning graphs into induced subgraphs
Discrete Applied Mathematics | 2019-12-30 | Paper |
Scheduling meets \(n\)-fold integer programming
Journal of Scheduling | 2019-08-08 | Paper |
Parameterized complexity of length-bounded cuts and multicuts
Algorithmica | 2018-10-18 | Paper |
Parameterized complexity of distance labeling and uniform channel assignment problems
Discrete Applied Mathematics | 2018-09-17 | Paper |
Computational complexity of distance edge labeling
Discrete Applied Mathematics | 2018-06-27 | Paper |
Voting and bribing in single-exponential time
| 2018-04-19 | Paper |
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
Lecture Notes in Computer Science | 2018-01-04 | Paper |
\(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard
Information Processing Letters | 2017-06-13 | Paper |
Partitioning graphs into induced subgraphs
Lecture Notes in Computer Science | 2017-06-01 | Paper |
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Computational complexity of distance edge labeling
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Parametrized complexity of length-bounded cuts and multi-cuts
Lecture Notes in Computer Science | 2015-09-30 | Paper |
