Anthony Bonato

Computational Theory and Mathematics · 2009–2013

A researcher in the Science corpus: 3 papers; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Anthony Bonato trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Bruno Courcelle
  2. Sang-il Oum
  3. Paul D. Seymour
  4. Béla Bollobás
  5. Stephan Olariu
  6. S. Seidman
  7. Alexandr V. Kostochka

Who trusts Anthony Bonato overall

  1. Daniel Král
  2. Joseph A. Gallian

Papers from Anthony Bonato's perspective

Ordered by how strongly the researchers Anthony Bonato trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Upper bounds to the clique width of graphs (Discrete Applied Mathematics)
  2. Directed Tree-Width (J. Comb. Theory B)
  3. The Game of Cops and Robbers on Graphs
  4. Approximating clique-width and branch-width (J. Comb. Theory B)
  5. An extremal problem for H -linked graphs
  6. Network structure and minimum degree
  7. Efficient graph representations (Fields Institute Monographs)
  8. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  9. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
  10. I and J

Their papers