Romeo Rizzi

Discret. Appl. Math., 2025

2024

Width Helps and Hinders Splitting Flows.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2024

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2024

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs.

[BibT_eX]

[DOI]

Algorithmica, January, 2024

Predictive mining of multi-temporal relations.

[BibT_eX]

[DOI]

Inf. Comput., 2024

Listing the bonds of a graph in O˜(n)-delay.

[BibT_eX]

[DOI]

Alice Raffaele

Takeaki Uno

Discret. Appl. Math., 2024

Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Generalizing Roberts' Characterization of Unit Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Solving the probabilistic profitable tour problem on a line.

[BibT_eX]

[DOI]

Enrico Angelelli

Renata Mansini

Optim. Lett., November, 2023

On recognising words that are squares for the shuffle product.

[BibT_eX]

[DOI]

Theor. Comput. Sci., May, 2023

An interdisciplinary experimental evaluation on the disjunctive temporal problem.

[BibT_eX]

[DOI]

Constraints An Int. J., March, 2023

Quasi-kernels in split graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Discovering Predictive Dependencies on Multi-Temporal Relations.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Temporal Representation and Reasoning, 2023

Cut Paths and Their Remainder Structure, with Applications.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Hardness of Balanced Mobiles.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Recognizing Unit Multiple Intervals Is Hard.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Dynamic controllability of temporal networks with instantaneous reaction.

[BibT_eX]

[DOI]

Inf. Sci., 2022

Minimum Path Cover in Parameterized Linear Time.

[BibT_eX]

[DOI]

CoRR, 2022

Solving the Probabilistic Profitable Tour Problem on a Tree.

[BibT_eX]

[DOI]

Enrico Angelelli

Renata Mansini

CoRR, 2022

Safety in s-t Paths, Trails and Walks.

[BibT_eX]

[DOI]

Algorithmica, 2022

Algorithmic Aspects of Small Quasi-Kernels.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Dynamic Controllability of Temporal Networks via Supervisory Control.

[BibT_eX]

[DOI]

Proceedings of the Short Paper Proceedings of the 4th Workshop on Artificial Intelligence and Formal Verification, 2022

2021

When a dollar makes a BWT.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Decomposing subcubic graphs into claws, paths or triangles.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Checking Sets of Pure Evolving Association Rules.

[BibT_eX]

[DOI]

Carlo Combi

Pietro Sala

Fundam. Informaticae, 2021

A simplified algorithm computing all s-t bridges and articulation points.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Algorithmic aspects of quasi-kernels.

[BibT_eX]

[DOI]

CoRR, 2021

A Linear-Time Parameterized Algorithm for Computing the Width of a DAG.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Make your programs compete and watch them play in the Code Colosseum.

[BibT_eX]

[DOI]

Dario Ostuni

Edoardo Morassutto

Proceedings of the 2021 IEEE Conference on Games (CoG), 2021

Faster and Better Simple Temporal Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Discovering Evolving Temporal Information: Theory and Application to Clinical Databases.

[BibT_eX]

[DOI]

SN Comput. Sci., 2020

Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks.

[BibT_eX]

[DOI]

Giuseppe Francesco Italiano

J. Log. Algebraic Methods Program., 2020

Sorting with forbidden intermediates.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Computing all s-t bridges and articulation points simplified.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

On Bubble Generators in Directed Graphs.

[BibT_eX]

[DOI]

Vicente Acuña

Roberto Grossi

Algorithmica, 2020

On the Complexity of Resource Controllability in Business Process Management.

[BibT_eX]

[DOI]

Proceedings of the Business Process Management Workshops, 2020

Dynamic Controllability and (J, K)-Resiliency in Generalized Constraint Networks with Uncertainty.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Faster FPTASes for counting and random generation of Knapsack solutions.

[BibT_eX]

[DOI]

Inf. Comput., 2019

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

[BibT_eX]

[DOI]

Bioinform., 2019

Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

When a Dollar Makes a BWT.

[BibT_eX]

[DOI]

Sara Giuliani

Zsuzsanna Lipták

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Complexity of Weak, Strong and Dynamic Controllability of CNCUs.

[BibT_eX]

[DOI]

Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

Strong Controllability of Temporal Networks with Decisions.

[BibT_eX]

[DOI]

Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

2018

Network Synthesis for Distributed Embedded Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2018

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

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

[BibT_eX]

[DOI]

Inf. Comput., 2018

Efficient enumeration of graph orientations with sources.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

Algorithmica, 2018

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier.

[BibT_eX]

[DOI]

Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty.

[BibT_eX]

[DOI]

Luke Hunsberger

Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

