| Publication | Date of Publication | Type |
|---|
Roman census: enumerating and counting Roman dominating functions on graph classes
| 2024-12-03 | Paper |
Minimal Roman dominating functions: extensions and enumeration
Algorithmica | 2024-05-30 | Paper |
A Linear Kernel for Planar Vector Domination
| 2023-12-14 | Paper |
Minimal Roman dominating functions: extensions and enumeration
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
Theoretical Computer Science | 2023-05-02 | Paper |
An improved exact algorithm for minimum dominating set in chordal graphs
Information Processing Letters | 2021-12-14 | Paper |
A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph
| 2021-11-10 | Paper |
Parameterized dynamic variants of red-blue dominating set
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Partitioning a graph into degenerate subgraphs
European Journal of Combinatorics | 2019-11-28 | Paper |
Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks
Theory of Computing Systems | 2019-09-05 | Paper |
Efficient parallel algorithms for parameterized problems
Theoretical Computer Science | 2019-08-20 | Paper |
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
Frontiers in Algorithmics | 2019-04-26 | Paper |
Clustering with lower-bounded sizes. A general graph-theoretic framework
Algorithmica | 2018-07-26 | Paper |
scientific article; zbMATH DE number 6861937 (Why is no real title available?)
| 2018-04-19 | Paper |
On the complexity of multi-parameterized cluster editing
Journal of Discrete Algorithms | 2017-10-06 | Paper |
On the complexity of various parameterizations of common induced subgraph isomorphism
Theoretical Computer Science | 2017-09-28 | Paper |
On the parameterized parallel complexity and the vertex cover problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
The monotone circuit value problem with bounded genus is in NC
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Enumerating minimal dominating sets in chordal graphs
Information Processing Letters | 2016-08-16 | Paper |
Data reductions and combinatorial bounds for improved approximation algorithms
Journal of Computer and System Sciences | 2015-12-30 | Paper |
On the complexity of various parameterizations of common induced subgraph isomorphism
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Approximation algorithms inspired by kernelization methods
Algorithms and Computation | 2015-09-11 | Paper |
Partitioning a graph into disjoint cliques and a triangle-free graph
Discrete Applied Mathematics | 2015-07-06 | Paper |
Maximum common induced subgraph parameterized by vertex cover
Information Processing Letters | 2014-04-14 | Paper |
Immersion containment and connectivity in color-critical graphs
| 2014-03-25 | Paper |
The Multi-parameterized Cluster Editing Problem
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Charge and reduce: A fixed-parameter algorithm for string-to-string correction
Discrete Optimization | 2012-10-16 | Paper |
An improved kernelization algorithm for \(r\)-set packing
Information Processing Letters | 2012-03-19 | Paper |
An exact algorithm for connected red-blue dominating set
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Graph coloring and the immersion order
Lecture Notes in Computer Science | 2011-03-18 | Paper |
A hybrid graph representation for recursive backtracking algorithms
Frontiers in Algorithmics | 2010-09-07 | Paper |
A kernelization algorithm for \(d\)-hitting set
Journal of Computer and System Sciences | 2010-08-18 | Paper |
An exact algorithm for connected red-blue dominating set
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Information Processing Letters | 2010-01-29 | Paper |
A Quadratic Kernel for 3-Set Packing
Lecture Notes in Computer Science | 2009-06-03 | Paper |
A bounded search tree algorithm for parameterized face cover
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Kernelization Algorithms for d-Hitting Set Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Kernels: Annotated, Proper and Induced
Parameterized and Exact Computation | 2008-06-03 | Paper |
Crown structures for vertex cover kernelization
Theory of Computing Systems | 2007-12-19 | Paper |
Pseudo-kernelization: A branch-then-Reduce approach for FPT problems
Theory of Computing Systems | 2007-12-19 | Paper |
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Scalable parallel algorithms for FPT problems
Algorithmica | 2006-09-12 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
