Articles

Casel K., Fernau H., Khosravian Ghadikolaei M., Monnot J., Sikora F. (2023), Extension of some edge graph problems: Standard, parameterized and approximation complexity, Discrete Applied Mathematics, vol. 340, p. 183-201

Aboulker P., Bonnet É., Kim E., Sikora F. (2023), Grundy Coloring and Friends, Half-Graphs, Bicliques, Algorithmica, vol. 85, n°1, p. 1-28

Sikora F., Casel K., Fernau H., Khosravian Ghadikolaei M., Monnot J. (2022), On the complexity of solution extension of optimization problems, Theoretical Computer Science, vol. 904, p. 48-65

Sikora F., Belmonte R., Kim E., Lampis M., Mitsou V., Otachi Y. (2021), Token Sliding on Split Graphs, Theory of Computing Systems, vol. 65, n°4, p. 662–686

Bonamy M., Bonnet E., Bousquet N., Charbit P., Giannopoulos P., Kim E., Rzążewski P., Sikora F., Thomassé S. (2021), EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs, Journal of the ACM (JACM), vol. 68, n°2, p. 1–38

Foucaud F., Gras B., Perez A., Sikora F. (2021), On the Complexity of Broadcast Domination and Multipacking in Digraphs, Algorithmica, vol. 83, n°9, p. 2651–2677

Sikora F. (2020), Quel trajet optimal pour passer au moins une fois par toutes les lignes de métro ?, Interstices

Khoshkhah K., Khosravian Ghadikolaei M., Monnot J., Sikora F. (2020), Weighted Upper Edge Cover: Complexity and Approximability, Journal of Graph Algorithms and Applications, vol. 24, n°2, p. 65-68

Bonnet E., Rzążewski P., Sikora F. (2020), Designing RNA Secondary Structures Is Hard, Journal of Computational Biology, vol. 27, n°3, p. 302–316

Hanaka T., Katsikarelis I., Lampis M., Otachi Y., Sikora F. (2020), Parameterized Orientable Deletion, Algorithmica, vol. 82, n°7, p. 1909–1938

Dondi R., Mauri G., Sikora F., Zoppis I. (2019), Covering a Graph with Clubs, Journal of Graph Algorithms and Applications, vol. 23, n°2, p. 271-292

Bazgan C., Foucaud F., Sikora F. (2019), Parameterized and approximation complexity of Partial VC Dimension, Theoretical Computer Science, vol. 766, p. 1-15

Bonnet E., Foucaud F., Kim E., Sikora F. (2018), Complexity of Grundy coloring and its variants, Discrete Applied Mathematics, vol. 243, p. 99-114

Dondi R., Sikora F. (2018), Finding disjoint paths on edge-colored graphs: more tractability results, Journal of Combinatorial Optimization, vol. 36, n°4, p. 1315-1332

Dondi R., Sikora F. (2018), Parameterized complexity and approximation issues for the colorful components problems, Theoretical Computer Science, vol. 739, p. 1-12

Abu-Khzam F., Bonnet E., Sikora F. (2017), On the complexity of various parameterizations of common induced subgraph isomorphism, Theoretical Computer Science, vol. 697, p. 69-78

Bonnet E., Sikora F. (2017), The Graph Motif problem parameterized by the structure of the input graph, Discrete Applied Mathematics, vol. 231, p. 78-94

Bonnet E., Paschos V., Sikora F. (2016), Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems, RAIRO - Theoretical Informatics and Applications, vol. 50, n°3, p. 227-240

Bonnet E., Sikora F. (2016), A note on Edge Isoperimetric Numbers and Regular Graphs, International Journal of Foundations of Computer Science, vol. 27, n°6, p. 771-774

Rizzi R., Sikora F. (2015), Some Results on More Flexible Versions of Graph Motif, Theory of Computing Systems, vol. 56, n°4, p. 612-629

Chopin M., Nichterlein A., Bazgan C., Sikora F. (2014), Parameterized approximability of maximizing the spread of influence in networks, Journal of Discrete Algorithms, vol. 27, p. 54-65

Blin G., Bonizzoni P., Dondi R., Rizzi R., Sikora F. (2014), Complexity insights of the Minimum Duplication problem, Theoretical Computer Science, vol. 530, p. 66-79

Bazgan C., Chopin M., Nichterlein A., Sikora F. (2014), Parameterized Inapproximability of Target Set Selection and Generalizations, Computability. The Journal of the Association CiE, vol. 3, n°2, p. 135-145

Guillemot S., Sikora F. (2013), Finding and Counting Vertex-Colored Subtrees, Algorithmica, vol. 65, n°4, p. 828-844

Blin G., Vialette S., Sikora F., Rizzi R. (2013), Minimum Mosaic Inference of a Set of Recombinants, International Journal of Foundations of Computer Science, vol. 24, n°1, p. 51-66

