10.9k citations
- University of LiverpoolGB1.9k papers
- The Ohio State UniversityUS1.9k papers
- Heidelberg UniversityDE1.9k papers
- Lawrence Berkeley National LaboratoryUS1.9k papers
- Centre National de la Recherche ScientifiqueFR1.9k papers
- University of BirminghamGB1.9k papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR1.8k papers
- National Institute for Subatomic PhysicsNL1.8k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.8k papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT1.8k papers
- Sapienza University of RomeIT1.8k papers
- Yale UniversityUS1.7k papers
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017★ 1 cited
Clustering with Local Restrictions
Daniel Lokshtanov, Dániel Marx
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let be a function on the subsets of vertices of a graph…
cs.DS2017
On the tractability of optimization problems on H-graphs
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
For a graph , a graph is an -graph if it is an intersection graph of connected subgraphs of some subdivision of . -graphs naturally generalize several important gra…
cs.DS2017
Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials
Gregory Gutin, Felix Reidl, Magnus Wahlström +1
In recent years, several powerful techniques have been developed to design {\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of…