Publikacje w czasopismach z listy JCR

2016

1.

Furmańczyk H.,
Jastrzębski A.,
Kubale M.

Equitable coloring of graphs. Recent theoretical results and new practical algorithms// Archives of Control Sciences. -Vol. 26., nr. 3 (2016), s. 281-295

2.

Lewoń R.,
Małafiejska A.,
Małafiejski M.

Global defensive sets in graphs// DISCRETE MATHEMATICS. -Vol. 339, iss. 7 (2016), s.1861-1870, JCR 139076.

3.

Lewoń R.,
Małafiejska A.,
Małafiejski M.

Strategic balance in graphs// DISCRETE
MATHEMATICS. -Vol. 339, iss. 7 (2016), s.1837-1847, JCR 139075.

4.

Furmańczyk H.,
Kubale M.,
Radziszowski S.

On bipartization of cubic graphs by removal of an independent set// DISCRETE APPLIED MATHEMATICS. -Vol. 209, (2016), s.115-121, JCR 138472.

5.

Borowiecki P.,
Gentner M.,
Löwenstein C.,
Rautenbach D.

Independence in uniform linear triangle-free hypergraphs// DISCRETE MATHEMATICS. -Vol. 339, iss. 7 (2016), s.1878-1883, JCR 137822.

6.

Mironowicz P.,
Tavakoli A.,
Hameedi A.,
Marques B.,
Pawłowski M.,
Bourennane M.

Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing// NEW JOURNAL OF PHYSICS. -Vol. 18, (2016), s.1-8, JCR 137151.

7.

Dereniowski D.,
Kosowski A.,
Pająk D.,
Uznański P.

Bounds on the cover time of parallel rotor walks// JOURNAL OF COMPUTER AND SYSTEM SCIENCES. -Vol. 82, iss. 5 (2016), s.802-816, JCR 137102.

8.

Furmańczyk H.,
Kubale M.

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring// ARS Mathematica Contemporanea. -Vol. 10, nr. 2 (2016), s.333-347, JCR 137035.

9.

Dereniowski D.,
Pelc A.

Topology recognition and leader election in colored networks// THEORETICAL COMPUTER SCIENCE. -Vol. 621, (2016), s.92-102, JCR 136656.

10.

Janczewski R.,
Turowski K.

On the hardness of computing span of subcubic graphs// INFORMATION PROCESSING LETTERS. -Vol. 116, iss. 1 (2016), s.26-32 Data wydruku: 13.01.2017 10:30 Strona 2 z 2, JCR 135906.

11.

Chen B.,
Coffman E.,
Dereniowski D.,
Kubiak W.

Normal-form preemption sequences for an open problem in scheduling theory// JOURNAL OF SCHEDULING. -Vol. 19, iss. 6 (2016), s.
701-728, JCR 135119.

12.

Janczewski R.,
Turowski K.

An O(nlogn) algorithm for finding edge span of cacti // JOURNAL OF COMBINATORIAL OPTIMIZATION. -Vol. 31, nr. 4 (2016), s.1372-1383, JCR 131251.

13.

Krzywkowski M.

Non-isolating bondage in graphs// Bulletin of the Malaysian Mathematical Sciences Society. -Vol. 39, nr. S1 (2016), s.219-227, JCR 130058.

2015

1.

Rahaman R.,
Parker M., Mironowicz P., Pawłowski M.

Device-independent quantum key distribution based on measurement inputs// PHYSICAL REVIEW A. -., iss. 6 (2015), s.1-9 JCR 135299.

2.

Dereniowski D.,
Dyer D.,
Tifenbach R.,
Yang B.

The complexity of zero-visibility cops and robber// THEORETICAL COMPUTER SCIENCE. -Vol. 607., nr. part 2 (2015), s.135-148 JCR 135137.

3.

Krzywkowski M.

An upper bound for the double outer-independent domination number of a tree// Georgian Mathematical Journal. -Vol. 22., iss. 1 (2015), s.105-109 JCR 135128.

4.

Krzywkowski M.

On trees attaining an upper bound on the total domination number// Bulletin of the Iranian Mathematical Society. -Vol. 41., iss. 6 (2015), s.1339-1344 JCR 135002.

5.

Mironowicz P., Dziekoński A., Mrozowski M.

A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU// SIAM JOURNAL ON SCIENTIFIC COMPUTING. -Vol. 37., nr. 6 (2015), s.643-666 JCR 134270.

6.

Dereniowski D., Kubiak W.,
Zwols Y.

The complexity of minimum-length path decompositions// JOURNAL OF COMPUTER AND SYSTEM SCIENCES. -Vol. 81., iss. 8 (2015), s. 1715-1747 JCR 134054.

7.

Obszarski P., Jastrzębski A., Kubale M.

Towards the boundary between easy and hard control problems in multicast Clos networks// Bulletin of the Polish Academy of SciencesTechnical Sciences. -Vol. 63., nr. 3 (2015), s.739-744 JCR 133699.

