Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

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

2011/02/A/ST6/00201

Keywords:

discrete algorithms computational complexity graph coloring task scheduling graph exploration graph searching phylogenic trees

Descriptors:

  • ST6_7:

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

woj. 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 (Y-m-d): 2012-06-05

Project end date (Y-m-d): 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 (70)
  • Articles in post-conference publications (15)
  • Book publications / chapters in book publications (2)
  1. On a matching distance between rooted phylogenetic trees
    Authors:
    D. Bogdanowicz, K. Giaro
    Academic press:
    Int. Journal of Applied Mathematics and Computer Science (rok: 2012, tom: 23, strony: 195-214), Wydawca: Univ. Zielona Góra Press
    Status:
    Published
    DOI:
    link to the publication
  2. Modele i metody kolorowania grafów. Część II.
    Authors:
    M. Kubale
    Academic press:
    Przegląd Elektrotechniczny (rok: 2012, tom: 11A, strony: 51-55), Wydawca: SIGMA-NOT
    Status:
    Published
  3. 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 (rok: 2016, tom: 82, strony: 802-816), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2016.01.004 - link to the publication
  4. 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 (rok: 2013, tom: 20, strony: #P19), Wydawca: Electronic Journal of Combinatorics
    Status:
    Published
    DOI:
    link to the publication
  5. Rendezvous of heterogeneous mobile agents in edge-weighted networks
    Authors:
    D. Dereniowski, R. Klasing, A. Kosowski, L. Kuszner
    Academic press:
    Theoretical Computer Science (rok: 2015, tom: 608, strony: 219-230), Wydawca: Elsevier
    Status:
    Published
    DOI:
    link to the publication
  6. 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. (rok: 2015, tom: 63, strony: 739-744), Wydawca: Polska Akademia Nauk
    Status:
    Published
  7. On-line Ramsey Numbers of Paths and Cycles
    Authors:
    J. Cyman, T. Dzido, J. Lapinskas, A. Lo
    Academic press:
    Electronic Journal of Combinatorics (rok: 2015, tom: 22, strony: #P1.15), Wydawca: Electronic Journal of Combinatorics
    Status:
    Published
    DOI:
    link to the publication
  8. On a local similarity of graphs
    Authors:
    T. Dzido, K. Krzywdziński
    Academic press:
    Discrete Mathematics (), Wydawca: ELSEVIER
    Status:
    Published
    DOI:
    10.1016/j.disc.2015.01.016 - link to the publication
  9. 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 (), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10951-015-0446-9 - link to the publication
  10. Interval incidence coloring of bipartite graphs
    Authors:
    R. Janczewski, A. Małafiejska, M. Małafiejski
    Academic press:
    Discrete Applied Mathematics (rok: 2014, tom: 166, strony: 131-140), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.007 - link to the publication
  11. Interval incidence graph coloring
    Authors:
    R. Janczewski, A. Małafiejska, M. Małafiejski
    Academic press:
    Discrete Applied Mathematics (rok: 2015, tom: 182, strony: 73-83), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2014.03.006 - link to the publication
  12. On the hardness of computing span of subcubic graphs
    Authors:
    R. Janczewski, K. Turowski
    Academic press:
    Information Processing Letters (rok: 2016, tom: 116, strony: 26-32), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.ipl.2015.08.009 - link to the publication
  13. 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 (rok: 2015, tom: 115, strony: 232–236), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.ipl.2014.09.018 - link to the publication
  14. 2-boudage in graphs
    Authors:
    M. Krzykowski
    Academic press:
    Int. Journal of Computer Mathematics (rok: 2013, tom: 90, strony: 1358-1365), Wydawca: Taylor & Francis
    Status:
    Published
    DOI:
    10.1080/00207160.2012.752817 - 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 (rok: 2012, tom: 160, strony: 2199-2207), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2012.05.014 - link to the publication
  16. 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 (rok: 2015, tom: 40, strony: 133–141), Wydawca: De Gruyter
    Status:
    Published
    DOI:
    10.1515/fcds-2015-0009 - link to the publication
  17. Wheel and star-critical Ramsey numbers for quadrilateral
    Authors:
    Y. Wua, Y. Suna, S. P. Radziszowski
    Academic press:
    Discrete Applied Mathematics (rok: 2015, tom: 186, strony: 260-271), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2015.01.003 - link to the publication
  18. 2-Outer-Independent Domination in Graphs
    Authors:
    N. Rad, M. Krzywkowski
    Academic press:
    National Academy Science Letters (rok: 2015, tom: 38, strony: 263-269), Wydawca: Springer
    Status:
    Published
    DOI:
    link to the publication
  19. 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 (), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2016.11.008 - link to the publication
  20. Minimum order of graphs with given coloring parameters
    Authors:
    G. Bacso, P. Borowiecki, M. Hujter, Z. Tuza
    Academic press:
    Discrete Mathematics (), Wydawca: ELSEVIER
    Status:
    Published
    DOI:
    brak - link to the publication
  21. The computational complexity of the backbone coloring problem for planar graphs with connected backbones
    Authors:
    R. Janczewski, K. Turowski
    Academic press:
    Discrete Applied Mathematics (rok: 2015, tom: 164, strony: 237-242), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.028 - link to the publication
  22. Edge-coloring of 3-uniform hypergraphs
    Authors:
    P. Obszarski, A. Jastrzębski
    Academic press:
    Discrete Applied Mathematic (rok: 2017, tom: 217, strony: 48-52), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2016.06.009 - link to the publication
  23. An O(nlogn) algorithm for finding edge span of cacti
    Authors:
    R. Janczewski, K. Turowski
    Academic press:
    Journal of Combinatorial Optimization (rok: 2015, ), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10878-015-9827-4 - link to the publication
  24. The complexity of minimum-length path decompositions
    Authors:
    D. Dereniowski, W. Kubiak, Y. Zwols
    Academic press:
    Journal of Computer and System Sciences (rok: 2015, tom: 81, strony: 1715–1747), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2015.06.011 - link to the publication
  25. Shared multi-processor scheduling
    Authors:
    D. Dereniowski, W. Kubiak
    Academic press:
    European Journal of Operational Research (rok: 2017, tom: 261, strony: 503-514), Wydawca: ELSEVIER
    Status:
    Published
    DOI:
    10.1016/j.ejor.2017.03.002 - link to the publication
  26. Optimal backbone coloring of split graphs with matching backbones
    Authors:
    K. Turowski
    Academic press:
    Discussiones Mathematicae Graph Theory (rok: 2015, tom: 35, strony: 157-169), Wydawca: De Gruyter
    Status:
    Published
    DOI:
    10.7151/dmgt.1786 - link to the publication
  27. 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 (rok: 2017, tom: 86, strony: 70-81), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2016.11.008 - link to the publication
  28. Independence in uniform linear triangle-free hypergraphs
    Authors:
    P. Borowiecki, M. Gentner, Ch. Löwenstein, D. Rautenbach
    Academic press:
    Discrete Mathematics (rok: 2016, tom: 339, strony: 1878-1883), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.disc.2016.01.006 - link to the publication
  29. TreeCmp: Comparison of trees in polynomial time
    Authors:
    D. Bogdanowicz, K. Giaro, B. Wróbel
    Academic press:
    Evolutionary Bioinformatics (rok: 2012, tom: 8, strony: 475-487), Wydawca: Libertas Academica
    Status:
    Published
    DOI:
    10.4137/ebo.s9657 - link to the publication
  30. Non-isolating bondage in graphs
    Authors:
    M. Krzywkowski
    Academic press:
    Bulletin of the Malaysian Mathematical Sciences Society (rok: 2016, tom: 39, strony: 219–227), Wydawca: Universiti Sains Malaysia
    Status:
    Published
    DOI:
    10.1007/s40840-015-0290-2 - link to the publication
  31. An algorithm for listing all minimal double dominating sets of a tree
    Authors:
    M. Krzywkowski
    Academic press:
    Fundamenta Informaticae (rok: 2014, tom: 130, strony: 415-421), Wydawca: POLISH MATHEMATICAL SOCIETY
    Status:
    Published
    DOI:
    10.3233/FI-2014-998 - link to the publication
  32. 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 (rok: 2015, tom: 29, strony: 541-564), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10878-014-9712-6 - link to the publication
  33. On-line ranking of split graphs
    Authors:
    P. Borowiecki, D. Dereniowski
    Academic press:
    Discrete Mathematics and Theoretical Comp. Sci. (rok: 2013, tom: 15, strony: 195-214), Wydawca: DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE
    Status:
    Published
    DOI:
    link to the publication
  34. On a local similarity of graphs
    Authors:
    T. Dzido, K. Krzywdziński
    Academic press:
    Discrete Mathematics (rok: 2015, tom: 338, strony: 983–989), Wydawca: ELSEVIER
    Status:
    Published
    DOI:
    10.1016/j.disc.2015.01.016 - link to the publication
  35. The complexity of zero-visibility cops and robber
    Authors:
    D. Dereniowski, D. Dyer, R. M. Tifenbach, B. Yang
    Academic press:
    Theoretical Computer Science (rok: 2015, tom: 607, strony: 135-148), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2015.03.022 - link to the publication
  36. Bipartite theory of graphs: outer-independent domination
    Authors:
    M. Krzywkowski, Y. Venkatakrishnan
    Academic press:
    National Academy Science Letters (rok: 2015, tom: 38, strony: 169-172), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s40009-014-0315-7 - link to the publication
  37. Interval incidence coloring of subcubic graphs
    Authors:
    A. Małafiejska , M. Małafiejski
    Academic press:
    Discussiones Mathematicae Graph Theory (rok: 2017, tom: 37, strony: 427-441), Wydawca: De Gruyter
    Status:
    Published
    DOI:
    10.7151/dmgt.1962 - 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 (rok: 2017, tom: 24, strony: 422-435), Wydawca: Mary Ann Liebert, Inc.
    Status:
    Published
    DOI:
    10.1089/cmb.2016.0204 - link to the publication
  39. Independence in uniform linear triangle-free hypergraphs
    Authors:
    P. Borowiecki, M. Gentner, Ch. Löwenstein, D. Rautenbach
    Academic press:
    Discrete Mathematics (), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.disc.2016.01.006 - link to the publication
  40. The complexity of zero-visibility cops and robber
    Authors:
    D. Dereniowski, D. Dyer, R. M. Tifenbach, B. Yang
    Academic press:
    Theoretical Computer Science (), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2015.03.022 - link to the publication
  41. Some lower bounds on the Shannon capacity
    Authors:
    M. Jurkiewicz, M. Kubale, K. Turowski
    Academic press:
    Journal of Applied Computer Science (rok: 2014, tom: 22, strony: 31-42), Wydawca: Instytut Informatyki, Politechnika Łódzka
    Status:
    Published
  42. New potential functions for greedy independence and coloring
    Authors:
    P. Borowiecki, D. Rautenbach
    Academic press:
    Discrete Applied Mathematics (rok: 2015, tom: 182, strony: 61-72), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2013.12.011 - link to the publication
  43. 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 (rok: 2016, tom: 19, strony: 701-728), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10951-015-0446-9 - link to the publication
  44. Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
    Authors:
    H. Furmańczyk, M. Kubale
    Academic press:
    ARS MATHEMATICA CONTEMPORANEA (rok: 2016, tom: 10, strony: 333-347), Wydawca: University of Primorska
    Status:
    Published
    DOI:
    link to the publication
  45. Distinguishing Views in Symmetric Networks: A Tight Lower Bound
    Authors:
    D. Dereniowski, A. Kosowski, D. Pająk
    Academic press:
    Theoretical Computer Science (rok: 2015, tom: 582, strony: 27-34), Wydawca: Elsevier
    Status:
    Published
    DOI:
    link to the publication
  46. On bipartization of cubic graphs by removal of an independent set
    Authors:
    H. Furmańczyk, M. Kubale, S. Radziszowski
    Academic press:
    Discrete Applied Mathematics (rok: 2016, tom: 209, strony: 115–121), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.036 - link to the publication
  47. 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. (rok: 2015, tom: 37, strony: 643-666), Wydawca: SIAM
    Status:
    Published
    DOI:
    10.1137/14097135X - link to the publication
  48. On homogeneously representable interval graphs
    Authors:
    M. Krzywkowski, J. Topp
    Academic press:
    National Academy Science Letters (rok: 2016, tom: 39, strony: 39-41), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s40009-015-0397-x - link to the publication
  49. Edge-coloring of 3-uniform hypergraphs
    Authors:
    P. Obszarski, A. Jastrzębski
    Academic press:
    Discrete Applied Mathematics (rok: 2017, tom: 217, strony: 48-52), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2016.06.009 - link to the publication
  50. 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 (rok: 2015, tom: 25, strony: 109–116), Wydawca: De Gruyter
    Status:
    Published
    DOI:
    10.1515/acsc-2015-0007 - link to the publication
  51. Rendezvous of heterogeneous mobile agents in edge-weighted networks
    Authors:
    D. Dereniowski, R. Klasing, A. Kosowski, L. Kuszner
    Academic press:
    Theoretical Computer Science (), Wydawca: Elsevier
    Status:
    Published
    DOI:
    brak - link to the publication
  52. Maximum matching in multi-interface networks
    Authors:
    A. Kosowski et al.
    Academic press:
    Theoretical Computer Science (rok: 2012, tom: 507, strony: 52-60), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2013 - link to the publication
  53. Bounds on the vertex-edge domination number of a tree
    Authors:
    B. Krishnakumari, Y. Venkatakrishnan, M. Krzywkowski
    Academic press:
    Comptes Rendus Mathématique (rok: 2014, tom: 352, strony: 363-366), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.crma.2014.03.017 - link to the publication
  54. Non-isolating 2-bondage in graphs
    Authors:
    M. Krzywkowski
    Academic press:
    Journal of Mathematical Society Japan (rok: 2013, tom: 65, strony: 37-50), Wydawca: Math. Society of Japan
    Status:
    Published
    DOI:
    10.2969/jmsj/06510037 - link to the publication
  55. 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 (rok: 2012, tom: 31, strony: 349-369), Wydawca: Slovak Acad. Sci.
    Status:
    Published
    DOI:
    link to the publication
  56. Brushing with additional cleaning restrictions
    Authors:
    P. Borowiecki, D. Dereniowski, P. Prałat
    Academic press:
    Theoretical Computer Science (rok: 2014, tom: 557, strony: 76-86), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2014.09.005 - link to the publication
  57. Minimal 2-dominating sets in trees
    Authors:
    M. Krzywkowski
    Academic press:
    RAIRO – Theoretical Informatics and Applications (rok: 2013, tom: 47, strony: 235-240), Wydawca: Cambridge University Press
    Status:
    Published
    DOI:
    10.1051/ita/2013036 - link to the publication
  58. Minimum order of graphs with given coloring parameters
    Authors:
    G. Bacso, P. Borowiecki, M. Hujter, Z. Tuza
    Academic press:
    Discrete Mathematics (rok: 2015, tom: 338, strony: 621-632), Wydawca: ELSEVIER
    Status:
    Published
    DOI:
    link to the publication
  59. Partial dominated schedules and minimizing the total completion time of deteriorating jobs
    Authors:
    K. Ocetkiewicz
    Academic press:
    Optimization (rok: 2013, tom: 62, strony: 1341-1356), Wydawca: Taylor & Francis
    Status:
    Published
    DOI:
    10.1080/02331934.2013.836647 - link to the publication
  60. 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 (rok: 2013, tom: 11, strony: 103-120), Wydawca: Pushpa Publishing House
    Status:
    Published
  61. Distributed graph searching with a sense of direction
    Authors:
    P. Borowiecki, D. Dereniowski, Ł. Kuszner
    Academic press:
    Distributed Computing (rok: 2015, tom: 28, strony: 155-170), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s00446-014-0236-1 - link to the publication
  62. 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 (rok: 2017, tom: 65, strony: 29 - 34), Wydawca: DE GRUYTER
    Status:
    Published
    DOI:
    10.1515/bpasts-2017-0004 - link to the publication
  63. On incidence coloring of complete multipartite and semicubic bipartite graphs
    Authors:
    R. Janczewski, 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 Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral
    Authors:
    J. Dybizbański, T. Dzido, S. Radziszowski
    Status:
    Accepted for publication
  66. Equitable colorings of corona multiproducts of graphs
    Authors:
    H. Furmańczyk, M. Kubale, V. V. Mkrtchyan
    Status:
    Accepted for publication
  67. Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
    Authors:
    H. Furmańczyk, M. Kubale
    Status:
    Accepted for publication
  68. Strategic balance in graphs
    Authors:
    R. Lewoń, A. Małafiejska, M. Małafiejski
    Status:
    Accepted for publication
  69. Global defensive sets in graphs
    Authors:
    R. Lewoń, A. Małafiejska, M. Małafiejski
    Status:
    Accepted for publication
  70. The backbone coloring problem for bipartite backbones
    Authors:
    R. Janczewski, K. Turowski
    Status:
    Accepted for publication
  1. Rendezvous of heterogeneous mobile agents in edge-weighted networks
    Authors:
    D. Dereniowski, R. Klasing, A. Kosowski, Ł. Kuszner
    Conference:
    SIROCCO 2014 (rok: 2014, ), Wydawca: Springer (LNCS 8576)
    Data:
    konferencja 23.07.2014-25.07.2014
    Status:
    Published
  2. Rendezvous of distance-aware mobile agents in unknown graphs
    Authors:
    S. Das, D. Dereniowski, A. Kosowski, P. Uznański
    Conference:
    SIROCCO 2014 (rok: 2014, ), Wydawca: Spriner (LNCS 8576)
    Data:
    konferencja 23.07.2014-25.07.2014
    Status:
    Published
  3. Minimal double dominating sets in trees
    Authors:
    M. Krzywkowski
    Conference:
    FAW 2014 (rok: 2014, ), Wydawca: Spriger
    Data:
    konferencja 2014-2014
    Status:
    Published
  4. 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 (rok: 2015, ), Wydawca: WSEAS Press
    Data:
    konferencja December 12-14, 2015
    Status:
    Published
    DOI:
    link to the publication
  5. Deterministic Rendezvous in Restricted Graphs
    Authors:
    A. Farrugia, L. Gąsieniec, Ł. Kuszner, E. Pacheco
    Conference:
    SOFSEM 2015: Theory and Practice of Computer Science (rok: 2015, ), Wydawca: Springer (LNCS 8939)
    Data:
    konferencja January 24-29, 2015
    Status:
    Published
    DOI:
    link to the publication
  6. Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
    Authors:
    H. Furmańczyk, M. Kubale
    Conference:
    Bordeaux Graph Workshop (rok: 2016, ), Wydawca: Eiseirb-Matmeca & LaBRI
    Data:
    konferencja 07-10.10.2016
    Status:
    Published
    DOI:
    link to the publication
  7. Collision-free network exploration
    Authors:
    J. Czyżowicz, D. Dereniowski, L. Gąsieniec, R. Klasing, A. Kosowski, D. Pająk
    Conference:
    Proc. LATIN 2014 (rok: 2014, ), Wydawca: Springer (LNCS 8392)
    Data:
    konferencja 31.03.2014-04.04.2014
    Status:
    Published
  8. 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 (), Wydawca: WSEAS Press
    Data:
    konferencja December 12-14, 2015
    Status:
    Published
    DOI:
    link to the publication
  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 (rok: 2017, ), Wydawca: Springer
    Data:
    konferencja 24-26.05.2017
    Status:
    Published
  10. 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 (), Wydawca: Springer
    Data:
    konferencja 24-26.05.2017
    Status:
    Published
  11. Distributed Evacuation in Graphs with Multiple Exits
    Authors:
    P. Borowiecki, S. Das, D. Dereniowski, Ł. Kuszner
    Conference:
    Structural Information and Communication Complexity, 23rd International Colloquium (), Wydawca: Suomela, Jukka Heidelberg: Springer, 2016, LNCS 9988
    Data:
    konferencja 19-21.07.2016
    Status:
    Published
    DOI:
    link to the publication
  12. Szeregowanie identycznych zadań na czterech procesorach jednorodnych z dwudzielnymi grafami konfliktów
    Authors:
    M. Kubale
    Conference:
    Automatyzacja procesów dyskretnych: teoria i zastosowania (rok: 2016, ), Wydawca: Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego
    Data:
    konferencja wrzesień 2016
    Status:
    Published
  13. Distributed Evacuation in Graphs with Multiple Exits
    Authors:
    P. Borowiecki, S. Das, D. Dereniowski, Ł. Kuszner
    Conference:
    Structural Information and Communication Complexity, 23rd International Colloquium (rok: 2016, ), Wydawca: Suomela, Jukka Heidelberg: Springer, 2016, LNCS 9988
    Data:
    konferencja 19-21.07.2016
    Status:
    Published
    DOI:
    link to the publication
  14. Bounds on the cover time of parallel rotor walks
    Authors:
    D. Dereniowski, A. Kosowski, D. Pająk, P. Uznański
    Conference:
    STACS (rok: 2014, ), Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 08.03.2014-08.03.2014
    Status:
    Published
  15. 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 (rok: 2013, ), Wydawca: Springer
    Data:
    konferencja 26-28.06.2013
    Status:
    Published
    DOI:
    link to the publication
  1. Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
    Authors:
    H. Furmańczyk, M. Kubale
    Book:
    Automatyzacja Procesów Dyskretnych (rok: 2014, tom: I, strony: 77-82), Wydawca: 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 (rok: 2016, tom: 1, strony: 43-62), Wydawca: Springer
    Status:
    Published
    DOI:
    link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy