<?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>Decomposition of geometric graphs into star-forests</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

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


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

<name type="personal">
  <namePart type="given">János</namePart>
  <namePart type="family">Pach</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">E62E3130-B088-11EA-B919-BF823C25FEA4</identifier></name>
<name type="personal">
  <namePart type="given">Morteza</namePart>
  <namePart type="family">Saghafian</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">f86f7148-b140-11ec-9577-95435b8df824</identifier></name>
<name type="personal">
  <namePart type="given">Patrick</namePart>
  <namePart type="family">Schnider</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







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



<name type="conference">
  <namePart>GD: Graph Drawing and Network Visualization</namePart>
</name>



<name type="corporate">
  <namePart>Alpha Shape Theory Extended</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>Mathematics, Computer Science</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n-1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2024</dateIssued><place><placeTerm type="text">Isola delle Femmine, Palermo, Italy</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>31st International Symposium on Graph Drawing and Network Visualization</title></titleInfo>
  <identifier type="issn">03029743</identifier>
  <identifier type="eIssn">16113349</identifier>
  <identifier type="isbn">9783031492716</identifier>
  <identifier type="arXiv">2306.13201</identifier>
  <identifier type="ISI">001207939600023</identifier><identifier type="doi">10.1007/978-3-031-49272-3_23</identifier>
<part><detail type="volume"><number>14465</number></detail><extent unit="pages">339-346</extent>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/21253</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<chicago>Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.” In &lt;i&gt;31st International Symposium on Graph Drawing and Network Visualization&lt;/i&gt;, 14465:339–46. Springer Nature, 2024. &lt;a href=&quot;https://doi.org/10.1007/978-3-031-49272-3_23&quot;&gt;https://doi.org/10.1007/978-3-031-49272-3_23&lt;/a&gt;.</chicago>
<apa>Pach, J., Saghafian, M., &amp;#38; Schnider, P. (2024). Decomposition of geometric graphs into star-forests. In &lt;i&gt;31st International Symposium on Graph Drawing and Network Visualization&lt;/i&gt; (Vol. 14465, pp. 339–346). Isola delle Femmine, Palermo, Italy: Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/978-3-031-49272-3_23&quot;&gt;https://doi.org/10.1007/978-3-031-49272-3_23&lt;/a&gt;</apa>
<short>J. Pach, M. Saghafian, P. Schnider, in:, 31st International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2024, pp. 339–346.</short>
<mla>Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.” &lt;i&gt;31st International Symposium on Graph Drawing and Network Visualization&lt;/i&gt;, vol. 14465, Springer Nature, 2024, pp. 339–46, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-031-49272-3_23&quot;&gt;10.1007/978-3-031-49272-3_23&lt;/a&gt;.</mla>
<ieee>J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” in &lt;i&gt;31st International Symposium on Graph Drawing and Network Visualization&lt;/i&gt;, Isola delle Femmine, Palermo, Italy, 2024, vol. 14465, pp. 339–346.</ieee>
<ama>Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests. In: &lt;i&gt;31st International Symposium on Graph Drawing and Network Visualization&lt;/i&gt;. Vol 14465. Springer Nature; 2024:339-346. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-031-49272-3_23&quot;&gt;10.1007/978-3-031-49272-3_23&lt;/a&gt;</ama>
<ista>Pach J, Saghafian M, Schnider P. 2024. Decomposition of geometric graphs into star-forests. 31st International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 14465, 339–346.</ista>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>15012</recordIdentifier><recordCreationDate encoding="w3cdtf">2024-02-18T23:01:03Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-02-17T13:14:39Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
