Development of graph-theoretical methods of discrete optimization in technological and biological applications

2011/02/A/ST6/00201

Keywords

Descriptors

  • ST6_7: Teoretyczne podstawy informatyki, w tym informatyka kwantowa

Panel

ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution

Politechnika Gdańska, Wydział Elektroniki, Telekomunikacji i Informatyki

Voivodeship: pomorskie

Other projects carried out by the institution »

Principal investigator (from the host institution)

prof. Marek Kubale

Number of co-investigators in the project: 11

Call

MAESTRO 1 – announced on 2011-06-15

Amount awarded
1 250 000 PLN
Project start date
2012-06-05
Project end date
2017-06-05
Project duration
60 months (the same as in the proposal)
Project status
Project settled

Information in the final report

Publication in academic press/journals (65)

  1. On-line Ramsey Numbers of Paths and Cycles

    Authors:
    J. Cyman, T. Dzido, J. Lapinskas, A. Lo
    Academic press:
    Electronic Journal of Combinatorics (year: 2015, volume: 22, pages: #P1.15), Publisher: Electronic Journal of Combinatorics
    Status:
    Published
    DOI:
    link to the publication
  2. On a local similarity of graphs

    Authors:
    T. Dzido, K. Krzywdziński
    Academic press:
    Discrete Mathematics (year: 2015, volume: 338, pages: 983–989), Publisher: ELSEVIER
    Status:
    Published
    DOI:
    10.1016/j.disc.2015.01.016 – link to the publication
  3. The complexity of zero-visibility cops and robber

    Authors:
    D. Dereniowski, D. Dyer, R. M. Tifenbach, B. Yang
    Academic press:
    Theoretical Computer Science (year: 2015, volume: 607, pages: 135-148), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2015.03.022 – link to the publication
  4. Wheel and star-critical Ramsey numbers for quadrilateral

    Authors:
    Y. Wua, Y. Suna, S. P. Radziszowski
    Academic press:
    Discrete Applied Mathematics (year: 2015, volume: 186, pages: 260-271), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2015.01.003 – link to the publication
  5. Towards the boundary between easy and hard control problems in multicast Clos networks

    Authors:
    P. Obszarski, A. Jastrzębski, M. Kubale
    Academic press:
    Bulletin PAN Tech. Sci. (year: 2015, volume: 63, pages: 739-744), Publisher: Polska Akademia Nauk
    Status:
    Published
  6. An algorithm for listing all minimal double dominating sets of a tree

    Authors:
    M. Krzywkowski
    Academic press:
    Fundamenta Informaticae (year: 2014, volume: 130, pages: 415-421), Publisher: POLISH MATHEMATICAL SOCIETY
    Status:
    Published
    DOI:
    10.3233/FI-2014-998 – link to the publication
  7. On homogeneously representable interval graphs

    Authors:
    M. Krzywkowski, J. Topp
    Academic press:
    National Academy Science Letters (year: 2016, volume: 39, pages: 39-41), Publisher: Springer
    Status:
    Published
    DOI:
    10.1007/s40009-015-0397-x – link to the publication
  8. Collision-free network exploration

    Authors:
    J. Czyzowicz, D. Dereniowski, L. Gąsieniec, . R. Klasing, A. Kosowski, D.Pająk
    Academic press:
    Journal of Computer and System Sciences (year: 2017, volume: 86, pages: 70-81), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2016.11.008 – link to the publication
  9. Modele i metody kolorowania grafów. Część II.

    Authors:
    M. Kubale
    Academic press:
    Przegląd Elektrotechniczny (year: 2012, volume: 11A, pages: 51-55), Publisher: SIGMA-NOT
    Status:
    Published
  10. A point set connection problem for autonomous mobile robots in a grid

    Authors:
    A. Kosowski, I. Suzuki, P. Żyliński
    Academic press:
    Computing and Informatics (year: 2012, volume: 31, pages: 349-369), Publisher: Slovak Acad. Sci.
    Status:
    Published
    DOI:
    link to the publication
  11. Equitable coloring of corona products of cubic graphs is harder than ordinary coloring

    Authors:
    H. Furmańczyk, M. Kubale
    Academic press:
    ARS MATHEMATICA CONTEMPORANEA (year: 2016, volume: 10, pages: 333-347), Publisher: University of Primorska
    Status:
    Published
    DOI:
    link to the publication
  12. On interval and indifference graphs

    Authors:
    M. Krzywkowski, J. Topp
    Academic press:
    Mathematical Reports (year: 2017, volume: 19(69), pages: 46027), Publisher: Publishing House of the Romanian Academy
    Status:
    Published
  13. Shared multi-processor scheduling

    Authors:
    D. Dereniowski, W. Kubiak
    Academic press:
    European Journal of Operational Research (year: 2017, volume: 261, pages: 503-514), Publisher: ELSEVIER
    Status:
    Published
    DOI:
    10.1016/j.ejor.2017.03.002 – link to the publication
  14. Interval incidence coloring of subcubic graphs

    Authors:
    A. Małafiejska , M. Małafiejski
    Academic press:
    Discussiones Mathematicae Graph Theory (year: 2017, volume: 37, pages: 427-441), Publisher: De Gruyter
    Status:
    Published
    DOI:
    10.7151/dmgt.1962 – link to the publication
  15. Reconfiguration of list edge-colorings in a graph

    Authors:
    T. Ito, M. Kamiński, E. Demaine
    Academic press:
    Discrete Applied Mathematics (year: 2012, volume: 160, pages: 2199-2207), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2012.05.014 – link to the publication
  16. TreeCmp: Comparison of trees in polynomial time

    Authors:
    D. Bogdanowicz, K. Giaro, B. Wróbel
    Academic press:
    Evolutionary Bioinformatics (year: 2012, volume: 8, pages: 475-487), Publisher: Libertas Academica
    Status:
    Published
    DOI:
    10.4137/ebo.s9657 – link to the publication
  17. Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines

    Authors:
    H. Furmańczyk, M. Kubale
    Academic press:
    Bulletin of the Polish Academy of Sciences Technical Sciences (year: 2017, volume: 65, pages: 29 - 34), Publisher: DE GRUYTER
    Status:
    Published
    DOI:
    10.1515/bpasts-2017-0004 – link to the publication
  18. On a matching distance between rooted phylogenetic trees

    Authors:
    D. Bogdanowicz, K. Giaro
    Academic press:
    Int. Journal of Applied Mathematics and Computer Science (year: 2012, volume: 23, pages: 195-214), Publisher: Univ. Zielona Góra Press
    Status:
    Published
    DOI:
    link to the publication
  19. Some lower bounds on the Shannon capacity

    Authors:
    M. Jurkiewicz, M. Kubale, K. Turowski
    Academic press:
    Journal of Applied Computer Science (year: 2014, volume: 22, pages: 31-42), Publisher: Instytut Informatyki, Politechnika Łódzka
    Status:
    Published
  20. On-line ranking of split graphs

    Authors:
    P. Borowiecki, D. Dereniowski
    Academic press:
    Discrete Mathematics and Theoretical Comp. Sci. (year: 2013, volume: 15, pages: 195-214), Publisher: DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE
    Status:
    Published
    DOI:
    link to the publication
  21. Equitable coloring of corona products of graphs

    Authors:
    H. Furmańczyk, K. Kaliraj, M. Kubale, J.V. Vivin
    Academic press:
    Advances and Applications in Discrete Mathematics (year: 2013, volume: 11, pages: 103-120), Publisher: Pushpa Publishing House
    Status:
    Published
  22. Normal-form preemption sequences for an open problem in scheduling theory

    Authors:
    B. Chen, E. Coffman, D. Dereniowski, W. Kubiak
    Academic press:
    Journal of Scheduling (year: 2016, volume: 19, pages: 701-728), Publisher: Springer
    Status:
    Published
    DOI:
    10.1007/s10951-015-0446-9 – link to the publication
  23. Independence in uniform linear triangle-free hypergraphs

    Authors:
    P. Borowiecki, M. Gentner, Ch. Löwenstein, D. Rautenbach
    Academic press:
    Discrete Mathematics (year: 2016, volume: 339, pages: 1878-1883), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.disc.2016.01.006 – link to the publication
  24. Bounds on the cover time of parallel rotor walks

    Authors:
    D. Dereniowski, A. Kosowski, D. Pająk, P. Uznański
    Academic press:
    Journal of Computer and System Sciences (year: 2016, volume: 82, pages: 802-816), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2016.01.004 – link to the publication
  25. Non-isolating 2-bondage in graphs

    Authors:
    M. Krzywkowski
    Academic press:
    Journal of Mathematical Society Japan (year: 2013, volume: 65, pages: 37-50), Publisher: Math. Society of Japan
    Status:
    Published
    DOI:
    10.2969/jmsj/06510037 – link to the publication
  26. The Ramsey number R(3, K10-e) and computational bounds for R(3,G)

    Authors:
    J. Goedgebeur, S. Radziszowski
    Academic press:
    Electronic Journal of Combinatorics (year: 2013, volume: 20, pages: #P19), Publisher: Electronic Journal of Combinatorics
    Status:
    Published
    DOI:
    link to the publication
  27. Maximum matching in multi-interface networks

    Authors:
    A. Kosowski et al.
    Academic press:
    Theoretical Computer Science (year: 2012, volume: 507, pages: 52-60), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2013 – link to the publication
  28. Partial dominated schedules and minimizing the total completion time of deteriorating jobs

    Authors:
    K. Ocetkiewicz
    Academic press:
    Optimization (year: 2013, volume: 62, pages: 1341-1356), Publisher: Taylor & Francis
    Status:
    Published
    DOI:
    10.1080/02331934.2013.836647 – link to the publication
  29. Minimal 2-dominating sets in trees

    Authors:
    M. Krzywkowski
    Academic press:
    RAIRO – Theoretical Informatics and Applications (year: 2013, volume: 47, pages: 235-240), Publisher: Cambridge University Press
    Status:
    Published
    DOI:
    10.1051/ita/2013036 – link to the publication
  30. 2-boudage in graphs

    Authors:
    M. Krzykowski
    Academic press:
    Int. Journal of Computer Mathematics (year: 2013, volume: 90, pages: 1358-1365), Publisher: Taylor & Francis
    Status:
    Published
    DOI:
    10.1080/00207160.2012.752817 – link to the publication
  31. Edge-coloring of 3-uniform hypergraphs

    Authors:
    P. Obszarski, A. Jastrzębski
    Academic press:
    Discrete Applied Mathematics (year: 2017, volume: 217, pages: 48-52), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2016.06.009 – link to the publication
  32. Interval incidence coloring of bipartite graphs

    Authors:
    R. Janczewski, A. Małafiejska, M. Małafiejski
    Academic press:
    Discrete Applied Mathematics (year: 2014, volume: 166, pages: 131-140), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2013.10.007 – link to the publication
  33. Brushing with additional cleaning restrictions

    Authors:
    P. Borowiecki, D. Dereniowski, P. Prałat
    Academic press:
    Theoretical Computer Science (year: 2014, volume: 557, pages: 76-86), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2014.09.005 – link to the publication
  34. Non-isolating bondage in graphs

    Authors:
    M. Krzywkowski
    Academic press:
    Bulletin of the Malaysian Mathematical Sciences Society (year: 2016, volume: 39, pages: 219–227), Publisher: Universiti Sains Malaysia
    Status:
    Published
    DOI:
    10.1007/s40840-015-0290-2 – link to the publication
  35. Bounds on the vertex-edge domination number of a tree

    Authors:
    B. Krishnakumari, Y. Venkatakrishnan, M. Krzywkowski
    Academic press:
    Comptes Rendus Mathématique (year: 2014, volume: 352, pages: 363-366), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.crma.2014.03.017 – link to the publication
  36. The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones

    Authors:
    R. Janczewski, K. Turowski
    Academic press:
    Information Processing Letters (year: 2015, volume: 115, pages: 232–236), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.ipl.2014.09.018 – link to the publication
  37. Edge-coloring of 3-uniform hypergraphs

    Authors:
    P. Obszarski, A. Jastrzębski
    Academic press:
    Discrete Applied Mathematic (year: 2017, volume: 217, pages: 48-52), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2016.06.009 – link to the publication
  38. Comparing phylogenetic trees by matching nodes using the transfer distance between partitions

    Authors:
    D. Bogdanowicz, K. Giaro
    Academic press:
    Journal of Computational Biology (year: 2017, volume: 24, pages: 422-435), Publisher: Mary Ann Liebert, Inc.
    Status:
    Published
    DOI:
    10.1089/cmb.2016.0204 – link to the publication
  39. On the hardness of computing span of subcubic graphs

    Authors:
    R. Janczewski, K. Turowski
    Academic press:
    Information Processing Letters (year: 2016, volume: 116, pages: 26-32), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.ipl.2015.08.009 – link to the publication
  40. Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

    Authors:
    H. Furmańczyk, M. Kubale
    Academic press:
    Archives of Control Sciences (year: 2015, volume: 25, pages: 109–116), Publisher: De Gruyter
    Status:
    Published
    DOI:
    10.1515/acsc-2015-0007 – link to the publication
  41. Optimal backbone coloring of split graphs with matching backbones

    Authors:
    K. Turowski
    Academic press:
    Discussiones Mathematicae Graph Theory (year: 2015, volume: 35, pages: 157-169), Publisher: De Gruyter
    Status:
    Published
    DOI:
    10.7151/dmgt.1786 – link to the publication
  42. New potential functions for greedy independence and coloring

    Authors:
    P. Borowiecki, D. Rautenbach
    Academic press:
    Discrete Applied Mathematics (year: 2015, volume: 182, pages: 61-72), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2013.12.011 – link to the publication
  43. On bipartization of cubic graphs by removal of an independent set

    Authors:
    H. Furmańczyk, M. Kubale, S. Radziszowski
    Academic press:
    Discrete Applied Mathematics (year: 2016, volume: 209, pages: 115–121), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2015.10.036 – link to the publication
  44. On the independence number of some strong products of cycle-powers

    Authors:
    M. Jurkiewicz, M. Kubale, K. Ocetkiewicz
    Academic press:
    Foundations of Computing and Decision Sciences (year: 2015, volume: 40, pages: 133–141), Publisher: De Gruyter
    Status:
    Published
    DOI:
    10.1515/fcds-2015-0009 – link to the publication
  45. The computational complexity of the backbone coloring problem for planar graphs with connected backbones

    Authors:
    R. Janczewski, K. Turowski
    Academic press:
    Discrete Applied Mathematics (year: 2015, volume: 164, pages: 237-242), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2014.10.028 – link to the publication
  46. Bipartite theory of graphs: outer-independent domination

    Authors:
    M. Krzywkowski, Y. Venkatakrishnan
    Academic press:
    National Academy Science Letters (year: 2015, volume: 38, pages: 169-172), Publisher: Springer
    Status:
    Published
    DOI:
    10.1007/s40009-014-0315-7 – link to the publication
  47. An O(nlogn) algorithm for finding edge span of cacti

    Authors:
    R. Janczewski, K. Turowski
    Academic press:
    Journal of Combinatorial Optimization (year: 2015, volume: 0, pages: 46032), Publisher: Springer
    Status:
    Published
    DOI:
    10.1007/s10878-015-9827-4 – link to the publication
  48. Rendezvous of heterogeneous mobile agents in edge-weighted networks

    Authors:
    D. Dereniowski, R. Klasing, A. Kosowski, L. Kuszner
    Academic press:
    Theoretical Computer Science (year: 2015, volume: 608, pages: 219-230), Publisher: Elsevier
    Status:
    Published
    DOI:
    link to the publication
  49. Distinguishing Views in Symmetric Networks: A Tight Lower Bound

    Authors:
    D. Dereniowski, A. Kosowski, D. Pająk
    Academic press:
    Theoretical Computer Science (year: 2015, volume: 582, pages: 27-34), Publisher: Elsevier
    Status:
    Published
    DOI:
    link to the publication
  50. Distributed graph searching with a sense of direction

    Authors:
    P. Borowiecki, D. Dereniowski, Ł. Kuszner
    Academic press:
    Distributed Computing (year: 2015, volume: 28, pages: 155-170), Publisher: Springer
    Status:
    Published
    DOI:
    10.1007/s00446-014-0236-1 – link to the publication
  51. Interval incidence graph coloring

    Authors:
    R. Janczewski, A. Małafiejska, M. Małafiejski
    Academic press:
    Discrete Applied Mathematics (year: 2015, volume: 182, pages: 73-83), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2014.03.006 – link to the publication
  52. Fast collaborative graph exploration

    Authors:
    D. Dereniowski, Y. Disser, A. Kosowski, D. Pająk, P. Uznański
    Academic press:
    Information and Computation (year: 2015, volume: 243, pages: 37-49), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.ic.2014.12.005 – link to the publication
  53. Zero-visibility cops and robber and the pathwidth of a graph

    Authors:
    D. Dereniowski, D. Dyer, R. M. Tifenbach, B. Yang
    Academic press:
    Journal of Combinatorial Optimization (year: 2015, volume: 29, pages: 541-564), Publisher: Springer
    Status:
    Published
    DOI:
    10.1007/s10878-014-9712-6 – link to the publication
  54. The complexity of minimum-length path decompositions

    Authors:
    D. Dereniowski, W. Kubiak, Y. Zwols
    Academic press:
    Journal of Computer and System Sciences (year: 2015, volume: 81, pages: 1715–1747), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2015.06.011 – link to the publication
  55. A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU

    Authors:
    P. Mironowicz, A. Dziekonski, and M. Mrozowski
    Academic press:
    SIAM J. Sci. Comput. (year: 2015, volume: 37, pages: 643-666), Publisher: SIAM
    Status:
    Published
    DOI:
    10.1137/14097135X – link to the publication
  56. Minimum order of graphs with given coloring parameters

    Authors:
    G. Bacso, P. Borowiecki, M. Hujter, Z. Tuza
    Academic press:
    Discrete Mathematics (year: 2015, volume: 338, pages: 621-632), Publisher: ELSEVIER
    Status:
    Published
    DOI:
    link to the publication
  57. 2-Outer-Independent Domination in Graphs

    Authors:
    N. Rad, M. Krzywkowski
    Academic press:
    National Academy Science Letters (year: 2015, volume: 38, pages: 263-269), Publisher: Springer
    Status:
    Published
    DOI:
    link to the publication
  58. The backbone coloring problem for bipartite backbones

    Authors:
    R. Janczewski, K. Turowski
    Status:
    Accepted for publication
  59. On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral

    Authors:
    J. Dybizbański, T. Dzido, S. Radziszowski
    Status:
    Accepted for publication
  60. Equitable colorings of corona multiproducts of graphs

    Authors:
    H. Furmańczyk, M. Kubale, V. V. Mkrtchyan
    Status:
    Accepted for publication
  61. Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines

    Authors:
    H. Furmańczyk, M. Kubale
    Status:
    Accepted for publication
  62. Strategic balance in graphs

    Authors:
    R. Lewoń, A. Małafiejska, M. Małafiejski
    Status:
    Accepted for publication
  63. Global defensive sets in graphs

    Authors:
    R. Lewoń, A. Małafiejska, M. Małafiejski
    Status:
    Accepted for publication
  64. Interval incidence coloring of subcubic Graphs

    Authors:
    A. Małafiejska, M. Małafiejski
    Status:
    Accepted for publication
  65. On incidence coloring of complete multipartite and semicubic bipartite graphs

    Authors:
    R. Janczewski, A. Małafiejska, M. Małafiejski
    Status:
    Accepted for publication

Articles in post-conference publications (15)

  1. Zero-visibility cops and robber game on a graph

    Authors:
    D. Dereniowski D. Dyer, R. Tifenbach, B. Yang
    Conference:
    Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, LNCS 7924 (year: 2013, pages: 175-186), Publisher: Springer
    Date:
    conference 26-28.06.2013
    Status:
    Published
    DOI:
    link to the publication
  2. Fast collaborative graph exploration

    Authors:
    D. Dereniowski, Y. Disser, A. Kosowski, D. Pająk, P. Uznański
    Conference:
    Automata, Languages and Programming, LNCS 7966 (year: 2013, pages: 520—532), Publisher: Springer
    Date:
    conference 2013
    Status:
    Published
    DOI:
    link to the publication
  3. Collision-free network exploration

    Authors:
    J. Czyżowicz, D. Dereniowski, L. Gąsieniec, R. Klasing, A. Kosowski, D. Pająk
    Conference:
    Proc. LATIN 2014 (year: 2014, pages: 342-354), Publisher: Springer (LNCS 8392)
    Date:
    conference 31.03.2014-04.04.2014
    Status:
    Published
  4. Minimal double dominating sets in trees

    Authors:
    M. Krzywkowski
    Conference:
    FAW 2014 (year: 2014, pages: 151-157), Publisher: Spriger
    Date:
    conference 2014-2014
    Status:
    Published
  5. Rendezvous of heterogeneous mobile agents in edge-weighted networks

    Authors:
    D. Dereniowski, R. Klasing, A. Kosowski, Ł. Kuszner
    Conference:
    SIROCCO 2014 (year: 2014, pages: 311-326), Publisher: Springer (LNCS 8576)
    Date:
    conference 23.07.2014-25.07.2014
    Status:
    Published
  6. Bounds on the cover time of parallel rotor walks

    Authors:
    D. Dereniowski, A. Kosowski, D. Pająk, P. Uznański
    Conference:
    STACS (year: 2014, pages: 263-275), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Date:
    conference 08.03.2014-08.03.2014
    Status:
    Published
  7. Rendezvous of distance-aware mobile agents in unknown graphs

    Authors:
    S. Das, D. Dereniowski, A. Kosowski, P. Uznański
    Conference:
    SIROCCO 2014 (year: 2014, pages: 295-310), Publisher: Spriner (LNCS 8576)
    Date:
    conference 23.07.2014-25.07.2014
    Status:
    Published
  8. The complexity of zero-visibility Cops and Robber

    Authors:
    D. Dereniowski, D. Dyer, R. Tifenbach, B. Yang
    Conference:
    FAW 2014 (year: 2014, pages: 60-70), Publisher: Spriner (LNCS 8576)
    Date:
    conference 28.06.2014-30.06.2014
    Status:
    Published
  9. Temporal Flows in Temporal Networks

    Authors:
    E.i C. Akrida, J. Czyzowicz, L. Gąsieniec, Ł. Kuszner, P. G. Spirakis
    Conference:
    International Conference on Algorithms and Complexity (year: 2017, pages: 43-54), Publisher: Springer
    Date:
    conference 24-26.05.2017
    Status:
    Published
  10. Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs

    Authors:
    H. Furmańczyk, M. Kubale
    Conference:
    Bordeaux Graph Workshop (year: 2016, pages: 138-140), Publisher: Eiseirb-Matmeca & LaBRI
    Date:
    conference 07-10.10.2016
    Status:
    Published
    DOI:
    link to the publication
  11. Szeregowanie identycznych zadań na czterech procesorach jednorodnych z dwudzielnymi grafami konfliktów

    Authors:
    M. Kubale
    Conference:
    Automatyzacja procesów dyskretnych: teoria i zastosowania (year: 2016, pages: 163-170), Publisher: Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego
    Date:
    conference wrzesień 2016
    Status:
    Published
  12. Distributed Evacuation in Graphs with Multiple Exits

    Authors:
    P. Borowiecki, S. Das, D. Dereniowski, Ł. Kuszner
    Conference:
    Structural Information and Communication Complexity, 23rd International Colloquium (year: 2016, pages: 228-241), Publisher: Suomela, Jukka Heidelberg: Springer, 2016, LNCS 9988
    Date:
    conference 19-21.07.2016
    Status:
    Published
    DOI:
    link to the publication
  13. Evolution of animats following a moving target in an artificial ecosystem

    Authors:
    J. Erdei, B. Wróbel
    Conference:
    14. SSLS (ALIFE'14) (year: 2014, pages: 98-104), Publisher: The MIT Press
    Date:
    conference 2014
    Status:
    Published
  14. A bound on the number of middle -stage crossbars in f -cast rearrangeable Clos networks

    Authors:
    M. Kubale, P. Obszarski
    Conference:
    Recent Advances on Systems, Signals, Control, Communications and Computers (year: 2015, pages: 51-54), Publisher: WSEAS Press
    Date:
    conference December 12-14, 2015
    Status:
    Published
    DOI:
    link to the publication
  15. Deterministic Rendezvous in Restricted Graphs

    Authors:
    A. Farrugia, L. Gąsieniec, Ł. Kuszner, E. Pacheco
    Conference:
    SOFSEM 2015: Theory and Practice of Computer Science (year: 2015, pages: 189-200), Publisher: Springer (LNCS 8939)
    Date:
    conference January 24-29, 2015
    Status:
    Published
    DOI:
    link to the publication

Book publications / chapters in book publications (2)

  1. Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych

    Authors:
    H. Furmańczyk, M. Kubale
    Book:
    Automatyzacja Procesów Dyskretnych (year: 2014, volume: I, pages: 77-82), Publisher: Politechnika Śląska
    Status:
    Published
  2. On some open questions for Ramsey and Folkman numbers

    Authors:
    X. Xu, S. Radziszowski
    Book:
    Graph Theory, Favorite Conjectures and Open Problems (year: 2016, volume: 1, pages: 43-62), Publisher: Springer
    Status:
    Published
    DOI:
    link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski