dr hab. prof. UO Grzegorz KubickiPublikacje 2015- Kathleen McKeon, Grzegorz Kubicki, Ewa Kubicka, CHROMATIC SUMS FOR COLORINGS AVOIDING MONOCHROMATIC SUBGRAPHS, Discussiones Mathematicae Graph Theory, 35 (2015), 541–555.
2013- Grzegorz Kubicki, Ewa Kubicka, Wayne Goddard, EFFICIENT ALGORITHM FOR STOPPING ON A SINK IN DIRECTED GRAPHS, Operations Research Letters, 41 (2013), 238-240.
2008- Grzegorz Kubicki, Jean Blair, Stephen Hedetniemi, Steve Horton, Patrick Jones, Wayne Goddard, ON DOMINATION AND REINFORCEMENT NUMBERS IN TREES, Discrete Mathematics, 308 (2008), 1165-1175.
2006- Grzegorz Kubicki, Jeno Lehel, Michał Morayne, COUNTING CHAINS AND ANTICHAINS IN THE COMPLETE BINARY TREE, Ars Combinatoria, 79 (2006), 245-256.
2005- Grzegorz Kubicki, Michał Morayne, GRAPH-THEORETIC GENERALIZATION OF THE SECRETARY PROBLEM; THE DIRECTED PATH CASE, SIAM Journal on Discrete Mathematics, 19 (2005), 622-632.
2004- Grzegorz Kubicki, Ewa Kubicka, SPHERE-OF-INFLUENCE GRAPHS ON A SPHERE, Ars Combinatoria, 70 (2004), 183-190.
2003- Grzegorz Kubicki, Jeno Lehel, Michał Morayne, AN ASYMPTOTIC RATIO IN THE COMPLETE BINARY TREE, Order - A Journal on the Theory of Ordered Sets and Its Applications, 20 (2003), 91-97.
2002- Grzegorz Kubicki, Jeno Lehel, Michał Morayne, A RATIO INEQUALITY FOR BINARY TREES AND THE BEST SECRETARY, Combinatorics, Probability and Computing, 11 (2002), 149-161.
- Jeno Lehel, Grzegorz Kubicki, FOREWORD, Discrete Mathematics, 249 (2002), 1.
- Grzegorz Kubicki, Jeno Lehel, Michał Morayne, PATCH COLORINGS AND RIGID COLORINGS OF THE RATIONAL N-SPACE, Journal of Combinatorial Theory, 84 (2002), 45-53.
2001- Grzegorz Kubicki, Jeno Lehel, Michał Morayne, TOTALLY POSITIVE MATRICES AND TOTALLY POSITIVE HYPERGRAPHS, Linear Algebra and Its Applications, 331 (2001), 193-202.
1999- Grzegorz Kubicki, William Day, Ewa Kubicka, Fred McMorris, ATTAINABLE RESULTS IN COMMITTEE ELECTIONS, Mathematical and Computer Modelling, 30 (1999), 75-87.
1998- Grzegorz Kubicki, Ortrud Oellermann, Ewa Kubicka, STEINER INTERVALS IN GRAPHS, Discrete Applied Mathematics, 81 (1998), 181-190.
1997- Grzegorz Kubicki, Gary Chartrand, Christina Mynhardt, Farrokh Saba, ON GRAPHS WITH A UNIQUE LEAST COMMON MULTIPLE, Ars Combinatoria, 46 (1997), 177-190.
1996- Grzegorz Kubicki, William Day, Ewa Kubicka, Fred McMorris, THE ASYMPTOTIC PLURALITY RULE FOR MOLECULAR SEQUENCES, Mathematical and Computer Modelling, 23(3) (1996), 27-42.
1995- Fred McMorris, Grzegorz Kubicki, Ewa Kubicka, Wayne Goddard, AGREEMENT SUBTREES, METRIC AND CONSENSUS FOR LABELED BINARY TREES, w: Partitioning Data Sets, DIMACS Series in Discrete Mathematics and Theorethical Computer Science, 19 (red. Peter Hammer), Rutgers University, Rutgers University (1995), 97-104.
- Grzegorz Kubicki, Ewa Kubicka, Fred McMorris, AN ALGORITHM TO FIND AGREEMENT SUBTREES, Journal of Classification, 12 (1995), 91-99.
1993- Grzegorz Kubicki, PLANAR GRAPHS AND GREATEST COMMON SUBGRAPHS, Graphs and Combinatorics, 9 (1993), 239-253.
1991- Grzegorz Kubicki, Wayne Goddard, Ortrud Oellermann, Song Lin Tian, ON MULTIPARTITE TOURNAMENTS, Journal of Combinatorial Theory, 52 (1991), 284-300.
- Grzegorz Kubicki, Gary Chartrand, Paul Erdos, ABSORBING COMMON SUBGRAPHS, SIAM 0-89871-287-4, Philadelphia (1991), 96-105.
1987- Grzegorz Kubicki, ON A GAME OF SIERPIŃSKI, Colloquium Mathematicum, 54 (1987), 179-192.
1986- Grzegorz Kubicki, ON A MODIFIED GAME OF SIERPIŃSKI, Colloquium Mathematicum, 53 (1986), 81-91.
|