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


  • Édouard Bonnet, Florian Sikora
    The Graph Motif problem parameterized by the structure of the input graph.Discrete Applied Mathematics231 2017:78-94

  • Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora
    On the complexity of various parameterizations of common induced subgraph isomorphism.Theor. Comput. Sci.697 2017:69-78

  • Florian Sikora
    The shortest way to visit all metro lines in Paris.CoRRabs/1709.05948 2017:

  • Édouard Bonnet, Pawel Rzazewski, Florian Sikora
    Designing RNA Secondary Structures is Hard.CoRRabs/1710.11513 2017:

  • Édouard Bonnet, Florian Sikora
    A Note on Edge Isoperimetric Numbers and Regular Graphs.Int. J. Found. Comput. Sci.27(6) 2016:771-774

  • Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora
    Parameterized exact and approximation algorithms for maximum -set cover and related satisfiability problems.RAIRO - Theor. Inf. and Applic.50(3) 2016:227-240

  • Riccardo Dondi, Florian Sikora
    Parameterized Complexity and Approximation Issues for the Colorful Components Problems.CiE 2016:261-270

  • Cristina Bazgan, Florent Foucaud, Florian Sikora
    On the Approximability of Partial VC Dimension.COCOA 2016:92-106

  • Riccardo Dondi, Florian Sikora
    Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.COCOA 2016:113-127

  • Edouard Bonnet, Florian Sikora
    A note on Edge Isoperimetric Numbers and Regular Graphs.CoRRabs/1601.05190 2016:

  • Riccardo Dondi, Florian Sikora
    Parameterized Complexity and Approximation Issues for the Colorful Components Problems.CoRRabs/1605.03071 2016:

  • Riccardo Dondi, Florian Sikora
    Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.CoRRabs/1609.04951 2016:

  • Cristina Bazgan, Florent Foucaud, Florian Sikora
    On the Approximability of Partial VC Dimension.CoRRabs/1609.05110 2016:

  • Romeo Rizzi, Florian Sikora
    Some Results on More Flexible Versions of Graph Motif.Theory Comput. Syst.56(4) 2015:612-629

  • Edouard Bonnet, Florent Foucaud, Eun Jung Kim 0002, Florian Sikora
    Complexity of Grundy Coloring and Its Variants.COCOON 2015:109-120

  • Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora
    On the Complexity of QoS-Aware Service Selection Problem.ICSOC 2015:345-352

  • Edouard Bonnet, Florian Sikora
    The Graph Motif Problem Parameterized by the Structure of the Input Graph.IPEC 2015:319-330

  • Edouard Bonnet, Florian Sikora
    The parameterized complexity of Graph Motif relatively to the structure of the input graph.CoRRabs/1503.05110 2015:

  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
    Parameterized Inapproximability of Target Set Selection and Generalizations.Computability3(2) 2014:135-145

  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
    Parameterized approximability of maximizing the spread of influence in networks.J. Discrete Algorithms27 2014:54-65

  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
    Complexity insights of the Minimum Duplication problem.Theor. Comput. Sci.530 2014:66-79

  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
    Parameterized Inapproximability of Target Set Selection and Generalizations.CiE 2014:11-20

  • Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
    On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.IWOCA 2014:1-12

  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
    Parameterized Inapproximability of Target Set Selection and Generalizations.CoRRabs/1403.3565 2014:

  • Edouard Bonnet, Florent Foucaud, Eun Jung Kim 0002, Florian Sikora
    Complexity of Grundy coloring and its variants.CoRRabs/1407.5336 2014:

  • Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora
    On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.CoRRabs/1412.1261 2014:

  • Sylvain Guillemot, Florian Sikora
    Finding and Counting Vertex-Colored Subtrees.Algorithmica65(4) 2013:828-844

  • Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
    Minimum Mosaic Inference of a Set of Recombinants.Int. J. Found. Comput. Sci.24(1) 2013:51-66

  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
    Parameterized Approximability of Maximizing the Spread of Influence in Networks.COCOON 2013:543-554

  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
    Parameterized Approximability of Maximizing the Spread of Influence in NetworksCoRRabs/1303.6907 2013:

  • Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
    Multiparameterizations for max $k$-set cover and related satisfiability problems.CoRRabs/1309.4718 2013:

  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora
    On the parameterized complexity of the repetition free longest common subsequence problem.Inf. Process. Lett.112(7) 2012:272-276

  • Romeo Rizzi, Florian Sikora
    Some Results on more Flexible Versions of Graph Motif.CSR 2012:278-289

  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora
    Complexity Insights of the Minimum Duplication Problem.SOFSEM 2012:153-164

  • Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru
    An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval.TAMC 2012:319-329

  • Romeo Rizzi, Florian Sikora
    Some results on more flexible versions of Graph MotifCoRRabs/1202.5184 2012:

  • Florian Sikora
    Aspects algorithmiques de la comparaison d'éléments biologiques. (Algorithmics aspects of biological entities comparison). 2011:

  • Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
    Minimum Mosaic Inference of a Set of Recombinants.CATS 2011:23-30

  • Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette
    Algorithmic Aspects of Heterogeneous Biological Networks Comparison.COCOA 2011:272-286

  • Guillaume Blin, Florian Sikora, Stéphane Vialette
    Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set.IEEE/ACM Trans. Comput. Biology Bioinform.7(4) 2010:628-635

  • Guillaume Blin, Florian Sikora, Stéphane Vialette
    GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks.BICoB 2010:38-43

  • Sylvain Guillemot, Florian Sikora
    Finding and Counting Vertex-Colored Subtrees.MFCS 2010:405-416

  • Sylvain Guillemot, Florian Sikora
    Finding and counting vertex-colored subtreesCoRRabs/1002.1880 2010:

  • Guillaume Blin, Florian Sikora, Stéphane Vialette
    Querying Protein-Protein Interaction Networks.ISBRA 2009:52-62

  • Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette
    The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated.WALCOM 2009:357-368



Publications DFIS


Publications HAL