Skip to Main content

Keywords

Co-authors

Number of documents

58

Florian Sikora


See also www.lamsade.dauphine.fr/~sikora/


Journal articles22 documents

  • Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, et al.. EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. Journal of the ACM (JACM), Association for Computing Machinery, 2021, 68 (2), pp.1-38. ⟨10.1145/3433160⟩. ⟨hal-03107441⟩
  • Edouard Bonnet, Paweł Rzążewski, Florian Sikora. Designing RNA Secondary Structures Is Hard. Journal of Computational Biology, Mary Ann Liebert, 2020, 27 (3), pp.302-316. ⟨10.1089/cmb.2019.0420⟩. ⟨hal-03032377⟩
  • Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora. Parameterized Orientable Deletion. Algorithmica, Springer Verlag, 2020, 82 (7), pp.1909-1938. ⟨10.1007/s00453-020-00679-6⟩. ⟨hal-02793714⟩
  • Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. Weighted Upper Edge Cover: Complexity and Approximability. Journal of Graph Algorithms and Applications, Brown University, 2020, 24 (2), pp.65-88. ⟨10.7155/jgaa.00519⟩. ⟨hal-02793773⟩
  • Florian Sikora. Quel trajet optimal pour passer au moins une fois par toutes les lignes de métro ?. Interstices, INRIA, 2020. ⟨hal-03131204⟩
  • Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Zoppis Italo. Covering a Graph with Clubs. Journal of Graph Algorithms and Applications, 2019, 23 (2), ⟨10.7155/jgaa.00491⟩. ⟨hal-02465066⟩
  • Cristina Bazgan, Florent Foucaud, Florian Sikora. Parameterized and approximation complexity of Partial VC Dimension. Theoretical Computer Science, Elsevier, 2019, 766, ⟨10.1016/j.tcs.2018.09.013⟩. ⟨hal-02091342⟩
  • Riccardo Dondi, Florian Sikora. Parameterized complexity and approximation issues for the colorful components problems. Theoretical Computer Science, Elsevier, 2018, 739, ⟨10.1016/j.tcs.2018.04.044⟩. ⟨hal-02115544⟩
  • Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora. Complexity of Grundy coloring and its variants. Discrete Applied Mathematics, Elsevier, 2018, 243, ⟨10.1016/j.dam.2017.12.022⟩. ⟨hal-02104874⟩
  • Riccardo Dondi, Florian Sikora. Finding disjoint paths on edge-colored graphs: more tractability results. Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (4), ⟨10.1007/s10878-017-0238-6⟩. ⟨hal-02115531⟩
  • Edouard Bonnet, Foucaud Florent, Eunjung Kim, Florian Sikora. Complexity of Grundy coloring and its variants. Discrete Applied Mathematics, Elsevier, 2018. ⟨hal-01991659⟩
  • Édouard Bonnet, Florian Sikora. The Graph Motif problem parameterized by the structure of the input graph. Discrete Applied Mathematics, Elsevier, 2017, 231, ⟨10.1016/j.dam.2016.11.016⟩. ⟨hal-02076324⟩
  • Faisal N Abu-Khzam, Édouard Bonnet, Florian Sikora. On the complexity of various parameterizations of common induced subgraph isomorphism. Theoretical Computer Science, Elsevier, 2017, 697, ⟨10.1016/j.tcs.2017.07.010⟩. ⟨hal-02076432⟩
  • Edouard Bonnet, Florian Sikora. A note on Edge Isoperimetric Numbers and Regular Graphs. International Journal of Foundations of Computer Science, World Scientific Publishing, 2016, 27 (6), ⟨10.1142/S0129054116500283⟩. ⟨hal-01505500⟩
  • Edouard Bonnet, Vangelis Paschos, Florian Sikora. Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems. RAIRO - Theoretical Informatics and Applications, 2016, 50 (3), ⟨10.1051/ita/2016022⟩. ⟨hal-01505479⟩
  • Romeo Rizzi, Florian Sikora. Some Results on More Flexible Versions of Graph Motif. Theory of Computing Systems, Springer Verlag, 2015, 56 (4), ⟨10.1007/s00224-014-9564-6⟩. ⟨hal-01505510⟩
  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora. Parameterized Inapproximability of Target Set Selection and Generalizations. Computability, IOS Press, 2014, 3 (2), ⟨10.3233/COM-140030⟩. ⟨hal-01370527⟩
  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora. Parameterized approximability of maximizing the spread of influence in networks. Journal of Discrete Algorithms, Elsevier, 2014, 27, ⟨10.1016/j.jda.2014.05.001⟩. ⟨hal-01331692⟩
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora. Complexity Insights of the Minimum Duplication Problem. Theoretical Computer Science, Elsevier, 2014, 530, pp.66-79. ⟨hal-00948488⟩
  • Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette. Minimum Mosaic Inference of a Set of Recombinants. International Journal of Foundations of Computer Science, World Scientific Publishing, 2013, 24 (1), pp.51-66. ⟨10.1142/S0129054113400042⟩. ⟨hal-00679269⟩
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem. Information Processing Letters, Elsevier, 2012, 112 (7), pp.272-276. ⟨10.1016/j.ipl.2011.12.009⟩. ⟨hal-00637255v2⟩
  • Guillaume Blin, Florian Sikora, Stéphane Vialette. Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex Set. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2010, 7 (4), pp.628-635. ⟨hal-00619763⟩