8.

Dybizbański J., Dzido T., Radziszowski S.

On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral// ARS COMBINATORIA. -Vol. 119., (2015), s.275-287 JCR 133683.

9.

Rad N.,
Krzywkowski M.

2-outer-independent domination in graphs// NATIONAL ACADEMY SCIENCE LETTERS-INDIA. -Vol. 38., iss. 3 (2015), s.263-269 JCR 133032.

10.

Mironowicz P., Gallego R., Pawłowski M.

Robust amplification of Santha-Vazirani sources with three devices// PHYSICAL REVIEW A. -Vol. 91., iss. 3 (2015), s.1-8 JCR 132522.

11.

Dereniowski D.,
Ono H.,
Suzuki I.,
Wrona Ł., Yamashita M., Żyliński P.

The searchlight  Data wydruku: 25.01.2016 09:31 Strona 2 z 3 problem for road networks// THEORETICAL COMPUTER SCIENCE. -Vol. 591., (2015), s.28-59 JCR 132470.

12.

Dereniowski D., Kosowski A.,
Pająk D.

Distinguishing views in symmetric networks: A tight lower bound// THEORETICAL COMPUTER SCIENCE. -Vol. 582., (2015), s.27-34 JCR 132469.

13.

Dereniowski D., Klasing R.,
Kosowski A., Kuszner Ł.

Rendezvous of heterogeneous mobile agents in edge-weighted networks// THEORETICAL COMPUTER SCIENCE. -Vol. 608., nr. Part 3 (2015), s.219-230 JCR 132425.

14.

Krzywkowski M.

On trees with equal 2-domination and 2-outer-independent domination numbers// INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS. -., iss. 1 (2015), s.1-5 JCR 132030.

15.

Janczewski R., Turowski K.

An O ( n log n ) algorithm for finding edge span of cacti PREPRINT// JOURNAL OF COMBINATORIAL OPTIMIZATION. -., (2015), JCR 131251.

16.

Janczewski R., Małafiejska A., Małafiejski M.

Interval incidence graph coloring// DISCRETE APPLIED MATHEMATICS. -Vol. 182., (2015), s.73-83 JCR 131017.

17.

Dereniowski D., Disser Y.,
Kosowski A.,
Pająk D.,
Uznański P.

Fast collaborative graph exploration // INFORMATION AND COMPUTATION. -Vol. 243., (2015), s.37-49 JCR 130505.

18.

Dereniowski D.,
Dyer D.,
Tifenbach R.,
Yang B.

Zero-visibility cops and robber and the pathwidth of a graph // JOURNAL OF COMBINATORIAL OPTIMIZATION. -Vol. 29., iss. 3 (2015), s.541-564 JCR 130501.

19.

Bacsó G., Borowiecki P.,
Hujter M.,
Tuza Z.

Minimum order of graphs with given coloring parameters// DISCRETE MATHEMATICS. -Vol. 338., iss. 4 (2015), s.621-632 JCR 130457.

20.

Janczewski R., Turowski K.

The computational complexity of the backbone coloring problem for planar graphs with connected backbones// DISCRETE APPLIED MATHEMATICS. -Vol. 184., (2015), s.237-242 JCR 130247.

21.

Krzywkowski M.

Non-isolating bondage in graphs. PREPRINT// Bulletin of the Malaysian Mathematical Sciences Society. -., (2015), s.1-10 JCR 130058.

22.

Krzywkowski M., Venkatakrishnan Y.

Bipartite theory of graphs: outer-independent domination// NATIONAL ACADEMY SCIENCE LETTERS-INDIA. -Vol. 38., nr. 2 (2015), s. 169-172 JCR 130057.

23.

Borowiecki P., Dereniowski D., Kuszner Ł.

Distributed graph searching with a sense of direction// DISTRIBUTED COMPUTING. -Vol. 28., iss. 3 (2015), s.155-170 JCR 129786.

24.

Janczewski R., Turowski K.

The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones// INFORMATION PROCESSING LETTERS. -Vol. 115., iss. 2 (2015), s.232-236 JCR 128699.

25.

Borowiecki P., Rautenbach D.

New potential functions for greedy independence and coloring// DISCRETE APPLIED MATHEMATICS -Vol. 182., (2015), s.61-72 JCR 126581.

26.

Turowski K.

Optimal backbone coloring of split graphs with matching backbones// Discussiones Mathematicae Graph Theory -Vol. 35., (2015), s.157-169 AR 128700.

27.

Krzywkowski M.

On trees with equal domination and total outer-independent domination numbers// UTILITAS MATHEMATICA., nr 98 (2015), s.197-206 JCR 94419.

2014

1.

Borowiecki P., Dereniowski D., Prałat P.

Brushing with additional cleaning restrictions// THEORETICAL COMPUTER SCIENCE. -Vol. 557.,  (2014), s.76-86, JCR 129102.

