Florian Sikora

Lamsade — France

Computer Science · Physical Sciences

14h-index524citations91works0.62yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(50), Complexity and Algorithms in Graphs(27), Algorithms and Data Compression(14), Genome Rearrangement Algorithms(14), Graph Labeling and Dimension Problems(10)

Publications91 total

Monte Carlo Graph Coloring
2025Open Access
Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors
arXiv (Cornell University)·2025Open Access
Recognizing unit multiple interval graphs is hard
Discrete Applied Mathematics·2024Open Access
Fair Railway Network Design
arXiv (Cornell University)·2024Open Access
Parity permutation pattern matching
SPIRE - Sciences Po Institutional REpository·2024
Parity Permutation Pattern Matching
Algorithmica·2024
Multiple regulatory inputs including cell envelope stress orchestrate expression of the <i>Escherichia coli rpoN</i> operon
Molecular Microbiology·2024· 4 citedOpen Access
Generalizing Roberts' Characterization of Unit Interval Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2024Open Access
Generalizing Roberts' Characterization of Unit Interval Graphs
arXiv (Cornell University)·2024· 1 citedOpen Access
Extension of some edge graph problems: Standard, parameterized and approximation complexity
Discrete Applied Mathematics·2023· 1 citedOpen Access
Hardness of Balanced Mobiles
Lecture notes in computer science·2023Open Access
Recognizing Unit Multiple Intervals Is Hard
arXiv (Cornell University)·2023· 1 citedOpen Access
Parity Permutation Pattern Matching
Lecture notes in computer science·2023· 1 citedOpen Access
Grundy Coloring and Friends, Half-Graphs, Bicliques
Algorithmica·2022· 3 cited
On the complexity of solution extension of optimization problems
HAL (Le Centre pour la Communication Scientifique Directe)·2022· 18 citedOpen Access
On the complexity of solution extension of optimization problems
Theoretical Computer Science·2021· 10 citedOpen Access
Scaling up graph homomorphism for classification via sampling
arXiv (Cornell University)·2021Open Access
Scaling Up Graph Homomorphism Features with Efficient Data Structures
International Conference on Learning Representations·2021
The Longest Run Subsequence Problem: Further Complexity Results
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
Neural Maximum Independent Set
Communications in computer and information science·2021· 2 citedOpen Access
page 1 of 5Next →

Frequent Co-authors

Édouard Bonnet(10), Guillaume Blin(8), Cristina Bazgan(7), Jérôme Monnot(7), Riccardo Dondi(7), Stéphane Vialette(6), Eun Jung Kim(6), Henning Fernau(6), Katrin Casel(5), Morgan Chopin(4), André Nichterlein(4), Vangélis Th. Paschos(4), Roméo Rizzi(4), Mehdi Khosravian Ghadikolaei(4), Paola Bonizzoni(3), Mehdi Khosravian Ghadikolaei(3), Paweł Rzążewski(3), Sylvain Guillemot(2), Guillaume Fertin(2), Rémy Belmonte(2)