Florian Sikora

From MaRDI portal
Person:413297

Available identifiers

zbMath Open sikora.florianMaRDI QIDQ413297

List of research outcomes

PublicationDate of PublicationType
Hardness of \textsc{Balanced Mobiles}2023-12-22Paper
Parity permutation pattern matching2023-11-24Paper
Extension of some edge graph problems: standard, parameterized and approximation complexity2023-09-14Paper
https://portal.mardi4nfdi.de/entity/Q60987852023-06-14Paper
Grundy Coloring and friends, half-graphs, bicliques2023-04-21Paper
https://portal.mardi4nfdi.de/entity/Q58743352023-02-07Paper
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs2022-12-08Paper
On the Complexity of Broadcast Domination and Multipacking in Digraphs2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50904592022-07-18Paper
On the complexity of solution extension of optimization problems2022-02-01Paper
On the complexity of broadcast domination and multipacking In digraphs2021-09-02Paper
Token sliding on split graphs2021-08-05Paper
https://portal.mardi4nfdi.de/entity/Q50094902021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q51164882020-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51157792020-08-18Paper
Parameterized orientable deletion2020-05-21Paper
Weighted Upper Edge Cover: Complexity and Approximability2020-02-17Paper
Extension of Vertex Cover and Independent Set in some classes of graphs2020-02-06Paper
Extension of some edge graph problems: standard and parameterized complexity2020-01-30Paper
Correction to: ``Weighted upper edge cover: complexity and approximability2019-10-15Paper
Weighted upper edge cover: complexity and approximability2019-10-15Paper
Covering a Graph with Clubs2019-05-24Paper
Parameterized and approximation complexity of \textsc{Partial VC Dimension}2019-03-14Paper
Finding disjoint paths on edge-colored graphs: more tractability results2018-12-06Paper
Covering with clubs: complexity and approximability2018-09-06Paper
Parameterized complexity and approximation issues for the colorful components problems2018-06-18Paper
Complexity of Grundy coloring and its variants2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q53637852017-09-29Paper
On the complexity of various parameterizations of common induced subgraph isomorphism2017-09-28Paper
The graph motif problem parameterized by the structure of the input graph2017-09-12Paper
Finding disjoint paths on edge-colored graphs: more tractability results2017-02-01Paper
Parameterized and approximation complexity of \textsc{Partial VC Dimension}2017-02-01Paper
Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems2017-01-19Paper
A Note on Edge Isoperimetric Numbers and Regular Graphs2016-12-14Paper
Parameterized complexity and approximation issues for the colorful components problems2016-08-17Paper
Complexity of Grundy coloring and its variants2015-10-29Paper
On the complexity of various parameterizations of common induced subgraph isomorphism2015-09-15Paper
Some results on more flexible versions of Graph Motif2015-07-20Paper
Parameterized Inapproximability of Target Set Selection and Generalizations2015-02-25Paper
Parameterized Inapproximability of Target Set Selection and Generalizations2015-02-24Paper
Parameterized approximability of maximizing the spread of influence in networks2014-07-07Paper
Complexity insights of the minimum duplication problem2014-03-27Paper
MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS2013-07-30Paper
Parameterized Approximability of Maximizing the Spread of Influence in Networks2013-06-11Paper
Finding and counting vertex-colored subtrees2013-05-16Paper
Some Results on more Flexible Versions of Graph Motif2012-09-10Paper
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval2012-07-16Paper
Complexity Insights of the Minimum Duplication Problem2012-06-15Paper
On the parameterized complexity of the repetition free longest common subsequence problem2012-05-04Paper
Algorithmic Aspects of Heterogeneous Biological Networks Comparison2011-08-12Paper
Finding and Counting Vertex-Colored Subtrees2010-09-03Paper
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated2009-02-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Florian Sikora