2.

Borowiecki P., Rautenbach D. New potential functions for greedy independence and coloring// DISCRETE APPLIED MATHEMATICS. -Vol. 182.,  (2014), s.61-72, JCR 126581.

3.

Czyżowicz J., Kosowski A.,
Pelc A.

Time versus space trade-offs for randezvous in trees// DISTRIBUTED COMPUTING. -Vol. 27., iss. 2 (2014), s.95-109, JCR 129198.

4.

Dereniowski D.,
Pelc A.

Leader election for anonymous asynchronous agents in arbitrary networks// DISTRIBUTED COMPUTING. -Vol. 27., iss. 1 (2014), s.21-38, JCR 124443.

5.

Janczewski R., Małafiejska A., Małafiejski M.

Interval incidence coloring of bipartite graphs// DISCRETE APPLIED MATHEMATICS. -Vol. 166.,  (2014), s.131-140, JCR 131016.

6.

Krishnakumari B., Venkatakrishnan Y., Krzywkowski M.

Bounds on the vertex-edge domination number of a tree// COMPTES RENDUS MATHEMATIQUE., nr 352 (2014), s.363-366, JCR 127759.

7.

Krzywkowski M.

An algorithm for listing all minimal double dominating sets of a tree// FUNDAMENTA INFORMATICAE. -Vol. 130., iss. 4 (2014), s.415-421, JCR 127760.

8.

Krzywkowski M., Venkatakrishnan Y.

Bipartite theory of graphs: outer-independent domination. - PREPRIN// NATIONAL ACADEMY SCIENCE LETTERS-INDIA. -.,  (2014),, JCR 130057.

9.

Mironowicz P.,
Li H.,
Pawłowski M.

Properties of dimension witnesses and their semidefinite programming relaxations// PHYSICAL REVIEW A 90(2), Vol. 90, iss. 2 (2014), s.1-13, JCR 12902.

2013

1.

Bogdanowicz D.,
Giaro K.

On a matching distance between rooted phylogenetic trees// International Journal of Applied Mathematics and Computer Science. -Vol. 23., nr. 3 (2013), s.669-684.

2.

Borowiecki P.,
Dereniowski D.

On-line ranking of split graphs// DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE. -Vol. 15., nr. 2 (2013), s.195-214.

3.

Dereniowski D.,
Pelc A.

Leader election for anonymous asynchronous agents in arbitrary networks// DISTRIBUTED COMPUTING. -Vol. 10.1007/s00446-013-0196-x., (2013).

4.

Dereniowski D.,
Kubiak W.,
Ries B.,
Zwols Y.

Optimal edge-coloring with edge rate constraints// NETWORKS. -Vol. 63., iss. 3 (2013), s.165-182.

5.

Dereniowski D.,
Dyer D.

On minimum cost edge searching// THEORETICAL COMPUTER SCIENCE. -Vol. 495., (2013), s.37-49.

6.

Dereniowski D.,
Yasar Diner O.,
Dyer D.

Three-fast-searchable graphs// DISCRETE APPLIED MATHEMATICS. -Vol. 161., iss. 13-14 (2013), s.1950-1958.

7.

Czyzowicz J.,
Kosowski A.,
Pelc A.

Deterministic Randevous of Asynchronous Bounded-Memory Agents in Polygonal Terrains// Theory Comput. Syst. 52 (2013), s. 179-199.

8.

Krzywkowski M.

Minimal 2-dominating sets in Trees// RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS. -Vol. 47., iss. 03 (2013), s.235-240.

9.

Krzywkowski M.

Trees having many minimal dominating sets// INFORMATION PROCESSING LETTERS. -Vol. 113., nr. 8 (2013), s.276-279.

10.

Krzywkowski M.

2-bondage in graphs// INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS. -Vol. 90., nr. 7 (2013), s.1358-1365.

11.

Krzywkowski M.

On the ratio between 2-domination and total outer-independent domination numbers of trees// CHINESE ANNALS OF MATHEMATICS SERIES B. -Vol. 34., iss. 5 (2013), s.765-776. s.37-50.

12.

Krzywkowski M.

Non-isolating 2-bondage in graphs// JOURNAL OF THE MATHEMATICAL SOCIETY OF JAPAN. -Vol. 65., nr. 1 (2013),

13.

Krzywkowski M.

On trees with double domination number equal to 2-domination number plus one// HOUSTON JOURNAL OF MATHEMATICS. -Vol. 39., nr. 2 (2013), s.427-440.

14.

Mironowicz P.,
Pawłowski M.

Robustness of quantum-randomness expansion protocols in the presence of noise// PHYSICAL REVIEW A. -Vol. 88., iss. 3 (2013), s.1-8.

15.

Ocetkiewicz K.

Partial dominated schedules and minimizing the total completion time of deteriorating jobs// OPTIMIZATION. -Vol. 62., nr. 10 (2013), s.1341-1356.

2012

1.

