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


27 Analyse de sequences : des methodes combinatoires et algorithmiques (, and ), Chapter in (Étienne BAUDRIER , Loïc MAZO, ed.), CNRS Editions, . [bibtex]

26 Parameterized Complexity and Approximation Issues for the Colorful Components Problems ( and ), In Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings (Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska, ed.), Springer International Publishing, . [bibtex]

25 Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis ( and ), In Combinatorial Optimization and Applications (T-H. Hubert Chan, Minming Li, Lusheng Wang, ed.), Springer International Publishing, . [bibtex]

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

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

22 On the Approximability of Partial VC Dimension (, and ), In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016 (T-H. Hubert Chan, Minming Li, Lusheng Wang, ed.), Springer, . [bibtex]

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

20 The Graph Motif Problem Parameterized by the Structure of the Input Graph ( and ), In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) (Thore Husfeldt, Iyad Kanj, eds.), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, . [bibtex]

19 Complexity of Grundy Coloring and Its Variants (, , and ), In Computing and Combinatorics. 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings (Dachuan Xu, Donglei Du, Dingzhu Du, ed.), Springer International Publishing, . [bibtex]

18 On the Complexity of QoS-Aware Service Selection Problem (, , and ), In Service-Oriented Computing. 13th International Conference, ICSOC 2015, Goa, India, November 16-19, 2015, Proceedings (Alistair Barros, Daniela Grigori, Nanjangud C. Narendra, Hoa Khanh Dam, ed.), Springer Berlin Heidelberg, . [bibtex]

17 On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism (, and ), In Combinatorial Algorithms. 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers (Kratochvíl Jan, Mirka Miller, Dalibor Froncek, ed.), Springer International Publishing, . [bibtex]

16 Complexity insights of the Minimum Duplication problem (, , , and ), In Theoretical Computer Science, volume 530, . [bibtex] [pdf] [doi]

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

14 Parameterized Inapproximability of Target Set Selection and Generalizations (, , and ), In Language, Life, Limits.10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings (Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer, ed.), Springer, . [bibtex]

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

12 Finding and Counting Vertex-Colored Subtrees ( and ), In Algorithmica, volume 65, . [bibtex] [pdf] [doi]

11 Minimum Mosaic Inference of a Set of Recombinants (, , and ), In International Journal of Foundations of Computer Science, volume 24, . [bibtex] [doi]

10 Parameterized Approximability of Maximizing the Spread of Influence in Networks (, , and ), In Computing and Combinatorics. 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings (Ding-Zhu Du, Guochuan Zhang, ed.), Springer, . [bibtex]

9 On the parameterized complexity of the repetition free longest common subsequence problem (, , and ), In Information Processing Letters, volume 112, . [bibtex] [pdf] [doi]

8 An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval (, , , , and ), In Theory and Applications of Models of Computation. 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings (Manindra Agrawal, S. Barry Cooper, Angsheng Li, ed.), Springer Berlin Heidelberg, . [bibtex]

7 Some Results on more Flexible Versions of Graph Motif ( and ), In Computer Science – Theory and Applications. 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings (Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii, ed.), Springer Berlin Heidelberg, . [bibtex]

6 Complexity Insights of the Minimum Duplication Problem (, , , and ), In SOFSEM 2012: Theory and Practice of Computer Science. 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings (Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán, ed.), Springer Berlin Heidelberg, . [bibtex]

5 Algorithmic Aspects of Heterogeneous Biological Networks Comparison (, , , , and ), In Combinatorial Optimization and Applications. 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings (Weifan Wang, Xuding Zhu, Ding-Zhu Du, ed.), Springer Berlin Heidelberg, . [bibtex]

4 Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set (, and ), In IEEE/ACM Transactions on Computational Biology and Bioinformatics, volume 7, . [bibtex] [doi]

3 Finding and Counting Vertex-Colored Subtrees ( and ), In Mathematical Foundations of Computer Science 2010. 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings (Petr Hliněný, Antonín Kučera, ed.), Springer Berlin Heidelberg, . [bibtex]

2 The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated (, , and ), In WALCOM: Algorithms and Computation. Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings (Sandip Das, Ryuhei Uehara, ed.), Springer Berlin Heidelberg, . [bibtex]

1 Querying Protein-Protein Interaction Networks (, and ), In Bioinformatics Research and Applications. 5th International Symposium, ISBRA 2009 Fort Lauderdale, FL, USA, May 13-16, 2009 Proceedings (Ion Măndoiu, Giri Narasimhan, Yanqing Zhang, ed.), Springer Berlin Heidelberg, . [bibtex]

Z3988h AnnualHAL php?
, <