Blin G., Bonizzoni P., Dondi R., Sikora F. (2012), On the parameterized complexity of the repetition free longest common subsequence problem, Information Processing Letters, vol. 112, n°7, p. 272-276

Blin G., Vialette S., Sikora F. (2010), Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, n°4, p. 628-635

Chapitres d'ouvrage

Michel C., Blin G., Sikora F. (2016), Analyse de sequences : des methodes combinatoires et algorithmiques, in Étienne BAUDRIER , Loïc MAZO, Informatique Mathématique : une photographie en 2016 CNRS Editions, p. 57-87

Directions d'ouvrage

Bures T., Dondi R., Gamper J., Guerrini G., Jurdziński T., Pahl C., Sikora F., Wong P. (2021), SOFSEM 2021: Theory and Practice of Computer Science, 47th International Conference on Current Trends in Theory and Practice of Computer Science Springer, 624 p.

Chatzigeorgiou A., Dondi R., Herodotou H., Kapoutsis C., Manolopoulos Y., Papadopoulos G., Sikora F. (2020), SOFSEM 2020: Theory and Practice of Computer Science, 46th International Conference on Current Trends in Theory and Practice of Informatics Springer, 723 p.

Chatzigeorgiou A., Dondi R., Herodotou H., Kapoutsis C., Manolopoulos Y., Papadopoulos G., Sikora F. (2020), SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, Berlin Heidelberg: Springer

Communications avec actes

Ardévol Martínez V., Sikora F., Vialette S. (2023), Parity Permutation Pattern Matching, in Chun-Cheng Lin ; Bertrand M. T. Lin ; Giuseppe Liotta, elsevier, Berlin Heidelberg, Springer International Publishing, 398 p.

Ardévol Martínez V., Rizzi R., Sikora F., Vialette S. (2023), Recognizing Unit Multiple Intervals Is Hard, in Satoru Iwata ; Naonori Kakimura, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 8:1-8:18 p.

Ardévol Martínez V., Rizzi R., Sikora F. (2023), Hardness of Balanced Mobiles, in Sun-Yuan Hsieh ; Ling-Ju Hung ; Chia-Wei Lee, elsevier, Berlin Heidelberg, Springer International Publishing, 25-35 p.

Pontoizeau T., Sikora F., Yger F., Cazenave T. (2022), Neural Maximum Independent Set, in , elsevier, Berlin Heidelberg, Springer International Publishing, 223–237 p.

BEAUJEAN P., Sikora F., Yger F. (2022), Graph Homomorphism Features: Why Not Sample?, in , Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Berlin Heidelberg, Springer International Publishing, 216–222 p.

Aboulker P., Bonnet E., Kim E., Sikora F. (2020), Grundy Coloring & Friends, Half-Graphs, Bicliques, in , 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 58:1-58:18 p.

Tan R., Sikora F., Ikeda K., See K. (2020), Arc Routing Based on the Zero-Suppressed Binary Decision Diagram, in Ao, Sio-Iong; Gelman, Len; Kon Kim, Haeng, Berlin Heidelberg, Springer, 105-120 p.

Foucaud F., Gras B., Perez A., Sikora F. (2020), On the Complexity of Broadcast Domination and Multipacking in Digraphs, in Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik, Combinatorial Algorithms, 31st International Workshop, IWOCA 2020, Springer, 264-276 p.

Casel K., Fernau H., Khosravian Ghadikolaei M., Monnot J., Sikora F. (2019), Extension of Some Edge Graph Problems: Standard and Parameterized Complexity, in Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos, Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Springer International Publishing, 185-200 p.

Khoshkhah K., Khosravian Ghadikolaei M., Monnot J., Sikora F. (2019), Weighted Upper Edge Cover: Complexity and Approximability, in Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano, WALCOM: Algorithms and Computation, Springer International Publishing, 235-247 p.

Casel K., Fernau H., Khosravian Ghadikolaei M., Monnot J., Sikora F. (2019), Extension of Vertex Cover and Independent Set in Some Classes of Graphs, in Pinar Heggernes, Algorithms and Complexity, Springer International Publishing, 124-136 p.

Belmonte R., Kim E., Lampis M., Mitsou V., Otachi Y., Sikora F. (2019), Token Sliding on Split Graphs, in Rolf Niedermeier, Christophe Paul, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 13:1--13:17 p.

Dondi R., Mauri G., Sikora F., Zoppis I. (2018), Covering with Clubs: Complexity and Approximability, in Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung, Combinatorial Algorithms, 29th International Workshop, IWOCA 2018, Springer International Publishing, 153-164 p.

Bonnet E., Rzążewski P., Sikora F. (2018), Designing RNA Secondary Structures Is Hard, in Benjamin J. Raphael, Research in Computational Molecular Biology - 22nd Annual International Conference (RECOMB 2018), Springer, 248-250 p.

