The following pages link to Guillaume Fertin (Q214959):
Displaying 50 items.
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Revisiting the minimum breakpoint linearization problem (Q391095) (← links)
- Approximating the number of double cut-and-join scenarios (Q441869) (← links)
- Tractability and approximability of maximal strip recovery (Q441877) (← links)
- Some algorithmic results for [2]-sumset covers (Q458372) (← links)
- Path-driven orientation of mixed graphs (Q479025) (← links)
- Pancake flipping is hard (Q494050) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Odd gossiping (Q516782) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- On maximal instances for the original syntenic distance (Q703532) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- On the oriented chromatic number of grids (Q1007541) (← links)
- Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
- Acyclic and \(k\)-distance coloring of the grid (Q1014392) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- (Q1575742) (redirect page) (← links)
- On the structure of minimum broadcast digraphs (Q1575743) (← links)
- Hierarchical broadcast and gossip networks (Q1607034) (← links)
- The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835) (← links)
- Prefix and suffix reversals on strings (Q1647842) (← links)
- Optimal odd gossiping (Q1671312) (← links)
- Genome rearrangements on both gene order and intergenic regions (Q1708427) (← links)
- Finding supported paths in heterogeneous networks (Q1736715) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Factor \(d\)-domatic colorings of graphs (Q1868834) (← links)
- A study of minimum gossip graphs (Q1974518) (← links)
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs (Q2098173) (← links)
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384) (← links)
- Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- Sorting an array using the topological sort of a corresponding comparison graph (Q2207498) (← links)
- The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) (← links)
- Unshuffling permutations: trivial bijections and compositions (Q2327475) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- (Q2766678) (← links)
- Algorithmic Aspects of the S-Labeling Problem (Q2798230) (← links)
- (Q2816083) (← links)
- Decomposing Cubic Graphs into Connected Subgraphs of Size Three (Q2817881) (← links)
