| Publication | Date of Publication | Type |
|---|
Equitable colorings of \(l\)-corona products of cubic graphs
Archives of Control Sciences | 2024-07-23 | Paper |
Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
Artificial Intelligence | 2022-07-08 | Paper |
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
Decision Making in Manufacturing and Services | 2021-11-02 | Paper |
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Archives of Control Sciences | 2020-10-12 | Paper |
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Archives of Control Sciences | 2020-10-12 | Paper |
A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)
Discussiones Mathematicae Graph Theory | 2020-04-28 | Paper |
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
Discrete Applied Mathematics | 2018-02-22 | Paper |
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
Discrete Applied Mathematics | 2017-12-20 | Paper |
Equitable colorings of corona multiproducts of graphs
Discussiones Mathematicae Graph Theory | 2017-10-13 | Paper |
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
Ars Mathematica Contemporanea | 2016-10-21 | Paper |
On bipartization of cubic graphs by removal of an independent set
Discrete Applied Mathematics | 2016-06-21 | Paper |
Edge-chromatic sum of trees and bounded cyclicity graphs
Information Processing Letters | 2016-06-16 | Paper |
On the independence number of some strong products of cycle-powers
Foundations of Computing and Decision Sciences | 2016-04-26 | Paper |
| scientific article; zbMATH DE number 6378894 (Why is no real title available?) | 2014-12-09 | Paper |
Equitable coloring of corona products of graphs
Advances and Applications in Discrete Mathematics | 2013-11-05 | Paper |
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Discussiones Mathematicae Graph Theory | 2010-05-14 | Paper |
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
Discrete Applied Mathematics | 2010-04-28 | Paper |
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs
AIP Conference Proceedings | 2009-01-22 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-05-02 | Paper |
| scientific article; zbMATH DE number 5145378 (Why is no real title available?) | 2007-04-23 | Paper |
On some Ramsey and Turán-type numbers for paths and cycles
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
On some Ramsey and Turán-type numbers for paths and cycles
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
| Equitable 4-coloring of cacti and edge-cacti in polynomial time | 2006-07-14 | Paper |
| scientific article; zbMATH DE number 5033869 (Why is no real title available?) | 2006-06-19 | Paper |
Euro-Par 2004 Parallel Processing
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Chromatic scheduling in a cyclic open shop
European Journal of Operational Research | 2005-03-08 | Paper |
Compact scheduling of zero-one time operations in multi-stage systems
Discrete Applied Mathematics | 2005-01-31 | Paper |
Sum coloring of bipartite graphs with bounded degree
Algorithmica | 2004-11-05 | Paper |
| scientific article; zbMATH DE number 2086778 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1998816 (Why is no real title available?) | 2003-11-24 | Paper |
| scientific article; zbMATH DE number 1947053 (Why is no real title available?) | 2003-07-07 | Paper |
The smallest hard-to-color graph for algorithm DSATUR
Discrete Mathematics | 2002-12-02 | Paper |
Consecutive colorings of the edges of general graphs
Discrete Mathematics | 2002-07-30 | Paper |
| scientific article; zbMATH DE number 1743833 (Why is no real title available?) | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1594518 (Why is no real title available?) | 2001-05-06 | Paper |
| scientific article; zbMATH DE number 1535268 (Why is no real title available?) | 2000-11-23 | Paper |
| scientific article; zbMATH DE number 1419487 (Why is no real title available?) | 2000-06-04 | Paper |
On the deficiency of bipartite graphs
Discrete Applied Mathematics | 2000-04-04 | Paper |
Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
European Journal of Operational Research | 1999-04-22 | Paper |
| scientific article; zbMATH DE number 1234485 (Why is no real title available?) | 1999-01-03 | Paper |
| scientific article; zbMATH DE number 1161387 (Why is no real title available?) | 1998-12-02 | Paper |
The smallest hard-to-color graph for the SL algorithm
Discrete Mathematics | 1997-12-08 | Paper |
Open shop problem with zero-one time operations and integer release date/deadline intervals
Discrete Applied Mathematics | 1997-08-11 | Paper |
A linear time algorithm for edge coloring of binomial trees
Discrete Mathematics | 1997-01-12 | Paper |
| scientific article; zbMATH DE number 1998802 (Why is no real title available?) | 1996-01-01 | Paper |
| scientific article; zbMATH DE number 1998817 (Why is no real title available?) | 1996-01-01 | Paper |
| scientific article; zbMATH DE number 764415 (Why is no real title available?) | 1995-06-14 | Paper |
| scientific article; zbMATH DE number 597813 (Why is no real title available?) | 1994-06-29 | Paper |
Interval edge coloring of a graph with forbidden colors
Discrete Mathematics | 1994-02-24 | Paper |
Some results concerning the complexity of restricted colorings of graphs
Discrete Applied Mathematics | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 9845 (Why is no real title available?) | 1992-06-25 | Paper |
Interval vertex-coloring of a graph with forbidden colors
Discrete Mathematics | 1989-01-01 | Paper |
The complexity of scheduling independent two-processor tasks on dedicated processors
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3982886 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3977025 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3908344 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3827909 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3841898 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3599964 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3478608 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3503132 (Why is no real title available?) | 1975-01-01 | Paper |
