Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Marcin Wrochna
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
Improved Hardness for H-Colourings of G-Colourable Graphs
Related publications
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
Mathematics
Computer Science
Block Companion Matrices, Discrete-Time Block Diagonal Stability and Polynomial Matrices
Operators and Matrices
Number Theory
Analysis
Algebra
A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Recognizing Circulant Graphs of Prime Order in Polynomial Time
Electronic Journal of Combinatorics
Combinatorics
Applied Mathematics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Maximum Induced Forests in Graphs of Bounded Treewidth
Electronic Journal of Combinatorics
Combinatorics
Applied Mathematics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Polynomial Algorithms for Perfect Graphs
North-Holland Mathematics Studies
An Expected Polynomial Time Algorithm for Coloring 2-Colorable 3-Graphs
Electronic Notes in Discrete Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Deterministic Computations in Time-Varying Graphs: Broadcasting Under Unstructured Mobility
IFIP Advances in Information and Communication Technology
Computer Networks
Information Systems
Management
Communications