Listing Subgraphs by Cartesian Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Pattern Matching for k-Track Permutations.

[BibT_eX]

[DOI]

Laurent Bulteau

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.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Solving the train marshalling problem by inclusion-exclusion.

[BibT_eX]

[DOI]

Franca Rinaldi

Discret. Appl. Math., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games.

[BibT_eX]

[DOI]

Constraints An Int. J., 2017

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

[BibT_eX]

[DOI]

Algorithmica, 2017

The Minimum Conflict-Free Row Split Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Dynamic Controllability Made Simple.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Incorporating Decision Nodes into Conditional Simple Temporal Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

The Complexity of Simulation and Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Optimal Omnitig Listing for Safe and Complete Contig Assembly.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

On the Complexity of Computing the Excessive [B]-Index of a Graph.

[BibT_eX]

[DOI]

David Cariolaro

J. Graph Theory, 2016

Permutation Pattern matching in (213, 231)-avoiding permutations.

[BibT_eX]

[DOI]

Both Emerite Neou

Discret. Math. Theor. Comput. Sci., 2016

Strong cliques and equistability of EPT graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Diploid Alignment is NP-hard.

[BibT_eX]

[DOI]

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

The Complexity of Simulation and (Exotic) Matrix Multiplications.

[BibT_eX]

[DOI]

CoRR, 2016

Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Pattern Matching for Separable Permutations.

[BibT_eX]

[DOI]

Both Emerite Neou

Proceedings of the String Processing and Information Retrieval, 2016

New Bounds for Approximating Extremal Distances in Undirected Graphs.

[BibT_eX]

[DOI]

Roberto Grossi

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Minimal Multiset Grammars for Recurrent Dynamics.

[BibT_eX]

[DOI]

Alessandro Farinelli

Giuditta Franco

Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Listing Acyclic Orientations of Graphs with Single and Multiple Sources.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Directing Road Networks by Listing Strong Orientations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Decomposing Cubic Graphs into Connected Subgraphs of Size Three.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Gabriele Farina

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

On the complexity of the vector connectivity problem.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Martin Milanic

Theor. Comput. Sci., 2015

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Some Results on More Flexible Versions of Graph Motif.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

The complexity of power indexes with graph restricted coalitions.

[BibT_eX]

[DOI]

Craig A. Tovey

Math. Soc. Sci., 2015

Friendly bin packing instances without Integer Round-up Property.

[BibT_eX]

[DOI]

Mauro Dell'Amico

José Carlos Díaz Díaz

Manuel Iori

Math. Program., 2015

Some algorithmic results for [2]-sumset covers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

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

[BibT_eX]

[DOI]

Both Emerite Neou

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Hyper Temporal Networks.

[BibT_eX]

[DOI]

CoRR, 2015

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

The Price of Evolution in Temporal Databases.

[BibT_eX]

[DOI]

Carlo Combi

Pietro Sala

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Enumerating Cyclic Orientations of a Graph.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

Set graphs. II. Complexity of set graph recognition and similar problems.

[BibT_eX]

[DOI]

Martin Milanic

Theor. Comput. Sci., 2014

Complexity insights of the Minimum Duplication problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Odd 2-factored snarks.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Dominating sequences in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly.

[BibT_eX]

[DOI]

Veli Mäkinen

BMC Bioinform., 2014

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

[BibT_eX]

[DOI]

David Cariolaro

Algorithmica, 2014

A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Giorgio Bacci

Marino Miculan

Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

Towards Unlocking the Full Potential of Multileaf Collimators.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Efficiently Listing Bounded Length st-Paths.

[BibT_eX]

[DOI]

Gustavo Sacomoto

Marie-France Sagot

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Ranking, unranking and random generation of extensional acyclic digraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Minimum Mosaic Inference of a Set of Recombinants.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

A novel min-cost flow method for estimating transcript expression with RNA-Seq.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Optimal Design of Consistent Simple Temporal Networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Optimal Listing of Cycles and st-Paths in Undirected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

On Recognizing Words That Are Squares for the Shuffle Product.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2013

2012

A Faster Algorithm for Finding Minimum Tucker Submatrices.

[BibT_eX]

[DOI]

Guillaume Blin

Gustavo Akio Tominaga Sacomoto

Theory Comput. Syst., 2012

Optimal Listing of Cycles and st-Paths in Undirected Graphs

[BibT_eX]

[DOI]

Marie-France Sagot

CoRR, 2012

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph.

[BibT_eX]

[DOI]

Danny Hermelin

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Approximation of RNA multiple structural alignment.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

On the approximability of the minimum strictly fundamental cycle basis problem.

[BibT_eX]

[DOI]

