Search Results - "Rizzi, Romeo"

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs by Punzi, Giulia, Conte, Alessio, Grossi, Roberto, Rizzi, Romeo

“…Given an undirected multigraph G = ( V , E ) with no self-loops, and one of its nodes s ∈ V , we consider the #P-complete problem of counting the number E T s…”
Get full text

A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem by Benati, Stefano, Rizzi, Romeo

“…In this paper, we consider an extension of the Markovitz model, in which the variance has been replaced with the Value-at-Risk. So a new portfolio optimization…”
Get full text

An interdisciplinary experimental evaluation on the disjunctive temporal problem by Zavatteri, Matteo, Raffaele, Alice, Ostuni, Dario, Rizzi, Romeo

“…We report on an extensive experimental evaluation on the Disjunctive Temporal Problem, where we adapted state-of-the-art Satisfiability Modulo Theories (SMT)…”
Get full text

Safety in s-t Paths, Trails and Walks by Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I.

“…Given a directed graph G and a pair of nodes s and t , an s - t bridge of G is an edge whose removal breaks all s - t paths of G (and thus appears in all s - t…”
Get full text

Approximating the maximum 3-edge-colorable subgraph problem by Rizzi, Romeo

“…We offer the following structural result: every triangle-free graph G of maximum degree 3 has 3 matchings which collectively cover at least ( 1 − 2 3 γ o ( G )…”
Get full text

The firefighter problem for graphs of maximum degree three by Finbow, Stephen, King, Andrew, MacGillivray, Gary, Rizzi, Romeo

“…We show that the firefighter problem is NP-complete for trees of maximum degree three, but in P for graphs of maximum degree three if the fire breaks out at a…”
Get full text

Hierarchical clustering using the arithmetic-harmonic cut: complexity and experiments by Rizzi, Romeo, Mahata, Pritha, Mathieson, Luke, Moscato, Pablo

“…Clustering, particularly hierarchical clustering, is an important method for understanding and analysing data across a wide variety of knowledge domains with…”
Get full text

Permutation Pattern matching in (213, 231)-avoiding permutations by Neou, Both, Rizzi, Romeo, Vialette, Stéphane

“…Given permutations σ of size k and π of size n with k < n, the permutation pattern matching problem is to decide whether σ occurs in π as an order-isomorphic…”
Get full text

Some simple distributed algorithms for sparse networks by Panconesi, Alessandro, Rizzi, Romeo

“…We give simple, deterministic, distributed algorithms for computing maximal matchings, maximal independent sets and colourings. We show that edge colourings…”
Get full text

New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems by Raffaele, Alice, Rizzi, Romeo

“…This work presents a new decomposition for the Monotone Boolean Duality problem, which consists of checking whether two monotone Boolean functions f (described…”
Get full text

Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games by Comin, Carlo, Rizzi, Romeo

“…In this work we offer an O ( | V | 2 | E | W ) pseudo-polynomial time deterministic algorithm for solving the Value Problem and Optimal Strategy Synthesis in…”
Get full text

Dynamic controllability of temporal networks with instantaneous reaction by Zavatteri, Matteo, Rizzi, Romeo, Villa, Tiziano

“…A Conditional Simple Temporal Network with Uncertainty and Decisions (CSTNUD) is a formalism to model, validate, and execute temporal plans subject to…”
Get full text

Listing the bonds of a graph in O˜(n)–delay by Raffaele, Alice, Rizzi, Romeo, Uno, Takeaki

“…Given a connected graph G=(V,E), with n≔|V| vertices and m≔|E| edges, a cut can be represented as a bipartition {S,S¯} of the vertices or as the set of those…”
Get full text

On recognising words that are squares for the shuffle product by Rizzi, Romeo, Vialette, Stéphane

“…The shuffle of two words u and v of A⁎ is the language u⧢v consisting of all words u1v1u2v2…ukvk, where k≥0 and the ui and vi are words of A⁎ such that…”
Get full text

Solving the train marshalling problem by inclusion–exclusion by Rinaldi, Franca, Rizzi, Romeo

“…In the Train Marshalling Problem (TMP) the cars of a train having different destinations have to be reordered in such a way that all the cars with the same…”
Get full text

Revisiting Viewing Graph Solvability: an Effective Approach Based on Cycle Consistency by Arrigoni, Federica, Fusiello, Andrea, Rizzi, Romeo, Ricci, Elisa, Pajdla, Tomas

“…In the structure from motion, the viewing graph is a graph where the vertices correspond to cameras (or images) and the edges represent the fundamental…”
Get full text

Predictive mining of multi-temporal relations by Amico, Beatrice, Combi, Carlo, Rizzi, Romeo, Sala, Pietro

“…In this paper, we propose a methodology for deriving a new kind of approximate temporal functional dependencies, called Approximate Predictive Functional…”
Get full text

The approximability of the String Barcoding problem by Lancia, Giuseppe, Rizzi, Romeo

“…The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to…”
Get full text

Solving the probabilistic profitable tour problem on a line by Angelelli, Enrico, Mansini, Renata, Rizzi, Romeo

“…Among the most important variants of the traveling salesman problem ( TSP ) are those relaxing the constraint that every locus should necessarily get visited,…”
Get full text

Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way by Zavatteri, Matteo, Combi, Carlo, Rizzi, Romeo, Viganò, Luca

“…A Simple Temporal Network (STN) consists of time points modeling temporal events and constraints modeling the minimal and maximal temporal distance between…”
Get full text