8 citations · 54 across the 39 of their papers we have counts for
6 papers · 2 filters
Pattern matching in -avoiding permutations
Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
Given permutations and with , the \emph{pattern matching} problem is to decide whether matches as an order-isomorphic subsequence. We give a line…
Enumerating Cyclic Orientations of a Graph
Alessio Conte, Roberto Grossi, Andrea Marino +1
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 so as to obta…
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication
Carlo Comin, Romeo Rizzi
The first output-sensitive algorithm for the Maximal Clique Listing problem was given by Tsukiyama et.al. in 1977. As any algorithm falling within the Reverse Search paradigm, it p…
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking
Carlo Comin, Romeo Rizzi
Conditional Simple Temporal Network (CSTN) is a constraint-based graph-formalism for conditional temporal planning. It offers a more flexible formalism than the equivalent CSTP mod…
An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
Carlo Comin, Romeo Rizzi
In this work we offer an pseudo-polynomial time deterministic algorithm for solving the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. This i…
Hyper Temporal Networks
Carlo Comin, Roberto Posenato, Romeo Rizzi
Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. In this pap…