Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Krzysztof Giaro - MaRDI portal

Krzysztof Giaro

From MaRDI portal
Person:177037

Available identifiers

zbMath Open giaro.krzysztofDBLPg/KrzysztofGiaroWikidataQ20028922 ScholiaQ20028922MaRDI QIDQ177037

List of research outcomes

PublicationDate of PublicationType
Compact Scheduling In Open Shop With Zero-One Time Operations2023-04-21Paper
A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)2020-04-28Paper
Edge-chromatic sum of trees and bounded cyclicity graphs2016-06-16Paper
On a matching distance between rooted phylogenetic trees2014-02-06Paper
Consensus models: computational complexity aspects in modern approaches to the list coloring problem2011-09-12Paper
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs2010-05-14Paper
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints2010-04-28Paper
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs2009-01-22Paper
https://portal.mardi4nfdi.de/entity/Q55029052009-01-12Paper
Parallel Processing and Applied Mathematics2007-05-02Paper
https://portal.mardi4nfdi.de/entity/Q34339442007-04-23Paper
https://portal.mardi4nfdi.de/entity/Q54764062006-07-14Paper
Compact scheduling of zero-one time operations in multi-stage systems2005-01-31Paper
Sum coloring of bipartite graphs with bounded degree2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q47373462004-08-11Paper
The complexity of the \(T\)-coloring problem for graphs with small degree2003-09-09Paper
A polynomial algorithm for finding \(T\)-span of generalized cacti2003-09-09Paper
https://portal.mardi4nfdi.de/entity/Q44112832003-07-07Paper
Consecutive colorings of the edges of general graphs2002-07-30Paper
https://portal.mardi4nfdi.de/entity/Q45293112002-07-14Paper
NP-hardness of compact scheduling in simplified open and flow shops.2001-01-01Paper
On the deficiency of bipartite graphs2000-04-04Paper
https://portal.mardi4nfdi.de/entity/Q49400902000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q43933861998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44334291996-01-01Paper

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: Krzysztof Giaro