Bogdanowicz D.,
Giaro K.

Matching Split Distance for Unrooted Binary Phylogenetic Trees // IEEE-ACM Transactions on Computational Biology and Bioinformatics., volume: 9 lssue: 1 Pages: 150-160.

2.

Bogdanowicz D.,
Giaro K.,
Wróbel B.

TreeCmp: Comparison of Trees in Polynomial Time // Evolutionary Bioinformatics. - vol.  8 (2012), s. 475-487.

3.

Borowiecki P.,
Goering F.,
Harant J.,
Rautenbach D.

The Potential of Greed Independence //Journal of Graph Theory. – vol. 71, iss. 3, 2012, s. 245-259.

4.

Borowiecki P.,
Sidorowicz E.

Dynamic coloring of graphs // Fundamenta Informaticae. - Vol. 114, iss. 2 (2012), s. 105-128.

5.

Coffman jr. E.G.,
Dereniowski D.,
Kubiak W.

An efficient algorithm for finding ideal schedules // Acta Informatica. - T. 49, nr 1 (2012), s. 1-14.

6.

Czyżowicz J.,
Kosowski A.,
Pelc A.

How to meet when you forget: log-space rendezvous  in arbitrary graphs // Distributed Computing. –vol. 25 (2012), 165-178.

7.

Dereniowski D.

Approximate search strategies for weighted trees // Theoretical Computer Science. - Vol. 463 (2012), s. 96-113.

8.

Dereniowski D.

From Pathwidth to Connected Pathwidth // SIAM Journal on Discrete Mathematics. - Vol. 26, iss. 4 (2012), s. 1709-1732.

9.

Dereniowski D.,
Kubiak W.

Routing equal-size messages on a slotted ring  // Journal of Scheduling. - T. 15, nr 4 (2012), s. 473-486.

10.

Dereniowski D.,
Pelc A.

Drawing maps with advice // Journal of Parallel and Distributed Computing. - Vol. 72, iss. 2 (2012), s. 132-143.

11.

Hod R.,
Krzywkowski M.

A construction for the hat problem on a directed graph // Electronic Journal of Combinatorics. - Vol. 19 (2012), s. 9.

12.

Kosowski A.,
Navarra A.

Graph Decomposition for Memoryless Periodic Exploration  // Algorithmica. - Vol. 63, Iss. 1-2 (2012), s. 26-38.

13.

Kosowski A.,
Raspaud A.,
Foucaud F.,
Klasing R.

On the size of identifying codes in triangle-free graphs // Discrete Applied Mathematics. - Vol. 160, iss. 10-11 (2012), s. 1532-1546.

14.

Kosowski A.,
Suzuki I.,
Żyliński P.

A Point Set Connection Problem for Autonomous Mobile Robots in a Grid // Computing and Informatics. - Vol. 31, iss. 2 (2012), s. 349-369.

15.

Krzywkowski M.

On trees with double domination number equal to 2-outer-independent domination number plus one // Chinese Annals of Mathematics Series B. - 33, 1 (2012), s. 113-126.

16.

Kubale M.

Modele i metody kolorowania grafów. Część II // Przegląd Elektrotechniczny. – (2012), nr 11a, s. 51-55.

2011

1.

Bogdanowicz D.,
Giaro K.,
Janczewski R.

Consensus models: Computational complexity aspects in modern approaches to the list coloring problem // Theoretical Computer Science. - Vol. 412, iss. 35 (2011), s. 4721-4728.

2.

Dereniowski D.

Drawing maps with advice // Journal of Parallel and Distributed Computing. - Vol. 72, iss. 2 (2011), s. 132-143.

3.

Dereniowski D.

The complexity of node blocking for dags // Journal of Combinatorial Theory series A. - Vol. 118, Iss. 1 (2011), s. 248-256.

4.

Dereniowski D.

Connected searching of weighted tress// Theoretical Computer Science, - Vol. 412, iss.41 (2011), s. 5700-5713.

5.

Kosowski A., Navarra A., Pinotti C.

Synchronous black hole search in directed graphs // Theoretical Computer Science. - Vol. 412, iss. 41 (2011), s. 5752-5759.

6.

Krzywkowski M. :

A lower bound on the total outer-independent domination number of a tree // Comptes Rendus Mathématique. - Vol. 349, Iss. 1 (2011), s. 7-9.

7.

Krzywkowski M. :

An upper bound on the 2-outer-independent domination number of a tree // Comptes Rendus Mathématique. - Vol. 349, Iss. 1 (2011), s. 1123-1125.

8.

Krzywkowski M.

On trees with double domination number equal to total domination number plus one // Ars Combinatoria. - Vol. 102 (2011), s. 3-10.

9.

Krzywkowski M.

The hat problem on cycles on at least nine vertices // Ars Combinatoria. - Vol. 101 (2011), s. 3-13.

2010

1.

Borowiecki P.,
Borowiecki M.,
Sidorowicz E.,
Skupień Z.

