The following pages link to Rossella Petreschi (Q259076):
Displaying 50 items.
- Topology recognition with advice (Q259077) (← links)
- A new 3D representation of trivalent Cayley networks (Q287008) (← links)
- (Q497692) (redirect page) (← links)
- Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two'' (Q497693) (← links)
- Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
- Recognizing strict 2-threshold graphs in O(m) time (Q673666) (← links)
- An \(O(n^ 3)\) recognition algorithm for bithreshold graphs (Q676270) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- Conflict-free star-access in parallel memory systems (Q861322) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Adamant digraphs (Q1104933) (← links)
- Parallelism and the feedback vertex set problem (Q1111395) (← links)
- A switching algorithm for the solution of quadratic Boolean equations (Q1153123) (← links)
- Theoretical results on at most 1-bend embeddability of graphs (Q1210238) (← links)
- Orthogonally drawing cubic graphs in parallel (Q1290255) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- On-line 2-satisfiability (Q1356216) (← links)
- Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- Graphs that are not pairwise compatible: a new proof technique (extended abstract) (Q1670981) (← links)
- On dynamic threshold graphs and related classes (Q1705777) (← links)
- \(L(h,1)\)-labeling subclasses of planar graphs (Q1881282) (← links)
- Exploring pairwise compatibility graphs (Q1935784) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Some classes of graphs that are not PCGs (Q2272401) (← links)
- The \(L(2,1)\)-labeling of unigraphs (Q2275923) (← links)
- On coding labeled trees (Q2381521) (← links)
- Structure-preserving hierarchical decompositions (Q2581006) (← links)
- On pairwise compatibility graphs having Dilworth number two (Q2637346) (← links)
- Optimally extending bistandard graphs on the orthogonal grid (extended abstract) (Q2725986) (← links)
- Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs (Q2803835) (← links)
- \(\lambda\)-coloring of regular tiling (extended abstract) (Q2816017) (← links)
- Tree partitioning via vertex deletion (Q2816023) (← links)
- On the pairwise compatibility property of some superclasses of threshold graphs (Q2846475) (← links)
- Recognition of unigraphs through superposition of graphs (Q2865028) (← links)
- On Relaxing the Constraints in Pairwise Compatibility Graphs (Q2889906) (← links)
- L(2,1)-Labeling of Unigraphs (Q2999333) (← links)
- (Q3044330) (← links)
- (Q3197328) (← links)
- PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS (Q3348414) (← links)
- Parallel Algorithms for Encoding and Decoding Blob Code (Q3404441) (← links)
- (Q3439685) (← links)
- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) (Q3605495) (← links)
- On the L(h,k)-Labeling of Co-comparability Graphs (Q3611902) (← links)
- A Bijective Code for k-Trees with Linear Time Encoding and Decoding (Q3611931) (← links)
- Experimental comparison of 2-satisfiability algorithms (Q3979516) (← links)
- ON PV<sub>chunk</sub> OPERATIONS AND MATROGENIC GRAPHS (Q4020277) (← links)
- (Q4233833) (← links)
- (Q4261184) (← links)
