{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:35Z","timestamp":1725467795658},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_7","type":"book-chapter","created":{"date-parts":[[2013,2,13]],"date-time":"2013-02-13T22:17:33Z","timestamp":1360793853000},"page":"67-78","source":"Crossref","is-referenced-by-count":9,"title":["Progress on Partial Edge Drawings"],"prefix":"10.1007","author":[{"given":"Till","family":"Bruckdorfer","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s004530010075","volume":"29","author":"R. Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint. Algorithmica\u00a029, 595\u2013609 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/2945.468391","volume":"1","author":"R.A. Becker","year":"1995","unstructured":"Becker, R.A., Eick, S.G., Wilks, A.R.: Visualizing network data. IEEE Trans. Visual. Comput. Graphics\u00a01(1), 16\u201328 (1995)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"issue":"9","key":"7_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput.\u00a028(9), 643\u2013647 (1979)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., N\u00f6llenburg, M., Wolff, A.: Progress on partial edge drawings. Arxiv, arxiv.org\/abs\/1209.0830 (2012)","key":"7_CR4","DOI":"10.1007\/978-3-642-36763-2_7"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-30347-0_7","volume-title":"Fun with Algorithms","author":"T. Bruckdorfer","year":"2012","unstructured":"Bruckdorfer, T., Kaufmann, M.: Mad at Edge Crossings? Break the Edges! In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol.\u00a07288, pp. 40\u201350. Springer, Heidelberg (2012)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-642-25878-7_22","volume-title":"GD 2011","author":"M. Burch","year":"2012","unstructured":"Burch, M., Vehlow, C., Konevtsova, N., Weiskopf, D.: Evaluating Partially Drawn Links for Directed Graph Edges. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 226\u2013237. Springer, Heidelberg (2012)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M. Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: Visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl.\u00a09(1), 31\u201352 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"8","key":"7_CR8","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.comgeo.2008.05.005","volume":"42","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D., van Kreveld, M., Mumford, E., Speckmann, B.: Edges and switches, tunnels and bridges. Comput. Geom. Theory Appl.\u00a042(8), 790\u2013802 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"key":"7_CR9","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/PACIFICVIS.2011.5742389","volume-title":"4th IEEE Pacific Visual. Symp. (PacificVis 2011)","author":"E. Gansner","year":"2011","unstructured":"Gansner, E., Hu, Y., North, S., Scheidegger, C.: Multilevel agglomerative edge bundling for visualizing large graphs. In: 4th IEEE Pacific Visual. Symp. (PacificVis 2011), pp. 187\u2013194. IEEE Press, New York (2011)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n\n                  1\u2009\u2212\u2009\u03b5\n                  . Acta Math.\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D. Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Comput. Graphics Forum\u00a028(3), 983\u2013990 (2009)","journal-title":"Comput. Graphics Forum"},{"unstructured":"Kindermann, P., Spoerhase, J.: Private Communication (March 2012)","key":"7_CR13"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combin.\u00a017, 427\u2013439 (1997)","journal-title":"Combin."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/PacificVis.2012.6183575","volume-title":"5th IEEE Pacific Visual. Symp. (PacificVis 2012)","author":"D. Peng","year":"2012","unstructured":"Peng, D., Lu, N., Chen, W., Peng, Q.: SideKnot: Revealing relation patterns for graph visualization. In: 5th IEEE Pacific Visual. Symp. (PacificVis 2012), pp. 65\u201372. IEEE Press, New York (2012)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-72788-0_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"S. Porschen","year":"2007","unstructured":"Porschen, S., Speckenmeyer, E.: Algorithms for Variable-Weighted 2-SAT and Dual Problems. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 173\u2013186. Springer, Heidelberg (2007)"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/IV.2011.63","volume-title":"15th Int. Conf. Inform. Visual. (IV 2011)","author":"A. Rusu","year":"2011","unstructured":"Rusu, A., Fabian, A.J., Jianu, R., Rusu, A.: Using the gestalt principle of closure to alleviate the edge crossing problem in graph drawings. In: 15th Int. Conf. Inform. Visual. (IV 2011), pp. 488\u2013493. IEEE Press, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T02:48:45Z","timestamp":1557542925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}