Hanaka T., Katsikarelis I., Lampis M., Otachi Y., Sikora F. (2018), Parameterized Orientable Deletion, in David Eppstein, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 24:1-24:13 p.

Bonnet E., Giannopoulos P., Kim E., Rzazewski P., Sikora F. (2018), QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs, in Bettina Speckmann, Csaba D. Tóth, 34th International Symposium on Computational Geometry (SoCG 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 12:1-12:15 p.

Bonnet E., Sikora F. (2018), The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration, in Christophe Paul, Michal Pilipczuk, 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 26:1-26:15 p.

Dondi R., Sikora F. (2016), Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis, in T-H. Hubert Chan, Minming Li, Lusheng Wang, Combinatorial Optimization and Applications 10th International Conference, COCOA 2016, Springer, 113-127 p.

Dondi R., Sikora F. (2016), Parameterized Complexity and Approximation Issues for the Colorful Components Problems, in Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska, Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings, Springer, 261-270 p.

Bazgan C., Foucaud F., Sikora F. (2016), On the Approximability of Partial VC Dimension, in T-H. Hubert Chan, Minming Li, Lusheng Wang, Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Berlin Heidelberg, Springer, 92-106 p.

Abu-Khzam F., Bonnet E., Sikora F. (2015), On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism, in Kratochvíl Jan, Mirka Miller, Dalibor Froncek, Combinatorial Algorithms. 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers, Springer, 1-12 p.

Abu-Khzam F., Bazgan C., El Haddad J., Sikora F. (2015), On the Complexity of QoS-Aware Service Selection Problem, in Alistair Barros, Daniela Grigori, Nanjangud C. Narendra, Hoa Khanh Dam, Service-Oriented Computing. 13th International Conference, ICSOC 2015, Goa, India, November 16-19, 2015, Proceedings, Springer, 345-352 p.

Bonnet E., Sikora F. (2015), The Graph Motif Problem Parameterized by the Structure of the Input Graph, in Thore Husfeldt and Iyad Kanj, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 319--330 p.

Bonnet E., Foucaud F., Kim E., Sikora F. (2015), Complexity of Grundy Coloring and Its Variants, in Dachuan Xu, Donglei Du, Dingzhu Du, Computing and Combinatorics. 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings, Springer, 109-120 p.

Bazgan C., Chopin M., Nichterlein A., Sikora F. (2014), Parameterized Inapproximability of Target Set Selection and Generalizations, in Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer, Language, Life, Limits.10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings, Berlin Heidelberg, Springer, 11-20 p.

Bazgan C., Chopin M., Nichterlein A., Sikora F. (2013), Parameterized Approximability of Maximizing the Spread of Influence in Networks, in Ding-Zhu Du, Guochuan Zhang, Computing and Combinatorics. 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings, Berlin Heidelberg, Springer, 543-554 p.

Rizzi R., Sikora F. (2012), Some Results on more Flexible Versions of Graph Motif, in Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii, Computer Science – Theory and Applications. 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings, Springer, 278-289 p.

Blin G., Bonizzoni P., Dondi R., Rizzi R., Sikora F. (2012), Complexity Insights of the Minimum Duplication Problem, in Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán, 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, Springer, 153-164 p.

Yang X., Sikora F., Blin G., Hamel S., Rizzi R., Aluru S. (2012), An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval, in Manindra Agrawal, S. Barry Cooper, Angsheng Li, Theory and Applications of Models of Computation. 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings, Springer, 319-329 p.

Blin G., Fertin G., Mohamed-Babou H., Rusu I., Sikora F., Vialette S. (2011), Algorithmic Aspects of Heterogeneous Biological Networks Comparison, in Weifan Wang, Xuding Zhu, Ding-Zhu Du, Combinatorial Optimization and Applications. 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings, Springer, 272-286 p.

Guillemot S., Sikora F. (2010), Finding and Counting Vertex-Colored Subtrees, in Petr Hliněný, Antonín Kučera, Mathematical Foundations of Computer Science 2010. 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, Springer, 405-416 p.

Blin G., Fertin G., Sikora F., Vialette S. (2009), The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated, in Sandip Das, Ryuhei Uehara, WALCOM: Algorithms and Computation. Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, Springer, 357-368 p.

Blin G., Sikora F., Vialette S. (2009), Querying Protein-Protein Interaction Networks, in Ion Măndoiu, Giri Narasimhan, Yanqing Zhang, Bioinformatics Research and Applications. 5th International Symposium, ISBRA 2009 Fort Lauderdale, FL, USA, May 13-16, 2009 Proceedings, Springer, 52-62 p.

Communications sans actes

Casel K., Fernau H., Khosravian Ghadikolaei M., Monnot J., Sikora F. (2021), Abundant Extensions, Algorithms and Complexity - 12th International Conference, CIAC 2021, Italie

Sikora F., Dondi R. (2021), The Longest Run Subsequence Problem: Further Complexity Results, 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Wrocław, Pologne