On extremal sizes of locally k-tree graphs, Czechoslovak Mathematical Journal 60 2 (2010), s. 571-587.

2.

Dereniowski D.,
Kubiak W.

Makespan minimization of multisot just-in-time scheduling on single and paralel machines, Journal of Scheduling 13 (2010), s. 479-492.

3.

Klasing R.,
Kosowski A.,
Navarra A.

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring // Theoretical Computer Science. - Vol. 411, Iss. 34-36 (2010), s. 3235-3246.

4.

Kosowski A., Navarra A., Pinotti C.

Exploiting multi-interface networks: Connectivity and Cheapest Paths // Wireless Networks. - Vol. 16, Iss. 4 (2010), s. 1063-1073.

5.

Kosowski K.,
Tucki K.,
Kosowski A.

Application of Artificial neural Networks in Investigations of Steam Turbine cascades, Journal of turbomachinery-transactions of the ASME – Vol. 132, iss.1 (2010), s. 1-5.

6.

Kubale M.

Modele i metody kolorowania grafów. Część I // Przegląd Elektrotechniczny. - R. 86, Nr 9 (2010), s. 115-117.

2009

1.

Dereniowski D.

Maximum vertex occupation time and inert fugitive: recontamination does help //Information Processing Letters. Vol. 109, iss. 9 April (2009), s. 422-426.

2.

Giaro K.,
Kubale M.,
Obszarski P.

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints // Discrete Applied Mathematics. - Vol. 157, iss. 17, October 28. (2009), s. 3625-3630.

3.

Janczewski R.,
Kosowski A.,
Małafiejski M.

The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree // Discrete Mathematics. - Vol. 309 (2009), s. 3270-3279.

4.

Janczewski R.

Greedy T-colorings of graphs // Discrete Mathematics. - Vol. 309 (2009), s. 1685-1690.

5.

Klasing R.,
Kosowski A.,
Navarra A.

Cost minimization in wireless networks with a bounded and unbounded number of interfaces // Networks. - Vol. 53, iss. 3, October. (2009), s. 266 - 275.

6.

Kosowski A.

A note on the strength and minimum color sum of bipartite graphs // Discrete Applied Mathematics. Vol. 157, iss. 11, June. (2009), s. 2552-2554.

7.

Kosowski A.

Approximating the maximum 2- and 3-edge-colorable subgraph problems // Discrete Applied Mathematics. Vol. 157, iss. 17, October. (2009), s. 3593-3600.

8.

Kosowski A.

Forwarding and optical indices of a graph // Discrete Applied Mathematics. Vol. 157, iss. 2, (2009), s. 321-329.

9.

Kosowski A.,
Kosowski K.
Tucki K.,

Turbine stage design aided by artificial intelligence methods // Expert Systems with Applications. - Vol. 36, iss. 9 (2009), s. 11536-11542.

10.

Kubale M.,
Ocetkiewicz K.

A new optimal algorithm for a time-dependent scheduling problem // Control and Cybernetics, 38 (2009), 713-721.

11.

Furmańczyk H.,
Kosowski A.,
Ries B.,
Żyliński P.

Mixed graph edge coloring // Discrete Mathematics. Vol. 309, iss. 12, June. (2009), s. 4027-4036.

12.

Ocetkiewicz K.

A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem // European Journal of Operational Research. - Vol. 203, iss. 2, June. (2009) - s. 5.

13.

Gavoille C.,
Klasing R.,
Kosowski A.,
Kuszner Ł.,
Navarra A.

On the complexity of distributed graph coloring with local minimality constraints/// Networks. - Vol. 54, iss. 1 (2009), s. 12-19.

14.

Fraigniaud P.,
Gavoille C.,
Kosowski A.,
Lebhar E.,
Lotker Z.

Universal Augmentation Schemes for Network Navigability /// Theoretical Computer Science. Vol. 410, iss. 21-23, May. (2009), s. 1970-1981.

2008

1.

Dereniowski D.  

The complexity of list ranking of trees. w: Ars Combinatoria. - Vol. 86 (2008), s. 97-114.

2.

Dereniowski D.  

Edge ranking and searching in partial orders. w: Discrete Applied Mathematics vol. 156, iss. 13 (2008), s. 2493-2500.

3.

Dereniowski D.,
Nadolski A.

A note on compact and compact circular edge-colorings of graphs. w: Discrete Mathematics and Theoretical Computer Science. - Vol. 10, nr 3 (2008), s. 161-170.

4.

Klasing R.,
Kosowski A.,
Navarra A.

Cost minimization in wireless networks with a bounded and unbounded number of interfaces. w: Networks - 2008, s. 1-10.

5.

Kosowski A.,
Żyliński P. 

Packing Three-Vertex Paths in 2-Connected Cubic Graphs. w: Ars Combinatoria. - Vol. 89 (2008), s. 1-19.

6.

Kosowski A.,

