Cluster analysis and mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Journal of Algorithms
On graph powers for leaf-labeled trees
Journal of Algorithms
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Theory of Computing Systems
Invitation to data reduction and problem kernelization
ACM SIGACT News
On Problems without Polynomial Kernels (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms (TALG)
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
Applying Modular Decomposition to Parameterized Cluster Editing Problems
Theory of Computing Systems
Structure and linear time recognition of 3-leaf powers
Information Processing Letters
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Exact algorithms for cluster editing: evaluation and experiments
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Extending the tractability border for closest leaf powers
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The cluster editing problem: implementations and experiments
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A more effective linear kernelization for Cluster Editing
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
| Hi-index | 0.05 |
A graph G=(V,E) is a 3-leaf power iff there exists a tree T the leaf set of which is V and such that uv@?E iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion are FPT when parameterized by the size of the edge set modification. However, polynomial kernels were known for none of these three problems. For each of them, we provide kernels with O(k^3) vertices that can be computed in linear time. We thereby answer an open problem first mentioned by Dom et al. (2004) [8].