Clik here to view.
The shortest way to visit all metro lines in Paris.
Florian Sikora: The shortest way to visit all metro lines in Paris. CoRR abs/1709.05948 (2017)
View ArticleClik here to view.
On the complexity of various parameterizations of common induced subgraph...
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)
View ArticleClik here to view.
The Graph Motif problem parameterized by the structure of the input graph.
Édouard Bonnet, Florian Sikora: The Graph Motif problem parameterized by the structure of the input graph. Discret. Appl. Math. 231: 78-94 (2017)
View ArticleClik here to view.
Weighted Upper Edge Cover: Complexity and Approximability.
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora: Weighted Upper Edge Cover: Complexity and Approximability. CoRR abs/1811.02599 (2018)
View ArticleClik here to view.
Extension of vertex cover and independent set in some classes of graphs and...
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...
View ArticleClik here to view.
On the Complexity of Solution Extension of Optimization Problems.
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)
View ArticleClik here to view.
Parameterized Orientable Deletion.
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora: Parameterized Orientable Deletion. CoRR abs/1807.11518 (2018)
View ArticleClik here to view.
Token Sliding on Split Graphs.
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora: Token Sliding on Split Graphs. CoRR abs/1807.05322 (2018)
View ArticleClik here to view.
Covering with Clubs: Complexity and Approximability.
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis: Covering with Clubs: Complexity and Approximability. CoRR abs/1806.01119 (2018)
View ArticleClik here to view.
Parameterized Orientable Deletion.
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora: Parameterized Orientable Deletion. SWAT 2018: 24:1-24:13
View ArticleClik here to view.
Designing RNA Secondary Structures Is Hard.
Édouard Bonnet, Pawel Rzazewski, Florian Sikora: Designing RNA Secondary Structures Is Hard. RECOMB 2018: 248-250
View ArticleClik here to view.
The PACE 2018 Parameterized Algorithms and Computational Experiments...
Édouard Bonnet, Florian Sikora: The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. IPEC 2018: 26:1-26:15
View ArticleClik here to view.
Covering with Clubs: Complexity and Approximability.
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis: Covering with Clubs: Complexity and Approximability. IWOCA 2018: 153-164
View ArticleClik here to view.
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.
É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
View ArticleClik here to view.
Parameterized complexity and approximation issues for the colorful components...
Riccardo Dondi, Florian Sikora: Parameterized complexity and approximation issues for the colorful components problems. Theor. Comput. Sci. 739: 1-12 (2018)
View ArticleClik here to view.
Finding disjoint paths on edge-colored graphs: more tractability results.
Riccardo Dondi, Florian Sikora: Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36(4): 1315-1332 (2018)
View ArticleClik here to view.
Complexity of Grundy coloring and its variants.
Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora: Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243: 99-114 (2018)
View ArticleClik here to view.
Correction to: Weighted Upper Edge Cover: Complexity and Approximability.
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora: Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019
View ArticleClik here to view.
Weighted Upper Edge Cover: Complexity and Approximability.
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019: 235-247
View ArticleClik here to view.
Token Sliding on Split Graphs.
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
View ArticleClik here to view.
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.
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
View ArticleClik here to view.
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: Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC 2019: 124-136
View ArticleClik here to view.
Parameterized and approximation complexity of Partial VC Dimension.
Cristina Bazgan, Florent Foucaud, Florian Sikora: Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. 766: 1-15 (2019)
View ArticleClik here to view.
Covering a Graph with Clubs.
Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis: Covering a Graph with Clubs. J. Graph Algorithms Appl. 23(2): 271-292 (2019)
View ArticleClik here to view.
The Longest Run Subsequence Problem: Further Complexity Results.
Riccardo Dondi, Florian Sikora: The Longest Run Subsequence Problem: Further Complexity Results. CoRR abs/2011.08119 (2020)
View ArticleClik here to view.
On the complexity of Broadcast Domination and Multipacking in digraphs.
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora: On the complexity of Broadcast Domination and Multipacking in digraphs. CoRR abs/2003.10570 (2020)
View ArticleClik here to view.
Grundy Coloring & friends, Half-Graphs, Bicliques.
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora: Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR abs/2001.03794 (2020)
View ArticleClik here to view.
SOFSEM 2020: Theory and Practice of Computer Science - 46th International...
Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora: SOFSEM 2020: Theory and Practice of Computer Science -...
View ArticleClik here to view.
Grundy Coloring & Friends, Half-Graphs, Bicliques.
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora: Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS 2020: 58:1-58:18
View ArticleClik here to view.
On the Complexity of Broadcast Domination and Multipacking in Digraphs.
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora: On the Complexity of Broadcast Domination and Multipacking in Digraphs. IWOCA 2020: 264-276
View ArticleClik here to view.
Weighted Upper Edge Cover: Complexity and Approximability.
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)
View ArticleClik here to view.
Designing RNA Secondary Structures Is Hard.
Édouard Bonnet, Pawel Rzazewski, Florian Sikora: Designing RNA Secondary Structures Is Hard. J. Comput. Biol. 27(3): 302-316 (2020)
View ArticleClik here to view.
Parameterized Orientable Deletion.
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora: Parameterized Orientable Deletion. Algorithmica 82(7): 1909-1938 (2020)
View ArticleClik here to view.
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball...
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...
View ArticleClik here to view.
Scaling up graph homomorphism for classification via sampling.
Paul Beaujean, Florian Sikora, Florian Yger: Scaling up graph homomorphism for classification via sampling. CoRR abs/2104.04040 (2021)
View ArticleClik here to view.
SOFSEM 2021: Theory and Practice of Computer Science - 47th International...
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...
View ArticleClik here to view.
Neural Maximum Independent Set.
Thomas Pontoizeau, Florian Sikora, Florian Yger, Tristan Cazenave: Neural Maximum Independent Set. PKDD/ECML Workshops (1) 2021: 223-237
View ArticleClik here to view.
Graph Homomorphism Features: Why Not Sample?
Paul Beaujean, Florian Sikora, Florian Yger: Graph Homomorphism Features: Why Not Sample? PKDD/ECML Workshops (1) 2021: 216-222
View ArticleClik here to view.
The Longest Run Subsequence Problem: Further Complexity Results.
Riccardo Dondi, Florian Sikora: The Longest Run Subsequence Problem: Further Complexity Results. CPM 2021: 14:1-14:15
View ArticleClik here to view.
Abundant Extensions.
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora: Abundant Extensions. CIAC 2021: 3-17
View ArticleClik here to view.
Token Sliding on Split Graphs.
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)
View ArticleClik here to view.
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball...
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...
View ArticleClik here to view.
On the Complexity of Broadcast Domination and Multipacking in Digraphs.
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora: On the Complexity of Broadcast Domination and Multipacking in Digraphs. Algorithmica 83(9): 2651-2677 (2021)
View ArticleClik here to view.
On the complexity of solution extension of optimization problems.
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)
View ArticleClik here to view.
Recognizing unit multiple intervals is hard.
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette: Recognizing unit multiple intervals is hard. CoRR abs/2309.11908 (2023)
View ArticleClik here to view.
Parity Permutation Pattern Matching.
Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette: Parity Permutation Pattern Matching. WALCOM 2023: 384-395
View ArticleClik here to view.
Hardness of Balanced Mobiles.
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora: Hardness of Balanced Mobiles. IWOCA 2023: 25-35
View ArticleClik here to view.
Recognizing Unit Multiple Intervals Is Hard.
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette: Recognizing Unit Multiple Intervals Is Hard. ISAAC 2023: 8:1-8:18
View ArticleClik here to view.
Extension of some edge graph problems: Standard, parameterized and...
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....
View ArticleClik here to view.
Grundy Coloring and Friends, Half-Graphs, Bicliques.
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora: Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica 85(1): 1-28 (2023)
View Article
