- 36
- 16
- 10
- 4
- 2
- 1
- 1
Florian Sikora
70
Documents
Présentation
See also [www.lamsade.dauphine.fr/~sikora/](https://www.lamsade.dauphine.fr/~sikora/)
Publications
- 13
- 6
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 13
- 13
- 11
- 9
- 7
- 7
- 6
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 1
- 8
- 9
- 6
- 10
- 2
- 6
- 4
- 5
- 3
- 3
- 3
- 3
- 2
|
|
Hardness of Balanced Mobiles34th International Workshop on Combinatorial Algorithms (IWOCA 2023), Jun 2023, Tainan, Taiwan
Communication dans un congrès
hal-04054238v1
|
|
|
Parity Permutation Pattern MatchingWALCOM, Mar 2023, Hsinchu, Taiwan
Communication dans un congrès
hal-03922884v1
|
|
|
Recognizing Unit Multiple Intervals Is Hard34th International Symposium on Algorithms and Computation (ISAAC 2023), Dec 2023, Kyoto, Japan. ⟨10.4230/LIPIcs.ISAAC.2023.8⟩
Communication dans un congrès
hal-04485941v1
|
The Longest Run Subsequence Problem: Further Complexity Results32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wrocław, Poland. ⟨10.4230/LIPIcs.CPM.2021.14⟩
Communication dans un congrès
hal-03457156v1
|
|
Neural Maximum Independent SetMachine Learning and Principles and Practice of Knowledge Discovery in Databases, Sep 2021, Bilbao, Spain. pp.223-237, ⟨10.1007/978-3-030-93736-2_18⟩
Communication dans un congrès
hal-03583715v1
|
|
Abundant ExtensionsAlgorithms and Complexity (CIAC), May 2021, Virtual, Italy. pp.3-19, ⟨10.1007/978-3-030-75242-2_1⟩
Communication dans un congrès
hal-03457150v1
|
|
Graph Homomorphism Features: Why Not Sample?Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Sep 2021, Bilbao, Spain. pp.216-222, ⟨10.1007/978-3-030-93736-2_17⟩
Communication dans un congrès
hal-03583713v1
|
|
|
|
Grundy Coloring & Friends, Half-Graphs, Bicliques37th 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-02794004v1
|
On the Complexity of Broadcast Domination and Multipacking in DigraphsCombinatorial Algorithms - 31st International Workshop, Jun 2020, Bordeaux, France. pp.264-276, ⟨10.1007/978-3-030-48966-3_20⟩
Communication dans un congrès
hal-02793880v1
|
|
|
|
Monte Carlo Graph ColoringMonte Carlo Search 2020, IJCAI Workshop, 2020, Yokohama (virtual), Japan
Communication dans un congrès
hal-03118170v1
|
Arc Routing Based on the Zero-Suppressed Binary Decision DiagramTransactions on Engineering Technologies, Oct 2020, Singapore, Singapore. pp.105-120, ⟨10.1007/978-981-15-8273-8_9⟩
Communication dans un congrès
hal-03217109v1
|
|
|
|
Extension of Vertex Cover and Independent Set in Some Classes of Graphs11th International Conference, CIAC 2019, May 2019, Rome, Italy. pp.124-136, ⟨10.1007/978-3-030-17402-6_11⟩
Communication dans un congrès
hal-02184942v1
|
|
|
Weighted Upper Edge Cover: Complexity and Approximability13th International Conference, WALCOM 2019, Feb 2019, Guwahati, India. pp.235-247, ⟨10.1007/978-3-030-10564-8_19⟩
Communication dans un congrès
hal-02184878v1
|
Token Sliding on Split GraphsSTACS 2019, Mar 2019, Berlin, Germany
Communication dans un congrès
hal-03107597v1
|
|
|
|
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity22nd International Symposium, FCT 2019, Aug 2019, Copenhagen, Denmark. pp.185-200, ⟨10.1007/978-3-030-25027-0_13⟩
Communication dans un congrès
hal-02310662v1
|
|
|
QPTAS and Subexponential Algorithm for Maximum Clique on Disk GraphsSoCG 2018, Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs⟩
Communication dans un congrès
hal-01991635v1
|
|
|
Covering with Clubs: Complexity and Approximability29th International Workshop on Combinatorial Algorithms (IWOCA 2018), Jul 2018, Singapore, Singapore. pp.153-164, ⟨10.1007/978-3-319-94667-2_13⟩
Communication dans un congrès
hal-02074964v1
|
|
|
Parameterized Orientable DeletionSWAT 2018, Jun 2018, Malmö, Sweden. pp.24:1-24:13
Communication dans un congrès
hal-02075097v1
|
|
|
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third IterationIPEC 2018, Aug 2018, Helsinki, Finland. ⟨10.4230/LIPIcs.IPEC.2018.26⟩
Communication dans un congrès
hal-01991645v1
|
|
|
Designing RNA Secondary Structures is HardRECOMB 2018, Apr 2018, Paris, France
Communication dans un congrès
hal-01991541v1
|
|
|
Designing RNA Secondary Structures Is HardRECOMB 2018, Apr 2018, Paris, France. pp.248-250, ⟨10.1007/978-3-319-89929-9⟩
Communication dans un congrès
hal-02075335v1
|
Parameterized Complexity and Approximation Issues for the Colorful Components Problems12th Conference on Computability in Europe, CiE 2016, Jun 2016, Paris, France. pp.261-270, ⟨10.1007/978-3-319-40189-8_27⟩
Communication dans un congrès
hal-01505495v1
|
|
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis10th 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-01503469v1
|
|
On the Approximability of Partial VC Dimension10th International Conference, COCOA 2016, Dec 2016, Hong Kong, China. pp.92-106, ⟨10.1007/978-3-319-48749-6_7⟩
Communication dans un congrès
hal-01431728v1
|
|
Complexity of Grundy Coloring and Its Variants21st International Conference on Computing and Combinatorics, COCOON 2015, Aug 2015, Beijing, China. pp.109-120, ⟨10.1007/978-3-319-21398-9_9⟩
Communication dans un congrès
hal-01370531v1
|
|
|
|
The Graph Motif Problem Parameterized by the Structure of the Input Graph10th 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-01505505v1
|
On the Complexity of QoS-Aware Service Selection Problem13th International Conference on Service-Oriented Computing, ICSOC 2015, Nov 2015, Goa, India. pp.345-352, ⟨10.1007/978-3-662-48616-0_23⟩
Communication dans un congrès
hal-01505504v1
|
|
Parameterized Inapproximability of Target Set Selection and Generalizations10th Conference on Computability in Europe, CiE 2014, Jun 2014, Budapest, Hungary. pp.11-20, ⟨10.1007/978-3-319-08019-2_2⟩
Communication dans un congrès
hal-01388129v1
|
|
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism25th International Workshop on Combinatorial Algorithms, IWOCA 2014, Oct 2014, Duluth, United States. pp.1-12, ⟨10.1007/978-3-319-19315-1_1⟩
Communication dans un congrès
hal-01366670v1
|
|
On the Parameterized Complexity of the Repetition Free Longest Common Subsequence ProblemInternational Workshop on Approximation, Parameterized and EXact algorithms (APEX'13), Jul 2013, Riga, Latvia. 3 pp
Communication dans un congrès
hal-00949104v1
|
|
Parameterized Approximability of Maximizing the Spread of Influence in Networks19th International Conference on Computing and Combinatorics, COCOON 2013, Jun 2013, Hangzhou, China. pp.543-554, ⟨10.1007/978-3-642-38768-5_48⟩
Communication dans un congrès
hal-01366676v1
|
|
|
|
An algorithmic view on multi-related-segments: A unifying model for approximate common interval9th 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-00630150v2
|
|
|
Complexity Insights of the Minimum Duplication Problem38th 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-00629047v1
|
|
|
Algorithmic Aspects of Heterogeneous Biological Networks ComparisonCOCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩
Communication dans un congrès
hal-00606375v1
|
|
|
Minimum Mosaic Inference of a Set of Recombinants17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Communication dans un congrès
hal-00620371v1
|
|
|
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networksBioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
Communication dans un congrès
hal-00425661v1
|
|
|
Finding and counting vertex-colored subtreesInternational Symposium on Mathematical Foundations of Computer Science (MFCS), Jun 2010, Brno, Czech Republic. pp.405-416
Communication dans un congrès
hal-00455134v3
|
Querying Protein-Protein Interaction Networks5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Communication dans un congrès
hal-00620391v1
|
|
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximatedWALCOM 2009, 2009, Kolkata, India. pp.357-368
Communication dans un congrès
hal-00416491v1
|
Analyse de séquences : des méthodes combinatoires et algorithmiquesÉtienne Baudrier, Loïc Mazo. Informatique Mathématique - Une photographie en 2016, , pp.57-87, 2016, 978-2-271-09335-6
Chapitre d'ouvrage
hal-01296618v1
|
|
|
Aspects algorithmiques de la comparaison d'éléments biologiquesSciences agricoles. Université Paris-Est, 2011. Français. ⟨NNT : 2011PEST1048⟩
Thèse
pastel-00667797v1
|