Philip Bille
Theoretical Computer Science · 2005
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 16 researchers here, as inferred from the citation graph.
Whom Philip Bille trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Philip Bille overall
- Xinbo Gao
- Xuchen Yao
- Jian Zhang
- Jacob Andreas
- Benjamin Van Durme
- Bing Xiao
- Xu Wang
- Emilio Carrizosa
- Aurélien Bellet
- Dacheng Tao
Papers from Philip Bille's perspective
Ordered by how strongly the researchers Philip Bille trusts endorse each paper. Same corpus, a different order for every researcher.
- The NP-Completeness Column: An Ongoing Guide
- Introduction to Algorithms, 2nd edition.
- Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems
- Proof verification and hardness of approximation problems
- A and V
- A personal communication
- The Complexity of Computing the Permanent
- A Note on the Graph Isomorphism counting Problem
- HOW GOOD IS THE SIMPLEX ALGORITHM
- On the computational complexity of Ising spin glass models
Their papers
- A survey on tree edit distance and related problems (2005) — 864 citations