An Introduction to Chromatic Sums. - Ewa M. Kubicka; Allen J. Schwenk (ACM Conference on Computer Science, 1989)

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)

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

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

An Efficient Method of Examining all Trees. - Ewa M. Kubicka (Comb. Probab. Comput., 1996)

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

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

The chromatic sum of a graph: history and recent developments. - Ewa M. Kubicka (Int. J. Math. Math. Sci., 2004)

Polynomial Algorithm for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs. - Ewa M. Kubicka (Ars Comb., 2005)

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)

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)