| Publication | Date of Publication | Type |
|---|
| New approximation algorithms for RNA secondary structures prediction problems by local search | 2024-02-09 | Paper |
| Possible and necessary winner problems in iterative elections with multiple rules | 2023-08-03 | Paper |
| Colorful graph coloring | 2023-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088892 | 2022-07-18 | Paper |
| Constrained stable marriage with free edges or few blocking pairs | 2022-06-29 | Paper |
| Sorting a permutation by best short swaps | 2021-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140777 | 2020-12-16 | Paper |
| Data Reduction, Exact, and Heuristic Algorithms for Clique Cover | 2019-09-11 | Paper |
| Parameterized complexity of voter control in multi-peaked elections | 2019-09-05 | Paper |
| Kernelization of Two Path Searching Problems on Split Graphs | 2019-04-26 | Paper |
| On the complexity of bribery with distance restrictions | 2019-01-25 | Paper |
| How Hard Is Bribery with Distance Restrictions | 2018-07-12 | Paper |
| On the kernelization of split graph problems | 2018-06-05 | Paper |
| A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction | 2018-02-26 | Paper |
| Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction | 2017-10-23 | Paper |
| The control complexity of \(r\)-Approval: from the single-peaked case to the general case | 2017-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5283001 | 2017-07-18 | Paper |
| Possible winner problems on partial tournaments: a parameterized study | 2017-06-22 | Paper |
| Exact algorithms for weighted and unweighted Borda manipulation problems | 2016-02-26 | Paper |
| A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems | 2015-09-24 | Paper |
| Pattern matching for arc-annotated sequences | 2015-09-02 | Paper |
| Parameterized complexity of control and bribery for \(d\)-approval elections | 2015-07-24 | Paper |
| Covering tree with stars | 2015-07-10 | Paper |
| An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs | 2015-07-10 | Paper |
| A quadratic vertex kernel for feedback arc set in bipartite tournaments | 2015-03-02 | Paper |
| Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs | 2015-01-15 | Paper |
| Algorithms for parameterized maximum agreement forest problem on multiple trees | 2014-10-06 | Paper |
| Complexity of Dense Bicluster Editing Problems | 2014-09-26 | Paper |
| Parameterized Complexity of Edge Interdiction Problems | 2014-09-26 | Paper |
| On Star-Cover and Path-Cover of a Tree | 2014-09-02 | Paper |
| Compactness-Preserving Mapping on Trees | 2014-06-30 | Paper |
| On the parameterized complexity of consensus clustering | 2014-06-23 | Paper |
| Data reduction and exact algorithms for clique cover | 2014-04-01 | Paper |
| Local search for string problems: brute-force is essentially optimal | 2014-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5398399 | 2014-02-27 | Paper |
| Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs | 2014-02-18 | Paper |
| Parameterized complexity of max-lifetime target coverage in wireless sensor networks | 2014-01-13 | Paper |
| Improved linear problem kernel for planar connected dominating set | 2014-01-13 | Paper |
| Parameterized complexity of Min-power multicast problems in wireless ad hoc networks | 2013-12-19 | Paper |
| Possible Winner Problems on Partial Tournaments: A Parameterized Study | 2013-12-17 | Paper |
| Parameterized Complexity of Control and Bribery for d-Approval Elections | 2013-12-10 | Paper |
| The parameterized complexity of local search for TSP, more refined | 2013-11-11 | Paper |
| Neighborhood-Preserving Mapping between Trees | 2013-08-12 | Paper |
| Planar graph vertex partition for linear problem kernels | 2013-07-24 | Paper |
| Local Search for String Problems: Brute Force Is Essentially Optimal | 2013-06-14 | Paper |
| Covering Tree with Stars | 2013-06-11 | Paper |
| An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs | 2013-06-11 | Paper |
| Kernelization and Parameterized Complexity of Star Editing and Union Editing | 2013-03-21 | Paper |
| Complexity and parameterized algorithms for cograph editing | 2012-11-27 | Paper |
| Graph-based data clustering with overlaps | 2012-10-16 | Paper |
| A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments | 2012-09-25 | Paper |
| Safe Approximation and Its Relation to Kernelization | 2012-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389995 | 2012-04-24 | Paper |
| A generalization of Nemhauser and Trotter's local optimization theorem | 2012-01-11 | Paper |
| The Parameterized Complexity of Local Search for TSP, More Refined | 2011-12-16 | Paper |
| On the Parameterized Complexity of Consensus Clustering | 2011-12-16 | Paper |
| Editing graphs into disjoint unions of dense clusters | 2011-12-14 | Paper |
| Parameterized Complexity of Arc-Weighted Directed Steiner Problems | 2011-10-27 | Paper |
| Cograph Editing: Complexity and Parameterized Algorithms | 2011-08-17 | Paper |
| Linear Problem Kernels for Planar Graph Problems with Small Distance Property | 2011-08-17 | Paper |
| A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing | 2011-07-18 | Paper |
| An Improved Kernel for Planar Connected Dominating Set | 2011-07-01 | Paper |
| The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View | 2011-06-03 | Paper |
| Average parameterization and partial kernelization for computing medians | 2011-04-28 | Paper |
| Fixed-parameter tractability results for full-degree spanning tree and its dual | 2010-11-24 | Paper |
| Kernelization and complexity results for connectivity augmentation problems | 2010-11-24 | Paper |
| The parameterized complexity of some minimum label problems | 2010-10-07 | Paper |
| Extended Islands of Tractability for Parsimony Haplotyping | 2010-07-26 | Paper |
| Approximation and fixed-parameter algorithms for consecutive ones submatrix problems | 2010-05-25 | Paper |
| Average Parameterization and Partial Kernelization for Computing Medians | 2010-04-27 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Two fixed-parameter algorithms for vertex covering by paths on trees | 2010-04-19 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Fixed-parameter tractability results for feedback set problems in tournaments | 2010-02-26 | Paper |
| Parameterized computational complexity of Dodgson and Young elections | 2010-02-26 | Paper |
| Feedback arc set in bipartite tournaments is NP-complete | 2010-01-29 | Paper |
| The Parameterized Complexity of Some Minimum Label Problems | 2010-01-21 | Paper |
| What Makes Equitable Connected Partition Easy | 2010-01-14 | Paper |
| A fixed-parameter tractability result for multicommodity demand flow in trees | 2009-12-18 | Paper |
| Parameterized Complexity of Arc-Weighted Directed Steiner Problems | 2009-12-17 | Paper |
| Editing Graphs into Disjoint Unions of Dense Clusters | 2009-12-17 | Paper |
| Fixed-parameter algorithms for Kemeny rankings | 2009-11-04 | Paper |
| A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems | 2009-10-16 | Paper |
| Graph-Based Data Clustering with Overlaps | 2009-07-23 | Paper |
| Iterative Compression for Exactly Solving NP-Hard Minimization Problems | 2009-07-09 | Paper |
| A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing | 2009-07-02 | Paper |
| SOFSEM 2004: Theory and Practice of Computer Science | 2009-06-04 | Paper |
| Fixed-Parameter Algorithms for Graph-Modeled Date Clustering | 2009-06-03 | Paper |
| Algorithms for compact letter displays: comparison and evaluation | 2009-06-02 | Paper |
| Red-blue covering problems and the consecutive ones property | 2009-05-13 | Paper |
| A more effective linear kernelization for cluster editing | 2009-03-17 | Paper |
| Closest 4-leaf power is fixed-parameter tractable | 2009-03-04 | Paper |
| A More Effective Linear Kernelization for Cluster Editing | 2009-03-03 | Paper |
| Kernelization and Complexity Results for Connectivity Augmentation Problems | 2009-02-17 | Paper |
| Improved algorithms and complexity results for power domination in graphs | 2008-12-02 | Paper |
| Parameterized Computational Complexity of Dodgson and Young Elections | 2008-07-15 | Paper |
| Fixed-Parameter Algorithms for Kemeny Scores | 2008-07-10 | Paper |
| Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual | 2008-06-03 | Paper |
| Improved Algorithms for Bicluster Editing | 2008-05-27 | Paper |
| Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs | 2008-05-27 | Paper |
| Probe Matrix Problems: Totally Balanced Matrices | 2008-01-04 | Paper |
| Parameterized complexity of Vertex Cover variants | 2007-12-19 | Paper |
| Linear Problem Kernels for NP-Hard Problems on Planar Graphs | 2007-11-28 | Paper |
| Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs | 2007-11-23 | Paper |
| Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems | 2007-11-13 | Paper |
| Minimum Membership Set Covering and the Consecutive Ones Property | 2007-09-07 | Paper |
| Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments | 2007-05-02 | Paper |
| Exact algorithms and applications for tree-like Weighted Set Cover | 2007-02-14 | Paper |
| THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS | 2007-02-08 | Paper |
| Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization | 2006-12-07 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Parameterized intractability of distinguishing substring selection | 2006-10-25 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Error compensation in leaf power problems | 2006-08-16 | Paper |
| Graph-modeled data clustering: Exact algorithms for clique generation | 2006-02-08 | Paper |
| Fixed-parameter tractability and data reduction for multicut in trees | 2006-01-23 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Computing the similarity of two sequences with nested arc annotations | 2004-10-27 | Paper |
| Automated generation of search tree algorithms for hard graphs modification problems | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737693 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437501 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415254 | 2003-07-28 | Paper |
