The following pages link to João Meidanis (Q294685):
Displaying 33 items.
- Total-chromatic number and chromatic index of dually chordal graphs (Q294687) (← links)
- Median approximations for genomes modeled as matrices (Q301565) (← links)
- (Q672267) (redirect page) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Tree loop graphs (Q876466) (← links)
- (Q1178200) (redirect page) (← links)
- Lower bounds for arithmetic problems (Q1178201) (← links)
- On the consecutive ones property (Q1281779) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- Recognizing clique graphs of directed edge path graphs (Q1861580) (← links)
- Fast median computation for symmetric, orthogonal matrices under the rank distance (Q2229500) (← links)
- Counting sorting scenarios and intermediate genomes for the rank distance (Q2315513) (← links)
- Generalizations of the genomic rank distance to indels (Q2315514) (← links)
- (Q2741475) (← links)
- (Q3044315) (← links)
- Loop Graphs and Asteroidal Sets (Q3439331) (← links)
- Building PQR trees in almost-linear time (Q3439658) (← links)
- (Q3439695) (← links)
- (Q3839009) (← links)
- (Q4246795) (← links)
- (Q4390724) (← links)
- (Q4487452) (← links)
- (Q4489142) (← links)
- (Q4810371) (← links)
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances (Q4992760) (← links)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- Multiple alignment of biological sequences with gap flexibility (Q5096348) (← links)
- (Q5457093) (← links)
- (Q5461523) (← links)
- (Q5708481) (← links)
- Network science: a primer (Q6496804) (← links)