Małafiejski M.,
Żyliński P.  

Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph. w: Graphs and Combinatorics.  Vol. 24, nr 5 (2008), s. 461-468.

7.

Furmańczyk H.,
Kosowski A.,
Żyliński P.  

A note on mixed tree coloring. w: Information Processing Letters. Vol. 106, nr 4 (2008), s. 133-135.

8.

Kosowski A. 

The maximum edge-disjoint paths problem in complete graphs. w: Theoretical Computer Science. - Vol. 399, nr 1-2 (2008), s. 128-140.

9.

Nadolski A.  

Compact cyclic edge-colorings of graphs. w: Discrete Mathematics. Vol. 308, nr 12 (2008), s. 2407-2417.

2007

1.

Dereniowski D.

Easy and hard instances of arc ranking in directed graphs. w: Discrete Applied Mathematics. - Vol. 155 (2007), s. 2601-2611.

2.

Kosowski A.,
Małafiejski M.,
Żyliński P.

Cooperative mobile guards in grids. w: Computational Geometry: Theory and Applications. - Vol. 37, nr 2 (2007), s. 59-71.

3.

Kosowski A.,
Małafiejski M.,
Żyliński P.

Packing [1,Delta]-factors in graphs of small degree. w: Journal of Combinatorial Optimization. - Vol. 14, nr 1 (2007), s. 63-86.

4.

Kuszner Ł.,
Małafiejski M.

 

A polynomial algorithm for some preemptive multiprocessor task scheduling problems. w: European Journal of Operational Research. - Vol. 176, nr 1 (2007), s. 145-150.

5.

Nadolski A.

The circular chromatic index of some class 2 graphs. w: Discrete Mathematics. - Vol. 307, nr 11-12 (2007), s. 1447-1454.

2006

1.

Dereniowski D.

Edge ranking of weighted trees. w: Discrete Appl. Math. - vol. 154, nr 8 (2006), s. 1198-1209.

2.

Dereniowski D.,
Kubale M.

Efficient parallel query processing by graph ranking. w. Fundamenta Informaticae. - vol. 69, nr 3 (2006), s. 273-285.

3.

Dereniowski D.,
Kubale M.

Parallel query processing and edge ranking of graphs. w: Parallel Processing and Applied Mathematics : 6th International Conference : PPAM 2005, Poznań, September 11-14, 2005 / eds: R. Wyrzykowski, J. Dongarra, N. Meyer, J. Waśniewski. - Berlin, Heidelberg : Springer-Verlag, 2006. - (Lecture Notes in Computer Science ; 3911), s. 463-469.

4.

Dereniowski D.,
Nadolski A.

Vertex rankings of chordal graphs and weighted trees. w: Inf. Process. Lett. - Vol. 98, nr 3 (2006), s. 96-100.

5.

Dzido T.,
Kubale M.,
Piwakowski K.

On some ramsey and turan-type numbers for paths and cycles. w. Electronics Journal of Combinatorics. vol. 13 (2006), s. 1-9.

6.

Giaro K.,
Kubale M.

Chromatic scheduling of 1- and 2-processor uet tasks on dedicated machines with availability constraints. w: PPAM 2005 : Parallel Processing and Applied Mathematics: 6th International Conference : Proceedings, Poznań, 11-14 September, 2005 / eds: R. Wyrzykowski, J. Dongarra, N. Meyer, J. Waśniewski. - Berlin : Springer-Verlag, 2006. - (LNCS / eds: G. Goos, J. Hartmanis, J. van Leeuwen ; 3911), s. 855-862.

7.

Kosowski A.,
Kuszner Ł.

A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves. w: PPAM 2005: Parallel Processing and Applied Mathematics : 6th International Conference, Poznań, 11-14 September, 2005 / eds: R. Wyrzykowski, J. Dongarra, N. Meyer, J. Waśniewski. - Berlin, Heidelberg : Springer-Verlag, 2006. - (LNCS / eds: G. Goos, J. Hartmanis, J. van Leeuwen; vol. 3911 ), s. 75-82.

8.

Kosowski A.,
Kuszner Ł.

On greedy graph coloring in the distributed model. w: Euro-Par 2006 Parallel Processing : 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006 / eds: W.E. Nagel, W.V. Walter, W. Lehner. - Berlin : Springer-Verlag, 2006. - (Lecture Notes in Computer Science; vol. 4128), s. 592-601.

9.

Kosowski A.,
Kuszner Ł.

Self-stabilizing algorithms for graph coloring with improved performance guarantees. w: Artificial Intelligence and Soft Computing - ICAISC 2006 : 8th International Conference, Zakopane, Poland, June 25-29, 2006 : proceedings / eds: L. Rutkowski, R. Tadeusiewicz, L.A. Zadeh, J. Zurada. - Berlin : Springer-Verlag, 2006. - (Lecture Notes in Artificial Intelligence; vol. 4029 /eds: J.G. Carbonell, J. Siekmann), s. 1150-1159.

