Primitives for the Manipulation of Three-Dimensional Subdivisions. - David P. Dobkin; Michael J. Laszlo (Algorithmica, 1989)

Techniques for Visualizing 3-Dimensional Manifolds. - Michael J. Laszlo (IEEE Visualization, 1990)

Fast generation and display of iso-surface wireframes. - Michael J. Laszlo (CVGIP Graph. Model. Image Process., 1992)

Another greedy heuristic for the constrained forest problem. - Michael J. Laszlo; Sumitra Mukherjee (Oper. Res. Lett., 2005)

Minimum Spanning Tree Partitioning Algorithm for Microaggregation. - Michael J. Laszlo; Sumitra Mukherjee (IEEE Trans. Knowl. Data Eng., 2005)

A class of heuristics for the constrained forest problem. - Michael J. Laszlo; Sumitra Mukherjee (Discret. Appl. Math., 2006)

A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering. - Michael J. Laszlo; Sumitra Mukherjee (IEEE Trans. Pattern Anal. Mach. Intell., 2006)

A genetic algorithm that exchanges neighboring centers for k-means clustering. - Michael J. Laszlo; Sumitra Mukherjee (Pattern Recognit. Lett., 2007)

An approximation algorithm for network design problems with downwards-monotone demand functions. - Michael J. Laszlo; Sumitra Mukherjee (Optim. Lett., 2008)

Approximation Bounds for Minimum Information Loss Microaggregation. - Michael J. Laszlo; Sumitra Mukherjee (IEEE Trans. Knowl. Data Eng., 2009)

Optimal univariate microaggregation with data suppression. - Michael J. Laszlo; Sumitra Mukherjee (J. Syst. Softw., 2013)

Iterated local search for microaggregation. - Michael J. Laszlo; Sumitra Mukherjee (J. Syst. Softw., 2015)

Landmark routing for large graphs in fixed-memory environments. - Newton Campbell Jr.; Michael J. Laszlo; Sumitra Mukherjee (HPEC, 2016)

Counting Star-Battle Configurations. - Michael J. Laszlo; Sumitra Mukherjee (Math. Comput. Sci., 2023)