Part of the Computer Sciences Commons

Works by Michael J. Laszlo in Computer Sciences

2015

Iterated local search for microaggregation, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2013

Optimal univariate microaggregation with data suppression, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2011

A Genetic Algorithm for the Constrained Forest Problem, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2009

Approximation bounds for minimum information loss microaggregation, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2008

An approximation algorithm for network design problems with downwards-monotone demand functions, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2007

A genetic algorithm that exchanges neighboring centers for k-means clustering, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2006

A Genetic Algorithm using Hyper-Quadtrees for Low-Dimensional K-Means Clustering, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

A class of heuristics for the constrained forest problem, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2005

Another greedy heuristic for the constrained forest problem, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

Minimum Spanning Tree Partitioning Algorithm for Microaggregation, Michael J. Laszlo, Sumitra Mukherjee
CCE Faculty Articles

2001

Object-Oriented Programming Featuring Graphical Applications in Java, Michael J. Laszlo
CCE Faculty Books and Book Chapters

1998

The Schemer's Guide to Solid Modeling, Michael J. Laszlo
CCE Faculty Books and Book Chapters

1996

Computational Geometry and Computer Graphics in C++, Michael J. Laszlo
CCE Faculty Books and Book Chapters

1992

Fast Generation and Display of Iso-Surface Wireframes, Michael J. Laszlo
CCE Faculty Articles

1989

Primitives for the Manipulation of Three-Dimensional Subdivisions, Michael J. Laszlo, David P. Dobkin
CCE Faculty Articles