CURRICULUM VITA
EMPLOYMENTEwa Kubicka
Department of Mathematics
University of Louisville
University of Louisville, Louisville, KY 2004-present, ProfessorEDUCATION
University of Louisville, Louisville, KY 1996-2004, Associate Professor
University of Louisville, Louisville, KY 1990-1996, Assistant Professor
Emory University, Atlanta, GA 1989-1990, Assistant Professor
Associate of the Society of Actuaries, January 2003LIST OF PUBLICATIONS
Western Michigan University, Kalamazoo, MI 1985-1989 Ph.D. in Mathematics
Western Michigan University, Kalamazoo, MI 1987-1989 M. Sc. In Computer Science
Technical University of Wroclaw, Poland 1974-1979 M.Sc. in Mathematics
Chapters in Books
1. G. Chartrand, R. Gould, E. Kubicka
and G. Kubicki, On rotation number for digraphs, Advances
in Graph Theory
(1991) 103-119.
2. W. Goddard, E. Kubicka, G.
Kubicki, and F. R. McMorris, Agreement subtrees, metric and consensus
for labeled
binary trees,Partitioning Data Sets, DIMACS Series in Discrete Mathematics
and Theoretical Computer Science 19
(1995) 97 - 104.
Journal Articles
3. E. Kubicka, A. Schwenk,
Introduction
to chromatic sums, Proceedings of ACM 1989 Computer Science Conference,
(1989) 39-45.
4. E. Kubicka, G. Kubicki
and I. Vakalis, Using graph distance in object recognition, Proceedings
of ACM 1990
Computer Science Conference,(1990) 43-48.
5. P. Erdos, E. Kubicka,
and A. Schwenk, Graphs that require many colors to achieve their chromatic
sum,
Congressus Numerantium 71 (1990) 17-28.
6. E. Kubicka, Constraints
on the chromatic sequence for trees and graphs, Congressus Numerantium
76(1990),
219-230.
7. E. Kubicka, G. Kubicki
and D. Kountanis, Approximation algorithms for the chromatic sum,
Proceedings of the First
Great Lakes Computer Science Conference, Springer Verlag (1990) 15-21.
8. M. S. Jacobson, E. Kubicka
and G. Kubicki, Vertex rotation number for tournaments, Congressus
Numerantium 82
(1991) 201-210.
9. E. Kubicka, G. Kubicki,
Constant
time algorithm for generating binary rooted trees, Congressus Numerantium
90
(1992) 57-64.
10. E. Kubicka, G. Kubicki, and F. R.
McMorris, On agreement subtrees of two binary trees, Congressus
Numerantium 88
(1992) 217-224.
11. M. S. Jacobson, E. Kubicka and G.
Kubicki, Irregularity Sum for graphs, Vishwa International Journal
of Graph Theory
Vol. 1, No. 2 (1992) 159-175.
12. F. Harary, M. S. Jacobson, E. Kubicka
and G. Kubicki, The irregularity cost or sum of a graph,
Applied Mathematics Letters Vol. 6, No. 3 (1993) 79-80.
13. W. Goddard, E. Kubicka, G. Kubicki,
and F. R. McMorris, The agreement metric for labeled binary trees,
Mathematical Biosciences 123 (1994) 215 - 226.
14. E. Kubicka, G. Kubicki, and F. R.
McMorris, An algorithm to find agreement subtrees, Journal of Classification
12
(1995) 91 - 99.
15. M. S. Jacobson, A. E. Ké
zdy, E. Kubicka, G. Kubicki, J. Lehel, D. B. West, and C. Wang, The
Path Spectrum of a Graph,
Congressus Numerantium 112(1995) 45 - 63
16. W. Day, E. Kubicka, G. Kubicki,
and F. R. McMorris, The asymptotic plurality rule for molecular sequences,
Mathematical and Computer Modeling Vol. 23, No.3 (1996) 27-42
17. E. Kubicka, An efficient method
of examining all trees, Combinatorics, Probability and Computing (1996),
5, 403 - 413.
18. E. Kubicka, D. Huizinga, A Universal
Technique for Designing Optimal Tree Structured Networks, Proceedings
of the
1997 ACM Symposium on Applied Computing, 345 - 353.
19. E. Kubicka, G. Kubicki, and
F.R. McMorris, Agreement metric for trees revisited, DIMACS
Series in Discrete and
Theoretical Computer Science 37 (1997) 239-248.
20. E. Kubicka, Grzegorz Kubicki, and
Ortrud R Oellermann, Steiner Intervals in Graphs, Discrete Applied
Mathematics 81
(1998) 181-190.
21. G. Chartrand, M. Jacobson, E. Kubicka,
and G. Kubicki, The Step Domination Number of a Graph , Scientia
6 (1998).
22. B.Bock, W. Day, E. Kubicka,
G. Kubicki, and F.R. McMorris, Attainable Results in Committee
Elections .
Mathematical and Computer Modeling, Vol 26, (1999)
23. M. Jacobson, E. Kubicka, G. Kubicki,
Consecutive
Labeling for Graphs Journal of Combinatorial Mathematics and
Combinatorial Computing 31 (1999) 207-217.
24. E. Kubicka, G. Kubicki, and
J. Lehel, Path-pairable property for complete grids, Combinatorics,
Graph Theory, and
Algorithms,VOL II (1999) 577-586.
25. D. Huizinga, E. Kubicka, Algorithms
for the Analysis and Synthesis of Tree Structured Communication Network,
Journal of
Combinatorial Mathematics and Combinatorial Computing 48 (2004) 55 - 88.
26. E. Kubicka, G. Kubicki, Sphere-of-influence
graphs on a sphere, Ars Combinatoria, 70 (2004), 183-190.
27. E. Kubicka, The Chromatic Sum
of Graphs; History and recent Developments, The International
Journal of
Mathematical Sciences, 30 (2004) 1563 - 1573.
28. E. Kubicka, Polynomial Algorithm
for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs,
Ars Combinatoria, 76 (2005) 193 - 201.
29. Busch, Chen, Faudree, Ferrara, Gould, Jacobson, Kahl, Suffel, Kubicka, Kubicki and Schwenk,
A Generalization of deBruijn graphs and two applications,
Bulletin of the ICA (2006).
30. E. Kubicka, K. McKeon, An Application of Level Sequences to
Parallel Generation of Rooted Tree,
Journal of Combinatorial Mathematics and Combinatorial Computing, 76 (2011) 33 -58.
31. E. Kubicka, G. Kubicki, Choosing Rarity: an Exercise in
Stopping Times,
Mathematics Magazine, 84 (2011) 42 - 481.
32. E. Kubicka, G. Kubicki, Optimal Stopping Time on a Minority Color in a 2-Color Urn Scheme,
accepted to Journal of Combinatorial Mathematics and Combinatorial Computing (2012).
33. Wayne Goddard, E. Kubicka, and G. Kubicki, Efficient Algorithm for Stopping on a Sink in Directed Graphs,
Applied Mathematics Letters (2012).
Research Reports
1. W. Day, E. Kubicka, G. Kubicki, and F.R McMorris, Consistency
of consensus results for the fractional plurality rule:
Derivations,Technical
Report, Port Maitland, NS, Canada (1993). (D)
2. W. Day, E. Kubicka, G. Kubicki, and F,R. McMorris, Asymptotic plurality
rule for molecular sequences:
Derivations
of consistency, Technical Report, Port Maitland, NS, Canada (1994).
PROFESSIONAL DEVELOPMENT
Obtaining title of the Associate of the Society
of Actuaries (January 2003), which constitutes
passing the following SOA actuarial exams:
1 Course 1 Mathematical Foundations of actuarial Science
2 Course 2 Interest Theory, Economics and Finance
3 Course 3 Actuarial Models
4 Course 4 Actuarial Modeling
5 Course 5 Actuarial Practice
6 Course 6 Finance and Investments