2008 |
13 | EE | Jean R. S. Blair,
Wayne Goddard,
Stephen T. Hedetniemi,
Steve Horton,
Patrick Jones,
Grzegorz Kubicki:
On domination and reinforcement numbers in trees.
Discrete Mathematics 308(7): 1165-1175 (2008) |
2006 |
12 | | Grzegorz Kubicki,
Jeno Lehel,
Michal Morayne:
Counting chains and antichains in the complete binary tree.
Ars Comb. 79: (2006) |
2005 |
11 | EE | Grzegorz Kubicki,
Michal Morayne:
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case.
SIAM J. Discrete Math. 19(3): 622-632 (2005) |
2004 |
10 | | Ewa Kubicka,
Grzegorz Kubicki:
Sphere-of-Influence Graphs on a Sphere.
Ars Comb. 70: (2004) |
2003 |
9 | EE | Grzegorz Kubicki,
Jenö Lehel,
Michal Morayne:
An Asymptotic Ratio in the Complete Binary Tree.
Order 20(2): 91-97 (2003) |
2002 |
8 | | Grzegorz Kubicki,
Jenö Lehel,
Michal Morayne:
A Ratio Inequality For Binary Trees And The Best Secretary.
Combinatorics, Probability & Computing 11(2): (2002) |
7 | EE | Grzegorz Kubicki,
Jenö Lehel:
Foreword.
Discrete Mathematics 249(1-3): 1- (2002) |
6 | EE | Grzegorz Kubicki,
Jenö Lehel,
Michal Morayne:
Patch Colorings and Rigid Colorings of the Rational n-Space.
J. Comb. Theory, Ser. B 84(1): 45-53 (2002) |
1998 |
5 | EE | Ewa Kubicka,
Grzegorz Kubicki,
Ortrud Oellermann:
Steiner Intervals in Graphs.
Discrete Applied Mathematics 81(1-3): 181-190 (1998) |
1997 |
4 | | Gary Chartrand,
Grzegorz Kubicki,
Christina M. Mynhardt,
Farrokh Saba:
On Graphs With a Unique Least Common Multiple.
Ars Comb. 46: (1997) |
1991 |
3 | EE | Wayne Goddard,
Grzegorz Kubicki,
Ortrud R. Oellermann,
Songlin Tian:
On multipartite tournaments.
J. Comb. Theory, Ser. B 52(2): 284-300 (1991) |
1990 |
2 | EE | Ewa Kubicka,
Grzegorz Kubicki,
Ignatios Vakalis:
Using Graph Distance in Object Recognition.
ACM Conference on Computer Science 1990: 43-48 |
1989 |
1 | | Ewa Kubicka,
Grzegorz Kubicki,
Dionysios Kountanis:
Approximation Algorithms for the Chromatic Sum.
Great Lakes Computer Science Conference 1989: 15-21 |