Michal Malafiejski

From MaRDI portal
Person:237430

Available identifiers

zbMath Open malafiejski.michalDBLPm/MMalafiejskiWikidataQ24427399 ScholiaQ24427399MaRDI QIDQ237430

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61475262024-01-15Paper
Compact Scheduling In Open Shop With Zero-One Time Operations2023-04-21Paper
Total chromatic sum for trees2021-12-08Paper
Global edge alliances in graphs2019-05-17Paper
On incidence coloring of complete multipartite and semicubic bipartite graphs2018-01-10Paper
Interval incidence coloring of subcubic graphs2017-04-12Paper
The complexity of the chromatic sum problem on cubic planar graphs and regular graphs2016-07-01Paper
Strategic balance in graphs2016-04-27Paper
Global defensive sets in graphs2016-04-27Paper
Interval incidence graph coloring2015-02-06Paper
Interval incidence coloring of bipartite graphs2014-02-18Paper
On Efficient Coloring of Chordless Graphs2010-10-01Paper
https://portal.mardi4nfdi.de/entity/Q35766912010-07-30Paper
An Improved Strategy for Exploring a Grid Polygon2010-02-24Paper
An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs2010-01-29Paper
The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree2009-06-23Paper
Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph2009-04-29Paper
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids2009-01-27Paper
Fault Tolerant Guarding of Grids2009-01-27Paper
Packing \([1, \Delta ]\)-factors in graphs of small degree2007-11-14Paper
Parallel Processing and Applied Mathematics2007-05-02Paper
Cooperative mobile guards in grids2007-04-18Paper
Algorithms and Computation2006-11-14Paper
A polynomial algorithm for some preemptive multiprocessor task scheduling problems2006-10-25Paper
Sum coloring of bipartite graphs with bounded degree2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q47373462004-08-11Paper
A polynomial algorithm for finding \(T\)-span of generalized cacti2003-09-09Paper
The complexity of the \(T\)-coloring problem for graphs with small degree2003-09-09Paper
https://portal.mardi4nfdi.de/entity/Q44112832003-07-07Paper
Consecutive colorings of the edges of general graphs2002-07-30Paper
On the deficiency of bipartite graphs2000-04-04Paper
https://portal.mardi4nfdi.de/entity/Q44334291996-01-01Paper

Research outcomes over time

This page was built for person: Michal Malafiejski