Person:322248: Difference between revisions

From MaRDI portal
Person:322248
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Paweł Rzążewski to Paweł Rzążewski: Duplicate
 
(No difference)

Latest revision as of 01:06, 11 December 2023

Available identifiers

zbMath Open rzazewski.pawelMaRDI QIDQ322248

List of research outcomes

PublicationDate of PublicationType
List covering of regular multigraphs with semi-edges2024-03-25Paper
Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree2024-01-29Paper
Towards the Chen-Raspaud conjecture2024-01-17Paper
https://portal.mardi4nfdi.de/entity/Q61473722024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60654672023-11-14Paper
Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time2023-11-14Paper
Clique‐width: Harnessing the power of atoms2023-11-06Paper
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number2023-10-17Paper
https://portal.mardi4nfdi.de/entity/Q60759262023-09-20Paper
Every graph is eventually Turán-good2023-08-10Paper
Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs2023-08-08Paper
Sparse induced subgraphs in P_6-free graphs2023-07-14Paper
Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality2023-06-12Paper
Complexity of \(C_k\)-coloring in hereditary classes of graphs2023-05-19Paper
Computing list homomorphisms in geometric intersection graphs2023-05-05Paper
Classifying subset feedback vertex set for \(H\)-free graphs2023-05-05Paper
Parameterized inapproximability of independent set in \(H\)-free graphs2023-04-11Paper
https://portal.mardi4nfdi.de/entity/Q58745462023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58755572023-02-03Paper
Clique-width: harnessing the power of atoms2022-12-21Paper
Parameterized inapproximability of independent set in \(H\)-free graphs2022-12-21Paper
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs2022-12-08Paper
Faster 3-Coloring of Small-Diameter Graphs2022-09-21Paper
List covering of regular multigraphs2022-08-30Paper
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws2022-05-26Paper
Exact and approximation algorithms for sensor placement against DDoS attacks2022-05-23Paper
https://portal.mardi4nfdi.de/entity/Q50757682022-05-11Paper
https://portal.mardi4nfdi.de/entity/Q50758192022-05-11Paper
Taming graphs with no large creatures and skinny ladders2022-05-02Paper
Constant Congestion Brambles in Directed Graphs2022-04-20Paper
List covering of regular multigraphs with semi-edges2022-04-08Paper
Max Weight Independent Set in graphs with no long claws: An analog of the Gy\'arf\'as' path argument2022-03-09Paper
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs2021-11-17Paper
Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes2021-11-04Paper
Subexponential-time algorithms for finding large induced sparse subgraphs2021-07-26Paper
Coloring squares of planar graphs with small maximum degree2021-05-24Paper
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs2021-04-14Paper
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs2021-02-02Paper
Representing graphs and hypergraphs by touching polygons in 3D2020-10-26Paper
On cycle transversals and their connected variants in the absence of a small linear forest2020-10-12Paper
https://portal.mardi4nfdi.de/entity/Q51157792020-08-18Paper
https://portal.mardi4nfdi.de/entity/Q33041252020-08-05Paper
Clique-Width: Harnessing the Power of Atoms2020-06-05Paper
Complexity of $C_k$-coloring in hereditary classes of graphs2020-05-04Paper
\( L ( 2 , 1 )\)-labeling of disk intersection graphs2020-03-23Paper
Subexponential algorithms for variants of the homomorphism problem in string graphs2020-02-24Paper
Subexponential algorithms for variants of homomorphism problem in string graphs2020-02-24Paper
Complete colourings of hypergraphs2019-12-17Paper
Finding small-width connected path decompositions in polynomial time2019-10-16Paper
\(H\)-colouring \(P_t\)-free graphs in subexponential time2019-09-05Paper
Packing Directed Cycles Quarter- and Half-Integrally2019-07-04Paper
Optimality program in segment and string graphs2019-05-21Paper
https://portal.mardi4nfdi.de/entity/Q46263042019-02-27Paper
https://portal.mardi4nfdi.de/entity/Q45602032018-12-10Paper
\(\forall\exists\mathbb {R}\)-completeness and area-universality2018-11-22Paper
Optimality program in segment and string graphs2018-11-22Paper
Homothetic polygons and beyond: maximal cliques in intersection graphs2018-09-06Paper
https://portal.mardi4nfdi.de/entity/Q45800912018-08-13Paper
Complexity of token swapping and its variants2018-07-26Paper
Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs2018-06-15Paper
Intersecting edge distinguishing colorings of hypergraphs2018-04-27Paper
https://portal.mardi4nfdi.de/entity/Q46366142018-04-19Paper
Achromatic and Harmonious Colorings of Circulant Graphs2018-02-23Paper
Fixing improper colorings of graphs2018-02-16Paper
Designing RNA Secondary Structures is Hard2017-10-31Paper
Harmonious and achromatic colorings of fragmentable hypergraphs2017-09-11Paper
Harmonious coloring of uniform hypergraphs2017-07-19Paper
On edge intersection graphs of paths with 2 bends2017-06-14Paper
Erratum: Constructing Optimal $k$-Radius Sequences2017-05-24Paper
Sequences of radius \(k\) for complete bipartite graphs2017-05-12Paper
Sequences of Radius k for Complete Bipartite Graphs2016-12-22Paper
On Edge Intersection Graphs of Paths with 2 Bends2016-12-22Paper
Harmonious and achromatic colorings of fragmentable hypergraphs2016-10-14Paper
Constructing Optimal $k$-Radius Sequences2016-04-04Paper
Fixing improper colorings of graphs2015-02-20Paper
An Exact Algorithm for the Generalized List $T$-Coloring Problem2014-07-01Paper
Determining the \(L(2,1)\)-span in polynomial space2014-04-22Paper
Exact algorithm for graph homomorphism and locally injective graph homomorphism2014-04-17Paper
Fast exact algorithm for \(L(2,1)\)-labeling of graphs2014-01-16Paper
On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs2013-04-04Paper
Beyond Homothetic Polygons: Recognition and Maximum Clique2013-03-21Paper
On the number of 2-packings in a connected graph2012-11-15Paper
Determining the L(2,1)-Span in Polynomial Space2012-11-06Paper
Fast Exact Algorithm for L(2,1)-Labeling of Graphs2011-07-01Paper
On Improved Exact Algorithms for L(2,1)-Labeling of Graphs2011-05-19Paper
Tree decompositions meet induced matchings: beyond Max Weight Independent Set0001-01-03Paper
Minimal obstructions to $C_5$-coloring in hereditary graph classes0001-01-03Paper
Excluding a clique or a biclique in graphs of bounded induced matching treewidth0001-01-03Paper

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: Paweł Rzążewski