Approximation Algorithms for the Chromatic Sum. - Ewa M. Kubicka; Grzegorz Kubicki; Dionysios Kountanis (Great Lakes Computer Science Conference, 1989)

Using Graph Distance in Object Recognition. - Ewa M. Kubicka; Grzegorz Kubicki; Ignatios Vakalis (ACM Conference on Computer Science, 1990)

On multipartite tournaments. - Wayne Goddard; Grzegorz Kubicki; Ortrud R. Oellermann; Songlin Tian (J. Comb. Theory B, 1991)

Agreement Subtrees, Metric and Consensus for Labeled Binary Trees. - Wayne Goddard; Ewa M. Kubicka; Grzegorz Kubicki; Fred R. McMorris (Partitioning Data Sets, 1993)

Planar graphs and greatest common subgraphs. - Grzegorz Kubicki (Graphs Comb., 1993)

Agreement metrics for trees revisited. - Ewa M. Kubicka; Grzegorz Kubicki; Fred R. McMorris (Mathematical Hierarchies and Biology, 1996)

On Graphs With a Unique Least Common Multiple. - Gary Chartrand; Grzegorz Kubicki; Christina M. Mynhardt; Farrokh Saba (Ars Comb., 1997)

Steiner Intervals in Graphs. - Ewa M. Kubicka; Grzegorz Kubicki; Ortrud Oellermann (Discret. Appl. Math., 1998)

A Ratio Inequality For Binary Trees And The Best Secretary. - Grzegorz Kubicki; Jenö Lehel; Michal Morayne (Comb. Probab. Comput., 2002)

Foreword. - Grzegorz Kubicki; Jenö Lehel (Discret. Math., 2002)

Patch Colorings and Rigid Colorings of the Rational n-Space. - Grzegorz Kubicki; Jenö Lehel; Michal Morayne (J. Comb. Theory B, 2002)

An Asymptotic Ratio in the Complete Binary Tree. - Grzegorz Kubicki; Jenö Lehel; Michal Morayne (Order, 2003)

Sphere-of-Influence Graphs on a Sphere. - Ewa M. Kubicka; Grzegorz Kubicki (Ars Comb., 2004)

Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case. - Grzegorz Kubicki; Michal Morayne (SIAM J. Discret. Math., 2005)

Counting chains and antichains in the complete binary tree. - Grzegorz Kubicki; Jeno Lehel; Michal Morayne (Ars Comb., 2006)

On domination and reinforcement numbers in trees. - Jean R. S. Blair; Wayne Goddard; Stephen T. Hedetniemi; Steven B. Horton; Patrick Jones; Grzegorz Kubicki (Discret. Math., 2008)

How to Choose the Best Twins. - Bryn Garrod; Grzegorz Kubicki; Michal Morayne (SIAM J. Discret. Math., 2012)

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs. - Ewa M. Kubicka; Grzegorz Kubicki; Kathleen A. McKeon (Electron. Notes Discret. Math., 2013)

An efficient algorithm for stopping on a sink in a directed graph. - Wayne Goddard; Ewa M. Kubicka; Grzegorz Kubicki (Oper. Res. Lett., 2013)

Total Colorings of Graphs with Minimum Sum of Colors. - Ewa M. Kubicka; Grzegorz Kubicki; Maxfield Leidner (Graphs Comb., 2016)

Boundary-type sets in maximal outerplanar graphs. - Benjamin Allgeier; Grzegorz Kubicki (Discret. Appl. Math., 2019)

An optimal algorithm for stopping on the element closest to the center of an interval. - Ewa M. Kubicka; Grzegorz Kubicki; Malgorzata Kuchta; Malgorzata Sulkowska (Adv. Appl. Math., 2022)

Secretary problem with hidden information; searching for a high merit candidate. - Ewa M. Kubicka; Grzegorz Kubicki; Malgorzata Kuchta; Michal Morayne (Adv. Appl. Math., 2023)