| Publication | Date of Publication | Type |
|---|
Multi-winner approval voting with grouped voters
| 2024-09-16 | Paper |
Parameterized approximation algorithms for TSP
| 2024-09-11 | Paper |
New approximation algorithms for RNA secondary structures prediction problems by local search
Theoretical Computer Science | 2024-02-09 | Paper |
Colorful graph coloring
Frontiers of Algorithmic Wisdom | 2023-08-03 | Paper |
Possible and necessary winner problems in iterative elections with multiple rules
Frontiers of Algorithmic Wisdom | 2023-08-03 | Paper |
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
| 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
Algorithmica | 2021-06-30 | Paper |
scientific article; zbMATH DE number 7286740 (Why is no real title available?)
| 2020-12-16 | Paper |
Data reduction, exact, and heuristic algorithms for clique cover
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Parameterized complexity of voter control in multi-peaked elections
Theory of Computing Systems | 2019-09-05 | Paper |
Kernelization of two path searching problems on split graphs
Frontiers in Algorithmics | 2019-04-26 | Paper |
On the complexity of bribery with distance restrictions
Theoretical Computer Science | 2019-01-25 | Paper |
How hard is bribery with distance restrictions?
| 2018-07-12 | Paper |
On the kernelization of split graph problems
Theoretical Computer Science | 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
Journal of Computer and System Sciences | 2017-09-07 | Paper |
scientific article; zbMATH DE number 6747925 (Why is no real title available?)
| 2017-07-18 | Paper |
Possible winner problems on partial tournaments: a parameterized study
Journal of Combinatorial Optimization | 2017-06-22 | Paper |
Exact algorithms for weighted and unweighted Borda manipulation problems
Theoretical Computer Science | 2016-02-26 | Paper |
A complexity dichotomy for finding disjoint solutions of vertex deletion problems
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Pattern matching for arc-annotated sequences
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Parameterized complexity of control and bribery for \(d\)-approval elections
Theoretical Computer Science | 2015-07-24 | Paper |
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Covering tree with stars
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
A quadratic vertex kernel for feedback arc set in bipartite tournaments
Algorithmica | 2015-03-02 | Paper |
Complexity of disjoint \({\Pi}\)-vertex deletion for disconnected forbidden subgraphs
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Algorithms for parameterized maximum agreement forest problem on multiple trees
Theoretical Computer Science | 2014-10-06 | Paper |
Parameterized Complexity of Edge Interdiction Problems
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Complexity of dense bicluster editing problems
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On star-cover and path-cover of a tree
Frontiers in Algorithmics | 2014-09-02 | Paper |
Compactness-preserving mapping on trees
Combinatorial Pattern Matching | 2014-06-30 | Paper |
On the parameterized complexity of consensus clustering
Theoretical Computer Science | 2014-06-23 | Paper |
Data reduction and exact algorithms for clique cover
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Local search for string problems: brute-force is essentially optimal
Theoretical Computer Science | 2014-03-13 | Paper |
scientific article; zbMATH DE number 6262292 (Why is no real title available?)
| 2014-02-27 | Paper |
Complexity of disjoint \(\Pi \)-vertex deletion for disconnected forbidden subgraphs
Algorithms and Computation | 2014-02-18 | Paper |
Improved linear problem kernel for planar connected dominating set
Theoretical Computer Science | 2014-01-13 | Paper |
Parameterized complexity of max-lifetime target coverage in wireless sensor networks
Theoretical Computer Science | 2014-01-13 | Paper |
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
Theoretical Computer Science | 2013-12-19 | Paper |
Possible winner problems on partial tournaments: a parameterized study
Algorithmic Decision Theory | 2013-12-17 | Paper |
Parameterized complexity of control and bribery for \(d\)-approval elections
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithmica | 2013-11-11 | Paper |
Neighborhood-preserving mapping between trees
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Planar graph vertex partition for linear problem kernels
Journal of Computer and System Sciences | 2013-07-24 | Paper |
Local search for string problems: brute force is essentially optimal
Combinatorial Pattern Matching | 2013-06-14 | Paper |
An effective branching strategy for some parameterized edge modification problems with multiple forbidden induced subgraphs
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Covering tree with stars
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Kernelization and parameterized complexity of star editing and union editing
Algorithms and Computation | 2013-03-21 | Paper |
Complexity and parameterized algorithms for cograph editing
Theoretical Computer Science | 2012-11-27 | Paper |
Graph-based data clustering with overlaps
Discrete Optimization | 2012-10-16 | Paper |
A quadratic vertex kernel for feedback arc set in bipartite tournaments
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Safe approximation and its relation to kernelization
Parameterized and Exact Computation | 2012-06-15 | Paper |
A generalization of Nemhauser and Trotter's local optimization theorem
| 2012-04-24 | Paper |
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences | 2012-01-11 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithms and Computation | 2011-12-16 | Paper |
On the parameterized complexity of consensus clustering
Algorithms and Computation | 2011-12-16 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithmica | 2011-12-14 | Paper |
Parameterized complexity of arc-weighted directed Steiner problems
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Linear problem kernels for planar graph problems with small distance property
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Cograph editing: complexity and parameterized algorithms
Lecture Notes in Computer Science | 2011-08-17 | Paper |
A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
An improved kernel for planar connected dominating set
Lecture Notes in Computer Science | 2011-07-01 | Paper |
The min-power multicast problems in wireless ad hoc networks: a parameterized view
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences | 2011-04-28 | Paper |
Fixed-parameter tractability results for full-degree spanning tree and its dual
Networks | 2010-11-24 | Paper |
Kernelization and complexity results for connectivity augmentation problems
Networks | 2010-11-24 | Paper |
The parameterized complexity of some minimum label problems
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Extended islands of tractability for parsimony haplotyping
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences | 2010-05-25 | Paper |
Average parameterization and partial kernelization for computing medians
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Two fixed-parameter algorithms for vertex covering by paths on trees
Information Processing Letters | 2010-04-19 | Paper |
Automated generation of search tree algorithms for graph modification problems
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Parameterized computational complexity of Dodgson and Young elections
Information and Computation | 2010-02-26 | Paper |
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters | 2010-01-29 | Paper |
The parameterized complexity of some minimum label problems
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
What makes equitable connected partition easy
Parameterized and Exact Computation | 2010-01-14 | Paper |
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters | 2009-12-18 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithms and Computation | 2009-12-17 | Paper |
Parameterized complexity of arc-weighted directed Steiner problems
Algorithms and Computation | 2009-12-17 | Paper |
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science | 2009-11-04 | Paper |
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Graph-Based Data Clustering with Overlaps
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
SOFSEM 2004: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2009-06-04 | Paper |
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Algorithms for compact letter displays: comparison and evaluation
Computational Statistics and Data Analysis | 2009-06-02 | Paper |
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms | 2009-05-13 | Paper |
A more effective linear kernelization for cluster editing
Theoretical Computer Science | 2009-03-17 | Paper |
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics | 2009-03-04 | Paper |
A More Effective Linear Kernelization for Cluster Editing
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Kernelization and Complexity Results for Connectivity Augmentation Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Improved algorithms and complexity results for power domination in graphs
Algorithmica | 2008-12-02 | Paper |
Parameterized Computational Complexity of Dodgson and Young Elections
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Fixed-Parameter Algorithms for Kemeny Scores
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
Parameterized and Exact Computation | 2008-06-03 | Paper |
Improved Algorithms for Bicluster Editing
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
Algorithms and Computation | 2008-05-27 | Paper |
Probe Matrix Problems: Totally Balanced Matrices
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Parameterized complexity of Vertex Cover variants
Theory of Computing Systems | 2007-12-19 | Paper |
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Automata, Languages and Programming | 2007-11-28 | Paper |
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
European Journal of Operational Research | 2007-11-23 | Paper |
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Minimum Membership Set Covering and the Consecutive Ones Property
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Exact algorithms and applications for tree-like Weighted Set Cover
Journal of Discrete Algorithms | 2007-02-14 | Paper |
THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences | 2006-12-07 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Parameterized intractability of distinguishing substring selection
Theory of Computing Systems | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Error compensation in leaf power problems
Algorithmica | 2006-08-16 | Paper |
Graph-modeled data clustering: Exact algorithms for clique generation
Theory of Computing Systems | 2006-02-08 | Paper |
Fixed-parameter tractability and data reduction for multicut in trees
Networks | 2006-01-23 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science | 2004-10-27 | Paper |
Automated generation of search tree algorithms for hard graphs modification problems
Algorithmica | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2087047 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2011849 (Why is no real title available?)
| 2003-12-02 | Paper |
scientific article; zbMATH DE number 1954383 (Why is no real title available?)
| 2003-07-28 | Paper |
