The following pages link to Guillaume Fertin (Q214959):
Displaying 50 items.
- On the \(S\)-\textsc{Labeling} problem (Q2851476) (← links)
- Are stable instances easy? (Q2911066) (← links)
- Prefix and Suffix Reversals on Strings (Q2949837) (← links)
- Algorithmic Aspects of the Maximum Colorful Arborescence Problem (Q2988823) (← links)
- Tractability and Approximability of Maximal Strip Recovery (Q3011866) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- Star coloring of graphs (Q3159375) (← links)
- High-dimensional Apollonian networks (Q3379352) (← links)
- (Q3393448) (← links)
- Neighborhood Communications in Networks (Q3438960) (← links)
- Obtaining a Triangular Matrix by Independent Row-Column Permutations (Q3459859) (← links)
- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics (Q3506926) (← links)
- Exemplar Longest Common Subsequence (Q3545118) (← links)
- Genomes Containing Duplicates Are Hard to Compare (Q3545133) (← links)
- Revisiting the Minimum Breakpoint Linearization Problem (Q3569073) (← links)
- (Q3576724) (← links)
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated (Q3605511) (← links)
- Extending the Hardness of RNA Secondary Structure Comparison (Q3611904) (← links)
- On the Approximability of Comparing Genomes with Duplicates (Q3627965) (← links)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms (Q3652257) (← links)
- (Q4232778) (← links)
- (Q4448754) (← links)
- (Q4519135) (← links)
- (Q4944978) (← links)
- A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions (Q5041121) (← links)
- Finding a Small Number of Colourful Components (Q5088911) (← links)
- (Q5110893) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
- Reversal Distances for Strings with Few Blocks or Small Alphabets (Q5165590) (← links)
- Algorithmic Aspects of Heterogeneous Biological Networks Comparison (Q5199156) (← links)
- Structural Information and Communication Complexity (Q5315221) (← links)
- Combinatorial Pattern Matching (Q5315340) (← links)
- On Finding Small 2-Generating Sets (Q5323086) (← links)
- Graph Motif Problems Parameterized by Dual (Q5369540) (← links)
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (Q5428821) (← links)
- Vertex labeling and routing in expanded Apollonian networks (Q5440355) (← links)
- What Makes the Arc-Preserving Subsequence Problem Hard? (Q5449952) (← links)
- On the Approximability of Comparing Genomes with Duplicates (Q5452150) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492869) (← links)
- Computational Science – ICCS 2005 (Q5709406) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897562) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Routing permutations and 2-1 routing requests in the hypercube (Q5948960) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
- The Exact Subset MultiCover problem (Q6111957) (← links)
- Permutation pattern matching for doubly partially ordered patterns (Q6496850) (← links)
- The \textsc{maximum zero-sum partition} problem (Q6633570) (← links)
