Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
On the complexity of some colorful problems parameterized by treewidth | Information and Computation |
| 42 | 2011 |
Infeasibility of instance compression and succinct PCPs for NP | Journal of Computer and System Sciences |
| 84 | 2011 |
On nowhere dense graphs | European Journal of Combinatorics |
| 46 | 2011 |
Paths of bounded length and their cuts: Parameterized complexity and algorithms | Discrete Optimization |
| 18 | 2011 |
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions | Algorithmica |
| 31 | 2010 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Online, computable and punctual structure theory | Logic Journal of the IGPL |
| 2022 | |
Tree-coloring problems of bounded treewidth graphs | Journal of Combinatorial Optimization |
| 6 | 2019 |
Parameterized approximation via fidelity preserving transformations | Journal of Computer and System Sciences |
| 4 | 2018 |
Graphs with few P4’s under the convexity of paths of order three | Discrete Applied Mathematics |
| 9 | 2015 |
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity | European Journal of Combinatorics |
| 48 | 2013 |