10.

Kosowski A.,
Małafiejski M.,
Żyliński P.

An approximation algorithm for maximum P3-packing in subcubic graphs. w: Information Processing Letters. vol. 99, nr. 6 (2006), s. 230-233.

11.

Kosowski A.,
Małafiejski M.,
Żyliński P.

An efficient algorithm for mobile guarded guards in simple grids. w: ICCSA 2006 : Computational Science and Its Applications International Conference : Proceedings, Glasgow, UK 8-11 May, 2006 / eds: M.L. Gavrilova et al. - Berlin-Heidelberg : Springer-Verlag, 2006. - (LNCS / eds: G. Goos, J. Hartmanis, J. van Leeuwen; vol. 3980), s. 141-150.

12.

Kosowski A.,
Małafiejski M.,
Żyliński P.

Fault tolerant guarding of grids. w: ICCSA 2006 : Computational Science and Its Applications International Conference : Proceedings, Glasgow, UK 8-11 May, 2006 / eds: M.L. Gavrilova et al. - Berlin-Heidelberg : Springer-Verlag, 2006. - (LNCS / eds: G. Goos, J. Hartmanis, J. van Leeuwen; vol. 3980), s. 161-170.

13.

Kosowski A.,
Małafiejski M.,
Żyliński P.

Parallel processing subsystems with redundancy in a distributed environment. w: PPAM 2005 : Parallel Processing and Applied Mathematics: 6th International Conference : Proceedings, Poznań, 11-14 September, 2005 / eds: R. Wyrzykowski, J. Dongarra, N. Meyer, J. Waśniewski. - Berlin-Heidelberg : Springer-Verlag, 2006. - (LNCS / G. Goos, J. Hartmanis, J. van Leeuwen; vol. 3911), s. 1002-1009.

14.

Kosowski A.

Approximation strategies for routing edge disjoint paths in complete graphs. w: SIROCCO 2006 : Structural Information and Communication Complexity : 13th International Colloquium : Proceeding, Chester, UK 2-5 July, 2006 / eds: P. Flocchini, L. Gasieniec. - Berlin-Heidelberg : Springer-Verlag, 2006. - (LNCS / eds: G. Goos, J. Hartmanis, J. van Leeuwen ; Vol. 4056), s. 130-142.

2005

1.

Kosowski A.,
Małafiejski M.,
Żyliński P.

On bounded load routings for modeling k-regular connection topologie. w: Algorithms and Computation: 16th International Symposium, ISAAC 2005: proceedings, China, Sanya, Hainan, 19-21 Dec., 2005. /eds: X. Deng, D. Du.- Berlin: Springer, 2005.  s. 614-623.

2.

Kosowski A.,
Małafiejski M.,
Żyliński P.

