10.9k citations
- University of OsloNO685 papers
- University of LiverpoolGB684 papers
- Heidelberg UniversityDE680 papers
- Centre National de la Recherche ScientifiqueFR664 papers
- European Organization for Nuclear ResearchCH658 papers
- National Institute for Subatomic PhysicsNL655 papers
- Lawrence Berkeley National LaboratoryUS654 papers
- The Ohio State UniversityUS654 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR644 papers
- University of BirminghamGB635 papers
- The University of TokyoJP634 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT633 papers
Showing 2012 · cs.DSShow all
3 papers · 2 filters
cs.DS2012★ 6 cited
Finding a maximum induced degenerate subgraph faster than 2^n
Marcin Pilipczuk, Michał Pilipczuk
In this paper we study the problem of finding a maximum induced d-degenerate subgraph in a given n-vertex graph from the point of view of exact algorithms. We show that for any fix…
cs.DS2012★ 1 cited
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
Qin Xin
In this paper, we investigate the explicit deterministic treasure hunt problem in a -vertex network. This problem was firstly introduced by Ta-Shma and Zwick in \cite{TZ07} [SOD…
cs.DS2012
Obtaining Planarity by Contracting Few Edges
Petr A. Golovach, Pim van 't Hof, Daniel Paulusma
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is…