Florian Sikora
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
29
Venues
16
Active years
2009–2024
Best venue rank
C
Where they publish
Papers
29 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | MFCS | Generalizing Roberts' Characterization of Unit Interval Graphs. | Virginia Ardvol Martnez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stphane Vialette |
| 2023 | ISAAC | Recognizing Unit Multiple Intervals Is Hard. | Virginia Ardvol Martnez, Romeo Rizzi, Florian Sikora, Stphane Vialette |
| 2023 | IWOCA | Hardness of Balanced Mobiles. | Virginia Ardvol Martnez, Romeo Rizzi, Florian Sikora |
| 2023 | WALCOM | Parity Permutation Pattern Matching. | Virginia Ardvol Martnez, Florian Sikora, Stphane Vialette |
| 2021 | CIAC | Abundant Extensions. | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2021 | CPM | The Longest Run Subsequence Problem: Further Complexity Results. | Riccardo Dondi, Florian Sikora |
| 2020 | IWOCA | On the Complexity of Broadcast Domination and Multipacking in Digraphs. | Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora |
| 2020 | STACS | Grundy Coloring & Friends, Half-Graphs, Bicliques. | Pierre Aboulker, douard Bonnet, Eun Jung Kim, Florian Sikora |
| 2019 | CIAC | Extension of Vertex Cover and Independent Set in Some Classes of Graphs. | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2019 | FCT | Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2019 | STACS | Token Sliding on Split Graphs. | Rmy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora |
| 2019 | WALCOM | Weighted Upper Edge Cover: Complexity and Approximability. | Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2019 | WALCOM | Correction to: Weighted Upper Edge Cover: Complexity and Approximability. | Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2018 | IWOCA | Covering with Clubs: Complexity and Approximability. | Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis |
| 2018 | RECOMB | Designing RNA Secondary Structures Is Hard. | douard Bonnet, Pawel Rzazewski, Florian Sikora |
| 2016 | CiE | Parameterized Complexity and Approximation Issues for the Colorful Components Problems. | Riccardo Dondi, Florian Sikora |
| 2016 | COCOA | On the Approximability of Partial VC Dimension. | Cristina Bazgan, Florent Foucaud, Florian Sikora |
| 2016 | COCOA | Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. | Riccardo Dondi, Florian Sikora |
| 2015 | COCOON | Complexity of Grundy Coloring and Its Variants. | Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora |
| 2015 | ICSOC | On the Complexity of QoS-Aware Service Selection Problem. | Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora |
| 2014 | CiE | Parameterized Inapproximability of Target Set Selection and Generalizations. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora |
| 2014 | IWOCA | On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. | Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora |
| 2013 | COCOON | Parameterized Approximability of Maximizing the Spread of Influence in Networks. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora |
| 2012 | CSR | Some Results on more Flexible Versions of Graph Motif. | Romeo Rizzi, Florian Sikora |
| 2012 | SOFSEM | Complexity Insights of the Minimum Duplication Problem. | Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora |
| 2012 | TAMC | An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. | Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru |
| 2011 | COCOA | Algorithmic Aspects of Heterogeneous Biological Networks Comparison. | Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stphane Vialette |
| 2010 | MFCS | Finding and Counting Vertex-Colored Subtrees. | Sylvain Guillemot, Florian Sikora |
| 2009 | WALCOM | The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. | Guillaume Blin, Guillaume Fertin, Florian Sikora, Stphane Vialette |