| Publication | Date of Publication | Type |
|---|
On solution discovery via reconfiguration
Journal of Computer and System Sciences | 2026-02-11 | Paper |
On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves
Journal of Computer and System Sciences | 2025-08-21 | Paper |
Editing to cliques: a survey of FPT results and recent applications in analyzing large datasets
Matemática Contemporânea | 2024-04-22 | Paper |
On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
Lecture Notes in Computer Science | 2023-10-04 | Paper |
A Survey on the Complexity of Flood-Filling Games
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
What Is Known About Vertex Cover Kernelization?
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Collaborating with Hans: Some Remaining Wonderments
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
Artificial Intelligence | 2022-03-02 | Paper |
Tractable parameterizations for the minimum linear arrangement problem
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
Discrete Applied Mathematics | 2018-05-24 | Paper |
A brief history of Edward K. Blum and the Journal of Computer and System Sciences
Journal of Computer and System Sciences | 2018-04-18 | Paper |
Parameterized approximation via fidelity preserving transformations
Journal of Computer and System Sciences | 2017-12-21 | Paper |
| The Flood-It game parameterized by the vertex cover number | 2016-10-17 | Paper |
Myhill-Nerode methods for hypergraphs
Algorithmica | 2016-02-19 | Paper |
Distortion is fixed parameter tractable
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Multivariate complexity theory
Computer Science | 2014-02-21 | Paper |
Myhill-Nerode methods for hypergraphs
Lecture Notes in Computer Science | 2014-01-14 | Paper |
Tractable parameterizations for the minimum linear arrangement problem
Lecture Notes in Computer Science | 2013-09-17 | Paper |
| Cutting up is hard to do: the parameterised complexity of k-cut and related problems | 2013-08-27 | Paper |
Parameterized approximation via fidelity preserving transformations
Automata, Languages, and Programming | 2013-08-12 | Paper |
Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
Theoretical Computer Science | 2013-03-04 | Paper |
Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
European Journal of Combinatorics | 2013-01-24 | Paper |
Parameterizing by the number of numbers
Theory of Computing Systems | 2012-12-06 | Paper |
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
Algorithmica | 2012-11-21 | Paper |
Passion plays: melodramas about mathematics
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Computer science unplugged and related projects in math and computer science popularization
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
| Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average | 2012-08-31 | Paper |
| Determining the winner of a Dodgson election is hard | 2012-08-29 | Paper |
Local search: is brute-force avoidable?
Journal of Computer and System Sciences | 2012-08-17 | Paper |
The parameterized complexity of stabbing rectangles
Algorithmica | 2012-04-26 | Paper |
Quadratic kernelization for convex recoloring of trees
Algorithmica | 2011-09-20 | Paper |
On the complexity of some colorful problems parameterized by treewidth
Information and Computation | 2011-02-21 | Paper |
Parameterizing by the number of numbers
Lecture Notes in Computer Science | 2010-12-07 | Paper |
Milling a graph with turn costs: a parameterized complexity perspective
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Parameterized approximation of dominating set problems
Information Processing Letters | 2010-06-09 | Paper |
Clique-width is NP-complete
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
W-hierarchies defined by symmetric gates
Theory of Computing Systems | 2010-05-10 | Paper |
Clustering with partial information
Theoretical Computer Science | 2010-03-09 | Paper |
What makes equitable connected partition easy
Parameterized and Exact Computation | 2010-01-14 | Paper |
Well-quasi-orders in subclasses of bounded treewidth graphs
Parameterized and Exact Computation | 2010-01-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science | 2009-11-04 | Paper |
The complexity ecology of parameters: An illustration using bounded max leaf number
Theory of Computing Systems | 2009-10-19 | Paper |
Distortion Is Fixed Parameter Tractable
Automata, Languages and Programming | 2009-07-14 | Paper |
Haplotype Inference Constrained by Plausible Haplotype Data
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Connected Coloring Completion for General Graphs: Algorithms and Complexity
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Quadratic Kernelization for Convex Recoloring of Trees
Lecture Notes in Computer Science | 2009-03-06 | Paper |
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science | 2009-02-19 | Paper |
Clustering with Partial Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Graph Layout Problems Parameterized by Vertex Cover
Algorithms and Computation | 2009-01-29 | Paper |
Leaf Powers and Their Properties: Using the Trees
Algorithms and Computation | 2009-01-29 | Paper |
On the parameterized complexity of layered graph drawing
Algorithmica | 2008-12-02 | Paper |
Faster fixed-parameter tractable algorithms for matching and packing problems
Algorithmica | 2008-12-02 | Paper |
Fixed-Parameter Algorithms for Kemeny Scores
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
A Purely Democratic Characterization of W[1]
Parameterized and Exact Computation | 2008-06-05 | Paper |
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
Parameterized and Exact Computation | 2008-06-03 | Paper |
An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
Theory of Computing Systems | 2007-12-19 | Paper |
The complexity of polynomial-time approximation
Theory of Computing Systems | 2007-12-19 | Paper |
On complexity of lobbying in multiple referenda
Review of Economic Design | 2007-12-06 | Paper |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Lecture Notes in Computer Science | 2007-11-13 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2084262 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080206 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1875438 (Why is no real title available?) | 2003-03-02 | Paper |
