Romeo Rizzi

According to our database1, Romeo Rizzi authored at least 183 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases.
SN Comput. Sci., 2020

Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks.
J. Log. Algebraic Methods Program., 2020

Sorting with forbidden intermediates.
Discret. Appl. Math., 2020

On the parameterized complexity of the Minimum Path Cover problem in DAGs.
CoRR, 2020

Safety in s-t Paths, Trails and Walks.
CoRR, 2020

Computing all s-t bridges and articulation points simplified.
CoRR, 2020

From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph.
CoRR, 2020

On Bubble Generators in Directed Graphs.
Algorithmica, 2020

Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with Uncertainty.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019
Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution.
Theor. Comput. Sci., 2019

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

An Optimal <i>O</i>(<i>nm</i>) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph.
ACM Trans. Algorithms, 2019

Faster FPTASes for counting and random generation of Knapsack solutions.
Inf. Comput., 2019

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP.
Bioinform., 2019

Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions.
Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

When a Dollar Makes a BWT.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Complexity of Weak, Strong and Dynamic Controllability of CNCUs.
Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

Strong Controllability of Temporal Networks with Decisions.
Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

2018
Network Synthesis for Distributed Embedded Systems.
IEEE Trans. Computers, 2018

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem.
ACM Trans. Algorithms, 2018

Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm.
Inf. Comput., 2018

Efficient enumeration of graph orientations with sources.
Discret. Appl. Math., 2018

An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication.
Algorithmica, 2018

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

Listing Subgraphs by Cartesian Decomposition.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Pattern Matching for k-Track Permutations.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Time-Optimal Solutions for Uniform Data and Heuristics for Non-Uniform Data.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Solving the train marshalling problem by inclusion-exclusion.
Discret. Appl. Math., 2017

The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues.
CoRR, 2017

Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games.
Constraints An Int. J., 2017

Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games.
Algorithmica, 2017

The Minimum Conflict-Free Row Split Problem Revisited.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Dynamic Controllability Made Simple.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Incorporating Decision Nodes into Conditional Simple Temporal Networks.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

The Complexity of Simulation and Matrix Multiplication.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Optimal Omnitig Listing for Safe and Complete Contig Assembly.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph.
J. Graph Theory, 2016

Permutation Pattern matching in (213, 231)-avoiding permutations.
Discret. Math. Theor. Comput. Sci., 2016

Strong cliques and equistability of EPT graphs.
Discret. Appl. Math., 2016

Diploid Alignment is NP-hard.
CoRR, 2016

Alternating DFS and Strongly Connected Components (Linear time algorithms with applications to infinite pebble games).
CoRR, 2016

Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games.
CoRR, 2016

The Complexity of Simulation and (Exotic) Matrix Multiplications.
CoRR, 2016

Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete.
Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Pattern Matching for Separable Permutations.
Proceedings of the String Processing and Information Retrieval, 2016

New Bounds for Approximating Extremal Distances in Undirected Graphs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Minimal Multiset Grammars for Recurrent Dynamics.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Listing Acyclic Orientations of Graphs with Single and Multiple Sources.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Directing Road Networks by Listing Strong Orientations.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Decomposing Cubic Graphs into Connected Subgraphs of Size Three.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy.
Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016), 2016

Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
On the complexity of the vector connectivity problem.
Theor. Comput. Sci., 2015

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Some Results on More Flexible Versions of Graph Motif.
Theory Comput. Syst., 2015

The complexity of power indexes with graph restricted coalitions.
Math. Soc. Sci., 2015

Friendly bin packing instances without Integer Round-up Property.
Math. Program., 2015

Some algorithmic results for [2]-sumset covers.
Inf. Process. Lett., 2015

Pattern matching in $(213, 231)$-avoiding permutations.
CoRR, 2015

An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games.
CoRR, 2015

Hyper Temporal Networks.
CoRR, 2015

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

The Price of Evolution in Temporal Databases.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Enumerating Cyclic Orientations of a Graph.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Set graphs. II. Complexity of set graph recognition and similar problems.
Theor. Comput. Sci., 2014

Complexity insights of the Minimum Duplication problem.
Theor. Comput. Sci., 2014

Odd 2-factored snarks.
Eur. J. Comb., 2014

