default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Sikora
Person information
- affiliation: Université Paris Dauphine, France
- affiliation (PhD 2011): University Paris-Est Marne-la-Vallée, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j28]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora
, Stéphane Vialette:
Recognizing unit multiple interval graphs is hard. Discret. Appl. Math. 360: 258-274 (2025)- 2024
- [j27]Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette:
Parity Permutation Pattern Matching. Algorithmica 86(8): 2605-2624 (2024) - [c38]Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette:
Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS 2024: 12:1-12:15 - [i29]Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette:
Generalizing Roberts' characterization of unit interval graphs. CoRR abs/2404.17872 (2024) - [i28]Zixu He, Sirin Botan, Jérôme Lang, Abdallah Saffidine, Florian Sikora, Silas Workman:
Fair Railway Network Design. CoRR abs/2409.02152 (2024) - 2023
- [j26]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica 85(1): 1-28 (2023) - [j25]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. 340: 183-201 (2023) - [c37]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing Unit Multiple Intervals Is Hard. ISAAC 2023: 8:1-8:18 - [c36]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora:
Hardness of Balanced Mobiles. IWOCA 2023: 25-35 - [c35]Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette:
Parity Permutation Pattern Matching. WALCOM 2023: 384-395 - [i27]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing unit multiple intervals is hard. CoRR abs/2309.11908 (2023) - 2022
- [j24]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
On the complexity of solution extension of optimization problems. Theor. Comput. Sci. 904: 48-65 (2022) - 2021
- [j23]Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora:
On the Complexity of Broadcast Domination and Multipacking in Digraphs. Algorithmica 83(9): 2651-2677 (2021) - [j22]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68(2): 9:1-9:38 (2021) - [j21]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. Theory Comput. Syst. 65(4): 662-686 (2021) - [c34]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Abundant Extensions. CIAC 2021: 3-17 - [c33]Riccardo Dondi, Florian Sikora:
The Longest Run Subsequence Problem: Further Complexity Results. CPM 2021: 14:1-14:15 - [c32]Paul Beaujean, Florian Sikora, Florian Yger:
Graph Homomorphism Features: Why Not Sample? PKDD/ECML Workshops (1) 2021: 216-222 - [c31]Thomas Pontoizeau, Florian Sikora, Florian Yger, Tristan Cazenave:
Neural Maximum Independent Set. PKDD/ECML Workshops (1) 2021: 223-237 - [e2]Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong:
SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings. Lecture Notes in Computer Science 12607, Springer 2021, ISBN 978-3-030-67730-5 [contents] - [i26]Paul Beaujean, Florian Sikora, Florian Yger:
Scaling up graph homomorphism for classification via sampling. CoRR abs/2104.04040 (2021) - [i25]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR abs/2110.15419 (2021) - 2020
- [j20]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. Algorithmica 82(7): 1909-1938 (2020) - [j19]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures Is Hard. J. Comput. Biol. 27(3): 302-316 (2020) - [j18]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. J. Graph Algorithms Appl. 24(2): 65-88 (2020) - [c30]Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora:
On the Complexity of Broadcast Domination and Multipacking in Digraphs. IWOCA 2020: 264-276 - [c29]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS 2020: 58:1-58:18 - [e1]Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora:
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings. Lecture Notes in Computer Science 12011, Springer 2020, ISBN 978-3-030-38918-5 [contents] - [i24]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR abs/2001.03794 (2020) - [i23]Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora:
On the complexity of Broadcast Domination and Multipacking in digraphs. CoRR abs/2003.10570 (2020) - [i22]Riccardo Dondi, Florian Sikora:
The Longest Run Subsequence Problem: Further Complexity Results. CoRR abs/2011.08119 (2020)
2010 – 2019
- 2019
- [j17]Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis:
Covering a Graph with Clubs. J. Graph Algorithms Appl. 23(2): 271-292 (2019) - [j16]Cristina Bazgan, Florent Foucaud, Florian Sikora:
Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. 766: 1-15 (2019) - [c28]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. CIAC 2019: 124-136 - [c27]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT 2019: 185-200 - [c26]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. STACS 2019: 13:1-13:17 - [c25]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019: 235-247 - [c24]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019 - 2018
- [j15]Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243: 99-114 (2018) - [j14]Riccardo Dondi, Florian Sikora:
Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36(4): 1315-1332 (2018) - [j13]Riccardo Dondi, Florian Sikora:
Parameterized complexity and approximation issues for the colorful components problems. Theor. Comput. Sci. 739: 1-12 (2018) - [c23]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018: 12:1-12:15 - [c22]Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis:
Covering with Clubs: Complexity and Approximability. IWOCA 2018: 153-164 - [c21]Édouard Bonnet, Florian Sikora:
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. IPEC 2018: 26:1-26:15 - [c20]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures Is Hard. RECOMB 2018: 248-250 - [c19]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. SWAT 2018: 24:1-24:13 - [i21]Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis:
Covering with Clubs: Complexity and Approximability. CoRR abs/1806.01119 (2018) - [i20]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. CoRR abs/1807.05322 (2018) - [i19]Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. CoRR abs/1807.11518 (2018) - [i18]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
On the Complexity of Solution Extension of Optimization Problems. CoRR abs/1810.04553 (2018) - [i17]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 and generalizations. CoRR abs/1810.04629 (2018) - [i16]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. CoRR abs/1811.02599 (2018) - 2017
- [j12]Édouard Bonnet, Florian Sikora:
The Graph Motif problem parameterized by the structure of the input graph. Discret. Appl. Math. 231: 78-94 (2017) - [j11]Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora:
On the complexity of various parameterizations of common induced subgraph isomorphism. Theor. Comput. Sci. 697: 69-78 (2017) - [i15]Florian Sikora:
The shortest way to visit all metro lines in Paris. CoRR abs/1709.05948 (2017) - [i14]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures is Hard. CoRR abs/1710.11513 (2017) - [i13]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR abs/1712.05010 (2017) - 2016
- [j10]Édouard Bonnet, Florian Sikora:
A Note on Edge Isoperimetric Numbers and Regular Graphs. Int. J. Found. Comput. Sci. 27(6): 771-774 (2016) - [j9]Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora:
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems. RAIRO Theor. Informatics Appl. 50(3): 227-240 (2016) - [c18]Riccardo Dondi, Florian Sikora:
Parameterized Complexity and Approximation Issues for the Colorful Components Problems. CiE 2016: 261-270 - [c17]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. COCOA 2016: 92-106 - [c16]Riccardo Dondi, Florian Sikora:
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. COCOA 2016: 113-127 - [i12]Edouard Bonnet, Florian Sikora:
A note on Edge Isoperimetric Numbers and Regular Graphs. CoRR abs/1601.05190 (2016) - [i11]Riccardo Dondi, Florian Sikora:
Parameterized Complexity and Approximation Issues for the Colorful Components Problems. CoRR abs/1605.03071 (2016) - [i10]Riccardo Dondi, Florian Sikora:
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis. CoRR abs/1609.04951 (2016) - [i9]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. CoRR abs/1609.05110 (2016) - 2015
- [j8]Romeo Rizzi, Florian Sikora:
Some Results on More Flexible Versions of Graph Motif. Theory Comput. Syst. 56(4): 612-629 (2015) - [c15]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy Coloring and Its Variants. COCOON 2015: 109-120 - [c14]Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora:
On the Complexity of QoS-Aware Service Selection Problem. ICSOC 2015: 345-352 - [c13]Edouard Bonnet, Florian Sikora:
The Graph Motif Problem Parameterized by the Structure of the Input Graph. IPEC 2015: 319-330 - [i8]Edouard Bonnet, Florian Sikora:
The parameterized complexity of Graph Motif relatively to the structure of the input graph. CoRR abs/1503.05110 (2015) - 2014
- [j7]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. Comput. 3(2): 135-145 (2014) - [j6]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27: 54-65 (2014) - [j5]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity insights of the Minimum Duplication problem. Theor. Comput. Sci. 530: 66-79 (2014) - [c12]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CiE 2014: 11-20 - [c11]Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora:
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. IWOCA 2014: 1-12 - [i7]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CoRR abs/1403.3565 (2014) - [i6]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. CoRR abs/1407.5336 (2014) - [i5]Faisal N. Abu-Khzam, Edouard Bonnet, Florian Sikora:
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism. CoRR abs/1412.1261 (2014) - 2013
- [j4]Sylvain Guillemot, Florian Sikora:
Finding and Counting Vertex-Colored Subtrees. Algorithmica 65(4): 828-844 (2013) - [j3]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. Int. J. Found. Comput. Sci. 24(1): 51-66 (2013) - [c10]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. COCOON 2013: 543-554 - [i4]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. CoRR abs/1303.6907 (2013) - [i3]Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora:
Multiparameterizations for max $k$-set cover and related satisfiability problems. CoRR abs/1309.4718 (2013) - 2012
- [j2]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): 272-276 (2012) - [c9]Romeo Rizzi, Florian Sikora:
Some Results on more Flexible Versions of Graph Motif. CSR 2012: 278-289 - [c8]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164 - [c7]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 - [i2]Romeo Rizzi, Florian Sikora:
Some results on more flexible versions of Graph Motif. CoRR abs/1202.5184 (2012) - 2011
- [b1]Florian Sikora:
Aspects algorithmiques de la comparaison d'éléments biologiques. (Algorithmics aspects of biological entities comparison). University of Paris-Est, France, 2011 - [c6]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30 - [c5]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 - 2010
- [j1]Guillaume Blin, Florian Sikora, Stéphane Vialette:
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 628-635 (2010) - [c4]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 - [c3]Sylvain Guillemot, Florian Sikora:
Finding and Counting Vertex-Colored Subtrees. MFCS 2010: 405-416 - [i1]Sylvain Guillemot, Florian Sikora:
Finding and counting vertex-colored subtrees. CoRR abs/1002.1880 (2010)
2000 – 2009
- 2009
- [c2]Guillaume Blin, Florian Sikora, Stéphane Vialette:
Querying Protein-Protein Interaction Networks. ISBRA 2009: 52-62 - [c1]Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette:
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368
Coauthor Index
Édouard Bonnet
aka: Edouard Bonnet
aka: Edouard Bonnet
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
