The following pages link to Florian Sikora (Q413297):
Displaying 49 items.
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Covering with clubs: complexity and approximability (Q1670995) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Extension of some edge graph problems: standard and parameterized complexity (Q2291420) (← links)
- Extension of Vertex Cover and Independent Set in some classes of graphs (Q2294045) (← links)
- Correction to: ``Weighted upper edge cover: complexity and approximability'' (Q2327516) (← links)
- Weighted upper edge cover: complexity and approximability (Q2327526) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Complexity insights of the minimum duplication problem (Q2440167) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS (Q2841985) (← links)
- Complexity Insights of the Minimum Duplication Problem (Q2891364) (← links)
- An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval (Q2898043) (← links)
- Some Results on more Flexible Versions of Graph Motif (Q2907508) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Finding and Counting Vertex-Colored Subtrees (Q3586101) (← links)
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated (Q3605511) (← links)
- Parameterized Approximability of Maximizing the Spread of Influence in Networks (Q4925269) (← links)
- (Q5009490) (← links)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195) (← links)
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (Q5056440) (← links)
- (Q5090459) (← links)
- (Q5115779) (← links)
- (Q5116488) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175620) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175873) (← links)
- Algorithmic Aspects of Heterogeneous Biological Networks Comparison (Q5199156) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- A Note on Edge Isoperimetric Numbers and Regular Graphs (Q5298314) (← links)
- The Graph Motif Problem Parameterized by the Structure of the Input Graph (Q5363785) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- (Q5874335) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Parity permutation pattern matching (Q6070786) (← links)
- (Q6098785) (← links)
- Hardness of \textsc{Balanced Mobiles} (Q6182887) (← links)
- Designing RNA Secondary Structures is Hard (Q6293302) (← links)
- Grundy Coloring & friends, Half-Graphs, Bicliques (Q6332689) (← links)