Dominating sequences in graphs.
Discret. Math., 2014

On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly.
BMC Bioinform., 2014

Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes.
Algorithmica, 2014

A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games.
Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014

Finding a Forest in a Tree - The Matching Problem for Wide Reactive Systems.
Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

Towards Unlocking the Full Potential of Multileaf Collimators.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Efficiently Listing Bounded Length st-Paths.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Ranking, unranking and random generation of extensional acyclic digraphs.
Inf. Process. Lett., 2013

Minimum Mosaic Inference of a Set of Recombinants.
Int. J. Found. Comput. Sci., 2013

Floating-point arithmetic for approximate counting and random generation problems.
CoRR, 2013

A novel min-cost flow method for estimating transcript expression with RNA-Seq.
BMC Bioinform., 2013

A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Optimal Design of Consistent Simple Temporal Networks.
Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.
Proceedings of the String Processing and Information Retrieval, 2013

Optimal Listing of Cycles and st-Paths in Undirected Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

On Recognizing Words That Are Squares for the Shuffle Product.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
A Faster Algorithm for Finding Minimum Tucker Submatrices.
Theory Comput. Syst., 2012

Optimal Listing of Cycles and st-Paths in Undirected Graphs
CoRR, 2012

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval.
Proceedings of the Theory and Applications of Models of Computation, 2012

Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
Approximation of RNA multiple structural alignment.
J. Discrete Algorithms, 2011

On the approximability of the minimum strictly fundamental cycle basis problem.
Discret. Appl. Math., 2011

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.
Proceedings of the Algorithms - ESA 2011, 2011

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row.
Proceedings of the Computer Science - Theory and Applications, 2011

On cycle bases with limited edge overlap.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Finding common structured patterns in linear graphs.
Theor. Comput. Sci., 2010

Complexity issues in color-preserving graph embeddings.
Theor. Comput. Sci., 2010

Pure Parsimony Xor Haplotyping.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Excessive factorizations of bipartite multigraphs.
Discret. Appl. Math., 2010

Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Lower bounds for strictly fundamental cycle bases in grid graphs.
Networks, 2009

The optimal statistical median of a convex set of arrays.
J. Glob. Optim., 2009

Finding occurrences of protein complexes in protein-protein interaction graphs.
J. Discrete Algorithms, 2009

Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs.
Discret. Math. Algorithms Appl., 2009

Approximating the maximum 3-edge-colorable subgraph problem.
Discret. Math., 2009

Optimal receiver scheduling algorithms for a multicast problem.
Discret. Appl. Math., 2009

Cycle bases in graphs characterization, algorithms, complexity, and applications.
Comput. Sci. Rev., 2009

Minimum Weakly Fundamental Cycle Bases Are Hard To Find.
Algorithmica, 2009

Breaking the O(m<sup>2</sup>n) Barrier for Minimum Cycle Bases.
Proceedings of the Algorithms, 2009

2008
On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks.
IEEE Trans. Mob. Comput., 2008

Haplotyping for Disease Association: A Combinatorial Approach.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Oriented star packings.
J. Comb. Theory, Ser. B, 2008

Flipping Letters to minimize the Support of a String.
Int. J. Found. Comput. Sci., 2008

The Minimum Substring Cover problem.
Inf. Comput., 2008

2007
Scheduling Data Broadcasts on Wireless Channels.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Comparing Genomes with Duplications: A Computational Complexity Point of View.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

New length bounds for cycle bases.
Inf. Process. Lett., 2007

A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem.
Eur. J. Oper. Res., 2007

The firefighter problem for graphs of maximum degree three.
Discret. Math., 2007

Least and most colored bases.
Discret. Appl. Math., 2007

Classes of cycle bases.
Discret. Appl. Math., 2007

Benchmarks for Strictly Fundamental Cycle Bases.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Pattern Matching in Protein-Protein Interaction Graphs.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Hypercube Computations on Partitioned Optical Passive Stars Networks.
IEEE Trans. Parallel Distributed Syst., 2006

Online Permutation Routing in Partitioned Optical Passive Star Networks.
IEEE Trans. Computers, 2006

A polynomial case of the parsimony haplotyping problem.
Oper. Res. Lett., 2006

