HOME
  • Academic Webpage
  • CV
  • News
  • Publications
  • Book
  • Python
  • [ Misc ]

COCOON2018

Posted on 23 February 2019 by Andrea

Our paper “Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search” has been presented by Roberto at COCOON 2018. Joint work with Alessio Conte, Roberto Grossi, and Luca Versari.

This entry was posted in Algorithms, Conference, CS, Enumeration, Graphs, Networks, Papers. Bookmark the permalink.

Post navigation

← WG2018
KDD2018 →

Recent Posts

  • Best Italian Young Researcher in “Theoretical Computer Science” 2022.
  • Moving to Florence
  • PhD Event at University of Pisa
  • MIT GraphChallenge
  • KDD2018

Archives

  • February 2023
  • February 2019
  • December 2017
  • September 2016
  • December 2015
  • September 2015
  • August 2015
  • June 2015
  • May 2015
  • April 2015

Categories

  • Algorithms
  • Bitcoin
  • Conference
  • CS
  • Data Mining
  • Enumeration
  • Events
  • Funny
  • Graphs
  • Misc
  • Music
  • Networks
  • Papers
  • Random
  • Senza categoria

Meta

  • Log in
  • Entries RSS
  • Comments RSS
  • WordPress.org
Address: write me to get it!
andreamarino dot it at gmail.com
Phone number: write me to get it!
Zerif Lite powered by WordPress