Michael J. Laszlo

15 papers A 1Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2023 J jnl
Counting Star-Battle Configurations.
Math. Comput. Sci.
Michael J. Laszlo, Sumitra Mukherjee
2016 — conf
Landmark routing for large graphs in fixed-memory environments.
HPEC
Newton Campbell Jr., Michael J. Laszlo, Sumitra Mukherjee
2015 J jnl
Iterated local search for microaggregation.
J. Syst. Softw.
Michael J. Laszlo, Sumitra Mukherjee
2013 J jnl
Optimal univariate microaggregation with data suppression.
J. Syst. Softw.
Michael J. Laszlo, Sumitra Mukherjee
2009 J jnl
Approximation Bounds for Minimum Information Loss Microaggregation.
IEEE Trans. Knowl. Data Eng.
Michael J. Laszlo, Sumitra Mukherjee
2008 J jnl
An approximation algorithm for network design problems with downwards-monotone demand functions.
Optim. Lett.
Michael J. Laszlo, Sumitra Mukherjee
2007 J jnl
A genetic algorithm that exchanges neighboring centers for k-means clustering.
Pattern Recognit. Lett.
Michael J. Laszlo, Sumitra Mukherjee
2006 J jnl
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering.
IEEE Trans. Pattern Anal. Mach. Intell.
Michael J. Laszlo, Sumitra Mukherjee
2006 J jnl
A class of heuristics for the constrained forest problem.
Discret. Appl. Math.
Michael J. Laszlo, Sumitra Mukherjee
2005 J jnl
Another greedy heuristic for the constrained forest problem.
Oper. Res. Lett.
Michael J. Laszlo, Sumitra Mukherjee
2005 J jnl
Minimum Spanning Tree Partitioning Algorithm for Microaggregation.
IEEE Trans. Knowl. Data Eng.
Michael J. Laszlo, Sumitra Mukherjee
1992 J jnl
Fast generation and display of iso-surface wireframes.
CVGIP Graph. Model. Image Process.
Michael J. Laszlo
1990 A conf
Techniques for Visualizing 3-Dimensional Manifolds.
IEEE Visualization
Michael J. Laszlo
1989 J jnl
Primitives for the Manipulation of Three-Dimensional Subdivisions.
Algorithmica
David P. Dobkin, Michael J. Laszlo
1987 — conf
Primitives for the Manipulation of Three-Dimensional Subdivisions.
SCG
David P. Dobkin, Michael J. Laszlo