Covering partially directed graphs with directed paths.
Discret. Math., 2006

Acyclically pushable bipartite permutation digraphs: An algorithm.
Discret. Math., 2006

The approximability of the String Barcoding problem.
Algorithms Mol. Biol., 2006

On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Genomes Containing Duplicates Are Hard to Compare.
Proceedings of the Computational Science, 2006

2005
What Makes the Arc-Preserving Subsequence Problem Hard?
Trans. Comp. Sys. Biology, 2005

Polynomial and APX-hard cases of the individual haplotyping problem.
Theor. Comput. Sci., 2005

Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel.
IEEE Trans. Computers, 2005

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.
J. Comput. Biol., 2005

A greedy approach to compute a minimum cycle basis of a directed graph.
Inf. Process. Lett., 2005

Evaluation of BIC-based algorithms for audio segmentation.
Comput. Speech Lang., 2005

The String Barcoding Problem is NP-Hard.
Proceedings of the Comparative Genomics, 2005

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Conserved Interval Distance Computation Between Non-trivial Genomes.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Packing cuts in undirected graphs.
Networks, 2004

On <i>d</i>-threshold graphs and <i>d</i>-dimensional bin packing.
Networks, 2004

Channel assignment for interference avoidance in honeycomb wireless networks.
J. Parallel Distributed Comput., 2004

Allocating servers in infostations for bounded simultaneous requests.
J. Parallel Distributed Comput., 2004

Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.
INFORMS J. Comput., 2004

Combinatorial optimization - Polyhedra and efficiency: A book review.
4OR, 2004

Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Routing permutations in Partitioned Optical Passive Stars Networks.
J. Parallel Distributed Comput., 2003

Packing paths in digraphs.
J. Graph Theory, 2003

Packing cycles in undirected graphs.
J. Algorithms, 2003

On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic.
Inf. Process. Lett., 2003

On the complexity of digraph packings.
Inf. Process. Lett., 2003

A simple minimum T-cut algorithm.
Discret. Appl. Math., 2003

Allocating Servers in Infostations for On-Demand Communications.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Channel Assignment on Strongly-Simplicial Graphs.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A DP algorithm for speaker change detection.
Proceedings of the 8th European Conference on Speech Communication and Technology, EUROSPEECH 2003, 2003

Channel Assignment in Honeycomb Networks.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks.
Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

2002
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs.
SIAM J. Discret. Math., 2002

Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals.
J. Comb. Optim., 2002

Packing triangles in bounded degree graphs.
Inf. Process. Lett., 2002

Minimum <i>T</i>-cuts and optimal <i>T</i>-pairings.
Discret. Math., 2002

Cycle cover property and CPP=SCC property are not equivalent.
Discret. Math., 2002

Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Routing Permutations in Partitioned Optical Passive Star Networks.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001
Complexity of Context-Free Grammars with Exceptions and the Inadequacy of Grammars as Models for XML and SGML.
Markup Lang., 2001

Excluding a Simple Good Pair Approach to Directed Cuts.
Graphs Comb., 2001

On 4-connected graphs without even cycle decompositions.
Discret. Math., 2001

On the recognition of <i>P</i><sub>4</sub>-indifferent graphs.
Discret. Math., 2001

Shortest paths in conservative graphs.
Discret. Math., 2001

Some simple distributed algorithms for sparse networks.
Distributed Comput., 2001

Packing Cycles and Cuts in Undirected Graphs.
Proceedings of the Algorithms, 2001

2000
A short proof of König's matching theorem.
J. Graph Theory, 2000

Edge-Coloring Bipartite Graphs.
J. Algorithms, 2000

A Note on Range-Restricted Circuit Covers.
Graphs Comb., 2000

NOTE - On Minimizing Symmetric Set Functions.
Comb., 2000

1999
Indecomposable <i>r</i>-graphs and some other counterexamples.
J. Graph Theory, 1999

1998
König's edge coloring theorem without augmenting paths.
J. Graph Theory, 1998

Improving a Family of Approximation Algorithms to Edge Color Multigraphs.
Inf. Process. Lett., 1998

1997
Randomized greedy algorithms for the hypergraph partitioning problem.
Proceedings of the Randomization Methods in Algorithm Design, 1997


  Loading...