<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Approximating the bundled crossing number</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Alan M</namePart>
  <namePart type="family">Arroyo Guevara</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3207FDC6-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0003-2401-8670</description></name>
<name type="personal">
  <namePart type="given">Stefan</namePart>
  <namePart type="family">Felsner</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">UlWa</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>WALCOM: Algorithms and Computation</namePart>
</name>



<name type="corporate">
  <namePart>ISTplus - Postdoctoral Fellowships</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">Bundling crossings is a strategy which can enhance the readability of graph drawings. In this paper we consider bundlings for families of pseudosegments, i.e., simple curves such that any two have share at most one point at which they cross. Our main result is that there is a polynomial-time algorithm to compute an 8-approximation of the bundled crossing number of such instances (up to adding a term depending on the facial structure). This 8-approximation also holds for bundlings of good drawings of graphs. In the special case of circular drawings the approximation factor is 8 (no extra term), this improves upon the 10-approximation of Fink et al. [6]. We also show how to compute a 92-approximation when the intersection graph of the pseudosegments is bipartite.</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2022</dateIssued><place><placeTerm type="text">Jember, Indonesia</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>WALCOM 2022: Algorithms and Computation</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="eIssn">1611-3349</identifier>
  <identifier type="isbn">9783030967307</identifier>
  <identifier type="arXiv">2109.14892</identifier>
  <identifier type="ISI">001435074700031</identifier><identifier type="doi">10.1007/978-3-030-96731-4_31</identifier>
<part><detail type="volume"><number>13174</number></detail><extent unit="pages">383-395</extent>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/13969</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<chicago>Arroyo Guevara, Alan M, and Stefan Felsner. “Approximating the Bundled Crossing Number.” In &lt;i&gt;WALCOM 2022: Algorithms and Computation&lt;/i&gt;, 13174:383–95. LNCS. Springer Nature, 2022. &lt;a href=&quot;https://doi.org/10.1007/978-3-030-96731-4_31&quot;&gt;https://doi.org/10.1007/978-3-030-96731-4_31&lt;/a&gt;.</chicago>
<ama>Arroyo Guevara AM, Felsner S. Approximating the bundled crossing number. In: &lt;i&gt;WALCOM 2022: Algorithms and Computation&lt;/i&gt;. Vol 13174. LNCS. Springer Nature; 2022:383-395. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-030-96731-4_31&quot;&gt;10.1007/978-3-030-96731-4_31&lt;/a&gt;</ama>
<apa>Arroyo Guevara, A. M., &amp;#38; Felsner, S. (2022). Approximating the bundled crossing number. In &lt;i&gt;WALCOM 2022: Algorithms and Computation&lt;/i&gt; (Vol. 13174, pp. 383–395). Jember, Indonesia: Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/978-3-030-96731-4_31&quot;&gt;https://doi.org/10.1007/978-3-030-96731-4_31&lt;/a&gt;</apa>
<ieee>A. M. Arroyo Guevara and S. Felsner, “Approximating the bundled crossing number,” in &lt;i&gt;WALCOM 2022: Algorithms and Computation&lt;/i&gt;, Jember, Indonesia, 2022, vol. 13174, pp. 383–395.</ieee>
<short>A.M. Arroyo Guevara, S. Felsner, in:, WALCOM 2022: Algorithms and Computation, Springer Nature, 2022, pp. 383–395.</short>
<ista>Arroyo Guevara AM, Felsner S. 2022. Approximating the bundled crossing number. WALCOM 2022: Algorithms and Computation. WALCOM: Algorithms and ComputationLNCS vol. 13174, 383–395.</ista>
<mla>Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.” &lt;i&gt;WALCOM 2022: Algorithms and Computation&lt;/i&gt;, vol. 13174, Springer Nature, 2022, pp. 383–95, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-030-96731-4_31&quot;&gt;10.1007/978-3-030-96731-4_31&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>11185</recordIdentifier><recordCreationDate encoding="w3cdtf">2022-04-17T22:01:47Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-10T09:35:56Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
