A polynomial approximation algorithm for the minimum fill-in problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science
Linear-time recognition of bipartite graphs plus two edges
Discrete Mathematics
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Minimum-Flip Supertrees: Complexity and Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized coloring problems on chordal graphs
Theoretical Computer Science - Parameterized and exact computation
On the interval completion of chordal graphs
Discrete Applied Mathematics
Interval completion with few edges
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Parameterized complexity of the induced subgraph problem in directed graphs
Information Processing Letters
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Clustering with Partial Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Parameterized Graph Editing with Chosen Vertex Degrees
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Dynamically maintaining split graphs
Discrete Applied Mathematics
Graph-Based Data Clustering with Overlaps
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Editing Graphs into Disjoint Unions of Dense Clusters
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
On the interval completion of chordal graphs
Discrete Applied Mathematics
Clustering with partial information
Theoretical Computer Science
Minimum fill-in and treewidth of split+ke and split+kv graphs
Discrete Applied Mathematics
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
Graph-modeled data clustering: fixed-parameter algorithms for clique generation
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Minimum fill-in and treewidth of split+ke and split+kv graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Problem kernels for NP-complete edge deletion problems: split and related graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An improved fixed-parameter algorithm for minimum-flip consensus trees
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Wheel-free deletion is W[2]-hard
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Generalized graph clustering: recognizing (p, q)-cluster graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
ACM Transactions on Computation Theory (TOCT)
Parameterized complexity of even/odd subgraph problems
Journal of Discrete Algorithms
Cograph editing: complexity and parameterized algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
ACM Transactions on Algorithms (TALG)
Chordal deletion is fixed-parameter tractable
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Minimal proper interval completions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast FPT-Algorithms for cleaning grids
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Kernelization through tidying: a case study based on s-plex cluster vertex deletion
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Applying modular decomposition to parameterized bicluster editing
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Minimal interval completion through graph exploration
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Parameterized complexity of even/odd subgraph problems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Graph-based data clustering with overlaps
Discrete Optimization
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
The parameterized complexity of k-edge induced subgraphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Faster parameterized algorithms for deletion to split graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Cluster vertex deletion: a parameterization between vertex cover and clique-width
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Complexity and parameterized algorithms for Cograph Editing
Theoretical Computer Science
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A polynomial kernel for proper interval vertex deletion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Polynomial time and parameterized approximation algorithms for boxicity
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Estimating population size via line graph reconstruction
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
Information Processing Letters
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science
Hi-index | 0.90 |