A polynomial time recognition algorithm for probe interval graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
A combinatorial study of partial order polytopes
European Journal of Combinatorics
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
Discrete Applied Mathematics
Independent domination in finitely defined classes of graphs
Theoretical Computer Science
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics
On variations of P4-sparse graphs
Discrete Applied Mathematics
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
P5-free augmenting graphs and the maximum stable set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Information Processing Letters
EMAGEN: an efficient approach to multiple whole genome alignment
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Note on the homogeneous set sandwich problem
Information Processing Letters
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
The clique operator on graphs with few P4's
Discrete Applied Mathematics
Improved bottleneck domination algorithms
Discrete Applied Mathematics
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
An optimal parallel solution for the path cover problem on P4-sparse graphs
Journal of Parallel and Distributed Computing
On transitive orientations with restricted covering graphs
Information Processing Letters
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
Discrete Applied Mathematics
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science
Partitioned probe comparability graphs
Theoretical Computer Science
Efficient lineage tracking for scientific workflows
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms (TALG)
Note: Matching cutsets in graphs of diameter 2
Theoretical Computer Science
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Discrete Applied Mathematics
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Discrete Applied Mathematics
On Distance-3 Matchings and Induced Matchings
Graph Theory, Computational Intelligence and Thought
Graph Theory, Computational Intelligence and Thought
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
The clique operator on graphs with few P4's
Discrete Applied Mathematics
Note on the Homogeneous Set Sandwich Problem
Information Processing Letters
An implicit representation of chordal comparability graphs in linear time
Discrete Applied Mathematics
NLC-2 graph recognition and isomorphism
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Theoretical Computer Science
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
Discrete Applied Mathematics
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
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
Transitive orientations in bull-reducible Berge graphs
Discrete Applied Mathematics
Counting spanning trees in graphs using modular decomposition
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Computational Geometry: Theory and Applications
Vertex splitting and the recognition of trapezoid graphs
Discrete Applied Mathematics
Parameterized algorithms for the independent set problem in some hereditary graph classes
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Cograph editing: complexity and parameterized algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
The possible cardinalities of global secure sets in cographs
Theoretical Computer Science
Linear Extension Diameter of Downset Lattices of Two-Dimensional Posets
SIAM Journal on Discrete Mathematics
Vertex coloring of comparability+ke and -ke
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
An implicit representation of chordal comparabilty graphs in linear-time
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Partitioned probe comparability graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A fully dynamic algorithm for the recognition of P4-sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Homogeneity vs. adjacency: generalising some graph decomposition algorithms
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A simpler linear-time recognition of circular-arc graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Drawing graphs using modular decomposition
GD'05 Proceedings of the 13th international conference on Graph Drawing
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Revisiting t. uno and m. yagiura's algorithm
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On clique separators, nearly chordal graphs, and the maximum weight stable set problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Optimal linear arrangement of interval graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Clique-width for four-vertex forbidden subgraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
New applications of clique separator decomposition for the maximum weight stable set problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Bimodular decomposition of bipartite graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
Dominating induced matchings for p
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Journal of Discrete Algorithms
A fully dynamic algorithm for the recognition of P4-sparse graphs
Theoretical Computer Science
The recognition of triangle graphs
Theoretical Computer Science
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Minimal separators in extended P4-laden graphs
Discrete Applied Mathematics
Complexity and parameterized algorithms for Cograph Editing
Theoretical Computer Science
Extending partial representations of function graphs and permutation graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics
An O(n)-time algorithm for the paired domination problem on permutation graphs
European Journal of Combinatorics
On the recognition of k-equistable graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On minimal forbidden subgraph characterizations of balanced graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |