| Publication | Date of Publication | Type |
|---|
| Equitable colorings of \(l\)-corona products of cubic graphs | 2024-07-23 | Paper |
| Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms | 2022-07-08 | Paper |
| Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments | 2021-11-02 | Paper |
| Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling | 2020-10-12 | Paper |
| Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms | 2020-10-12 | Paper |
| A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) | 2020-04-28 | Paper |
| Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs | 2018-02-22 | Paper |
| Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines | 2017-12-20 | Paper |
| Equitable colorings of corona multiproducts of graphs | 2017-10-13 | Paper |
| Equitable coloring of corona products of cubic graphs is harder than ordinary coloring | 2016-10-21 | Paper |
| On bipartization of cubic graphs by removal of an independent set | 2016-06-21 | Paper |
| Edge-chromatic sum of trees and bounded cyclicity graphs | 2016-06-16 | Paper |
| On the independence number of some strong products of cycle-powers | 2016-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2932933 | 2014-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2858945 | 2013-11-05 | Paper |
| Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs | 2010-05-14 | Paper |
| A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints | 2010-04-28 | Paper |
| Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs | 2009-01-22 | Paper |
| Parallel Processing and Applied Mathematics | 2007-09-25 | Paper |
| Parallel Processing and Applied Mathematics | 2007-05-02 | Paper |
| Parallel Processing and Applied Mathematics | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433944 | 2007-04-23 | Paper |
| On some Ramsey and Turán-type numbers for paths and cycles | 2006-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5476406 | 2006-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5472917 | 2006-06-19 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| Chromatic scheduling in a cyclic open shop | 2005-03-08 | Paper |
| Compact scheduling of zero-one time operations in multi-stage systems | 2005-01-31 | Paper |
| Sum coloring of bipartite graphs with bounded degree | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737346 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4433446 | 2003-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411283 | 2003-07-07 | Paper |
| The smallest hard-to-color graph for algorithm DSATUR | 2002-12-02 | Paper |
| Consecutive colorings of the edges of general graphs | 2002-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529311 | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712308 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515763 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942486 | 2000-06-04 | Paper |
| On the deficiency of bipartite graphs | 2000-04-04 | Paper |
| Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4221274 | 1999-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393386 | 1998-12-02 | Paper |
| The smallest hard-to-color graph for the SL algorithm | 1997-12-08 | Paper |
| Open shop problem with zero-one time operations and integer release date/deadline intervals | 1997-08-11 | Paper |
| A linear time algorithm for edge coloring of binomial trees | 1997-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4433429 | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4433447 | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4836302 | 1995-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4298852 | 1994-06-29 | Paper |
| Interval edge coloring of a graph with forbidden colors | 1994-02-24 | Paper |
| Some results concerning the complexity of restricted colorings of graphs | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971918 | 1992-06-25 | Paper |
| Interval vertex-coloring of a graph with forbidden colors | 1989-01-01 | Paper |
| The complexity of scheduling independent two-processor tasks on dedicated processors | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747203 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686636 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3743323 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674698 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3312261 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4166702 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062185 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083334 | 1975-01-01 | Paper |