Giulia Galbiati

Edoardo Amaldi

Discret. Appl. Math., 2011

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.

[BibT_eX]

[DOI]

Rui A. Ferreira

Roberto Grossi

Proceedings of the Algorithms - ESA 2011, 2011

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row.

[BibT_eX]

[DOI]

Guillaume Blin

Proceedings of the Computer Science - Theory and Applications, 2011

On cycle bases with limited edge overlap.

[BibT_eX]

[DOI]

Edoardo Amaldi

Claudio Iuliano

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

Finding common structured patterns in linear graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Complexity issues in color-preserving graph embeddings.

[BibT_eX]

[DOI]

Gaëlle Brevier

Theor. Comput. Sci., 2010

Pure Parsimony Xor Haplotyping.

[BibT_eX]

[DOI]

Paola Bonizzoni

Gianluca Della Vedova

Riccardo Dondi

Yuri Pirola

IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Excessive factorizations of bipartite multigraphs.

[BibT_eX]

[DOI]

David Cariolaro

Discret. Appl. Math., 2010

Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms.

[BibT_eX]

[DOI]

Russell Schwartz

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.

[BibT_eX]

[DOI]

Edoardo Amaldi

Claudio Iuliano

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Lower bounds for strictly fundamental cycle bases in grid graphs.

[BibT_eX]

[DOI]

Networks, 2009

The optimal statistical median of a convex set of arrays.

[BibT_eX]

[DOI]

J. Glob. Optim., 2009

Finding occurrences of protein complexes in protein-protein interaction graphs.

[BibT_eX]

[DOI]

Guillaume Fertin

J. Discrete Algorithms, 2009

Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs.

[BibT_eX]

[DOI]

Péter Biró

David F. Manlove

Discret. Math. Algorithms Appl., 2009

Approximating the maximum 3-edge-colorable subgraph problem.

[BibT_eX]

[DOI]

Discret. Math., 2009

Optimal receiver scheduling algorithms for a multicast problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Cycle bases in graphs characterization, algorithms, complexity, and applications.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2009

Minimum Weakly Fundamental Cycle Bases Are Hard To Find.

[BibT_eX]

[DOI]

Algorithmica, 2009

Breaking the O(m2n) Barrier for Minimum Cycle Bases.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

2008

On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks.

[BibT_eX]

[DOI]

Reuven Cohen

Liran Katzir

IEEE Trans. Mob. Comput., 2008

Haplotyping for Disease Association: A Combinatorial Approach.

[BibT_eX]

[DOI]

R. Ravi

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Oriented star packings.

[BibT_eX]

[DOI]

Richard C. Brewster

Pavol Hell

J. Comb. Theory B, 2008

Flipping Letters to minimize the Support of a String.

[BibT_eX]

[DOI]

Franca Rinaldi

Int. J. Found. Comput. Sci., 2008

The Minimum Substring Cover problem.

[BibT_eX]

[DOI]

Inf. Comput., 2008

2007

Scheduling Data Broadcasts on Wireless Channels.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Comparing Genomes with Duplications: A Computational Complexity Point of View.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2007

New length bounds for cycle bases.

[BibT_eX]

[DOI]

Michael Elkin

Christian Liebchen

Inf. Process. Lett., 2007

A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

The firefighter problem for graphs of maximum degree three.

[BibT_eX]

[DOI]

Discret. Math., 2007

Least and most colored bases.

[BibT_eX]

[DOI]

Francesco Maffioli

Discret. Appl. Math., 2007

Classes of cycle bases.

[BibT_eX]

[DOI]

Christian Liebchen

Discret. Appl. Math., 2007

Benchmarks for Strictly Fundamental Cycle Bases.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Pattern Matching in Protein-Protein Interaction Graphs.

[BibT_eX]

[DOI]

Gaëlle Brevier

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

Hypercube Computations on Partitioned Optical Passive Stars Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2006

Online Permutation Routing in Partitioned Optical Passive Star Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

A polynomial case of the parsimony haplotyping problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

Covering partially directed graphs with directed paths.

[BibT_eX]

[DOI]

Marco Rospocher

Discret. Math., 2006

Acyclically pushable bipartite permutation digraphs: An algorithm.

[BibT_eX]

[DOI]

Discret. Math., 2006

The approximability of the String Barcoding problem.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2006

On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks.

[BibT_eX]

[DOI]

Reuven Cohen

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Genomes Containing Duplicates Are Hard to Compare.

[BibT_eX]

[DOI]

Proceedings of the Computational Science, 2006

2005

What Makes the Arc-Preserving Subsequence Problem Hard?

[BibT_eX]

[DOI]