Packing three-vertex paths in a subcubic graph. Disc. Math. a.Theor.Computer Sci. [Dokument elektroniczny]. - Vol. AEW (2005). s. 213-218.(EuroComb'05 : European Conference on Combinatorics, Graph Theory and Applications, Berlin 2005).

3.

Małafiejski M.,
Żyliński P.

Weakly cooperative guards in grids. w: Computational Science and Its Applications – ICCSA 2005 : International Conference: proceedings, Singapore, May 9-12, 2005 /eds: O. Gervasi, et all. - Berlin: Springer, 2005. s. 647-656.

4.

Kubale M.,
Nadolski A.

Chromatic scheduling in a cyclic open shop  Eur. J. Operational Res. - Vol. 164, issue 3 (1 August 2005), s. 585-591.

2004

1.

Dereniowski D.,
Kubale M. 

Cholesky factorization of matrices in parallel and ranking of graphs. W: Proceedings. Parallel Processing and Applied Mathematics 2003: 5th International Conference. Częstochowa, Poland, September 7-10, 2003. Ed. Roman Wyrzykowski, Jack Dongarra, Marcin Paprzycki, et al. Heidelberg: Springer-Verlag. Lecture Notes in Computer Science 2004 vol. 3019 s. 985-992.

2.

Giaro K.,
Kubale M.

Compact scheduling of zero-one time operations in multi-stage systems. Discrete Applied Mathematics 2004 nr 145 s. 95-103.

3.

Głazek W.,
Seiden S.

New results for online page replication. Theor. Computer Sci. 2004 vol. 313, s. 219-251.

4.

Kosowski A.

An efficient algorithm for the longest tandem scattered subsequence problem. w: Procedings. 11th International Conference, SPIRE, Padova, Italy, October 2004, s. 93-100.

5.

Kuszner Ł.,
Nadolski A.,
Kubale M.,
Hansen J.

Distributed largest-first algorithm for graph coloring.
w: Proceedings. 10th International Euro-Par Conference. Pisa, Italy, 31 August - 3 September, 2004 s. 804-811.

6.

McKay B.,
Piwakowski K.,
Radziszowski S.

Ramsey numbers for triangles versus almost-complete graphs. Ars Combin. 2004 vol. 73 s. 205-214.

7.

Małafiejski M.,
Giaro K.,
Janczewski R.,
Kubale M.

Sum coloring of bipartite graphs with bounded degree. Algorithmica 2004 vol. 40 s. 235-244.

2003

1.

Giaro K.,
Janczewski R.,

Małafiejski M..

The complexity of the T-coloring problem for graphs with small degree. Discrete Appl. Math. 2003 nr 129 s. 361-369.

2.

Giaro K.,
Janczewski R.,
Małafiejski M..

A polynomial algorithm for finding T-span of generalized cacti. Discrete Appl. Math. 2003 nr 129 s. 371-382.

2002

1.

Giaro K.,
Janczewski R.,
Kubale M.,
Małafiejski M.

A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs, w: Proceedings. APPROX 2002. Approximation Algorithms for Combinational Problems Workshop. Rome, Italy, September 17-21, 2002. Ed. K.Jansen, S.Leonardi, V.Vazirani. Berlin: Springer  2002 s. 135-145.

2.

Giaro K.,
Kubale M.,
Małafiejski M.,
Piwakowski K.

Dedicated scheduling of tasks to minimize mean flow time. w: Proceedings PPAM 2001. Parallel Processing and Applied Mathematics. 4th International Conference. Nałęczów, Poland, September 9-12, 2001. Ed. R. Wyrzykowski, J. Dongarra, M. Paprzycki, J. Waśniewski. Berlin: Springer, 2002, s. 87-96.

3.

Neuman J.,
Szepietowski A.,
Walukiewicz I.

Complexity of weak acceptance conditions in tree automata, Information Processing Letters, 2002, s. 181-187.

2001

1.

Giaro K.,
Kubale M.,
Małafiejski M.

Consecutive colorings of the edges of general graphs, Discrete Math.**2001 vol. 236 s. 131-143.

2.

Giaro K. 

NP-hardness of compact scheduling in simplified open and flow shops, Europ. J. Oper. Res.**2001 vol. 130 s. 90-98.

3.

Głazek W. 

On line algorithms for page replication in rings, Theoretical Comp. Sci.**2001, vol. 268, s. 107-117.

4.

Janczewski R. 

Divisibility and T-span of graphs, Discrete Math.**2001 nr 234 s. 171-179.

5.

Janczewski R.,
Kubale M.,
Manuszewski K.,
Piwakowski K.

The smallest hard-to-color graph for algorithm DSATUR, Discrete. Math.**2001 nr 236 s. 151-169.

6.

Piwakowski K., 
Radziszowski S.

The Ramsey multiplicity of K4, Ars Combinatoria **2001 vol. 60 s. 131-135.

2000

1.

Giaro K.,
Kubale M.

Edge-chromatic sum of trees and bounded cyclicity graphs, Inf. Process. Lett.**2000 vol. 75, s. 65-69.

1999

1.

Drozdowski M., 
Głazek W.

Scheduling divisible loads in a three-dimensional mesh of processors, Parallel Computing, April 1999, vol. 25, s. 381-404.

2.

Giaro K.,
Kubale M.,
Malafiejski M.

Compact scheduling in open shop with zero-one time operations, INFOR , 1999, vo. 37, s.37-47.

3.

Giaro K.,
Kubale M.,
Malafiejski M.

On the deficiency of bipartite graphs, Disc. Appl. Math., 1999, vol. 94, s.193-203.

4.

Głazek W.

How to share a divisible load in a hypercube, P. Zinterhof, M. Vajtersic, A. Uhl (eds) Parallel Computation - Proceedings of The 4th International ACPC Conference, Lecture Notes in Computer Science 1557, Springer-Verlag 1999, s. 588-589.

5.

Głazek W.

Lower and upper bounds for the problem of page replication in ring networks, M. Kutyłowski, L. Pacholski, T. Wierzbicki (eds) Proceedings of The 24th International Symposium Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1672, Springer Verlag 1999, s. 273-283.

1997

1.

Giaro K.

The complexity of consecutive-coloring of bipartite graphs:4 is easy, 5 is hard. Ars Combinatoria 1977 vol.47.

2.

Kubale M.

Open shop problem with zero-one time operations and integer release date/deadline intervals. Discrete App. Math. 1997 vol.76.

3.

Kubale M.
Pakulski J.,
Piwakowski K.

The smallest hard-to-color graph for the SL algorithm, Disc. Math. 1997 vol.164.

4.

Piwakowski K.

On Ramsey number R(4,3,3) and trangle-free edge-chromatic graphs in three colors, Disc. Math., 1997 vol.164.

1996

1.

Kubale M.:

Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. Eur. J. Operat. Res.. 1996 vol.94.

2.

Kubale M.,
Piwakowski K.

A linear time algorithm for edge-coloring of binomial trees, Disc. Math. 1996 vol.150.