The following pages link to Romeo Rizzi (Q168651):
Displaying 50 items.
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- Some algorithmic results for [2]-sumset covers (Q458372) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Solving the train marshalling problem by inclusion-exclusion (Q516904) (← links)
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362) (← links)
- Excessive factorizations of bipartite multigraphs (Q602754) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Approximation of RNA multiple structural alignment (Q655441) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Channel assignment for interference avoidance in honeycomb wireless networks (Q705558) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way (Q821554) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Classes of cycle bases (Q868389) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Optimal receiver scheduling algorithms for a multicast problem (Q967374) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic (Q1007642) (← links)
- Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731) (← links)
- Approximating the maximum 3-edge-colorable subgraph problem (Q1043590) (← links)
- A simple minimum \(T\)-cut algorithm (Q1406048) (← links)
- Routing permutations in partitioned optical passive stars networks. (Q1414743) (← links)
- A note on range-restricted circuit covers (Q1586585) (← links)
- Improved approximation for breakpoint graph decomposition and sorting by reversals (Q1598878) (← links)
- Tight lower bounds for the number of inclusion-minimal \(st\)-cuts (Q1627159) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Pattern matching for \(k\)-track permutations (Q1670989) (← links)
- The minimum conflict-free row split problem revisited (Q1687927) (← links)
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm (Q1706164) (← links)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994) (← links)
- Pattern matching for separable permutations (Q1796851) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- Shortest paths in conservative graphs (Q1841900) (← links)
- Minimum \(T\)-cuts and optimal \(T\)-pairings (Q1850005) (← links)
- Packing triangles in bounded degree graphs. (Q1853132) (← links)
- Cycle cover property and \(\text{CPP}=\text{SCC}\) property are not equivalent (Q1861230) (← links)
- Combinatorial optimization -- polyhedra and efficiency: a book review (Q1885341) (← links)
- Ranking, unranking and random generation of extensional acyclic digraphs (Q1941716) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks (Q2173438) (← links)
- Sorting with forbidden intermediates (Q2181215) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- A simplified algorithm computing all \(s-t\) bridges and articulation points (Q2235263) (← links)
- Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
