The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marek Kubale: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
    A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:135-145 [Conf]
  2. Jennie C. Hansen, Marek Kubale, Lukasz Kuszner, Adam Nadolski
    Distributed Largest-First Algorithm for Graph Coloring. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:804-811 [Conf]
  3. Marek Kubale, Lukasz Kuszner
    A Better Practical Algorithm for Distributed Graph Coloring. [Citation Graph (0, 0)][DBLP]
    PARELEC, 2002, pp:72-75 [Conf]
  4. Dariusz Dereniowski, Marek Kubale
    Cholesky Factorization of Matrices in Parallel and Ranking of Graphs. [Citation Graph (0, 0)][DBLP]
    PPAM, 2003, pp:985-992 [Conf]
  5. Dariusz Dereniowski, Marek Kubale
    Parallel Query Processing and Edge Ranking of Graphs. [Citation Graph (0, 0)][DBLP]
    PPAM, 2005, pp:463-469 [Conf]
  6. Krzysztof Giaro, Marek Kubale
    Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints. [Citation Graph (0, 0)][DBLP]
    PPAM, 2005, pp:855-862 [Conf]
  7. Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski
    Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. [Citation Graph (0, 0)][DBLP]
    PPAM, 2001, pp:87-96 [Conf]
  8. Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale
    Sum Coloring of Bipartite Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:235-244 [Journal]
  9. Marek Kubale, Boguslaw Jackowski
    A Generalized Implicit Enumeration Algorithm for Graph Coloring. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:4, pp:412-418 [Journal]
  10. Krzysztof Giaro, Marek Kubale
    Compact scheduling of zero-one time operations in multi-stage systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:95-103 [Journal]
  11. Krzysztof Giaro, Marek Kubale, Michal Malafiejski
    On the Deficiency of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:193-203 [Journal]
  12. Marek Kubale
    Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:213-223 [Journal]
  13. Krzysztof Giaro, Marek Kubale, Michal Malafiejski
    Consecutive colorings of the edges of general graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:131-143 [Journal]
  14. Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski
    The smallest hard-to-color graph for algorithm DSATUR. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:151-165 [Journal]
  15. Dariusz Dereniowski, Marek Kubale
    Efficient Parallel Query Processing by Graph Ranking. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:69, n:3, pp:273-285 [Journal]
  16. Krzysztof Giaro, Marek Kubale, Konrad Piwakowski
    Complexity results on open shop scheduling to minimize total cost of operations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Syst. Signal, 2002, v:3, n:2, pp:84-91 [Journal]
  17. Krzysztof Giaro, Marek Kubale
    Edge-chromatic sum of trees and bounded cyclicity graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:1-2, pp:65-69 [Journal]
  18. Marek Kubale
    The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:3, pp:141-147 [Journal]
  19. Henryk Krawczyk, Marek Kubale
    An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:9, pp:869-872 [Journal]
  20. Marek Kubale
    Comments on ``Decomposition of Permutation Networks''. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:3, pp:265- [Journal]
  21. Marek Kubale, Adam Nadolski
    Chromatic scheduling in a cyclic open shop. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:164, n:3, pp:585-591 [Journal]
  22. Marek Kubale
    Interval vertex-coloring of a graph with forbidden colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:125-136 [Journal]
  23. Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski
    The smallest hard-to-color graph for the SL algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:197-212 [Journal]
  24. Marek Kubale, Konrad Piwakowski
    A linear time algorithm for edge coloring of binomial trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:247-256 [Journal]
  25. Marek Kubale
    Interval edge coloring of a graph with forbidden colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:135-143 [Journal]

  26. Computer experiments with a parallel clonal selection algorithm for the Graph Coloring Problem. [Citation Graph (, )][DBLP]


  27. On Some Ramsey and Turan-Type Numbers for Paths and Cycles. [Citation Graph (, )][DBLP]


  28. Some results concerning the complexity of restricted colorings of graphs. [Citation Graph (, )][DBLP]


  29. A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002