The following pages link to Marcin Wrochna (Q345099):
Displaying 36 items.
- Square-free graphs are multiplicative (Q345100) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- On directed feedback vertex set parameterized by treewidth (Q1627154) (← links)
- The step Sidorenko property and non-norming edge-transitive graphs (Q1633367) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Integer programming and incidence treedepth (Q2293088) (← links)
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture (Q2338641) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Reconfiguration over Tree Decompositions (Q2946023) (← links)
- Homomorphism reconfiguration via homotopy (Q2955037) (← links)
- Reconfiguring Independent Sets in Claw-Free Graphs (Q3188884) (← links)
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth (Q4554362) (← links)
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth (Q4575835) (← links)
- On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. (Q4601909) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q4634398) (← links)
- Edge Bipartization Faster Than 2^k (Q4634410) (← links)
- On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs (Q4973895) (← links)
- Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints (Q5053070) (← links)
- The Complexity of Promise SAT on Non-Boolean Domains (Q5066145) (← links)
- (Q5090494) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5111388) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems (Q5138784) (← links)
- Improved hardness for <i>H</i>-colourings of <i>G</i>-colourable graphs (Q5146862) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5205808) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- (Q6089685) (← links)
- Pliability and Approximating Max-CSPs (Q6503893) (← links)
- Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings (Q6764004) (← links)
