Marcin Wrochna

From MaRDI portal
Person:345099

Available identifiers

zbMath Open wrochna.marcinWikidataQ58656649 ScholiaQ58656649MaRDI QIDQ345099

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61472782024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60896852023-11-13Paper
PTAS for Sparse General-valued CSPs2023-10-23Paper
Topology and Adjunction in Promise Constraint Satisfaction2023-04-04Paper
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints2022-12-05Paper
https://portal.mardi4nfdi.de/entity/Q50904942022-07-18Paper
The Complexity of Promise SAT on Non-Boolean Domains2022-03-29Paper
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes2021-02-15Paper
Improved hardness for H-colourings of G-colourable graphs2021-02-02Paper
The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems2020-12-04Paper
https://portal.mardi4nfdi.de/entity/Q51113882020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51117042020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51118822020-05-27Paper
Integer programming and incidence treedepth2020-02-06Paper
Homomorphism Reconfiguration via Homotopy2020-01-31Paper
Tight Lower Bounds for the Complexity of Multicoloring2019-12-16Paper
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs2019-12-06Paper
On inverse powers of graphs and topological implications of Hedetniemi's conjecture2019-11-21Paper
Hedetniemi's Conjecture and Strongly Multiplicative Graphs2019-11-20Paper
Turing kernelization for finding long paths in graph classes excluding a topological minor2019-09-10Paper
Edge bipartization faster than \(2^k\)2019-03-11Paper
Cutwidth: obstructions and algorithmic aspects2019-02-14Paper
The step Sidorenko property and non-norming edge-transitive graphs2018-12-19Paper
On directed feedback vertex set parameterized by treewidth2018-11-22Paper
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth2018-11-13Paper
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth2018-07-16Paper
Cutwidth: obstructions and algorithmic aspects2018-04-10Paper
https://portal.mardi4nfdi.de/entity/Q46344102018-04-10Paper
https://portal.mardi4nfdi.de/entity/Q46019092018-01-24Paper
Reconfiguration in bounded bandwidth and tree-depth2017-12-21Paper
Polynomial kernelization for removing induced claws and diamonds2017-08-15Paper
Homomorphism reconfiguration via homotopy2017-01-24Paper
Square-free graphs are multiplicative2016-11-25Paper
Polynomial Kernelization for Removing Induced Claws and Diamonds2016-10-21Paper
Reconfiguration over Tree Decompositions2015-09-15Paper
Reconfiguring Independent Sets in Claw-Free Graphs2014-09-02Paper

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: Marcin Wrochna