Conference papers32 documents

  • Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora. On the Complexity of Broadcast Domination and Multipacking in Digraphs. Combinatorial Algorithms - 31st International Workshop, Jun 2020, Bordeaux, France. pp.264-276, ⟨10.1007/978-3-030-48966-3_20⟩. ⟨hal-02793880⟩
  • Pierre Aboulker, Edouard Bonnet, Eun Jung Kim, Florian Sikora. Grundy Coloring & Friends, Half-Graphs, Bicliques. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar 2020, Montpellier, France. pp.58:1--58:18, ⟨10.4230/LIPIcs.STACS.2020.58⟩. ⟨hal-02794004⟩
  • Tristan Cazenave, Benjamin Negrevergne, Florian Sikora. Monte Carlo Graph Coloring. Monte Carlo Search 2020, IJCAI Workshop, 2020, Yokohama (virtual), Japan. ⟨hal-03118170⟩
  • Renzo Roel P. Tan, Florian Sikora, Kazushi Ikeda, Kyle Stephen S. See. Arc Routing Based on the Zero-Suppressed Binary Decision Diagram. Transactions on Engineering Technologies, Oct 2020, Singapore, Singapore. pp.105-120, ⟨10.1007/978-981-15-8273-8_9⟩. ⟨hal-03217109⟩
  • Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, et al.. Token Sliding on Split Graphs. STACS 2019, Mar 2019, Berlin, Germany. ⟨hal-03107597⟩
  • Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. Extension of Vertex Cover and Independent Set in Some Classes of Graphs. 11th International Conference, CIAC 2019, May 2019, Rome, Italy. pp.124-136, ⟨10.1007/978-3-030-17402-6_11⟩. ⟨hal-02184942⟩
  • Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. 22nd International Symposium, FCT 2019, Aug 2019, Copenhagen, Denmark. pp.185-200, ⟨10.1007/978-3-030-25027-0_13⟩. ⟨hal-02310662⟩
  • Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. Weighted Upper Edge Cover: Complexity and Approximability. 13th International Conference, WALCOM 2019, Feb 2019, Guwahati, India. pp.235-247, ⟨10.1007/978-3-030-10564-8_19⟩. ⟨hal-02184878⟩
  • Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora. Parameterized Orientable Deletion. SWAT 2018, Jun 2018, Malmö, Sweden. pp.24:1-24:13. ⟨hal-02075097⟩
  • Edouard Bonnet, Pawel Rzążewski, Florian Sikora. Designing RNA Secondary Structures Is Hard. RECOMB 2018, Apr 2018, Paris, France. pp.248-250, ⟨10.1007/978-3-319-89929-9⟩. ⟨hal-02075335⟩
  • Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis. Covering with Clubs: Complexity and Approximability. 29th International Workshop on Combinatorial Algorithms (IWOCA 2018), Jul 2018, Singapore, Singapore. pp.153-164, ⟨10.1007/978-3-319-94667-2_13⟩. ⟨hal-02074964⟩
  • Edouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski, Florian Sikora. QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018, Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs⟩. ⟨hal-01991635⟩
  • Edouard Bonnet, Paweł Rzążewski, Florian Sikora. Designing RNA Secondary Structures is Hard. RECOMB 2018, Apr 2018, Paris, France. ⟨hal-01991541⟩
  • Edouard Bonnet, Florian Sikora. The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. IPEC 2018, Aug 2018, Helsinki, Finland. ⟨10.4230/LIPIcs.IPEC.2018.26⟩. ⟨hal-01991645⟩
  • Riccardo Dondi, Florian Sikora. Parameterized Complexity and Approximation Issues for the Colorful Components Problems. 12th Conference on Computability in Europe, CiE 2016, Jun 2016, Paris, France. pp.261-270, ⟨10.1007/978-3-319-40189-8_27⟩. ⟨hal-01505495⟩
  • Riccardo Dondi, Florian Sikora. Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. 10th International Conference on Combinatorial Optimization and Applications ( COCOA 2016), Dec 2016, Hong Kong, China. pp.113-127, ⟨10.1007/978-3-319-48749-6_9⟩. ⟨hal-01503469⟩
  • Cristina Bazgan, Florent Foucaud, Florian Sikora. On the Approximability of Partial VC Dimension. 10th International Conference, COCOA 2016, Dec 2016, Hong Kong, China. pp.92-106, ⟨10.1007/978-3-319-48749-6_7⟩. ⟨hal-01431728⟩
  • Edouard Bonnet, Florian Sikora. The Graph Motif Problem Parameterized by the Structure of the Input Graph. 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.319--330, ⟨10.4230/LIPIcs.IPEC.2015.319⟩. ⟨hal-01505505⟩
  • Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora. On the Complexity of QoS-Aware Service Selection Problem. 13th International Conference on Service-Oriented Computing, ICSOC 2015, Nov 2015, Goa, India. pp.345-352, ⟨10.1007/978-3-662-48616-0_23⟩. ⟨hal-01505504⟩
  • Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora. Complexity of Grundy Coloring and Its Variants. 21st International Conference on Computing and Combinatorics, COCOON 2015, Aug 2015, Beijing, China. pp.109-120, ⟨10.1007/978-3-319-21398-9_9⟩. ⟨hal-01370531⟩
  • Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, Oct 2014, Duluth, United States. pp.1-12, ⟨10.1007/978-3-319-19315-1_1⟩. ⟨hal-01366670⟩
  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora. Parameterized Inapproximability of Target Set Selection and Generalizations. 10th Conference on Computability in Europe, CiE 2014, Jun 2014, Budapest, Hungary. pp.11-20, ⟨10.1007/978-3-319-08019-2_2⟩. ⟨hal-01388129⟩
  • Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora. Parameterized Approximability of Maximizing the Spread of Influence in Networks. 19th International Conference on Computing and Combinatorics, COCOON 2013, Jun 2013, Hangzhou, China. pp.543-554, ⟨10.1007/978-3-642-38768-5_48⟩. ⟨hal-01366676⟩
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem. International Workshop on Approximation, Parameterized and EXact algorithms (APEX'13), Jul 2013, Riga, Latvia. 3 pp. ⟨hal-00949104⟩
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora. Complexity Insights of the Minimum Duplication Problem. 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Jan 2012, Špindleruv Mlýn, Czech Republic. pp.153-164. ⟨hal-00629047⟩
  • Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Roméo Rizzi, et al.. An algorithmic view on multi-related-segments: A unifying model for approximate common interval. 9th annual conference on Theory and Applications of Models of Computation (TAMC), May 2012, Beijing, China. pp.319-329, ⟨10.1007/978-3-642-29952-0_33⟩. ⟨hal-00630150v2⟩
  • Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette. Minimum Mosaic Inference of a Set of Recombinants. 17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30. ⟨hal-00620371⟩
  • Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, et al.. Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩. ⟨hal-00606375⟩
  • Guillaume Blin, Florian Sikora, Stéphane Vialette. GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks. Bioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43. ⟨hal-00425661⟩
  • Sylvain Guillemot, Florian Sikora. Finding and counting vertex-colored subtrees. International Symposium on Mathematical Foundations of Computer Science (MFCS), Jun 2010, Brno, Czech Republic. pp.405-416. ⟨hal-00455134v3⟩
  • Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. WALCOM 2009, 2009, Kolkata, India. pp.357-368. ⟨hal-00416491⟩
  • Guillaume Blin, Florian Sikora, Stéphane Vialette. Querying Protein-Protein Interaction Networks. 5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62. ⟨hal-00620391⟩

Book sections1 document

  • Christian J. Michel, Guillaume Blin, Florian Sikora. Analyse de séquences : des méthodes combinatoires et algorithmiques. Étienne Baudrier, Loïc Mazo. Informatique Mathématique - Une photographie en 2016, pp.57-87, 2016, 978-2-271-09335-6. ⟨hal-01296618⟩

Directions of work or proceedings2 documents

  • Tomas Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, et al.. SOFSEM 2021: Theory and Practice of Computer Science. 2021, ⟨10.1007/978-3-030-67731-2⟩. ⟨hal-03125810⟩
  • Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos Kapoutsis, Yannis Manolopoulos, et al.. SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics. 2020, ⟨10.1007/978-3-030-38919-2⟩. ⟨hal-02794071⟩

Theses1 document