| |
| 2007 | ||
|---|---|---|
| 11 | EE | Robert J. Cimikowski, Brendan Mumey: Approximating the fixed linear crossing number. Discrete Applied Mathematics 155(17): 2202-2210 (2007) |
| 2006 | ||
| 10 | EE | Robert J. Cimikowski: An analysis of some linear graph layout heuristics. J. Heuristics 12(3): 143-153 (2006) |
| 2003 | ||
| 9 | EE | Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, Robert J. Cimikowski: A simple factor-3 approximation for labeling points with circles. Inf. Process. Lett. 87(2): 101-105 (2003) |
| 8 | EE | Robert J. Cimikowski, Imrich Vrto: Improved Bounds for the Crossing Number of the Mesh of Trees. Journal of Interconnection Networks 4(1): 17-35 (2003) |
| 2002 | ||
| 7 | Robert J. Cimikowski: Algorithms for the fixed linear crossing number problem. Discrete Applied Mathematics 122(1-3): 93-115 (2002) | |
| 1996 | ||
| 6 | EE | Robert J. Cimikowski, Don Coppersmith: The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. Discrete Mathematics 149(1-3): 303-309 (1996) |
| 1995 | ||
| 5 | Robert J. Cimikowski: An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem. SODA 1995: 322-331 | |
| 4 | Robert J. Cimikowski: On Heuristics for Determining the Thickness of a Graph. Inf. Sci. 85(1-3): 87-98 (1995) | |
| 1993 | ||
| 3 | EE | Robert J. Cimikowski: On Certain Hamiltonian Inner Triangulations. Discrete Applied Mathematics 43(3): 185-195 (1993) |
| 1992 | ||
| 2 | EE | Robert J. Cimikowski: Properties of some Euclidean proximity graphs. Pattern Recognition Letters 13(6): 417-423 (1992) |
| 1990 | ||
| 1 | Robert J. Cimikowski: Finding Hamiltonian Cycles in Certain Planar Graphs. Inf. Process. Lett. 35(5): 249-254 (1990) | |
| 1 | Don Coppersmith | [6] |
| 2 | Minghui Jiang | [9] |
| 3 | Brendan Mumey | [11] |
| 4 | Jianbo Qian | [9] |
| 5 | Zhongping Qin | [9] |
| 6 | Imrich Vrto | [8] |
| 7 | Binhai Zhu | [9] |