Michael J. Laszlo

According to our database1, Michael J. Laszlo authored at least 14 papers between 1989 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Counting Star-Battle Configurations.
Math. Comput. Sci., June, 2023

2016
Landmark routing for large graphs in fixed-memory environments.
Proceedings of the 2016 IEEE High Performance Extreme Computing Conference, 2016

2015
Iterated local search for microaggregation.
J. Syst. Softw., 2015

2013
Optimal univariate microaggregation with data suppression.
J. Syst. Softw., 2013

2009
Approximation Bounds for Minimum Information Loss Microaggregation.
IEEE Trans. Knowl. Data Eng., 2009

2008
An approximation algorithm for network design problems with downwards-monotone demand functions.
Optim. Lett., 2008

2007
A genetic algorithm that exchanges neighboring centers for k-means clustering.
Pattern Recognit. Lett., 2007

2006
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering.
IEEE Trans. Pattern Anal. Mach. Intell., 2006

A class of heuristics for the constrained forest problem.
Discret. Appl. Math., 2006

2005
Minimum Spanning Tree Partitioning Algorithm for Microaggregation.
IEEE Trans. Knowl. Data Eng., 2005

Another greedy heuristic for the constrained forest problem.
Oper. Res. Lett., 2005

1992
Fast generation and display of iso-surface wireframes.
CVGIP Graph. Model. Image Process., 1992

1990
Techniques for Visualizing 3-Dimensional Manifolds.
Proceedings of the 1st IEEE Visualization Conference, 1990

1989
Primitives for the Manipulation of Three-Dimensional Subdivisions.
Algorithmica, 1989


  Loading...