0166218X

Listing Graph Orientations

Our journal paper on “Efficient enumeration of graph orientations with sources” is out on Discrete Applied Mathematics (available online since 24 August 2017). This is the result of the joint work with Alessio, Roberto, and Romeo about listing acyclic or cyclic orientation. An orientation of an undirected graph is obtained by assigning a direction to[…]

poster

SPIRE2017

I have presented our paper on “Listing Maximal Independent Sets with Minimal Space and Bounded Delay” at SPIRE 2017. The conference has been great! The paper has been a joint work with Alessio Conte, Roberto Grossi, Takeaki Uno and Luca Versari. Below the abstract. An independent set is a set of nodes in a graph[…]

cm1sevfweaav-xz

ICALP2016

Our paper “Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques” has been presented at ICALP2016. Thanks to my coauthors: Alessio Conte, Roberto Grossi, and Luca Versari. Here below the abstract: Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This[…]

cropped-Ensenada-at-night11

LATIN2016

Our paper “Listing Acyclic Orientations of Graphs with Single and Multiple Sources” has been accepted to be published at Latin American Theoretical Informatics Symposium, LATIN 2016 to be held in Ensenada, Mexico (April 11-15, 2016). The abstract follows. We study enumeration problems for the acyclic orientations of an undirected graph with n nodes and m[…]

cropped-IMG_2409_2-Version-3-imp1

IWOCA2015

Our paper about “Enumerating Cyclic Orientations of a Graph” will be presented at IWOCA2015 in Verona! Thanks to all my coauthors: Alessio Conte, Roberto Grossi, Romeo Rizzi. The abstract follows. Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge[…]

Long-list

Enumeration Catalogue

Some months ago, a very nice web page came out. I am talking about the catalogue of enumeration algorithms by Kunihiro Wasa. There you can find an “Enumeration of Enumeration Algorithms and Its Complexity”. For each class of the followings: Geometry Graph Hypergraph Matroid Order Other Permutation SAT Set String several enumeration problems are enumerated. For[…]