853 citations
- Sorbonne UniversitéFR398 papers
- Centre National de la Recherche ScientifiqueFR380 papers
- Université Paris CitéFR136 papers
- Université Pierre-et-Marie-CurieFR97 papers
- University of EdinburghGB89 papers
- Institut national de recherche en sciences et technologies du numériqueFR85 papers
- Université Paris-SaclayFR67 papers
- University of OxfordGB54 papers
- École PolytechniqueFR50 papers
- Sorbonne Paris CitéFR48 papers
- Massachusetts Institute of TechnologyUS45 papers
- Universidade Federal do Rio de JaneiroBR45 papers
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017★ 10 cited
Hierarchical Clustering: Objective Functions and Algorithms
Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn +1
Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering…
cs.DS2017
Hitting minors on bounded treewidth graphs. I. General upper bounds
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a finite collection of graphs , the -M-DELETION problem consists in, given a graph and an integer , deciding whether there exists …
cs.DS2017
Optimal strategies for weighted ray search
Spyros Angelopoulos, Konstantinos Panagiotou
We introduce and study the general setting of weighted search in which a number of targets, each with a certain weight, are hidden in a star-like environment that consists of i…