| Publication | Date of Publication | Type |
|---|
The splitting power of branching programs of bounded repetition and CNFs of bounded width
Discrete Applied Mathematics | 2024-12-04 | Paper |
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
| 2024-05-03 | Paper |
scientific article; zbMATH DE number 7803603 (Why is no real title available?)
| 2024-02-12 | Paper |
The Treewidth and Pathwidth of Graph Unions
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Fractional covers of hypergraphs with bounded multi-intersection
Theoretical Computer Science | 2023-10-26 | Paper |
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
Journal of the ACM | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7559412 (Why is no real title available?)
| 2022-07-18 | Paper |
Tree-width dichotomy
European Journal of Combinatorics | 2022-05-10 | Paper |
The splitting power of branching programs of bounded repetition and CNFs of bounded width
| 2022-01-06 | Paper |
Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation
Journal of Combinatorics | 2019-01-28 | Paper |
Specifying a positive threshold function via extremal points
| 2019-01-10 | Paper |
Linear read-once and related Boolean functions
Discrete Applied Mathematics | 2018-10-26 | Paper |
Well-quasi-ordering versus clique-width
Journal of Combinatorial Theory. Series B | 2018-04-18 | Paper |
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth
Theory of Computing Systems | 2017-10-12 | Paper |
Partial matching width and its application to lower bounds for branching programs
| 2017-09-26 | Paper |
Well-quasi-ordering does not imply bounded clique-width
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On the read-once property of branching programs and CNFs of bounded treewidth
Algorithmica | 2016-09-07 | Paper |
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM | 2015-11-11 | Paper |
No small nondeterministic read-once branching programs for CNFs of bounded treewidth
Parameterized and Exact Computation | 2015-09-15 | Paper |
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
SIAM Journal on Computing | 2014-07-30 | Paper |
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Boundary properties of well-quasi-ordered sets of graphs
Order | 2013-11-22 | Paper |
Cliquewidth and knowledge compilation
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Linear time algorithm for computing a small biclique in graphs without long induced paths
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Treewidth reduction for constrained separation and bipartization problems
| 2012-01-23 | Paper |
Soft constraints of difference and equality
Journal of Artificial Intelligence Research | 2011-06-16 | Paper |
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters | 2010-09-01 | Paper |
A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem
Information Processing Letters | 2010-03-24 | Paper |
Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
Parameterized and Exact Computation | 2010-01-14 | Paper |
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences | 2009-11-10 | Paper |
Minimum leaf out-branching and related problems
Theoretical Computer Science | 2009-11-04 | Paper |
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Connected Coloring Completion for General Graphs: Algorithms and Complexity
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Generalizing Global Constraints Based on Network Flows
Lecture Notes in Computer Science | 2009-01-13 | Paper |
scientific article; zbMATH DE number 5485529 (Why is no real title available?)
| 2009-01-05 | Paper |
On the minimum feedback vertex set problem: Exact and enumeration algorithms
Algorithmica | 2008-12-02 | Paper |
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
Minimum Leaf Out-Branching Problems
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
A CSP search algorithm with responsibility sets and kernels
Constraints | 2007-10-22 | Paper |
Exact Computation of Maximum Induced Forest
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Recent Advances in Constraints
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Recent Advances in Constraints
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Recent Advances in Constraints
Lecture Notes in Computer Science | 2005-11-11 | Paper |
