The following pages link to Konstanty Junosza-Szaniawski (Q282743):
Displaying 33 items.
- Fractional and \(j\)-fold coloring of the plane (Q282745) (← links)
- First non-trivial upper bound on circular chromatic number of the plane (Q322359) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- Combinatorial lemmas for oriented complexes (Q1022822) (← links)
- Combinatorial lemmas for nonoriented pseudomanifolds (Q1428728) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Upper bound on the circular chromatic number of the plane (Q1753019) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
- Fractional meanings of nonrepetitiveness (Q2120819) (← links)
- Exact and approximation algorithms for sensor placement against DDoS attacks (Q2140977) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- Bundling all shortest paths (Q2306586) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Exact and approximation algorithms for a soft rectangle packing problem (Q2926482) (← 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)
- Counting Independent Sets in Claw-Free Graphs (Q3104779) (← links)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
- Beyond Homothetic Polygons: Recognition and Maximum Clique (Q4909578) (← links)
- An Exact Algorithm for the Generalized List $T$-Coloring Problem (Q5167725) (← links)
- Fastest, Average and Quantile Schedule (Q5175106) (← links)
- Determining the L(2,1)-Span in Polynomial Space (Q5200500) (← links)
- Combinatorial Lemmas for Polyhedrons (Q5316263) (← links)
- Coloring of G<sup>2</sup>-G, for Euclidesian graph G (Q5316276) (← links)
- Combinatorial lemmas for polyhedrons I (Q5437227) (← links)
- Coloring distance graphs on the plane (Q6046170) (← links)
- Online coloring of disk graphs (Q6634381) (← links)
- Partial packing coloring and quasi-packing coloring of the triangular grid (Q6646429) (← links)
