Computing Phylogenetic Roots with Bounded Degrees and Errors
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
From hypertrees to arboreal quasi-ultrametrics
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform
Discrete Applied Mathematics
Sub-dominant theory in numerical taxonomy
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Noising methods for a clique partitioning problem
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Optimal clustering of multipartite graphs
Discrete Applied Mathematics
On the Approximation of Correlation Clustering and Consensus Clustering
Journal of Computer and System Sciences
Pattern identification in pareto-set approximations
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Clustering with Partial Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Going Weighted: Parameterized Algorithms for Cluster Editing
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
A more effective linear kernelization for cluster editing
Theoretical Computer Science
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Mathematics of Operations Research
Graph-Based Data Clustering with Overlaps
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Going weighted: Parameterized algorithms for cluster editing
Theoretical Computer Science
Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform
Discrete Applied Mathematics
From hypertrees to arboreal quasi-ultrametrics
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Noising methods for a clique partitioning problem
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Sub-dominant theory in numerical taxonomy
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
A modified noising algorithm for the graph partitioning problem
Integration, the VLSI Journal
Clustering with partial information
Theoretical Computer Science
Exploratory Consensus of Hierarchical Clusterings for Melanoma and Breast Cancer
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Exact algorithms for cluster editing: evaluation and experiments
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Improved algorithms for bicluster editing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Alternative parameterizations for cluster editing
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences
Consensus of partitions: a constructive approach
Advances in Data Analysis and Classification
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
On making directed graphs transitive
Journal of Computer and System Sciences
Bounded degree closest k-tree power is NP-complete
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Correlation clustering and consensus clustering
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters
Theoretical Computer Science
A golden ratio parameterized algorithm for cluster editing
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On the parameterized complexity of consensus clustering
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computer Science Review
Graph-based data clustering with overlaps
Discrete Optimization
The noising method: a new method for combinatorial optimization
Operations Research Letters
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
A golden ratio parameterized algorithm for Cluster Editing
Journal of Discrete Algorithms
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
Projective clustering ensembles
Data Mining and Knowledge Discovery
Ensemble clustering by means of clustering embedding in vector spaces
Pattern Recognition
| Hi-index | 0.00 |