Trans. Comp. Sys. Biology, 2005

Polynomial and APX-hard cases of the individual haplotyping problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel.

[BibT_eX]

[DOI]

Elia Ardizzoni

Shashank Ramaprasad

Madhusudana V. S. Shashanka

IEEE Trans. Computers, 2005

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.

[BibT_eX]

[DOI]

J. Comput. Biol., 2005

A greedy approach to compute a minimum cycle basis of a directed graph.

[BibT_eX]

[DOI]

Christian Liebchen

Inf. Process. Lett., 2005

Evaluation of BIC-based algorithms for audio segmentation.

[BibT_eX]

[DOI]

Mauro Cettolo

Michele Vescovi

Comput. Speech Lang., 2005

The String Barcoding Problem is NP-Hard.

[BibT_eX]

[DOI]

Marcello Dalpasso

Proceedings of the Comparative Genomics, 2005

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.

[BibT_eX]

[DOI]

Guillaume Fertin

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Conserved Interval Distance Computation Between Non-trivial Genomes.

[BibT_eX]

[DOI]

Guillaume Blin

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Packing cuts in undirected graphs.

[BibT_eX]

[DOI]

Networks, 2004

On d-threshold graphs and d-dimensional bin packing.

[BibT_eX]

[DOI]

Andrea Lodi

Networks, 2004

Channel assignment for interference avoidance in honeycomb wireless networks.

[BibT_eX]

[DOI]

Anil M. Shende

J. Parallel Distributed Comput., 2004

Allocating servers in infostations for bounded simultaneous requests.

[BibT_eX]

[DOI]

Phalguni Gupta

J. Parallel Distributed Comput., 2004

Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2004

Combinatorial optimization - Polyhedra and efficiency: A book review.

[BibT_eX]

[DOI]

Michelangelo Conforti

4OR, 2004

Optimal Multi-Channel Data Allocation with Flat Broadcast Per Channel.

[BibT_eX]

[DOI]

Shashank Ramaprasad

Madhusudana V. S. Shashanka

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Routing permutations in Partitioned Optical Passive Stars Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2003

Packing paths in digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Packing cycles in undirected graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2003

On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

On the complexity of digraph packings.

[BibT_eX]

[DOI]

Richard C. Brewster

Inf. Process. Lett., 2003

A simple minimum T-cut algorithm.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Allocating Servers in Infostations for On-Demand Communications.

[BibT_eX]

[DOI]

Phalguni Gupta

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Channel Assignment on Strongly-Simplicial Graphs.

[BibT_eX]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A DP algorithm for speaker change detection.

[BibT_eX]

[DOI]

Michele Vescovi

Mauro Cettolo

Proceedings of the 8th European Conference on Speech Communication and Technology, EUROSPEECH 2003, 2003

Channel Assignment in Honeycomb Networks.

[BibT_eX]

[DOI]

Anil M. Shende

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals.

[BibT_eX]

[DOI]

J. Comb. Optim., 2002

Packing triangles in bounded degree graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Minimum T-cuts and optimal T-pairings.

[BibT_eX]

[DOI]

Discret. Math., 2002

Cycle cover property and CPP=SCC property are not equivalent.

[BibT_eX]

[DOI]

Discret. Math., 2002

Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Routing Permutations in Partitioned Optical Passive Star Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Markup Lang., 2001

Excluding a Simple Good Pair Approach to Directed Cuts.

[BibT_eX]

[DOI]

Graphs Comb., 2001

On 4-connected graphs without even cycle decompositions.

[BibT_eX]

[DOI]

Discret. Math., 2001

On the recognition of P4-indifferent graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

Shortest paths in conservative graphs.

[BibT_eX]

[DOI]

Michele Conforti

Discret. Math., 2001

Some simple distributed algorithms for sparse networks.

[BibT_eX]

[DOI]

Distributed Comput., 2001

Packing Cycles and Cuts in Undirected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

A short proof of König's matching theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Edge-Coloring Bipartite Graphs.

[BibT_eX]

[DOI]

Ajai Kapoor

J. Algorithms, 2000

A Note on Range-Restricted Circuit Covers.

[BibT_eX]

[DOI]

Graphs Comb., 2000

NOTE - On Minimizing Symmetric Set Functions.

[BibT_eX]

[DOI]

Comb., 2000

1999

Indecomposable r-graphs and some other counterexamples.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

1998

König's edge coloring theorem without augmenting paths.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Improving a Family of Approximation Algorithms to Edge Color Multigraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

1997

Randomized greedy algorithms for the hypergraph partitioning problem.

[BibT_eX]

[DOI]

Roberto Battiti