Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Florian Sikora

Email : florian.sikora@dauphine.fr

Tel : +33 (0)1 44 05 44 36
Bureau : P627
Pole : Optimisation combinatoire algorithmique
Status : Maitre de conférence

Encadrement de these de doctorat :


  • Mehdi Khosravian : La recherche de solutions max-min pour des problèmes algotithmiques ( Début : 2016-03-01)
voir toutes les theses

Publications Dblp


Publications DFIS


Publications HAL


18 Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis ( and ), In 10th International Conference on Combinatorial Optimization and Applications ( COCOA 2016), . [bibtex] [pdf] [doi]

17 On the Approximability of Partial VC Dimension (, and ), In 10th International Conference, COCOA 2016, . [bibtex] [pdf] [doi]

16 Parameterized Complexity and Approximation Issues for the Colorful Components Problems ( and ), In 12th Conference on Computability in Europe, CiE 2016, . [bibtex] [pdf] [doi]

15 Analyse de sequences : des methodes combinatoires et algorithmiques (, and ), Chapter in Informatique Mathématique - Une photographie en 2016 (Étienne Baudrier, Loïc Mazo, ed.), . [bibtex] [pdf]

14 A note on Edge Isoperimetric Numbers and Regular Graphs ( and ), In International Journal of Foundations of Computer Science, volume 27, . [bibtex] [pdf] [doi]

13 Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems (, and ), In RAIRO - Theoretical Informatics and Applications, volume 50, . [bibtex] [pdf] [doi]

12 On the Complexity of QoS-Aware Service Selection Problem (, , and ), In 13th International Conference on Service-Oriented Computing, ICSOC 2015, . [bibtex] [pdf] [doi]

11 The Graph Motif Problem Parameterized by the Structure of the Input Graph ( and ), In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), . [bibtex] [pdf] [doi]

10 Complexity of Grundy Coloring and Its Variants (, , and ), In 21st International Conference on Computing and Combinatorics, COCOON 2015, . [bibtex] [pdf] [doi]

9 Some Results on More Flexible Versions of Graph Motif ( and ), In Theory of Computing Systems, volume 56, . [bibtex] [pdf] [doi]

8 On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism (, and ), In 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, . [bibtex] [pdf] [doi]

7 Parameterized Inapproximability of Target Set Selection and Generalizations (, , and ), In 10th Conference on Computability in Europe, CiE 2014, . [bibtex] [pdf] [doi]

6 Complexity Insights of the Minimum Duplication Problem (, , , and ), In Journal of Theoretical Computer Science (TCS), Elsevier, volume 530, . [bibtex] [pdf]

5 Parameterized Inapproximability of Target Set Selection and Generalizations (, , and ), In Computability, volume 3, . [bibtex] [pdf] [doi]

4 Parameterized approximability of maximizing the spread of influence in networks (, , and ), In Journal of Discrete Algorithms, volume 27, . [bibtex] [pdf] [doi]

3 Parameterized algorithms for the max k-set cover and related satisfiability problems (, and ), . [bibtex] [pdf]

2 On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem (, , and ), In International Workshop on Approximation, Parameterized and EXact algorithms (APEX'13) (Angel et al., ed.), . [bibtex] [pdf]

1 Parameterized Approximability of Maximizing the Spread of Influence in Networks (, , and ), In 19th International Conference on Computing and Combinatorics, COCOON 2013, . [bibtex] [pdf] [doi]