Maarten Löffler

Exact Complexity of NP-hard Problems · 2010

A researcher in the Science corpus: 1 paper; trusts 0 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Who trusts Maarten Löffler overall

1. Jia Wang
2. David Eppstein
3. Heng Yang

Papers from Maarten Löffler's perspective

Ordered by how strongly the researchers Maarten Löffler trusts endorse each paper. Same corpus, a different order for every researcher.

1. Arboricity and Subgraph Listing Algorithms
2. Emergence of Scaling in Random Networks
3. New Algorithms for Fast Discovery of Association Rules
4. An O(m) Algorithm for Cores Decomposition of Networks
5. The worst-case time complexity for generating all maximal cliques and computational experiments (Theoretical Computer Science)
6. New Algorithms for Enumerating All Maximal Cliques (Scandinavian Workshop on Algorithm Theory)
7. Social Network Analysis: Methods and Applications
8. Network structure and minimum degree
9. Pajek - Program for Large Network Analysis
10. Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry (Nature)

Their papers

• Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time (2010) — 404 citations