| Publication | Date of Publication | Type |
|---|
| Generalizing Frobenius Inversion to Quaternion Matrices | 2023-05-03 | Paper |
On making a distinguished vertex of minimum degree by vertex deletion
Algorithmica | 2017-05-17 | Paper |
A cubic-vertex kernel for flip consensus tree
Algorithmica | 2014-03-25 | Paper |
Two-layer planarization parameterized by feedback edge set
Theoretical Computer Science | 2014-01-10 | Paper |
On the computation of fully proportional representation
The Journal of Artificial Intelligence Research (JAIR) | 2013-08-13 | Paper |
Cluster editing with locally bounded modifications
Discrete Applied Mathematics | 2012-10-26 | Paper |
| A cubic-vertex kernel for flip consensus tree | 2012-10-19 | Paper |
Graph-based data clustering with overlaps
Discrete Optimization | 2012-10-16 | Paper |
Partitioning into colorful components by minimum edge deletions
Combinatorial Pattern Matching | 2012-08-14 | Paper |
On making directed graphs transitive
Journal of Computer and System Sciences | 2012-05-11 | Paper |
On bounded-degree vertex deletion parameterized by treewidth
Discrete Applied Mathematics | 2012-03-19 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithmica | 2011-12-14 | Paper |
A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Alternative parameterizations for cluster editing
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
On tractable cases of target set selection
Algorithms and Computation | 2010-12-09 | Paper |
Kernelization and complexity results for connectivity augmentation problems
Networks | 2010-11-24 | Paper |
Extended islands of tractability for parsimony haplotyping
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Two-layer planarization parameterized by feedback edge set
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Two fixed-parameter algorithms for vertex covering by paths on trees
Information Processing Letters | 2010-04-19 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithms and Computation | 2009-12-17 | Paper |
Parameterized complexity of candidate control in elections and related digraph problems
Theoretical Computer Science | 2009-11-25 | Paper |
On Making Directed Graphs Transitive
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Graph-Based Data Clustering with Overlaps
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
Combinatorial Pattern Matching | 2009-07-07 | Paper |
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Kernelization and Complexity Results for Connectivity Augmentation Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Tree decompositions of graphs: saving memory in dynamic programming
Discrete Optimization | 2008-01-11 | Paper |
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
European Journal of Operational Research | 2007-11-23 | Paper |
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
