{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:22:35Z","timestamp":1778300555667,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1023\/a:1009665701840","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"327-351","source":"Crossref","is-referenced-by-count":51,"title":["A Stochastic Heuristic for Visualising Graph Clusters in a Bi-Dimensional Space Prior to Partitioning"],"prefix":"10.1007","volume":"5","author":[{"given":"Pascale","family":"Kuntz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Snyers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Layzell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"238061_CR1","doi-asserted-by":"crossref","unstructured":"Alpert, C. and A. Kahng. (1993). \u201cGeometric Embeddings for Faster and Better Multiway Netlist Partitioning.\u201d 30th Design Automation Conference. ACM\/IEEE, pp. 743\u2013748.","DOI":"10.1145\/157485.165115"},{"key":"238061_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C. Alpert","year":"1995","unstructured":"Alpert, C. and A. Kahng. (1995). \u201cRecent Directions in Netlist Partitioning: a Survey,\u201d Integration 19, 1\u201381.","journal-title":"Integration"},{"key":"238061_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s003579900003","volume":"14","author":"C. Alpert","year":"1997","unstructured":"Alpert, C. and A. Kahng. (1997). \u201cSplitting Orderings in Multi-Way Partitioning to Minimize the Minimum Diameter,\u201d Journal of Classification 14, 51\u201374.","journal-title":"Journal of Classification"},{"issue":"4","key":"238061_CR4","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/PL00009370","volume":"19","author":"H.-J. Bandelt","year":"1998","unstructured":"Bandelt, H.-J.,V. Chepoi, and M. Laurent. (1998). \u201cEmbedding into Rectilinear Spaces,\u201d Discrete of Computational Geometry 19(4), 595\u2013604.","journal-title":"Discrete of Computational Geometry"},{"issue":"4","key":"238061_CR5","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"E. Barnes","year":"1982","unstructured":"Barnes, E. (1982). \u201cAn Algorithm for Partitioning the Nodes of a Graph,\u201d SIAM J. Algebraic Discrete Methods 3(4), 541\u2013550.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"238061_CR6","first-page":"12","volume":"2","author":"J. Barra","year":"1987","unstructured":"Barra, J., M. Becker, E. Kouka, and M. Tricot. (1987). \u201cApplication of Data Analysis Methods and of Simulated Annealing for the Automatic Layout of Circuits,\u201d Computer Systems Science and Engineering 2(1), 12\u201321.","journal-title":"Computer Systems Science and Engineering"},{"key":"238061_CR7","volume-title":"Factorial Analysis of Data Stochastic Method for Automatic Layout of Circuits","author":"J. Barra","year":"1984","unstructured":"Barra, J., M. Becker, E. Kouka, and J. Tsitsimis. (1984). \u201cFactorial Analysis of Data Stochastic Method for Automatic Layout of Circuits.\u201d SIAM Congress, Boston."},{"key":"238061_CR8","unstructured":"Bonabeau, E. (1994). In: Hermes, Paris, chap. 8, pp. 221\u2013261. E. Bonabeau and G. Theraulaz (eds.), Collective Intelligence (in french)."},{"key":"238061_CR9","doi-asserted-by":"crossref","unstructured":"Bonabeau, E., M. Dorigo, and G. Theraulaz. (1998). From Natural to Artificial Swarm Intelligence. Oxford Univ. Press, to appear.","DOI":"10.1093\/oso\/9780195131581.001.0001"},{"key":"238061_CR10","volume-title":"Distance in Graphs","author":"F. Buckley","year":"1990","unstructured":"Buckley, F. and F. Harary. (1990). Distance in Graphs. Toronto: Addison-Wesley."},{"issue":"2","key":"238061_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T. Bui","year":"1987","unstructured":"Bui, T., S. Chaudhuri, F. Leighton, and M. Sipser. (1987). \u201cGraph Bisection Algorithms with Good Average Case Behavior,\u201d Combinatorica 7(2), 171\u2013191.","journal-title":"Combinatorica"},{"key":"238061_CR12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02294337","volume":"61","author":"F. Caillez","year":"1996","unstructured":"Caillez, F. and P. Kuntz. (1996). \u201cContribution to the Study of the Metric and Euclidian Structures of Dissimilarity,\u201d Psychometrika 61, 241\u2013253.","journal-title":"Psychometrika"},{"key":"238061_CR13","doi-asserted-by":"crossref","first-page":"737","DOI":"10.2307\/3214677","volume":"28","author":"E. Coffman","year":"1991","unstructured":"Coffman, E., P. Courtois, E. Gilbert, and P. Piret. (1991). \u201cA Distributed Clustering Process,\u201d Journal of Applied Probability 28, 737\u2013750.","journal-title":"Journal of Applied Probability"},{"key":"238061_CR14","unstructured":"Dalhaus, E., D. Johnson, C. Papadimitriu, P. Seymour, and Yanakakis. (1983). \u201cThe Complexity of the Multiway Cuts.\u201d Private communication."},{"issue":"3","key":"238061_CR15","first-page":"105","volume":"2","author":"H. de Fraysseix","year":"1992","unstructured":"de Fraysseix, H. and P. Kuntz. (1992). \u201cPagination of Large-Scale Networks; Embedding a Graph in <n for Effective Partitioning,\u201d Algorithms Review 2(3), 105\u2013112.","journal-title":"Algorithms Review"},{"key":"238061_CR16","doi-asserted-by":"crossref","unstructured":"Deneubourg, J., S. Goss, N. Franks, A. Sendova-franks, C. Detrain, and L. Chretien. (1990). \u201cThe Dynamics of Collective Sorting: Robot-Like Ants and Ant-Like Robots.\u201d 1st Int. Conf. on Simulation of Adaptative Behaviour: From Animals to Animats. Paris, pp. 356\u2013363.","DOI":"10.7551\/mitpress\/3115.003.0048"},{"key":"238061_CR17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.2307\/1932409","volume":"26","author":"L. Dice","year":"1995","unstructured":"Dice, L. (1995). \u201cMeasures of the Amount of Ecologic Association Between Species,\u201d Ecologie 26, 297\u2013302.","journal-title":"Ecologie"},{"key":"238061_CR18","unstructured":"Fichet, B. (1987). \u201cThe Role Played by l1 in Data Analysis.\u201d In Y. Dodge (ed.), Statistical Data Analysis Based in the l1i-norm and Related Methods. Elsevier Science, 185\u2013193."},{"key":"238061_CR19","doi-asserted-by":"crossref","unstructured":"Fiduccia, C. and M. Mattheyses. (1982). \u201cA Linear Time Heuristic for Improving Network Partitions.\u201d Proc. of the ACM\/IEEE 19th Design Automation Conference. pp. 175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"238061_CR20","doi-asserted-by":"crossref","unstructured":"Garbers, J., H. Promel, and A. Steger. (1990). \u201cFinding Clusters in VLSI Circuits.\u201d IEEE Int. Conf. on Computer-Aided Design, pp. 520\u2013523.","DOI":"10.1109\/ICCAD.1990.129970"},{"key":"238061_CR21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"Garey, M., D. Johnson, and L. Stockmeyer. (1976). \u201cSome SimplifiedNP-Complete Graph Problems,\u201d Theoretical Computer Science 1, 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"238061_CR22","volume-title":"A Polynomial Algorithm for the k-cut Problem","author":"O. Goldschmidt","year":"1987","unstructured":"Goldschmidt, O. and D. Hochbaum. (1987). \u201cA Polynomial Algorithm for the k-cut Problem.\u201d School of Business Administration, University of California, Berkeley, CA."},{"key":"238061_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01896809","volume":"3","author":"C. Gower","year":"1984","unstructured":"Gower, C. and P. Legendre. (1984). \u201cMetric and Euclidean Properties of Dissimilarity Coefficients,\u201d Journal of Classification 3, 5\u201348.","journal-title":"Journal of Classification"},{"key":"238061_CR24","doi-asserted-by":"crossref","unstructured":"Hagen, L. and A. Kahng. (1992). \u201cANewApproach to Effective Circuit Clustering.\u201d IEEE International Conference on Computer-Aided Design. Santa Clara, pp. 422\u2013427.","DOI":"10.1109\/ICCAD.1992.279334"},{"key":"238061_CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"K. Hall","year":"1970","unstructured":"Hall, K. (1970). \u201cAn r-Dimensional Quadratic Placement Algorithm,\u201d Management Sci. 17, 219\u2013229.","journal-title":"Management Sci"},{"key":"238061_CR26","series-title":"Technical Report","volume-title":"The Chaco User's Guide: Version 2.0","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B. and R. Leland. (1995). \u201cThe Chaco User's Guide: Version 2.0.\u201d Technical Report SANS94-2692, Sandia National Laboratories, Albuquerque, July 1995."},{"key":"238061_CR27","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02621407","volume":"9","author":"L. Hubert","year":"1992","unstructured":"Hubert, L. and P. Arabie. (1992). \u201cMultidimensional Scaling in the City-Block Metric; a Combinatorial Approach,\u201d Journal of Classification 9, 211\u2013236.","journal-title":"Journal of Classification"},{"key":"238061_CR28","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1093\/cercor\/8.1.28","volume":"8","author":"B. Jouve","year":"1998","unstructured":"Jouve, B., P. Rosenstiehl, and M. Imbert. (1998). \u201cA Mathematical Approach to the Connectivity Between the Cortical Areas of the Macaque Monkey,\u201d Cerebral Cortex 8, 28\u201339.","journal-title":"Cerebral Cortex"},{"key":"238061_CR29","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"Kernighan, B. and S. Lin. (1970). \u201cAn Efficient Heuristic Procedure for Partitioning Graphs,\u201d Bell System Technical Journal 49, 291\u2013307.","journal-title":"Bell System Technical Journal"},{"issue":"5","key":"238061_CR30","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"C-33","author":"B. Krishnamurthy","year":"1984","unstructured":"Krishnamurthy, B. (1984). \u201cAn Improved Min-Cut Algorithm for Partitioning VLSI Networks,\u201d IEEE Trans. on Computer C-33(5), 438\u2013446.","journal-title":"IEEE Trans. on Computer"},{"key":"238061_CR31","unstructured":"Kuntz, P. (1992). \u201cEuclidean Representation of an Abstract Graph for its Partitioning.\u201d Ph.D. Thesis, E.H.E.S.S., Paris."},{"key":"238061_CR32","first-page":"5","volume":"7","author":"P. Lagognotte","year":"1991","unstructured":"Lagognotte, P. (1991). \u201cThe Different Electrical Distances (in French),\u201d Revue G\u00e9n\u00e9rale de l'Electricit\u00e9 7, 5\u201310.","journal-title":"Revue G\u00e9n\u00e9rale de l'Electricit\u00e9"},{"key":"238061_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauert","year":"1990","unstructured":"Lengauert, T. (1990). Combinatorial Algorithms for Integrated Circuit Layout. London: John Wiley."},{"key":"238061_CR34","first-page":"499","volume-title":"Third Conf. on Simulation of Adaptative Behaviour","author":"E. Lumer","year":"1994","unstructured":"Lumer, E. and B. Faieta. (1994). \u201cDiversity and Adaptation in Populations of Clustering Ants.\u201d Third Conf. on Simulation of Adaptative Behaviour. Brighton: MIT Press, pp. 499\u2013508."},{"key":"238061_CR35","series-title":"Technical Report","volume-title":"Eigenvalues in Combinatorial Optimization","author":"B. Mohar","year":"1992","unstructured":"Mohar, B. and S. Poljak. (1992). \u201cEigenvalues in Combinatorial Optimization.\u201d Technical Report 30, 371, University of Ljubljana, Department of Mathematics, Slovenia."},{"key":"238061_CR36","unstructured":"Sait, S. and H. Youssef. (1995). VLSI Physical Design Automation: Theory and Practice. IEEE Press and Mc Graw-Hill."},{"key":"238061_CR37","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1038\/369448b0","volume":"369","author":"M. Simmen","year":"1994","unstructured":"Simmen, M., G. Goodhill, and D. Wilishaw. (1994). \u201cScaling and Brain Connectivity,\u201d Nature 369, 448\u2013450.","journal-title":"Nature"},{"key":"238061_CR38","unstructured":"Torgerson, W. (1958). Theory and Methods of Scaling. J. Wiley & Sons."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009665701840.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009665701840\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009665701840.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:11:49Z","timestamp":1747653109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009665701840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["238061"],"URL":"https:\/\/doi.org\/10.1023\/a:1009665701840","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}