The following pages link to Paweł Rzążewski (Q322248):
Displayed 50 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Sequences of radius \(k\) for complete bipartite graphs (Q528554) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- \(\forall\exists\mathbb {R}\)-completeness and area-universality (Q1627164) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- Item:Q322248 (redirect page) (← links)
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Clique-width: harnessing the power of atoms (Q2110611) (← links)
- Exact and approximation algorithms for sensor placement against DDoS attacks (Q2140977) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Subexponential algorithms for variants of homomorphism problem in string graphs (Q2301531) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- On edge intersection graphs of paths with 2 bends (Q2357780) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Constructing Optimal $k$-Radius Sequences (Q2797088) (← links)
- On Improved Exact Algorithms for L(2,1)-Labeling of Graphs (Q3000491) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Sequences of Radius k for Complete Bipartite Graphs (Q3181042) (← links)
- On Edge Intersection Graphs of Paths with 2 Bends (Q3181059) (← links)
- (Q3304125) (← links)
- (Q4560203) (← links)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
- (Q4580091) (← links)
- Achromatic and Harmonious Colorings of Circulant Graphs (Q4604012) (← links)
- (Q4626304) (← links)
- (Q4636614) (← links)
- Beyond Homothetic Polygons: Recognition and Maximum Clique (Q4909578) (← links)
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (Q5056440) (← links)
- Constant Congestion Brambles in Directed Graphs (Q5071097) (← links)
- (Q5075768) (← links)
- (Q5075819) (← links)
- (Q5115779) (← links)
- Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (Q5146875) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- An Exact Algorithm for the Generalized List $T$-Coloring Problem (Q5167725) (← links)
- Determining the L(2,1)-Span in Polynomial Space (Q5200500) (← links)
- Harmonious coloring of uniform hypergraphs (Q5279870) (← links)
- Erratum: Constructing Optimal $k$-Radius Sequences (Q5346545) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)