|
|
Generalizing Roberts' Characterization of Unit Interval Graphs
Virginia Ardévol Martínez
,
Romeo Rizzi
,
Abdallah Saffidine
,
Florian Sikora
,
Stéphane Vialette
49th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. ⟨10.4230/LIPICS.MFCS.2024.12⟩
Communication dans un congrès
hal-04698633
v1
|
|
|
Parity Permutation Pattern Matching
Virginia Ardévol Martínez
,
Florian Sikora
,
Stéphane Vialette
Communication dans un congrès
hal-03922884
v1
|
|
|
Hardness of Balanced Mobiles
Virginia Ardévol Martínez
,
Romeo Rizzi
,
Florian Sikora
34th International Workshop on Combinatorial Algorithms (IWOCA 2023), Jun 2023, Tainan, Taiwan
Communication dans un congrès
hal-04054238
v1
|
|
|
Recognizing Unit Multiple Intervals Is Hard
Virginia Ardévol Martínez
,
Florian Sikora
,
Romeo Rizzi
,
Stéphane Vialette
Communication dans un congrès
hal-04485941
v1
|
|
|
Neural Maximum Independent Set
Thomas Pontoizeau
,
Florian Sikora
,
Florian Yger
,
Tristan Cazenave
Communication dans un congrès
hal-03583715
v1
|
|
|
Graph Homomorphism Features: Why Not Sample?
Paul Beaujean
,
Florian Sikora
,
Florian Yger
Communication dans un congrès
hal-03583713
v1
|
|
|
Abundant Extensions
Katrin Casel
,
Henning Fernau
,
Mehdi Khosravian Ghadikolaei
,
Jérôme Monnot
,
Florian Sikora
Communication dans un congrès
hal-03457150
v1
|
|
|
The Longest Run Subsequence Problem: Further Complexity Results
Florian Sikora
,
Riccardo Dondi
Communication dans un congrès
hal-03457156
v1
|
|
|
On the Complexity of Broadcast Domination and Multipacking in Digraphs
Florent Foucaud
,
Benjamin Gras
,
Anthony Perez
,
Florian Sikora
Communication dans un congrès
hal-02793880
v1
|
|
|
Arc Routing Based on the Zero-Suppressed Binary Decision Diagram
Renzo Roel P. Tan
,
Florian Sikora
,
Kazushi Ikeda
,
Kyle Stephen S. See
Communication dans un congrès
hal-03217109
v1
|
|
|
Monte Carlo Graph Coloring
Tristan Cazenave
,
Benjamin Negrevergne
,
Florian Sikora
Monte Carlo Search 2020, IJCAI Workshop, 2020, Yokohama (virtual), Japan
Communication dans un congrès
hal-03118170
v1
|
|
|
Grundy Coloring & Friends, Half-Graphs, Bicliques
Pierre Aboulker
,
Edouard Bonnet
,
Eun Jung Kim
,
Florian Sikora
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⟩
Communication dans un congrès
hal-02794004
v1
|
|
|
Weighted Upper Edge Cover: Complexity and Approximability
Kaveh Khoshkhah
,
Mehdi Khosravian Ghadikolaei
,
Jérôme Monnot
,
Florian Sikora
Communication dans un congrès
hal-02184878
v1
|
|
|
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
Katrin Casel
,
Henning Fernau
,
Mehdi Khosravian Ghadikolaei
,
Jérôme Monnot
,
Florian Sikora
Communication dans un congrès
hal-02310662
v1
|
|
|
Token Sliding on Split Graphs
Rémy Belmonte
,
Eun Jung Kim
,
Michael Lampis
,
Valia Mitsou
,
Yota Otachi
et al.
STACS 2019, Mar 2019, Berlin, Germany
Communication dans un congrès
hal-03107597
v1
|
|
|
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
Katrin Casel
,
Henning Fernau
,
Mehdi Khosravian Ghadikolaei
,
Jérôme Monnot
,
Florian Sikora
Communication dans un congrès
hal-02184942
v1
|
|
|
Designing RNA Secondary Structures is Hard
Edouard Bonnet
,
Paweł Rzążewski
,
Florian Sikora
RECOMB 2018, Apr 2018, Paris, France
Communication dans un congrès
hal-01991541
v1
|
|
|
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration
Edouard Bonnet
,
Florian Sikora
Communication dans un congrès
hal-01991645
v1
|
|
|
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
Edouard Bonnet
,
Panos Giannopoulos
,
Eun Jung Kim
,
Paweł Rzążewski
,
Florian Sikora
Communication dans un congrès
hal-01991635
v1
|
|
|
Covering with Clubs: Complexity and Approximability
Riccardo Dondi
,
Giancarlo Mauri
,
Florian Sikora
,
Italo Zoppis
Communication dans un congrès
hal-02074964
v1
|
|
|
Parameterized Orientable Deletion
Tesshu Hanaka
,
Ioannis Katsikarelis
,
Michael Lampis
,
Yota Otachi
,
Florian Sikora
SWAT 2018, Jun 2018, Malmö, Sweden. pp.24:1-24:13
Communication dans un congrès
hal-02075097
v1
|
|
|
Designing RNA Secondary Structures Is Hard
Edouard Bonnet
,
Pawel Rzążewski
,
Florian Sikora
Communication dans un congrès
hal-02075335
v1
|
|
|
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
Riccardo Dondi
,
Florian Sikora
Communication dans un congrès
hal-01505495
v1
|
|
|
On the Approximability of Partial VC Dimension
Cristina Bazgan
,
Florent Foucaud
,
Florian Sikora
Communication dans un congrès
hal-01431728
v1
|
|
|
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis
Riccardo Dondi
,
Florian Sikora
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⟩
Communication dans un congrès
hal-01503469
v1
|
|
|
The Graph Motif Problem Parameterized by the Structure of the Input Graph
Edouard Bonnet
,
Florian Sikora
10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.319--330, ⟨10.4230/LIPIcs.IPEC.2015.319⟩
Communication dans un congrès
hal-01505505
v1
|
|
|
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Faisal N. Abu-Khzam
,
Edouard Bonnet
,
Florian Sikora
Communication dans un congrès
hal-01366670
v1
|
|
|
On the Complexity of QoS-Aware Service Selection Problem
Faisal N. Abu-Khzam
,
Cristina Bazgan
,
Joyce El Haddad
,
Florian Sikora
Communication dans un congrès
hal-01505504
v1
|
|
|
Complexity of Grundy Coloring and Its Variants
Edouard Bonnet
,
Florent Foucaud
,
Eun Jung Kim
,
Florian Sikora
Communication dans un congrès
hal-01370531
v1
|
|
|
Parameterized Inapproximability of Target Set Selection and Generalizations
Cristina Bazgan
,
Morgan Chopin
,
André Nichterlein
,
Florian Sikora
Communication dans un congrès
hal-01388129
v1
|
|
|
On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem
Guillaume Blin
,
Paola Bonizzoni
,
Riccardo Dondi
,
Florian Sikora
International Workshop on Approximation, Parameterized and EXact algorithms (APEX'13), Jul 2013, Riga, Latvia. 3 pp
Communication dans un congrès
hal-00949104
v1
|
|
|
Parameterized Approximability of Maximizing the Spread of Influence in Networks
Cristina Bazgan
,
Morgan Chopin
,
André Nichterlein
,
Florian Sikora
Communication dans un congrès
hal-01366676
v1
|
|
|
Complexity Insights of the Minimum Duplication Problem
Guillaume Blin
,
Paola Bonizzoni
,
Riccardo Dondi
,
Romeo Rizzi
,
Florian Sikora
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
Communication dans un congrès
hal-00629047
v1
|
|
|
An algorithmic view on multi-related-segments: A unifying model for approximate common interval
Xiao Yang
,
Florian Sikora
,
Guillaume Blin
,
Sylvie Hamel
,
Roméo Rizzi
et al.
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⟩
Communication dans un congrès
hal-00630150
v2
|
|
|
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Guillaume Blin
,
Guillaume Fertin
,
Hafedh Mohamed-Babou
,
Irena Rusu
,
Florian Sikora
et al.
Communication dans un congrès
hal-00606375
v1
|
|
|
Minimum Mosaic Inference of a Set of Recombinants
Guillaume Blin
,
Romeo Rizzi
,
Florian Sikora
,
Stéphane Vialette
17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Communication dans un congrès
hal-00620371
v1
|
|
|
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks
Guillaume Blin
,
Florian Sikora
,
Stéphane Vialette
Bioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
Communication dans un congrès
hal-00425661
v1
|
|
|
Finding and counting vertex-colored subtrees
Sylvain Guillemot
,
Florian Sikora
International Symposium on Mathematical Foundations of Computer Science (MFCS), Jun 2010, Brno, Czech Republic. pp.405-416
Communication dans un congrès
hal-00455134
v3
|
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated
Guillaume Blin
,
Guillaume Fertin
,
Florian Sikora
,
Stéphane Vialette
WALCOM 2009, 2009, Kolkata, India. pp.357-368
Communication dans un congrès
hal-00416491
v1
|
|
|
Querying Protein-Protein Interaction Networks
Guillaume Blin
,
Florian Sikora
,
Stéphane Vialette
5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Communication dans un congrès
hal-00620391
v1
|