<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml">
<url><loc>https://scifaro.com/en/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218"/></url>
<url><loc>https://scifaro.com/zh/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-almost-periodicity-criteria-for-morphic-sequences-in-some-particular-cases-0704.0218"/></url>
<url><loc>https://scifaro.com/en/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358</loc><lastmod>2007-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358"/></url>
<url><loc>https://scifaro.com/zh/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358</loc><lastmod>2007-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-preserving-mappings-from-ternary-vectors-to-permutations-0704.1358"/></url>
<url><loc>https://scifaro.com/en/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571</loc><lastmod>2008-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571"/></url>
<url><loc>https://scifaro.com/zh/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571</loc><lastmod>2008-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-restrictions-of-balanced-2-interval-graphs-0704.1571"/></url>
<url><loc>https://scifaro.com/en/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829"/></url>
<url><loc>https://scifaro.com/zh/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-line-chain-partitions-of-up-growing-semi-orders-0704.1829"/></url>
<url><loc>https://scifaro.com/en/abs/frugal-colouring-of-graphs-0705.0422</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frugal-colouring-of-graphs-0705.0422"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/frugal-colouring-of-graphs-0705.0422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frugal-colouring-of-graphs-0705.0422"/></url>
<url><loc>https://scifaro.com/zh/abs/frugal-colouring-of-graphs-0705.0422</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frugal-colouring-of-graphs-0705.0422"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/frugal-colouring-of-graphs-0705.0422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frugal-colouring-of-graphs-0705.0422"/></url>
<url><loc>https://scifaro.com/en/abs/matroid-pathwidth-and-code-trellis-complexity-0705.1384</loc><lastmod>2007-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matroid-pathwidth-and-code-trellis-complexity-0705.1384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matroid-pathwidth-and-code-trellis-complexity-0705.1384"/></url>
<url><loc>https://scifaro.com/en/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137"/></url>
<url><loc>https://scifaro.com/zh/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-insertion-algorithm-for-resource-constrained-project-scheduling-problem-0705.2137"/></url>
<url><loc>https://scifaro.com/en/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316</loc><lastmod>2007-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316"/></url>
<url><loc>https://scifaro.com/zh/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316</loc><lastmod>2007-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclicity-of-preferences-nash-equilibria-and-subgame-perfect-equilibria-a-formal-and-constructive-equivalence-0705.3316"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-obfuscation-complexity-of-planar-graphs-0705.3748</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-obfuscation-complexity-of-planar-graphs-0705.3748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-obfuscation-complexity-of-planar-graphs-0705.3748"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-planar-perfect-matching-and-permanents-of-bounded-treewidth-matrices-0705.3751</loc><lastmod>2007-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-planar-perfect-matching-and-permanents-of-bounded-treewidth-matrices-0705.3751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-planar-perfect-matching-and-permanents-of-bounded-treewidth-matrices-0705.3751"/></url>
<url><loc>https://scifaro.com/en/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320</loc><lastmod>2007-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320"/></url>
<url><loc>https://scifaro.com/zh/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320</loc><lastmod>2007-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defect-tolerant-cmol-cell-assignment-via-satisfiability-0705.4320"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431</loc><lastmod>2008-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431"/></url>
<url><loc>https://scifaro.com/zh/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431</loc><lastmod>2008-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-numeration-systems-on-bounded-languages-and-multiplication-by-a-constant-0706.0431"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318</loc><lastmod>2007-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318"/></url>
<url><loc>https://scifaro.com/zh/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318</loc><lastmod>2007-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-a-maximum-utility-slate-of-on-line-advertisements-0706.1318"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642</loc><lastmod>2007-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642"/></url>
<url><loc>https://scifaro.com/zh/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642</loc><lastmod>2007-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-growth-of-components-with-non-fixed-excesses-0706.1642"/></url>
<url><loc>https://scifaro.com/en/abs/another-proof-of-wright-s-inequalities-0706.1665</loc><lastmod>2007-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/another-proof-of-wright-s-inequalities-0706.1665"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/another-proof-of-wright-s-inequalities-0706.1665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/another-proof-of-wright-s-inequalities-0706.1665"/></url>
<url><loc>https://scifaro.com/zh/abs/another-proof-of-wright-s-inequalities-0706.1665</loc><lastmod>2007-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/another-proof-of-wright-s-inequalities-0706.1665"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/another-proof-of-wright-s-inequalities-0706.1665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/another-proof-of-wright-s-inequalities-0706.1665"/></url>
<url><loc>https://scifaro.com/en/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479</loc><lastmod>2007-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479"/></url>
<url><loc>https://scifaro.com/zh/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479</loc><lastmod>2007-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progresses-in-the-analysis-of-stochastic-2d-cellular-automata-a-study-of-asynchronous-2d-minority-0706.2479"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575</loc><lastmod>2007-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575"/></url>
<url><loc>https://scifaro.com/zh/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575</loc><lastmod>2007-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-lower-bound-on-the-independence-number-of-a-graph-0706.2575"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-storage-devices-0706.2746</loc><lastmod>2007-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-storage-devices-0706.2746"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/abstract-storage-devices-0706.2746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-storage-devices-0706.2746"/></url>
<url><loc>https://scifaro.com/zh/abs/abstract-storage-devices-0706.2746</loc><lastmod>2007-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-storage-devices-0706.2746"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/abstract-storage-devices-0706.2746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-storage-devices-0706.2746"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848</loc><lastmod>2008-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848"/></url>
<url><loc>https://scifaro.com/zh/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848</loc><lastmod>2008-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-sum-edge-colorings-of-multicycles-0706.3848"/></url>
<url><loc>https://scifaro.com/en/abs/bid-optimization-for-internet-graphical-ad-auction-systems-via-special-ordered-sets-0706.3865</loc><lastmod>2007-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bid-optimization-for-internet-graphical-ad-auction-systems-via-special-ordered-sets-0706.3865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bid-optimization-for-internet-graphical-ad-auction-systems-via-special-ordered-sets-0706.3865"/></url>
<url><loc>https://scifaro.com/en/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715</loc><lastmod>2007-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715"/></url>
<url><loc>https://scifaro.com/zh/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715</loc><lastmod>2007-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sources-of-superlinearity-in-davenport-schinzel-sequences-0707.1715"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-minimal-matching-covered-graphs-0707.1925</loc><lastmod>2007-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-minimal-matching-covered-graphs-0707.1925"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-note-on-minimal-matching-covered-graphs-0707.1925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-minimal-matching-covered-graphs-0707.1925"/></url>
<url><loc>https://scifaro.com/zh/abs/a-note-on-minimal-matching-covered-graphs-0707.1925</loc><lastmod>2007-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-minimal-matching-covered-graphs-0707.1925"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-note-on-minimal-matching-covered-graphs-0707.1925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-minimal-matching-covered-graphs-0707.1925"/></url>
<url><loc>https://scifaro.com/en/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926</loc><lastmod>2007-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926"/></url>
<url><loc>https://scifaro.com/zh/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926</loc><lastmod>2007-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-trees-with-a-maximum-proper-partial-0-1-coloring-containing-a-maximum-matching-0707.1926"/></url>
<url><loc>https://scifaro.com/en/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126</loc><lastmod>2008-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126"/></url>
<url><loc>https://scifaro.com/zh/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126</loc><lastmod>2008-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complexity-of-special-maximum-matchings-constructing-0707.2126"/></url>
<url><loc>https://scifaro.com/en/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295</loc><lastmod>2007-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295"/></url>
<url><loc>https://scifaro.com/zh/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295</loc><lastmod>2007-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-polynomial-algorithms-for-special-maximum-matching-constructing-in-trees-0707.2295"/></url>
<url><loc>https://scifaro.com/en/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921</loc><lastmod>2007-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921"/></url>
<url><loc>https://scifaro.com/zh/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921</loc><lastmod>2007-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-a-line-segment-with-variable-radius-discs-0707.2921"/></url>
<url><loc>https://scifaro.com/en/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231</loc><lastmod>2007-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231"/></url>
<url><loc>https://scifaro.com/zh/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231</loc><lastmod>2007-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimation-of-small-s-t-reliabilities-in-acyclic-networks-0707.3231"/></url>
<url><loc>https://scifaro.com/en/abs/zero-automatic-queues-and-product-form-0707.3449</loc><lastmod>2007-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zero-automatic-queues-and-product-form-0707.3449"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/zero-automatic-queues-and-product-form-0707.3449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zero-automatic-queues-and-product-form-0707.3449"/></url>
<url><loc>https://scifaro.com/zh/abs/zero-automatic-queues-and-product-form-0707.3449</loc><lastmod>2007-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zero-automatic-queues-and-product-form-0707.3449"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/zero-automatic-queues-and-product-form-0707.3449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zero-automatic-queues-and-product-form-0707.3449"/></url>
<url><loc>https://scifaro.com/en/abs/mumford-dendrograms-0707.3540</loc><lastmod>2010-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mumford-dendrograms-0707.3540"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/mumford-dendrograms-0707.3540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mumford-dendrograms-0707.3540"/></url>
<url><loc>https://scifaro.com/zh/abs/mumford-dendrograms-0707.3540</loc><lastmod>2010-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mumford-dendrograms-0707.3540"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/mumford-dendrograms-0707.3540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mumford-dendrograms-0707.3540"/></url>
<url><loc>https://scifaro.com/en/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622</loc><lastmod>2011-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622"/></url>
<url><loc>https://scifaro.com/zh/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622</loc><lastmod>2011-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-degree-graph-expansions-that-preserve-the-treewidth-0707.3622"/></url>
<url><loc>https://scifaro.com/en/abs/queues-stores-and-tableaux-0707.4104</loc><lastmod>2007-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/queues-stores-and-tableaux-0707.4104"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/queues-stores-and-tableaux-0707.4104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/queues-stores-and-tableaux-0707.4104"/></url>
<url><loc>https://scifaro.com/zh/abs/queues-stores-and-tableaux-0707.4104</loc><lastmod>2007-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/queues-stores-and-tableaux-0707.4104"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/queues-stores-and-tableaux-0707.4104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/queues-stores-and-tableaux-0707.4104"/></url>
<url><loc>https://scifaro.com/en/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124</loc><lastmod>2007-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124"/></url>
<url><loc>https://scifaro.com/zh/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124</loc><lastmod>2007-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/services-within-a-busy-period-of-an-m-m-1-queue-and-dyck-paths-0707.4124"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580</loc><lastmod>2007-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580"/></url>
<url><loc>https://scifaro.com/zh/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580</loc><lastmod>2007-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-edge-colored-graphs-and-digraphs-without-properly-colored-cycles-0707.4580"/></url>
<url><loc>https://scifaro.com/en/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211</loc><lastmod>2007-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211"/></url>
<url><loc>https://scifaro.com/zh/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211</loc><lastmod>2007-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deterministic-sub-linear-time-sparse-fourier-algorithm-via-non-adaptive-compressed-sensing-methods-0708.1211"/></url>
<url><loc>https://scifaro.com/en/abs/on-edge-disjoint-pairs-of-matchings-0708.1903</loc><lastmod>2008-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-edge-disjoint-pairs-of-matchings-0708.1903"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-edge-disjoint-pairs-of-matchings-0708.1903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-edge-disjoint-pairs-of-matchings-0708.1903"/></url>
<url><loc>https://scifaro.com/zh/abs/on-edge-disjoint-pairs-of-matchings-0708.1903</loc><lastmod>2008-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-edge-disjoint-pairs-of-matchings-0708.1903"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-edge-disjoint-pairs-of-matchings-0708.1903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-edge-disjoint-pairs-of-matchings-0708.1903"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336</loc><lastmod>2007-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336"/></url>
<url><loc>https://scifaro.com/zh/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336</loc><lastmod>2007-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-linear-k-cnfs-exist-for-every-k-0708.2336"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363"/></url>
<url><loc>https://scifaro.com/zh/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-constructive-characterization-of-a-class-of-trees-related-to-pairs-of-disjoint-matchings-0708.2363"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514</loc><lastmod>2007-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514"/></url>
<url><loc>https://scifaro.com/zh/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514</loc><lastmod>2007-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-reflexive-digraphs-0708.2514"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544</loc><lastmod>2007-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544"/></url>
<url><loc>https://scifaro.com/zh/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544</loc><lastmod>2007-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-minimum-cost-homomorphism-problem-for-reflexive-multipartite-tournaments-0708.2544"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545</loc><lastmod>2007-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545"/></url>
<url><loc>https://scifaro.com/zh/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545</loc><lastmod>2007-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-minimum-cost-homomorphism-problem-for-semicomplete-digraphs-with-possible-loops-0708.2545"/></url>
<url><loc>https://scifaro.com/en/abs/the-frobenius-problem-in-a-free-monoid-0708.3224</loc><lastmod>2007-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-frobenius-problem-in-a-free-monoid-0708.3224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-frobenius-problem-in-a-free-monoid-0708.3224"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-structure-and-bandwidth-of-hales-numbered-hypercube-0708.3628</loc><lastmod>2007-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-structure-and-bandwidth-of-hales-numbered-hypercube-0708.3628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-structure-and-bandwidth-of-hales-numbered-hypercube-0708.3628"/></url>
<url><loc>https://scifaro.com/en/abs/a-course-on-combinatorial-algorithms-0708.3962</loc><lastmod>2007-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-course-on-combinatorial-algorithms-0708.3962"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-course-on-combinatorial-algorithms-0708.3962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-course-on-combinatorial-algorithms-0708.3962"/></url>
<url><loc>https://scifaro.com/zh/abs/a-course-on-combinatorial-algorithms-0708.3962</loc><lastmod>2007-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-course-on-combinatorial-algorithms-0708.3962"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-course-on-combinatorial-algorithms-0708.3962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-course-on-combinatorial-algorithms-0708.3962"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284</loc><lastmod>2007-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284"/></url>
<url><loc>https://scifaro.com/zh/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284</loc><lastmod>2007-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-per-edge-processing-times-in-the-semi-streaming-model-0708.4284"/></url>
<url><loc>https://scifaro.com/en/abs/the-road-coloring-problem-0709.0099</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-road-coloring-problem-0709.0099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-road-coloring-problem-0709.0099"/></url>
<url><loc>https://scifaro.com/en/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906</loc><lastmod>2007-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906"/></url>
<url><loc>https://scifaro.com/zh/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906</loc><lastmod>2007-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-greedy-randomized-adaptive-search-procedure-for-technicians-and-interventions-scheduling-for-telecommunications-0709.0906"/></url>
<url><loc>https://scifaro.com/en/abs/finding-paths-and-cycles-in-graphs-0709.0974</loc><lastmod>2007-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-paths-and-cycles-in-graphs-0709.0974"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/finding-paths-and-cycles-in-graphs-0709.0974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-paths-and-cycles-in-graphs-0709.0974"/></url>
<url><loc>https://scifaro.com/zh/abs/finding-paths-and-cycles-in-graphs-0709.0974</loc><lastmod>2007-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-paths-and-cycles-in-graphs-0709.0974"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/finding-paths-and-cycles-in-graphs-0709.0974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-paths-and-cycles-in-graphs-0709.0974"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197</loc><lastmod>2007-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197"/></url>
<url><loc>https://scifaro.com/zh/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197</loc><lastmod>2007-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-finds-noticeable-trends-and-examples-concerning-the-v-c-erny-conjecture-0709.1197"/></url>
<url><loc>https://scifaro.com/en/abs/the-rank-width-of-edge-colored-graphs-0709.1433</loc><lastmod>2014-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rank-width-of-edge-colored-graphs-0709.1433"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-rank-width-of-edge-colored-graphs-0709.1433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rank-width-of-edge-colored-graphs-0709.1433"/></url>
<url><loc>https://scifaro.com/zh/abs/the-rank-width-of-edge-colored-graphs-0709.1433</loc><lastmod>2014-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rank-width-of-edge-colored-graphs-0709.1433"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-rank-width-of-edge-colored-graphs-0709.1433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rank-width-of-edge-colored-graphs-0709.1433"/></url>
<url><loc>https://scifaro.com/en/abs/overlap-free-words-and-spectra-of-matrices-0709.1794</loc><lastmod>2007-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overlap-free-words-and-spectra-of-matrices-0709.1794"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/overlap-free-words-and-spectra-of-matrices-0709.1794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overlap-free-words-and-spectra-of-matrices-0709.1794"/></url>
<url><loc>https://scifaro.com/zh/abs/overlap-free-words-and-spectra-of-matrices-0709.1794</loc><lastmod>2007-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overlap-free-words-and-spectra-of-matrices-0709.1794"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/overlap-free-words-and-spectra-of-matrices-0709.1794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overlap-free-words-and-spectra-of-matrices-0709.1794"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201</loc><lastmod>2010-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201"/></url>
<url><loc>https://scifaro.com/zh/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201</loc><lastmod>2010-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-proof-of-the-graceful-tree-conjecture-using-the-concept-of-edge-degree-0709.2201"/></url>
<url><loc>https://scifaro.com/en/abs/h-decompositions-0709.2525</loc><lastmod>2010-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/h-decompositions-0709.2525"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/h-decompositions-0709.2525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/h-decompositions-0709.2525"/></url>
<url><loc>https://scifaro.com/zh/abs/h-decompositions-0709.2525</loc><lastmod>2010-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/h-decompositions-0709.2525"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/h-decompositions-0709.2525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/h-decompositions-0709.2525"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689"/></url>
<url><loc>https://scifaro.com/zh/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-solving-the-independent-set-problem-0709.2689"/></url>
<url><loc>https://scifaro.com/en/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257</loc><lastmod>2007-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257"/></url>
<url><loc>https://scifaro.com/zh/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257</loc><lastmod>2007-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/series-which-are-both-max-plus-and-min-plus-rational-are-unambiguous-0709.3257"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-matching-in-the-semi-streaming-model-0709.3384</loc><lastmod>2008-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-matching-in-the-semi-streaming-model-0709.3384"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/weighted-matching-in-the-semi-streaming-model-0709.3384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-matching-in-the-semi-streaming-model-0709.3384"/></url>
<url><loc>https://scifaro.com/zh/abs/weighted-matching-in-the-semi-streaming-model-0709.3384</loc><lastmod>2008-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-matching-in-the-semi-streaming-model-0709.3384"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/weighted-matching-in-the-semi-streaming-model-0709.3384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-matching-in-the-semi-streaming-model-0709.3384"/></url>
<url><loc>https://scifaro.com/en/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590</loc><lastmod>2010-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590"/></url>
<url><loc>https://scifaro.com/zh/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590</loc><lastmod>2010-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extension-of-a-result-concerning-convex-geometric-graphs-0709.3590"/></url>
<url><loc>https://scifaro.com/en/abs/set-matrices-and-the-path-cycle-problem-0709.4273</loc><lastmod>2007-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-matrices-and-the-path-cycle-problem-0709.4273"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/set-matrices-and-the-path-cycle-problem-0709.4273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-matrices-and-the-path-cycle-problem-0709.4273"/></url>
<url><loc>https://scifaro.com/zh/abs/set-matrices-and-the-path-cycle-problem-0709.4273</loc><lastmod>2007-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-matrices-and-the-path-cycle-problem-0709.4273"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/set-matrices-and-the-path-cycle-problem-0709.4273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-matrices-and-the-path-cycle-problem-0709.4273"/></url>
<url><loc>https://scifaro.com/en/abs/topological-dynamics-of-2d-cellular-automata-0709.4565</loc><lastmod>2009-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-dynamics-of-2d-cellular-automata-0709.4565"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/topological-dynamics-of-2d-cellular-automata-0709.4565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-dynamics-of-2d-cellular-automata-0709.4565"/></url>
<url><loc>https://scifaro.com/zh/abs/topological-dynamics-of-2d-cellular-automata-0709.4565</loc><lastmod>2009-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-dynamics-of-2d-cellular-automata-0709.4565"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/topological-dynamics-of-2d-cellular-automata-0709.4565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-dynamics-of-2d-cellular-automata-0709.4565"/></url>
<url><loc>https://scifaro.com/en/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531"/></url>
<url><loc>https://scifaro.com/zh/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-problem-of-localization-in-networks-of-randomly-deployed-nodes-asymptotic-and-finite-analysis-and-thresholds-0710.0531"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-heuristic-algorithm-based-on-verification-and-elimination-methods-for-maximum-clique-problem-0710.0748</loc><lastmod>2007-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-heuristic-algorithm-based-on-verification-and-elimination-methods-for-maximum-clique-problem-0710.0748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-heuristic-algorithm-based-on-verification-and-elimination-methods-for-maximum-clique-problem-0710.0748"/></url>
<url><loc>https://scifaro.com/en/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007</loc><lastmod>2007-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007"/></url>
<url><loc>https://scifaro.com/zh/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007</loc><lastmod>2007-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-representation-theorems-of-three-valued-structures-by-means-of-binary-relations-0710.1007"/></url>
<url><loc>https://scifaro.com/en/abs/an-explicit-universal-cycle-for-the-n-1-permutations-of-an-n-set-0710.1842</loc><lastmod>2007-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-explicit-universal-cycle-for-the-n-1-permutations-of-an-n-set-0710.1842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-explicit-universal-cycle-for-the-n-1-permutations-of-an-n-set-0710.1842"/></url>
<url><loc>https://scifaro.com/en/abs/solving-infinite-kolam-in-knot-theory-0710.1976</loc><lastmod>2012-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-infinite-kolam-in-knot-theory-0710.1976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-infinite-kolam-in-knot-theory-0710.1976"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603</loc><lastmod>2014-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603"/></url>
<url><loc>https://scifaro.com/zh/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603</loc><lastmod>2014-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-clique-based-integer-programming-formulation-of-vertex-colouring-with-applications-in-course-timetabling-0710.3603"/></url>
<url><loc>https://scifaro.com/en/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901</loc><lastmod>2024-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901"/></url>
<url><loc>https://scifaro.com/zh/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901</loc><lastmod>2024-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recursive-linear-time-modular-decomposition-algorithm-via-lexbfs-0710.3901"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-random-popular-matchings-0710.5338</loc><lastmod>2011-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-random-popular-matchings-0710.5338"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/weighted-random-popular-matchings-0710.5338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-random-popular-matchings-0710.5338"/></url>
<url><loc>https://scifaro.com/zh/abs/weighted-random-popular-matchings-0710.5338</loc><lastmod>2011-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-random-popular-matchings-0710.5338"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/weighted-random-popular-matchings-0710.5338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-random-popular-matchings-0710.5338"/></url>
<url><loc>https://scifaro.com/en/abs/convex-and-linear-models-of-np-problems-0711.0086</loc><lastmod>2007-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-and-linear-models-of-np-problems-0711.0086"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/convex-and-linear-models-of-np-problems-0711.0086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-and-linear-models-of-np-problems-0711.0086"/></url>
<url><loc>https://scifaro.com/zh/abs/convex-and-linear-models-of-np-problems-0711.0086</loc><lastmod>2007-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-and-linear-models-of-np-problems-0711.0086"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/convex-and-linear-models-of-np-problems-0711.0086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-and-linear-models-of-np-problems-0711.0086"/></url>
<url><loc>https://scifaro.com/en/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311</loc><lastmod>2008-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311"/></url>
<url><loc>https://scifaro.com/zh/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311</loc><lastmod>2008-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-the-lp-bound-of-a-milp-by-branching-concurrently-0711.0311"/></url>
<url><loc>https://scifaro.com/en/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993</loc><lastmod>2007-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993"/></url>
<url><loc>https://scifaro.com/zh/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993</loc><lastmod>2007-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entropy-of-capacities-on-lattices-and-set-systems-0711.1993"/></url>
<url><loc>https://scifaro.com/en/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112</loc><lastmod>2007-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112"/></url>
<url><loc>https://scifaro.com/zh/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112</loc><lastmod>2007-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bi-capacities-part-ii-the-choquet-integral-0711.2112"/></url>
<url><loc>https://scifaro.com/en/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114</loc><lastmod>2007-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114"/></url>
<url><loc>https://scifaro.com/zh/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114</loc><lastmod>2007-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bi-capacities-part-i-definition-m-obius-transform-and-interaction-0711.2114"/></url>
<url><loc>https://scifaro.com/en/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115</loc><lastmod>2007-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115"/></url>
<url><loc>https://scifaro.com/zh/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115</loc><lastmod>2007-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derivative-of-functions-over-lattices-as-a-basis-for-the-notion-of-interaction-between-attributes-0711.2115"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatic-structure-of-k-additive-capacities-0711.2489</loc><lastmod>2007-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatic-structure-of-k-additive-capacities-0711.2489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatic-structure-of-k-additive-capacities-0711.2489"/></url>
<url><loc>https://scifaro.com/en/abs/the-m-obius-transform-on-symmetric-ordered-structures-and-its-application-to-capacities-on-finite-sets-0711.2490</loc><lastmod>2007-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-m-obius-transform-on-symmetric-ordered-structures-and-its-application-to-capacities-on-finite-sets-0711.2490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-m-obius-transform-on-symmetric-ordered-structures-and-its-application-to-capacities-on-finite-sets-0711.2490"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-conditional-colorability-of-graphs-0711.2843</loc><lastmod>2007-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-conditional-colorability-of-graphs-0711.2843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-conditional-colorability-of-graphs-0711.2843"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-3-coloring-of-claw-free-graphs-0711.2844</loc><lastmod>2007-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-3-coloring-of-claw-free-graphs-0711.2844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-3-coloring-of-claw-free-graphs-0711.2844"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-diversity-0711.2998</loc><lastmod>2007-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-diversity-0711.2998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-diversity-0711.2998"/></url>
<url><loc>https://scifaro.com/en/abs/approche-polyedrale-pour-le-probleme-du-separateur-vsp-0711.3149</loc><lastmod>2007-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approche-polyedrale-pour-le-probleme-du-separateur-vsp-0711.3149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approche-polyedrale-pour-le-probleme-du-separateur-vsp-0711.3149"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-directed-cuts-in-digraphs-with-degree-restriction-0711.3958</loc><lastmod>2007-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-directed-cuts-in-digraphs-with-degree-restriction-0711.3958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-directed-cuts-in-digraphs-with-degree-restriction-0711.3958"/></url>
<url><loc>https://scifaro.com/en/abs/on-b-perfect-chordal-graphs-0711.3959</loc><lastmod>2007-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-b-perfect-chordal-graphs-0711.3959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-b-perfect-chordal-graphs-0711.3959"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-growth-rate-of-a-regular-language-in-polynomial-time-0711.4990</loc><lastmod>2007-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-growth-rate-of-a-regular-language-in-polynomial-time-0711.4990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-growth-rate-of-a-regular-language-in-polynomial-time-0711.4990"/></url>
<url><loc>https://scifaro.com/en/abs/direct-definition-of-a-ternary-infinite-square-free-sequence-0712.0139</loc><lastmod>2007-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/direct-definition-of-a-ternary-infinite-square-free-sequence-0712.0139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/direct-definition-of-a-ternary-infinite-square-free-sequence-0712.0139"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-for-the-number-of-hamiltonian-cycles-0712.0616</loc><lastmod>2008-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-for-the-number-of-hamiltonian-cycles-0712.0616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-for-the-number-of-hamiltonian-cycles-0712.0616"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-locally-semicomplete-and-quasi-transitive-digraphs-0712.0804</loc><lastmod>2007-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-locally-semicomplete-and-quasi-transitive-digraphs-0712.0804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-cost-homomorphisms-to-locally-semicomplete-and-quasi-transitive-digraphs-0712.0804"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-a-class-of-graphs-related-to-pairs-of-disjoint-matchings-0712.1014</loc><lastmod>2009-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-a-class-of-graphs-related-to-pairs-of-disjoint-matchings-0712.1014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-a-class-of-graphs-related-to-pairs-of-disjoint-matchings-0712.1014"/></url>
<url><loc>https://scifaro.com/en/abs/on-lower-bound-for-w-k-2n-0712.2567</loc><lastmod>2007-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lower-bound-for-w-k-2n-0712.2567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lower-bound-for-w-k-2n-0712.2567"/></url>
<url><loc>https://scifaro.com/en/abs/is-the-injectivity-of-the-global-function-of-a-cellular-automaton-in-the-hyperbolic-plane-undecidable-0712.2577</loc><lastmod>2007-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-the-injectivity-of-the-global-function-of-a-cellular-automaton-in-the-hyperbolic-plane-undecidable-0712.2577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-the-injectivity-of-the-global-function-of-a-cellular-automaton-in-the-hyperbolic-plane-undecidable-0712.2577"/></url>
<url><loc>https://scifaro.com/en/abs/interval-edge-colourings-of-complete-graphs-and-n-cubes-0712.2585</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-edge-colourings-of-complete-graphs-and-n-cubes-0712.2585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-edge-colourings-of-complete-graphs-and-n-cubes-0712.2585"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-generating-convex-sets-in-acyclic-digraphs-0712.2661</loc><lastmod>2007-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-generating-convex-sets-in-acyclic-digraphs-0712.2661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-generating-convex-sets-in-acyclic-digraphs-0712.2661"/></url>
<url><loc>https://scifaro.com/en/abs/convex-sets-in-acyclic-digraphs-0712.2678</loc><lastmod>2007-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-sets-in-acyclic-digraphs-0712.2678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-sets-in-acyclic-digraphs-0712.2678"/></url>
<url><loc>https://scifaro.com/en/abs/partial-conway-and-iteration-semirings-0712.2952</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-conway-and-iteration-semirings-0712.2952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-conway-and-iteration-semirings-0712.2952"/></url>
<url><loc>https://scifaro.com/en/abs/interval-colourings-of-some-regular-graphs-0712.3150</loc><lastmod>2007-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-colourings-of-some-regular-graphs-0712.3150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-colourings-of-some-regular-graphs-0712.3150"/></url>
<url><loc>https://scifaro.com/en/abs/on-interval-colorings-of-complete-k-partite-graphs-k-n-k-0712.3155</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-interval-colorings-of-complete-k-partite-graphs-k-n-k-0712.3155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-interval-colorings-of-complete-k-partite-graphs-k-n-k-0712.3155"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-complete-a-doubling-metric-0712.3331</loc><lastmod>2007-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-complete-a-doubling-metric-0712.3331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-complete-a-doubling-metric-0712.3331"/></url>
<url><loc>https://scifaro.com/en/abs/m-sequences-of-different-lengths-with-four-valued-cross-correlation-0712.3757</loc><lastmod>2007-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/m-sequences-of-different-lengths-with-four-valued-cross-correlation-0712.3757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/m-sequences-of-different-lengths-with-four-valued-cross-correlation-0712.3757"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-the-greatest-possible-number-of-colors-in-interval-edge-colorings-of-bipartite-cylinders-and-bipartite-tori-0712.4148</loc><lastmod>2007-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-the-greatest-possible-number-of-colors-in-interval-edge-colorings-of-bipartite-cylinders-and-bipartite-tori-0712.4148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-the-greatest-possible-number-of-colors-in-interval-edge-colorings-of-bipartite-cylinders-and-bipartite-tori-0712.4148"/></url>
<url><loc>https://scifaro.com/en/abs/interval-edge-colorings-of-mobius-ladders-0801.0159</loc><lastmod>2008-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-edge-colorings-of-mobius-ladders-0801.0159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-edge-colorings-of-mobius-ladders-0801.0159"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-finding-the-independence-number-of-a-graph-0801.0590</loc><lastmod>2008-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-finding-the-independence-number-of-a-graph-0801.0590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-finding-the-independence-number-of-a-graph-0801.0590"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-graph-grammars-0801.1245</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-graph-grammars-0801.1245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-graph-grammars-0801.1245"/></url>
<url><loc>https://scifaro.com/en/abs/extensions-to-network-flow-interdiction-on-planar-graphs-0801.1737</loc><lastmod>2008-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensions-to-network-flow-interdiction-on-planar-graphs-0801.1737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensions-to-network-flow-interdiction-on-planar-graphs-0801.1737"/></url>
<url><loc>https://scifaro.com/en/abs/ideal-synchronizer-for-marked-pairs-in-fork-join-network-0801.1784</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ideal-synchronizer-for-marked-pairs-in-fork-join-network-0801.1784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ideal-synchronizer-for-marked-pairs-in-fork-join-network-0801.1784"/></url>
<url><loc>https://scifaro.com/en/abs/model-for-synchronizer-of-marked-pairs-in-fork-join-network-0801.2092</loc><lastmod>2008-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-for-synchronizer-of-marked-pairs-in-fork-join-network-0801.2092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-for-synchronizer-of-marked-pairs-in-fork-join-network-0801.2092"/></url>
<url><loc>https://scifaro.com/en/abs/le-probleme-de-l-isomorphisme-de-graphes-est-dans-p-0801.2284</loc><lastmod>2008-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/le-probleme-de-l-isomorphisme-de-graphes-est-dans-p-0801.2284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/le-probleme-de-l-isomorphisme-de-graphes-est-dans-p-0801.2284"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-minimum-spanning-tree-for-directed-graphs-with-potential-weights-0801.2347</loc><lastmod>2008-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-minimum-spanning-tree-for-directed-graphs-with-potential-weights-0801.2347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-minimum-spanning-tree-for-directed-graphs-with-potential-weights-0801.2347"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-road-coloring-0801.2838</loc><lastmod>2010-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-road-coloring-0801.2838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-road-coloring-0801.2838"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-permanents-and-perfect-matchings-of-matrices-of-bounded-pathwidth-cliquewidth-0801.3408</loc><lastmod>2008-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-permanents-and-perfect-matchings-of-matrices-of-bounded-pathwidth-cliquewidth-0801.3408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-permanents-and-perfect-matchings-of-matrices-of-bounded-pathwidth-cliquewidth-0801.3408"/></url>
<url><loc>https://scifaro.com/en/abs/5-cycles-and-the-petersen-graph-0801.3714</loc><lastmod>2008-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/5-cycles-and-the-petersen-graph-0801.3714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/5-cycles-and-the-petersen-graph-0801.3714"/></url>
<url><loc>https://scifaro.com/en/abs/information-width-0801.4790</loc><lastmod>2008-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-width-0801.4790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-width-0801.4790"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-binary-samples-0801.4794</loc><lastmod>2008-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-binary-samples-0801.4794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-binary-samples-0801.4794"/></url>
<url><loc>https://scifaro.com/en/abs/improved-lower-bound-for-deterministic-broadcasting-in-radio-networks-0801.4845</loc><lastmod>2008-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-lower-bound-for-deterministic-broadcasting-in-radio-networks-0801.4845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-lower-bound-for-deterministic-broadcasting-in-radio-networks-0801.4845"/></url>
<url><loc>https://scifaro.com/en/abs/a-proposal-to-a-generalised-splicing-with-a-self-assembly-approach-0802.0260</loc><lastmod>2008-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proposal-to-a-generalised-splicing-with-a-self-assembly-approach-0802.0260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proposal-to-a-generalised-splicing-with-a-self-assembly-approach-0802.0260"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-post-correspondence-problem-and-semi-thue-systems-0802.0726</loc><lastmod>2008-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-post-correspondence-problem-and-semi-thue-systems-0802.0726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-post-correspondence-problem-and-semi-thue-systems-0802.0726"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-on-a-b-choosability-0802.1338</loc><lastmod>2008-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-on-a-b-choosability-0802.1338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-on-a-b-choosability-0802.1338"/></url>
<url><loc>https://scifaro.com/en/abs/ascending-runs-in-dependent-uniformly-distributed-random-variables-application-to-wireless-networks-0802.1387</loc><lastmod>2008-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ascending-runs-in-dependent-uniformly-distributed-random-variables-application-to-wireless-networks-0802.1387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ascending-runs-in-dependent-uniformly-distributed-random-variables-application-to-wireless-networks-0802.1387"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-committee-problem-for-inconsistent-systems-of-linear-inequalities-on-the-plane-0802.1514</loc><lastmod>2008-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-committee-problem-for-inconsistent-systems-of-linear-inequalities-on-the-plane-0802.1514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-committee-problem-for-inconsistent-systems-of-linear-inequalities-on-the-plane-0802.1514"/></url>
<url><loc>https://scifaro.com/en/abs/choice-numbers-of-graphs-0802.2157</loc><lastmod>2008-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choice-numbers-of-graphs-0802.2157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choice-numbers-of-graphs-0802.2157"/></url>
<url><loc>https://scifaro.com/en/abs/digraph-decompositions-and-monotonicity-in-digraph-searching-0802.2228</loc><lastmod>2008-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digraph-decompositions-and-monotonicity-in-digraph-searching-0802.2228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digraph-decompositions-and-monotonicity-in-digraph-searching-0802.2228"/></url>
<url><loc>https://scifaro.com/en/abs/on-subgraph-isomorphism-0802.2612</loc><lastmod>2008-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-subgraph-isomorphism-0802.2612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-subgraph-isomorphism-0802.2612"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-planar-graph-choosability-0802.2668</loc><lastmod>2008-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-planar-graph-choosability-0802.2668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-planar-graph-choosability-0802.2668"/></url>
<url><loc>https://scifaro.com/en/abs/covering-directed-graphs-by-in-trees-0802.2755</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-directed-graphs-by-in-trees-0802.2755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-directed-graphs-by-in-trees-0802.2755"/></url>
<url><loc>https://scifaro.com/en/abs/trimming-of-graphs-with-application-to-point-labeling-0802.2854</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trimming-of-graphs-with-application-to-point-labeling-0802.2854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trimming-of-graphs-with-application-to-point-labeling-0802.2854"/></url>
<url><loc>https://scifaro.com/en/abs/tur-an-graphs-stability-number-and-fibonacci-index-0802.3284</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tur-an-graphs-stability-number-and-fibonacci-index-0802.3284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tur-an-graphs-stability-number-and-fibonacci-index-0802.3284"/></url>
<url><loc>https://scifaro.com/en/abs/directive-words-of-episturmian-words-equivalences-and-normalization-0802.3888</loc><lastmod>2010-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directive-words-of-episturmian-words-equivalences-and-normalization-0802.3888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directive-words-of-episturmian-words-equivalences-and-normalization-0802.3888"/></url>
<url><loc>https://scifaro.com/en/abs/a-o-n-8-x-o-n-7-linear-programming-model-of-the-quadratic-assignment-problem-0802.4307</loc><lastmod>2014-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-o-n-8-x-o-n-7-linear-programming-model-of-the-quadratic-assignment-problem-0802.4307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-o-n-8-x-o-n-7-linear-programming-model-of-the-quadratic-assignment-problem-0802.4307"/></url>
<url><loc>https://scifaro.com/en/abs/on-disjoint-matchings-in-cubic-graphs-0803.0134</loc><lastmod>2010-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-disjoint-matchings-in-cubic-graphs-0803.0134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-disjoint-matchings-in-cubic-graphs-0803.0134"/></url>
<url><loc>https://scifaro.com/en/abs/random-hypergraphs-and-algorithmics-0803.0225</loc><lastmod>2008-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-hypergraphs-and-algorithmics-0803.0225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-hypergraphs-and-algorithmics-0803.0225"/></url>
<url><loc>https://scifaro.com/en/abs/untangling-planar-graphs-from-a-specified-vertex-position-hard-cases-0803.0858</loc><lastmod>2011-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-planar-graphs-from-a-specified-vertex-position-hard-cases-0803.0858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-planar-graphs-from-a-specified-vertex-position-hard-cases-0803.0858"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-path-graphs-by-forbidden-induced-subgraphs-0803.0956</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-path-graphs-by-forbidden-induced-subgraphs-0803.0956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-path-graphs-by-forbidden-induced-subgraphs-0803.0956"/></url>
<url><loc>https://scifaro.com/en/abs/hsiao-code-check-matrices-and-recursively-balanced-matrices-0803.1217</loc><lastmod>2008-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hsiao-code-check-matrices-and-recursively-balanced-matrices-0803.1217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hsiao-code-check-matrices-and-recursively-balanced-matrices-0803.1217"/></url>
<url><loc>https://scifaro.com/en/abs/on-p-5-bar-p-5-sparse-graphs-and-other-families-0803.2135</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-p-5-bar-p-5-sparse-graphs-and-other-families-0803.2135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-p-5-bar-p-5-sparse-graphs-and-other-families-0803.2135"/></url>
<url><loc>https://scifaro.com/en/abs/trajectory-networks-and-their-topological-changes-induced-by-geographical-infiltration-0803.2447</loc><lastmod>2008-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trajectory-networks-and-their-topological-changes-induced-by-geographical-infiltration-0803.2447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trajectory-networks-and-their-topological-changes-induced-by-geographical-infiltration-0803.2447"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-weight-expansions-in-pisot-bases-0803.2874</loc><lastmod>2009-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-weight-expansions-in-pisot-bases-0803.2874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-weight-expansions-in-pisot-bases-0803.2874"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-cubicity-of-at-free-graphs-and-circular-arc-graphs-0803.3670</loc><lastmod>2008-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-cubicity-of-at-free-graphs-and-circular-arc-graphs-0803.3670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-cubicity-of-at-free-graphs-and-circular-arc-graphs-0803.3670"/></url>
<url><loc>https://scifaro.com/en/abs/fourier-spectra-of-binomial-apn-functions-0803.3781</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fourier-spectra-of-binomial-apn-functions-0803.3781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fourier-spectra-of-binomial-apn-functions-0803.3781"/></url>
<url><loc>https://scifaro.com/en/abs/learning-sequences-0803.4030</loc><lastmod>2008-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-sequences-0803.4030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-sequences-0803.4030"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-k-cycles-in-the-assignment-problem-for-random-matrices-0803.4096</loc><lastmod>2009-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-k-cycles-in-the-assignment-problem-for-random-matrices-0803.4096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-k-cycles-in-the-assignment-problem-for-random-matrices-0803.4096"/></url>
<url><loc>https://scifaro.com/en/abs/how-good-is-the-warnsdorff-s-knight-s-tour-heuristic-0803.4321</loc><lastmod>2008-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-good-is-the-warnsdorff-s-knight-s-tour-heuristic-0803.4321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-good-is-the-warnsdorff-s-knight-s-tour-heuristic-0803.4321"/></url>
<url><loc>https://scifaro.com/en/abs/a-o-n-8-x-o-n-7-linear-programming-model-of-the-traveling-salesman-problem-0803.4354</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-o-n-8-x-o-n-7-linear-programming-model-of-the-traveling-salesman-problem-0803.4354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-o-n-8-x-o-n-7-linear-programming-model-of-the-traveling-salesman-problem-0803.4354"/></url>
<url><loc>https://scifaro.com/en/abs/a-dynamical-boolean-network-0804.1179</loc><lastmod>2008-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dynamical-boolean-network-0804.1179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dynamical-boolean-network-0804.1179"/></url>
<url><loc>https://scifaro.com/en/abs/new-lower-bounds-for-the-maximum-number-of-runs-in-a-string-0804.1214</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-lower-bounds-for-the-maximum-number-of-runs-in-a-string-0804.1214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-lower-bounds-for-the-maximum-number-of-runs-in-a-string-0804.1214"/></url>
<url><loc>https://scifaro.com/en/abs/the-quest-for-rings-on-bipolar-scales-0804.1270</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-quest-for-rings-on-bipolar-scales-0804.1270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-quest-for-rings-on-bipolar-scales-0804.1270"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-behavior-of-growth-functions-of-d0l-systems-0804.1327</loc><lastmod>2009-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-behavior-of-growth-functions-of-d0l-systems-0804.1327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-behavior-of-growth-functions-of-d0l-systems-0804.1327"/></url>
<url><loc>https://scifaro.com/en/abs/measure-and-integral-with-purely-ordinal-scales-0804.1758</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measure-and-integral-with-purely-ordinal-scales-0804.1758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measure-and-integral-with-purely-ordinal-scales-0804.1758"/></url>
<url><loc>https://scifaro.com/en/abs/the-symmetric-sugeno-integral-0804.1760</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-symmetric-sugeno-integral-0804.1760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-symmetric-sugeno-integral-0804.1760"/></url>
<url><loc>https://scifaro.com/en/abs/the-choquet-integral-for-the-aggregation-of-interval-scales-in-multicriteria-decision-making-0804.1762</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-choquet-integral-for-the-aggregation-of-interval-scales-in-multicriteria-decision-making-0804.1762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-choquet-integral-for-the-aggregation-of-interval-scales-in-multicriteria-decision-making-0804.1762"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-extension-of-pseudo-boolean-functions-for-the-aggregation-of-interacting-criteria-0804.1921</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-extension-of-pseudo-boolean-functions-for-the-aggregation-of-interacting-criteria-0804.1921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-extension-of-pseudo-boolean-functions-for-the-aggregation-of-interacting-criteria-0804.1921"/></url>
<url><loc>https://scifaro.com/en/abs/random-sampling-of-colourings-of-sparse-random-graphs-with-a-constant-number-of-colours-0804.2343</loc><lastmod>2008-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-sampling-of-colourings-of-sparse-random-graphs-with-a-constant-number-of-colours-0804.2343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-sampling-of-colourings-of-sparse-random-graphs-with-a-constant-number-of-colours-0804.2343"/></url>
<url><loc>https://scifaro.com/en/abs/theory-and-applications-of-two-dimensional-null-boundary-nine-neighborhood-cellular-automata-linear-rules-0804.2346</loc><lastmod>2008-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-and-applications-of-two-dimensional-null-boundary-nine-neighborhood-cellular-automata-linear-rules-0804.2346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-and-applications-of-two-dimensional-null-boundary-nine-neighborhood-cellular-automata-linear-rules-0804.2346"/></url>
<url><loc>https://scifaro.com/en/abs/p-symmetric-fuzzy-measures-0804.2642</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/p-symmetric-fuzzy-measures-0804.2642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/p-symmetric-fuzzy-measures-0804.2642"/></url>
<url><loc>https://scifaro.com/en/abs/bipolarization-of-posets-and-natural-interpolation-0804.2819</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bipolarization-of-posets-and-natural-interpolation-0804.2819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bipolarization-of-posets-and-natural-interpolation-0804.2819"/></url>
<url><loc>https://scifaro.com/en/abs/matching-interdiction-0804.3583</loc><lastmod>2008-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-interdiction-0804.3583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-interdiction-0804.3583"/></url>
<url><loc>https://scifaro.com/en/abs/constructions-for-clumps-statistics-0804.3671</loc><lastmod>2008-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructions-for-clumps-statistics-0804.3671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructions-for-clumps-statistics-0804.3671"/></url>
<url><loc>https://scifaro.com/en/abs/combining-geometry-and-combinatorics-a-unified-approach-to-sparse-signal-recovery-0804.4666</loc><lastmod>2008-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-geometry-and-combinatorics-a-unified-approach-to-sparse-signal-recovery-0804.4666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-geometry-and-combinatorics-a-unified-approach-to-sparse-signal-recovery-0804.4666"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-mathematics-for-computer-science-some-notes-0805.0585</loc><lastmod>2008-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-mathematics-for-computer-science-some-notes-0805.0585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-mathematics-for-computer-science-some-notes-0805.0585"/></url>
<url><loc>https://scifaro.com/en/abs/binary-morphisms-to-ultimately-periodic-words-0805.1373</loc><lastmod>2008-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-morphisms-to-ultimately-periodic-words-0805.1373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-morphisms-to-ultimately-periodic-words-0805.1373"/></url>
<url><loc>https://scifaro.com/en/abs/transport-in-networks-with-multiple-sources-and-sinks-0805.1567</loc><lastmod>2008-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transport-in-networks-with-multiple-sources-and-sinks-0805.1567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transport-in-networks-with-multiple-sources-and-sinks-0805.1567"/></url>
<url><loc>https://scifaro.com/en/abs/least-change-in-the-determinant-or-permanent-of-a-matrix-under-perturbation-of-a-single-element-continuous-and-discrete-cases-0805.2081</loc><lastmod>2008-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/least-change-in-the-determinant-or-permanent-of-a-matrix-under-perturbation-of-a-single-element-continuous-and-discrete-cases-0805.2081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/least-change-in-the-determinant-or-permanent-of-a-matrix-under-perturbation-of-a-single-element-continuous-and-discrete-cases-0805.2081"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-formulation-of-the-probability-that-the-determinant-or-permanent-of-a-matrix-undergoes-the-least-change-under-perturbation-of-a-single-element-0805.2083</loc><lastmod>2008-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-formulation-of-the-probability-that-the-determinant-or-permanent-of-a-matrix-undergoes-the-least-change-under-perturbation-of-a-single-element-0805.2083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-formulation-of-the-probability-that-the-determinant-or-permanent-of-a-matrix-undergoes-the-least-change-under-perturbation-of-a-single-element-0805.2083"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-complexity-of-realizations-of-linear-codes-on-arbitrary-graphs-0805.2199</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-complexity-of-realizations-of-linear-codes-on-arbitrary-graphs-0805.2199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-complexity-of-realizations-of-linear-codes-on-arbitrary-graphs-0805.2199"/></url>
<url><loc>https://scifaro.com/en/abs/properly-coloured-cycles-and-paths-results-and-open-problems-0805.3901</loc><lastmod>2008-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properly-coloured-cycles-and-paths-results-and-open-problems-0805.3901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properly-coloured-cycles-and-paths-results-and-open-problems-0805.3901"/></url>
<url><loc>https://scifaro.com/en/abs/an-np-hardness-result-on-the-monoid-frobenius-problem-0805.4049</loc><lastmod>2008-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-np-hardness-result-on-the-monoid-frobenius-problem-0805.4049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-np-hardness-result-on-the-monoid-frobenius-problem-0805.4049"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-probability-of-the-existence-of-fixed-size-components-in-random-geometric-graphs-0806.0311</loc><lastmod>2008-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-probability-of-the-existence-of-fixed-size-components-in-random-geometric-graphs-0806.0311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-probability-of-the-existence-of-fixed-size-components-in-random-geometric-graphs-0806.0311"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiable-cnf-formulas-need-many-conflicts-0806.1148</loc><lastmod>2010-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-cnf-formulas-need-many-conflicts-0806.1148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-cnf-formulas-need-many-conflicts-0806.1148"/></url>
<url><loc>https://scifaro.com/en/abs/on-mean-distance-and-girth-0806.1438</loc><lastmod>2013-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-mean-distance-and-girth-0806.1438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-mean-distance-and-girth-0806.1438"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-polynomial-time-algorithm-for-the-matrix-torsion-problem-0806.2068</loc><lastmod>2009-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-polynomial-time-algorithm-for-the-matrix-torsion-problem-0806.2068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-polynomial-time-algorithm-for-the-matrix-torsion-problem-0806.2068"/></url>
<url><loc>https://scifaro.com/en/abs/exposing-multi-relational-networks-to-single-relational-network-analysis-algorithms-0806.2274</loc><lastmod>2009-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exposing-multi-relational-networks-to-single-relational-network-analysis-algorithms-0806.2274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exposing-multi-relational-networks-to-single-relational-network-analysis-algorithms-0806.2274"/></url>
<url><loc>https://scifaro.com/en/abs/a-distributed-algorithm-for-computing-and-updating-the-process-number-of-a-forest-0806.2710</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-distributed-algorithm-for-computing-and-updating-the-process-number-of-a-forest-0806.2710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-distributed-algorithm-for-computing-and-updating-the-process-number-of-a-forest-0806.2710"/></url>
<url><loc>https://scifaro.com/en/abs/compound-node-kayles-on-paths-0806.3033</loc><lastmod>2009-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compound-node-kayles-on-paths-0806.3033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compound-node-kayles-on-paths-0806.3033"/></url>
<url><loc>https://scifaro.com/en/abs/minesweeper-and-spectrum-of-discrete-laplacians-0806.3480</loc><lastmod>2010-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minesweeper-and-spectrum-of-discrete-laplacians-0806.3480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minesweeper-and-spectrum-of-discrete-laplacians-0806.3480"/></url>
<url><loc>https://scifaro.com/en/abs/finding-large-clique-minors-is-hard-0807.0007</loc><lastmod>2009-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-large-clique-minors-is-hard-0807.0007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-large-clique-minors-is-hard-0807.0007"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-finding-a-sun-in-a-graph-0807.0462</loc><lastmod>2008-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-a-sun-in-a-graph-0807.0462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-a-sun-in-a-graph-0807.0462"/></url>
<url><loc>https://scifaro.com/en/abs/research-report-state-complexity-of-operations-on-two-way-quantum-finite-automata-0807.0476</loc><lastmod>2008-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/research-report-state-complexity-of-operations-on-two-way-quantum-finite-automata-0807.0476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/research-report-state-complexity-of-operations-on-two-way-quantum-finite-automata-0807.0476"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-and-new-techniques-for-davenport-schinzel-sequences-and-their-generalizations-0807.0484</loc><lastmod>2013-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-and-new-techniques-for-davenport-schinzel-sequences-and-their-generalizations-0807.0484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-and-new-techniques-for-davenport-schinzel-sequences-and-their-generalizations-0807.0484"/></url>
<url><loc>https://scifaro.com/en/abs/the-parikh-functions-of-sparse-context-free-languages-are-quasi-polynomials-0807.0718</loc><lastmod>2008-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parikh-functions-of-sparse-context-free-languages-are-quasi-polynomials-0807.0718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parikh-functions-of-sparse-context-free-languages-are-quasi-polynomials-0807.0718"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-avoiding-forbidden-subpaths-0807.0807</loc><lastmod>2009-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-avoiding-forbidden-subpaths-0807.0807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-avoiding-forbidden-subpaths-0807.0807"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-greedy-algorithms-for-independent-sets-and-matchings-in-regular-graphs-exact-results-and-finite-girth-corrections-0807.1277</loc><lastmod>2008-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-greedy-algorithms-for-independent-sets-and-matchings-in-regular-graphs-exact-results-and-finite-girth-corrections-0807.1277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-greedy-algorithms-for-independent-sets-and-matchings-in-regular-graphs-exact-results-and-finite-girth-corrections-0807.1277"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-almost-disjoint-cnf-formulas-0807.1282</loc><lastmod>2008-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-almost-disjoint-cnf-formulas-0807.1282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-almost-disjoint-cnf-formulas-0807.1282"/></url>
<url><loc>https://scifaro.com/en/abs/expanders-via-random-spanning-trees-0807.1496</loc><lastmod>2008-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expanders-via-random-spanning-trees-0807.1496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expanders-via-random-spanning-trees-0807.1496"/></url>
<url><loc>https://scifaro.com/en/abs/mean-asymptotic-behaviour-of-radix-rational-sequences-and-dilation-equations-extended-version-0807.1523</loc><lastmod>2008-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mean-asymptotic-behaviour-of-radix-rational-sequences-and-dilation-equations-extended-version-0807.1523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mean-asymptotic-behaviour-of-radix-rational-sequences-and-dilation-equations-extended-version-0807.1523"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-upper-bound-for-3-sat-0807.3600</loc><lastmod>2008-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-upper-bound-for-3-sat-0807.3600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-upper-bound-for-3-sat-0807.3600"/></url>
<url><loc>https://scifaro.com/en/abs/multiplication-in-cyclotomic-rings-and-its-application-to-finite-fields-0807.3699</loc><lastmod>2008-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiplication-in-cyclotomic-rings-and-its-application-to-finite-fields-0807.3699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiplication-in-cyclotomic-rings-and-its-application-to-finite-fields-0807.3699"/></url>
<url><loc>https://scifaro.com/en/abs/pseudo-random-sequences-generated-by-cellular-automata-0807.3865</loc><lastmod>2008-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pseudo-random-sequences-generated-by-cellular-automata-0807.3865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pseudo-random-sequences-generated-by-cellular-automata-0807.3865"/></url>
<url><loc>https://scifaro.com/en/abs/modularity-clustering-is-force-directed-layout-0807.4052</loc><lastmod>2009-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modularity-clustering-is-force-directed-layout-0807.4052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modularity-clustering-is-force-directed-layout-0807.4052"/></url>
<url><loc>https://scifaro.com/en/abs/positive-circuits-and-maximal-number-of-fixed-points-in-discrete-dynamical-systems-0807.4229</loc><lastmod>2008-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-circuits-and-maximal-number-of-fixed-points-in-discrete-dynamical-systems-0807.4229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-circuits-and-maximal-number-of-fixed-points-in-discrete-dynamical-systems-0807.4229"/></url>
<url><loc>https://scifaro.com/en/abs/linear-coloring-and-linear-graphs-0807.4234</loc><lastmod>2008-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-coloring-and-linear-graphs-0807.4234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-coloring-and-linear-graphs-0807.4234"/></url>
<url><loc>https://scifaro.com/en/abs/the-degree-distribution-of-random-k-trees-0808.0202</loc><lastmod>2008-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-degree-distribution-of-random-k-trees-0808.0202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-degree-distribution-of-random-k-trees-0808.0202"/></url>
<url><loc>https://scifaro.com/en/abs/evolving-clustered-random-networks-0808.0509</loc><lastmod>2010-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evolving-clustered-random-networks-0808.0509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evolving-clustered-random-networks-0808.0509"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-distance-transforms-generalized-to-modules-and-their-computation-on-point-lattices-0808.0665</loc><lastmod>2008-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-distance-transforms-generalized-to-modules-and-their-computation-on-point-lattices-0808.0665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-distance-transforms-generalized-to-modules-and-their-computation-on-point-lattices-0808.0665"/></url>
<url><loc>https://scifaro.com/en/abs/encompression-using-two-dimensional-cellular-automata-rules-0808.1470</loc><lastmod>2008-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encompression-using-two-dimensional-cellular-automata-rules-0808.1470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encompression-using-two-dimensional-cellular-automata-rules-0808.1470"/></url>
<url><loc>https://scifaro.com/en/abs/periodicity-repetitions-and-orbits-of-an-automatic-sequence-0808.1657</loc><lastmod>2009-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/periodicity-repetitions-and-orbits-of-an-automatic-sequence-0808.1657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/periodicity-repetitions-and-orbits-of-an-automatic-sequence-0808.1657"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decidability-of-semigroup-freeness-0808.3112</loc><lastmod>2012-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decidability-of-semigroup-freeness-0808.3112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decidability-of-semigroup-freeness-0808.3112"/></url>
<url><loc>https://scifaro.com/en/abs/linear-programming-formulation-of-the-boolean-satisfiability-problem-0808.3386</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-programming-formulation-of-the-boolean-satisfiability-problem-0808.3386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-programming-formulation-of-the-boolean-satisfiability-problem-0808.3386"/></url>
<url><loc>https://scifaro.com/en/abs/counting-hexagonal-patches-and-independent-sets-in-circle-graphs-0808.3881</loc><lastmod>2009-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-hexagonal-patches-and-independent-sets-in-circle-graphs-0808.3881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-hexagonal-patches-and-independent-sets-in-circle-graphs-0808.3881"/></url>
<url><loc>https://scifaro.com/en/abs/essential-arity-gap-of-boolean-functions-0808.3892</loc><lastmod>2008-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/essential-arity-gap-of-boolean-functions-0808.3892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/essential-arity-gap-of-boolean-functions-0808.3892"/></url>
<url><loc>https://scifaro.com/en/abs/simulations-between-triangular-and-hexagonal-number-conserving-cellular-automata-0809.0355</loc><lastmod>2008-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulations-between-triangular-and-hexagonal-number-conserving-cellular-automata-0809.0355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulations-between-triangular-and-hexagonal-number-conserving-cellular-automata-0809.0355"/></url>
<url><loc>https://scifaro.com/en/abs/mumford-dendrograms-and-discrete-p-adic-symmetries-0809.1570</loc><lastmod>2009-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mumford-dendrograms-and-discrete-p-adic-symmetries-0809.1570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mumford-dendrograms-and-discrete-p-adic-symmetries-0809.1570"/></url>
<url><loc>https://scifaro.com/en/abs/circumference-chromatic-number-and-online-coloring-0809.1710</loc><lastmod>2008-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circumference-chromatic-number-and-online-coloring-0809.1710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circumference-chromatic-number-and-online-coloring-0809.1710"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-automata-as-a-model-of-physical-systems-0809.1790</loc><lastmod>2008-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-automata-as-a-model-of-physical-systems-0809.1790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-automata-as-a-model-of-physical-systems-0809.1790"/></url>
<url><loc>https://scifaro.com/en/abs/distributing-labels-on-infinite-trees-0809.1989</loc><lastmod>2008-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributing-labels-on-infinite-trees-0809.1989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributing-labels-on-infinite-trees-0809.1989"/></url>
<url><loc>https://scifaro.com/en/abs/np-completeness-of-hamiltonian-cycle-problem-on-rooted-directed-path-graphs-0809.2443</loc><lastmod>2008-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-completeness-of-hamiltonian-cycle-problem-on-rooted-directed-path-graphs-0809.2443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-completeness-of-hamiltonian-cycle-problem-on-rooted-directed-path-graphs-0809.2443"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-vertices-of-the-k-addiive-core-0809.2525</loc><lastmod>2008-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-vertices-of-the-k-addiive-core-0809.2525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-vertices-of-the-k-addiive-core-0809.2525"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-kernels-for-3-leaf-power-graph-modification-problems-0809.2858</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-kernels-for-3-leaf-power-graph-modification-problems-0809.2858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-kernels-for-3-leaf-power-graph-modification-problems-0809.2858"/></url>
<url><loc>https://scifaro.com/en/abs/on-an-algorithm-that-generates-an-interesting-maximal-set-p-n-of-the-naturals-for-any-n-greater-than-or-equal-to-2-0809.2884</loc><lastmod>2008-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-an-algorithm-that-generates-an-interesting-maximal-set-p-n-of-the-naturals-for-any-n-greater-than-or-equal-to-2-0809.2884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-an-algorithm-that-generates-an-interesting-maximal-set-p-n-of-the-naturals-for-any-n-greater-than-or-equal-to-2-0809.2884"/></url>
<url><loc>https://scifaro.com/en/abs/on-fractionality-of-the-path-packing-problem-0809.3565</loc><lastmod>2011-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-fractionality-of-the-path-packing-problem-0809.3565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-fractionality-of-the-path-packing-problem-0809.3565"/></url>
<url><loc>https://scifaro.com/en/abs/on-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-0809.4747</loc><lastmod>2012-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-0809.4747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-0809.4747"/></url>
<url><loc>https://scifaro.com/en/abs/on-fan-raspaud-conjecture-0809.4821</loc><lastmod>2008-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-fan-raspaud-conjecture-0809.4821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-fan-raspaud-conjecture-0809.4821"/></url>
<url><loc>https://scifaro.com/en/abs/on-normal-odd-partitions-in-cubic-graphs-0809.4822</loc><lastmod>2009-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-normal-odd-partitions-in-cubic-graphs-0809.4822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-normal-odd-partitions-in-cubic-graphs-0809.4822"/></url>
<url><loc>https://scifaro.com/en/abs/m-acajov-a-and-v-s-koviera-conjecture-on-cubic-graphs-0809.4839</loc><lastmod>2010-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/m-acajov-a-and-v-s-koviera-conjecture-on-cubic-graphs-0809.4839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/m-acajov-a-and-v-s-koviera-conjecture-on-cubic-graphs-0809.4839"/></url>
<url><loc>https://scifaro.com/en/abs/the-meaning-of-concurrent-programs-0810.1316</loc><lastmod>2008-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-meaning-of-concurrent-programs-0810.1316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-meaning-of-concurrent-programs-0810.1316"/></url>
<url><loc>https://scifaro.com/en/abs/demand-allocation-with-latency-cost-functions-0810.1650</loc><lastmod>2008-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/demand-allocation-with-latency-cost-functions-0810.1650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/demand-allocation-with-latency-cost-functions-0810.1650"/></url>
<url><loc>https://scifaro.com/en/abs/split-decomposition-and-graph-labelled-trees-characterizations-and-fully-dynamic-algorithms-for-totally-decomposable-graphs-0810.1823</loc><lastmod>2011-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/split-decomposition-and-graph-labelled-trees-characterizations-and-fully-dynamic-algorithms-for-totally-decomposable-graphs-0810.1823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/split-decomposition-and-graph-labelled-trees-characterizations-and-fully-dynamic-algorithms-for-totally-decomposable-graphs-0810.1823"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiable-k-4-2-k-k-cnf-formulas-0810.1904</loc><lastmod>2008-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-k-4-2-k-k-cnf-formulas-0810.1904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-k-4-2-k-k-cnf-formulas-0810.1904"/></url>
<url><loc>https://scifaro.com/en/abs/on-finite-functions-with-non-trivial-arity-gap-0810.2279</loc><lastmod>2010-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finite-functions-with-non-trivial-arity-gap-0810.2279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finite-functions-with-non-trivial-arity-gap-0810.2279"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-cubicity-of-bipartite-graphs-0810.2697</loc><lastmod>2008-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-cubicity-of-bipartite-graphs-0810.2697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-cubicity-of-bipartite-graphs-0810.2697"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-equation-x-2-l-1-x-a-0-over-mathrm-gf-2-k-extended-version-0810.4015</loc><lastmod>2009-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-equation-x-2-l-1-x-a-0-over-mathrm-gf-2-k-extended-version-0810.4015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-equation-x-2-l-1-x-a-0-over-mathrm-gf-2-k-extended-version-0810.4015"/></url>
<url><loc>https://scifaro.com/en/abs/locally-computable-approximations-for-spectral-clustering-and-absorption-times-of-random-walks-0810.4061</loc><lastmod>2008-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locally-computable-approximations-for-spectral-clustering-and-absorption-times-of-random-walks-0810.4061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locally-computable-approximations-for-spectral-clustering-and-absorption-times-of-random-walks-0810.4061"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-length-of-attractors-in-boolean-networks-with-an-interaction-graph-by-layers-0810.5482</loc><lastmod>2008-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-length-of-attractors-in-boolean-networks-with-an-interaction-graph-by-layers-0810.5482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-length-of-attractors-in-boolean-networks-with-an-interaction-graph-by-layers-0810.5482"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-dynamics-of-social-balance-on-general-networks-with-an-application-to-xor-sat-0811.0381</loc><lastmod>2010-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-dynamics-of-social-balance-on-general-networks-with-an-application-to-xor-sat-0811.0381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-dynamics-of-social-balance-on-general-networks-with-an-application-to-xor-sat-0811.0381"/></url>
<url><loc>https://scifaro.com/en/abs/fibonacci-index-and-stability-number-of-graphs-a-polyhedral-study-0811.1449</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fibonacci-index-and-stability-number-of-graphs-a-polyhedral-study-0811.1449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fibonacci-index-and-stability-number-of-graphs-a-polyhedral-study-0811.1449"/></url>
<url><loc>https://scifaro.com/en/abs/ferrers-dimension-and-boxicity-0811.1882</loc><lastmod>2008-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ferrers-dimension-and-boxicity-0811.1882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ferrers-dimension-and-boxicity-0811.1882"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressive-power-of-binary-submodular-functions-0811.1885</loc><lastmod>2009-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressive-power-of-binary-submodular-functions-0811.1885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressive-power-of-binary-submodular-functions-0811.1885"/></url>
<url><loc>https://scifaro.com/en/abs/noise-resilient-group-testing-limitations-and-constructions-0811.2609</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noise-resilient-group-testing-limitations-and-constructions-0811.2609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noise-resilient-group-testing-limitations-and-constructions-0811.2609"/></url>
<url><loc>https://scifaro.com/en/abs/characterizations-of-probe-interval-graphs-0811.2675</loc><lastmod>2008-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizations-of-probe-interval-graphs-0811.2675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizations-of-probe-interval-graphs-0811.2675"/></url>
<url><loc>https://scifaro.com/en/abs/topological-dynamics-of-cellular-automata-dimension-matters-0811.2731</loc><lastmod>2009-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-dynamics-of-cellular-automata-dimension-matters-0811.2731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-dynamics-of-cellular-automata-dimension-matters-0811.2731"/></url>
<url><loc>https://scifaro.com/en/abs/belief-functions-on-lattices-0811.3373</loc><lastmod>2008-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-functions-on-lattices-0811.3373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-functions-on-lattices-0811.3373"/></url>
<url><loc>https://scifaro.com/en/abs/counting-number-of-factorizations-of-a-natural-number-0811.3479</loc><lastmod>2008-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-number-of-factorizations-of-a-natural-number-0811.3479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-number-of-factorizations-of-a-natural-number-0811.3479"/></url>
<url><loc>https://scifaro.com/en/abs/the-simultaneous-membership-problem-for-chordal-comparability-and-permutation-graphs-0811.4007</loc><lastmod>2008-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simultaneous-membership-problem-for-chordal-comparability-and-permutation-graphs-0811.4007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simultaneous-membership-problem-for-chordal-comparability-and-permutation-graphs-0811.4007"/></url>
<url><loc>https://scifaro.com/en/abs/strong-spatial-mixing-and-approximating-partition-functions-of-two-state-spin-systems-without-hard-constrains-0812.0754</loc><lastmod>2009-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-spatial-mixing-and-approximating-partition-functions-of-two-state-spin-systems-without-hard-constrains-0812.0754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-spatial-mixing-and-approximating-partition-functions-of-two-state-spin-systems-without-hard-constrains-0812.0754"/></url>
<url><loc>https://scifaro.com/en/abs/adversarial-scheduling-in-evolutionary-game-dynamics-0812.1194</loc><lastmod>2008-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adversarial-scheduling-in-evolutionary-game-dynamics-0812.1194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adversarial-scheduling-in-evolutionary-game-dynamics-0812.1194"/></url>
<url><loc>https://scifaro.com/en/abs/a-quasi-polynomial-time-approximation-scheme-for-euclidean-capacitated-vehicle-routing-0812.1595</loc><lastmod>2008-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quasi-polynomial-time-approximation-scheme-for-euclidean-capacitated-vehicle-routing-0812.1595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quasi-polynomial-time-approximation-scheme-for-euclidean-capacitated-vehicle-routing-0812.1595"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-metric-for-robustness-with-respect-to-virus-spread-0812.1908</loc><lastmod>2008-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-metric-for-robustness-with-respect-to-virus-spread-0812.1908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-metric-for-robustness-with-respect-to-virus-spread-0812.1908"/></url>
<url><loc>https://scifaro.com/en/abs/performance-of-a-greedy-algorithm-for-edge-covering-by-cliques-in-interval-graphs-0812.2115</loc><lastmod>2008-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/performance-of-a-greedy-algorithm-for-edge-covering-by-cliques-in-interval-graphs-0812.2115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/performance-of-a-greedy-algorithm-for-edge-covering-by-cliques-in-interval-graphs-0812.2115"/></url>
<url><loc>https://scifaro.com/en/abs/asteroids-in-rooted-and-directed-path-graphs-0812.2734</loc><lastmod>2008-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asteroids-in-rooted-and-directed-path-graphs-0812.2734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asteroids-in-rooted-and-directed-path-graphs-0812.2734"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-eat-4-9-of-a-pizza-0812.2870</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-eat-4-9-of-a-pizza-0812.2870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-eat-4-9-of-a-pizza-0812.2870"/></url>
<url><loc>https://scifaro.com/en/abs/tree-width-of-hypergraphs-and-surface-duality-0812.2990</loc><lastmod>2008-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-width-of-hypergraphs-and-surface-duality-0812.2990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-width-of-hypergraphs-and-surface-duality-0812.2990"/></url>
<url><loc>https://scifaro.com/en/abs/solution-of-peter-winkler-s-pizza-problem-0812.4322</loc><lastmod>2011-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solution-of-peter-winkler-s-pizza-problem-0812.4322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solution-of-peter-winkler-s-pizza-problem-0812.4322"/></url>
<url><loc>https://scifaro.com/en/abs/some-sufficient-conditions-on-hamiltonian-digraph-0812.4329</loc><lastmod>2008-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-sufficient-conditions-on-hamiltonian-digraph-0812.4329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-sufficient-conditions-on-hamiltonian-digraph-0812.4329"/></url>
<url><loc>https://scifaro.com/en/abs/the-plane-width-of-graphs-0812.4346</loc><lastmod>2013-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-plane-width-of-graphs-0812.4346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-plane-width-of-graphs-0812.4346"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-classes-of-functions-and-hypercubes-0812.4367</loc><lastmod>2008-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-classes-of-functions-and-hypercubes-0812.4367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-classes-of-functions-and-hypercubes-0812.4367"/></url>
<url><loc>https://scifaro.com/en/abs/the-road-coloring-for-mapping-on-k-states-withdrawn-0812.4798</loc><lastmod>2009-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-road-coloring-for-mapping-on-k-states-withdrawn-0812.4798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-road-coloring-for-mapping-on-k-states-withdrawn-0812.4798"/></url>
<url><loc>https://scifaro.com/en/abs/on-upper-bounds-for-parameters-related-to-construction-of-special-maximum-matchings-0901.0121</loc><lastmod>2011-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-upper-bounds-for-parameters-related-to-construction-of-special-maximum-matchings-0901.0121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-upper-bounds-for-parameters-related-to-construction-of-special-maximum-matchings-0901.0121"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-well-covered-graphs-without-cycles-of-length-4-5-6-and-7-0901.0858</loc><lastmod>2010-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-well-covered-graphs-without-cycles-of-length-4-5-6-and-7-0901.0858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-well-covered-graphs-without-cycles-of-length-4-5-6-and-7-0901.0858"/></url>
<url><loc>https://scifaro.com/en/abs/fast-algorithms-for-max-independent-set-in-graphs-of-small-average-degree-0901.1563</loc><lastmod>2009-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-algorithms-for-max-independent-set-in-graphs-of-small-average-degree-0901.1563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-algorithms-for-max-independent-set-in-graphs-of-small-average-degree-0901.1563"/></url>
<url><loc>https://scifaro.com/en/abs/entropy-principle-in-direct-derivation-of-benford-s-law-0901.3047</loc><lastmod>2009-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entropy-principle-in-direct-derivation-of-benford-s-law-0901.3047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entropy-principle-in-direct-derivation-of-benford-s-law-0901.3047"/></url>
<url><loc>https://scifaro.com/en/abs/average-number-of-flips-in-pancake-sorting-0901.3119</loc><lastmod>2011-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-number-of-flips-in-pancake-sorting-0901.3119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-number-of-flips-in-pancake-sorting-0901.3119"/></url>
<url><loc>https://scifaro.com/en/abs/computing-rooted-and-unrooted-maximum-consistent-supertrees-0901.3299</loc><lastmod>2010-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-rooted-and-unrooted-maximum-consistent-supertrees-0901.3299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-rooted-and-unrooted-maximum-consistent-supertrees-0901.3299"/></url>
<url><loc>https://scifaro.com/en/abs/randomly-colouring-simple-hypergraphs-0901.3699</loc><lastmod>2009-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomly-colouring-simple-hypergraphs-0901.3699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomly-colouring-simple-hypergraphs-0901.3699"/></url>
<url><loc>https://scifaro.com/en/abs/graph-based-local-elimination-algorithms-in-discrete-optimization-0901.3882</loc><lastmod>2009-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-based-local-elimination-algorithms-in-discrete-optimization-0901.3882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-based-local-elimination-algorithms-in-discrete-optimization-0901.3882"/></url>
<url><loc>https://scifaro.com/en/abs/a-mathematical-basis-for-the-chaining-of-lossy-interface-adapters-0901.4835</loc><lastmod>2010-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mathematical-basis-for-the-chaining-of-lossy-interface-adapters-0901.4835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mathematical-basis-for-the-chaining-of-lossy-interface-adapters-0901.4835"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-problem-of-frobenius-in-three-numbers-0902.0084</loc><lastmod>2009-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-problem-of-frobenius-in-three-numbers-0902.0084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-problem-of-frobenius-in-three-numbers-0902.0084"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-graph-grammars-and-monotone-complex-logics-0902.0850</loc><lastmod>2009-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-graph-grammars-and-monotone-complex-logics-0902.0850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-graph-grammars-and-monotone-complex-logics-0902.0850"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-subset-connectivity-problems-in-bounded-genus-graphs-0902.1043</loc><lastmod>2011-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-subset-connectivity-problems-in-bounded-genus-graphs-0902.1043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-subset-connectivity-problems-in-bounded-genus-graphs-0902.1043"/></url>
<url><loc>https://scifaro.com/en/abs/on-finding-a-particular-class-of-combinatorial-identities-0902.1045</loc><lastmod>2009-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finding-a-particular-class-of-combinatorial-identities-0902.1045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finding-a-particular-class-of-combinatorial-identities-0902.1045"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-kernel-for-multicut-in-trees-0902.1047</loc><lastmod>2009-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-kernel-for-multicut-in-trees-0902.1047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-kernel-for-multicut-in-trees-0902.1047"/></url>
<url><loc>https://scifaro.com/en/abs/directed-paths-on-a-tree-coloring-multicut-and-kernel-0902.1182</loc><lastmod>2009-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-paths-on-a-tree-coloring-multicut-and-kernel-0902.1182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-paths-on-a-tree-coloring-multicut-and-kernel-0902.1182"/></url>
<url><loc>https://scifaro.com/en/abs/on-local-symmetries-and-universality-in-cellular-autmata-0902.1253</loc><lastmod>2009-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-local-symmetries-and-universality-in-cellular-autmata-0902.1253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-local-symmetries-and-universality-in-cellular-autmata-0902.1253"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-contractible-edges-in-chordal-graphs-0902.1364</loc><lastmod>2009-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-contractible-edges-in-chordal-graphs-0902.1364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-contractible-edges-in-chordal-graphs-0902.1364"/></url>
<url><loc>https://scifaro.com/en/abs/an-order-on-sets-of-tilings-corresponding-to-an-order-on-languages-0902.1602</loc><lastmod>2009-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-order-on-sets-of-tilings-corresponding-to-an-order-on-languages-0902.1602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-order-on-sets-of-tilings-corresponding-to-an-order-on-languages-0902.1602"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-split-decomposition-revisited-0902.1700</loc><lastmod>2010-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-split-decomposition-revisited-0902.1700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-split-decomposition-revisited-0902.1700"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-graph-grammars-with-application-conditions-0902.1809</loc><lastmod>2009-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-graph-grammars-with-application-conditions-0902.1809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-graph-grammars-with-application-conditions-0902.1809"/></url>
<url><loc>https://scifaro.com/en/abs/local-multicoloring-algorithms-computing-a-nearly-optimal-tdma-schedule-in-constant-time-0902.1868</loc><lastmod>2009-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-multicoloring-algorithms-computing-a-nearly-optimal-tdma-schedule-in-constant-time-0902.1868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-multicoloring-algorithms-computing-a-nearly-optimal-tdma-schedule-in-constant-time-0902.1868"/></url>
<url><loc>https://scifaro.com/en/abs/computing-graph-roots-without-short-cycles-0902.2150</loc><lastmod>2009-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-graph-roots-without-short-cycles-0902.2150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-graph-roots-without-short-cycles-0902.2150"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-trees-of-bounded-degree-graphs-0902.2166</loc><lastmod>2009-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-trees-of-bounded-degree-graphs-0902.2166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-trees-of-bounded-degree-graphs-0902.2166"/></url>
<url><loc>https://scifaro.com/en/abs/generalised-sequential-crossover-of-words-and-languages-0902.3503</loc><lastmod>2009-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalised-sequential-crossover-of-words-and-languages-0902.3503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalised-sequential-crossover-of-words-and-languages-0902.3503"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-generalised-sequential-crossover-of-languages-to-generalised-splicing-0902.3818</loc><lastmod>2009-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-generalised-sequential-crossover-of-languages-to-generalised-splicing-0902.3818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-generalised-sequential-crossover-of-languages-to-generalised-splicing-0902.3818"/></url>
<url><loc>https://scifaro.com/en/abs/non-linear-system-for-a-veritable-pid-substitute-0903.0051</loc><lastmod>2009-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-linear-system-for-a-veritable-pid-substitute-0903.0051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-linear-system-for-a-veritable-pid-substitute-0903.0051"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-interdiction-of-unreactive-markovian-evaders-0903.0173</loc><lastmod>2009-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-interdiction-of-unreactive-markovian-evaders-0903.0173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-interdiction-of-unreactive-markovian-evaders-0903.0173"/></url>
<url><loc>https://scifaro.com/en/abs/manets-high-mobility-can-make-up-for-low-transmission-power-0903.0520</loc><lastmod>2009-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/manets-high-mobility-can-make-up-for-low-transmission-power-0903.0520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/manets-high-mobility-can-make-up-for-low-transmission-power-0903.0520"/></url>
<url><loc>https://scifaro.com/en/abs/about-testing-the-speed-of-calculating-the-shortest-route-0903.0578</loc><lastmod>2009-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-testing-the-speed-of-calculating-the-shortest-route-0903.0578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-testing-the-speed-of-calculating-the-shortest-route-0903.0578"/></url>
<url><loc>https://scifaro.com/en/abs/hospital-acquired-infections-advantages-of-a-computerized-surveillance-0903.0962</loc><lastmod>2009-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hospital-acquired-infections-advantages-of-a-computerized-surveillance-0903.0962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hospital-acquired-infections-advantages-of-a-computerized-surveillance-0903.0962"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-category-of-partial-bijections-0903.1017</loc><lastmod>2009-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-category-of-partial-bijections-0903.1017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-category-of-partial-bijections-0903.1017"/></url>
<url><loc>https://scifaro.com/en/abs/a-lagrangian-relaxation-for-the-maximum-stable-set-problem-0903.1407</loc><lastmod>2009-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lagrangian-relaxation-for-the-maximum-stable-set-problem-0903.1407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lagrangian-relaxation-for-the-maximum-stable-set-problem-0903.1407"/></url>
<url><loc>https://scifaro.com/en/abs/strict-self-assembly-of-discrete-sierpinski-triangles-0903.1818</loc><lastmod>2009-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strict-self-assembly-of-discrete-sierpinski-triangles-0903.1818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strict-self-assembly-of-discrete-sierpinski-triangles-0903.1818"/></url>
<url><loc>https://scifaro.com/en/abs/limitations-of-self-assembly-at-temperature-1-0903.1857</loc><lastmod>2009-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limitations-of-self-assembly-at-temperature-1-0903.1857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limitations-of-self-assembly-at-temperature-1-0903.1857"/></url>
<url><loc>https://scifaro.com/en/abs/partitions-versus-sets-a-case-of-duality-0903.2100</loc><lastmod>2009-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitions-versus-sets-a-case-of-duality-0903.2100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitions-versus-sets-a-case-of-duality-0903.2100"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-a-bloom-filter-algorithm-via-the-supermarket-model-0903.2134</loc><lastmod>2009-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-a-bloom-filter-algorithm-via-the-supermarket-model-0903.2134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-a-bloom-filter-algorithm-via-the-supermarket-model-0903.2134"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-words-without-palindrome-0903.2382</loc><lastmod>2009-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-words-without-palindrome-0903.2382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-words-without-palindrome-0903.2382"/></url>
<url><loc>https://scifaro.com/en/abs/parking-functions-labeled-trees-and-dcj-sorting-scenarios-0903.2499</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parking-functions-labeled-trees-and-dcj-sorting-scenarios-0903.2499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parking-functions-labeled-trees-and-dcj-sorting-scenarios-0903.2499"/></url>
<url><loc>https://scifaro.com/en/abs/on-hadwiger-s-number-of-a-graph-with-partial-information-0903.2742</loc><lastmod>2009-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-hadwiger-s-number-of-a-graph-with-partial-information-0903.2742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-hadwiger-s-number-of-a-graph-with-partial-information-0903.2742"/></url>
<url><loc>https://scifaro.com/en/abs/non-linear-system-become-linear-system-0903.4293</loc><lastmod>2009-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-linear-system-become-linear-system-0903.4293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-linear-system-become-linear-system-0903.4293"/></url>
<url><loc>https://scifaro.com/en/abs/sums-of-powers-via-integration-0903.4358</loc><lastmod>2009-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sums-of-powers-via-integration-0903.4358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sums-of-powers-via-integration-0903.4358"/></url>
<url><loc>https://scifaro.com/en/abs/tree-decomposition-and-postoptimality-analysis-in-discrete-optimization-0903.4435</loc><lastmod>2009-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-decomposition-and-postoptimality-analysis-in-discrete-optimization-0903.4435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-decomposition-and-postoptimality-analysis-in-discrete-optimization-0903.4435"/></url>
<url><loc>https://scifaro.com/en/abs/graph-polynomials-and-approximation-of-partition-functions-with-loopy-belief-propagation-0903.4527</loc><lastmod>2009-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-polynomials-and-approximation-of-partition-functions-with-loopy-belief-propagation-0903.4527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-polynomials-and-approximation-of-partition-functions-with-loopy-belief-propagation-0903.4527"/></url>
<url><loc>https://scifaro.com/en/abs/act-of-cvt-and-evt-in-the-formation-of-number-theoretic-fractals-0903.4770</loc><lastmod>2009-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/act-of-cvt-and-evt-in-the-formation-of-number-theoretic-fractals-0903.4770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/act-of-cvt-and-evt-in-the-formation-of-number-theoretic-fractals-0903.4770"/></url>
<url><loc>https://scifaro.com/en/abs/a-computational-method-for-bounding-the-probability-of-reconstruction-on-trees-0903.4812</loc><lastmod>2011-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computational-method-for-bounding-the-probability-of-reconstruction-on-trees-0903.4812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computational-method-for-bounding-the-probability-of-reconstruction-on-trees-0903.4812"/></url>
<url><loc>https://scifaro.com/en/abs/the-hardness-of-the-independence-and-matching-clutter-of-a-graph-0903.4907</loc><lastmod>2015-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hardness-of-the-independence-and-matching-clutter-of-a-graph-0903.4907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hardness-of-the-independence-and-matching-clutter-of-a-graph-0903.4907"/></url>
<url><loc>https://scifaro.com/en/abs/sequences-close-to-periodic-0903.5316</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequences-close-to-periodic-0903.5316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequences-close-to-periodic-0903.5316"/></url>
<url><loc>https://scifaro.com/en/abs/theory-of-carry-value-transformation-cvt-and-its-application-in-fractal-formation-0904.0534</loc><lastmod>2009-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-of-carry-value-transformation-cvt-and-its-application-in-fractal-formation-0904.0534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-of-carry-value-transformation-cvt-and-its-application-in-fractal-formation-0904.0534"/></url>
<url><loc>https://scifaro.com/en/abs/meta-kernelization-0904.0727</loc><lastmod>2013-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/meta-kernelization-0904.0727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/meta-kernelization-0904.0727"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-perfect-matching-index-of-bridgeless-cubic-graphs-0904.1296</loc><lastmod>2009-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-perfect-matching-index-of-bridgeless-cubic-graphs-0904.1296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-perfect-matching-index-of-bridgeless-cubic-graphs-0904.1296"/></url>
<url><loc>https://scifaro.com/en/abs/a-3-approximation-algorithm-for-computing-a-parsimonious-first-speciation-in-the-gene-duplication-model-0904.1645</loc><lastmod>2009-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-3-approximation-algorithm-for-computing-a-parsimonious-first-speciation-in-the-gene-duplication-model-0904.1645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-3-approximation-algorithm-for-computing-a-parsimonious-first-speciation-in-the-gene-duplication-model-0904.1645"/></url>
<url><loc>https://scifaro.com/en/abs/closure-under-minors-of-undirected-entanglement-0904.1703</loc><lastmod>2009-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closure-under-minors-of-undirected-entanglement-0904.1703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closure-under-minors-of-undirected-entanglement-0904.1703"/></url>
<url><loc>https://scifaro.com/en/abs/on-polynomial-growth-functions-of-d0l-systems-0904.1752</loc><lastmod>2012-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-polynomial-growth-functions-of-d0l-systems-0904.1752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-polynomial-growth-functions-of-d0l-systems-0904.1752"/></url>
<url><loc>https://scifaro.com/en/abs/feasibility-of-motion-planning-on-acyclic-and-strongly-connected-directed-graphs-0904.1920</loc><lastmod>2009-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feasibility-of-motion-planning-on-acyclic-and-strongly-connected-directed-graphs-0904.1920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feasibility-of-motion-planning-on-acyclic-and-strongly-connected-directed-graphs-0904.1920"/></url>
<url><loc>https://scifaro.com/en/abs/seidel-minor-permutation-graphs-and-combinatorial-properties-0904.1923</loc><lastmod>2010-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/seidel-minor-permutation-graphs-and-combinatorial-properties-0904.1923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/seidel-minor-permutation-graphs-and-combinatorial-properties-0904.1923"/></url>
<url><loc>https://scifaro.com/en/abs/on-irreversible-dynamic-monopolies-in-general-graphs-0904.2306</loc><lastmod>2010-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-irreversible-dynamic-monopolies-in-general-graphs-0904.2306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-irreversible-dynamic-monopolies-in-general-graphs-0904.2306"/></url>
<url><loc>https://scifaro.com/en/abs/all-that-glisters-is-not-galled-0904.2448</loc><lastmod>2009-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-that-glisters-is-not-galled-0904.2448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-that-glisters-is-not-galled-0904.2448"/></url>
<url><loc>https://scifaro.com/en/abs/subshifts-languages-and-logic-0904.2457</loc><lastmod>2016-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subshifts-languages-and-logic-0904.2457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subshifts-languages-and-logic-0904.2457"/></url>
<url><loc>https://scifaro.com/en/abs/on-finding-directed-trees-with-many-leaves-0904.2658</loc><lastmod>2009-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finding-directed-trees-with-many-leaves-0904.2658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finding-directed-trees-with-many-leaves-0904.2658"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-and-clustering-in-random-constraint-satisfaction-problems-0904.2751</loc><lastmod>2009-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-and-clustering-in-random-constraint-satisfaction-problems-0904.2751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-and-clustering-in-random-constraint-satisfaction-problems-0904.2751"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-width-a-new-width-parameter-for-matroids-0904.2785</loc><lastmod>2009-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-width-a-new-width-parameter-for-matroids-0904.2785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-width-a-new-width-parameter-for-matroids-0904.2785"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-random-apollonian-networks-0904.4176</loc><lastmod>2009-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-random-apollonian-networks-0904.4176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-random-apollonian-networks-0904.4176"/></url>
<url><loc>https://scifaro.com/en/abs/graph-homomorphisms-circular-colouring-and-fractional-covering-by-h-cuts-0904.4600</loc><lastmod>2009-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-homomorphisms-circular-colouring-and-fractional-covering-by-h-cuts-0904.4600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-homomorphisms-circular-colouring-and-fractional-covering-by-h-cuts-0904.4600"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-flow-in-directed-planar-graphs-with-vertex-capacities-0905.0451</loc><lastmod>2009-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-flow-in-directed-planar-graphs-with-vertex-capacities-0905.0451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-flow-in-directed-planar-graphs-with-vertex-capacities-0905.0451"/></url>
<url><loc>https://scifaro.com/en/abs/feedback-vertex-sets-in-tournaments-0905.0567</loc><lastmod>2011-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feedback-vertex-sets-in-tournaments-0905.0567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feedback-vertex-sets-in-tournaments-0905.0567"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-0-1-multidimensional-knapsack-problem-with-resolution-search-0905.0848</loc><lastmod>2009-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-0-1-multidimensional-knapsack-problem-with-resolution-search-0905.0848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-0-1-multidimensional-knapsack-problem-with-resolution-search-0905.0848"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-graph-grammars-as-a-model-of-computation-0905.1202</loc><lastmod>2009-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-graph-grammars-as-a-model-of-computation-0905.1202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-graph-grammars-as-a-model-of-computation-0905.1202"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiable-linear-cnf-formulas-are-large-and-complex-0905.1587</loc><lastmod>2010-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-linear-cnf-formulas-are-large-and-complex-0905.1587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-linear-cnf-formulas-are-large-and-complex-0905.1587"/></url>
<url><loc>https://scifaro.com/en/abs/more-efficient-periodic-traversal-in-anonymous-undirected-graphs-0905.1737</loc><lastmod>2009-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/more-efficient-periodic-traversal-in-anonymous-undirected-graphs-0905.1737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/more-efficient-periodic-traversal-in-anonymous-undirected-graphs-0905.1737"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-cellular-automata-rules-based-on-their-properties-0905.1769</loc><lastmod>2009-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-cellular-automata-rules-based-on-their-properties-0905.1769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-cellular-automata-rules-based-on-their-properties-0905.1769"/></url>
<url><loc>https://scifaro.com/en/abs/the-l-2-1-labeling-problem-on-oriented-regular-grids-0905.1780</loc><lastmod>2009-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-l-2-1-labeling-problem-on-oriented-regular-grids-0905.1780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-l-2-1-labeling-problem-on-oriented-regular-grids-0905.1780"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-information-distance-0905.2386</loc><lastmod>2010-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-information-distance-0905.2386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-information-distance-0905.2386"/></url>
<url><loc>https://scifaro.com/en/abs/deficiency-zero-petri-nets-and-product-form-0905.3158</loc><lastmod>2010-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deficiency-zero-petri-nets-and-product-form-0905.3158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deficiency-zero-petri-nets-and-product-form-0905.3158"/></url>
<url><loc>https://scifaro.com/en/abs/searching-the-nodes-of-a-graph-theory-and-algorithms-0905.3359</loc><lastmod>2009-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-the-nodes-of-a-graph-theory-and-algorithms-0905.3359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-the-nodes-of-a-graph-theory-and-algorithms-0905.3359"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-proof-of-the-four-color-theorem-0905.3713</loc><lastmod>2009-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-proof-of-the-four-color-theorem-0905.3713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-proof-of-the-four-color-theorem-0905.3713"/></url>
<url><loc>https://scifaro.com/en/abs/semiparametric-estimation-of-a-noise-model-with-quantization-errors-0906.0346</loc><lastmod>2009-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semiparametric-estimation-of-a-noise-model-with-quantization-errors-0906.0346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semiparametric-estimation-of-a-noise-model-with-quantization-errors-0906.0346"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-tree-number-of-a-cut-outerplanar-graph-0906.0422</loc><lastmod>2020-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-tree-number-of-a-cut-outerplanar-graph-0906.0422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-tree-number-of-a-cut-outerplanar-graph-0906.0422"/></url>
<url><loc>https://scifaro.com/en/abs/a-partial-order-on-bipartite-graphs-with-n-vertices-0906.0859</loc><lastmod>2009-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-partial-order-on-bipartite-graphs-with-n-vertices-0906.0859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-partial-order-on-bipartite-graphs-with-n-vertices-0906.0859"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-distribution-of-5-points-with-maximal-distance-sum-0906.0937</loc><lastmod>2009-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-distribution-of-5-points-with-maximal-distance-sum-0906.0937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-distribution-of-5-points-with-maximal-distance-sum-0906.0937"/></url>
<url><loc>https://scifaro.com/en/abs/on-fulkerson-conjecture-0906.1086</loc><lastmod>2011-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-fulkerson-conjecture-0906.1086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-fulkerson-conjecture-0906.1086"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-the-square-of-the-cartesian-product-of-two-cycles-0906.1126</loc><lastmod>2010-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-the-square-of-the-cartesian-product-of-two-cycles-0906.1126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-the-square-of-the-cartesian-product-of-two-cycles-0906.1126"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-uniform-power-connectivity-in-the-sinr-model-0906.2311</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-uniform-power-connectivity-in-the-sinr-model-0906.2311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-uniform-power-connectivity-in-the-sinr-model-0906.2311"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-digital-straight-segment-recognition-0906.2351</loc><lastmod>2009-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-digital-straight-segment-recognition-0906.2351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-digital-straight-segment-recognition-0906.2351"/></url>
<url><loc>https://scifaro.com/en/abs/coding-cells-of-digital-spaces-a-framework-to-write-generic-digital-topology-algorithms-0906.2767</loc><lastmod>2009-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coding-cells-of-digital-spaces-a-framework-to-write-generic-digital-topology-algorithms-0906.2767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coding-cells-of-digital-spaces-a-framework-to-write-generic-digital-topology-algorithms-0906.2767"/></url>
<url><loc>https://scifaro.com/en/abs/convex-shapes-and-convergence-speed-of-discrete-tangent-estimators-0906.3089</loc><lastmod>2009-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-shapes-and-convergence-speed-of-discrete-tangent-estimators-0906.3089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-shapes-and-convergence-speed-of-discrete-tangent-estimators-0906.3089"/></url>
<url><loc>https://scifaro.com/en/abs/the-pagoda-sequence-a-ramble-through-linear-complexity-number-walls-d0l-sequences-finite-state-automata-and-aperiodic-tilings-0906.3286</loc><lastmod>2009-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-pagoda-sequence-a-ramble-through-linear-complexity-number-walls-d0l-sequences-finite-state-automata-and-aperiodic-tilings-0906.3286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-pagoda-sequence-a-ramble-through-linear-complexity-number-walls-d0l-sequences-finite-state-automata-and-aperiodic-tilings-0906.3286"/></url>
<url><loc>https://scifaro.com/en/abs/games-for-width-parameters-and-monotonicity-0906.3857</loc><lastmod>2009-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-for-width-parameters-and-monotonicity-0906.3857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-for-width-parameters-and-monotonicity-0906.3857"/></url>
<url><loc>https://scifaro.com/en/abs/on-maximal-repetitions-of-arbitrary-exponent-0906.4750</loc><lastmod>2009-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-maximal-repetitions-of-arbitrary-exponent-0906.4750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-maximal-repetitions-of-arbitrary-exponent-0906.4750"/></url>
<url><loc>https://scifaro.com/en/abs/theory-of-rule-6-and-its-application-to-round-robin-tournament-0906.5450</loc><lastmod>2009-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-of-rule-6-and-its-application-to-round-robin-tournament-0906.5450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-of-rule-6-and-its-application-to-round-robin-tournament-0906.5450"/></url>
<url><loc>https://scifaro.com/en/abs/a-closest-vector-problem-arising-in-radiation-therapy-planning-0907.0138</loc><lastmod>2010-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-closest-vector-problem-arising-in-radiation-therapy-planning-0907.0138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-closest-vector-problem-arising-in-radiation-therapy-planning-0907.0138"/></url>
<url><loc>https://scifaro.com/en/abs/the-threshold-for-random-1-2-qsat-0907.0937</loc><lastmod>2009-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-threshold-for-random-1-2-qsat-0907.0937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-threshold-for-random-1-2-qsat-0907.0937"/></url>
<url><loc>https://scifaro.com/en/abs/extremal-problems-in-ordered-graphs-0907.2479</loc><lastmod>2009-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extremal-problems-in-ordered-graphs-0907.2479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extremal-problems-in-ordered-graphs-0907.2479"/></url>
<url><loc>https://scifaro.com/en/abs/finding-fullerene-patches-in-polynomial-time-0907.2627</loc><lastmod>2009-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-fullerene-patches-in-polynomial-time-0907.2627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-fullerene-patches-in-polynomial-time-0907.2627"/></url>
<url><loc>https://scifaro.com/en/abs/the-visualization-of-the-road-coloring-algorithm-in-the-package-testas-0907.2755</loc><lastmod>2010-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-visualization-of-the-road-coloring-algorithm-in-the-package-testas-0907.2755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-visualization-of-the-road-coloring-algorithm-in-the-package-testas-0907.2755"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-counting-problems-for-semi-linear-sets-0907.3005</loc><lastmod>2009-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-counting-problems-for-semi-linear-sets-0907.3005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-counting-problems-for-semi-linear-sets-0907.3005"/></url>
<url><loc>https://scifaro.com/en/abs/duality-for-min-max-orderings-and-dichotomy-for-min-cost-homomorphisms-0907.3016</loc><lastmod>2009-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/duality-for-min-max-orderings-and-dichotomy-for-min-cost-homomorphisms-0907.3016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/duality-for-min-max-orderings-and-dichotomy-for-min-cost-homomorphisms-0907.3016"/></url>
<url><loc>https://scifaro.com/en/abs/on-brambles-grid-like-minors-and-parameterized-intractability-of-monadic-second-order-logic-0907.3076</loc><lastmod>2009-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-brambles-grid-like-minors-and-parameterized-intractability-of-monadic-second-order-logic-0907.3076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-brambles-grid-like-minors-and-parameterized-intractability-of-monadic-second-order-logic-0907.3076"/></url>
<url><loc>https://scifaro.com/en/abs/new-binomial-bent-function-over-the-finite-fields-of-odd-characteristic-0907.3348</loc><lastmod>2009-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-binomial-bent-function-over-the-finite-fields-of-odd-characteristic-0907.3348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-binomial-bent-function-over-the-finite-fields-of-odd-characteristic-0907.3348"/></url>
<url><loc>https://scifaro.com/en/abs/a-certifying-algorithm-for-3-colorability-of-p5-free-graphs-0907.3497</loc><lastmod>2009-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-certifying-algorithm-for-3-colorability-of-p5-free-graphs-0907.3497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-certifying-algorithm-for-3-colorability-of-p5-free-graphs-0907.3497"/></url>
<url><loc>https://scifaro.com/en/abs/the-interval-constrained-3-coloring-problem-0907.3563</loc><lastmod>2009-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-interval-constrained-3-coloring-problem-0907.3563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-interval-constrained-3-coloring-problem-0907.3563"/></url>
<url><loc>https://scifaro.com/en/abs/the-incidence-chromatic-number-of-toroidal-grids-0907.3801</loc><lastmod>2013-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-incidence-chromatic-number-of-toroidal-grids-0907.3801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-incidence-chromatic-number-of-toroidal-grids-0907.3801"/></url>
<url><loc>https://scifaro.com/en/abs/the-semigroup-of-combinatorial-configurations-0907.4230</loc><lastmod>2010-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-semigroup-of-combinatorial-configurations-0907.4230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-semigroup-of-combinatorial-configurations-0907.4230"/></url>
<url><loc>https://scifaro.com/en/abs/the-distributions-in-nature-and-entropy-principle-0907.4852</loc><lastmod>2009-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-distributions-in-nature-and-entropy-principle-0907.4852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-distributions-in-nature-and-entropy-principle-0907.4852"/></url>
<url><loc>https://scifaro.com/en/abs/how-much-does-a-hamiltonian-cycle-weigh-0907.5016</loc><lastmod>2009-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-much-does-a-hamiltonian-cycle-weigh-0907.5016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-much-does-a-hamiltonian-cycle-weigh-0907.5016"/></url>
<url><loc>https://scifaro.com/en/abs/negative-circuits-and-sustained-oscillations-in-asynchronous-automata-networks-0907.5096</loc><lastmod>2009-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negative-circuits-and-sustained-oscillations-in-asynchronous-automata-networks-0907.5096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negative-circuits-and-sustained-oscillations-in-asynchronous-automata-networks-0907.5096"/></url>
<url><loc>https://scifaro.com/en/abs/treewidth-of-erd-o-s-r-e-nyi-random-graphs-random-intersection-graphs-and-scale-free-random-graphs-0907.5481</loc><lastmod>2009-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/treewidth-of-erd-o-s-r-e-nyi-random-graphs-random-intersection-graphs-and-scale-free-random-graphs-0907.5481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/treewidth-of-erd-o-s-r-e-nyi-random-graphs-random-intersection-graphs-and-scale-free-random-graphs-0907.5481"/></url>
<url><loc>https://scifaro.com/en/abs/girth-of-a-planar-digraph-with-real-edge-weights-in-o-n-log-n-3-time-0908.0697</loc><lastmod>2009-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/girth-of-a-planar-digraph-with-real-edge-weights-in-o-n-log-n-3-time-0908.0697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/girth-of-a-planar-digraph-with-real-edge-weights-in-o-n-log-n-3-time-0908.0697"/></url>
<url><loc>https://scifaro.com/en/abs/acyclic-edge-coloring-of-planar-graphs-0908.2237</loc><lastmod>2009-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclic-edge-coloring-of-planar-graphs-0908.2237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclic-edge-coloring-of-planar-graphs-0908.2237"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotically-optimal-assignments-in-ordinal-evaluations-of-proposals-0908.3233</loc><lastmod>2009-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotically-optimal-assignments-in-ordinal-evaluations-of-proposals-0908.3233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotically-optimal-assignments-in-ordinal-evaluations-of-proposals-0908.3233"/></url>
<url><loc>https://scifaro.com/en/abs/on-relating-edges-in-graphs-without-cycles-of-length-4-0908.4016</loc><lastmod>2009-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-relating-edges-in-graphs-without-cycles-of-length-4-0908.4016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-relating-edges-in-graphs-without-cycles-of-length-4-0908.4016"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-second-order-model-checking-on-decomposable-matroids-0908.4499</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-second-order-model-checking-on-decomposable-matroids-0908.4499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-second-order-model-checking-on-decomposable-matroids-0908.4499"/></url>
<url><loc>https://scifaro.com/en/abs/on-necessary-and-sufficient-number-of-cops-in-the-game-of-cops-and-robber-in-multidimensional-grids-0909.1381</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-necessary-and-sufficient-number-of-cops-in-the-game-of-cops-and-robber-in-multidimensional-grids-0909.1381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-necessary-and-sufficient-number-of-cops-in-the-game-of-cops-and-robber-in-multidimensional-grids-0909.1381"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-distance-distribution-of-systematic-non-linear-codes-0909.1626</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-distance-distribution-of-systematic-non-linear-codes-0909.1626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-distance-distribution-of-systematic-non-linear-codes-0909.1626"/></url>
<url><loc>https://scifaro.com/en/abs/on-disjoint-matchings-in-cubic-graphs-maximum-2-and-3-edge-colorable-subgraphs-0909.2767</loc><lastmod>2014-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-disjoint-matchings-in-cubic-graphs-maximum-2-and-3-edge-colorable-subgraphs-0909.2767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-disjoint-matchings-in-cubic-graphs-maximum-2-and-3-edge-colorable-subgraphs-0909.2767"/></url>
<url><loc>https://scifaro.com/en/abs/graph-based-data-clustering-a-quadratic-vertex-problem-kernel-for-s-plex-cluster-vertex-deletion-0909.2814</loc><lastmod>2019-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-based-data-clustering-a-quadratic-vertex-problem-kernel-for-s-plex-cluster-vertex-deletion-0909.2814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-based-data-clustering-a-quadratic-vertex-problem-kernel-for-s-plex-cluster-vertex-deletion-0909.2814"/></url>
<url><loc>https://scifaro.com/en/abs/electric-routing-and-concurrent-flow-cutting-0909.2859</loc><lastmod>2009-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/electric-routing-and-concurrent-flow-cutting-0909.2859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/electric-routing-and-concurrent-flow-cutting-0909.2859"/></url>
<url><loc>https://scifaro.com/en/abs/on-ordinal-covering-of-proposals-using-balanced-incomplete-block-designs-0909.3533</loc><lastmod>2009-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-ordinal-covering-of-proposals-using-balanced-incomplete-block-designs-0909.3533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-ordinal-covering-of-proposals-using-balanced-incomplete-block-designs-0909.3533"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-hardness-of-graph-diameter-augmentation-problems-0909.3877</loc><lastmod>2009-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-hardness-of-graph-diameter-augmentation-problems-0909.3877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-hardness-of-graph-diameter-augmentation-problems-0909.3877"/></url>
<url><loc>https://scifaro.com/en/abs/periodicity-in-tilings-0909.3997</loc><lastmod>2009-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/periodicity-in-tilings-0909.3997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/periodicity-in-tilings-0909.3997"/></url>
<url><loc>https://scifaro.com/en/abs/the-group-structure-of-pivot-and-loop-complementation-on-graphs-and-set-systems-0909.4004</loc><lastmod>2014-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-group-structure-of-pivot-and-loop-complementation-on-graphs-and-set-systems-0909.4004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-group-structure-of-pivot-and-loop-complementation-on-graphs-and-set-systems-0909.4004"/></url>
<url><loc>https://scifaro.com/en/abs/a-measure-of-the-connection-strengths-between-graph-vertices-with-applications-0909.4275</loc><lastmod>2009-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-measure-of-the-connection-strengths-between-graph-vertices-with-applications-0909.4275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-measure-of-the-connection-strengths-between-graph-vertices-with-applications-0909.4275"/></url>
<url><loc>https://scifaro.com/en/abs/on-graphs-without-a-c4-or-a-diamond-0909.4719</loc><lastmod>2009-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-graphs-without-a-c4-or-a-diamond-0909.4719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-graphs-without-a-c4-or-a-diamond-0909.4719"/></url>
<url><loc>https://scifaro.com/en/abs/cartesian-product-of-hypergraphs-properties-and-algorithms-0909.5032</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cartesian-product-of-hypergraphs-properties-and-algorithms-0909.5032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cartesian-product-of-hypergraphs-properties-and-algorithms-0909.5032"/></url>
<url><loc>https://scifaro.com/en/abs/regular-matroids-with-graphic-cocircuits-0909.5033</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-matroids-with-graphic-cocircuits-0909.5033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-matroids-with-graphic-cocircuits-0909.5033"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-counting-of-graph-colourings-using-sequences-of-subgraphs-0909.5224</loc><lastmod>2020-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-counting-of-graph-colourings-using-sequences-of-subgraphs-0909.5224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-counting-of-graph-colourings-using-sequences-of-subgraphs-0909.5224"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraphic-lp-relaxations-for-steiner-trees-0910.0281</loc><lastmod>2015-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraphic-lp-relaxations-for-steiner-trees-0910.0281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraphic-lp-relaxations-for-steiner-trees-0910.0281"/></url>
<url><loc>https://scifaro.com/en/abs/statistics-on-graphs-exponential-formula-and-combinatorial-physics-0910.0695</loc><lastmod>2010-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistics-on-graphs-exponential-formula-and-combinatorial-physics-0910.0695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistics-on-graphs-exponential-formula-and-combinatorial-physics-0910.0695"/></url>
<url><loc>https://scifaro.com/en/abs/local-negative-circuits-and-fixed-points-in-boolean-networks-0910.0750</loc><lastmod>2009-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-negative-circuits-and-fixed-points-in-boolean-networks-0910.0750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-negative-circuits-and-fixed-points-in-boolean-networks-0910.0750"/></url>
<url><loc>https://scifaro.com/en/abs/dynamical-and-structural-modularity-of-discrete-regulatory-networks-0910.1412</loc><lastmod>2009-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamical-and-structural-modularity-of-discrete-regulatory-networks-0910.1412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamical-and-structural-modularity-of-discrete-regulatory-networks-0910.1412"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-sun-in-building-free-graphs-0910.1808</loc><lastmod>2009-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-sun-in-building-free-graphs-0910.1808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-sun-in-building-free-graphs-0910.1808"/></url>
<url><loc>https://scifaro.com/en/abs/on-minimal-unsatisfiability-and-time-space-trade-offs-for-k-dnf-resolution-0910.3127</loc><lastmod>2016-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-minimal-unsatisfiability-and-time-space-trade-offs-for-k-dnf-resolution-0910.3127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-minimal-unsatisfiability-and-time-space-trade-offs-for-k-dnf-resolution-0910.3127"/></url>
<url><loc>https://scifaro.com/en/abs/putting-dots-in-triangles-0910.4325</loc><lastmod>2010-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/putting-dots-in-triangles-0910.4325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/putting-dots-in-triangles-0910.4325"/></url>
<url><loc>https://scifaro.com/en/abs/wiener-index-of-binomial-trees-and-fibonacci-trees-0910.4432</loc><lastmod>2009-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wiener-index-of-binomial-trees-and-fibonacci-trees-0910.4432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wiener-index-of-binomial-trees-and-fibonacci-trees-0910.4432"/></url>
<url><loc>https://scifaro.com/en/abs/counting-independent-sets-and-kernels-of-regular-graphs-0910.4664</loc><lastmod>2009-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-independent-sets-and-kernels-of-regular-graphs-0910.4664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-independent-sets-and-kernels-of-regular-graphs-0910.4664"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-gradually-varied-functions-and-harmonic-functions-0910.5040</loc><lastmod>2009-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-gradually-varied-functions-and-harmonic-functions-0910.5040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-gradually-varied-functions-and-harmonic-functions-0910.5040"/></url>
<url><loc>https://scifaro.com/en/abs/visualizing-graphs-with-node-and-edge-labels-0911.0626</loc><lastmod>2016-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualizing-graphs-with-node-and-edge-labels-0911.0626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualizing-graphs-with-node-and-edge-labels-0911.0626"/></url>
<url><loc>https://scifaro.com/en/abs/construction-of-a-non-2-colorable-k-uniform-hypergraph-with-few-edges-0911.0900</loc><lastmod>2009-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/construction-of-a-non-2-colorable-k-uniform-hypergraph-with-few-edges-0911.0900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/construction-of-a-non-2-colorable-k-uniform-hypergraph-with-few-edges-0911.0900"/></url>
<url><loc>https://scifaro.com/en/abs/let-s-make-a-difference-0911.1004</loc><lastmod>2009-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/let-s-make-a-difference-0911.1004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/let-s-make-a-difference-0911.1004"/></url>
<url><loc>https://scifaro.com/en/abs/binary-non-tiles-0911.1388</loc><lastmod>2011-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-non-tiles-0911.1388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-non-tiles-0911.1388"/></url>
<url><loc>https://scifaro.com/en/abs/hitting-all-maximum-cliques-with-a-stable-set-using-lopsided-independent-transversals-0911.1741</loc><lastmod>2011-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hitting-all-maximum-cliques-with-a-stable-set-using-lopsided-independent-transversals-0911.1741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hitting-all-maximum-cliques-with-a-stable-set-using-lopsided-independent-transversals-0911.1741"/></url>
<url><loc>https://scifaro.com/en/abs/random-constraint-satisfaction-problems-0911.2322</loc><lastmod>2009-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-constraint-satisfaction-problems-0911.2322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-constraint-satisfaction-problems-0911.2322"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-number-theoretic-discrete-hilbert-transform-0911.2466</loc><lastmod>2009-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-number-theoretic-discrete-hilbert-transform-0911.2466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-number-theoretic-discrete-hilbert-transform-0911.2466"/></url>
<url><loc>https://scifaro.com/en/abs/boltzmann-samplers-for-colored-combinatorial-objects-0911.2801</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boltzmann-samplers-for-colored-combinatorial-objects-0911.2801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boltzmann-samplers-for-colored-combinatorial-objects-0911.2801"/></url>
<url><loc>https://scifaro.com/en/abs/boltzmann-samplers-for-v-balanced-colored-necklaces-0911.2802</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boltzmann-samplers-for-v-balanced-colored-necklaces-0911.2802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boltzmann-samplers-for-v-balanced-colored-necklaces-0911.2802"/></url>
<url><loc>https://scifaro.com/en/abs/distances-on-rhombus-tilings-0911.2804</loc><lastmod>2011-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distances-on-rhombus-tilings-0911.2804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distances-on-rhombus-tilings-0911.2804"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-partial-tiling-of-manhattan-polyominoes-0911.2805</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-partial-tiling-of-manhattan-polyominoes-0911.2805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-partial-tiling-of-manhattan-polyominoes-0911.2805"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-minimum-size-of-a-contraction-universal-tree-0911.2807</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-minimum-size-of-a-contraction-universal-tree-0911.2807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-minimum-size-of-a-contraction-universal-tree-0911.2807"/></url>
<url><loc>https://scifaro.com/en/abs/the-hardness-of-routing-two-pairs-on-one-face-0911.3024</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hardness-of-routing-two-pairs-on-one-face-0911.3024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hardness-of-routing-two-pairs-on-one-face-0911.3024"/></url>
<url><loc>https://scifaro.com/en/abs/an-inverse-method-for-policy-iteration-based-algorithms-0911.3276</loc><lastmod>2009-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-inverse-method-for-policy-iteration-based-algorithms-0911.3276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-inverse-method-for-policy-iteration-based-algorithms-0911.3276"/></url>
<url><loc>https://scifaro.com/en/abs/counting-triangulations-of-planar-point-sets-0911.3352</loc><lastmod>2010-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-triangulations-of-planar-point-sets-0911.3352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-triangulations-of-planar-point-sets-0911.3352"/></url>
<url><loc>https://scifaro.com/en/abs/markovian-network-interdiction-and-the-four-color-theorem-0911.4322</loc><lastmod>2009-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markovian-network-interdiction-and-the-four-color-theorem-0911.4322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markovian-network-interdiction-and-the-four-color-theorem-0911.4322"/></url>
<url><loc>https://scifaro.com/en/abs/interval-edge-colorings-of-some-products-of-graphs-0911.4459</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-edge-colorings-of-some-products-of-graphs-0911.4459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-edge-colorings-of-some-products-of-graphs-0911.4459"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-upper-bound-on-the-2-1-total-labeling-number-of-outerplanar-graphs-0911.4590</loc><lastmod>2009-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-upper-bound-on-the-2-1-total-labeling-number-of-outerplanar-graphs-0911.4590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-upper-bound-on-the-2-1-total-labeling-number-of-outerplanar-graphs-0911.4590"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-konig-egervary-graphs-using-a-common-property-of-all-maximum-matchings-0911.4626</loc><lastmod>2009-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-konig-egervary-graphs-using-a-common-property-of-all-maximum-matchings-0911.4626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-konig-egervary-graphs-using-a-common-property-of-all-maximum-matchings-0911.4626"/></url>
<url><loc>https://scifaro.com/en/abs/hearing-the-clusters-in-a-graph-a-distributed-algorithm-0911.4729</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hearing-the-clusters-in-a-graph-a-distributed-algorithm-0911.4729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hearing-the-clusters-in-a-graph-a-distributed-algorithm-0911.4729"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-polynomial-for-independent-sets-of-bipartite-graphs-0911.4732</loc><lastmod>2010-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-polynomial-for-independent-sets-of-bipartite-graphs-0911.4732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-polynomial-for-independent-sets-of-bipartite-graphs-0911.4732"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-in-planar-graphs-with-real-lengths-in-o-n-log-2n-log-log-n-time-0911.4963</loc><lastmod>2009-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-in-planar-graphs-with-real-lengths-in-o-n-log-2n-log-log-n-time-0911.4963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-in-planar-graphs-with-real-lengths-in-o-n-log-2n-log-log-n-time-0911.4963"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-upper-bounds-for-the-maximum-span-in-interval-edge-colorings-of-graphs-0911.5258</loc><lastmod>2009-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-upper-bounds-for-the-maximum-span-in-interval-edge-colorings-of-graphs-0911.5258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-upper-bounds-for-the-maximum-span-in-interval-edge-colorings-of-graphs-0911.5258"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-partition-functions-of-two-state-spin-systems-0911.5486</loc><lastmod>2009-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-partition-functions-of-two-state-spin-systems-0911.5486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-partition-functions-of-two-state-spin-systems-0911.5486"/></url>
<url><loc>https://scifaro.com/en/abs/max-leaves-spanning-tree-is-apx-hard-for-cubic-graphs-0912.0226</loc><lastmod>2009-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/max-leaves-spanning-tree-is-apx-hard-for-cubic-graphs-0912.0226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/max-leaves-spanning-tree-is-apx-hard-for-cubic-graphs-0912.0226"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-sampling-of-undirected-and-directed-graphs-with-a-fixed-degree-sequence-0912.0685</loc><lastmod>2010-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-sampling-of-undirected-and-directed-graphs-with-a-fixed-degree-sequence-0912.0685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-sampling-of-undirected-and-directed-graphs-with-a-fixed-degree-sequence-0912.0685"/></url>
<url><loc>https://scifaro.com/en/abs/nullity-invariance-for-pivot-and-the-interlace-polynomial-0912.0878</loc><lastmod>2014-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nullity-invariance-for-pivot-and-the-interlace-polynomial-0912.0878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nullity-invariance-for-pivot-and-the-interlace-polynomial-0912.0878"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-cycle-basis-and-all-pairs-min-cut-of-a-planar-graph-in-subquadratic-time-0912.1208</loc><lastmod>2009-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-cycle-basis-and-all-pairs-min-cut-of-a-planar-graph-in-subquadratic-time-0912.1208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-cycle-basis-and-all-pairs-min-cut-of-a-planar-graph-in-subquadratic-time-0912.1208"/></url>
<url><loc>https://scifaro.com/en/abs/subshifts-as-models-for-mso-logic-0912.1272</loc><lastmod>2013-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subshifts-as-models-for-mso-logic-0912.1272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subshifts-as-models-for-mso-logic-0912.1272"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-edge-connectivity-in-the-internet-through-core-decomposition-0912.1424</loc><lastmod>2012-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-edge-connectivity-in-the-internet-through-core-decomposition-0912.1424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-edge-connectivity-in-the-internet-through-core-decomposition-0912.1424"/></url>
<url><loc>https://scifaro.com/en/abs/good-characterization-for-path-packing-in-a-subclass-of-karzanov-networks-0912.1452</loc><lastmod>2020-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/good-characterization-for-path-packing-in-a-subclass-of-karzanov-networks-0912.1452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/good-characterization-for-path-packing-in-a-subclass-of-karzanov-networks-0912.1452"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-algorithmic-aspects-of-modular-decomposition-0912.1457</loc><lastmod>2009-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-algorithmic-aspects-of-modular-decomposition-0912.1457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-algorithmic-aspects-of-modular-decomposition-0912.1457"/></url>
<url><loc>https://scifaro.com/en/abs/subgraph-sparsification-and-nearly-optimal-ultrasparsifiers-0912.1623</loc><lastmod>2009-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subgraph-sparsification-and-nearly-optimal-ultrasparsifiers-0912.1623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subgraph-sparsification-and-nearly-optimal-ultrasparsifiers-0912.1623"/></url>
<url><loc>https://scifaro.com/en/abs/communication-complexity-and-intrinsic-universality-in-cellular-automata-0912.1777</loc><lastmod>2010-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communication-complexity-and-intrinsic-universality-in-cellular-automata-0912.1777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communication-complexity-and-intrinsic-universality-in-cellular-automata-0912.1777"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-graph-grammars-transformation-of-restrictions-0912.2160</loc><lastmod>2009-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-graph-grammars-transformation-of-restrictions-0912.2160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-graph-grammars-transformation-of-restrictions-0912.2160"/></url>
<url><loc>https://scifaro.com/en/abs/markov-modeling-of-cooperative-multiplayer-coupon-collectors-problems-0912.2523</loc><lastmod>2009-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markov-modeling-of-cooperative-multiplayer-coupon-collectors-problems-0912.2523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markov-modeling-of-cooperative-multiplayer-coupon-collectors-problems-0912.2523"/></url>
<url><loc>https://scifaro.com/en/abs/set-systems-and-families-of-permutations-with-small-traces-0912.2979</loc><lastmod>2009-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-systems-and-families-of-permutations-with-small-traces-0912.2979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-systems-and-families-of-permutations-with-small-traces-0912.2979"/></url>
<url><loc>https://scifaro.com/en/abs/graph-unique-maximum-and-conflict-free-colorings-0912.3004</loc><lastmod>2009-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-unique-maximum-and-conflict-free-colorings-0912.3004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-unique-maximum-and-conflict-free-colorings-0912.3004"/></url>
<url><loc>https://scifaro.com/en/abs/on-uniform-sampling-simple-directed-graph-realizations-of-degree-sequences-0912.3834</loc><lastmod>2009-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-uniform-sampling-simple-directed-graph-realizations-of-degree-sequences-0912.3834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-uniform-sampling-simple-directed-graph-realizations-of-degree-sequences-0912.3834"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-middle-levels-conjecture-0912.4564</loc><lastmod>2011-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-middle-levels-conjecture-0912.4564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-middle-levels-conjecture-0912.4564"/></url>
<url><loc>https://scifaro.com/en/abs/the-dense-k-subgraph-problem-0912.5327</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dense-k-subgraph-problem-0912.5327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dense-k-subgraph-problem-0912.5327"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-in-a-path-problem-for-claw-free-graphs-0912.5468</loc><lastmod>2016-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-in-a-path-problem-for-claw-free-graphs-0912.5468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-in-a-path-problem-for-claw-free-graphs-0912.5468"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-rice-theorem-of-cellular-automata-1001.0253</loc><lastmod>2011-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-rice-theorem-of-cellular-automata-1001.0253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-rice-theorem-of-cellular-automata-1001.0253"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-rational-generating-function-for-the-frobenius-coin-problem-1001.0415</loc><lastmod>2010-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-rational-generating-function-for-the-frobenius-coin-problem-1001.0415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-rational-generating-function-for-the-frobenius-coin-problem-1001.0415"/></url>
<url><loc>https://scifaro.com/en/abs/graph-constrained-group-testing-1001.1445</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-constrained-group-testing-1001.1445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-constrained-group-testing-1001.1445"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-diophantine-generator-function-for-integer-residuals-1001.2752</loc><lastmod>2010-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-diophantine-generator-function-for-integer-residuals-1001.2752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-diophantine-generator-function-for-integer-residuals-1001.2752"/></url>
<url><loc>https://scifaro.com/en/abs/on-touching-triangle-graphs-1001.2862</loc><lastmod>2010-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-touching-triangle-graphs-1001.2862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-touching-triangle-graphs-1001.2862"/></url>
<url><loc>https://scifaro.com/en/abs/strong-robustness-of-randomized-rumor-spreading-protocols-1001.3056</loc><lastmod>2013-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-robustness-of-randomized-rumor-spreading-protocols-1001.3056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-robustness-of-randomized-rumor-spreading-protocols-1001.3056"/></url>
<url><loc>https://scifaro.com/en/abs/tight-products-and-expansion-1001.3661</loc><lastmod>2012-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-products-and-expansion-1001.3661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-products-and-expansion-1001.3661"/></url>
<url><loc>https://scifaro.com/en/abs/cop-and-robber-games-when-the-robber-can-hide-and-ride-1001.4457</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cop-and-robber-games-when-the-robber-can-hide-and-ride-1001.4457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cop-and-robber-games-when-the-robber-can-hide-and-ride-1001.4457"/></url>
<url><loc>https://scifaro.com/en/abs/directional-dynamics-along-arbitrary-curves-in-cellular-automata-1001.5470</loc><lastmod>2010-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directional-dynamics-along-arbitrary-curves-in-cellular-automata-1001.5470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directional-dynamics-along-arbitrary-curves-in-cellular-automata-1001.5470"/></url>
<url><loc>https://scifaro.com/en/abs/systems-of-linear-equations-over-mathbb-f-2-and-problems-parameterized-above-average-1002.0286</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/systems-of-linear-equations-over-mathbb-f-2-and-problems-parameterized-above-average-1002.0286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/systems-of-linear-equations-over-mathbb-f-2-and-problems-parameterized-above-average-1002.0286"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-delta-edge-colorable-subgraphs-of-class-ii-graphs-1002.0783</loc><lastmod>2012-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-delta-edge-colorable-subgraphs-of-class-ii-graphs-1002.0783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-delta-edge-colorable-subgraphs-of-class-ii-graphs-1002.0783"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-mobility-a-discrete-revolution-1002.1016</loc><lastmod>2010-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-mobility-a-discrete-revolution-1002.1016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-mobility-a-discrete-revolution-1002.1016"/></url>
<url><loc>https://scifaro.com/en/abs/non-uniform-selection-of-solutions-for-upper-bounding-the-3-sat-threshold-1002.1636</loc><lastmod>2010-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-uniform-selection-of-solutions-for-upper-bounding-the-3-sat-threshold-1002.1636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-uniform-selection-of-solutions-for-upper-bounding-the-3-sat-threshold-1002.1636"/></url>
<url><loc>https://scifaro.com/en/abs/the-median-of-the-distance-between-two-leaves-in-a-phylogenetic-tree-1002.1828</loc><lastmod>2010-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-median-of-the-distance-between-two-leaves-in-a-phylogenetic-tree-1002.1828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-median-of-the-distance-between-two-leaves-in-a-phylogenetic-tree-1002.1828"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-equivalence-between-hierarchical-segmentations-and-ultrametric-watersheds-1002.1887</loc><lastmod>2011-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-equivalence-between-hierarchical-segmentations-and-ultrametric-watersheds-1002.1887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-equivalence-between-hierarchical-segmentations-and-ultrametric-watersheds-1002.1887"/></url>
<url><loc>https://scifaro.com/en/abs/partial-monoids-associativity-and-confluence-1002.2166</loc><lastmod>2010-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-monoids-associativity-and-confluence-1002.2166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-monoids-associativity-and-confluence-1002.2166"/></url>
<url><loc>https://scifaro.com/en/abs/improved-constructions-for-non-adaptive-threshold-group-testing-1002.2244</loc><lastmod>2013-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-constructions-for-non-adaptive-threshold-group-testing-1002.2244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-constructions-for-non-adaptive-threshold-group-testing-1002.2244"/></url>
<url><loc>https://scifaro.com/en/abs/generating-and-ranking-of-dyck-words-1002.2625</loc><lastmod>2010-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-and-ranking-of-dyck-words-1002.2625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-and-ranking-of-dyck-words-1002.2625"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-d-complexity-of-strings-1002.2721</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-d-complexity-of-strings-1002.2721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-d-complexity-of-strings-1002.2721"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-palindromes-in-finite-words-1002.2723</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-palindromes-in-finite-words-1002.2723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-palindromes-in-finite-words-1002.2723"/></url>
<url><loc>https://scifaro.com/en/abs/maximal-complexity-of-finite-words-1002.2724</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximal-complexity-of-finite-words-1002.2724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximal-complexity-of-finite-words-1002.2724"/></url>
<url><loc>https://scifaro.com/en/abs/the-lattice-of-embedded-subsets-1002.3814</loc><lastmod>2010-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lattice-of-embedded-subsets-1002.3814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lattice-of-embedded-subsets-1002.3814"/></url>
<url><loc>https://scifaro.com/en/abs/extended-gcd-of-quadratic-integers-1002.4487</loc><lastmod>2010-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-gcd-of-quadratic-integers-1002.4487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-gcd-of-quadratic-integers-1002.4487"/></url>
<url><loc>https://scifaro.com/en/abs/triangular-self-assembly-1002.4996</loc><lastmod>2010-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangular-self-assembly-1002.4996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangular-self-assembly-1002.4996"/></url>
<url><loc>https://scifaro.com/en/abs/low-dimensional-euclidean-volume-preserving-embeddings-1003.0511</loc><lastmod>2010-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-dimensional-euclidean-volume-preserving-embeddings-1003.0511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-dimensional-euclidean-volume-preserving-embeddings-1003.0511"/></url>
<url><loc>https://scifaro.com/en/abs/on-k-hypertournament-losing-scores-1003.1319</loc><lastmod>2010-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-k-hypertournament-losing-scores-1003.1319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-k-hypertournament-losing-scores-1003.1319"/></url>
<url><loc>https://scifaro.com/en/abs/min-st-cut-oracle-for-planar-graphs-with-near-linear-preprocessing-time-1003.1320</loc><lastmod>2013-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/min-st-cut-oracle-for-planar-graphs-with-near-linear-preprocessing-time-1003.1320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/min-st-cut-oracle-for-planar-graphs-with-near-linear-preprocessing-time-1003.1320"/></url>
<url><loc>https://scifaro.com/en/abs/coding-objects-related-to-catalan-numbers-1003.1385</loc><lastmod>2010-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coding-objects-related-to-catalan-numbers-1003.1385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coding-objects-related-to-catalan-numbers-1003.1385"/></url>
<url><loc>https://scifaro.com/en/abs/on-arc-disjoint-hamiltonian-cycles-in-de-bruijn-graphs-1003.1520</loc><lastmod>2013-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-arc-disjoint-hamiltonian-cycles-in-de-bruijn-graphs-1003.1520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-arc-disjoint-hamiltonian-cycles-in-de-bruijn-graphs-1003.1520"/></url>
<url><loc>https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-square-lattice-is-at-least-12-1003.2291</loc><lastmod>2010-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-square-lattice-is-at-least-12-1003.2291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-square-lattice-is-at-least-12-1003.2291"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-uno-1003.2851</loc><lastmod>2013-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-uno-1003.2851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-uno-1003.2851"/></url>
<url><loc>https://scifaro.com/en/abs/a-computational-approach-to-the-graceful-tree-conjecture-1003.3045</loc><lastmod>2010-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computational-approach-to-the-graceful-tree-conjecture-1003.3045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computational-approach-to-the-graceful-tree-conjecture-1003.3045"/></url>
<url><loc>https://scifaro.com/en/abs/stability-of-the-bipartite-matching-model-1003.3477</loc><lastmod>2010-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-of-the-bipartite-matching-model-1003.3477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-of-the-bipartite-matching-model-1003.3477"/></url>
<url><loc>https://scifaro.com/en/abs/k-step-relative-inductive-generalization-1003.3649</loc><lastmod>2010-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-step-relative-inductive-generalization-1003.3649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-step-relative-inductive-generalization-1003.3649"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-complete-interval-tournaments-1003.4016</loc><lastmod>2010-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-complete-interval-tournaments-1003.4016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-complete-interval-tournaments-1003.4016"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-of-hamiltonian-cycles-in-6-cube-1003.4391</loc><lastmod>2010-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-of-hamiltonian-cycles-in-6-cube-1003.4391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-of-hamiltonian-cycles-in-6-cube-1003.4391"/></url>
<url><loc>https://scifaro.com/en/abs/boltzmann-samplers-p-olya-theory-and-cycle-pointing-1003.4546</loc><lastmod>2011-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boltzmann-samplers-p-olya-theory-and-cycle-pointing-1003.4546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boltzmann-samplers-p-olya-theory-and-cycle-pointing-1003.4546"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-maximal-sum-of-exponents-of-runs-in-a-string-1003.4866</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-maximal-sum-of-exponents-of-runs-in-a-string-1003.4866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-maximal-sum-of-exponents-of-runs-in-a-string-1003.4866"/></url>
<url><loc>https://scifaro.com/en/abs/doubly-perfect-nonlinear-boolean-permutations-1003.4919</loc><lastmod>2011-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/doubly-perfect-nonlinear-boolean-permutations-1003.4919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/doubly-perfect-nonlinear-boolean-permutations-1003.4919"/></url>
<url><loc>https://scifaro.com/en/abs/seidel-complementation-on-p-5-house-bull-free-graphs-1003.5458</loc><lastmod>2010-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/seidel-complementation-on-p-5-house-bull-free-graphs-1003.5458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/seidel-complementation-on-p-5-house-bull-free-graphs-1003.5458"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-family-of-cubic-graphs-containing-the-flower-snarks-1003.5459</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-family-of-cubic-graphs-containing-the-flower-snarks-1003.5459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-family-of-cubic-graphs-containing-the-flower-snarks-1003.5459"/></url>
<url><loc>https://scifaro.com/en/abs/bricks-and-conjectures-of-berge-fulkerson-and-seymour-1003.5782</loc><lastmod>2010-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bricks-and-conjectures-of-berge-fulkerson-and-seymour-1003.5782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bricks-and-conjectures-of-berge-fulkerson-and-seymour-1003.5782"/></url>
<url><loc>https://scifaro.com/en/abs/measures-of-edge-uncolorability-1003.5783</loc><lastmod>2011-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measures-of-edge-uncolorability-1003.5783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measures-of-edge-uncolorability-1003.5783"/></url>
<url><loc>https://scifaro.com/en/abs/a-triple-error-correcting-cyclic-code-from-the-gold-and-kasami-welch-apn-power-functions-1003.5993</loc><lastmod>2010-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-triple-error-correcting-cyclic-code-from-the-gold-and-kasami-welch-apn-power-functions-1003.5993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-triple-error-correcting-cyclic-code-from-the-gold-and-kasami-welch-apn-power-functions-1003.5993"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-v-4-2-1-optical-orthogonal-codes-with-small-parameters-1003.6013</loc><lastmod>2011-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-v-4-2-1-optical-orthogonal-codes-with-small-parameters-1003.6013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-v-4-2-1-optical-orthogonal-codes-with-small-parameters-1003.6013"/></url>
<url><loc>https://scifaro.com/en/abs/a-cf-based-randomness-measure-for-sequences-1003.6069</loc><lastmod>2010-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cf-based-randomness-measure-for-sequences-1003.6069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cf-based-randomness-measure-for-sequences-1003.6069"/></url>
<url><loc>https://scifaro.com/en/abs/exact-ramsey-theory-green-tao-numbers-and-sat-1004.0653</loc><lastmod>2011-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-ramsey-theory-green-tao-numbers-and-sat-1004.0653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-ramsey-theory-green-tao-numbers-and-sat-1004.0653"/></url>
<url><loc>https://scifaro.com/en/abs/multi-shift-de-bruijn-sequence-1004.1216</loc><lastmod>2010-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-shift-de-bruijn-sequence-1004.1216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-shift-de-bruijn-sequence-1004.1216"/></url>
<url><loc>https://scifaro.com/en/abs/are-there-any-good-digraph-width-measures-1004.1485</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-there-any-good-digraph-width-measures-1004.1485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-there-any-good-digraph-width-measures-1004.1485"/></url>
<url><loc>https://scifaro.com/en/abs/belief-propagation-for-min-cost-network-flow-convergence-and-correctness-1004.1586</loc><lastmod>2016-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-propagation-for-min-cost-network-flow-convergence-and-correctness-1004.1586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-propagation-for-min-cost-network-flow-convergence-and-correctness-1004.1586"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-bias-of-bfs-1004.1729</loc><lastmod>2011-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-bias-of-bfs-1004.1729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-bias-of-bfs-1004.1729"/></url>
<url><loc>https://scifaro.com/en/abs/k-edge-connectivity-approximation-and-lp-relaxation-1004.1917</loc><lastmod>2010-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-edge-connectivity-approximation-and-lp-relaxation-1004.1917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-edge-connectivity-approximation-and-lp-relaxation-1004.1917"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-vertices-in-trees-and-a-simpler-algorithm-to-compute-the-genomic-distance-1004.2735</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-vertices-in-trees-and-a-simpler-algorithm-to-compute-the-genomic-distance-1004.2735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-vertices-in-trees-and-a-simpler-algorithm-to-compute-the-genomic-distance-1004.2735"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-the-capacitated-domination-problem-1004.2839</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-capacitated-domination-problem-1004.2839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-capacitated-domination-problem-1004.2839"/></url>
<url><loc>https://scifaro.com/en/abs/on-factor-universality-in-symbolic-spaces-1004.3458</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-factor-universality-in-symbolic-spaces-1004.3458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-factor-universality-in-symbolic-spaces-1004.3458"/></url>
<url><loc>https://scifaro.com/en/abs/on-two-variations-of-identifying-codes-1004.4063</loc><lastmod>2011-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-two-variations-of-identifying-codes-1004.4063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-two-variations-of-identifying-codes-1004.4063"/></url>
<url><loc>https://scifaro.com/en/abs/graph-triangulations-and-the-compatibility-of-unrooted-phylogenetic-trees-1004.4196</loc><lastmod>2010-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-triangulations-and-the-compatibility-of-unrooted-phylogenetic-trees-1004.4196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-triangulations-and-the-compatibility-of-unrooted-phylogenetic-trees-1004.4196"/></url>
<url><loc>https://scifaro.com/en/abs/average-case-performance-of-heuristics-for-multi-dimensional-assignment-problems-1004.4239</loc><lastmod>2010-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-case-performance-of-heuristics-for-multi-dimensional-assignment-problems-1004.4239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-case-performance-of-heuristics-for-multi-dimensional-assignment-problems-1004.4239"/></url>
<url><loc>https://scifaro.com/en/abs/determining-edge-expansion-and-other-connectivity-measures-of-graphs-of-bounded-genus-1004.4484</loc><lastmod>2010-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determining-edge-expansion-and-other-connectivity-measures-of-graphs-of-bounded-genus-1004.4484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determining-edge-expansion-and-other-connectivity-measures-of-graphs-of-bounded-genus-1004.4484"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-polynomial-algorithm-for-the-longest-path-problem-on-cocomparability-graphs-1004.4560</loc><lastmod>2010-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-polynomial-algorithm-for-the-longest-path-problem-on-cocomparability-graphs-1004.4560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-polynomial-algorithm-for-the-longest-path-problem-on-cocomparability-graphs-1004.4560"/></url>
<url><loc>https://scifaro.com/en/abs/when-g-2-is-a-konig-egervary-graph-1004.4804</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-g-2-is-a-konig-egervary-graph-1004.4804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-g-2-is-a-konig-egervary-graph-1004.4804"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-geometric-analysis-of-message-passing-algorithm-on-graphs-1004.4942</loc><lastmod>2011-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-geometric-analysis-of-message-passing-algorithm-on-graphs-1004.4942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-geometric-analysis-of-message-passing-algorithm-on-graphs-1004.4942"/></url>
<url><loc>https://scifaro.com/en/abs/extremal-graphs-for-the-identifying-code-problem-1004.5230</loc><lastmod>2011-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extremal-graphs-for-the-identifying-code-problem-1004.5230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extremal-graphs-for-the-identifying-code-problem-1004.5230"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-b-perfect-graphs-1004.5306</loc><lastmod>2012-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-b-perfect-graphs-1004.5306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-b-perfect-graphs-1004.5306"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-oligo-nucleotide-arrays-methods-to-reduce-manufacture-time-and-cost-1004.5436</loc><lastmod>2010-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-oligo-nucleotide-arrays-methods-to-reduce-manufacture-time-and-cost-1004.5436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-oligo-nucleotide-arrays-methods-to-reduce-manufacture-time-and-cost-1004.5436"/></url>
<url><loc>https://scifaro.com/en/abs/watching-systems-in-graphs-an-extension-of-identifying-codes-1005.0765</loc><lastmod>2010-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/watching-systems-in-graphs-an-extension-of-identifying-codes-1005.0765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/watching-systems-in-graphs-an-extension-of-identifying-codes-1005.0765"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-relation-between-the-integral-image-algorithm-and-calculus-1005.1418</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-relation-between-the-integral-image-algorithm-and-calculus-1005.1418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-relation-between-the-integral-image-algorithm-and-calculus-1005.1418"/></url>
<url><loc>https://scifaro.com/en/abs/3-2-firefighters-are-not-enough-1005.1694</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3-2-firefighters-are-not-enough-1005.1694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3-2-firefighters-are-not-enough-1005.1694"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-algebraic-technique-for-polynomial-time-computing-the-number-modulo-2-of-hamiltonian-decompositions-and-similar-partitions-of-a-graph-s-edge-set-1005.2281</loc><lastmod>2010-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-algebraic-technique-for-polynomial-time-computing-the-number-modulo-2-of-hamiltonian-decompositions-and-similar-partitions-of-a-graph-s-edge-set-1005.2281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-algebraic-technique-for-polynomial-time-computing-the-number-modulo-2-of-hamiltonian-decompositions-and-similar-partitions-of-a-graph-s-edge-set-1005.2281"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-roof-duality-and-bisubmodular-functions-1005.2305</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-roof-duality-and-bisubmodular-functions-1005.2305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-roof-duality-and-bisubmodular-functions-1005.2305"/></url>
<url><loc>https://scifaro.com/en/abs/split-digraphs-1005.2452</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/split-digraphs-1005.2452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/split-digraphs-1005.2452"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-concentration-of-submodular-functions-1005.2791</loc><lastmod>2010-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-concentration-of-submodular-functions-1005.2791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-concentration-of-submodular-functions-1005.2791"/></url>
<url><loc>https://scifaro.com/en/abs/upper-oriented-chromatic-number-of-undirected-graphs-and-oriented-colorings-of-product-graphs-1005.2816</loc><lastmod>2010-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-oriented-chromatic-number-of-undirected-graphs-and-oriented-colorings-of-product-graphs-1005.2816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-oriented-chromatic-number-of-undirected-graphs-and-oriented-colorings-of-product-graphs-1005.2816"/></url>
<url><loc>https://scifaro.com/en/abs/an-lp-with-integrality-gap-1-epsilon-for-multidimensional-knapsack-1005.3324</loc><lastmod>2011-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-lp-with-integrality-gap-1-epsilon-for-multidimensional-knapsack-1005.3324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-lp-with-integrality-gap-1-epsilon-for-multidimensional-knapsack-1005.3324"/></url>
<url><loc>https://scifaro.com/en/abs/estimating-satisfiability-1005.4518</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimating-satisfiability-1005.4518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimating-satisfiability-1005.4518"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-golomb-ruler-construction-1005.5395</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-golomb-ruler-construction-1005.5395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-golomb-ruler-construction-1005.5395"/></url>
<url><loc>https://scifaro.com/en/abs/component-evolution-in-general-random-intersection-graphs-1005.5475</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/component-evolution-in-general-random-intersection-graphs-1005.5475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/component-evolution-in-general-random-intersection-graphs-1005.5475"/></url>
<url><loc>https://scifaro.com/en/abs/controlled-non-uniform-random-generation-of-decomposable-structures-1006.0423</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlled-non-uniform-random-generation-of-decomposable-structures-1006.0423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlled-non-uniform-random-generation-of-decomposable-structures-1006.0423"/></url>
<url><loc>https://scifaro.com/en/abs/on-cycles-through-two-arcs-in-strong-multipartite-tournaments-1006.0902</loc><lastmod>2010-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cycles-through-two-arcs-in-strong-multipartite-tournaments-1006.0902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cycles-through-two-arcs-in-strong-multipartite-tournaments-1006.0902"/></url>
<url><loc>https://scifaro.com/en/abs/multiobjective-decomposition-of-integer-matrices-application-to-radiotherapy-1006.1031</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiobjective-decomposition-of-integer-matrices-application-to-radiotherapy-1006.1031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiobjective-decomposition-of-integer-matrices-application-to-radiotherapy-1006.1031"/></url>
<url><loc>https://scifaro.com/en/abs/correction-to-generalized-self-shrinking-generator-1006.1249</loc><lastmod>2010-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correction-to-generalized-self-shrinking-generator-1006.1249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correction-to-generalized-self-shrinking-generator-1006.1249"/></url>
<url><loc>https://scifaro.com/en/abs/a-construction-for-the-hat-problem-on-a-directed-graph-1006.1587</loc><lastmod>2013-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-construction-for-the-hat-problem-on-a-directed-graph-1006.1587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-construction-for-the-hat-problem-on-a-directed-graph-1006.1587"/></url>
<url><loc>https://scifaro.com/en/abs/integrality-gap-of-the-hypergraphic-relaxation-of-steiner-trees-a-short-proof-of-a-1-55-upper-bound-1006.2249</loc><lastmod>2010-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrality-gap-of-the-hypergraphic-relaxation-of-steiner-trees-a-short-proof-of-a-1-55-upper-bound-1006.2249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrality-gap-of-the-hypergraphic-relaxation-of-steiner-trees-a-short-proof-of-a-1-55-upper-bound-1006.2249"/></url>
<url><loc>https://scifaro.com/en/abs/monotonic-mappings-invariant-linearisation-of-finite-posets-1006.2679</loc><lastmod>2010-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotonic-mappings-invariant-linearisation-of-finite-posets-1006.2679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotonic-mappings-invariant-linearisation-of-finite-posets-1006.2679"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-generate-an-object-under-an-ordinary-boltzmann-distribution-via-an-exponential-boltzmann-sampler-1006.2902</loc><lastmod>2010-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-generate-an-object-under-an-ordinary-boltzmann-distribution-via-an-exponential-boltzmann-sampler-1006.2902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-generate-an-object-under-an-ordinary-boltzmann-distribution-via-an-exponential-boltzmann-sampler-1006.2902"/></url>
<url><loc>https://scifaro.com/en/abs/extended-core-and-choosability-of-a-graph-1006.2958</loc><lastmod>2010-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-core-and-choosability-of-a-graph-1006.2958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-core-and-choosability-of-a-graph-1006.2958"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-search-tree-algorithms-for-parameterized-cograph-deletion-efficient-branching-rules-by-exploiting-structures-of-special-graph-classes-1006.3020</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-search-tree-algorithms-for-parameterized-cograph-deletion-efficient-branching-rules-by-exploiting-structures-of-special-graph-classes-1006.3020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-search-tree-algorithms-for-parameterized-cograph-deletion-efficient-branching-rules-by-exploiting-structures-of-special-graph-classes-1006.3020"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-thresholds-for-k-cnf-formula-with-bounded-variable-intersections-1006.3030</loc><lastmod>2010-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-thresholds-for-k-cnf-formula-with-bounded-variable-intersections-1006.3030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-thresholds-for-k-cnf-formula-with-bounded-variable-intersections-1006.3030"/></url>
<url><loc>https://scifaro.com/en/abs/sequences-bent-functions-and-jacobsthal-sums-1006.3112</loc><lastmod>2010-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequences-bent-functions-and-jacobsthal-sums-1006.3112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequences-bent-functions-and-jacobsthal-sums-1006.3112"/></url>
<url><loc>https://scifaro.com/en/abs/tree-width-of-hypergraphs-and-surface-duality-1006.3167</loc><lastmod>2011-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-width-of-hypergraphs-and-surface-duality-1006.3167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-width-of-hypergraphs-and-surface-duality-1006.3167"/></url>
<url><loc>https://scifaro.com/en/abs/the-cover-time-of-deterministic-random-walks-1006.3430</loc><lastmod>2010-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cover-time-of-deterministic-random-walks-1006.3430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cover-time-of-deterministic-random-walks-1006.3430"/></url>
<url><loc>https://scifaro.com/en/abs/new-modelling-technique-for-aperiodic-sampling-linear-systems-1006.3442</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-modelling-technique-for-aperiodic-sampling-linear-systems-1006.3442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-modelling-technique-for-aperiodic-sampling-linear-systems-1006.3442"/></url>
<url><loc>https://scifaro.com/en/abs/an-external-description-for-mimo-systems-sampled-in-an-aperiodic-way-1006.3455</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-external-description-for-mimo-systems-sampled-in-an-aperiodic-way-1006.3455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-external-description-for-mimo-systems-sampled-in-an-aperiodic-way-1006.3455"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-concentration-of-the-number-of-solutions-of-random-satisfiability-formulas-1006.3786</loc><lastmod>2010-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-concentration-of-the-number-of-solutions-of-random-satisfiability-formulas-1006.3786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-concentration-of-the-number-of-solutions-of-random-satisfiability-formulas-1006.3786"/></url>
<url><loc>https://scifaro.com/en/abs/characterisation-of-observability-and-controllability-for-nonuniformly-sampled-discrete-systems-1006.4288</loc><lastmod>2010-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterisation-of-observability-and-controllability-for-nonuniformly-sampled-discrete-systems-1006.4288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterisation-of-observability-and-controllability-for-nonuniformly-sampled-discrete-systems-1006.4288"/></url>
<url><loc>https://scifaro.com/en/abs/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-1006.5621</loc><lastmod>2010-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-1006.5621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-1006.5621"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-chip-firing-game-associated-with-n-cube-orientations-1007.0381</loc><lastmod>2010-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-chip-firing-game-associated-with-n-cube-orientations-1007.0381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-chip-firing-game-associated-with-n-cube-orientations-1007.0381"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-higher-dimensional-tarai-functions-1007.0467</loc><lastmod>2011-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-higher-dimensional-tarai-functions-1007.0467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-higher-dimensional-tarai-functions-1007.0467"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-independence-polynomial-of-an-antiregular-graph-1007.0880</loc><lastmod>2010-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-independence-polynomial-of-an-antiregular-graph-1007.0880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-independence-polynomial-of-an-antiregular-graph-1007.0880"/></url>
<url><loc>https://scifaro.com/en/abs/submodularity-on-a-tree-unifying-l-natural-convex-and-bisubmodular-functions-1007.1229</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submodularity-on-a-tree-unifying-l-natural-convex-and-bisubmodular-functions-1007.1229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submodularity-on-a-tree-unifying-l-natural-convex-and-bisubmodular-functions-1007.1229"/></url>
<url><loc>https://scifaro.com/en/abs/from-pathwidth-to-connected-pathwidth-1007.1269</loc><lastmod>2021-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-pathwidth-to-connected-pathwidth-1007.1269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-pathwidth-to-connected-pathwidth-1007.1269"/></url>
<url><loc>https://scifaro.com/en/abs/on-independent-sets-in-random-graphs-1007.1378</loc><lastmod>2017-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-independent-sets-in-random-graphs-1007.1378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-independent-sets-in-random-graphs-1007.1378"/></url>
<url><loc>https://scifaro.com/en/abs/infectious-random-walks-1007.1604</loc><lastmod>2011-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infectious-random-walks-1007.1604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infectious-random-walks-1007.1604"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-interval-edge-colorings-of-graphs-1007.1717</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-interval-edge-colorings-of-graphs-1007.1717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-interval-edge-colorings-of-graphs-1007.1717"/></url>
<url><loc>https://scifaro.com/en/abs/bin-packing-via-discrepancy-of-permutations-1007.2170</loc><lastmod>2012-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bin-packing-via-discrepancy-of-permutations-1007.2170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bin-packing-via-discrepancy-of-permutations-1007.2170"/></url>
<url><loc>https://scifaro.com/en/abs/acyclic-edge-coloring-of-triangle-free-planar-graphs-1007.2282</loc><lastmod>2010-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclic-edge-coloring-of-triangle-free-planar-graphs-1007.2282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclic-edge-coloring-of-triangle-free-planar-graphs-1007.2282"/></url>
<url><loc>https://scifaro.com/en/abs/extension-of-stanley-s-theorem-for-partitions-1007.3459</loc><lastmod>2010-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extension-of-stanley-s-theorem-for-partitions-1007.3459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extension-of-stanley-s-theorem-for-partitions-1007.3459"/></url>
<url><loc>https://scifaro.com/en/abs/min-st-cut-of-a-planar-graph-in-o-n-loglog-n-time-1007.3609</loc><lastmod>2010-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/min-st-cut-of-a-planar-graph-in-o-n-loglog-n-time-1007.3609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/min-st-cut-of-a-planar-graph-in-o-n-loglog-n-time-1007.3609"/></url>
<url><loc>https://scifaro.com/en/abs/the-multiobjective-multidimensional-knapsack-problem-a-survey-and-a-new-approach-1007.4063</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-multiobjective-multidimensional-knapsack-problem-a-survey-and-a-new-approach-1007.4063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-multiobjective-multidimensional-knapsack-problem-a-survey-and-a-new-approach-1007.4063"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-monopolies-with-randomized-starting-configuration-1007.4154</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-monopolies-with-randomized-starting-configuration-1007.4154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-monopolies-with-randomized-starting-configuration-1007.4154"/></url>
<url><loc>https://scifaro.com/en/abs/the-multiple-permutation-problem-and-some-conjectures-1007.4663</loc><lastmod>2010-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-multiple-permutation-problem-and-some-conjectures-1007.4663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-multiple-permutation-problem-and-some-conjectures-1007.4663"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-base-encodings-for-pseudo-boolean-constraints-1007.4935</loc><lastmod>2011-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-base-encodings-for-pseudo-boolean-constraints-1007.4935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-base-encodings-for-pseudo-boolean-constraints-1007.4935"/></url>
<url><loc>https://scifaro.com/en/abs/faster-shortest-path-algorithm-for-h-minor-free-graphs-with-negative-edge-weights-1008.1048</loc><lastmod>2010-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-shortest-path-algorithm-for-h-minor-free-graphs-with-negative-edge-weights-1008.1048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-shortest-path-algorithm-for-h-minor-free-graphs-with-negative-edge-weights-1008.1048"/></url>
<url><loc>https://scifaro.com/en/abs/structure-of-random-r-sat-below-the-pure-literal-threshold-1008.1260</loc><lastmod>2010-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-of-random-r-sat-below-the-pure-literal-threshold-1008.1260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-of-random-r-sat-below-the-pure-literal-threshold-1008.1260"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-translates-and-homothets-of-a-convex-body-1008.1360</loc><lastmod>2010-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-translates-and-homothets-of-a-convex-body-1008.1360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-translates-and-homothets-of-a-convex-body-1008.1360"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-analysis-of-influence-spread-in-social-networks-1008.2005</loc><lastmod>2011-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-analysis-of-influence-spread-in-social-networks-1008.2005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-analysis-of-influence-spread-in-social-networks-1008.2005"/></url>
<url><loc>https://scifaro.com/en/abs/flow-cut-gaps-for-integer-and-fractional-multiflows-1008.2136</loc><lastmod>2010-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flow-cut-gaps-for-integer-and-fractional-multiflows-1008.2136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flow-cut-gaps-for-integer-and-fractional-multiflows-1008.2136"/></url>
<url><loc>https://scifaro.com/en/abs/the-overlap-number-of-a-graph-1008.2170</loc><lastmod>2010-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-overlap-number-of-a-graph-1008.2170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-overlap-number-of-a-graph-1008.2170"/></url>
<url><loc>https://scifaro.com/en/abs/fastest-mixing-markov-chain-on-symmetric-k-partite-network-1008.2588</loc><lastmod>2010-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fastest-mixing-markov-chain-on-symmetric-k-partite-network-1008.2588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fastest-mixing-markov-chain-on-symmetric-k-partite-network-1008.2588"/></url>
<url><loc>https://scifaro.com/en/abs/very-well-covered-graphs-of-girth-at-least-four-and-local-maximum-stable-set-greedoids-1008.2897</loc><lastmod>2010-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/very-well-covered-graphs-of-girth-at-least-four-and-local-maximum-stable-set-greedoids-1008.2897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/very-well-covered-graphs-of-girth-at-least-four-and-local-maximum-stable-set-greedoids-1008.2897"/></url>
<url><loc>https://scifaro.com/en/abs/on-minimum-vertex-cover-of-generalized-petersen-graphs-1008.3208</loc><lastmod>2010-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-minimum-vertex-cover-of-generalized-petersen-graphs-1008.3208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-minimum-vertex-cover-of-generalized-petersen-graphs-1008.3208"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-signed-edge-domination-number-of-graphs-1008.3217</loc><lastmod>2010-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-signed-edge-domination-number-of-graphs-1008.3217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-signed-edge-domination-number-of-graphs-1008.3217"/></url>
<url><loc>https://scifaro.com/en/abs/on-disjoint-paths-in-acyclic-planar-graphs-1008.3652</loc><lastmod>2010-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-disjoint-paths-in-acyclic-planar-graphs-1008.3652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-disjoint-paths-in-acyclic-planar-graphs-1008.3652"/></url>
<url><loc>https://scifaro.com/en/abs/congestion-in-planar-graphs-with-demands-on-faces-1008.3653</loc><lastmod>2010-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/congestion-in-planar-graphs-with-demands-on-faces-1008.3653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/congestion-in-planar-graphs-with-demands-on-faces-1008.3653"/></url>
<url><loc>https://scifaro.com/en/abs/doubly-exponential-solution-for-randomized-load-balancing-models-with-general-service-times-1008.3788</loc><lastmod>2010-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/doubly-exponential-solution-for-randomized-load-balancing-models-with-general-service-times-1008.3788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/doubly-exponential-solution-for-randomized-load-balancing-models-with-general-service-times-1008.3788"/></url>
<url><loc>https://scifaro.com/en/abs/a-sharp-lower-bound-for-the-wiener-index-of-a-graph-1008.4039</loc><lastmod>2010-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sharp-lower-bound-for-the-wiener-index-of-a-graph-1008.4039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sharp-lower-bound-for-the-wiener-index-of-a-graph-1008.4039"/></url>
<url><loc>https://scifaro.com/en/abs/random-road-networks-the-quadtree-model-1008.4916</loc><lastmod>2011-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-road-networks-the-quadtree-model-1008.4916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-road-networks-the-quadtree-model-1008.4916"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-source-single-sink-maximum-flow-in-a-planar-graph-1008.4966</loc><lastmod>2010-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-source-single-sink-maximum-flow-in-a-planar-graph-1008.4966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-source-single-sink-maximum-flow-in-a-planar-graph-1008.4966"/></url>
<url><loc>https://scifaro.com/en/abs/structural-properties-of-1-planar-graphs-and-an-application-to-acyclic-edge-coloring-1008.5000</loc><lastmod>2011-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-properties-of-1-planar-graphs-and-an-application-to-acyclic-edge-coloring-1008.5000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-properties-of-1-planar-graphs-and-an-application-to-acyclic-edge-coloring-1008.5000"/></url>
<url><loc>https://scifaro.com/en/abs/on-graph-classes-with-logarithmic-boolean-width-1009.0216</loc><lastmod>2011-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-graph-classes-with-logarithmic-boolean-width-1009.0216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-graph-classes-with-logarithmic-boolean-width-1009.0216"/></url>
<url><loc>https://scifaro.com/en/abs/conductance-and-eigenvalue-1009.1756</loc><lastmod>2010-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conductance-and-eigenvalue-1009.1756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conductance-and-eigenvalue-1009.1756"/></url>
<url><loc>https://scifaro.com/en/abs/consistent-digital-line-segments-1009.2142</loc><lastmod>2010-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistent-digital-line-segments-1009.2142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistent-digital-line-segments-1009.2142"/></url>
<url><loc>https://scifaro.com/en/abs/influence-is-a-matter-of-degree-new-algorithms-for-activation-problems-1009.3619</loc><lastmod>2010-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/influence-is-a-matter-of-degree-new-algorithms-for-activation-problems-1009.3619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/influence-is-a-matter-of-degree-new-algorithms-for-activation-problems-1009.3619"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-sequence-submodular-functions-and-its-application-to-online-advertising-1009.4153</loc><lastmod>2019-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-sequence-submodular-functions-and-its-application-to-online-advertising-1009.4153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-sequence-submodular-functions-and-its-application-to-online-advertising-1009.4153"/></url>
<url><loc>https://scifaro.com/en/abs/finite-symmetric-functions-with-non-trivial-arity-gap-1009.4828</loc><lastmod>2013-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-symmetric-functions-with-non-trivial-arity-gap-1009.4828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-symmetric-functions-with-non-trivial-arity-gap-1009.4828"/></url>
<url><loc>https://scifaro.com/en/abs/doubly-exponential-solution-for-randomized-load-balancing-models-with-markovian-arrival-processes-and-ph-service-times-1009.4970</loc><lastmod>2010-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/doubly-exponential-solution-for-randomized-load-balancing-models-with-markovian-arrival-processes-and-ph-service-times-1009.4970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/doubly-exponential-solution-for-randomized-load-balancing-models-with-markovian-arrival-processes-and-ph-service-times-1009.4970"/></url>
<url><loc>https://scifaro.com/en/abs/second-moment-method-on-k-sat-a-general-framework-1009.5588</loc><lastmod>2010-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-moment-method-on-k-sat-a-general-framework-1009.5588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-moment-method-on-k-sat-a-general-framework-1009.5588"/></url>
<url><loc>https://scifaro.com/en/abs/clandestine-simulations-in-cellular-automata-1009.5621</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clandestine-simulations-in-cellular-automata-1009.5621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clandestine-simulations-in-cellular-automata-1009.5621"/></url>
<url><loc>https://scifaro.com/en/abs/a-stronger-result-on-fractional-strong-colourings-1010.0032</loc><lastmod>2014-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-stronger-result-on-fractional-strong-colourings-1010.0032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-stronger-result-on-fractional-strong-colourings-1010.0032"/></url>
<url><loc>https://scifaro.com/en/abs/improved-methods-for-generating-quasi-gray-codes-1010.0905</loc><lastmod>2010-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-methods-for-generating-quasi-gray-codes-1010.0905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-methods-for-generating-quasi-gray-codes-1010.0905"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-avalanches-in-the-kadanoff-two-dimensional-sandpile-model-1010.1416</loc><lastmod>2010-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-avalanches-in-the-kadanoff-two-dimensional-sandpile-model-1010.1416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-avalanches-in-the-kadanoff-two-dimensional-sandpile-model-1010.1416"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-solutions-of-the-discretizable-molecular-distance-geometry-problem-1010.1834</loc><lastmod>2010-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-solutions-of-the-discretizable-molecular-distance-geometry-problem-1010.1834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-solutions-of-the-discretizable-molecular-distance-geometry-problem-1010.1834"/></url>
<url><loc>https://scifaro.com/en/abs/submodular-problems-approximations-and-algorithms-1010.1945</loc><lastmod>2017-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submodular-problems-approximations-and-algorithms-1010.1945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submodular-problems-approximations-and-algorithms-1010.1945"/></url>
<url><loc>https://scifaro.com/en/abs/coxeter-groups-and-asynchronous-cellular-automata-1010.1955</loc><lastmod>2010-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coxeter-groups-and-asynchronous-cellular-automata-1010.1955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coxeter-groups-and-asynchronous-cellular-automata-1010.1955"/></url>
<url><loc>https://scifaro.com/en/abs/three-coloring-triangle-free-graphs-on-surfaces-i-extending-a-coloring-to-a-disk-with-one-triangle-1010.2472</loc><lastmod>2017-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-coloring-triangle-free-graphs-on-surfaces-i-extending-a-coloring-to-a-disk-with-one-triangle-1010.2472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-coloring-triangle-free-graphs-on-surfaces-i-extending-a-coloring-to-a-disk-with-one-triangle-1010.2472"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-extremal-digraphs-for-identifying-codes-and-extremal-cases-of-bondy-s-theorem-on-induced-subsets-1010.2985</loc><lastmod>2013-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-extremal-digraphs-for-identifying-codes-and-extremal-cases-of-bondy-s-theorem-on-induced-subsets-1010.2985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-extremal-digraphs-for-identifying-codes-and-extremal-cases-of-bondy-s-theorem-on-induced-subsets-1010.2985"/></url>
<url><loc>https://scifaro.com/en/abs/interval-total-colorings-of-graphs-1010.2989</loc><lastmod>2010-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-total-colorings-of-graphs-1010.2989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-total-colorings-of-graphs-1010.2989"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-laplace-beltrami-operator-determines-discrete-riemannian-metric-1010.4070</loc><lastmod>2010-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-laplace-beltrami-operator-determines-discrete-riemannian-metric-1010.4070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-laplace-beltrami-operator-determines-discrete-riemannian-metric-1010.4070"/></url>
<url><loc>https://scifaro.com/en/abs/locally-identifying-coloring-of-graphs-1010.5624</loc><lastmod>2015-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locally-identifying-coloring-of-graphs-1010.5624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locally-identifying-coloring-of-graphs-1010.5624"/></url>
<url><loc>https://scifaro.com/en/abs/on-variables-with-few-occurrences-in-conjunctive-normal-forms-1010.5756</loc><lastmod>2014-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-variables-with-few-occurrences-in-conjunctive-normal-forms-1010.5756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-variables-with-few-occurrences-in-conjunctive-normal-forms-1010.5756"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-size-of-identifying-codes-in-triangle-free-graphs-1010.5975</loc><lastmod>2012-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-size-of-identifying-codes-in-triangle-free-graphs-1010.5975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-size-of-identifying-codes-in-triangle-free-graphs-1010.5975"/></url>
<url><loc>https://scifaro.com/en/abs/golden-and-alternating-fast-simple-o-lg-n-algorithms-for-fibonacci-1011.0148</loc><lastmod>2010-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/golden-and-alternating-fast-simple-o-lg-n-algorithms-for-fibonacci-1011.0148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/golden-and-alternating-fast-simple-o-lg-n-algorithms-for-fibonacci-1011.0148"/></url>
<url><loc>https://scifaro.com/en/abs/the-fractal-structure-of-cellular-automata-on-abelian-groups-1011.0313</loc><lastmod>2010-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fractal-structure-of-cellular-automata-on-abelian-groups-1011.0313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fractal-structure-of-cellular-automata-on-abelian-groups-1011.0313"/></url>
<url><loc>https://scifaro.com/en/abs/a-path-algebra-for-multi-relational-graphs-1011.0390</loc><lastmod>2011-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-path-algebra-for-multi-relational-graphs-1011.0390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-path-algebra-for-multi-relational-graphs-1011.0390"/></url>
<url><loc>https://scifaro.com/en/abs/stability-number-and-f-factors-in-graphs-1011.0636</loc><lastmod>2010-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-number-and-f-factors-in-graphs-1011.0636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-number-and-f-factors-in-graphs-1011.0636"/></url>
<url><loc>https://scifaro.com/en/abs/on-reversible-cascades-in-scale-free-and-erd-h-o-s-r-enyi-random-graphs-1011.0653</loc><lastmod>2010-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-reversible-cascades-in-scale-free-and-erd-h-o-s-r-enyi-random-graphs-1011.0653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-reversible-cascades-in-scale-free-and-erd-h-o-s-r-enyi-random-graphs-1011.0653"/></url>
<url><loc>https://scifaro.com/en/abs/on-packing-colorings-of-distance-graphs-1011.0971</loc><lastmod>2014-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-packing-colorings-of-distance-graphs-1011.0971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-packing-colorings-of-distance-graphs-1011.0971"/></url>
<url><loc>https://scifaro.com/en/abs/an-entropy-based-proof-of-the-moore-bound-for-irregular-graphs-1011.1058</loc><lastmod>2010-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-entropy-based-proof-of-the-moore-bound-for-irregular-graphs-1011.1058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-entropy-based-proof-of-the-moore-bound-for-irregular-graphs-1011.1058"/></url>
<url><loc>https://scifaro.com/en/abs/shortened-hamming-codes-maximizing-double-error-detection-1011.1933</loc><lastmod>2011-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortened-hamming-codes-maximizing-double-error-detection-1011.1933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortened-hamming-codes-maximizing-double-error-detection-1011.1933"/></url>
<url><loc>https://scifaro.com/en/abs/catalan-structures-and-catalan-pairs-1011.3708</loc><lastmod>2010-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/catalan-structures-and-catalan-pairs-1011.3708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/catalan-structures-and-catalan-pairs-1011.3708"/></url>
<url><loc>https://scifaro.com/en/abs/dynamics-in-parallel-of-double-boolean-automata-circuits-1011.3930</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamics-in-parallel-of-double-boolean-automata-circuits-1011.3930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamics-in-parallel-of-double-boolean-automata-circuits-1011.3930"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-enumerating-and-counting-d2cs-of-some-graphs-1011.4550</loc><lastmod>2010-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-enumerating-and-counting-d2cs-of-some-graphs-1011.4550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-enumerating-and-counting-d2cs-of-some-graphs-1011.4550"/></url>
<url><loc>https://scifaro.com/en/abs/nonlinear-threshold-boolean-automata-networks-and-phase-transitions-1011.4675</loc><lastmod>2010-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonlinear-threshold-boolean-automata-networks-and-phase-transitions-1011.4675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonlinear-threshold-boolean-automata-networks-and-phase-transitions-1011.4675"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-configuration-lp-for-scheduling-on-unrelated-machines-1011.4957</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-configuration-lp-for-scheduling-on-unrelated-machines-1011.4957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-configuration-lp-for-scheduling-on-unrelated-machines-1011.4957"/></url>
<url><loc>https://scifaro.com/en/abs/wheel-random-apollonian-graphs-1011.5264</loc><lastmod>2010-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wheel-random-apollonian-graphs-1011.5264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wheel-random-apollonian-graphs-1011.5264"/></url>
<url><loc>https://scifaro.com/en/abs/on-conditional-coloring-of-some-graphs-1011.5289</loc><lastmod>2010-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-conditional-coloring-of-some-graphs-1011.5289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-conditional-coloring-of-some-graphs-1011.5289"/></url>
<url><loc>https://scifaro.com/en/abs/on-z-factorization-and-c-factorization-of-standard-episturmian-words-1011.5971</loc><lastmod>2010-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-z-factorization-and-c-factorization-of-standard-episturmian-words-1011.5971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-z-factorization-and-c-factorization-of-standard-episturmian-words-1011.5971"/></url>
<url><loc>https://scifaro.com/en/abs/score-lists-in-multipartite-hypertournaments-1012.0034</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/score-lists-in-multipartite-hypertournaments-1012.0034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/score-lists-in-multipartite-hypertournaments-1012.0034"/></url>
<url><loc>https://scifaro.com/en/abs/some-fascinating-series-and-their-sums-1012.0122</loc><lastmod>2010-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-fascinating-series-and-their-sums-1012.0122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-fascinating-series-and-their-sums-1012.0122"/></url>
<url><loc>https://scifaro.com/en/abs/middle-and-ripple-fast-simple-o-lg-n-algorithms-for-lucas-numbers-1012.0284</loc><lastmod>2010-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/middle-and-ripple-fast-simple-o-lg-n-algorithms-for-lucas-numbers-1012.0284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/middle-and-ripple-fast-simple-o-lg-n-algorithms-for-lucas-numbers-1012.0284"/></url>
<url><loc>https://scifaro.com/en/abs/counting-plane-graphs-flippability-and-its-applications-1012.0591</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-plane-graphs-flippability-and-its-applications-1012.0591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-plane-graphs-flippability-and-its-applications-1012.0591"/></url>
<url><loc>https://scifaro.com/en/abs/yet-another-aperiodic-tile-set-1012.1128</loc><lastmod>2010-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/yet-another-aperiodic-tile-set-1012.1128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/yet-another-aperiodic-tile-set-1012.1128"/></url>
<url><loc>https://scifaro.com/en/abs/tight-lower-bounds-for-the-size-of-epsilon-nets-1012.1240</loc><lastmod>2010-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-lower-bounds-for-the-size-of-epsilon-nets-1012.1240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-lower-bounds-for-the-size-of-epsilon-nets-1012.1240"/></url>
<url><loc>https://scifaro.com/en/abs/1d-effectively-closed-subshifts-and-2d-tilings-1012.1329</loc><lastmod>2010-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1d-effectively-closed-subshifts-and-2d-tilings-1012.1329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1d-effectively-closed-subshifts-and-2d-tilings-1012.1329"/></url>
<url><loc>https://scifaro.com/en/abs/slopes-of-tilings-1012.1330</loc><lastmod>2010-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slopes-of-tilings-1012.1330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slopes-of-tilings-1012.1330"/></url>
<url><loc>https://scifaro.com/en/abs/time-symmetric-cellular-automata-1012.1332</loc><lastmod>2010-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-symmetric-cellular-automata-1012.1332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-symmetric-cellular-automata-1012.1332"/></url>
<url><loc>https://scifaro.com/en/abs/construction-of-mu-limit-sets-1012.1333</loc><lastmod>2010-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/construction-of-mu-limit-sets-1012.1333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/construction-of-mu-limit-sets-1012.1333"/></url>
<url><loc>https://scifaro.com/en/abs/the-block-neighborhood-1012.1334</loc><lastmod>2010-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-block-neighborhood-1012.1334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-block-neighborhood-1012.1334"/></url>
<url><loc>https://scifaro.com/en/abs/on-balanced-separators-treewidth-and-cycle-rank-1012.1344</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-balanced-separators-treewidth-and-cycle-rank-1012.1344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-balanced-separators-treewidth-and-cycle-rank-1012.1344"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-approximability-and-exact-algorithms-for-vector-domination-and-related-problems-in-graphs-1012.1529</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-approximability-and-exact-algorithms-for-vector-domination-and-related-problems-in-graphs-1012.1529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-approximability-and-exact-algorithms-for-vector-domination-and-related-problems-in-graphs-1012.1529"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-coloring-of-some-parameterized-graphs-1012.2251</loc><lastmod>2010-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-coloring-of-some-parameterized-graphs-1012.2251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-coloring-of-some-parameterized-graphs-1012.2251"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-sampling-of-markov-chains-with-piecewise-homogeneous-events-1012.2910</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-sampling-of-markov-chains-with-piecewise-homogeneous-events-1012.2910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-sampling-of-markov-chains-with-piecewise-homogeneous-events-1012.2910"/></url>
<url><loc>https://scifaro.com/en/abs/iterative-beam-search-for-simple-assembly-line-balancing-with-a-fixed-number-of-work-stations-1012.3273</loc><lastmod>2010-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterative-beam-search-for-simple-assembly-line-balancing-with-a-fixed-number-of-work-stations-1012.3273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterative-beam-search-for-simple-assembly-line-balancing-with-a-fixed-number-of-work-stations-1012.3273"/></url>
<url><loc>https://scifaro.com/en/abs/set-covering-with-ordered-replacement-additive-and-multiplicative-gaps-1012.3295</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-covering-with-ordered-replacement-additive-and-multiplicative-gaps-1012.3295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-covering-with-ordered-replacement-additive-and-multiplicative-gaps-1012.3295"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-solid-coloring-of-pure-simplicial-complexes-1012.4017</loc><lastmod>2010-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-solid-coloring-of-pure-simplicial-complexes-1012.4017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-solid-coloring-of-pure-simplicial-complexes-1012.4017"/></url>
<url><loc>https://scifaro.com/en/abs/structure-and-recognition-of-3-4-leaf-powers-of-galled-phylogenetic-networks-in-polynomial-time-1012.4084</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-and-recognition-of-3-4-leaf-powers-of-galled-phylogenetic-networks-in-polynomial-time-1012.4084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-and-recognition-of-3-4-leaf-powers-of-galled-phylogenetic-networks-in-polynomial-time-1012.4084"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-planar-graphs-1012.4767</loc><lastmod>2010-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-planar-graphs-1012.4767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-planar-graphs-1012.4767"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-the-maximum-multiplicity-of-some-common-geometric-graphs-1012.5664</loc><lastmod>2011-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-the-maximum-multiplicity-of-some-common-geometric-graphs-1012.5664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-the-maximum-multiplicity-of-some-common-geometric-graphs-1012.5664"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-semi-discrete-calculus-1012.5751</loc><lastmod>2022-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-semi-discrete-calculus-1012.5751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-semi-discrete-calculus-1012.5751"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-directed-planar-graphs-in-o-n-1-5-log-n-time-1012.5870</loc><lastmod>2010-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-directed-planar-graphs-in-o-n-1-5-log-n-time-1012.5870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-directed-planar-graphs-in-o-n-1-5-log-n-time-1012.5870"/></url>
<url><loc>https://scifaro.com/en/abs/small-2-s-colorable-graphs-without-1-obstacle-representations-1012.5907</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-2-s-colorable-graphs-without-1-obstacle-representations-1012.5907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-2-s-colorable-graphs-without-1-obstacle-representations-1012.5907"/></url>
<url><loc>https://scifaro.com/en/abs/exhaustive-verification-of-weak-reconstruction-for-self-complementary-graphs-1012.5995</loc><lastmod>2010-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exhaustive-verification-of-weak-reconstruction-for-self-complementary-graphs-1012.5995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exhaustive-verification-of-weak-reconstruction-for-self-complementary-graphs-1012.5995"/></url>
<url><loc>https://scifaro.com/en/abs/convex-polyhedra-realizing-given-face-areas-1101.0823</loc><lastmod>2011-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-polyhedra-realizing-given-face-areas-1101.0823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-polyhedra-realizing-given-face-areas-1101.0823"/></url>
<url><loc>https://scifaro.com/en/abs/bandwidth-and-pathwidth-of-three-dimensional-grids-1101.0964</loc><lastmod>2011-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bandwidth-and-pathwidth-of-three-dimensional-grids-1101.0964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bandwidth-and-pathwidth-of-three-dimensional-grids-1101.0964"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-feedback-vertex-number-of-digraphs-in-terms-of-vertex-degrees-1101.1291</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-feedback-vertex-number-of-digraphs-in-terms-of-vertex-degrees-1101.1291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-feedback-vertex-number-of-digraphs-in-terms-of-vertex-degrees-1101.1291"/></url>
<url><loc>https://scifaro.com/en/abs/the-graphs-with-the-max-mader-flow-min-multiway-cut-property-1101.2061</loc><lastmod>2011-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graphs-with-the-max-mader-flow-min-multiway-cut-property-1101.2061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graphs-with-the-max-mader-flow-min-multiway-cut-property-1101.2061"/></url>
<url><loc>https://scifaro.com/en/abs/hypercontractivity-and-its-applications-1101.2913</loc><lastmod>2011-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypercontractivity-and-its-applications-1101.2913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypercontractivity-and-its-applications-1101.2913"/></url>
<url><loc>https://scifaro.com/en/abs/binary-trees-and-number-of-states-in-buddy-systems-1101.2964</loc><lastmod>2011-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-trees-and-number-of-states-in-buddy-systems-1101.2964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-trees-and-number-of-states-in-buddy-systems-1101.2964"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-triangle-free-graphs-1101.3188</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-triangle-free-graphs-1101.3188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-triangle-free-graphs-1101.3188"/></url>
<url><loc>https://scifaro.com/en/abs/on-making-directed-graphs-eulerian-1101.4283</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-making-directed-graphs-eulerian-1101.4283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-making-directed-graphs-eulerian-1101.4283"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-time-elastic-vector-spaces-1101.4318</loc><lastmod>2011-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-time-elastic-vector-spaces-1101.4318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-time-elastic-vector-spaces-1101.4318"/></url>
<url><loc>https://scifaro.com/en/abs/a-set-and-collection-lemma-1101.4564</loc><lastmod>2011-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-set-and-collection-lemma-1101.4564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-set-and-collection-lemma-1101.4564"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-on-information-dissemination-in-sparse-mobile-networks-1101.4609</loc><lastmod>2011-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-on-information-dissemination-in-sparse-mobile-networks-1101.4609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-on-information-dissemination-in-sparse-mobile-networks-1101.4609"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-k-way-cut-of-bounded-size-is-fixed-parameter-tractable-1101.4689</loc><lastmod>2011-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-k-way-cut-of-bounded-size-is-fixed-parameter-tractable-1101.4689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-k-way-cut-of-bounded-size-is-fixed-parameter-tractable-1101.4689"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-searching-optimal-shortened-cyclic-single-burst-correcting-codes-1101.5411</loc><lastmod>2011-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-searching-optimal-shortened-cyclic-single-burst-correcting-codes-1101.5411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-searching-optimal-shortened-cyclic-single-burst-correcting-codes-1101.5411"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-matchings-in-4-uniform-hypergraphs-1101.5675</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-matchings-in-4-uniform-hypergraphs-1101.5675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-matchings-in-4-uniform-hypergraphs-1101.5675"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-matching-in-3-uniform-hypergraphs-with-large-vertex-degree-1101.5830</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-matching-in-3-uniform-hypergraphs-with-large-vertex-degree-1101.5830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-matching-in-3-uniform-hypergraphs-with-large-vertex-degree-1101.5830"/></url>
<url><loc>https://scifaro.com/en/abs/avalanche-structure-in-the-kadanoff-sand-pile-model-1101.5940</loc><lastmod>2013-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avalanche-structure-in-the-kadanoff-sand-pile-model-1101.5940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avalanche-structure-in-the-kadanoff-sand-pile-model-1101.5940"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-3-colorability-algorithm-with-automatic-generation-of-no-3-colorability-i-e-co-np-short-proofs-1101.6038</loc><lastmod>2011-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-3-colorability-algorithm-with-automatic-generation-of-no-3-colorability-i-e-co-np-short-proofs-1101.6038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-3-colorability-algorithm-with-automatic-generation-of-no-3-colorability-i-e-co-np-short-proofs-1101.6038"/></url>
<url><loc>https://scifaro.com/en/abs/vertices-belonging-to-all-critical-independent-sets-of-a-graph-1102.0401</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertices-belonging-to-all-critical-independent-sets-of-a-graph-1102.0401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertices-belonging-to-all-critical-independent-sets-of-a-graph-1102.0401"/></url>
<url><loc>https://scifaro.com/en/abs/an-improvement-on-ranks-of-explicit-tensors-1102.0580</loc><lastmod>2011-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improvement-on-ranks-of-explicit-tensors-1102.0580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improvement-on-ranks-of-explicit-tensors-1102.0580"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotics-of-the-chromatic-number-for-quasi-line-graphs-1102.0805</loc><lastmod>2011-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotics-of-the-chromatic-number-for-quasi-line-graphs-1102.0805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotics-of-the-chromatic-number-for-quasi-line-graphs-1102.0805"/></url>
<url><loc>https://scifaro.com/en/abs/conical-existence-of-closed-curves-on-convex-polyhedra-1102.0823</loc><lastmod>2011-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conical-existence-of-closed-curves-on-convex-polyhedra-1102.0823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conical-existence-of-closed-curves-on-convex-polyhedra-1102.0823"/></url>
<url><loc>https://scifaro.com/en/abs/applying-causality-principles-to-the-axiomatization-of-probabilistic-cellular-automata-1102.0860</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-causality-principles-to-the-axiomatization-of-probabilistic-cellular-automata-1102.0860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-causality-principles-to-the-axiomatization-of-probabilistic-cellular-automata-1102.0860"/></url>
<url><loc>https://scifaro.com/en/abs/universal-sets-for-straight-line-embeddings-of-bicolored-graphs-1102.0874</loc><lastmod>2013-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-sets-for-straight-line-embeddings-of-bicolored-graphs-1102.0874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-sets-for-straight-line-embeddings-of-bicolored-graphs-1102.0874"/></url>
<url><loc>https://scifaro.com/en/abs/automata-and-differentiable-words-1102.0913</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-and-differentiable-words-1102.0913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-and-differentiable-words-1102.0913"/></url>
<url><loc>https://scifaro.com/en/abs/graph-theory-1102.1087</loc><lastmod>2024-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-theory-1102.1087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-theory-1102.1087"/></url>
<url><loc>https://scifaro.com/en/abs/critical-sets-in-bipartite-graphs-1102.1138</loc><lastmod>2011-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-sets-in-bipartite-graphs-1102.1138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-sets-in-bipartite-graphs-1102.1138"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-computing-the-core-of-a-konig-egervary-graph-1102.1141</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-computing-the-core-of-a-konig-egervary-graph-1102.1141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-computing-the-core-of-a-konig-egervary-graph-1102.1141"/></url>
<url><loc>https://scifaro.com/en/abs/local-maximum-stable-sets-greedoids-stemmed-from-very-well-covered-graphs-1102.1142</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-maximum-stable-sets-greedoids-stemmed-from-very-well-covered-graphs-1102.1142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-maximum-stable-sets-greedoids-stemmed-from-very-well-covered-graphs-1102.1142"/></url>
<url><loc>https://scifaro.com/en/abs/pi01-sets-and-tilings-1102.1189</loc><lastmod>2011-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pi01-sets-and-tilings-1102.1189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pi01-sets-and-tilings-1102.1189"/></url>
<url><loc>https://scifaro.com/en/abs/on-joint-triangulations-of-two-sets-of-points-in-the-plane-1102.1235</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-joint-triangulations-of-two-sets-of-points-in-the-plane-1102.1235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-joint-triangulations-of-two-sets-of-points-in-the-plane-1102.1235"/></url>
<url><loc>https://scifaro.com/en/abs/a-discrete-choquet-integral-for-ordered-systems-1102.1340</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-discrete-choquet-integral-for-ordered-systems-1102.1340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-discrete-choquet-integral-for-ordered-systems-1102.1340"/></url>
<url><loc>https://scifaro.com/en/abs/a-reformulation-of-the-arora-rao-vazirani-structure-theorem-1102.1456</loc><lastmod>2011-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reformulation-of-the-arora-rao-vazirani-structure-theorem-1102.1456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reformulation-of-the-arora-rao-vazirani-structure-theorem-1102.1456"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-structure-of-the-minimum-critical-independent-set-of-a-graph-1102.1859</loc><lastmod>2011-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-structure-of-the-minimum-critical-independent-set-of-a-graph-1102.1859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-structure-of-the-minimum-critical-independent-set-of-a-graph-1102.1859"/></url>
<url><loc>https://scifaro.com/en/abs/number-representation-using-generalized-beta-transformation-1102.3079</loc><lastmod>2011-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/number-representation-using-generalized-beta-transformation-1102.3079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/number-representation-using-generalized-beta-transformation-1102.3079"/></url>
<url><loc>https://scifaro.com/en/abs/multi-linear-iterative-k-sigma-semialgebras-1102.3106</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-linear-iterative-k-sigma-semialgebras-1102.3106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-linear-iterative-k-sigma-semialgebras-1102.3106"/></url>
<url><loc>https://scifaro.com/en/abs/natural-models-for-evolution-on-networks-1102.3426</loc><lastmod>2012-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-models-for-evolution-on-networks-1102.3426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-models-for-evolution-on-networks-1102.3426"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-stability-for-memoryless-binary-long-lived-consensus-1102.4100</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-stability-for-memoryless-binary-long-lived-consensus-1102.4100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-stability-for-memoryless-binary-long-lived-consensus-1102.4100"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-core-of-a-unicyclic-graph-1102.4727</loc><lastmod>2011-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-core-of-a-unicyclic-graph-1102.4727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-core-of-a-unicyclic-graph-1102.4727"/></url>
<url><loc>https://scifaro.com/en/abs/the-tower-of-hanoi-problem-on-path-h-graphs-1102.4885</loc><lastmod>2011-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tower-of-hanoi-problem-on-path-h-graphs-1102.4885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tower-of-hanoi-problem-on-path-h-graphs-1102.4885"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-batch-codes-a-lower-bound-and-optimal-constructions-1102.4951</loc><lastmod>2011-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-batch-codes-a-lower-bound-and-optimal-constructions-1102.4951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-batch-codes-a-lower-bound-and-optimal-constructions-1102.4951"/></url>
<url><loc>https://scifaro.com/en/abs/the-domination-number-of-grids-1102.5206</loc><lastmod>2014-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-domination-number-of-grids-1102.5206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-domination-number-of-grids-1102.5206"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-bound-for-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-1102.5523</loc><lastmod>2011-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-bound-for-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-1102.5523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-bound-for-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-1102.5523"/></url>
<url><loc>https://scifaro.com/en/abs/the-identities-of-additive-binary-arithmetics-1102.5555</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-identities-of-additive-binary-arithmetics-1102.5555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-identities-of-additive-binary-arithmetics-1102.5555"/></url>
<url><loc>https://scifaro.com/en/abs/information-spreading-in-stationary-markovian-evolving-graphs-1103.0741</loc><lastmod>2011-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-spreading-in-stationary-markovian-evolving-graphs-1103.0741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-spreading-in-stationary-markovian-evolving-graphs-1103.0741"/></url>
<url><loc>https://scifaro.com/en/abs/multidimensional-effective-s-adic-systems-are-sofic-1103.0895</loc><lastmod>2011-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multidimensional-effective-s-adic-systems-are-sofic-1103.0895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multidimensional-effective-s-adic-systems-are-sofic-1103.0895"/></url>
<url><loc>https://scifaro.com/en/abs/fractal-behind-smart-shopping-1103.1208</loc><lastmod>2012-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fractal-behind-smart-shopping-1103.1208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fractal-behind-smart-shopping-1103.1208"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-optimal-link-bombs-1103.1359</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-optimal-link-bombs-1103.1359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-optimal-link-bombs-1103.1359"/></url>
<url><loc>https://scifaro.com/en/abs/cut-locus-structures-on-graphs-1103.1758</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-locus-structures-on-graphs-1103.1758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-locus-structures-on-graphs-1103.1758"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-expansions-for-enumerating-connected-labelled-graphs-1103.2251</loc><lastmod>2011-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-expansions-for-enumerating-connected-labelled-graphs-1103.2251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-expansions-for-enumerating-connected-labelled-graphs-1103.2251"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-all-stable-minimal-separator-graphs-1103.2913</loc><lastmod>2011-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-all-stable-minimal-separator-graphs-1103.2913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-all-stable-minimal-separator-graphs-1103.2913"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-satisfaction-problems-in-clausal-form-1103.3693</loc><lastmod>2012-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-in-clausal-form-1103.3693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-in-clausal-form-1103.3693"/></url>
<url><loc>https://scifaro.com/en/abs/subclasses-of-normal-helly-circular-arc-graphs-1103.3732</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subclasses-of-normal-helly-circular-arc-graphs-1103.3732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subclasses-of-normal-helly-circular-arc-graphs-1103.3732"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-for-identifying-codes-in-terms-of-degree-parameters-1103.3756</loc><lastmod>2012-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-for-identifying-codes-in-terms-of-degree-parameters-1103.3756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-for-identifying-codes-in-terms-of-degree-parameters-1103.3756"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-odd-gracefulness-of-the-tensor-product-of-two-line-graphs-1103.4502</loc><lastmod>2011-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-odd-gracefulness-of-the-tensor-product-of-two-line-graphs-1103.4502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-odd-gracefulness-of-the-tensor-product-of-two-line-graphs-1103.4502"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-minimally-k-connected-graphs-1103.4686</loc><lastmod>2011-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-minimally-k-connected-graphs-1103.4686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-minimally-k-connected-graphs-1103.4686"/></url>
<url><loc>https://scifaro.com/en/abs/a-protocol-for-a-message-system-for-the-tiles-of-the-heptagrid-in-the-hyperbolic-plane-1103.5119</loc><lastmod>2011-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-protocol-for-a-message-system-for-the-tiles-of-the-heptagrid-in-the-hyperbolic-plane-1103.5119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-protocol-for-a-message-system-for-the-tiles-of-the-heptagrid-in-the-hyperbolic-plane-1103.5119"/></url>
<url><loc>https://scifaro.com/en/abs/binary-words-avoiding-a-pattern-and-marked-succession-rule-1103.5689</loc><lastmod>2011-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-words-avoiding-a-pattern-and-marked-succession-rule-1103.5689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-words-avoiding-a-pattern-and-marked-succession-rule-1103.5689"/></url>
<url><loc>https://scifaro.com/en/abs/lifo-search-on-digraphs-a-searching-game-for-cycle-rank-1103.6019</loc><lastmod>2011-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifo-search-on-digraphs-a-searching-game-for-cycle-rank-1103.6019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifo-search-on-digraphs-a-searching-game-for-cycle-rank-1103.6019"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-smallest-odd-hole-in-a-claw-free-graph-using-global-structure-1103.6222</loc><lastmod>2011-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-smallest-odd-hole-in-a-claw-free-graph-using-global-structure-1103.6222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-smallest-odd-hole-in-a-claw-free-graph-using-global-structure-1103.6222"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-and-analysis-of-product-form-petri-nets-1104.0291</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-and-analysis-of-product-form-petri-nets-1104.0291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-and-analysis-of-product-form-petri-nets-1104.0291"/></url>
<url><loc>https://scifaro.com/en/abs/on-sets-of-lines-not-supporting-trees-1104.1307</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sets-of-lines-not-supporting-trees-1104.1307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sets-of-lines-not-supporting-trees-1104.1307"/></url>
<url><loc>https://scifaro.com/en/abs/explosive-percolation-in-erd-os-r-enyi-like-random-graph-processes-1104.1309</loc><lastmod>2011-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explosive-percolation-in-erd-os-r-enyi-like-random-graph-processes-1104.1309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explosive-percolation-in-erd-os-r-enyi-like-random-graph-processes-1104.1309"/></url>
<url><loc>https://scifaro.com/en/abs/which-weighted-circulant-networks-have-perfect-state-transfer-1104.1823</loc><lastmod>2011-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/which-weighted-circulant-networks-have-perfect-state-transfer-1104.1823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/which-weighted-circulant-networks-have-perfect-state-transfer-1104.1823"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-circulant-graphs-having-perfect-state-transfer-1104.1825</loc><lastmod>2011-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-circulant-graphs-having-perfect-state-transfer-1104.1825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-circulant-graphs-having-perfect-state-transfer-1104.1825"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-recognition-of-fuzzy-circular-interval-graphs-1104.2251</loc><lastmod>2011-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-recognition-of-fuzzy-circular-interval-graphs-1104.2251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-recognition-of-fuzzy-circular-interval-graphs-1104.2251"/></url>
<url><loc>https://scifaro.com/en/abs/modifying-the-upper-bound-on-the-length-of-minimal-synchronizing-word-1104.2409</loc><lastmod>2014-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modifying-the-upper-bound-on-the-length-of-minimal-synchronizing-word-1104.2409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modifying-the-upper-bound-on-the-length-of-minimal-synchronizing-word-1104.2409"/></url>
<url><loc>https://scifaro.com/en/abs/design-engineering-and-experimental-analysis-of-a-simulated-annealing-approach-to-the-post-enrolment-course-timetabling-problem-1104.2518</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-engineering-and-experimental-analysis-of-a-simulated-annealing-approach-to-the-post-enrolment-course-timetabling-problem-1104.2518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-engineering-and-experimental-analysis-of-a-simulated-annealing-approach-to-the-post-enrolment-course-timetabling-problem-1104.2518"/></url>
<url><loc>https://scifaro.com/en/abs/the-vertex-leafage-of-chordal-graphs-1104.2524</loc><lastmod>2015-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vertex-leafage-of-chordal-graphs-1104.2524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vertex-leafage-of-chordal-graphs-1104.2524"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-bound-for-3-satisfiable-maxsat-and-its-algorithmic-application-1104.2818</loc><lastmod>2012-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-bound-for-3-satisfiable-maxsat-and-its-algorithmic-application-1104.2818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-bound-for-3-satisfiable-maxsat-and-its-algorithmic-application-1104.2818"/></url>
<url><loc>https://scifaro.com/en/abs/a-counterexample-to-beck-s-conjecture-on-the-discrepancy-of-three-permutations-1104.2922</loc><lastmod>2011-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-counterexample-to-beck-s-conjecture-on-the-discrepancy-of-three-permutations-1104.2922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-counterexample-to-beck-s-conjecture-on-the-discrepancy-of-three-permutations-1104.2922"/></url>
<url><loc>https://scifaro.com/en/abs/global-computation-in-a-poorly-connected-world-fast-rumor-spreading-with-no-dependence-on-conductance-1104.2944</loc><lastmod>2011-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-computation-in-a-poorly-connected-world-fast-rumor-spreading-with-no-dependence-on-conductance-1104.2944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-computation-in-a-poorly-connected-world-fast-rumor-spreading-with-no-dependence-on-conductance-1104.2944"/></url>
<url><loc>https://scifaro.com/en/abs/constructions-of-hamiltonian-graphs-with-bounded-degree-and-diameter-o-log-n-1104.3208</loc><lastmod>2011-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructions-of-hamiltonian-graphs-with-bounded-degree-and-diameter-o-log-n-1104.3208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructions-of-hamiltonian-graphs-with-bounded-degree-and-diameter-o-log-n-1104.3208"/></url>
<url><loc>https://scifaro.com/en/abs/the-distribution-of-cycles-in-breakpoint-graphs-of-signed-permutations-1104.3353</loc><lastmod>2013-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-distribution-of-cycles-in-breakpoint-graphs-of-signed-permutations-1104.3353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-distribution-of-cycles-in-breakpoint-graphs-of-signed-permutations-1104.3353"/></url>
<url><loc>https://scifaro.com/en/abs/directed-nowhere-dense-classes-of-graphs-1104.3808</loc><lastmod>2011-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-nowhere-dense-classes-of-graphs-1104.3808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-nowhere-dense-classes-of-graphs-1104.3808"/></url>
<url><loc>https://scifaro.com/en/abs/synchronism-vs-asynchronism-in-boolean-networks-1104.4039</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synchronism-vs-asynchronism-in-boolean-networks-1104.4039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synchronism-vs-asynchronism-in-boolean-networks-1104.4039"/></url>
<url><loc>https://scifaro.com/en/abs/general-iteration-graphs-and-boolean-automata-circuits-1104.4044</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-iteration-graphs-and-boolean-automata-circuits-1104.4044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-iteration-graphs-and-boolean-automata-circuits-1104.4044"/></url>
<url><loc>https://scifaro.com/en/abs/new-parameterized-algorithms-for-edge-dominating-set-1104.4160</loc><lastmod>2011-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-parameterized-algorithms-for-edge-dominating-set-1104.4160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-parameterized-algorithms-for-edge-dominating-set-1104.4160"/></url>
<url><loc>https://scifaro.com/en/abs/testing-of-random-matrices-1104.4419</loc><lastmod>2011-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-of-random-matrices-1104.4419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-of-random-matrices-1104.4419"/></url>
<url><loc>https://scifaro.com/en/abs/super-d-complexity-of-finite-words-1104.4424</loc><lastmod>2011-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/super-d-complexity-of-finite-words-1104.4424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/super-d-complexity-of-finite-words-1104.4424"/></url>
<url><loc>https://scifaro.com/en/abs/on-scattered-subword-complexity-1104.4425</loc><lastmod>2011-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-scattered-subword-complexity-1104.4425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-scattered-subword-complexity-1104.4425"/></url>
<url><loc>https://scifaro.com/en/abs/determining-l-2-1-span-in-polynomial-space-1104.4506</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determining-l-2-1-span-in-polynomial-space-1104.4506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determining-l-2-1-span-in-polynomial-space-1104.4506"/></url>
<url><loc>https://scifaro.com/en/abs/convex-obstacle-numbers-of-outerplanar-graphs-and-bipartite-permutation-graphs-1104.4656</loc><lastmod>2011-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-obstacle-numbers-of-outerplanar-graphs-and-bipartite-permutation-graphs-1104.4656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-obstacle-numbers-of-outerplanar-graphs-and-bipartite-permutation-graphs-1104.4656"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-source-single-sink-maximum-flow-in-directed-planar-graphs-in-o-diameter-n-log-n-time-1104.4728</loc><lastmod>2011-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-source-single-sink-maximum-flow-in-directed-planar-graphs-in-o-diameter-n-log-n-time-1104.4728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-source-single-sink-maximum-flow-in-directed-planar-graphs-in-o-diameter-n-log-n-time-1104.4728"/></url>
<url><loc>https://scifaro.com/en/abs/3-list-colouring-permutation-graphs-1104.5009</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3-list-colouring-permutation-graphs-1104.5009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3-list-colouring-permutation-graphs-1104.5009"/></url>
<url><loc>https://scifaro.com/en/abs/a-tighter-insertion-based-approximation-of-the-crossing-number-1104.5039</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tighter-insertion-based-approximation-of-the-crossing-number-1104.5039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tighter-insertion-based-approximation-of-the-crossing-number-1104.5039"/></url>
<url><loc>https://scifaro.com/en/abs/large-isolating-cuts-shrink-the-multiway-cut-1104.5361</loc><lastmod>2011-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-isolating-cuts-shrink-the-multiway-cut-1104.5361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-isolating-cuts-shrink-the-multiway-cut-1104.5361"/></url>
<url><loc>https://scifaro.com/en/abs/a-multi-hop-weighted-clustering-of-homogenous-manets-using-combined-closeness-index-1104.5705</loc><lastmod>2011-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multi-hop-weighted-clustering-of-homogenous-manets-using-combined-closeness-index-1104.5705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multi-hop-weighted-clustering-of-homogenous-manets-using-combined-closeness-index-1104.5705"/></url>
<url><loc>https://scifaro.com/en/abs/chains-of-mean-field-models-1105.0807</loc><lastmod>2015-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chains-of-mean-field-models-1105.0807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chains-of-mean-field-models-1105.0807"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-and-parameterized-algorithms-on-rainbow-connectivity-problem-1105.0979</loc><lastmod>2011-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-and-parameterized-algorithms-on-rainbow-connectivity-problem-1105.0979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-and-parameterized-algorithms-on-rainbow-connectivity-problem-1105.0979"/></url>
<url><loc>https://scifaro.com/en/abs/extra-connectivity-measures-of-3-ary-n-cubes-1105.0991</loc><lastmod>2011-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extra-connectivity-measures-of-3-ary-n-cubes-1105.0991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extra-connectivity-measures-of-3-ary-n-cubes-1105.0991"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-pages-and-the-topology-of-the-web-1105.1595</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-pages-and-the-topology-of-the-web-1105.1595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-pages-and-the-topology-of-the-web-1105.1595"/></url>
<url><loc>https://scifaro.com/en/abs/on-relaxing-the-constraints-in-pairwise-compatibility-graphs-1105.2171</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-relaxing-the-constraints-in-pairwise-compatibility-graphs-1105.2171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-relaxing-the-constraints-in-pairwise-compatibility-graphs-1105.2171"/></url>
<url><loc>https://scifaro.com/en/abs/on-symmetry-of-independence-polynomials-1105.2202</loc><lastmod>2011-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-symmetry-of-independence-polynomials-1105.2202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-symmetry-of-independence-polynomials-1105.2202"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-directed-planar-graphs-in-near-linear-time-1105.2228</loc><lastmod>2011-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-directed-planar-graphs-in-near-linear-time-1105.2228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-source-multiple-sink-maximum-flow-in-directed-planar-graphs-in-near-linear-time-1105.2228"/></url>
<url><loc>https://scifaro.com/en/abs/clique-separator-decomposition-of-hole-and-diamond-free-graphs-and-algorithmic-consequences-1105.2874</loc><lastmod>2011-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-separator-decomposition-of-hole-and-diamond-free-graphs-and-algorithmic-consequences-1105.2874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-separator-decomposition-of-hole-and-diamond-free-graphs-and-algorithmic-consequences-1105.2874"/></url>
<url><loc>https://scifaro.com/en/abs/randomly-roving-agents-in-wireless-sensor-networks-1105.3346</loc><lastmod>2011-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomly-roving-agents-in-wireless-sensor-networks-1105.3346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomly-roving-agents-in-wireless-sensor-networks-1105.3346"/></url>
<url><loc>https://scifaro.com/en/abs/random-walks-electric-networks-and-the-transience-class-problem-of-sandpiles-1105.3368</loc><lastmod>2012-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-walks-electric-networks-and-the-transience-class-problem-of-sandpiles-1105.3368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-walks-electric-networks-and-the-transience-class-problem-of-sandpiles-1105.3368"/></url>
<url><loc>https://scifaro.com/en/abs/cuts-in-cartesian-products-of-graphs-1105.3383</loc><lastmod>2013-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cuts-in-cartesian-products-of-graphs-1105.3383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cuts-in-cartesian-products-of-graphs-1105.3383"/></url>
<url><loc>https://scifaro.com/en/abs/chain-homotopies-for-object-topological-representations-1105.3620</loc><lastmod>2011-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chain-homotopies-for-object-topological-representations-1105.3620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chain-homotopies-for-object-topological-representations-1105.3620"/></url>
<url><loc>https://scifaro.com/en/abs/extended-formulations-non-negative-factorizations-and-randomized-communication-protocols-1105.4127</loc><lastmod>2013-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-formulations-non-negative-factorizations-and-randomized-communication-protocols-1105.4127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-formulations-non-negative-factorizations-and-randomized-communication-protocols-1105.4127"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-poset-of-computation-rules-for-nonassociative-calculus-1105.4174</loc><lastmod>2011-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-poset-of-computation-rules-for-nonassociative-calculus-1105.4174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-poset-of-computation-rules-for-nonassociative-calculus-1105.4174"/></url>
<url><loc>https://scifaro.com/en/abs/submodular-function-maximization-via-the-multilinear-relaxation-and-contention-resolution-schemes-1105.4593</loc><lastmod>2014-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submodular-function-maximization-via-the-multilinear-relaxation-and-contention-resolution-schemes-1105.4593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submodular-function-maximization-via-the-multilinear-relaxation-and-contention-resolution-schemes-1105.4593"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-diameter-and-cycle-diameter-orientations-on-planar-graphs-1105.4770</loc><lastmod>2011-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-diameter-and-cycle-diameter-orientations-on-planar-graphs-1105.4770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-diameter-and-cycle-diameter-orientations-on-planar-graphs-1105.4770"/></url>
<url><loc>https://scifaro.com/en/abs/design-and-analysis-of-sd-dwca-a-mobility-based-clustering-of-homogeneous-manets-1105.5521</loc><lastmod>2011-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-and-analysis-of-sd-dwca-a-mobility-based-clustering-of-homogeneous-manets-1105.5521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-and-analysis-of-sd-dwca-a-mobility-based-clustering-of-homogeneous-manets-1105.5521"/></url>
<url><loc>https://scifaro.com/en/abs/packing-chromatic-number-of-distance-graphs-1105.5652</loc><lastmod>2011-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-chromatic-number-of-distance-graphs-1105.5652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-chromatic-number-of-distance-graphs-1105.5652"/></url>
<url><loc>https://scifaro.com/en/abs/counting-or-producing-all-fixed-cardinality-transversals-1106.0141</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-or-producing-all-fixed-cardinality-transversals-1106.0141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-or-producing-all-fixed-cardinality-transversals-1106.0141"/></url>
<url><loc>https://scifaro.com/en/abs/hypercontractive-inequality-for-pseudo-boolean-functions-of-bounded-fourier-width-1106.1049</loc><lastmod>2012-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypercontractive-inequality-for-pseudo-boolean-functions-of-bounded-fourier-width-1106.1049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypercontractive-inequality-for-pseudo-boolean-functions-of-bounded-fourier-width-1106.1049"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-zagreb-indices-equality-1106.1809</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-zagreb-indices-equality-1106.1809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-zagreb-indices-equality-1106.1809"/></url>
<url><loc>https://scifaro.com/en/abs/an-application-of-grossone-to-the-study-of-a-family-of-tilings-of-the-hyperbolic-plane-1106.2217</loc><lastmod>2011-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-application-of-grossone-to-the-study-of-a-family-of-tilings-of-the-hyperbolic-plane-1106.2217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-application-of-grossone-to-the-study-of-a-family-of-tilings-of-the-hyperbolic-plane-1106.2217"/></url>
<url><loc>https://scifaro.com/en/abs/using-grossone-to-count-the-number-of-elements-of-infinite-sets-and-the-connection-with-bijections-1106.2290</loc><lastmod>2011-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-grossone-to-count-the-number-of-elements-of-infinite-sets-and-the-connection-with-bijections-1106.2290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-grossone-to-count-the-number-of-elements-of-infinite-sets-and-the-connection-with-bijections-1106.2290"/></url>
<url><loc>https://scifaro.com/en/abs/some-remarks-on-cops-and-drunk-robbers-1106.2414</loc><lastmod>2017-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-remarks-on-cops-and-drunk-robbers-1106.2414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-remarks-on-cops-and-drunk-robbers-1106.2414"/></url>
<url><loc>https://scifaro.com/en/abs/obstructions-for-linear-rankwidth-at-most-1-1106.2533</loc><lastmod>2011-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/obstructions-for-linear-rankwidth-at-most-1-1106.2533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/obstructions-for-linear-rankwidth-at-most-1-1106.2533"/></url>
<url><loc>https://scifaro.com/en/abs/transduction-on-kadanoff-sand-pile-model-avalanches-application-to-wave-pattern-emergence-1106.2670</loc><lastmod>2013-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transduction-on-kadanoff-sand-pile-model-avalanches-application-to-wave-pattern-emergence-1106.2670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transduction-on-kadanoff-sand-pile-model-avalanches-application-to-wave-pattern-emergence-1106.2670"/></url>
<url><loc>https://scifaro.com/en/abs/dominating-induced-matchings-for-p7-free-graphs-in-linear-time-1106.2772</loc><lastmod>2011-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dominating-induced-matchings-for-p7-free-graphs-in-linear-time-1106.2772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dominating-induced-matchings-for-p7-free-graphs-in-linear-time-1106.2772"/></url>
<url><loc>https://scifaro.com/en/abs/a-polyhedral-approach-for-the-equitable-coloring-problem-1106.3348</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polyhedral-approach-for-the-equitable-coloring-problem-1106.3348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polyhedral-approach-for-the-equitable-coloring-problem-1106.3348"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedral-results-for-the-equitable-coloring-problem-1106.3349</loc><lastmod>2014-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedral-results-for-the-equitable-coloring-problem-1106.3349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedral-results-for-the-equitable-coloring-problem-1106.3349"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-and-unique-coloring-of-graphs-1106.3456</loc><lastmod>2011-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-and-unique-coloring-of-graphs-1106.3456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-and-unique-coloring-of-graphs-1106.3456"/></url>
<url><loc>https://scifaro.com/en/abs/new-computational-result-on-harmonious-trees-1106.3490</loc><lastmod>2012-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-computational-result-on-harmonious-trees-1106.3490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-computational-result-on-harmonious-trees-1106.3490"/></url>
<url><loc>https://scifaro.com/en/abs/one-dimensional-p-adic-integral-value-transformations-1106.3586</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-dimensional-p-adic-integral-value-transformations-1106.3586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-dimensional-p-adic-integral-value-transformations-1106.3586"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-resolving-sets-for-the-hypercube-1106.3632</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-resolving-sets-for-the-hypercube-1106.3632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-resolving-sets-for-the-hypercube-1106.3632"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-two-stage-group-testing-algorithms-for-dna-screening-1106.3680</loc><lastmod>2011-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-two-stage-group-testing-algorithms-for-dna-screening-1106.3680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-two-stage-group-testing-algorithms-for-dna-screening-1106.3680"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-gap-between-ess-f-and-cnf-size-f-1106.4247</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-gap-between-ess-f-and-cnf-size-f-1106.4247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-gap-between-ess-f-and-cnf-size-f-1106.4247"/></url>
<url><loc>https://scifaro.com/en/abs/logic-circuits-from-zero-forcing-1106.4403</loc><lastmod>2017-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-circuits-from-zero-forcing-1106.4403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-circuits-from-zero-forcing-1106.4403"/></url>
<url><loc>https://scifaro.com/en/abs/partition-distances-1106.4579</loc><lastmod>2011-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partition-distances-1106.4579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partition-distances-1106.4579"/></url>
<url><loc>https://scifaro.com/en/abs/avoiding-three-consecutive-blocks-of-the-same-size-and-same-sum-1106.5204</loc><lastmod>2011-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoiding-three-consecutive-blocks-of-the-same-size-and-same-sum-1106.5204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoiding-three-consecutive-blocks-of-the-same-size-and-same-sum-1106.5204"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-unipolar-and-generalized-split-graphs-1106.6061</loc><lastmod>2013-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-unipolar-and-generalized-split-graphs-1106.6061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-unipolar-and-generalized-split-graphs-1106.6061"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-parameter-algorithms-for-restricted-coloring-problems-1107.0056</loc><lastmod>2011-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-parameter-algorithms-for-restricted-coloring-problems-1107.0056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-parameter-algorithms-for-restricted-coloring-problems-1107.0056"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-sums-of-positive-semidefinite-matrices-1107.0088</loc><lastmod>2018-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-sums-of-positive-semidefinite-matrices-1107.0088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-sums-of-positive-semidefinite-matrices-1107.0088"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-folding-of-data-flow-graphs-based-on-finite-projective-geometry-using-lattice-embedding-1107.0118</loc><lastmod>2013-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-folding-of-data-flow-graphs-based-on-finite-projective-geometry-using-lattice-embedding-1107.0118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-folding-of-data-flow-graphs-based-on-finite-projective-geometry-using-lattice-embedding-1107.0118"/></url>
<url><loc>https://scifaro.com/en/abs/how-not-to-characterize-planar-emulable-graphs-1107.0176</loc><lastmod>2011-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-not-to-characterize-planar-emulable-graphs-1107.0176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-not-to-characterize-planar-emulable-graphs-1107.0176"/></url>
<url><loc>https://scifaro.com/en/abs/extended-formulations-for-polygons-1107.0371</loc><lastmod>2012-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-formulations-for-polygons-1107.0371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-formulations-for-polygons-1107.0371"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-algorithm-for-random-colouring-g-n-d-n-using-2-epsilon-d-colours-1107.0871</loc><lastmod>2011-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-algorithm-for-random-colouring-g-n-d-n-using-2-epsilon-d-colours-1107.0871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-algorithm-for-random-colouring-g-n-d-n-using-2-epsilon-d-colours-1107.0871"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-of-complex-networks-and-topological-centrality-1107.0989</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-of-complex-networks-and-topological-centrality-1107.0989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-of-complex-networks-and-topological-centrality-1107.0989"/></url>
<url><loc>https://scifaro.com/en/abs/integral-value-transformations-a-class-of-discrete-dynamical-systems-1107.1031</loc><lastmod>2011-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integral-value-transformations-a-class-of-discrete-dynamical-systems-1107.1031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integral-value-transformations-a-class-of-discrete-dynamical-systems-1107.1031"/></url>
<url><loc>https://scifaro.com/en/abs/locally-monotone-boolean-and-pseudo-boolean-functions-1107.1161</loc><lastmod>2012-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locally-monotone-boolean-and-pseudo-boolean-functions-1107.1161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locally-monotone-boolean-and-pseudo-boolean-functions-1107.1161"/></url>
<url><loc>https://scifaro.com/en/abs/separator-theorems-for-minor-free-and-shallow-minor-free-graphs-with-applications-1107.1292</loc><lastmod>2011-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separator-theorems-for-minor-free-and-shallow-minor-free-graphs-with-applications-1107.1292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separator-theorems-for-minor-free-and-shallow-minor-free-graphs-with-applications-1107.1292"/></url>
<url><loc>https://scifaro.com/en/abs/a-step-towards-an-easy-interconversion-of-various-number-systems-1107.1663</loc><lastmod>2011-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-step-towards-an-easy-interconversion-of-various-number-systems-1107.1663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-step-towards-an-easy-interconversion-of-various-number-systems-1107.1663"/></url>
<url><loc>https://scifaro.com/en/abs/benchmarking-ordering-techniques-for-nonserial-dynamic-programming-1107.1893</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/benchmarking-ordering-techniques-for-nonserial-dynamic-programming-1107.1893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/benchmarking-ordering-techniques-for-nonserial-dynamic-programming-1107.1893"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-two-state-anti-ferromagnetic-spin-systems-on-bounded-degree-graphs-1107.2368</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-two-state-anti-ferromagnetic-spin-systems-on-bounded-degree-graphs-1107.2368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-two-state-anti-ferromagnetic-spin-systems-on-bounded-degree-graphs-1107.2368"/></url>
<url><loc>https://scifaro.com/en/abs/second-moment-method-for-a-family-of-boolean-csp-1107.2737</loc><lastmod>2011-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-moment-method-for-a-family-of-boolean-csp-1107.2737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-moment-method-for-a-family-of-boolean-csp-1107.2737"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-methods-on-erdos-problems-1107.3279</loc><lastmod>2025-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-methods-on-erdos-problems-1107.3279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-methods-on-erdos-problems-1107.3279"/></url>
<url><loc>https://scifaro.com/en/abs/conditioned-poisson-distributions-and-the-concentration-of-chromatic-numbers-1107.3818</loc><lastmod>2011-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditioned-poisson-distributions-and-the-concentration-of-chromatic-numbers-1107.3818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditioned-poisson-distributions-and-the-concentration-of-chromatic-numbers-1107.3818"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-set-cover-estimations-1107.4224</loc><lastmod>2011-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-set-cover-estimations-1107.4224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-set-cover-estimations-1107.4224"/></url>
<url><loc>https://scifaro.com/en/abs/bottom-left-placement-theorem-for-rectangle-packing-1107.4463</loc><lastmod>2011-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottom-left-placement-theorem-for-rectangle-packing-1107.4463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottom-left-placement-theorem-for-rectangle-packing-1107.4463"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-derandomization-theory-in-coding-1107.4709</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-derandomization-theory-in-coding-1107.4709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-derandomization-theory-in-coding-1107.4709"/></url>
<url><loc>https://scifaro.com/en/abs/finding-all-allowed-edges-in-a-bipartite-graph-1107.4711</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-all-allowed-edges-in-a-bipartite-graph-1107.4711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-all-allowed-edges-in-a-bipartite-graph-1107.4711"/></url>
<url><loc>https://scifaro.com/en/abs/on-strongly-spanning-k-edge-colorable-subgraphs-1107.4879</loc><lastmod>2015-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-strongly-spanning-k-edge-colorable-subgraphs-1107.4879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-strongly-spanning-k-edge-colorable-subgraphs-1107.4879"/></url>
<url><loc>https://scifaro.com/en/abs/the-set-of-solutions-of-random-xorsat-formulae-1107.5377</loc><lastmod>2015-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-set-of-solutions-of-random-xorsat-formulae-1107.5377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-set-of-solutions-of-random-xorsat-formulae-1107.5377"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-permanent-with-fractional-belief-propagation-1108.0065</loc><lastmod>2013-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-permanent-with-fractional-belief-propagation-1108.0065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-permanent-with-fractional-belief-propagation-1108.0065"/></url>
<url><loc>https://scifaro.com/en/abs/recurrent-partial-words-1108.3623</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recurrent-partial-words-1108.3623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recurrent-partial-words-1108.3623"/></url>
<url><loc>https://scifaro.com/en/abs/substitutions-over-infinite-alphabet-generating-beta-integers-1108.3627</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/substitutions-over-infinite-alphabet-generating-beta-integers-1108.3627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/substitutions-over-infinite-alphabet-generating-beta-integers-1108.3627"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-tangent-words-1108.3632</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-tangent-words-1108.3632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-tangent-words-1108.3632"/></url>
<url><loc>https://scifaro.com/en/abs/word-posets-with-applications-to-coxeter-groups-1108.3638</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/word-posets-with-applications-to-coxeter-groups-1108.3638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/word-posets-with-applications-to-coxeter-groups-1108.3638"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-properties-of-balanced-words-1108.3639</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-properties-of-balanced-words-1108.3639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-properties-of-balanced-words-1108.3639"/></url>
<url><loc>https://scifaro.com/en/abs/permutation-complexity-of-the-fixed-points-of-some-uniform-binary-morphisms-1108.3641</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permutation-complexity-of-the-fixed-points-of-some-uniform-binary-morphisms-1108.3641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permutation-complexity-of-the-fixed-points-of-some-uniform-binary-morphisms-1108.3641"/></url>
<url><loc>https://scifaro.com/en/abs/permutation-complexity-related-to-the-letter-doubling-map-1108.3642</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permutation-complexity-related-to-the-letter-doubling-map-1108.3642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permutation-complexity-related-to-the-letter-doubling-map-1108.3642"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-intersection-of-all-critical-sets-of-a-unicyclic-graph-1108.3756</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-intersection-of-all-critical-sets-of-a-unicyclic-graph-1108.3756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-intersection-of-all-critical-sets-of-a-unicyclic-graph-1108.3756"/></url>
<url><loc>https://scifaro.com/en/abs/more-jabber-about-the-collatz-conjecture-and-a-closed-form-for-detecting-cycles-on-special-subsequences-assertion-collatz-cycles-1108.4056</loc><lastmod>2011-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/more-jabber-about-the-collatz-conjecture-and-a-closed-form-for-detecting-cycles-on-special-subsequences-assertion-collatz-cycles-1108.4056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/more-jabber-about-the-collatz-conjecture-and-a-closed-form-for-detecting-cycles-on-special-subsequences-assertion-collatz-cycles-1108.4056"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-enumerating-series-of-an-abstract-numeration-system-1108.5711</loc><lastmod>2011-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-enumerating-series-of-an-abstract-numeration-system-1108.5711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-enumerating-series-of-an-abstract-numeration-system-1108.5711"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-k-fold-colorings-of-webs-and-antiwebs-1108.5757</loc><lastmod>2016-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-k-fold-colorings-of-webs-and-antiwebs-1108.5757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-k-fold-colorings-of-webs-and-antiwebs-1108.5757"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-forms-of-the-parallel-symmetric-sandpile-model-1109.0825</loc><lastmod>2012-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-forms-of-the-parallel-symmetric-sandpile-model-1109.0825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-forms-of-the-parallel-symmetric-sandpile-model-1109.0825"/></url>
<url><loc>https://scifaro.com/en/abs/on-partial-opimality-by-auxiliary-submodular-problems-1109.1149</loc><lastmod>2011-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-partial-opimality-by-auxiliary-submodular-problems-1109.1149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-partial-opimality-by-auxiliary-submodular-problems-1109.1149"/></url>
<url><loc>https://scifaro.com/en/abs/localization-on-low-order-eigenvectors-of-data-matrices-1109.1355</loc><lastmod>2011-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/localization-on-low-order-eigenvectors-of-data-matrices-1109.1355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/localization-on-low-order-eigenvectors-of-data-matrices-1109.1355"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-strengthening-of-reed-s-omega-delta-chi-conjecture-for-quasi-line-graphs-1109.2112</loc><lastmod>2011-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-strengthening-of-reed-s-omega-delta-chi-conjecture-for-quasi-line-graphs-1109.2112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-strengthening-of-reed-s-omega-delta-chi-conjecture-for-quasi-line-graphs-1109.2112"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-characterization-of-rainbow-connectivity-1109.2291</loc><lastmod>2011-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-characterization-of-rainbow-connectivity-1109.2291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-characterization-of-rainbow-connectivity-1109.2291"/></url>
<url><loc>https://scifaro.com/en/abs/guaranteed-successful-strategies-for-a-square-achievement-game-on-an-n-by-n-grid-1109.2341</loc><lastmod>2012-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guaranteed-successful-strategies-for-a-square-achievement-game-on-an-n-by-n-grid-1109.2341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guaranteed-successful-strategies-for-a-square-achievement-game-on-an-n-by-n-grid-1109.2341"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-hitting-maximum-and-maximal-cliques-with-a-stable-set-1109.3092</loc><lastmod>2012-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-hitting-maximum-and-maximal-cliques-with-a-stable-set-1109.3092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-hitting-maximum-and-maximal-cliques-with-a-stable-set-1109.3092"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-distance-oracles-with-improved-preprocessing-time-1109.4156</loc><lastmod>2011-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-distance-oracles-with-improved-preprocessing-time-1109.4156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-distance-oracles-with-improved-preprocessing-time-1109.4156"/></url>
<url><loc>https://scifaro.com/en/abs/about-a-discrete-cellular-soliton-computer-simulation-1109.4552</loc><lastmod>2011-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-a-discrete-cellular-soliton-computer-simulation-1109.4552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-a-discrete-cellular-soliton-computer-simulation-1109.4552"/></url>
<url><loc>https://scifaro.com/en/abs/surface-split-decompositions-and-subgraph-isomorphism-in-graphs-on-surfaces-1109.4554</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surface-split-decompositions-and-subgraph-isomorphism-in-graphs-on-surfaces-1109.4554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surface-split-decompositions-and-subgraph-isomorphism-in-graphs-on-surfaces-1109.4554"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-firefighting-revisited-1109.4729</loc><lastmod>2011-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-firefighting-revisited-1109.4729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-firefighting-revisited-1109.4729"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-components-of-the-quadratic-assignment-problem-1109.4875</loc><lastmod>2011-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-components-of-the-quadratic-assignment-problem-1109.4875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-components-of-the-quadratic-assignment-problem-1109.4875"/></url>
<url><loc>https://scifaro.com/en/abs/testing-first-order-properties-for-subclasses-of-sparse-graphs-1109.5036</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-first-order-properties-for-subclasses-of-sparse-graphs-1109.5036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-first-order-properties-for-subclasses-of-sparse-graphs-1109.5036"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relationship-between-classes-p-and-np-1109.5531</loc><lastmod>2016-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relationship-between-classes-p-and-np-1109.5531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relationship-between-classes-p-and-np-1109.5531"/></url>
<url><loc>https://scifaro.com/en/abs/counting-plane-graphs-perfect-matchings-spanning-cycles-and-kasteleyn-s-technique-1109.5596</loc><lastmod>2011-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-plane-graphs-perfect-matchings-spanning-cycles-and-kasteleyn-s-technique-1109.5596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-plane-graphs-perfect-matchings-spanning-cycles-and-kasteleyn-s-technique-1109.5596"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-algorithms-for-multi-queue-buffer-management-with-class-segregation-1109.6060</loc><lastmod>2011-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-algorithms-for-multi-queue-buffer-management-with-class-segregation-1109.6060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-algorithms-for-multi-queue-buffer-management-with-class-segregation-1109.6060"/></url>
<url><loc>https://scifaro.com/en/abs/on-automatic-infinite-permutations-1109.6131</loc><lastmod>2011-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-automatic-infinite-permutations-1109.6131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-automatic-infinite-permutations-1109.6131"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-carry-value-transformation-1110.0178</loc><lastmod>2011-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-carry-value-transformation-1110.0178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-carry-value-transformation-1110.0178"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-pr-ufer-like-coding-and-counting-forests-of-uniform-hypertrees-1110.0204</loc><lastmod>2011-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-pr-ufer-like-coding-and-counting-forests-of-uniform-hypertrees-1110.0204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-pr-ufer-like-coding-and-counting-forests-of-uniform-hypertrees-1110.0204"/></url>
<url><loc>https://scifaro.com/en/abs/the-firefighter-problem-with-more-than-one-firefighter-on-trees-1110.0341</loc><lastmod>2011-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-firefighter-problem-with-more-than-one-firefighter-on-trees-1110.0341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-firefighter-problem-with-more-than-one-firefighter-on-trees-1110.0341"/></url>
<url><loc>https://scifaro.com/en/abs/energy-aware-scheduling-for-weighted-completion-time-and-weighted-tardiness-1110.0685</loc><lastmod>2018-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/energy-aware-scheduling-for-weighted-completion-time-and-weighted-tardiness-1110.0685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/energy-aware-scheduling-for-weighted-completion-time-and-weighted-tardiness-1110.0685"/></url>
<url><loc>https://scifaro.com/en/abs/integral-value-transformations-a-class-of-affine-discrete-dynamical-systems-and-an-application-1110.0724</loc><lastmod>2011-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integral-value-transformations-a-class-of-affine-discrete-dynamical-systems-and-an-application-1110.0724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integral-value-transformations-a-class-of-affine-discrete-dynamical-systems-and-an-application-1110.0724"/></url>
<url><loc>https://scifaro.com/en/abs/interval-edge-colorings-of-cubic-graphs-1110.1161</loc><lastmod>2011-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-edge-colorings-of-cubic-graphs-1110.1161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-edge-colorings-of-cubic-graphs-1110.1161"/></url>
<url><loc>https://scifaro.com/en/abs/interval-edge-colorings-of-graph-products-1110.1165</loc><lastmod>2012-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-edge-colorings-of-graph-products-1110.1165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-edge-colorings-of-graph-products-1110.1165"/></url>
<url><loc>https://scifaro.com/en/abs/on-spanning-tree-congestion-of-hamming-graphs-1110.1304</loc><lastmod>2011-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-spanning-tree-congestion-of-hamming-graphs-1110.1304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-spanning-tree-congestion-of-hamming-graphs-1110.1304"/></url>
<url><loc>https://scifaro.com/en/abs/voting-with-limited-information-and-many-alternatives-1110.1785</loc><lastmod>2015-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voting-with-limited-information-and-many-alternatives-1110.1785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voting-with-limited-information-and-many-alternatives-1110.1785"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-existence-of-hamiltonian-paths-for-history-based-pivot-rules-on-acyclic-unique-sink-orientations-of-hypercubes-1110.3014</loc><lastmod>2012-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-existence-of-hamiltonian-paths-for-history-based-pivot-rules-on-acyclic-unique-sink-orientations-of-hypercubes-1110.3014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-existence-of-hamiltonian-paths-for-history-based-pivot-rules-on-acyclic-unique-sink-orientations-of-hypercubes-1110.3014"/></url>
<url><loc>https://scifaro.com/en/abs/families-of-polytopal-digraphs-that-do-not-satisfy-the-shelling-property-1110.3078</loc><lastmod>2012-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/families-of-polytopal-digraphs-that-do-not-satisfy-the-shelling-property-1110.3078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/families-of-polytopal-digraphs-that-do-not-satisfy-the-shelling-property-1110.3078"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-sierpi-nski-and-riesel-numbers-in-acl2-1110.4671</loc><lastmod>2011-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-sierpi-nski-and-riesel-numbers-in-acl2-1110.4671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-sierpi-nski-and-riesel-numbers-in-acl2-1110.4671"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-antithickenings-of-claw-free-trigraphs-1110.5111</loc><lastmod>2012-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-antithickenings-of-claw-free-trigraphs-1110.5111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-antithickenings-of-claw-free-trigraphs-1110.5111"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-property-of-the-n-dimensional-cube-1110.6010</loc><lastmod>2011-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-property-of-the-n-dimensional-cube-1110.6010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-property-of-the-n-dimensional-cube-1110.6010"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-automata-using-infinite-computations-1110.6143</loc><lastmod>2011-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-automata-using-infinite-computations-1110.6143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-automata-using-infinite-computations-1110.6143"/></url>
<url><loc>https://scifaro.com/en/abs/generalization-of-a-few-results-in-integer-partitions-1111.0094</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalization-of-a-few-results-in-integer-partitions-1111.0094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalization-of-a-few-results-in-integer-partitions-1111.0094"/></url>
<url><loc>https://scifaro.com/en/abs/a-secure-additive-protocol-for-card-players-1111.0156</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-secure-additive-protocol-for-card-players-1111.0156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-secure-additive-protocol-for-card-players-1111.0156"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-extremal-and-s-extremal-binary-self-dual-codes-of-length-38-1111.0228</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-extremal-and-s-extremal-binary-self-dual-codes-of-length-38-1111.0228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-extremal-and-s-extremal-binary-self-dual-codes-of-length-38-1111.0228"/></url>
<url><loc>https://scifaro.com/en/abs/a-primal-dual-algorithm-for-a-heterogeneous-traveling-salesman-problem-1111.0567</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-primal-dual-algorithm-for-a-heterogeneous-traveling-salesman-problem-1111.0567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-primal-dual-algorithm-for-a-heterogeneous-traveling-salesman-problem-1111.0567"/></url>
<url><loc>https://scifaro.com/en/abs/information-spreading-in-dynamic-graphs-1111.0583</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-spreading-in-dynamic-graphs-1111.0583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-spreading-in-dynamic-graphs-1111.0583"/></url>
<url><loc>https://scifaro.com/en/abs/improved-integer-programming-models-for-simple-assembly-line-balancing-and-related-problems-1111.0934</loc><lastmod>2015-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-integer-programming-models-for-simple-assembly-line-balancing-and-related-problems-1111.0934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-integer-programming-models-for-simple-assembly-line-balancing-and-related-problems-1111.0934"/></url>
<url><loc>https://scifaro.com/en/abs/catching-the-k-naesat-threshold-1111.1274</loc><lastmod>2017-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/catching-the-k-naesat-threshold-1111.1274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/catching-the-k-naesat-threshold-1111.1274"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-connected-s-t-vertex-separator-1111.1814</loc><lastmod>2022-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-connected-s-t-vertex-separator-1111.1814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-connected-s-t-vertex-separator-1111.1814"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-palindromization-map-in-free-monoids-1111.1823</loc><lastmod>2013-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-palindromization-map-in-free-monoids-1111.1823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-palindromization-map-in-free-monoids-1111.1823"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-theory-of-modelling-with-boolean-automata-networks-i-theorisation-and-observations-1111.2077</loc><lastmod>2011-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-theory-of-modelling-with-boolean-automata-networks-i-theorisation-and-observations-1111.2077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-theory-of-modelling-with-boolean-automata-networks-i-theorisation-and-observations-1111.2077"/></url>
<url><loc>https://scifaro.com/en/abs/modular-organisation-of-interaction-networks-based-on-asymptotic-dynamics-1111.2313</loc><lastmod>2012-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-organisation-of-interaction-networks-based-on-asymptotic-dynamics-1111.2313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-organisation-of-interaction-networks-based-on-asymptotic-dynamics-1111.2313"/></url>
<url><loc>https://scifaro.com/en/abs/the-asymptotic-behavior-of-grassmannian-codes-1111.2713</loc><lastmod>2011-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-asymptotic-behavior-of-grassmannian-codes-1111.2713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-asymptotic-behavior-of-grassmannian-codes-1111.2713"/></url>
<url><loc>https://scifaro.com/en/abs/diameter-of-cayley-graphs-of-permutation-groups-generated-by-transposition-trees-1111.3114</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diameter-of-cayley-graphs-of-permutation-groups-generated-by-transposition-trees-1111.3114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diameter-of-cayley-graphs-of-permutation-groups-generated-by-transposition-trees-1111.3114"/></url>
<url><loc>https://scifaro.com/en/abs/on-erd-h-o-s-gallai-and-havel-hakimi-algorithms-1111.3282</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-erd-h-o-s-gallai-and-havel-hakimi-algorithms-1111.3282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-erd-h-o-s-gallai-and-havel-hakimi-algorithms-1111.3282"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-finding-the-maximum-and-minimum-elements-with-k-lies-1111.3288</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-finding-the-maximum-and-minimum-elements-with-k-lies-1111.3288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-finding-the-maximum-and-minimum-elements-with-k-lies-1111.3288"/></url>
<url><loc>https://scifaro.com/en/abs/corner-occupying-theorem-for-the-two-dimensional-integral-rectangle-packing-problem-1111.3715</loc><lastmod>2011-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/corner-occupying-theorem-for-the-two-dimensional-integral-rectangle-packing-problem-1111.3715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/corner-occupying-theorem-for-the-two-dimensional-integral-rectangle-packing-problem-1111.3715"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-degree-independence-number-and-pseudo-2-b-factors-in-graphs-1111.3879</loc><lastmod>2012-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-degree-independence-number-and-pseudo-2-b-factors-in-graphs-1111.3879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-degree-independence-number-and-pseudo-2-b-factors-in-graphs-1111.3879"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-path-avoiding-forbidden-pairs-problem-revisited-1111.3996</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-path-avoiding-forbidden-pairs-problem-revisited-1111.3996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-path-avoiding-forbidden-pairs-problem-revisited-1111.3996"/></url>
<url><loc>https://scifaro.com/en/abs/non-monotony-and-boolean-automata-networks-1111.4552</loc><lastmod>2011-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-monotony-and-boolean-automata-networks-1111.4552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-monotony-and-boolean-automata-networks-1111.4552"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-transience-of-linear-max-plus-dynamical-systems-1111.4600</loc><lastmod>2011-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-transience-of-linear-max-plus-dynamical-systems-1111.4600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-transience-of-linear-max-plus-dynamical-systems-1111.4600"/></url>
<url><loc>https://scifaro.com/en/abs/digraph-complexity-measures-and-applications-in-formal-language-theory-1111.5357</loc><lastmod>2013-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digraph-complexity-measures-and-applications-in-formal-language-theory-1111.5357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digraph-complexity-measures-and-applications-in-formal-language-theory-1111.5357"/></url>
<url><loc>https://scifaro.com/en/abs/tractability-results-for-the-double-cut-and-join-circular-median-problem-1111.5872</loc><lastmod>2011-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractability-results-for-the-double-cut-and-join-circular-median-problem-1111.5872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractability-results-for-the-double-cut-and-join-circular-median-problem-1111.5872"/></url>
<url><loc>https://scifaro.com/en/abs/a-diameter-revealing-proof-of-the-bondy-lov-asz-lemma-1111.6561</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-diameter-revealing-proof-of-the-bondy-lov-asz-lemma-1111.6561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-diameter-revealing-proof-of-the-bondy-lov-asz-lemma-1111.6561"/></url>
<url><loc>https://scifaro.com/en/abs/the-regular-number-of-a-graph-1111.6836</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-regular-number-of-a-graph-1111.6836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-regular-number-of-a-graph-1111.6836"/></url>
<url><loc>https://scifaro.com/en/abs/nested-canalyzing-functions-and-their-average-sensitivities-1111.7217</loc><lastmod>2011-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-canalyzing-functions-and-their-average-sensitivities-1111.7217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-canalyzing-functions-and-their-average-sensitivities-1111.7217"/></url>
<url><loc>https://scifaro.com/en/abs/matroids-and-integrality-gaps-for-hypergraphic-steiner-tree-relaxations-1111.7280</loc><lastmod>2011-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matroids-and-integrality-gaps-for-hypergraphic-steiner-tree-relaxations-1111.7280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matroids-and-integrality-gaps-for-hypergraphic-steiner-tree-relaxations-1111.7280"/></url>
<url><loc>https://scifaro.com/en/abs/an-automaton-approach-for-waiting-times-in-dna-evolution-1112.0126</loc><lastmod>2011-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-automaton-approach-for-waiting-times-in-dna-evolution-1112.0126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-automaton-approach-for-waiting-times-in-dna-evolution-1112.0126"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-footsteps-to-generalized-tower-of-hanoi-strategy-1112.0631</loc><lastmod>2011-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-footsteps-to-generalized-tower-of-hanoi-strategy-1112.0631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-footsteps-to-generalized-tower-of-hanoi-strategy-1112.0631"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-satisfiability-of-random-regular-signed-sat-formulas-1112.1360</loc><lastmod>2011-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-satisfiability-of-random-regular-signed-sat-formulas-1112.1360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-satisfiability-of-random-regular-signed-sat-formulas-1112.1360"/></url>
<url><loc>https://scifaro.com/en/abs/sub-families-of-baxter-permutations-based-on-pattern-avoidance-1112.1374</loc><lastmod>2016-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sub-families-of-baxter-permutations-based-on-pattern-avoidance-1112.1374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sub-families-of-baxter-permutations-based-on-pattern-avoidance-1112.1374"/></url>
<url><loc>https://scifaro.com/en/abs/a-study-on-hierarchical-floorplans-of-order-k-1112.1396</loc><lastmod>2011-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-study-on-hierarchical-floorplans-of-order-k-1112.1396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-study-on-hierarchical-floorplans-of-order-k-1112.1396"/></url>
<url><loc>https://scifaro.com/en/abs/steganography-a-class-of-algorithms-having-secure-properties-1112.1675</loc><lastmod>2011-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steganography-a-class-of-algorithms-having-secure-properties-1112.1675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steganography-a-class-of-algorithms-having-secure-properties-1112.1675"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-link-between-strongly-connected-iteration-graphs-and-chaotic-boolean-discrete-time-dynamical-systems-1112.1684</loc><lastmod>2011-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-link-between-strongly-connected-iteration-graphs-and-chaotic-boolean-discrete-time-dynamical-systems-1112.1684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-link-between-strongly-connected-iteration-graphs-and-chaotic-boolean-discrete-time-dynamical-systems-1112.1684"/></url>
<url><loc>https://scifaro.com/en/abs/consistency-of-multidimensional-combinatorial-substitutions-1112.1841</loc><lastmod>2014-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistency-of-multidimensional-combinatorial-substitutions-1112.1841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistency-of-multidimensional-combinatorial-substitutions-1112.1841"/></url>
<url><loc>https://scifaro.com/en/abs/selfsimilarity-simulation-and-spacetime-symmetries-1112.1933</loc><lastmod>2011-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/selfsimilarity-simulation-and-spacetime-symmetries-1112.1933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/selfsimilarity-simulation-and-spacetime-symmetries-1112.1933"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-thresholds-beyond-k-xorsat-1112.2118</loc><lastmod>2011-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-thresholds-beyond-k-xorsat-1112.2118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-thresholds-beyond-k-xorsat-1112.2118"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-rearrangement-problems-under-the-breakpoint-distance-1112.2172</loc><lastmod>2013-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-rearrangement-problems-under-the-breakpoint-distance-1112.2172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-rearrangement-problems-under-the-breakpoint-distance-1112.2172"/></url>
<url><loc>https://scifaro.com/en/abs/towards-optimal-and-expressive-kernelization-for-d-hitting-set-1112.2310</loc><lastmod>2014-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-optimal-and-expressive-kernelization-for-d-hitting-set-1112.2310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-optimal-and-expressive-kernelization-for-d-hitting-set-1112.2310"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-proof-to-complexity-of-dual-basis-of-a-type-i-optimal-normal-basis-1112.3153</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-proof-to-complexity-of-dual-basis-of-a-type-i-optimal-normal-basis-1112.3153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-proof-to-complexity-of-dual-basis-of-a-type-i-optimal-normal-basis-1112.3153"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-edge-length-of-2-edge-connected-planar-geometric-graphs-on-a-set-of-points-1112.3523</loc><lastmod>2011-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-edge-length-of-2-edge-connected-planar-geometric-graphs-on-a-set-of-points-1112.3523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-edge-length-of-2-edge-connected-planar-geometric-graphs-on-a-set-of-points-1112.3523"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-paper-minimizing-total-tardiness-on-parallel-machines-with-preemptions-by-kravchenko-and-werner-2010-1112.4396</loc><lastmod>2011-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-paper-minimizing-total-tardiness-on-parallel-machines-with-preemptions-by-kravchenko-and-werner-2010-1112.4396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-paper-minimizing-total-tardiness-on-parallel-machines-with-preemptions-by-kravchenko-and-werner-2010-1112.4396"/></url>
<url><loc>https://scifaro.com/en/abs/new-complexity-results-for-parallel-identical-machine-scheduling-problems-with-preemption-release-dates-and-regular-criteria-1112.4400</loc><lastmod>2013-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-complexity-results-for-parallel-identical-machine-scheduling-problems-with-preemption-release-dates-and-regular-criteria-1112.4400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-complexity-results-for-parallel-identical-machine-scheduling-problems-with-preemption-release-dates-and-regular-criteria-1112.4400"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-cellular-model-of-signal-controlled-traffic-stream-1112.4631</loc><lastmod>2012-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-cellular-model-of-signal-controlled-traffic-stream-1112.4631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-cellular-model-of-signal-controlled-traffic-stream-1112.4631"/></url>
<url><loc>https://scifaro.com/en/abs/a-preprocessor-based-on-clause-normal-forms-and-virtual-substitutions-to-parallelize-cylindrical-algebraic-decomposition-1112.5352</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-preprocessor-based-on-clause-normal-forms-and-virtual-substitutions-to-parallelize-cylindrical-algebraic-decomposition-1112.5352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-preprocessor-based-on-clause-normal-forms-and-virtual-substitutions-to-parallelize-cylindrical-algebraic-decomposition-1112.5352"/></url>
<url><loc>https://scifaro.com/en/abs/the-tutte-grothendieck-group-of-a-convergent-alphabetic-rewriting-system-1112.6179</loc><lastmod>2013-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tutte-grothendieck-group-of-a-convergent-alphabetic-rewriting-system-1112.6179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tutte-grothendieck-group-of-a-convergent-alphabetic-rewriting-system-1112.6179"/></url>
<url><loc>https://scifaro.com/en/abs/block-local-elimination-algorithms-for-solving-sparse-discrete-optimization-problems-1112.6335</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/block-local-elimination-algorithms-for-solving-sparse-discrete-optimization-problems-1112.6335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/block-local-elimination-algorithms-for-solving-sparse-discrete-optimization-problems-1112.6335"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-clique-problem-in-multiple-interval-graphs-1201.0043</loc><lastmod>2012-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-clique-problem-in-multiple-interval-graphs-1201.0043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-clique-problem-in-multiple-interval-graphs-1201.0043"/></url>
<url><loc>https://scifaro.com/en/abs/computing-cartograms-with-optimal-complexity-1201.0066</loc><lastmod>2012-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-cartograms-with-optimal-complexity-1201.0066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-cartograms-with-optimal-complexity-1201.0066"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounding-edit-distances-between-permutations-1201.0365</loc><lastmod>2013-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounding-edit-distances-between-permutations-1201.0365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounding-edit-distances-between-permutations-1201.0365"/></url>
<url><loc>https://scifaro.com/en/abs/expressing-reachability-in-linear-recurrences-as-infinite-determinants-and-rational-polynomial-equations-1201.0572</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressing-reachability-in-linear-recurrences-as-infinite-determinants-and-rational-polynomial-equations-1201.0572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressing-reachability-in-linear-recurrences-as-infinite-determinants-and-rational-polynomial-equations-1201.0572"/></url>
<url><loc>https://scifaro.com/en/abs/average-case-analysis-of-perfect-sorting-by-reversals-journal-version-1201.0940</loc><lastmod>2012-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-case-analysis-of-perfect-sorting-by-reversals-journal-version-1201.0940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-case-analysis-of-perfect-sorting-by-reversals-journal-version-1201.0940"/></url>
<url><loc>https://scifaro.com/en/abs/cops-and-invisible-robbers-the-cost-of-drunkenness-1201.0946</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cops-and-invisible-robbers-the-cost-of-drunkenness-1201.0946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cops-and-invisible-robbers-the-cost-of-drunkenness-1201.0946"/></url>
<url><loc>https://scifaro.com/en/abs/new-results-on-variants-of-covering-codes-in-sierpinski-graphs-1201.1202</loc><lastmod>2012-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-results-on-variants-of-covering-codes-in-sierpinski-graphs-1201.1202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-results-on-variants-of-covering-codes-in-sierpinski-graphs-1201.1202"/></url>
<url><loc>https://scifaro.com/en/abs/on-zarankiewicz-problem-and-depth-two-superconcentrators-1201.1377</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-zarankiewicz-problem-and-depth-two-superconcentrators-1201.1377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-zarankiewicz-problem-and-depth-two-superconcentrators-1201.1377"/></url>
<url><loc>https://scifaro.com/en/abs/shorter-tours-by-nicer-ears-7-5-approximation-for-graphic-tsp-3-2-for-the-path-version-and-4-3-for-two-edge-connected-subgraphs-1201.1870</loc><lastmod>2012-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shorter-tours-by-nicer-ears-7-5-approximation-for-graphic-tsp-3-2-for-the-path-version-and-4-3-for-two-edge-connected-subgraphs-1201.1870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shorter-tours-by-nicer-ears-7-5-approximation-for-graphic-tsp-3-2-for-the-path-version-and-4-3-for-two-edge-connected-subgraphs-1201.1870"/></url>
<url><loc>https://scifaro.com/en/abs/fork-forests-in-bi-colored-complete-bipartite-graphs-1201.2551</loc><lastmod>2012-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fork-forests-in-bi-colored-complete-bipartite-graphs-1201.2551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fork-forests-in-bi-colored-complete-bipartite-graphs-1201.2551"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-for-randomized-load-balancing-on-arbitrary-network-topologies-1201.2715</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-for-randomized-load-balancing-on-arbitrary-network-topologies-1201.2715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-for-randomized-load-balancing-on-arbitrary-network-topologies-1201.2715"/></url>
<url><loc>https://scifaro.com/en/abs/simple-permutations-poset-1201.3119</loc><lastmod>2012-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-permutations-poset-1201.3119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-permutations-poset-1201.3119"/></url>
<url><loc>https://scifaro.com/en/abs/component-coloring-of-proper-interval-graphs-and-split-graphs-1201.3273</loc><lastmod>2012-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/component-coloring-of-proper-interval-graphs-and-split-graphs-1201.3273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/component-coloring-of-proper-interval-graphs-and-split-graphs-1201.3273"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-multiple-choice-balls-into-bins-tight-bounds-1201.3310</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-multiple-choice-balls-into-bins-tight-bounds-1201.3310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-multiple-choice-balls-into-bins-tight-bounds-1201.3310"/></url>
<url><loc>https://scifaro.com/en/abs/packing-of-rigid-spanning-subgraphs-and-spanning-trees-1201.3727</loc><lastmod>2012-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-of-rigid-spanning-subgraphs-and-spanning-trees-1201.3727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-of-rigid-spanning-subgraphs-and-spanning-trees-1201.3727"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-integral-value-transformation-ivt-in-a-specialized-computer-network-design-1201.4329</loc><lastmod>2012-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-integral-value-transformation-ivt-in-a-specialized-computer-network-design-1201.4329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-integral-value-transformation-ivt-in-a-specialized-computer-network-design-1201.4329"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-geometric-approach-to-sturmian-words-1201.4468</loc><lastmod>2012-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-geometric-approach-to-sturmian-words-1201.4468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-geometric-approach-to-sturmian-words-1201.4468"/></url>
<url><loc>https://scifaro.com/en/abs/a-remark-on-petersen-coloring-conjecture-of-jaeger-1201.4472</loc><lastmod>2013-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-remark-on-petersen-coloring-conjecture-of-jaeger-1201.4472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-remark-on-petersen-coloring-conjecture-of-jaeger-1201.4472"/></url>
<url><loc>https://scifaro.com/en/abs/rainbow-induced-subgraphs-in-replication-graphs-1201.5340</loc><lastmod>2012-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rainbow-induced-subgraphs-in-replication-graphs-1201.5340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rainbow-induced-subgraphs-in-replication-graphs-1201.5340"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-block-representation-of-reversible-cellular-automata-with-time-symmetry-1201.5529</loc><lastmod>2012-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-block-representation-of-reversible-cellular-automata-with-time-symmetry-1201.5529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-block-representation-of-reversible-cellular-automata-with-time-symmetry-1201.5529"/></url>
<url><loc>https://scifaro.com/en/abs/on-compatible-normal-odd-partitions-in-cubic-graphs-1201.5729</loc><lastmod>2012-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-compatible-normal-odd-partitions-in-cubic-graphs-1201.5729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-compatible-normal-odd-partitions-in-cubic-graphs-1201.5729"/></url>
<url><loc>https://scifaro.com/en/abs/tools-for-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-1201.5988</loc><lastmod>2012-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tools-for-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-1201.5988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tools-for-parsimonious-edge-colouring-of-graphs-with-maximum-degree-three-1201.5988"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-and-unique-coloring-of-graphs-revised-resubmission-1201.6166</loc><lastmod>2012-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-and-unique-coloring-of-graphs-revised-resubmission-1201.6166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-and-unique-coloring-of-graphs-revised-resubmission-1201.6166"/></url>
<url><loc>https://scifaro.com/en/abs/nonlinear-planning-model-with-a-gaussian-criterion-of-optimization-gaussian-programming-model-1201.6680</loc><lastmod>2012-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonlinear-planning-model-with-a-gaussian-criterion-of-optimization-gaussian-programming-model-1201.6680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonlinear-planning-model-with-a-gaussian-criterion-of-optimization-gaussian-programming-model-1201.6680"/></url>
<url><loc>https://scifaro.com/en/abs/the-satisfiability-threshold-for-a-seemingly-intractable-random-constraint-satisfaction-problem-1202.0042</loc><lastmod>2012-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-satisfiability-threshold-for-a-seemingly-intractable-random-constraint-satisfaction-problem-1202.0042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-satisfiability-threshold-for-a-seemingly-intractable-random-constraint-satisfaction-problem-1202.0042"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-proof-of-the-cycle-double-cover-conjecture-1202.0569</loc><lastmod>2012-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-proof-of-the-cycle-double-cover-conjecture-1202.0569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-proof-of-the-cycle-double-cover-conjecture-1202.0569"/></url>
<url><loc>https://scifaro.com/en/abs/graph-sharing-games-complexity-and-connectivity-1202.0847</loc><lastmod>2013-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-sharing-games-complexity-and-connectivity-1202.0847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-sharing-games-complexity-and-connectivity-1202.0847"/></url>
<url><loc>https://scifaro.com/en/abs/toroidal-maps-schnyder-woods-orthogonal-surfaces-and-straight-line-representations-1202.0911</loc><lastmod>2012-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toroidal-maps-schnyder-woods-orthogonal-surfaces-and-straight-line-representations-1202.0911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toroidal-maps-schnyder-woods-orthogonal-surfaces-and-straight-line-representations-1202.0911"/></url>
<url><loc>https://scifaro.com/en/abs/the-weighted-words-collector-1202.0920</loc><lastmod>2012-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weighted-words-collector-1202.0920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weighted-words-collector-1202.0920"/></url>
<url><loc>https://scifaro.com/en/abs/the-optimal-uncertainty-algorithm-in-the-mystic-framework-1202.1055</loc><lastmod>2012-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-optimal-uncertainty-algorithm-in-the-mystic-framework-1202.1055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-optimal-uncertainty-algorithm-in-the-mystic-framework-1202.1055"/></url>
<url><loc>https://scifaro.com/en/abs/causal-graph-dynamics-1202.1098</loc><lastmod>2012-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-graph-dynamics-1202.1098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-graph-dynamics-1202.1098"/></url>
<url><loc>https://scifaro.com/en/abs/the-black-and-white-coloring-problem-on-circle-graphs-1202.1896</loc><lastmod>2012-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-black-and-white-coloring-problem-on-circle-graphs-1202.1896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-black-and-white-coloring-problem-on-circle-graphs-1202.1896"/></url>
<url><loc>https://scifaro.com/en/abs/the-number-of-euler-tours-of-a-random-directed-graph-1202.2156</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-number-of-euler-tours-of-a-random-directed-graph-1202.2156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-number-of-euler-tours-of-a-random-directed-graph-1202.2156"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-distance-oracles-with-improved-query-time-1202.2336</loc><lastmod>2012-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-distance-oracles-with-improved-query-time-1202.2336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-distance-oracles-with-improved-query-time-1202.2336"/></url>
<url><loc>https://scifaro.com/en/abs/on-davis-putnam-reductions-for-minimally-unsatisfiable-clause-sets-1202.2600</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-davis-putnam-reductions-for-minimally-unsatisfiable-clause-sets-1202.2600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-davis-putnam-reductions-for-minimally-unsatisfiable-clause-sets-1202.2600"/></url>
<url><loc>https://scifaro.com/en/abs/query-matrices-for-retrieving-binary-vectors-based-on-the-hamming-distance-oracle-1202.2794</loc><lastmod>2012-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-matrices-for-retrieving-binary-vectors-based-on-the-hamming-distance-oracle-1202.2794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-matrices-for-retrieving-binary-vectors-based-on-the-hamming-distance-oracle-1202.2794"/></url>
<url><loc>https://scifaro.com/en/abs/revolutionaries-and-spies-spy-good-and-spy-bad-graphs-1202.2910</loc><lastmod>2015-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revolutionaries-and-spies-spy-good-and-spy-bad-graphs-1202.2910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revolutionaries-and-spies-spy-good-and-spy-bad-graphs-1202.2910"/></url>
<url><loc>https://scifaro.com/en/abs/excluding-4-wheels-1202.3549</loc><lastmod>2012-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/excluding-4-wheels-1202.3549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/excluding-4-wheels-1202.3549"/></url>
<url><loc>https://scifaro.com/en/abs/serial-symmetrical-relocation-algorithm-for-the-equal-sphere-packing-problem-1202.4149</loc><lastmod>2012-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/serial-symmetrical-relocation-algorithm-for-the-equal-sphere-packing-problem-1202.4149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/serial-symmetrical-relocation-algorithm-for-the-equal-sphere-packing-problem-1202.4149"/></url>
<url><loc>https://scifaro.com/en/abs/induced-disjoint-paths-in-claw-free-graphs-1202.4419</loc><lastmod>2014-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induced-disjoint-paths-in-claw-free-graphs-1202.4419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induced-disjoint-paths-in-claw-free-graphs-1202.4419"/></url>
<url><loc>https://scifaro.com/en/abs/the-v-c-erny-conjecture-1202.4626</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-v-c-erny-conjecture-1202.4626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-v-c-erny-conjecture-1202.4626"/></url>
<url><loc>https://scifaro.com/en/abs/all-graphs-with-at-most-seven-vertices-are-pairwise-compatibility-graphs-1202.4631</loc><lastmod>2012-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-graphs-with-at-most-seven-vertices-are-pairwise-compatibility-graphs-1202.4631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-graphs-with-at-most-seven-vertices-are-pairwise-compatibility-graphs-1202.4631"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-solving-hypergraphic-steiner-tree-relaxations-in-quasi-bipartite-instances-1202.5049</loc><lastmod>2012-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-solving-hypergraphic-steiner-tree-relaxations-in-quasi-bipartite-instances-1202.5049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-solving-hypergraphic-steiner-tree-relaxations-in-quasi-bipartite-instances-1202.5049"/></url>
<url><loc>https://scifaro.com/en/abs/vertical-representation-of-c-infty-words-1202.5154</loc><lastmod>2014-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertical-representation-of-c-infty-words-1202.5154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertical-representation-of-c-infty-words-1202.5154"/></url>
<url><loc>https://scifaro.com/en/abs/walk-sums-continued-fractions-and-unique-factorisation-on-digraphs-1202.5523</loc><lastmod>2015-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/walk-sums-continued-fractions-and-unique-factorisation-on-digraphs-1202.5523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/walk-sums-continued-fractions-and-unique-factorisation-on-digraphs-1202.5523"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-the-diameter-of-cayley-graphs-generated-by-transposition-trees-1202.5888</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-the-diameter-of-cayley-graphs-generated-by-transposition-trees-1202.5888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-the-diameter-of-cayley-graphs-generated-by-transposition-trees-1202.5888"/></url>
<url><loc>https://scifaro.com/en/abs/the-bethe-partition-function-of-log-supermodular-graphical-models-1202.6035</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bethe-partition-function-of-log-supermodular-graphical-models-1202.6035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bethe-partition-function-of-log-supermodular-graphical-models-1202.6035"/></url>
<url><loc>https://scifaro.com/en/abs/d-iteration-evaluation-of-the-update-algorithm-1202.6136</loc><lastmod>2012-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/d-iteration-evaluation-of-the-update-algorithm-1202.6136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/d-iteration-evaluation-of-the-update-algorithm-1202.6136"/></url>
<url><loc>https://scifaro.com/en/abs/optimized-on-line-computation-of-pagerank-algorithm-1202.6158</loc><lastmod>2012-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimized-on-line-computation-of-pagerank-algorithm-1202.6158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimized-on-line-computation-of-pagerank-algorithm-1202.6158"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-existence-and-non-existence-of-large-subsets-of-binary-vectors-with-similar-distances-1202.6260</loc><lastmod>2012-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-existence-and-non-existence-of-large-subsets-of-binary-vectors-with-similar-distances-1202.6260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-existence-and-non-existence-of-large-subsets-of-binary-vectors-with-similar-distances-1202.6260"/></url>
<url><loc>https://scifaro.com/en/abs/solving-tantrix-via-integer-programming-1202.6438</loc><lastmod>2012-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-tantrix-via-integer-programming-1202.6438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-tantrix-via-integer-programming-1202.6438"/></url>
<url><loc>https://scifaro.com/en/abs/connectivity-in-one-dimensional-ad-hoc-networks-with-an-access-point-1203.0044</loc><lastmod>2012-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connectivity-in-one-dimensional-ad-hoc-networks-with-an-access-point-1203.0044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connectivity-in-one-dimensional-ad-hoc-networks-with-an-access-point-1203.0044"/></url>
<url><loc>https://scifaro.com/en/abs/checking-tests-for-read-once-functions-over-arbitrary-bases-1203.0631</loc><lastmod>2012-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-tests-for-read-once-functions-over-arbitrary-bases-1203.0631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-tests-for-read-once-functions-over-arbitrary-bases-1203.0631"/></url>
<url><loc>https://scifaro.com/en/abs/target-set-selection-problem-for-honeycomb-networks-1203.0666</loc><lastmod>2012-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/target-set-selection-problem-for-honeycomb-networks-1203.0666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/target-set-selection-problem-for-honeycomb-networks-1203.0666"/></url>
<url><loc>https://scifaro.com/en/abs/towards-optimal-degree-distributions-for-left-perfect-matchings-in-random-bipartite-graphs-1203.1506</loc><lastmod>2012-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-optimal-degree-distributions-for-left-perfect-matchings-in-random-bipartite-graphs-1203.1506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-optimal-degree-distributions-for-left-perfect-matchings-in-random-bipartite-graphs-1203.1506"/></url>
<url><loc>https://scifaro.com/en/abs/inapproximability-of-the-partition-function-for-the-antiferromagnetic-ising-and-hard-core-models-1203.2226</loc><lastmod>2016-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inapproximability-of-the-partition-function-for-the-antiferromagnetic-ising-and-hard-core-models-1203.2226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inapproximability-of-the-partition-function-for-the-antiferromagnetic-ising-and-hard-core-models-1203.2226"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-generating-aoa-networks-1203.3203</loc><lastmod>2012-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-generating-aoa-networks-1203.3203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-generating-aoa-networks-1203.3203"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-the-least-number-of-moves-needed-to-solve-the-k-peg-towers-of-hanoi-problem-1203.3280</loc><lastmod>2016-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-the-least-number-of-moves-needed-to-solve-the-k-peg-towers-of-hanoi-problem-1203.3280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-the-least-number-of-moves-needed-to-solve-the-k-peg-towers-of-hanoi-problem-1203.3280"/></url>
<url><loc>https://scifaro.com/en/abs/linear-vertex-kernels-for-several-dense-ranking-r-csps-1203.3727</loc><lastmod>2012-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-vertex-kernels-for-several-dense-ranking-r-csps-1203.3727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-vertex-kernels-for-several-dense-ranking-r-csps-1203.3727"/></url>
<url><loc>https://scifaro.com/en/abs/when-the-cut-condition-is-enough-a-complete-characterization-for-multiflow-problems-in-series-parallel-networks-1203.4041</loc><lastmod>2012-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-the-cut-condition-is-enough-a-complete-characterization-for-multiflow-problems-in-series-parallel-networks-1203.4041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-the-cut-condition-is-enough-a-complete-characterization-for-multiflow-problems-in-series-parallel-networks-1203.4041"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hamming-distance-between-base-n-representations-of-whole-numbers-1203.4547</loc><lastmod>2012-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hamming-distance-between-base-n-representations-of-whole-numbers-1203.4547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hamming-distance-between-base-n-representations-of-whole-numbers-1203.4547"/></url>
<url><loc>https://scifaro.com/en/abs/a-pseudo-random-number-generator-from-chaos-1203.5731</loc><lastmod>2013-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-pseudo-random-number-generator-from-chaos-1203.5731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-pseudo-random-number-generator-from-chaos-1203.5731"/></url>
<url><loc>https://scifaro.com/en/abs/on-distance-function-among-finite-set-of-points-1203.6177</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-distance-function-among-finite-set-of-points-1203.6177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-distance-function-among-finite-set-of-points-1203.6177"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-infection-sources-and-regions-in-large-networks-1204.0354</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-infection-sources-and-regions-in-large-networks-1204.0354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-infection-sources-and-regions-in-large-networks-1204.0354"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-bounds-for-monotonicity-and-lipschitz-testing-over-hypercubes-and-hypergrids-1204.0849</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-bounds-for-monotonicity-and-lipschitz-testing-over-hypercubes-and-hypergrids-1204.0849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-bounds-for-monotonicity-and-lipschitz-testing-over-hypercubes-and-hypergrids-1204.0849"/></url>
<url><loc>https://scifaro.com/en/abs/testing-booleanity-and-the-uncertainty-principle-1204.0944</loc><lastmod>2013-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-booleanity-and-the-uncertainty-principle-1204.0944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-booleanity-and-the-uncertainty-principle-1204.0944"/></url>
<url><loc>https://scifaro.com/en/abs/sharp-bounds-on-davenport-schinzel-sequences-of-every-order-1204.1086</loc><lastmod>2013-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharp-bounds-on-davenport-schinzel-sequences-of-every-order-1204.1086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharp-bounds-on-davenport-schinzel-sequences-of-every-order-1204.1086"/></url>
<url><loc>https://scifaro.com/en/abs/finding-vertex-surjective-graph-homomorphisms-1204.2124</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-vertex-surjective-graph-homomorphisms-1204.2124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-vertex-surjective-graph-homomorphisms-1204.2124"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-bound-for-the-2-3-conjecture-1204.2519</loc><lastmod>2013-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-bound-for-the-2-3-conjecture-1204.2519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-bound-for-the-2-3-conjecture-1204.2519"/></url>
<url><loc>https://scifaro.com/en/abs/stanley-reisner-resolution-of-constant-weight-linear-codes-1204.2710</loc><lastmod>2013-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stanley-reisner-resolution-of-constant-weight-linear-codes-1204.2710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stanley-reisner-resolution-of-constant-weight-linear-codes-1204.2710"/></url>
<url><loc>https://scifaro.com/en/abs/the-cost-of-perfection-for-matchings-in-graphs-1204.2727</loc><lastmod>2018-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cost-of-perfection-for-matchings-in-graphs-1204.2727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cost-of-perfection-for-matchings-in-graphs-1204.2727"/></url>
<url><loc>https://scifaro.com/en/abs/a-kuratowski-type-theorem-for-planarity-of-partially-embedded-graphs-1204.2915</loc><lastmod>2012-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-kuratowski-type-theorem-for-planarity-of-partially-embedded-graphs-1204.2915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-kuratowski-type-theorem-for-planarity-of-partially-embedded-graphs-1204.2915"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-nonblocking-switching-networks-using-linear-programming-duality-1204.3180</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-nonblocking-switching-networks-using-linear-programming-duality-1204.3180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-nonblocking-switching-networks-using-linear-programming-duality-1204.3180"/></url>
<url><loc>https://scifaro.com/en/abs/mixing-times-of-self-organizing-lists-and-biased-permutations-1204.3239</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixing-times-of-self-organizing-lists-and-biased-permutations-1204.3239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixing-times-of-self-organizing-lists-and-biased-permutations-1204.3239"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-decoding-strings-from-their-shingles-1204.3293</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-decoding-strings-from-their-shingles-1204.3293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-decoding-strings-from-their-shingles-1204.3293"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-cliques-in-graphs-with-small-intersection-number-and-random-intersection-graphs-1204.4054</loc><lastmod>2012-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-cliques-in-graphs-with-small-intersection-number-and-random-intersection-graphs-1204.4054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-cliques-in-graphs-with-small-intersection-number-and-random-intersection-graphs-1204.4054"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-signed-total-k-domination-number-of-a-graph-1204.4827</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-signed-total-k-domination-number-of-a-graph-1204.4827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-signed-total-k-domination-number-of-a-graph-1204.4827"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-conjugacy-and-factorization-of-multidimensional-subshifts-of-finite-type-1204.4988</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-conjugacy-and-factorization-of-multidimensional-subshifts-of-finite-type-1204.4988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-conjugacy-and-factorization-of-multidimensional-subshifts-of-finite-type-1204.4988"/></url>
<url><loc>https://scifaro.com/en/abs/kernelizing-mso-properties-of-trees-of-fixed-height-and-some-consequences-1204.5194</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kernelizing-mso-properties-of-trees-of-fixed-height-and-some-consequences-1204.5194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kernelizing-mso-properties-of-trees-of-fixed-height-and-some-consequences-1204.5194"/></url>
<url><loc>https://scifaro.com/en/abs/non-hamiltonian-holes-in-grid-graphs-1204.5284</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-hamiltonian-holes-in-grid-graphs-1204.5284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-hamiltonian-holes-in-grid-graphs-1204.5284"/></url>
<url><loc>https://scifaro.com/en/abs/compact-dsop-and-partial-dsop-forms-1204.5306</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-dsop-and-partial-dsop-forms-1204.5306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-dsop-and-partial-dsop-forms-1204.5306"/></url>
<url><loc>https://scifaro.com/en/abs/edge-intersection-graphs-of-l-shaped-paths-in-grids-1204.5702</loc><lastmod>2015-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-intersection-graphs-of-l-shaped-paths-in-grids-1204.5702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-intersection-graphs-of-l-shaped-paths-in-grids-1204.5702"/></url>
<url><loc>https://scifaro.com/en/abs/open-problems-in-analysis-of-boolean-functions-1204.6447</loc><lastmod>2012-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-problems-in-analysis-of-boolean-functions-1204.6447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-problems-in-analysis-of-boolean-functions-1204.6447"/></url>
<url><loc>https://scifaro.com/en/abs/citations-sequence-alignments-contagion-and-semantics-on-acyclic-structures-and-their-randomness-1204.6535</loc><lastmod>2014-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/citations-sequence-alignments-contagion-and-semantics-on-acyclic-structures-and-their-randomness-1204.6535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/citations-sequence-alignments-contagion-and-semantics-on-acyclic-structures-and-their-randomness-1204.6535"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameter-mu-21-of-a-complete-bipartite-graph-1205.0125</loc><lastmod>2012-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameter-mu-21-of-a-complete-bipartite-graph-1205.0125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameter-mu-21-of-a-complete-bipartite-graph-1205.0125"/></url>
<url><loc>https://scifaro.com/en/abs/it-was-not-known-about-simple-cycles-1205.0128</loc><lastmod>2012-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-was-not-known-about-simple-cycles-1205.0128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-was-not-known-about-simple-cycles-1205.0128"/></url>
<url><loc>https://scifaro.com/en/abs/on-one-sided-interval-edge-colorings-of-biregular-bipartite-graphs-1205.0130</loc><lastmod>2012-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-one-sided-interval-edge-colorings-of-biregular-bipartite-graphs-1205.0130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-one-sided-interval-edge-colorings-of-biregular-bipartite-graphs-1205.0130"/></url>
<url><loc>https://scifaro.com/en/abs/estimates-for-the-number-of-vertices-with-an-interval-spectrum-in-proper-edge-colorings-of-some-graphs-1205.0131</loc><lastmod>2012-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimates-for-the-number-of-vertices-with-an-interval-spectrum-in-proper-edge-colorings-of-some-graphs-1205.0131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimates-for-the-number-of-vertices-with-an-interval-spectrum-in-proper-edge-colorings-of-some-graphs-1205.0131"/></url>
<url><loc>https://scifaro.com/en/abs/on-cyclically-interval-edge-colorings-of-trees-1205.0193</loc><lastmod>2012-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cyclically-interval-edge-colorings-of-trees-1205.0193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cyclically-interval-edge-colorings-of-trees-1205.0193"/></url>
<url><loc>https://scifaro.com/en/abs/signed-and-minus-domination-in-complete-multipartite-graphs-1205.0343</loc><lastmod>2012-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signed-and-minus-domination-in-complete-multipartite-graphs-1205.0343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signed-and-minus-domination-in-complete-multipartite-graphs-1205.0343"/></url>
<url><loc>https://scifaro.com/en/abs/reed-s-conjecture-on-some-special-classes-of-graphs-1205.0730</loc><lastmod>2012-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reed-s-conjecture-on-some-special-classes-of-graphs-1205.0730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reed-s-conjecture-on-some-special-classes-of-graphs-1205.0730"/></url>
<url><loc>https://scifaro.com/en/abs/reed-s-conjecture-on-hole-expansions-1205.0731</loc><lastmod>2012-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reed-s-conjecture-on-hole-expansions-1205.0731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reed-s-conjecture-on-hole-expansions-1205.0731"/></url>
<url><loc>https://scifaro.com/en/abs/method-study-on-the-3x-1-problem-1205.0845</loc><lastmod>2012-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/method-study-on-the-3x-1-problem-1205.0845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/method-study-on-the-3x-1-problem-1205.0845"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-coloring-of-3-colorable-graphs-1205.1254</loc><lastmod>2012-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-coloring-of-3-colorable-graphs-1205.1254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-coloring-of-3-colorable-graphs-1205.1254"/></url>
<url><loc>https://scifaro.com/en/abs/a-tail-bound-for-read-k-families-of-functions-1205.1478</loc><lastmod>2022-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tail-bound-for-read-k-families-of-functions-1205.1478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tail-bound-for-read-k-families-of-functions-1205.1478"/></url>
<url><loc>https://scifaro.com/en/abs/rainbow-colouring-of-split-and-threshold-graphs-1205.1670</loc><lastmod>2012-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rainbow-colouring-of-split-and-threshold-graphs-1205.1670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rainbow-colouring-of-split-and-threshold-graphs-1205.1670"/></url>
<url><loc>https://scifaro.com/en/abs/tight-lower-bounds-on-envy-free-makespan-approximation-1205.1786</loc><lastmod>2012-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-lower-bounds-on-envy-free-makespan-approximation-1205.1786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-lower-bounds-on-envy-free-makespan-approximation-1205.1786"/></url>
<url><loc>https://scifaro.com/en/abs/edge-clique-graphs-of-cocktail-parties-have-unbounded-rankwidth-1205.2483</loc><lastmod>2012-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-clique-graphs-of-cocktail-parties-have-unbounded-rankwidth-1205.2483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-clique-graphs-of-cocktail-parties-have-unbounded-rankwidth-1205.2483"/></url>
<url><loc>https://scifaro.com/en/abs/vertex-elimination-orderings-for-hereditary-graph-classes-1205.2535</loc><lastmod>2015-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertex-elimination-orderings-for-hereditary-graph-classes-1205.2535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertex-elimination-orderings-for-hereditary-graph-classes-1205.2535"/></url>
<url><loc>https://scifaro.com/en/abs/a-reduced-integer-programming-model-for-the-ferry-scheduling-problem-1205.3757</loc><lastmod>2015-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reduced-integer-programming-model-for-the-ferry-scheduling-problem-1205.3757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reduced-integer-programming-model-for-the-ferry-scheduling-problem-1205.3757"/></url>
<url><loc>https://scifaro.com/en/abs/a-partially-ordered-structure-and-a-generalization-of-the-canonical-partition-for-general-graphs-with-perfect-matchings-1205.3816</loc><lastmod>2013-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-partially-ordered-structure-and-a-generalization-of-the-canonical-partition-for-general-graphs-with-perfect-matchings-1205.3816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-partially-ordered-structure-and-a-generalization-of-the-canonical-partition-for-general-graphs-with-perfect-matchings-1205.3816"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-vector-addition-systems-with-one-zero-test-1205.4458</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-vector-addition-systems-with-one-zero-test-1205.4458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-vector-addition-systems-with-one-zero-test-1205.4458"/></url>
<url><loc>https://scifaro.com/en/abs/automorphism-groups-of-cayley-graphs-generated-by-connected-transposition-sets-1205.5199</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automorphism-groups-of-cayley-graphs-generated-by-connected-transposition-sets-1205.5199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automorphism-groups-of-cayley-graphs-generated-by-connected-transposition-sets-1205.5199"/></url>
<url><loc>https://scifaro.com/en/abs/interval-valued-fuzzy-graphs-1205.6123</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-valued-fuzzy-graphs-1205.6123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-valued-fuzzy-graphs-1205.6123"/></url>
<url><loc>https://scifaro.com/en/abs/lattices-generated-by-chip-firing-game-models-criteria-and-recognition-algorithm-1205.6256</loc><lastmod>2013-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattices-generated-by-chip-firing-game-models-criteria-and-recognition-algorithm-1205.6256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattices-generated-by-chip-firing-game-models-criteria-and-recognition-algorithm-1205.6256"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-waiting-times-in-dna-evolution-1205.6420</loc><lastmod>2012-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-waiting-times-in-dna-evolution-1205.6420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-waiting-times-in-dna-evolution-1205.6420"/></url>
<url><loc>https://scifaro.com/en/abs/reputation-games-for-undirected-graphs-1205.6683</loc><lastmod>2012-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reputation-games-for-undirected-graphs-1205.6683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reputation-games-for-undirected-graphs-1205.6683"/></url>
<url><loc>https://scifaro.com/en/abs/3-colourability-of-dually-chordal-graphs-in-linear-time-1206.0233</loc><lastmod>2012-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3-colourability-of-dually-chordal-graphs-in-linear-time-1206.0233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3-colourability-of-dually-chordal-graphs-in-linear-time-1206.0233"/></url>
<url><loc>https://scifaro.com/en/abs/generating-spherical-multiquadrangulations-by-restricted-vertex-splittings-and-the-reducibility-of-equilibrium-classes-1206.1698</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-spherical-multiquadrangulations-by-restricted-vertex-splittings-and-the-reducibility-of-equilibrium-classes-1206.1698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-spherical-multiquadrangulations-by-restricted-vertex-splittings-and-the-reducibility-of-equilibrium-classes-1206.1698"/></url>
<url><loc>https://scifaro.com/en/abs/patience-of-matrix-games-1206.1751</loc><lastmod>2012-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/patience-of-matrix-games-1206.1751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/patience-of-matrix-games-1206.1751"/></url>
<url><loc>https://scifaro.com/en/abs/on-an-extremal-hypergraph-problem-related-to-combinatorial-batch-codes-1206.1996</loc><lastmod>2012-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-an-extremal-hypergraph-problem-related-to-combinatorial-batch-codes-1206.1996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-an-extremal-hypergraph-problem-related-to-combinatorial-batch-codes-1206.1996"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-fractional-chromatic-number-of-k-delta-free-graphs-1206.2384</loc><lastmod>2013-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-fractional-chromatic-number-of-k-delta-free-graphs-1206.2384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-fractional-chromatic-number-of-k-delta-free-graphs-1206.2384"/></url>
<url><loc>https://scifaro.com/en/abs/clique-matrices-for-statistical-graph-decomposition-and-parameterising-restricted-positive-definite-matrices-1206.3237</loc><lastmod>2012-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-matrices-for-statistical-graph-decomposition-and-parameterising-restricted-positive-definite-matrices-1206.3237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-matrices-for-statistical-graph-decomposition-and-parameterising-restricted-positive-definite-matrices-1206.3237"/></url>
<url><loc>https://scifaro.com/en/abs/improving-the-asymmetric-tsp-by-considering-graph-structure-1206.3437</loc><lastmod>2012-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-the-asymmetric-tsp-by-considering-graph-structure-1206.3437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-the-asymmetric-tsp-by-considering-graph-structure-1206.3437"/></url>
<url><loc>https://scifaro.com/en/abs/broadcasting-colourings-on-trees-a-combinatorial-view-1206.3538</loc><lastmod>2013-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/broadcasting-colourings-on-trees-a-combinatorial-view-1206.3538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/broadcasting-colourings-on-trees-a-combinatorial-view-1206.3538"/></url>
<url><loc>https://scifaro.com/en/abs/visualizing-streaming-text-data-with-dynamic-maps-1206.3980</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualizing-streaming-text-data-with-dynamic-maps-1206.3980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualizing-streaming-text-data-with-dynamic-maps-1206.3980"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-planar-multicuts-with-few-source-sink-pairs-1206.3999</loc><lastmod>2012-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-planar-multicuts-with-few-source-sink-pairs-1206.3999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-planar-multicuts-with-few-source-sink-pairs-1206.3999"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-localization-of-the-personalized-pagerank-of-complex-networks-1206.4855</loc><lastmod>2012-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-localization-of-the-personalized-pagerank-of-complex-networks-1206.4855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-localization-of-the-personalized-pagerank-of-complex-networks-1206.4855"/></url>
<url><loc>https://scifaro.com/en/abs/topological-arguments-for-kolmogorov-complexity-1206.4927</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-arguments-for-kolmogorov-complexity-1206.4927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-arguments-for-kolmogorov-complexity-1206.4927"/></url>
<url><loc>https://scifaro.com/en/abs/on-list-colouring-and-list-homomorphism-of-permutation-and-interval-graphs-1206.5106</loc><lastmod>2012-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-list-colouring-and-list-homomorphism-of-permutation-and-interval-graphs-1206.5106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-list-colouring-and-list-homomorphism-of-permutation-and-interval-graphs-1206.5106"/></url>
<url><loc>https://scifaro.com/en/abs/a-retrial-system-with-two-input-streams-and-two-orbit-queues-1206.5673</loc><lastmod>2012-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-retrial-system-with-two-input-streams-and-two-orbit-queues-1206.5673"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-retrial-system-with-two-input-streams-and-two-orbit-queues-1206.5673"/></url>
<url><loc>https://scifaro.com/en/abs/l-rcm-a-method-to-detect-connected-components-in-undirected-graphs-by-using-the-laplacian-matrix-and-the-rcm-algorithm-1206.5726</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-rcm-a-method-to-detect-connected-components-in-undirected-graphs-by-using-the-laplacian-matrix-and-the-rcm-algorithm-1206.5726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-rcm-a-method-to-detect-connected-components-in-undirected-graphs-by-using-the-laplacian-matrix-and-the-rcm-algorithm-1206.5726"/></url>
<url><loc>https://scifaro.com/en/abs/on-complexity-of-flooding-games-on-graphs-with-interval-representations-1206.6201</loc><lastmod>2013-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complexity-of-flooding-games-on-graphs-with-interval-representations-1206.6201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complexity-of-flooding-games-on-graphs-with-interval-representations-1206.6201"/></url>
<url><loc>https://scifaro.com/en/abs/automorphism-groups-of-graphs-1206.6279</loc><lastmod>2012-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automorphism-groups-of-graphs-1206.6279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automorphism-groups-of-graphs-1206.6279"/></url>
<url><loc>https://scifaro.com/en/abs/a-low-depth-monotone-function-that-is-not-an-approximate-junta-1206.6541</loc><lastmod>2013-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-low-depth-monotone-function-that-is-not-an-approximate-junta-1206.6541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-low-depth-monotone-function-that-is-not-an-approximate-junta-1206.6541"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-induced-graph-matching-on-claw-free-graphs-1206.7105</loc><lastmod>2014-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-induced-graph-matching-on-claw-free-graphs-1206.7105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-induced-graph-matching-on-claw-free-graphs-1206.7105"/></url>
<url><loc>https://scifaro.com/en/abs/on-graph-parameters-guaranteeing-fast-sandpile-diffusion-1207.0421</loc><lastmod>2012-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-graph-parameters-guaranteeing-fast-sandpile-diffusion-1207.0421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-graph-parameters-guaranteeing-fast-sandpile-diffusion-1207.0421"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-intersection-of-tolerance-and-cocomparability-graphs-1207.0552</loc><lastmod>2012-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-intersection-of-tolerance-and-cocomparability-graphs-1207.0552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-intersection-of-tolerance-and-cocomparability-graphs-1207.0552"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-set-of-fixed-points-of-the-parallel-symmetric-sand-pile-model-1207.0654</loc><lastmod>2012-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-set-of-fixed-points-of-the-parallel-symmetric-sand-pile-model-1207.0654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-set-of-fixed-points-of-the-parallel-symmetric-sand-pile-model-1207.0654"/></url>
<url><loc>https://scifaro.com/en/abs/on-rainbow-cycles-and-paths-1207.0840</loc><lastmod>2012-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-rainbow-cycles-and-paths-1207.0840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-rainbow-cycles-and-paths-1207.0840"/></url>
<url><loc>https://scifaro.com/en/abs/folding-graphs-1207.0932</loc><lastmod>2012-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-graphs-1207.0932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-graphs-1207.0932"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-dominating-and-edge-dominating-sets-for-graphs-and-hypergraphs-1207.0953</loc><lastmod>2012-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-dominating-and-edge-dominating-sets-for-graphs-and-hypergraphs-1207.0953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-dominating-and-edge-dominating-sets-for-graphs-and-hypergraphs-1207.0953"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-conjecture-for-graphs-isomorphic-to-cube-of-a-tree-1207.1875</loc><lastmod>2012-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-conjecture-for-graphs-isomorphic-to-cube-of-a-tree-1207.1875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-conjecture-for-graphs-isomorphic-to-cube-of-a-tree-1207.1875"/></url>
<url><loc>https://scifaro.com/en/abs/some-euler-type-formulas-for-planar-graphs-1207.2345</loc><lastmod>2012-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-euler-type-formulas-for-planar-graphs-1207.2345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-euler-type-formulas-for-planar-graphs-1207.2345"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-weighted-spearman-s-footrule-as-a-measure-of-distance-between-rankings-1207.2541</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-weighted-spearman-s-footrule-as-a-measure-of-distance-between-rankings-1207.2541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-weighted-spearman-s-footrule-as-a-measure-of-distance-between-rankings-1207.2541"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-chaotic-sequence-based-on-logistic-map-in-digital-communications-1207.2694</loc><lastmod>2012-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-chaotic-sequence-based-on-logistic-map-in-digital-communications-1207.2694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-chaotic-sequence-based-on-logistic-map-in-digital-communications-1207.2694"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-frankl-s-conjecture-fc-families-1207.3604</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-frankl-s-conjecture-fc-families-1207.3604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-frankl-s-conjecture-fc-families-1207.3604"/></url>
<url><loc>https://scifaro.com/en/abs/the-graphs-of-planar-soap-bubbles-1207.3761</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graphs-of-planar-soap-bubbles-1207.3761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graphs-of-planar-soap-bubbles-1207.3761"/></url>
<url><loc>https://scifaro.com/en/abs/relaxing-the-constraints-of-clustered-planarity-1207.3934</loc><lastmod>2014-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relaxing-the-constraints-of-clustered-planarity-1207.3934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relaxing-the-constraints-of-clustered-planarity-1207.3934"/></url>
<url><loc>https://scifaro.com/en/abs/multiscale-network-generation-1207.4266</loc><lastmod>2012-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiscale-network-generation-1207.4266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiscale-network-generation-1207.4266"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-and-computation-of-irregularity-of-a-graph-1207.4804</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-and-computation-of-irregularity-of-a-graph-1207.4804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-and-computation-of-irregularity-of-a-graph-1207.4804"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-on-magic-square-of-odd-order-n-1207.5117</loc><lastmod>2012-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-on-magic-square-of-odd-order-n-1207.5117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-on-magic-square-of-odd-order-n-1207.5117"/></url>
<url><loc>https://scifaro.com/en/abs/the-total-irregularity-of-a-graph-1207.5267</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-total-irregularity-of-a-graph-1207.5267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-total-irregularity-of-a-graph-1207.5267"/></url>
<url><loc>https://scifaro.com/en/abs/edge-colored-graphs-with-applications-to-homogeneous-faults-1207.5439</loc><lastmod>2012-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-colored-graphs-with-applications-to-homogeneous-faults-1207.5439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-colored-graphs-with-applications-to-homogeneous-faults-1207.5439"/></url>
<url><loc>https://scifaro.com/en/abs/fewest-repetitions-in-infinite-binary-words-1207.5723</loc><lastmod>2012-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fewest-repetitions-in-infinite-binary-words-1207.5723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fewest-repetitions-in-infinite-binary-words-1207.5723"/></url>
<url><loc>https://scifaro.com/en/abs/sum-of-squares-representation-for-the-b-ottcher-wenzel-biquadratic-form-1207.6372</loc><lastmod>2016-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sum-of-squares-representation-for-the-b-ottcher-wenzel-biquadratic-form-1207.6372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sum-of-squares-representation-for-the-b-ottcher-wenzel-biquadratic-form-1207.6372"/></url>
<url><loc>https://scifaro.com/en/abs/counting-k-l-sumsets-in-groups-of-prime-order-1207.6374</loc><lastmod>2012-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-k-l-sumsets-in-groups-of-prime-order-1207.6374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-k-l-sumsets-in-groups-of-prime-order-1207.6374"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-implementations-of-minimum-cost-flow-algorithms-1207.6381</loc><lastmod>2012-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-implementations-of-minimum-cost-flow-algorithms-1207.6381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-implementations-of-minimum-cost-flow-algorithms-1207.6381"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-the-picture-cube-puzzle-1207.6383</loc><lastmod>2012-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-the-picture-cube-puzzle-1207.6383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-the-picture-cube-puzzle-1207.6383"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-football-sequences-1207.6384</loc><lastmod>2012-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-football-sequences-1207.6384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-football-sequences-1207.6384"/></url>
<url><loc>https://scifaro.com/en/abs/extending-partial-representations-of-proper-and-unit-interval-graphs-1207.6960</loc><lastmod>2014-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-partial-representations-of-proper-and-unit-interval-graphs-1207.6960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-partial-representations-of-proper-and-unit-interval-graphs-1207.6960"/></url>
<url><loc>https://scifaro.com/en/abs/a-beginner-s-guide-to-counting-spanning-trees-in-a-graph-1207.7033</loc><lastmod>2012-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-beginner-s-guide-to-counting-spanning-trees-in-a-graph-1207.7033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-beginner-s-guide-to-counting-spanning-trees-in-a-graph-1207.7033"/></url>
<url><loc>https://scifaro.com/en/abs/set-graphs-ii-complexity-of-set-graph-recognition-and-similar-problems-1207.7184</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-graphs-ii-complexity-of-set-graph-recognition-and-similar-problems-1207.7184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-graphs-ii-complexity-of-set-graph-recognition-and-similar-problems-1207.7184"/></url>
<url><loc>https://scifaro.com/en/abs/diamond-free-degree-sequences-1208.0460</loc><lastmod>2013-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diamond-free-degree-sequences-1208.0460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diamond-free-degree-sequences-1208.0460"/></url>
<url><loc>https://scifaro.com/en/abs/vertex-nim-played-on-graphs-1208.0722</loc><lastmod>2012-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertex-nim-played-on-graphs-1208.0722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertex-nim-played-on-graphs-1208.0722"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-chromatic-number-of-a-random-hypergraph-1208.0812</loc><lastmod>2015-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-chromatic-number-of-a-random-hypergraph-1208.0812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-chromatic-number-of-a-random-hypergraph-1208.0812"/></url>
<url><loc>https://scifaro.com/en/abs/structured-recursive-separator-decompositions-for-planar-graphs-in-linear-time-1208.2223</loc><lastmod>2013-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structured-recursive-separator-decompositions-for-planar-graphs-in-linear-time-1208.2223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structured-recursive-separator-decompositions-for-planar-graphs-in-linear-time-1208.2223"/></url>
<url><loc>https://scifaro.com/en/abs/hereditary-properties-of-permutations-are-strongly-testable-1208.2624</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hereditary-properties-of-permutations-are-strongly-testable-1208.2624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hereditary-properties-of-permutations-are-strongly-testable-1208.2624"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-chemical-reaction-patterns-using-rule-composition-in-graph-grammars-1208.3153</loc><lastmod>2012-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-chemical-reaction-patterns-using-rule-composition-in-graph-grammars-1208.3153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-chemical-reaction-patterns-using-rule-composition-in-graph-grammars-1208.3153"/></url>
<url><loc>https://scifaro.com/en/abs/a-superlocal-version-of-reed-s-conjecture-1208.5188</loc><lastmod>2014-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-superlocal-version-of-reed-s-conjecture-1208.5188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-superlocal-version-of-reed-s-conjecture-1208.5188"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-eigenvalues-of-certain-matrices-over-mathbb-z-m-1208.5194</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-eigenvalues-of-certain-matrices-over-mathbb-z-m-1208.5194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-eigenvalues-of-certain-matrices-over-mathbb-z-m-1208.5194"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-statement-of-the-s-adic-conjecture-through-examples-1208.6376</loc><lastmod>2012-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-statement-of-the-s-adic-conjecture-through-examples-1208.6376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-statement-of-the-s-adic-conjecture-through-examples-1208.6376"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-the-permanent-of-block-factorizable-matrices-1208.6589</loc><lastmod>2012-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-the-permanent-of-block-factorizable-matrices-1208.6589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-the-permanent-of-block-factorizable-matrices-1208.6589"/></url>
<url><loc>https://scifaro.com/en/abs/ternary-graph-isomorphism-in-polynomial-time-after-luks-1209.0871</loc><lastmod>2012-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ternary-graph-isomorphism-in-polynomial-time-after-luks-1209.0871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ternary-graph-isomorphism-in-polynomial-time-after-luks-1209.0871"/></url>
<url><loc>https://scifaro.com/en/abs/trivalent-graph-isomorphism-in-polynomial-time-1209.1040</loc><lastmod>2012-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trivalent-graph-isomorphism-in-polynomial-time-1209.1040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trivalent-graph-isomorphism-in-polynomial-time-1209.1040"/></url>
<url><loc>https://scifaro.com/en/abs/edge-colouring-eight-regular-planar-graphs-1209.1176</loc><lastmod>2012-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-colouring-eight-regular-planar-graphs-1209.1176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-colouring-eight-regular-planar-graphs-1209.1176"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-van-kampen-squares-via-descent-data-1209.1435</loc><lastmod>2012-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-van-kampen-squares-via-descent-data-1209.1435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-van-kampen-squares-via-descent-data-1209.1435"/></url>
<url><loc>https://scifaro.com/en/abs/sensitivity-and-block-sensitivity-of-nested-canalyzing-function-1209.1597</loc><lastmod>2012-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sensitivity-and-block-sensitivity-of-nested-canalyzing-function-1209.1597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sensitivity-and-block-sensitivity-of-nested-canalyzing-function-1209.1597"/></url>
<url><loc>https://scifaro.com/en/abs/irregular-bipolar-fuzzy-graphs-1209.1682</loc><lastmod>2012-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irregular-bipolar-fuzzy-graphs-1209.1682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irregular-bipolar-fuzzy-graphs-1209.1682"/></url>
<url><loc>https://scifaro.com/en/abs/ten-times-eighteen-1209.1977</loc><lastmod>2012-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ten-times-eighteen-1209.1977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ten-times-eighteen-1209.1977"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-weight-independent-sets-in-odd-hole-free-graphs-without-dart-or-without-bull-1209.2512</loc><lastmod>2012-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-weight-independent-sets-in-odd-hole-free-graphs-without-dart-or-without-bull-1209.2512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-weight-independent-sets-in-odd-hole-free-graphs-without-dart-or-without-bull-1209.2512"/></url>
<url><loc>https://scifaro.com/en/abs/cayley-graphs-and-analysis-of-quantum-cost-for-reversible-circuit-synthesis-1209.3275</loc><lastmod>2012-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cayley-graphs-and-analysis-of-quantum-cost-for-reversible-circuit-synthesis-1209.3275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cayley-graphs-and-analysis-of-quantum-cost-for-reversible-circuit-synthesis-1209.3275"/></url>
<url><loc>https://scifaro.com/en/abs/new-transience-bounds-for-long-walks-1209.3342</loc><lastmod>2012-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-transience-bounds-for-long-walks-1209.3342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-transience-bounds-for-long-walks-1209.3342"/></url>
<url><loc>https://scifaro.com/en/abs/eight-fifth-approximation-for-tsp-paths-1209.3523</loc><lastmod>2017-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eight-fifth-approximation-for-tsp-paths-1209.3523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eight-fifth-approximation-for-tsp-paths-1209.3523"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-the-lonely-runner-conjecture-1209.3920</loc><lastmod>2017-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-the-lonely-runner-conjecture-1209.3920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-the-lonely-runner-conjecture-1209.3920"/></url>
<url><loc>https://scifaro.com/en/abs/on-morphological-hierarchical-representations-for-image-processing-and-spatial-data-clustering-1209.3925</loc><lastmod>2012-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-morphological-hierarchical-representations-for-image-processing-and-spatial-data-clustering-1209.3925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-morphological-hierarchical-representations-for-image-processing-and-spatial-data-clustering-1209.3925"/></url>
<url><loc>https://scifaro.com/en/abs/some-extremal-properties-of-the-fibonacci-word-1209.3927</loc><lastmod>2012-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-extremal-properties-of-the-fibonacci-word-1209.3927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-extremal-properties-of-the-fibonacci-word-1209.3927"/></url>
<url><loc>https://scifaro.com/en/abs/how-many-potatoes-are-in-a-mesh-1209.3954</loc><lastmod>2012-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-many-potatoes-are-in-a-mesh-1209.3954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-many-potatoes-are-in-a-mesh-1209.3954"/></url>
<url><loc>https://scifaro.com/en/abs/frozen-variables-in-random-boolean-constraint-satisfaction-problems-1209.4829</loc><lastmod>2012-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frozen-variables-in-random-boolean-constraint-satisfaction-problems-1209.4829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frozen-variables-in-random-boolean-constraint-satisfaction-problems-1209.4829"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-edge-selection-heuristic-for-computing-the-tutte-polynomial-of-an-undirected-graph-1209.5160</loc><lastmod>2012-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-edge-selection-heuristic-for-computing-the-tutte-polynomial-of-an-undirected-graph-1209.5160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-edge-selection-heuristic-for-computing-the-tutte-polynomial-of-an-undirected-graph-1209.5160"/></url>
<url><loc>https://scifaro.com/en/abs/a-formula-for-the-number-of-n-2-gap-in-digital-n-objects-1209.6462</loc><lastmod>2012-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formula-for-the-number-of-n-2-gap-in-digital-n-objects-1209.6462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formula-for-the-number-of-n-2-gap-in-digital-n-objects-1209.6462"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorics-and-the-rigidity-of-cad-systems-1210.0451</loc><lastmod>2012-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorics-and-the-rigidity-of-cad-systems-1210.0451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorics-and-the-rigidity-of-cad-systems-1210.0451"/></url>
<url><loc>https://scifaro.com/en/abs/heuristic-algorithms-for-the-bipartite-unconstrained-0-1-quadratic-programming-problem-1210.3684</loc><lastmod>2013-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristic-algorithms-for-the-bipartite-unconstrained-0-1-quadratic-programming-problem-1210.3684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristic-algorithms-for-the-bipartite-unconstrained-0-1-quadratic-programming-problem-1210.3684"/></url>
<url><loc>https://scifaro.com/en/abs/on-two-graph-theoretic-characterizations-of-tree-compatibility-1210.3762</loc><lastmod>2012-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-two-graph-theoretic-characterizations-of-tree-compatibility-1210.3762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-two-graph-theoretic-characterizations-of-tree-compatibility-1210.3762"/></url>
<url><loc>https://scifaro.com/en/abs/oriented-euler-complexes-and-signed-perfect-matchings-1210.4694</loc><lastmod>2015-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oriented-euler-complexes-and-signed-perfect-matchings-1210.4694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oriented-euler-complexes-and-signed-perfect-matchings-1210.4694"/></url>
<url><loc>https://scifaro.com/en/abs/single-source-all-sinks-max-flows-in-planar-digraphs-1210.4811</loc><lastmod>2012-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/single-source-all-sinks-max-flows-in-planar-digraphs-1210.4811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/single-source-all-sinks-max-flows-in-planar-digraphs-1210.4811"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-independent-subsets-of-powers-of-paths-and-cycles-1210.5561</loc><lastmod>2012-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-independent-subsets-of-powers-of-paths-and-cycles-1210.5561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-independent-subsets-of-powers-of-paths-and-cycles-1210.5561"/></url>
<url><loc>https://scifaro.com/en/abs/obstructions-to-chordal-circular-arc-graphs-of-small-independence-number-1210.5701</loc><lastmod>2012-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/obstructions-to-chordal-circular-arc-graphs-of-small-independence-number-1210.5701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/obstructions-to-chordal-circular-arc-graphs-of-small-independence-number-1210.5701"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-lee-codes-1210.5863</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-lee-codes-1210.5863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-lee-codes-1210.5863"/></url>
<url><loc>https://scifaro.com/en/abs/short-review-of-lattice-basis-reduction-types-and-his-applications-russian-1210.6494</loc><lastmod>2012-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-review-of-lattice-basis-reduction-types-and-his-applications-russian-1210.6494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-review-of-lattice-basis-reduction-types-and-his-applications-russian-1210.6494"/></url>
<url><loc>https://scifaro.com/en/abs/block-korkin-zolotarev-algorithm-generalization-and-their-practical-implementation-russian-1210.6502</loc><lastmod>2012-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/block-korkin-zolotarev-algorithm-generalization-and-their-practical-implementation-russian-1210.6502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/block-korkin-zolotarev-algorithm-generalization-and-their-practical-implementation-russian-1210.6502"/></url>
<url><loc>https://scifaro.com/en/abs/equitable-colorings-of-corona-multiproducts-of-graphs-1210.6568</loc><lastmod>2012-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equitable-colorings-of-corona-multiproducts-of-graphs-1210.6568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equitable-colorings-of-corona-multiproducts-of-graphs-1210.6568"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-based-proofs-of-almost-periodicity-results-and-algorithmic-applications-1210.6917</loc><lastmod>2019-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-based-proofs-of-almost-periodicity-results-and-algorithmic-applications-1210.6917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-based-proofs-of-almost-periodicity-results-and-algorithmic-applications-1210.6917"/></url>
<url><loc>https://scifaro.com/en/abs/well-covered-graphs-without-cycles-of-lengths-4-5-and-6-1210.6918</loc><lastmod>2012-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-covered-graphs-without-cycles-of-lengths-4-5-and-6-1210.6918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-covered-graphs-without-cycles-of-lengths-4-5-and-6-1210.6918"/></url>
<url><loc>https://scifaro.com/en/abs/on-construction-of-a-class-of-orthogonal-arrays-thesis-1210.6923</loc><lastmod>2012-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-construction-of-a-class-of-orthogonal-arrays-thesis-1210.6923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-construction-of-a-class-of-orthogonal-arrays-thesis-1210.6923"/></url>
<url><loc>https://scifaro.com/en/abs/the-star-and-biclique-coloring-and-choosability-problems-1210.7269</loc><lastmod>2014-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-star-and-biclique-coloring-and-choosability-problems-1210.7269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-star-and-biclique-coloring-and-choosability-problems-1210.7269"/></url>
<url><loc>https://scifaro.com/en/abs/edge-colouring-seven-regular-planar-graphs-1210.7349</loc><lastmod>2012-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-colouring-seven-regular-planar-graphs-1210.7349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-colouring-seven-regular-planar-graphs-1210.7349"/></url>
<url><loc>https://scifaro.com/en/abs/generation-of-binary-words-avoiding-alternating-patterns-1210.7620</loc><lastmod>2012-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generation-of-binary-words-avoiding-alternating-patterns-1210.7620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generation-of-binary-words-avoiding-alternating-patterns-1210.7620"/></url>
<url><loc>https://scifaro.com/en/abs/square-root-finding-problem-in-graphs-a-complete-dichotomy-theorem-1210.7684</loc><lastmod>2012-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-root-finding-problem-in-graphs-a-complete-dichotomy-theorem-1210.7684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-root-finding-problem-in-graphs-a-complete-dichotomy-theorem-1210.7684"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-planar-partial-3-trees-1210.8113</loc><lastmod>2012-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-planar-partial-3-trees-1210.8113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-planar-partial-3-trees-1210.8113"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-configurations-finding-the-number-predicted-by-the-anstee-sali-conjecture-is-np-hard-1210.8189</loc><lastmod>2013-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-configurations-finding-the-number-predicted-by-the-anstee-sali-conjecture-is-np-hard-1210.8189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-configurations-finding-the-number-predicted-by-the-anstee-sali-conjecture-is-np-hard-1210.8189"/></url>
<url><loc>https://scifaro.com/en/abs/the-emerging-field-of-signal-processing-on-graphs-extending-high-dimensional-data-analysis-to-networks-and-other-irregular-domains-1211.0053</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-emerging-field-of-signal-processing-on-graphs-extending-high-dimensional-data-analysis-to-networks-and-other-irregular-domains-1211.0053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-emerging-field-of-signal-processing-on-graphs-extending-high-dimensional-data-analysis-to-networks-and-other-irregular-domains-1211.0053"/></url>
<url><loc>https://scifaro.com/en/abs/local-improvement-gives-better-expanders-1211.0524</loc><lastmod>2012-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-improvement-gives-better-expanders-1211.0524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-improvement-gives-better-expanders-1211.0524"/></url>
<url><loc>https://scifaro.com/en/abs/on-threshold-models-over-finite-networks-1211.0654</loc><lastmod>2013-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-threshold-models-over-finite-networks-1211.0654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-threshold-models-over-finite-networks-1211.0654"/></url>
<url><loc>https://scifaro.com/en/abs/faster-approximation-of-max-flow-for-directed-graphs-1211.0752</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-approximation-of-max-flow-for-directed-graphs-1211.0752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-approximation-of-max-flow-for-directed-graphs-1211.0752"/></url>
<url><loc>https://scifaro.com/en/abs/myhill-nerode-methods-for-hypergraphs-1211.1299</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/myhill-nerode-methods-for-hypergraphs-1211.1299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/myhill-nerode-methods-for-hypergraphs-1211.1299"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-proof-that-chi-can-be-bounded-epsilon-away-from-delta-1-towards-omega-1211.1410</loc><lastmod>2012-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-proof-that-chi-can-be-bounded-epsilon-away-from-delta-1-towards-omega-1211.1410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-proof-that-chi-can-be-bounded-epsilon-away-from-delta-1-towards-omega-1211.1410"/></url>
<url><loc>https://scifaro.com/en/abs/edge-distribution-in-generalized-graph-products-1211.1467</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-distribution-in-generalized-graph-products-1211.1467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-distribution-in-generalized-graph-products-1211.1467"/></url>
<url><loc>https://scifaro.com/en/abs/paths-to-stable-allocations-1211.2169</loc><lastmod>2014-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paths-to-stable-allocations-1211.2169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paths-to-stable-allocations-1211.2169"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-flows-over-time-a-first-step-towards-solving-dynamic-packing-problems-1211.2177</loc><lastmod>2012-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-flows-over-time-a-first-step-towards-solving-dynamic-packing-problems-1211.2177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-flows-over-time-a-first-step-towards-solving-dynamic-packing-problems-1211.2177"/></url>
<url><loc>https://scifaro.com/en/abs/lattices-and-maximum-flow-algorithms-in-planar-graphs-1211.2189</loc><lastmod>2012-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattices-and-maximum-flow-algorithms-in-planar-graphs-1211.2189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattices-and-maximum-flow-algorithms-in-planar-graphs-1211.2189"/></url>
<url><loc>https://scifaro.com/en/abs/independent-subsets-of-powers-of-paths-and-fibonacci-cubes-1211.2251</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-subsets-of-powers-of-paths-and-fibonacci-cubes-1211.2251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-subsets-of-powers-of-paths-and-fibonacci-cubes-1211.2251"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-dubins-paths-1211.2365</loc><lastmod>2012-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-dubins-paths-1211.2365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-dubins-paths-1211.2365"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-christoffel-factorizations-1211.3049</loc><lastmod>2013-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-christoffel-factorizations-1211.3049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-christoffel-factorizations-1211.3049"/></url>
<url><loc>https://scifaro.com/en/abs/the-encoding-of-natural-numbers-as-nested-parentheses-strings-with-associated-probability-distributions-1211.3428</loc><lastmod>2012-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-encoding-of-natural-numbers-as-nested-parentheses-strings-with-associated-probability-distributions-1211.3428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-encoding-of-natural-numbers-as-nested-parentheses-strings-with-associated-probability-distributions-1211.3428"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-for-the-crossing-number-of-bubble-sort-graph-bn-1211.4433</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-for-the-crossing-number-of-bubble-sort-graph-bn-1211.4433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-for-the-crossing-number-of-bubble-sort-graph-bn-1211.4433"/></url>
<url><loc>https://scifaro.com/en/abs/the-crossing-numbers-of-k-n-n-nk-2-k-n-times-p-2-k-n-times-p-3-and-k-n-times-c-4-1211.4437</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crossing-numbers-of-k-n-n-nk-2-k-n-times-p-2-k-n-times-p-3-and-k-n-times-c-4-1211.4437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crossing-numbers-of-k-n-n-nk-2-k-n-times-p-2-k-n-times-p-3-and-k-n-times-c-4-1211.4437"/></url>
<url><loc>https://scifaro.com/en/abs/the-crossing-number-of-the-generalized-petersen-graph-p-10-3-is-six-1211.4438</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crossing-number-of-the-generalized-petersen-graph-p-10-3-is-six-1211.4438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crossing-number-of-the-generalized-petersen-graph-p-10-3-is-six-1211.4438"/></url>
<url><loc>https://scifaro.com/en/abs/the-crossing-numbers-of-k-m-times-p-n-and-k-m-times-c-n-1211.4641</loc><lastmod>2012-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crossing-numbers-of-k-m-times-p-n-and-k-m-times-c-n-1211.4641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crossing-numbers-of-k-m-times-p-n-and-k-m-times-c-n-1211.4641"/></url>
<url><loc>https://scifaro.com/en/abs/the-crossing-number-of-pancake-graph-p-4-is-six-1211.4642</loc><lastmod>2012-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crossing-number-of-pancake-graph-p-4-is-six-1211.4642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crossing-number-of-pancake-graph-p-4-is-six-1211.4642"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-concrete-categories-of-graphs-1211.6715</loc><lastmod>2012-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-concrete-categories-of-graphs-1211.6715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-concrete-categories-of-graphs-1211.6715"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-cayley-graphs-and-cellular-automata-over-them-1212.0027</loc><lastmod>2014-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-cayley-graphs-and-cellular-automata-over-them-1212.0027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-cayley-graphs-and-cellular-automata-over-them-1212.0027"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-the-dual-planar-triangulations-1212.0064</loc><lastmod>2012-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-the-dual-planar-triangulations-1212.0064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-the-dual-planar-triangulations-1212.0064"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-lower-bound-for-stack-sorting-1212.0836</loc><lastmod>2012-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-lower-bound-for-stack-sorting-1212.0836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-lower-bound-for-stack-sorting-1212.0836"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-lower-bound-for-the-ramsey-number-r-4-8-1212.1328</loc><lastmod>2013-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-lower-bound-for-the-ramsey-number-r-4-8-1212.1328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-lower-bound-for-the-ramsey-number-r-4-8-1212.1328"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-the-fibonacci-word-fractal-and-the-fibonacci-snowflake-1212.1368</loc><lastmod>2014-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-the-fibonacci-word-fractal-and-the-fibonacci-snowflake-1212.1368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-the-fibonacci-word-fractal-and-the-fibonacci-snowflake-1212.1368"/></url>
<url><loc>https://scifaro.com/en/abs/egalitarian-graph-orientations-1212.2178</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/egalitarian-graph-orientations-1212.2178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/egalitarian-graph-orientations-1212.2178"/></url>
<url><loc>https://scifaro.com/en/abs/tree-projections-and-structural-decomposition-methods-minimality-and-game-theoretic-characterization-1212.2314</loc><lastmod>2012-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-projections-and-structural-decomposition-methods-minimality-and-game-theoretic-characterization-1212.2314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-projections-and-structural-decomposition-methods-minimality-and-game-theoretic-characterization-1212.2314"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-integers-from-pairwise-distances-1212.2386</loc><lastmod>2012-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-integers-from-pairwise-distances-1212.2386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-integers-from-pairwise-distances-1212.2386"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-upper-bound-on-graph-diameter-based-on-laplacian-eigenvalues-1212.2701</loc><lastmod>2012-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-upper-bound-on-graph-diameter-based-on-laplacian-eigenvalues-1212.2701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-upper-bound-on-graph-diameter-based-on-laplacian-eigenvalues-1212.2701"/></url>
<url><loc>https://scifaro.com/en/abs/claw-free-graphs-skeletal-graphs-and-a-stronger-conjecture-on-omega-delta-and-chi-1212.3036</loc><lastmod>2012-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/claw-free-graphs-skeletal-graphs-and-a-stronger-conjecture-on-omega-delta-and-chi-1212.3036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/claw-free-graphs-skeletal-graphs-and-a-stronger-conjecture-on-omega-delta-and-chi-1212.3036"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-product-homomorphism-problem-and-cq-definability-1212.3534</loc><lastmod>2012-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-product-homomorphism-problem-and-cq-definability-1212.3534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-product-homomorphism-problem-and-cq-definability-1212.3534"/></url>
<url><loc>https://scifaro.com/en/abs/small-snarks-with-large-oddness-1212.3641</loc><lastmod>2012-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-snarks-with-large-oddness-1212.3641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-snarks-with-large-oddness-1212.3641"/></url>
<url><loc>https://scifaro.com/en/abs/can-selfish-groups-be-self-enforcing-1212.3782</loc><lastmod>2014-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/can-selfish-groups-be-self-enforcing-1212.3782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/can-selfish-groups-be-self-enforcing-1212.3782"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-minimum-cost-k-node-connected-subgraphs-via-independence-free-graphs-1212.3981</loc><lastmod>2012-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-minimum-cost-k-node-connected-subgraphs-via-independence-free-graphs-1212.3981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-minimum-cost-k-node-connected-subgraphs-via-independence-free-graphs-1212.3981"/></url>
<url><loc>https://scifaro.com/en/abs/graph-products-revisited-tight-approximation-hardness-of-induced-matching-poset-dimension-and-more-1212.4129</loc><lastmod>2014-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-products-revisited-tight-approximation-hardness-of-induced-matching-poset-dimension-and-more-1212.4129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-products-revisited-tight-approximation-hardness-of-induced-matching-poset-dimension-and-more-1212.4129"/></url>
<url><loc>https://scifaro.com/en/abs/2-connecting-outerplanar-graphs-without-blowing-up-the-pathwidth-1212.6382</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-connecting-outerplanar-graphs-without-blowing-up-the-pathwidth-1212.6382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-connecting-outerplanar-graphs-without-blowing-up-the-pathwidth-1212.6382"/></url>
<url><loc>https://scifaro.com/en/abs/regular-bipartite-graphs-and-their-properties-1212.6882</loc><lastmod>2015-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-bipartite-graphs-and-their-properties-1212.6882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-bipartite-graphs-and-their-properties-1212.6882"/></url>
<url><loc>https://scifaro.com/en/abs/partition-parameters-for-girth-maximum-m-r-btus-1212.6883</loc><lastmod>2013-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partition-parameters-for-girth-maximum-m-r-btus-1212.6883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partition-parameters-for-girth-maximum-m-r-btus-1212.6883"/></url>
<url><loc>https://scifaro.com/en/abs/pruning-a-poset-with-veins-1301.0759</loc><lastmod>2013-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pruning-a-poset-with-veins-1301.0759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pruning-a-poset-with-veins-1301.0759"/></url>
<url><loc>https://scifaro.com/en/abs/kadanoff-sand-piles-following-the-snowball-1301.0997</loc><lastmod>2013-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kadanoff-sand-piles-following-the-snowball-1301.0997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kadanoff-sand-piles-following-the-snowball-1301.0997"/></url>
<url><loc>https://scifaro.com/en/abs/practical-graph-isomorphism-ii-1301.1493</loc><lastmod>2013-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-graph-isomorphism-ii-1301.1493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-graph-isomorphism-ii-1301.1493"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-entropy-compression-in-pattern-avoidance-1301.1873</loc><lastmod>2013-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-entropy-compression-in-pattern-avoidance-1301.1873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-entropy-compression-in-pattern-avoidance-1301.1873"/></url>
<url><loc>https://scifaro.com/en/abs/clique-versus-independent-set-1301.2474</loc><lastmod>2014-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-versus-independent-set-1301.2474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-versus-independent-set-1301.2474"/></url>
<url><loc>https://scifaro.com/en/abs/recurrence-relations-versus-succession-rules-1301.2967</loc><lastmod>2013-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recurrence-relations-versus-succession-rules-1301.2967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recurrence-relations-versus-succession-rules-1301.2967"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-least-number-of-palindromes-contained-in-an-infinite-word-1301.3376</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-least-number-of-palindromes-contained-in-an-infinite-word-1301.3376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-least-number-of-palindromes-contained-in-an-infinite-word-1301.3376"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-the-size-of-sound-monotone-switching-networks-accepting-permutation-sets-of-directed-trees-1301.3780</loc><lastmod>2013-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-the-size-of-sound-monotone-switching-networks-accepting-permutation-sets-of-directed-trees-1301.3780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-the-size-of-sound-monotone-switching-networks-accepting-permutation-sets-of-directed-trees-1301.3780"/></url>
<url><loc>https://scifaro.com/en/abs/on-retracts-absolute-retracts-and-folds-in-cographs-1301.3979</loc><lastmod>2013-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-retracts-absolute-retracts-and-folds-in-cographs-1301.3979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-retracts-absolute-retracts-and-folds-in-cographs-1301.3979"/></url>
<url><loc>https://scifaro.com/en/abs/square-property-equitable-partitions-and-product-like-graphs-1301.6898</loc><lastmod>2014-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-property-equitable-partitions-and-product-like-graphs-1301.6898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-property-equitable-partitions-and-product-like-graphs-1301.6898"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-maximum-degree-d-at-least-17-and-maximum-average-degree-less-than-3-are-list-2-distance-d-2-colorable-1301.7090</loc><lastmod>2013-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-maximum-degree-d-at-least-17-and-maximum-average-degree-less-than-3-are-list-2-distance-d-2-colorable-1301.7090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-maximum-degree-d-at-least-17-and-maximum-average-degree-less-than-3-are-list-2-distance-d-2-colorable-1301.7090"/></url>
<url><loc>https://scifaro.com/en/abs/the-phase-transition-in-inhomogeneous-random-intersection-graphs-1301.7320</loc><lastmod>2013-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-phase-transition-in-inhomogeneous-random-intersection-graphs-1301.7320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-phase-transition-in-inhomogeneous-random-intersection-graphs-1301.7320"/></url>
<url><loc>https://scifaro.com/en/abs/exact-algorithms-for-dominating-induced-matchings-1301.7602</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-algorithms-for-dominating-induced-matchings-1301.7602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-algorithms-for-dominating-induced-matchings-1301.7602"/></url>
<url><loc>https://scifaro.com/en/abs/fiedler-vectors-and-elongation-of-graphs-a-threshold-phenomenon-on-a-particular-class-of-trees-1302.1266</loc><lastmod>2013-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fiedler-vectors-and-elongation-of-graphs-a-threshold-phenomenon-on-a-particular-class-of-trees-1302.1266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fiedler-vectors-and-elongation-of-graphs-a-threshold-phenomenon-on-a-particular-class-of-trees-1302.1266"/></url>
<url><loc>https://scifaro.com/en/abs/clique-cycle-transversals-in-distance-hereditary-graphs-1302.1402</loc><lastmod>2013-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-cycle-transversals-in-distance-hereditary-graphs-1302.1402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-cycle-transversals-in-distance-hereditary-graphs-1302.1402"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraph-automata-a-theoretical-model-for-patterned-self-assembly-1302.2840</loc><lastmod>2013-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraph-automata-a-theoretical-model-for-patterned-self-assembly-1302.2840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraph-automata-a-theoretical-model-for-patterned-self-assembly-1302.2840"/></url>
<url><loc>https://scifaro.com/en/abs/peeling-the-grid-1302.3200</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peeling-the-grid-1302.3200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peeling-the-grid-1302.3200"/></url>
<url><loc>https://scifaro.com/en/abs/dynamical-properties-of-discrete-reaction-networks-1302.3363</loc><lastmod>2013-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamical-properties-of-discrete-reaction-networks-1302.3363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamical-properties-of-discrete-reaction-networks-1302.3363"/></url>
<url><loc>https://scifaro.com/en/abs/eigenfunctions-of-the-edge-based-laplacian-on-a-graph-1302.3433</loc><lastmod>2013-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eigenfunctions-of-the-edge-based-laplacian-on-a-graph-1302.3433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eigenfunctions-of-the-edge-based-laplacian-on-a-graph-1302.3433"/></url>
<url><loc>https://scifaro.com/en/abs/recoloring-bounded-treewidth-graphs-1302.3486</loc><lastmod>2013-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recoloring-bounded-treewidth-graphs-1302.3486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recoloring-bounded-treewidth-graphs-1302.3486"/></url>
<url><loc>https://scifaro.com/en/abs/variable-density-preserving-topology-grids-and-the-digital-models-for-the-plane-1302.3809</loc><lastmod>2013-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-density-preserving-topology-grids-and-the-digital-models-for-the-plane-1302.3809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-density-preserving-topology-grids-and-the-digital-models-for-the-plane-1302.3809"/></url>
<url><loc>https://scifaro.com/en/abs/rumor-spreading-in-random-evolving-graphs-1302.3828</loc><lastmod>2013-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rumor-spreading-in-random-evolving-graphs-1302.3828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rumor-spreading-in-random-evolving-graphs-1302.3828"/></url>
<url><loc>https://scifaro.com/en/abs/upper-and-lower-bound-on-the-cardinality-containing-shortest-vectors-in-a-lattice-reduced-by-block-korkin-zolotarev-method-russian-1302.4062</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-and-lower-bound-on-the-cardinality-containing-shortest-vectors-in-a-lattice-reduced-by-block-korkin-zolotarev-method-russian-1302.4062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-and-lower-bound-on-the-cardinality-containing-shortest-vectors-in-a-lattice-reduced-by-block-korkin-zolotarev-method-russian-1302.4062"/></url>
<url><loc>https://scifaro.com/en/abs/a-o-n-monotonicity-tester-for-boolean-functions-over-the-hypercube-1302.4536</loc><lastmod>2014-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-o-n-monotonicity-tester-for-boolean-functions-over-the-hypercube-1302.4536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-o-n-monotonicity-tester-for-boolean-functions-over-the-hypercube-1302.4536"/></url>
<url><loc>https://scifaro.com/en/abs/bar-1-visibility-drawings-of-1-planar-graphs-1302.4870</loc><lastmod>2013-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bar-1-visibility-drawings-of-1-planar-graphs-1302.4870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bar-1-visibility-drawings-of-1-planar-graphs-1302.4870"/></url>
<url><loc>https://scifaro.com/en/abs/the-jordan-brouwer-theorem-for-the-digital-normal-n-space-zn-1302.5342</loc><lastmod>2013-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-jordan-brouwer-theorem-for-the-digital-normal-n-space-zn-1302.5342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-jordan-brouwer-theorem-for-the-digital-normal-n-space-zn-1302.5342"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-based-search-algorithm-for-finding-a-regular-bi-partite-graph-of-maximum-attainable-girth-for-specified-degree-and-number-of-vertices-1302.5754</loc><lastmod>2013-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-based-search-algorithm-for-finding-a-regular-bi-partite-graph-of-maximum-attainable-girth-for-specified-degree-and-number-of-vertices-1302.5754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-based-search-algorithm-for-finding-a-regular-bi-partite-graph-of-maximum-attainable-girth-for-specified-degree-and-number-of-vertices-1302.5754"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-the-girth-for-regular-bi-partite-graphs-with-degree-3-1302.5755</loc><lastmod>2013-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-the-girth-for-regular-bi-partite-graphs-with-degree-3-1302.5755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-the-girth-for-regular-bi-partite-graphs-with-degree-3-1302.5755"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-minimum-cycle-basis-in-weighted-partial-2-trees-1302.5889</loc><lastmod>2013-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-minimum-cycle-basis-in-weighted-partial-2-trees-1302.5889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-minimum-cycle-basis-in-weighted-partial-2-trees-1302.5889"/></url>
<url><loc>https://scifaro.com/en/abs/fo-model-checking-of-interval-graphs-1302.6043</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-model-checking-of-interval-graphs-1302.6043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-model-checking-of-interval-graphs-1302.6043"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-on-the-size-of-grain-correcting-codes-1302.6154</loc><lastmod>2013-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-on-the-size-of-grain-correcting-codes-1302.6154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-on-the-size-of-grain-correcting-codes-1302.6154"/></url>
<url><loc>https://scifaro.com/en/abs/threshold-coloring-and-unit-cube-contact-representation-of-graphs-1302.6183</loc><lastmod>2013-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/threshold-coloring-and-unit-cube-contact-representation-of-graphs-1302.6183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/threshold-coloring-and-unit-cube-contact-representation-of-graphs-1302.6183"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-for-rumor-spreading-with-vertex-expansion-1302.6243</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-for-rumor-spreading-with-vertex-expansion-1302.6243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-for-rumor-spreading-with-vertex-expansion-1302.6243"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-theorems-for-boolean-networks-expressed-in-terms-of-forbidden-subnetworks-1302.6346</loc><lastmod>2014-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-theorems-for-boolean-networks-expressed-in-terms-of-forbidden-subnetworks-1302.6346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-theorems-for-boolean-networks-expressed-in-terms-of-forbidden-subnetworks-1302.6346"/></url>
<url><loc>https://scifaro.com/en/abs/the-vc-dimension-of-graphs-with-respect-to-k-connected-subgraphs-1302.6500</loc><lastmod>2016-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vc-dimension-of-graphs-with-respect-to-k-connected-subgraphs-1302.6500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vc-dimension-of-graphs-with-respect-to-k-connected-subgraphs-1302.6500"/></url>
<url><loc>https://scifaro.com/en/abs/on-maximum-differential-coloring-of-planar-graphs-1302.7085</loc><lastmod>2014-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-maximum-differential-coloring-of-planar-graphs-1302.7085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-maximum-differential-coloring-of-planar-graphs-1302.7085"/></url>
<url><loc>https://scifaro.com/en/abs/non-overlapping-codes-1303.1026</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-overlapping-codes-1303.1026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-overlapping-codes-1303.1026"/></url>
<url><loc>https://scifaro.com/en/abs/grid-minors-in-damaged-grids-1303.1136</loc><lastmod>2014-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grid-minors-in-damaged-grids-1303.1136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grid-minors-in-damaged-grids-1303.1136"/></url>
<url><loc>https://scifaro.com/en/abs/on-finding-lekkerkerker-boland-subgraphs-1303.1840</loc><lastmod>2013-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finding-lekkerkerker-boland-subgraphs-1303.1840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finding-lekkerkerker-boland-subgraphs-1303.1840"/></url>
<url><loc>https://scifaro.com/en/abs/characterizations-of-periods-of-multidimensional-shifts-1303.2462</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizations-of-periods-of-multidimensional-shifts-1303.2462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizations-of-periods-of-multidimensional-shifts-1303.2462"/></url>
<url><loc>https://scifaro.com/en/abs/the-price-of-connectivity-for-vertex-cover-1303.2478</loc><lastmod>2013-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-price-of-connectivity-for-vertex-cover-1303.2478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-price-of-connectivity-for-vertex-cover-1303.2478"/></url>
<url><loc>https://scifaro.com/en/abs/on-f-symmetries-of-the-independence-polynomial-1303.2564</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-f-symmetries-of-the-independence-polynomial-1303.2564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-f-symmetries-of-the-independence-polynomial-1303.2564"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-connected-dominating-set-in-graphs-without-long-paths-and-cycles-1303.2868</loc><lastmod>2013-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-connected-dominating-set-in-graphs-without-long-paths-and-cycles-1303.2868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-connected-dominating-set-in-graphs-without-long-paths-and-cycles-1303.2868"/></url>
<url><loc>https://scifaro.com/en/abs/potential-maximal-clique-algorithms-for-perfect-phylogeny-problems-1303.3931</loc><lastmod>2013-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/potential-maximal-clique-algorithms-for-perfect-phylogeny-problems-1303.3931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/potential-maximal-clique-algorithms-for-perfect-phylogeny-problems-1303.3931"/></url>
<url><loc>https://scifaro.com/en/abs/planar-graphs-with-maximum-degree-d-at-least-8-are-d-1-edge-choosable-1303.4025</loc><lastmod>2013-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-graphs-with-maximum-degree-d-at-least-8-are-d-1-edge-choosable-1303.4025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-graphs-with-maximum-degree-d-at-least-8-are-d-1-edge-choosable-1303.4025"/></url>
<url><loc>https://scifaro.com/en/abs/the-failure-risk-analysis-of-digital-circuits-1303.4051</loc><lastmod>2013-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-failure-risk-analysis-of-digital-circuits-1303.4051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-failure-risk-analysis-of-digital-circuits-1303.4051"/></url>
<url><loc>https://scifaro.com/en/abs/2-stack-pushall-sortable-permutations-1303.4376</loc><lastmod>2013-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-stack-pushall-sortable-permutations-1303.4376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-stack-pushall-sortable-permutations-1303.4376"/></url>
<url><loc>https://scifaro.com/en/abs/using-carry-truncated-addition-to-analyze-add-rotate-xor-hash-algorithms-1303.4448</loc><lastmod>2013-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-carry-truncated-addition-to-analyze-add-rotate-xor-hash-algorithms-1303.4448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-carry-truncated-addition-to-analyze-add-rotate-xor-hash-algorithms-1303.4448"/></url>
<url><loc>https://scifaro.com/en/abs/markov-chain-aggregation-and-its-applications-to-combinatorial-reaction-networks-1303.4532</loc><lastmod>2013-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markov-chain-aggregation-and-its-applications-to-combinatorial-reaction-networks-1303.4532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markov-chain-aggregation-and-its-applications-to-combinatorial-reaction-networks-1303.4532"/></url>
<url><loc>https://scifaro.com/en/abs/study-on-universal-lossless-data-compression-by-using-context-dependence-multilevel-pattern-matching-grammar-transform-1303.4854</loc><lastmod>2013-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/study-on-universal-lossless-data-compression-by-using-context-dependence-multilevel-pattern-matching-grammar-transform-1303.4854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/study-on-universal-lossless-data-compression-by-using-context-dependence-multilevel-pattern-matching-grammar-transform-1303.4854"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-edge-disjoint-paths-in-k-sums-of-graphs-1303.4897</loc><lastmod>2013-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-edge-disjoint-paths-in-k-sums-of-graphs-1303.4897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-edge-disjoint-paths-in-k-sums-of-graphs-1303.4897"/></url>
<url><loc>https://scifaro.com/en/abs/sorting-in-lattices-1303.5560</loc><lastmod>2013-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sorting-in-lattices-1303.5560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sorting-in-lattices-1303.5560"/></url>
<url><loc>https://scifaro.com/en/abs/automorphisms-of-cayley-graphs-generated-by-transposition-sets-1303.5974</loc><lastmod>2013-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automorphisms-of-cayley-graphs-generated-by-transposition-sets-1303.5974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automorphisms-of-cayley-graphs-generated-by-transposition-sets-1303.5974"/></url>
<url><loc>https://scifaro.com/en/abs/improved-lower-bounds-for-sum-coloring-via-clique-decomposition-1303.6761</loc><lastmod>2013-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-lower-bounds-for-sum-coloring-via-clique-decomposition-1303.6761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-lower-bounds-for-sum-coloring-via-clique-decomposition-1303.6761"/></url>
<url><loc>https://scifaro.com/en/abs/proving-the-pressing-game-conjecture-on-linear-graphs-1303.6799</loc><lastmod>2013-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-the-pressing-game-conjecture-on-linear-graphs-1303.6799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-the-pressing-game-conjecture-on-linear-graphs-1303.6799"/></url>
<url><loc>https://scifaro.com/en/abs/partial-star-products-a-local-covering-approach-for-the-recognition-of-approximate-cartesian-product-graphs-1303.6803</loc><lastmod>2014-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-star-products-a-local-covering-approach-for-the-recognition-of-approximate-cartesian-product-graphs-1303.6803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-star-products-a-local-covering-approach-for-the-recognition-of-approximate-cartesian-product-graphs-1303.6803"/></url>
<url><loc>https://scifaro.com/en/abs/incidence-coloring-game-and-arboricity-of-graphs-1304.0166</loc><lastmod>2013-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incidence-coloring-game-and-arboricity-of-graphs-1304.0166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incidence-coloring-game-and-arboricity-of-graphs-1304.0166"/></url>
<url><loc>https://scifaro.com/en/abs/the-total-irregularity-of-graphs-under-graph-operations-1304.0185</loc><lastmod>2013-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-total-irregularity-of-graphs-under-graph-operations-1304.0185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-total-irregularity-of-graphs-under-graph-operations-1304.0185"/></url>
<url><loc>https://scifaro.com/en/abs/amalgam-width-of-matroids-1304.0299</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/amalgam-width-of-matroids-1304.0299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/amalgam-width-of-matroids-1304.0299"/></url>
<url><loc>https://scifaro.com/en/abs/passages-in-graphs-1304.1000</loc><lastmod>2013-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/passages-in-graphs-1304.1000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/passages-in-graphs-1304.1000"/></url>
<url><loc>https://scifaro.com/en/abs/chasing-the-k-colorability-threshold-1304.1063</loc><lastmod>2017-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chasing-the-k-colorability-threshold-1304.1063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chasing-the-k-colorability-threshold-1304.1063"/></url>
<url><loc>https://scifaro.com/en/abs/finding-primitive-elements-in-finite-fields-of-small-characteristic-1304.1206</loc><lastmod>2013-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-primitive-elements-in-finite-fields-of-small-characteristic-1304.1206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-primitive-elements-in-finite-fields-of-small-characteristic-1304.1206"/></url>
<url><loc>https://scifaro.com/en/abs/balancing-parallel-assembly-lines-with-disabled-workers-1304.1423</loc><lastmod>2014-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balancing-parallel-assembly-lines-with-disabled-workers-1304.1423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balancing-parallel-assembly-lines-with-disabled-workers-1304.1423"/></url>
<url><loc>https://scifaro.com/en/abs/the-freeness-problem-over-matrix-semigroups-and-bounded-languages-1304.1637</loc><lastmod>2013-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-freeness-problem-over-matrix-semigroups-and-bounded-languages-1304.1637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-freeness-problem-over-matrix-semigroups-and-bounded-languages-1304.1637"/></url>
<url><loc>https://scifaro.com/en/abs/excluding-cycles-with-a-fixed-number-of-chords-1304.1718</loc><lastmod>2013-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/excluding-cycles-with-a-fixed-number-of-chords-1304.1718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/excluding-cycles-with-a-fixed-number-of-chords-1304.1718"/></url>
<url><loc>https://scifaro.com/en/abs/analytic-samplers-and-the-combinatorial-rejection-method-1304.1881</loc><lastmod>2014-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analytic-samplers-and-the-combinatorial-rejection-method-1304.1881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analytic-samplers-and-the-combinatorial-rejection-method-1304.1881"/></url>
<url><loc>https://scifaro.com/en/abs/the-implementation-of-the-parallel-shortest-vector-enumerate-in-the-block-korkin-zolotarev-method-1304.1900</loc><lastmod>2013-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-implementation-of-the-parallel-shortest-vector-enumerate-in-the-block-korkin-zolotarev-method-1304.1900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-implementation-of-the-parallel-shortest-vector-enumerate-in-the-block-korkin-zolotarev-method-1304.1900"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-computation-of-pseudo-inverse-of-laplacian-theory-and-applications-1304.2300</loc><lastmod>2013-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-computation-of-pseudo-inverse-of-laplacian-theory-and-applications-1304.2300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-computation-of-pseudo-inverse-of-laplacian-theory-and-applications-1304.2300"/></url>
<url><loc>https://scifaro.com/en/abs/a-memetic-algorithm-for-the-minimum-sum-coloring-problem-1304.2641</loc><lastmod>2014-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-memetic-algorithm-for-the-minimum-sum-coloring-problem-1304.2641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-memetic-algorithm-for-the-minimum-sum-coloring-problem-1304.2641"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-offline-allocation-of-weighted-balls-into-bins-1304.2881</loc><lastmod>2013-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-offline-allocation-of-weighted-balls-into-bins-1304.2881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-offline-allocation-of-weighted-balls-into-bins-1304.2881"/></url>
<url><loc>https://scifaro.com/en/abs/a-notion-of-graph-likelihood-and-an-infinite-monkey-theorem-1304.3600</loc><lastmod>2013-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-notion-of-graph-likelihood-and-an-infinite-monkey-theorem-1304.3600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-notion-of-graph-likelihood-and-an-infinite-monkey-theorem-1304.3600"/></url>
<url><loc>https://scifaro.com/en/abs/the-planar-directed-k-vertex-disjoint-paths-problem-is-fixed-parameter-tractable-1304.4207</loc><lastmod>2013-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-planar-directed-k-vertex-disjoint-paths-problem-is-fixed-parameter-tractable-1304.4207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-planar-directed-k-vertex-disjoint-paths-problem-is-fixed-parameter-tractable-1304.4207"/></url>
<url><loc>https://scifaro.com/en/abs/typical-property-of-one-class-of-combinatory-objects-and-estimation-from-above-corresponding-combinatory-numbers-1304.4363</loc><lastmod>2013-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typical-property-of-one-class-of-combinatory-objects-and-estimation-from-above-corresponding-combinatory-numbers-1304.4363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typical-property-of-one-class-of-combinatory-objects-and-estimation-from-above-corresponding-combinatory-numbers-1304.4363"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-perspective-on-vertex-connectivity-1304.4553</loc><lastmod>2013-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-perspective-on-vertex-connectivity-1304.4553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-perspective-on-vertex-connectivity-1304.4553"/></url>
<url><loc>https://scifaro.com/en/abs/kadanoff-sand-pile-model-avalanche-structure-and-wave-shape-1304.5109</loc><lastmod>2013-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kadanoff-sand-pile-model-avalanche-structure-and-wave-shape-1304.5109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kadanoff-sand-pile-model-avalanche-structure-and-wave-shape-1304.5109"/></url>
<url><loc>https://scifaro.com/en/abs/fair-sets-of-some-class-of-graphs-1304.5378</loc><lastmod>2013-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fair-sets-of-some-class-of-graphs-1304.5378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fair-sets-of-some-class-of-graphs-1304.5378"/></url>
<url><loc>https://scifaro.com/en/abs/new-polynomial-cases-of-the-weighted-efficient-domination-problem-1304.6255</loc><lastmod>2013-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-polynomial-cases-of-the-weighted-efficient-domination-problem-1304.6255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-polynomial-cases-of-the-weighted-efficient-domination-problem-1304.6255"/></url>
<url><loc>https://scifaro.com/en/abs/on-quasiperiodic-morphisms-1304.6280</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-quasiperiodic-morphisms-1304.6280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-quasiperiodic-morphisms-1304.6280"/></url>
<url><loc>https://scifaro.com/en/abs/about-strongly-universal-cellular-automata-1304.6316</loc><lastmod>2013-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-strongly-universal-cellular-automata-1304.6316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-strongly-universal-cellular-automata-1304.6316"/></url>
<url><loc>https://scifaro.com/en/abs/on-independence-domination-1304.6450</loc><lastmod>2013-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-independence-domination-1304.6450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-independence-domination-1304.6450"/></url>
<url><loc>https://scifaro.com/en/abs/mcmc-sampling-colourings-and-independent-sets-of-g-n-d-n-near-the-uniqueness-threshold-1304.6666</loc><lastmod>2017-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mcmc-sampling-colourings-and-independent-sets-of-g-n-d-n-near-the-uniqueness-threshold-1304.6666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mcmc-sampling-colourings-and-independent-sets-of-g-n-d-n-near-the-uniqueness-threshold-1304.6666"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-cellular-automata-correlations-decidability-and-simulations-1304.7185</loc><lastmod>2013-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-cellular-automata-correlations-decidability-and-simulations-1304.7185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-cellular-automata-correlations-decidability-and-simulations-1304.7185"/></url>
<url><loc>https://scifaro.com/en/abs/digenes-genetic-algorithms-to-discover-conjectures-about-directed-and-undirected-graphs-1304.7993</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digenes-genetic-algorithms-to-discover-conjectures-about-directed-and-undirected-graphs-1304.7993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digenes-genetic-algorithms-to-discover-conjectures-about-directed-and-undirected-graphs-1304.7993"/></url>
<url><loc>https://scifaro.com/en/abs/interval-exchanges-admissibility-and-branching-rauzy-induction-1305.0120</loc><lastmod>2015-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-exchanges-admissibility-and-branching-rauzy-induction-1305.0120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-exchanges-admissibility-and-branching-rauzy-induction-1305.0120"/></url>
<url><loc>https://scifaro.com/en/abs/the-finite-index-basis-property-1305.0127</loc><lastmod>2015-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-finite-index-basis-property-1305.0127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-finite-index-basis-property-1305.0127"/></url>
<url><loc>https://scifaro.com/en/abs/an-s-adic-characterization-of-minimal-subshifts-with-first-difference-of-complexity-1-leq-p-n-1-p-n-leq-2-1305.0434</loc><lastmod>2013-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-s-adic-characterization-of-minimal-subshifts-with-first-difference-of-complexity-1-leq-p-n-1-p-n-leq-2-1305.0434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-s-adic-characterization-of-minimal-subshifts-with-first-difference-of-complexity-1-leq-p-n-1-p-n-leq-2-1305.0434"/></url>
<url><loc>https://scifaro.com/en/abs/mixing-of-the-glauber-dynamics-for-the-ferromagnetic-potts-model-1305.0776</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixing-of-the-glauber-dynamics-for-the-ferromagnetic-potts-model-1305.0776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixing-of-the-glauber-dynamics-for-the-ferromagnetic-potts-model-1305.0776"/></url>
<url><loc>https://scifaro.com/en/abs/time-reversible-random-number-generators-solution-of-our-challenge-by-federico-ricci-tersenghi-1305.0961</loc><lastmod>2013-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-reversible-random-number-generators-solution-of-our-challenge-by-federico-ricci-tersenghi-1305.0961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-reversible-random-number-generators-solution-of-our-challenge-by-federico-ricci-tersenghi-1305.0961"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-trees-with-minimal-atom-bond-connectivity-index-1305.1155</loc><lastmod>2013-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-trees-with-minimal-atom-bond-connectivity-index-1305.1155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-trees-with-minimal-atom-bond-connectivity-index-1305.1155"/></url>
<url><loc>https://scifaro.com/en/abs/unique-perfect-phylogeny-characterizations-via-uniquely-representable-chordal-graphs-1305.1375</loc><lastmod>2013-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-perfect-phylogeny-characterizations-via-uniquely-representable-chordal-graphs-1305.1375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-perfect-phylogeny-characterizations-via-uniquely-representable-chordal-graphs-1305.1375"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-constructions-of-computable-objects-and-a-computable-version-of-lov-asz-local-lemma-1305.1535</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-constructions-of-computable-objects-and-a-computable-version-of-lov-asz-local-lemma-1305.1535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-constructions-of-computable-objects-and-a-computable-version-of-lov-asz-local-lemma-1305.1535"/></url>
<url><loc>https://scifaro.com/en/abs/the-solution-to-the-challenge-in-time-reversible-random-number-generators-by-wm-g-hoover-and-carol-g-hoover-1305.1805</loc><lastmod>2013-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-solution-to-the-challenge-in-time-reversible-random-number-generators-by-wm-g-hoover-and-carol-g-hoover-1305.1805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-solution-to-the-challenge-in-time-reversible-random-number-generators-by-wm-g-hoover-and-carol-g-hoover-1305.1805"/></url>
<url><loc>https://scifaro.com/en/abs/strong-products-of-hypergraphs-unique-prime-factorization-theorems-and-algorithms-1305.1824</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-products-of-hypergraphs-unique-prime-factorization-theorems-and-algorithms-1305.1824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-products-of-hypergraphs-unique-prime-factorization-theorems-and-algorithms-1305.1824"/></url>
<url><loc>https://scifaro.com/en/abs/independent-set-in-categorical-products-of-cographs-and-splitgraphs-1305.4237</loc><lastmod>2013-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-set-in-categorical-products-of-cographs-and-splitgraphs-1305.4237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-set-in-categorical-products-of-cographs-and-splitgraphs-1305.4237"/></url>
<url><loc>https://scifaro.com/en/abs/on-bc-trees-and-bc-subtrees-1305.4711</loc><lastmod>2013-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bc-trees-and-bc-subtrees-1305.4711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bc-trees-and-bc-subtrees-1305.4711"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-gap-extensions-of-the-erd-h-o-s-p-osa-theorem-1305.7376</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-gap-extensions-of-the-erd-h-o-s-p-osa-theorem-1305.7376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-gap-extensions-of-the-erd-h-o-s-p-osa-theorem-1305.7376"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-sorting-in-lattices-1306.0019</loc><lastmod>2013-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-sorting-in-lattices-1306.0019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-sorting-in-lattices-1306.0019"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-on-the-phase-transition-for-the-hard-core-model-in-2-dimensions-1306.0431</loc><lastmod>2014-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-on-the-phase-transition-for-the-hard-core-model-in-2-dimensions-1306.0431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-on-the-phase-transition-for-the-hard-core-model-in-2-dimensions-1306.0431"/></url>
<url><loc>https://scifaro.com/en/abs/special-partial-graphs-1306.0524</loc><lastmod>2013-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/special-partial-graphs-1306.0524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/special-partial-graphs-1306.0524"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-graphs-of-linear-rank-width-1-1306.1345</loc><lastmod>2014-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-graphs-of-linear-rank-width-1-1306.1345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-graphs-of-linear-rank-width-1-1306.1345"/></url>
<url><loc>https://scifaro.com/en/abs/results-on-independent-sets-in-categorical-products-of-graphs-the-ultimate-categorical-independence-ratio-and-the-ultimate-categorical-independent-domination-ratio-1306.1656</loc><lastmod>2013-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/results-on-independent-sets-in-categorical-products-of-graphs-the-ultimate-categorical-independence-ratio-and-the-ultimate-categorical-independent-domination-ratio-1306.1656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/results-on-independent-sets-in-categorical-products-of-graphs-the-ultimate-categorical-independence-ratio-and-the-ultimate-categorical-independent-domination-ratio-1306.1656"/></url>
<url><loc>https://scifaro.com/en/abs/a-dsatur-based-algorithm-for-the-equitable-coloring-problem-1306.1758</loc><lastmod>2017-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dsatur-based-algorithm-for-the-equitable-coloring-problem-1306.1758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dsatur-based-algorithm-for-the-equitable-coloring-problem-1306.1758"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-lemmas-1306.1857</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-lemmas-1306.1857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-lemmas-1306.1857"/></url>
<url><loc>https://scifaro.com/en/abs/a-solution-of-simultaneous-recurrences-1306.1860</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-solution-of-simultaneous-recurrences-1306.1860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-solution-of-simultaneous-recurrences-1306.1860"/></url>
<url><loc>https://scifaro.com/en/abs/c-and-a-new-graph-model-1306.1957</loc><lastmod>2013-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/c-and-a-new-graph-model-1306.1957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/c-and-a-new-graph-model-1306.1957"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-partitions-of-split-graphs-1306.1967</loc><lastmod>2013-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-partitions-of-split-graphs-1306.1967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-partitions-of-split-graphs-1306.1967"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-analysis-and-random-sampling-of-digitally-convex-polyominoes-1306.2108</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-analysis-and-random-sampling-of-digitally-convex-polyominoes-1306.2108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-analysis-and-random-sampling-of-digitally-convex-polyominoes-1306.2108"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-forbidden-induced-subgraphs-of-graphs-of-bounded-clique-width-and-bounded-linear-clique-width-1306.2114</loc><lastmod>2014-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-forbidden-induced-subgraphs-of-graphs-of-bounded-clique-width-and-bounded-linear-clique-width-1306.2114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-forbidden-induced-subgraphs-of-graphs-of-bounded-clique-width-and-bounded-linear-clique-width-1306.2114"/></url>
<url><loc>https://scifaro.com/en/abs/extending-partial-representations-of-interval-graphs-1306.2182</loc><lastmod>2014-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-partial-representations-of-interval-graphs-1306.2182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-partial-representations-of-interval-graphs-1306.2182"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-labelling-of-site-graphs-1306.2405</loc><lastmod>2013-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-labelling-of-site-graphs-1306.2405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-labelling-of-site-graphs-1306.2405"/></url>
<url><loc>https://scifaro.com/en/abs/contagious-sets-in-expanders-1306.2465</loc><lastmod>2014-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contagious-sets-in-expanders-1306.2465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contagious-sets-in-expanders-1306.2465"/></url>
<url><loc>https://scifaro.com/en/abs/solvability-of-cubic-graphs-from-four-color-theorem-to-np-complete-1306.2725</loc><lastmod>2014-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solvability-of-cubic-graphs-from-four-color-theorem-to-np-complete-1306.2725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solvability-of-cubic-graphs-from-four-color-theorem-to-np-complete-1306.2725"/></url>
<url><loc>https://scifaro.com/en/abs/a-faster-algorithm-for-packing-branchings-in-digraphs-1306.3480</loc><lastmod>2013-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faster-algorithm-for-packing-branchings-in-digraphs-1306.3480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faster-algorithm-for-packing-branchings-in-digraphs-1306.3480"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-permutations-with-few-corners-1306.4048</loc><lastmod>2013-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-permutations-with-few-corners-1306.4048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-permutations-with-few-corners-1306.4048"/></url>
<url><loc>https://scifaro.com/en/abs/systematic-assessment-of-the-expected-length-variance-and-distribution-of-longest-common-subsequences-1306.4253</loc><lastmod>2013-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/systematic-assessment-of-the-expected-length-variance-and-distribution-of-longest-common-subsequences-1306.4253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/systematic-assessment-of-the-expected-length-variance-and-distribution-of-longest-common-subsequences-1306.4253"/></url>
<url><loc>https://scifaro.com/en/abs/scheduling-unit-processing-time-arc-shutdown-jobs-to-maximize-network-flow-over-time-complexity-results-1306.4917</loc><lastmod>2014-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scheduling-unit-processing-time-arc-shutdown-jobs-to-maximize-network-flow-over-time-complexity-results-1306.4917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scheduling-unit-processing-time-arc-shutdown-jobs-to-maximize-network-flow-over-time-complexity-results-1306.4917"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-method-of-polynomial-expansion-of-symmetric-boolean-functions-1306.5568</loc><lastmod>2013-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-method-of-polynomial-expansion-of-symmetric-boolean-functions-1306.5568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-method-of-polynomial-expansion-of-symmetric-boolean-functions-1306.5568"/></url>
<url><loc>https://scifaro.com/en/abs/clique-width-and-edge-contraction-1306.6168</loc><lastmod>2013-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-width-and-edge-contraction-1306.6168"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-width-and-edge-contraction-1306.6168"/></url>
<url><loc>https://scifaro.com/en/abs/min-cost-flow-duality-in-planar-networks-1306.6728</loc><lastmod>2013-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/min-cost-flow-duality-in-planar-networks-1306.6728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/min-cost-flow-duality-in-planar-networks-1306.6728"/></url>
<url><loc>https://scifaro.com/en/abs/the-coloring-problem-for-classes-with-two-small-obstructions-1307.0278</loc><lastmod>2013-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-coloring-problem-for-classes-with-two-small-obstructions-1307.0278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-coloring-problem-for-classes-with-two-small-obstructions-1307.0278"/></url>
<url><loc>https://scifaro.com/en/abs/on-digital-simply-connected-spaces-and-manifolds-a-digital-simply-connected-3-manifold-is-the-digital-3-sphere-1307.1371</loc><lastmod>2013-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-digital-simply-connected-spaces-and-manifolds-a-digital-simply-connected-3-manifold-is-the-digital-3-sphere-1307.1371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-digital-simply-connected-spaces-and-manifolds-a-digital-simply-connected-3-manifold-is-the-digital-3-sphere-1307.1371"/></url>
<url><loc>https://scifaro.com/en/abs/partitions-of-a-finite-partially-ordered-set-1307.1615</loc><lastmod>2014-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitions-of-a-finite-partially-ordered-set-1307.1615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitions-of-a-finite-partially-ordered-set-1307.1615"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-determining-convergence-in-polynomial-recurrence-sequences-1307.2164</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-determining-convergence-in-polynomial-recurrence-sequences-1307.2164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-determining-convergence-in-polynomial-recurrence-sequences-1307.2164"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mu-parameters-of-the-petersen-graph-1307.2348</loc><lastmod>2013-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mu-parameters-of-the-petersen-graph-1307.2348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mu-parameters-of-the-petersen-graph-1307.2348"/></url>
<url><loc>https://scifaro.com/en/abs/the-irreducible-spine-s-of-undirected-networks-1307.2467</loc><lastmod>2013-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-irreducible-spine-s-of-undirected-networks-1307.2467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-irreducible-spine-s-of-undirected-networks-1307.2467"/></url>
<url><loc>https://scifaro.com/en/abs/unique-expansion-matroids-and-union-minimal-matroids-1307.2708</loc><lastmod>2013-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-expansion-matroids-and-union-minimal-matroids-1307.2708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-expansion-matroids-and-union-minimal-matroids-1307.2708"/></url>
<url><loc>https://scifaro.com/en/abs/positivity-problems-for-low-order-linear-recurrence-sequences-1307.2779</loc><lastmod>2013-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positivity-problems-for-low-order-linear-recurrence-sequences-1307.2779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positivity-problems-for-low-order-linear-recurrence-sequences-1307.2779"/></url>
<url><loc>https://scifaro.com/en/abs/oriented-chromatic-number-of-halin-graphs-1307.4901</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oriented-chromatic-number-of-halin-graphs-1307.4901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oriented-chromatic-number-of-halin-graphs-1307.4901"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-directed-cycles-1307.5186</loc><lastmod>2013-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-directed-cycles-1307.5186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-directed-cycles-1307.5186"/></url>
<url><loc>https://scifaro.com/en/abs/on-axiomatization-of-inconsistency-indicators-for-pairwise-comparisons-1307.6272</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-axiomatization-of-inconsistency-indicators-for-pairwise-comparisons-1307.6272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-axiomatization-of-inconsistency-indicators-for-pairwise-comparisons-1307.6272"/></url>
<url><loc>https://scifaro.com/en/abs/on-complexities-of-minus-domination-1307.6663</loc><lastmod>2013-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complexities-of-minus-domination-1307.6663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complexities-of-minus-domination-1307.6663"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-random-matchings-tours-and-spanning-trees-in-hierarchically-separated-trees-1307.6939</loc><lastmod>2013-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-random-matchings-tours-and-spanning-trees-in-hierarchically-separated-trees-1307.6939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-random-matchings-tours-and-spanning-trees-in-hierarchically-separated-trees-1307.6939"/></url>
<url><loc>https://scifaro.com/en/abs/finite-state-markov-modeling-of-tunnel-channels-in-communication-based-train-control-cbtc-systems-1307.7807</loc><lastmod>2013-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-state-markov-modeling-of-tunnel-channels-in-communication-based-train-control-cbtc-systems-1307.7807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-state-markov-modeling-of-tunnel-channels-in-communication-based-train-control-cbtc-systems-1307.7807"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-compatibility-and-agreement-of-unrooted-trees-via-cuts-in-graphs-1307.7828</loc><lastmod>2013-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-compatibility-and-agreement-of-unrooted-trees-via-cuts-in-graphs-1307.7828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-compatibility-and-agreement-of-unrooted-trees-via-cuts-in-graphs-1307.7828"/></url>
<url><loc>https://scifaro.com/en/abs/the-chromatic-class-and-the-chromatic-number-of-the-planar-conjugated-triangulation-1307.7858</loc><lastmod>2013-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-chromatic-class-and-the-chromatic-number-of-the-planar-conjugated-triangulation-1307.7858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-chromatic-class-and-the-chromatic-number-of-the-planar-conjugated-triangulation-1307.7858"/></url>
<url><loc>https://scifaro.com/en/abs/morpion-solitaire-5d-a-new-upper-bound-of-121-on-the-maximum-score-1307.8192</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morpion-solitaire-5d-a-new-upper-bound-of-121-on-the-maximum-score-1307.8192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morpion-solitaire-5d-a-new-upper-bound-of-121-on-the-maximum-score-1307.8192"/></url>
<url><loc>https://scifaro.com/en/abs/x-problem-of-value-three-1308.0136</loc><lastmod>2013-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/x-problem-of-value-three-1308.0136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/x-problem-of-value-three-1308.0136"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-partition-of-r-n-by-hyperplanes-1308.0311</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-partition-of-r-n-by-hyperplanes-1308.0311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-partition-of-r-n-by-hyperplanes-1308.0311"/></url>
<url><loc>https://scifaro.com/en/abs/traversals-of-infinite-graphs-with-random-local-orientations-1308.1041</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/traversals-of-infinite-graphs-with-random-local-orientations-1308.1041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/traversals-of-infinite-graphs-with-random-local-orientations-1308.1041"/></url>
<url><loc>https://scifaro.com/en/abs/a-gap-between-simulation-and-practice-for-recursive-filters-on-the-state-transition-noise-1308.1056</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gap-between-simulation-and-practice-for-recursive-filters-on-the-state-transition-noise-1308.1056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gap-between-simulation-and-practice-for-recursive-filters-on-the-state-transition-noise-1308.1056"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-combinatorial-interpretation-of-certain-generalized-bell-and-stirling-numbers-1308.1700</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-combinatorial-interpretation-of-certain-generalized-bell-and-stirling-numbers-1308.1700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-combinatorial-interpretation-of-certain-generalized-bell-and-stirling-numbers-1308.1700"/></url>
<url><loc>https://scifaro.com/en/abs/spatial-mixing-and-approximation-algorithms-for-graphs-with-bounded-connective-constant-1308.1762</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spatial-mixing-and-approximation-algorithms-for-graphs-with-bounded-connective-constant-1308.1762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spatial-mixing-and-approximation-algorithms-for-graphs-with-bounded-connective-constant-1308.1762"/></url>
<url><loc>https://scifaro.com/en/abs/fast-recognition-of-partial-star-products-and-quasi-cartesian-products-1308.2101</loc><lastmod>2013-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-recognition-of-partial-star-products-and-quasi-cartesian-products-1308.2101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-recognition-of-partial-star-products-and-quasi-cartesian-products-1308.2101"/></url>
<url><loc>https://scifaro.com/en/abs/finite-state-markov-modeling-of-leaky-waveguide-channels-in-communication-based-train-control-cbtc-systems-1308.2188</loc><lastmod>2013-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-state-markov-modeling-of-leaky-waveguide-channels-in-communication-based-train-control-cbtc-systems-1308.2188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-state-markov-modeling-of-leaky-waveguide-channels-in-communication-based-train-control-cbtc-systems-1308.2188"/></url>
<url><loc>https://scifaro.com/en/abs/interval-colorings-of-complete-bipartite-graphs-and-trees-1308.2541</loc><lastmod>2013-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-colorings-of-complete-bipartite-graphs-and-trees-1308.2541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-colorings-of-complete-bipartite-graphs-and-trees-1308.2541"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-oblivious-subspace-embeddings-1308.3280</loc><lastmod>2013-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-oblivious-subspace-embeddings-1308.3280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-oblivious-subspace-embeddings-1308.3280"/></url>
<url><loc>https://scifaro.com/en/abs/some-remarks-on-relations-between-the-mu-parameters-of-regular-graphs-1308.3322</loc><lastmod>2013-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-remarks-on-relations-between-the-mu-parameters-of-regular-graphs-1308.3322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-remarks-on-relations-between-the-mu-parameters-of-regular-graphs-1308.3322"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-sequence-extremal-functions-with-formations-1308.3810</loc><lastmod>2014-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-sequence-extremal-functions-with-formations-1308.3810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-sequence-extremal-functions-with-formations-1308.3810"/></url>
<url><loc>https://scifaro.com/en/abs/list-coloring-the-square-of-sparse-graphs-with-large-degree-1308.4197</loc><lastmod>2013-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/list-coloring-the-square-of-sparse-graphs-with-large-degree-1308.4197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/list-coloring-the-square-of-sparse-graphs-with-large-degree-1308.4197"/></url>
<url><loc>https://scifaro.com/en/abs/coast-a-convex-optimization-approach-to-stress-based-embedding-1308.5218</loc><lastmod>2013-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coast-a-convex-optimization-approach-to-stress-based-embedding-1308.5218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coast-a-convex-optimization-approach-to-stress-based-embedding-1308.5218"/></url>
<url><loc>https://scifaro.com/en/abs/bidimensionality-of-geometric-intersection-graphs-1308.6166</loc><lastmod>2013-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bidimensionality-of-geometric-intersection-graphs-1308.6166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bidimensionality-of-geometric-intersection-graphs-1308.6166"/></url>
<url><loc>https://scifaro.com/en/abs/collecting-coupons-with-random-initial-stake-1308.6384</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collecting-coupons-with-random-initial-stake-1308.6384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collecting-coupons-with-random-initial-stake-1308.6384"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-wheels-1308.6433</loc><lastmod>2014-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-wheels-1308.6433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-wheels-1308.6433"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-perfect-graphs-with-no-balanced-skew-partitions-1308.6444</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-perfect-graphs-with-no-balanced-skew-partitions-1308.6444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-perfect-graphs-with-no-balanced-skew-partitions-1308.6444"/></url>
<url><loc>https://scifaro.com/en/abs/new-constructions-of-quaternary-bent-functions-1309.0199</loc><lastmod>2013-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-constructions-of-quaternary-bent-functions-1309.0199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-constructions-of-quaternary-bent-functions-1309.0199"/></url>
<url><loc>https://scifaro.com/en/abs/heuristic-rating-estimation-approach-to-the-pairwise-comparisons-method-1309.0386</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristic-rating-estimation-approach-to-the-pairwise-comparisons-method-1309.0386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristic-rating-estimation-approach-to-the-pairwise-comparisons-method-1309.0386"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-shortest-common-supersequence-for-inputs-with-no-identical-consecutive-letters-1309.0422</loc><lastmod>2015-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-shortest-common-supersequence-for-inputs-with-no-identical-consecutive-letters-1309.0422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-shortest-common-supersequence-for-inputs-with-no-identical-consecutive-letters-1309.0422"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-perfectly-contractile-graphs-1309.0435</loc><lastmod>2013-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-perfectly-contractile-graphs-1309.0435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-perfectly-contractile-graphs-1309.0435"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-square-3pc-cdot-cdot-free-berge-graphs-1309.0694</loc><lastmod>2016-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-square-3pc-cdot-cdot-free-berge-graphs-1309.0694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-square-3pc-cdot-cdot-free-berge-graphs-1309.0694"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-induced-subgraphs-1309.0971</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-induced-subgraphs-1309.0971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-induced-subgraphs-1309.0971"/></url>
<url><loc>https://scifaro.com/en/abs/the-four-in-a-tree-problem-in-triangle-free-graphs-1309.0978</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-four-in-a-tree-problem-in-triangle-free-graphs-1309.0978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-four-in-a-tree-problem-in-triangle-free-graphs-1309.0978"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-representations-of-interval-and-proper-interval-graphs-1309.1248</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-representations-of-interval-and-proper-interval-graphs-1309.1248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-representations-of-interval-and-proper-interval-graphs-1309.1248"/></url>
<url><loc>https://scifaro.com/en/abs/tiling-problems-on-baumslag-solitar-groups-1309.1266</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tiling-problems-on-baumslag-solitar-groups-1309.1266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tiling-problems-on-baumslag-solitar-groups-1309.1266"/></url>
<url><loc>https://scifaro.com/en/abs/intrinsic-universality-of-causal-graph-dynamics-1309.1272</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intrinsic-universality-of-causal-graph-dynamics-1309.1272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intrinsic-universality-of-causal-graph-dynamics-1309.1272"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-in-a-tree-problem-for-graphs-of-girth-at-least-k-1309.1279</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-in-a-tree-problem-for-graphs-of-girth-at-least-k-1309.1279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-in-a-tree-problem-for-graphs-of-girth-at-least-k-1309.1279"/></url>
<url><loc>https://scifaro.com/en/abs/logspace-computations-in-graph-products-1309.1290</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logspace-computations-in-graph-products-1309.1290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logspace-computations-in-graph-products-1309.1290"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-probability-mass-function-1309.1432</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-probability-mass-function-1309.1432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-probability-mass-function-1309.1432"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-optimization-with-2-joins-1309.1547</loc><lastmod>2016-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-optimization-with-2-joins-1309.1547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-optimization-with-2-joins-1309.1547"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-positivity-problem-for-simple-linear-recurrence-sequences-1309.1550</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-positivity-problem-for-simple-linear-recurrence-sequences-1309.1550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-positivity-problem-for-simple-linear-recurrence-sequences-1309.1550"/></url>
<url><loc>https://scifaro.com/en/abs/finding-an-induced-subdivision-of-a-digraph-1309.1553</loc><lastmod>2016-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-an-induced-subdivision-of-a-digraph-1309.1553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-an-induced-subdivision-of-a-digraph-1309.1553"/></url>
<url><loc>https://scifaro.com/en/abs/on-limits-to-the-scope-of-the-extended-formulations-barriers-1309.1823</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-limits-to-the-scope-of-the-extended-formulations-barriers-1309.1823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-limits-to-the-scope-of-the-extended-formulations-barriers-1309.1823"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-that-do-not-contain-a-cycle-with-a-node-that-has-at-least-two-neighbors-on-it-1309.1841</loc><lastmod>2016-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-that-do-not-contain-a-cycle-with-a-node-that-has-at-least-two-neighbors-on-it-1309.1841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-that-do-not-contain-a-cycle-with-a-node-that-has-at-least-two-neighbors-on-it-1309.1841"/></url>
<url><loc>https://scifaro.com/en/abs/edge-colouring-and-total-colouring-chordless-graphs-1309.1842</loc><lastmod>2013-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-colouring-and-total-colouring-chordless-graphs-1309.1842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-colouring-and-total-colouring-chordless-graphs-1309.1842"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-an-induced-net-subdivision-1309.1960</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-an-induced-net-subdivision-1309.1960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-an-induced-net-subdivision-1309.1960"/></url>
<url><loc>https://scifaro.com/en/abs/square-free-shuffles-of-words-1309.2137</loc><lastmod>2013-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-free-shuffles-of-words-1309.2137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-free-shuffles-of-words-1309.2137"/></url>
<url><loc>https://scifaro.com/en/abs/extending-partial-representations-of-circle-graphs-1309.2399</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-partial-representations-of-circle-graphs-1309.2399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-partial-representations-of-circle-graphs-1309.2399"/></url>
<url><loc>https://scifaro.com/en/abs/complete-valuations-on-finite-distributive-lattices-1309.2685</loc><lastmod>2013-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-valuations-on-finite-distributive-lattices-1309.2685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-valuations-on-finite-distributive-lattices-1309.2685"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-colouring-problems-restricted-to-unichord-free-and-square-unichord-free-graphs-1309.2749</loc><lastmod>2014-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-colouring-problems-restricted-to-unichord-free-and-square-unichord-free-graphs-1309.2749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-colouring-problems-restricted-to-unichord-free-and-square-unichord-free-graphs-1309.2749"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-of-edge-intersecting-non-splitting-paths-in-a-tree-towards-hole-representations-part-i-1309.2898</loc><lastmod>2015-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-of-edge-intersecting-non-splitting-paths-in-a-tree-towards-hole-representations-part-i-1309.2898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-of-edge-intersecting-non-splitting-paths-in-a-tree-towards-hole-representations-part-i-1309.2898"/></url>
<url><loc>https://scifaro.com/en/abs/fitness-probability-distribution-of-bit-flip-mutation-1309.2979</loc><lastmod>2014-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fitness-probability-distribution-of-bit-flip-mutation-1309.2979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fitness-probability-distribution-of-bit-flip-mutation-1309.2979"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-vertex-coloring-in-a-particular-triangular-closed-path-structure-and-in-krafts-inequality-1309.3513</loc><lastmod>2013-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-vertex-coloring-in-a-particular-triangular-closed-path-structure-and-in-krafts-inequality-1309.3513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-vertex-coloring-in-a-particular-triangular-closed-path-structure-and-in-krafts-inequality-1309.3513"/></url>
<url><loc>https://scifaro.com/en/abs/an-alternate-method-to-find-the-chromatic-number-of-a-finite-connected-graph-1309.3642</loc><lastmod>2019-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-alternate-method-to-find-the-chromatic-number-of-a-finite-connected-graph-1309.3642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-alternate-method-to-find-the-chromatic-number-of-a-finite-connected-graph-1309.3642"/></url>
<url><loc>https://scifaro.com/en/abs/new-and-simple-algorithms-for-stable-flow-problems-1309.3701</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-and-simple-algorithms-for-stable-flow-problems-1309.3701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-and-simple-algorithms-for-stable-flow-problems-1309.3701"/></url>
<url><loc>https://scifaro.com/en/abs/on-3-extra-connectivity-of-k-ary-n-cubes-1309.4961</loc><lastmod>2014-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-3-extra-connectivity-of-k-ary-n-cubes-1309.4961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-3-extra-connectivity-of-k-ary-n-cubes-1309.4961"/></url>
<url><loc>https://scifaro.com/en/abs/3-extra-connectivity-of-3-ary-n-cube-networks-1309.5083</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3-extra-connectivity-of-3-ary-n-cube-networks-1309.5083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3-extra-connectivity-of-3-ary-n-cube-networks-1309.5083"/></url>
<url><loc>https://scifaro.com/en/abs/conjugacy-in-baumslag-s-group-generic-case-complexity-and-division-in-power-circuits-1309.5314</loc><lastmod>2016-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conjugacy-in-baumslag-s-group-generic-case-complexity-and-division-in-power-circuits-1309.5314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conjugacy-in-baumslag-s-group-generic-case-complexity-and-division-in-power-circuits-1309.5314"/></url>
<url><loc>https://scifaro.com/en/abs/towards-minimizing-k-submodular-functions-1309.5469</loc><lastmod>2013-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-minimizing-k-submodular-functions-1309.5469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-minimizing-k-submodular-functions-1309.5469"/></url>
<url><loc>https://scifaro.com/en/abs/the-sum-capture-problem-for-abelian-groups-1309.5582</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sum-capture-problem-for-abelian-groups-1309.5582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sum-capture-problem-for-abelian-groups-1309.5582"/></url>
<url><loc>https://scifaro.com/en/abs/the-dilworth-number-of-auto-chordal-bipartite-graphs-1309.5787</loc><lastmod>2013-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dilworth-number-of-auto-chordal-bipartite-graphs-1309.5787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dilworth-number-of-auto-chordal-bipartite-graphs-1309.5787"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-programming-formulation-applied-to-optimum-allocation-in-multivariate-stratified-sampling-1309.6148</loc><lastmod>2013-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-programming-formulation-applied-to-optimum-allocation-in-multivariate-stratified-sampling-1309.6148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-programming-formulation-applied-to-optimum-allocation-in-multivariate-stratified-sampling-1309.6148"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-of-edge-intersecting-non-splitting-paths-in-a-tree-representations-of-holes-part-ii-1309.6471</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-of-edge-intersecting-non-splitting-paths-in-a-tree-representations-of-holes-part-ii-1309.6471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-of-edge-intersecting-non-splitting-paths-in-a-tree-representations-of-holes-part-ii-1309.6471"/></url>
<url><loc>https://scifaro.com/en/abs/inside-the-clustering-threshold-for-random-linear-equations-1309.6651</loc><lastmod>2013-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inside-the-clustering-threshold-for-random-linear-equations-1309.6651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inside-the-clustering-threshold-for-random-linear-equations-1309.6651"/></url>
<url><loc>https://scifaro.com/en/abs/mu-limit-sets-of-cellular-automata-from-a-computational-complexity-perspective-1309.6730</loc><lastmod>2015-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mu-limit-sets-of-cellular-automata-from-a-computational-complexity-perspective-1309.6730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mu-limit-sets-of-cellular-automata-from-a-computational-complexity-perspective-1309.6730"/></url>
<url><loc>https://scifaro.com/en/abs/the-multiple-orientability-thresholds-for-random-hypergraphs-1309.6772</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-multiple-orientability-thresholds-for-random-hypergraphs-1309.6772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-multiple-orientability-thresholds-for-random-hypergraphs-1309.6772"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-log-supermodularity-lower-bounds-and-the-bethe-partition-function-1309.6859</loc><lastmod>2013-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-log-supermodularity-lower-bounds-and-the-bethe-partition-function-1309.6859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-log-supermodularity-lower-bounds-and-the-bethe-partition-function-1309.6859"/></url>
<url><loc>https://scifaro.com/en/abs/inclusion-exclusion-enhanced-by-nerve-stimulation-1309.6927</loc><lastmod>2018-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inclusion-exclusion-enhanced-by-nerve-stimulation-1309.6927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inclusion-exclusion-enhanced-by-nerve-stimulation-1309.6927"/></url>
<url><loc>https://scifaro.com/en/abs/exact-counting-of-euler-tours-for-graphs-of-bounded-treewidth-1310.0185</loc><lastmod>2013-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-counting-of-euler-tours-for-graphs-of-bounded-treewidth-1310.0185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-counting-of-euler-tours-for-graphs-of-bounded-treewidth-1310.0185"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-coloring-graphs-without-paths-and-cycles-1310.0340</loc><lastmod>2013-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-coloring-graphs-without-paths-and-cycles-1310.0340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-coloring-graphs-without-paths-and-cycles-1310.0340"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-switch-cographs-1310.1012</loc><lastmod>2013-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-switch-cographs-1310.1012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-switch-cographs-1310.1012"/></url>
<url><loc>https://scifaro.com/en/abs/cubic-graphs-with-large-circumference-deficit-1310.1042</loc><lastmod>2013-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubic-graphs-with-large-circumference-deficit-1310.1042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubic-graphs-with-large-circumference-deficit-1310.1042"/></url>
<url><loc>https://scifaro.com/en/abs/on-lattices-of-regular-sets-of-natural-integers-closed-under-decrementation-1310.1378</loc><lastmod>2013-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lattices-of-regular-sets-of-natural-integers-closed-under-decrementation-1310.1378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lattices-of-regular-sets-of-natural-integers-closed-under-decrementation-1310.1378"/></url>
<url><loc>https://scifaro.com/en/abs/newton-representation-of-functions-over-natural-integers-having-integral-difference-ratios-1310.1507</loc><lastmod>2013-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/newton-representation-of-functions-over-natural-integers-having-integral-difference-ratios-1310.1507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/newton-representation-of-functions-over-natural-integers-having-integral-difference-ratios-1310.1507"/></url>
<url><loc>https://scifaro.com/en/abs/on-triangulating-k-outerplanar-graphs-1310.1845</loc><lastmod>2013-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-triangulating-k-outerplanar-graphs-1310.1845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-triangulating-k-outerplanar-graphs-1310.1845"/></url>
<url><loc>https://scifaro.com/en/abs/a-comparative-study-of-the-signal-to-noise-ratios-of-different-representations-for-symbolic-sequences-1310.2232</loc><lastmod>2013-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comparative-study-of-the-signal-to-noise-ratios-of-different-representations-for-symbolic-sequences-1310.2232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comparative-study-of-the-signal-to-noise-ratios-of-different-representations-for-symbolic-sequences-1310.2232"/></url>
<url><loc>https://scifaro.com/en/abs/the-firefighter-problem-a-structural-analysis-1310.2322</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-firefighter-problem-a-structural-analysis-1310.2322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-firefighter-problem-a-structural-analysis-1310.2322"/></url>
<url><loc>https://scifaro.com/en/abs/applications-in-enumerative-combinatorics-of-infinite-weighted-automata-and-graphs-1310.2449</loc><lastmod>2013-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-in-enumerative-combinatorics-of-infinite-weighted-automata-and-graphs-1310.2449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-in-enumerative-combinatorics-of-infinite-weighted-automata-and-graphs-1310.2449"/></url>
<url><loc>https://scifaro.com/en/abs/on-price-of-symmetrisation-1310.2775</loc><lastmod>2013-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-price-of-symmetrisation-1310.2775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-price-of-symmetrisation-1310.2775"/></url>
<url><loc>https://scifaro.com/en/abs/simple-dynamics-for-plurality-consensus-1310.2858</loc><lastmod>2015-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-dynamics-for-plurality-consensus-1310.2858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-dynamics-for-plurality-consensus-1310.2858"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-kernels-for-lambda-extendible-properties-parameterized-above-the-poljak-turz-ik-bound-1310.2928</loc><lastmod>2013-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-kernels-for-lambda-extendible-properties-parameterized-above-the-poljak-turz-ik-bound-1310.2928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-kernels-for-lambda-extendible-properties-parameterized-above-the-poljak-turz-ik-bound-1310.2928"/></url>
<url><loc>https://scifaro.com/en/abs/exact-algorithm-for-graph-homomorphism-and-locally-injective-graph-homomorphism-1310.3341</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-algorithm-for-graph-homomorphism-and-locally-injective-graph-homomorphism-1310.3341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-algorithm-for-graph-homomorphism-and-locally-injective-graph-homomorphism-1310.3341"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-weighting-scheme-for-random-k-sat-1310.4303</loc><lastmod>2013-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-weighting-scheme-for-random-k-sat-1310.4303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-weighting-scheme-for-random-k-sat-1310.4303"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-allocations-a-simple-proof-for-the-heavily-loaded-case-1310.5367</loc><lastmod>2013-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-allocations-a-simple-proof-for-the-heavily-loaded-case-1310.5367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-allocations-a-simple-proof-for-the-heavily-loaded-case-1310.5367"/></url>
<url><loc>https://scifaro.com/en/abs/computation-with-no-memory-and-rearrangeable-multicast-networks-1310.5380</loc><lastmod>2014-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-with-no-memory-and-rearrangeable-multicast-networks-1310.5380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-with-no-memory-and-rearrangeable-multicast-networks-1310.5380"/></url>
<url><loc>https://scifaro.com/en/abs/brooks-theorem-on-powers-of-graphs-1310.5493</loc><lastmod>2013-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/brooks-theorem-on-powers-of-graphs-1310.5493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/brooks-theorem-on-powers-of-graphs-1310.5493"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-algorithm-for-weighted-independent-set-problem-in-bull-free-graphs-1310.6205</loc><lastmod>2015-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-algorithm-for-weighted-independent-set-problem-in-bull-free-graphs-1310.6205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-algorithm-for-weighted-independent-set-problem-in-bull-free-graphs-1310.6205"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-sorting-networks-1310.6271</loc><lastmod>2013-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-sorting-networks-1310.6271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-sorting-networks-1310.6271"/></url>
<url><loc>https://scifaro.com/en/abs/claw-free-t-perfect-graphs-can-be-recognised-in-polynomial-time-1310.8186</loc><lastmod>2013-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/claw-free-t-perfect-graphs-can-be-recognised-in-polynomial-time-1310.8186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/claw-free-t-perfect-graphs-can-be-recognised-in-polynomial-time-1310.8186"/></url>
<url><loc>https://scifaro.com/en/abs/an-existential-proof-of-the-conjecture-on-packing-anchored-rectangles-1310.8403</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-existential-proof-of-the-conjecture-on-packing-anchored-rectangles-1310.8403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-existential-proof-of-the-conjecture-on-packing-anchored-rectangles-1310.8403"/></url>
<url><loc>https://scifaro.com/en/abs/the-pfr-conjecture-holds-for-two-opposing-special-cases-1311.0172</loc><lastmod>2013-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-pfr-conjecture-holds-for-two-opposing-special-cases-1311.0172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-pfr-conjecture-holds-for-two-opposing-special-cases-1311.0172"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-vertex-partitioning-problems-parameterized-by-clique-width-1311.0224</loc><lastmod>2015-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-vertex-partitioning-problems-parameterized-by-clique-width-1311.0224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-vertex-partitioning-problems-parameterized-by-clique-width-1311.0224"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-no-7-wheel-subdivision-1311.0573</loc><lastmod>2017-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-no-7-wheel-subdivision-1311.0573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-no-7-wheel-subdivision-1311.0573"/></url>
<url><loc>https://scifaro.com/en/abs/search-strategies-for-developing-characterizations-of-graphs-without-small-wheel-subdivisions-1311.0574</loc><lastmod>2013-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/search-strategies-for-developing-characterizations-of-graphs-without-small-wheel-subdivisions-1311.0574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/search-strategies-for-developing-characterizations-of-graphs-without-small-wheel-subdivisions-1311.0574"/></url>
<url><loc>https://scifaro.com/en/abs/an-exact-algorithm-for-the-generalized-list-t-coloring-problem-1311.0603</loc><lastmod>2013-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-exact-algorithm-for-the-generalized-list-t-coloring-problem-1311.0603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-exact-algorithm-for-the-generalized-list-t-coloring-problem-1311.0603"/></url>
<url><loc>https://scifaro.com/en/abs/the-probabilistic-approach-to-limited-packings-in-graphs-1311.1707</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-probabilistic-approach-to-limited-packings-in-graphs-1311.1707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-probabilistic-approach-to-limited-packings-in-graphs-1311.1707"/></url>
<url><loc>https://scifaro.com/en/abs/on-uni-chord-free-graphs-1311.1928</loc><lastmod>2014-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-uni-chord-free-graphs-1311.1928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-uni-chord-free-graphs-1311.1928"/></url>
<url><loc>https://scifaro.com/en/abs/large-independent-sets-in-triangle-free-planar-graphs-1311.2749</loc><lastmod>2014-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-independent-sets-in-triangle-free-planar-graphs-1311.2749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-independent-sets-in-triangle-free-planar-graphs-1311.2749"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expansion-of-group-based-lifts-1311.3268</loc><lastmod>2016-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expansion-of-group-based-lifts-1311.3268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expansion-of-group-based-lifts-1311.3268"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-random-walks-for-rapidly-mixing-chains-1311.3749</loc><lastmod>2015-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-random-walks-for-rapidly-mixing-chains-1311.3749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-random-walks-for-rapidly-mixing-chains-1311.3749"/></url>
<url><loc>https://scifaro.com/en/abs/on-generating-permutations-under-user-defined-constraints-1311.3813</loc><lastmod>2013-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-generating-permutations-under-user-defined-constraints-1311.3813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-generating-permutations-under-user-defined-constraints-1311.3813"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-to-solve-the-equal-sum-product-problem-1311.3874</loc><lastmod>2013-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-to-solve-the-equal-sum-product-problem-1311.3874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-to-solve-the-equal-sum-product-problem-1311.3874"/></url>
<url><loc>https://scifaro.com/en/abs/kernelizations-for-the-hybridization-number-problem-on-multiple-nonbinary-trees-1311.4045</loc><lastmod>2016-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kernelizations-for-the-hybridization-number-problem-on-multiple-nonbinary-trees-1311.4045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kernelizations-for-the-hybridization-number-problem-on-multiple-nonbinary-trees-1311.4045"/></url>
<url><loc>https://scifaro.com/en/abs/graph-measures-and-network-robustness-1311.5064</loc><lastmod>2013-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-measures-and-network-robustness-1311.5064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-measures-and-network-robustness-1311.5064"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-markov-chain-modelling-approach-to-1-lambda-es-linear-optimization-1311.5244</loc><lastmod>2013-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-markov-chain-modelling-approach-to-1-lambda-es-linear-optimization-1311.5244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-markov-chain-modelling-approach-to-1-lambda-es-linear-optimization-1311.5244"/></url>
<url><loc>https://scifaro.com/en/abs/the-simplex-algorithm-is-np-mighty-1311.5935</loc><lastmod>2014-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simplex-algorithm-is-np-mighty-1311.5935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simplex-algorithm-is-np-mighty-1311.5935"/></url>
<url><loc>https://scifaro.com/en/abs/pairwise-comparisons-simplified-1311.6863</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pairwise-comparisons-simplified-1311.6863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pairwise-comparisons-simplified-1311.6863"/></url>
<url><loc>https://scifaro.com/en/abs/absorption-time-of-the-moran-process-1311.7631</loc><lastmod>2014-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/absorption-time-of-the-moran-process-1311.7631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/absorption-time-of-the-moran-process-1311.7631"/></url>
<url><loc>https://scifaro.com/en/abs/circular-arc-hypergraphs-rigidity-via-connectedness-1312.1172</loc><lastmod>2013-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circular-arc-hypergraphs-rigidity-via-connectedness-1312.1172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circular-arc-hypergraphs-rigidity-via-connectedness-1312.1172"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-construction-of-broadcast-graphs-1312.1523</loc><lastmod>2013-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-construction-of-broadcast-graphs-1312.1523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-construction-of-broadcast-graphs-1312.1523"/></url>
<url><loc>https://scifaro.com/en/abs/construct-graph-logic-1312.2209</loc><lastmod>2013-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/construct-graph-logic-1312.2209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/construct-graph-logic-1312.2209"/></url>
<url><loc>https://scifaro.com/en/abs/a-stability-result-for-sparse-convolutions-1312.2222</loc><lastmod>2014-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-stability-result-for-sparse-convolutions-1312.2222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-stability-result-for-sparse-convolutions-1312.2222"/></url>
<url><loc>https://scifaro.com/en/abs/clique-stable-set-separation-in-perfect-graphs-with-no-balanced-skew-partitions-1312.2730</loc><lastmod>2017-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-stable-set-separation-in-perfect-graphs-with-no-balanced-skew-partitions-1312.2730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-stable-set-separation-in-perfect-graphs-with-no-balanced-skew-partitions-1312.2730"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-change-1312.2816</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-change-1312.2816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-change-1312.2816"/></url>
<url><loc>https://scifaro.com/en/abs/covering-partial-cubes-with-zones-1312.2819</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-partial-cubes-with-zones-1312.2819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-partial-cubes-with-zones-1312.2819"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-discrepancy-in-the-pairwise-comparisons-method-1312.2986</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-discrepancy-in-the-pairwise-comparisons-method-1312.2986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-discrepancy-in-the-pairwise-comparisons-method-1312.2986"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-center-sets-and-center-numbers-of-some-graph-classes-1312.3182</loc><lastmod>2013-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-center-sets-and-center-numbers-of-some-graph-classes-1312.3182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-center-sets-and-center-numbers-of-some-graph-classes-1312.3182"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-of-domination-and-total-domination-in-the-direct-product-of-two-fuzzy-graphs-1312.3444</loc><lastmod>2016-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-of-domination-and-total-domination-in-the-direct-product-of-two-fuzzy-graphs-1312.3444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-of-domination-and-total-domination-in-the-direct-product-of-two-fuzzy-graphs-1312.3444"/></url>
<url><loc>https://scifaro.com/en/abs/emergence-of-wave-patterns-on-kadanoff-sandpiles-1312.4066</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/emergence-of-wave-patterns-on-kadanoff-sandpiles-1312.4066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/emergence-of-wave-patterns-on-kadanoff-sandpiles-1312.4066"/></url>
<url><loc>https://scifaro.com/en/abs/trees-and-co-trees-with-constant-maximum-degree-in-planar-3-connected-graphs-1312.4101</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-and-co-trees-with-constant-maximum-degree-in-planar-3-connected-graphs-1312.4101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-and-co-trees-with-constant-maximum-degree-in-planar-3-connected-graphs-1312.4101"/></url>
<url><loc>https://scifaro.com/en/abs/the-generation-of-minimal-tests-sets-and-some-minimal-tests-1312.4134</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-generation-of-minimal-tests-sets-and-some-minimal-tests-1312.4134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-generation-of-minimal-tests-sets-and-some-minimal-tests-1312.4134"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-branch-and-cut-code-for-the-maximum-balanced-subgraph-of-a-signed-graph-1312.4345</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-branch-and-cut-code-for-the-maximum-balanced-subgraph-of-a-signed-graph-1312.4345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-branch-and-cut-code-for-the-maximum-balanced-subgraph-of-a-signed-graph-1312.4345"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-proper-k-colorings-in-an-n-gon-1312.4398</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-proper-k-colorings-in-an-n-gon-1312.4398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-proper-k-colorings-in-an-n-gon-1312.4398"/></url>
<url><loc>https://scifaro.com/en/abs/the-flip-diameter-of-rectangulations-and-convex-subdivisions-1312.4429</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-flip-diameter-of-rectangulations-and-convex-subdivisions-1312.4429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-flip-diameter-of-rectangulations-and-convex-subdivisions-1312.4429"/></url>
<url><loc>https://scifaro.com/en/abs/integer-ambiguity-resolution-in-astronomy-and-geodesy-1312.4920</loc><lastmod>2015-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-ambiguity-resolution-in-astronomy-and-geodesy-1312.4920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-ambiguity-resolution-in-astronomy-and-geodesy-1312.4920"/></url>
<url><loc>https://scifaro.com/en/abs/rainbow-path-and-color-degree-in-edge-colored-graphs-1312.5067</loc><lastmod>2013-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rainbow-path-and-color-degree-in-edge-colored-graphs-1312.5067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rainbow-path-and-color-degree-in-edge-colored-graphs-1312.5067"/></url>
<url><loc>https://scifaro.com/en/abs/dichotomies-properties-on-computational-complexity-of-s-packing-coloring-problems-1312.5280</loc><lastmod>2015-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dichotomies-properties-on-computational-complexity-of-s-packing-coloring-problems-1312.5280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dichotomies-properties-on-computational-complexity-of-s-packing-coloring-problems-1312.5280"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-combinatorial-batch-codes-based-on-block-designs-1312.5505</loc><lastmod>2014-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-combinatorial-batch-codes-based-on-block-designs-1312.5505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-combinatorial-batch-codes-based-on-block-designs-1312.5505"/></url>
<url><loc>https://scifaro.com/en/abs/further-results-on-strong-edge-colourings-in-outerplanar-graphs-1312.5620</loc><lastmod>2013-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-results-on-strong-edge-colourings-in-outerplanar-graphs-1312.5620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-results-on-strong-edge-colourings-in-outerplanar-graphs-1312.5620"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-network-design-with-maximum-flows-1312.6447</loc><lastmod>2014-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-network-design-with-maximum-flows-1312.6447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-network-design-with-maximum-flows-1312.6447"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-family-of-r-regular-graphs-with-grundy-number-r-1-1312.6503</loc><lastmod>2014-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-family-of-r-regular-graphs-with-grundy-number-r-1-1312.6503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-family-of-r-regular-graphs-with-grundy-number-r-1-1312.6503"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-balanced-partitions-in-graphs-1312.7014</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-balanced-partitions-in-graphs-1312.7014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-balanced-partitions-in-graphs-1312.7014"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-results-for-rainbow-matchings-1312.7253</loc><lastmod>2013-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-results-for-rainbow-matchings-1312.7253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-results-for-rainbow-matchings-1312.7253"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-order-of-graphs-with-given-coloring-parameters-1312.7522</loc><lastmod>2013-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-order-of-graphs-with-given-coloring-parameters-1312.7522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-order-of-graphs-with-given-coloring-parameters-1312.7522"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-well-covered-claw-free-graphs-1312.7563</loc><lastmod>2013-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-well-covered-claw-free-graphs-1312.7563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-well-covered-claw-free-graphs-1312.7563"/></url>
<url><loc>https://scifaro.com/en/abs/critical-connectedness-of-thin-arithmetical-discrete-planes-1312.7820</loc><lastmod>2014-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-connectedness-of-thin-arithmetical-discrete-planes-1312.7820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-connectedness-of-thin-arithmetical-discrete-planes-1312.7820"/></url>
<url><loc>https://scifaro.com/en/abs/unbalanced-allocations-1401.0223</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unbalanced-allocations-1401.0223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unbalanced-allocations-1401.0223"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-algorithms-for-finding-tucker-submatrices-and-lekkerkerker-boland-subgraphs-1401.0224</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-algorithms-for-finding-tucker-submatrices-and-lekkerkerker-boland-subgraphs-1401.0224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-algorithms-for-finding-tucker-submatrices-and-lekkerkerker-boland-subgraphs-1401.0224"/></url>
<url><loc>https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-1401.0279</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-1401.0279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-1401.0279"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-results-for-generating-subgraphs-1401.0294</loc><lastmod>2016-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-results-for-generating-subgraphs-1401.0294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-results-for-generating-subgraphs-1401.0294"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-mis-ere-version-of-three-games-played-on-graphs-1401.0400</loc><lastmod>2015-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-mis-ere-version-of-three-games-played-on-graphs-1401.0400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-mis-ere-version-of-three-games-played-on-graphs-1401.0400"/></url>
<url><loc>https://scifaro.com/en/abs/two-page-book-embeddings-of-4-planar-graphs-1401.0684</loc><lastmod>2014-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-page-book-embeddings-of-4-planar-graphs-1401.0684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-page-book-embeddings-of-4-planar-graphs-1401.0684"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-fuzzy-linear-transformations-1401.0821</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-fuzzy-linear-transformations-1401.0821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-fuzzy-linear-transformations-1401.0821"/></url>
<url><loc>https://scifaro.com/en/abs/antipodal-interval-valued-fuzzy-graphs-1401.0823</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/antipodal-interval-valued-fuzzy-graphs-1401.0823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/antipodal-interval-valued-fuzzy-graphs-1401.0823"/></url>
<url><loc>https://scifaro.com/en/abs/list-coloring-apex-minor-free-graphs-1401.1399</loc><lastmod>2016-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/list-coloring-apex-minor-free-graphs-1401.1399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/list-coloring-apex-minor-free-graphs-1401.1399"/></url>
<url><loc>https://scifaro.com/en/abs/on-polygon-numbers-of-circle-graphs-and-distance-hereditary-graphs-1401.1541</loc><lastmod>2017-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-polygon-numbers-of-circle-graphs-and-distance-hereditary-graphs-1401.1541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-polygon-numbers-of-circle-graphs-and-distance-hereditary-graphs-1401.1541"/></url>
<url><loc>https://scifaro.com/en/abs/homomorphisms-of-signed-planar-graphs-1401.3308</loc><lastmod>2014-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homomorphisms-of-signed-planar-graphs-1401.3308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homomorphisms-of-signed-planar-graphs-1401.3308"/></url>
<url><loc>https://scifaro.com/en/abs/strong-edge-colouring-of-sparse-planar-graphs-1401.4568</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-edge-colouring-of-sparse-planar-graphs-1401.4568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-edge-colouring-of-sparse-planar-graphs-1401.4568"/></url>
<url><loc>https://scifaro.com/en/abs/random-bit-optimal-uniform-sampling-for-rooted-planar-trees-with-given-sequence-of-degrees-and-applications-1401.4712</loc><lastmod>2014-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-bit-optimal-uniform-sampling-for-rooted-planar-trees-with-given-sequence-of-degrees-and-applications-1401.4712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-bit-optimal-uniform-sampling-for-rooted-planar-trees-with-given-sequence-of-degrees-and-applications-1401.4712"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-cartesian-skeleton-and-the-factorization-of-the-strong-product-of-digraphs-1401.4965</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-cartesian-skeleton-and-the-factorization-of-the-strong-product-of-digraphs-1401.4965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-cartesian-skeleton-and-the-factorization-of-the-strong-product-of-digraphs-1401.4965"/></url>
<url><loc>https://scifaro.com/en/abs/dimensional-operators-for-mathematical-morphology-on-simplicial-complexes-1401.5602</loc><lastmod>2014-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimensional-operators-for-mathematical-morphology-on-simplicial-complexes-1401.5602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimensional-operators-for-mathematical-morphology-on-simplicial-complexes-1401.5602"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-dominating-sets-1401.5714</loc><lastmod>2014-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-dominating-sets-1401.5714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-dominating-sets-1401.5714"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-inverses-their-power-sums-and-extrema-for-euler-s-totient-and-other-multiplicative-functions-1401.6054</loc><lastmod>2016-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-inverses-their-power-sums-and-extrema-for-euler-s-totient-and-other-multiplicative-functions-1401.6054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-inverses-their-power-sums-and-extrema-for-euler-s-totient-and-other-multiplicative-functions-1401.6054"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-square-free-self-shuffling-words-1401.6536</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-square-free-self-shuffling-words-1401.6536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-square-free-self-shuffling-words-1401.6536"/></url>
<url><loc>https://scifaro.com/en/abs/on-giant-components-and-treewidth-in-the-layers-model-1401.6681</loc><lastmod>2018-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-giant-components-and-treewidth-in-the-layers-model-1401.6681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-giant-components-and-treewidth-in-the-layers-model-1401.6681"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-submodular-functions-1401.6697</loc><lastmod>2014-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-submodular-functions-1401.6697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-submodular-functions-1401.6697"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-spread-in-network-consensus-models-1401.6963</loc><lastmod>2016-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-spread-in-network-consensus-models-1401.6963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-spread-in-network-consensus-models-1401.6963"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-minmax-regret-for-combinatorial-optimization-under-uncertainty-1401.7043</loc><lastmod>2014-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-minmax-regret-for-combinatorial-optimization-under-uncertainty-1401.7043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-minmax-regret-for-combinatorial-optimization-under-uncertainty-1401.7043"/></url>
<url><loc>https://scifaro.com/en/abs/the-result-for-the-grundy-number-on-p4-classes-1401.7826</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-result-for-the-grundy-number-on-p4-classes-1401.7826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-result-for-the-grundy-number-on-p4-classes-1401.7826"/></url>
<url><loc>https://scifaro.com/en/abs/loopy-annealing-belief-propagation-for-vertex-cover-and-matching-convergence-lp-relaxation-correctness-and-bethe-approximation-1401.7923</loc><lastmod>2014-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/loopy-annealing-belief-propagation-for-vertex-cover-and-matching-convergence-lp-relaxation-correctness-and-bethe-approximation-1401.7923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/loopy-annealing-belief-propagation-for-vertex-cover-and-matching-convergence-lp-relaxation-correctness-and-bethe-approximation-1401.7923"/></url>
<url><loc>https://scifaro.com/en/abs/brooks-vertex-colouring-theorem-in-linear-time-1401.8023</loc><lastmod>2014-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/brooks-vertex-colouring-theorem-in-linear-time-1401.8023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/brooks-vertex-colouring-theorem-in-linear-time-1401.8023"/></url>
<url><loc>https://scifaro.com/en/abs/interval-colorings-of-edges-of-a-multigraph-1401.8079</loc><lastmod>2014-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-colorings-of-edges-of-a-multigraph-1401.8079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-colorings-of-edges-of-a-multigraph-1401.8079"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-properties-of-the-priority-deriving-procedure-in-the-pairwise-comparisons-method-1401.8219</loc><lastmod>2018-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-properties-of-the-priority-deriving-procedure-in-the-pairwise-comparisons-method-1401.8219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-properties-of-the-priority-deriving-procedure-in-the-pairwise-comparisons-method-1401.8219"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-recognition-of-squares-of-ptolemaic-graphs-and-3-sun-free-split-graphs-1402.0024</loc><lastmod>2014-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-recognition-of-squares-of-ptolemaic-graphs-and-3-sun-free-split-graphs-1402.0024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-recognition-of-squares-of-ptolemaic-graphs-and-3-sun-free-split-graphs-1402.0024"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decision-number-of-graphs-1402.0134</loc><lastmod>2014-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decision-number-of-graphs-1402.0134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decision-number-of-graphs-1402.0134"/></url>
<url><loc>https://scifaro.com/en/abs/interval-scheduling-and-colorful-independent-sets-1402.0851</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-scheduling-and-colorful-independent-sets-1402.0851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-scheduling-and-colorful-independent-sets-1402.0851"/></url>
<url><loc>https://scifaro.com/en/abs/on-robustly-asymmetric-graphs-1402.1047</loc><lastmod>2014-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-robustly-asymmetric-graphs-1402.1047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-robustly-asymmetric-graphs-1402.1047"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-characterization-of-leaf-powers-by-clique-arrangements-1402.1425</loc><lastmod>2014-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-characterization-of-leaf-powers-by-clique-arrangements-1402.1425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-characterization-of-leaf-powers-by-clique-arrangements-1402.1425"/></url>
<url><loc>https://scifaro.com/en/abs/independent-set-reconfiguration-in-cographs-1402.1587</loc><lastmod>2014-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-set-reconfiguration-in-cographs-1402.1587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-set-reconfiguration-in-cographs-1402.1587"/></url>
<url><loc>https://scifaro.com/en/abs/a-sat-attack-on-the-erdos-discrepancy-conjecture-1402.2184</loc><lastmod>2014-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sat-attack-on-the-erdos-discrepancy-conjecture-1402.2184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sat-attack-on-the-erdos-discrepancy-conjecture-1402.2184"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-perfect-graphs-into-stars-1402.2589</loc><lastmod>2017-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-perfect-graphs-into-stars-1402.2589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-perfect-graphs-into-stars-1402.2589"/></url>
<url><loc>https://scifaro.com/en/abs/on-circular-arc-graphs-having-a-model-with-no-three-arcs-covering-the-circle-1402.2641</loc><lastmod>2014-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-circular-arc-graphs-having-a-model-with-no-three-arcs-covering-the-circle-1402.2641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-circular-arc-graphs-having-a-model-with-no-three-arcs-covering-the-circle-1402.2641"/></url>
<url><loc>https://scifaro.com/en/abs/network-based-vertex-dissolution-1402.2664</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/network-based-vertex-dissolution-1402.2664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/network-based-vertex-dissolution-1402.2664"/></url>
<url><loc>https://scifaro.com/en/abs/computing-unique-maximum-matchings-in-o-m-time-for-konig-egervary-graphs-and-unicyclic-graphs-1402.2903</loc><lastmod>2014-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-unique-maximum-matchings-in-o-m-time-for-konig-egervary-graphs-and-unicyclic-graphs-1402.2903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-unique-maximum-matchings-in-o-m-time-for-konig-egervary-graphs-and-unicyclic-graphs-1402.2903"/></url>
<url><loc>https://scifaro.com/en/abs/tree-3-spanners-of-diameter-at-most-5-1402.3573</loc><lastmod>2015-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-3-spanners-of-diameter-at-most-5-1402.3573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-3-spanners-of-diameter-at-most-5-1402.3573"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-the-existence-of-solutions-in-the-pairwise-comparisons-method-using-the-heuristic-rating-estimation-approach-1402.4064</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-the-existence-of-solutions-in-the-pairwise-comparisons-method-using-the-heuristic-rating-estimation-approach-1402.4064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-the-existence-of-solutions-in-the-pairwise-comparisons-method-using-the-heuristic-rating-estimation-approach-1402.4064"/></url>
<url><loc>https://scifaro.com/en/abs/morphological-filtering-on-hypergraphs-1402.4258</loc><lastmod>2014-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphological-filtering-on-hypergraphs-1402.4258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphological-filtering-on-hypergraphs-1402.4258"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-on-the-number-of-circular-transpositions-to-sort-a-permutation-1402.4867</loc><lastmod>2014-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-on-the-number-of-circular-transpositions-to-sort-a-permutation-1402.4867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-on-the-number-of-circular-transpositions-to-sort-a-permutation-1402.4867"/></url>
<url><loc>https://scifaro.com/en/abs/dual-power-assignment-via-second-hamiltonian-cycle-1402.5783</loc><lastmod>2014-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-power-assignment-via-second-hamiltonian-cycle-1402.5783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-power-assignment-via-second-hamiltonian-cycle-1402.5783"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-integrality-ratio-of-the-subtour-lp-for-euclidean-tsp-1402.5904</loc><lastmod>2014-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-integrality-ratio-of-the-subtour-lp-for-euclidean-tsp-1402.5904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-integrality-ratio-of-the-subtour-lp-for-euclidean-tsp-1402.5904"/></url>
<url><loc>https://scifaro.com/en/abs/the-role-of-visibility-in-pursuit-evasion-games-1402.6136</loc><lastmod>2014-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-role-of-visibility-in-pursuit-evasion-games-1402.6136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-role-of-visibility-in-pursuit-evasion-games-1402.6136"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-cubicity-of-trees-1402.6310</loc><lastmod>2014-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-cubicity-of-trees-1402.6310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-cubicity-of-trees-1402.6310"/></url>
<url><loc>https://scifaro.com/en/abs/classifying-the-clique-width-of-h-free-bipartite-graphs-1402.7060</loc><lastmod>2014-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classifying-the-clique-width-of-h-free-bipartite-graphs-1402.7060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classifying-the-clique-width-of-h-free-bipartite-graphs-1402.7060"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-characterization-of-p-k-free-graphs-1402.7213</loc><lastmod>2014-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-characterization-of-p-k-free-graphs-1402.7213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-characterization-of-p-k-free-graphs-1402.7213"/></url>
<url><loc>https://scifaro.com/en/abs/on-low-treewidth-graphs-and-supertrees-1402.7224</loc><lastmod>2014-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-low-treewidth-graphs-and-supertrees-1402.7224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-low-treewidth-graphs-and-supertrees-1402.7224"/></url>
<url><loc>https://scifaro.com/en/abs/separator-based-graph-embedding-into-multidimensional-grids-with-small-edge-congestion-1402.7293</loc><lastmod>2014-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separator-based-graph-embedding-into-multidimensional-grids-with-small-edge-congestion-1402.7293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separator-based-graph-embedding-into-multidimensional-grids-with-small-edge-congestion-1402.7293"/></url>
<url><loc>https://scifaro.com/en/abs/edge-elimination-in-tsp-instances-1402.7301</loc><lastmod>2014-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-elimination-in-tsp-instances-1402.7301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-elimination-in-tsp-instances-1402.7301"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguring-independent-sets-in-claw-free-graphs-1403.0359</loc><lastmod>2014-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguring-independent-sets-in-claw-free-graphs-1403.0359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguring-independent-sets-in-claw-free-graphs-1403.0359"/></url>
<url><loc>https://scifaro.com/en/abs/online-algorithms-for-machine-minimization-1403.0486</loc><lastmod>2014-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-algorithms-for-machine-minimization-1403.0486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-algorithms-for-machine-minimization-1403.0486"/></url>
<url><loc>https://scifaro.com/en/abs/linear-recognition-of-almost-interval-graphs-1403.1515</loc><lastmod>2014-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-recognition-of-almost-interval-graphs-1403.1515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-recognition-of-almost-interval-graphs-1403.1515"/></url>
<url><loc>https://scifaro.com/en/abs/disimplicial-arcs-transitive-vertices-and-disimplicial-eliminations-1403.1628</loc><lastmod>2014-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disimplicial-arcs-transitive-vertices-and-disimplicial-eliminations-1403.1628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disimplicial-arcs-transitive-vertices-and-disimplicial-eliminations-1403.1628"/></url>
<url><loc>https://scifaro.com/en/abs/excuse-me-or-the-courteous-theatregoers-problem-1403.1988</loc><lastmod>2014-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/excuse-me-or-the-courteous-theatregoers-problem-1403.1988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/excuse-me-or-the-courteous-theatregoers-problem-1403.1988"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-harmonic-oscillation-of-high-order-linear-time-invariant-systems-1403.2170</loc><lastmod>2014-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-harmonic-oscillation-of-high-order-linear-time-invariant-systems-1403.2170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-harmonic-oscillation-of-high-order-linear-time-invariant-systems-1403.2170"/></url>
<url><loc>https://scifaro.com/en/abs/string-reconstruction-from-substring-compositions-1403.2439</loc><lastmod>2014-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-reconstruction-from-substring-compositions-1403.2439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-reconstruction-from-substring-compositions-1403.2439"/></url>
<url><loc>https://scifaro.com/en/abs/the-relativized-second-eigenvalue-conjecture-of-alon-1403.3462</loc><lastmod>2014-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relativized-second-eigenvalue-conjecture-of-alon-1403.3462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relativized-second-eigenvalue-conjecture-of-alon-1403.3462"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-all-maximal-biclusters-in-numerical-datasets-1403.3562</loc><lastmod>2015-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-all-maximal-biclusters-in-numerical-datasets-1403.3562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-all-maximal-biclusters-in-numerical-datasets-1403.3562"/></url>
<url><loc>https://scifaro.com/en/abs/np-hardness-results-for-partitioning-graphs-into-disjoint-cliques-and-a-triangle-free-subgraph-1403.5248</loc><lastmod>2014-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-hardness-results-for-partitioning-graphs-into-disjoint-cliques-and-a-triangle-free-subgraph-1403.5248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-hardness-results-for-partitioning-graphs-into-disjoint-cliques-and-a-triangle-free-subgraph-1403.5248"/></url>
<url><loc>https://scifaro.com/en/abs/online-square-into-square-packing-1403.5665</loc><lastmod>2017-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-square-into-square-packing-1403.5665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-square-into-square-packing-1403.5665"/></url>
<url><loc>https://scifaro.com/en/abs/the-density-of-fan-planar-graphs-1403.6184</loc><lastmod>2021-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-density-of-fan-planar-graphs-1403.6184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-density-of-fan-planar-graphs-1403.6184"/></url>
<url><loc>https://scifaro.com/en/abs/recoloring-graphs-via-tree-decompositions-1403.6386</loc><lastmod>2014-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recoloring-graphs-via-tree-decompositions-1403.6386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recoloring-graphs-via-tree-decompositions-1403.6386"/></url>
<url><loc>https://scifaro.com/en/abs/languages-of-lossless-seeds-1403.6414</loc><lastmod>2014-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/languages-of-lossless-seeds-1403.6414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/languages-of-lossless-seeds-1403.6414"/></url>
<url><loc>https://scifaro.com/en/abs/relational-mathematics-continued-1403.6957</loc><lastmod>2014-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-mathematics-continued-1403.6957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-mathematics-continued-1403.6957"/></url>
<url><loc>https://scifaro.com/en/abs/tree-depth-and-vertex-minors-1403.7024</loc><lastmod>2014-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-depth-and-vertex-minors-1403.7024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-depth-and-vertex-minors-1403.7024"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-techniques-for-graph-isomorphism-in-the-context-of-width-parameters-1403.7238</loc><lastmod>2014-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-techniques-for-graph-isomorphism-in-the-context-of-width-parameters-1403.7238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-techniques-for-graph-isomorphism-in-the-context-of-width-parameters-1403.7238"/></url>
<url><loc>https://scifaro.com/en/abs/s-packing-colorings-of-cubic-graphs-1403.7495</loc><lastmod>2016-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/s-packing-colorings-of-cubic-graphs-1403.7495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/s-packing-colorings-of-cubic-graphs-1403.7495"/></url>
<url><loc>https://scifaro.com/en/abs/causal-dynamics-of-discrete-surfaces-1404.0083</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-dynamics-of-discrete-surfaces-1404.0083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-dynamics-of-discrete-surfaces-1404.0083"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-discrepancy-minimization-for-convex-sets-1404.0339</loc><lastmod>2016-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-discrepancy-minimization-for-convex-sets-1404.0339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-discrepancy-minimization-for-convex-sets-1404.0339"/></url>
<url><loc>https://scifaro.com/en/abs/labeling-schemes-for-bounded-degree-graphs-1404.0588</loc><lastmod>2014-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/labeling-schemes-for-bounded-degree-graphs-1404.0588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/labeling-schemes-for-bounded-degree-graphs-1404.0588"/></url>
<url><loc>https://scifaro.com/en/abs/tighter-undecidability-bounds-for-matrix-mortality-zero-in-the-corner-problems-and-more-1404.0644</loc><lastmod>2014-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tighter-undecidability-bounds-for-matrix-mortality-zero-in-the-corner-problems-and-more-1404.0644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tighter-undecidability-bounds-for-matrix-mortality-zero-in-the-corner-problems-and-more-1404.0644"/></url>
<url><loc>https://scifaro.com/en/abs/property-testing-on-product-distributions-optimal-testers-for-bounded-derivative-properties-1404.0718</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/property-testing-on-product-distributions-optimal-testers-for-bounded-derivative-properties-1404.0718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/property-testing-on-product-distributions-optimal-testers-for-bounded-derivative-properties-1404.0718"/></url>
<url><loc>https://scifaro.com/en/abs/overview-of-the-heisenberg-weyl-algebra-and-subsets-of-riordan-subgroups-1404.1894</loc><lastmod>2016-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overview-of-the-heisenberg-weyl-algebra-and-subsets-of-riordan-subgroups-1404.1894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overview-of-the-heisenberg-weyl-algebra-and-subsets-of-riordan-subgroups-1404.1894"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-persistency-in-energy-minimization-1404.3653</loc><lastmod>2014-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-persistency-in-energy-minimization-1404.3653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-persistency-in-energy-minimization-1404.3653"/></url>
<url><loc>https://scifaro.com/en/abs/a-d-dimensional-extension-of-christoffel-words-1404.4021</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-d-dimensional-extension-of-christoffel-words-1404.4021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-d-dimensional-extension-of-christoffel-words-1404.4021"/></url>
<url><loc>https://scifaro.com/en/abs/factor-complexity-of-s-adic-sequences-generated-by-the-arnoux-rauzy-poincar-e-algorithm-1404.4189</loc><lastmod>2015-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factor-complexity-of-s-adic-sequences-generated-by-the-arnoux-rauzy-poincar-e-algorithm-1404.4189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factor-complexity-of-s-adic-sequences-generated-by-the-arnoux-rauzy-poincar-e-algorithm-1404.4189"/></url>
<url><loc>https://scifaro.com/en/abs/broder-s-chain-is-not-rapidly-mixing-1404.4249</loc><lastmod>2014-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/broder-s-chain-is-not-rapidly-mixing-1404.4249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/broder-s-chain-is-not-rapidly-mixing-1404.4249"/></url>
<url><loc>https://scifaro.com/en/abs/rainbow-colouring-of-split-graphs-1404.4478</loc><lastmod>2014-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rainbow-colouring-of-split-graphs-1404.4478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rainbow-colouring-of-split-graphs-1404.4478"/></url>
<url><loc>https://scifaro.com/en/abs/approximability-of-the-minimum-weighted-doubly-resolving-set-problem-1404.4676</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximability-of-the-minimum-weighted-doubly-resolving-set-problem-1404.4676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximability-of-the-minimum-weighted-doubly-resolving-set-problem-1404.4676"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relation-between-graph-distance-and-euclidean-distance-in-random-geometric-graphs-1404.4757</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relation-between-graph-distance-and-euclidean-distance-in-random-geometric-graphs-1404.4757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relation-between-graph-distance-and-euclidean-distance-in-random-geometric-graphs-1404.4757"/></url>
<url><loc>https://scifaro.com/en/abs/finding-safe-strategies-for-competitive-diffusion-on-trees-1404.5356</loc><lastmod>2015-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-safe-strategies-for-competitive-diffusion-on-trees-1404.5356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-safe-strategies-for-competitive-diffusion-on-trees-1404.5356"/></url>
<url><loc>https://scifaro.com/en/abs/win-win-kernelization-for-degree-sequence-completion-problems-1404.5432</loc><lastmod>2016-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/win-win-kernelization-for-degree-sequence-completion-problems-1404.5432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/win-win-kernelization-for-degree-sequence-completion-problems-1404.5432"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-graphs-an-introduction-1404.5468</loc><lastmod>2014-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-graphs-an-introduction-1404.5468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-graphs-an-introduction-1404.5468"/></url>
<url><loc>https://scifaro.com/en/abs/the-condensation-phase-transition-in-random-graph-coloring-1404.5513</loc><lastmod>2017-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-condensation-phase-transition-in-random-graph-coloring-1404.5513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-condensation-phase-transition-in-random-graph-coloring-1404.5513"/></url>
<url><loc>https://scifaro.com/en/abs/an-o-n-time-algorithm-for-maximum-induced-matching-in-bipartite-star-123-free-graphs-1404.6288</loc><lastmod>2014-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-o-n-time-algorithm-for-maximum-induced-matching-in-bipartite-star-123-free-graphs-1404.6288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-o-n-time-algorithm-for-maximum-induced-matching-in-bipartite-star-123-free-graphs-1404.6288"/></url>
<url><loc>https://scifaro.com/en/abs/interval-valued-intuitionistic-fuzzy-matrices-1404.6949</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-valued-intuitionistic-fuzzy-matrices-1404.6949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-valued-intuitionistic-fuzzy-matrices-1404.6949"/></url>
<url><loc>https://scifaro.com/en/abs/heuristic-rating-estimation-geometric-approach-1404.6981</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristic-rating-estimation-geometric-approach-1404.6981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristic-rating-estimation-geometric-approach-1404.6981"/></url>
<url><loc>https://scifaro.com/en/abs/it-s-a-small-world-for-random-surfers-1404.7189</loc><lastmod>2014-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-s-a-small-world-for-random-surfers-1404.7189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-s-a-small-world-for-random-surfers-1404.7189"/></url>
<url><loc>https://scifaro.com/en/abs/the-stable-set-polytope-of-p-6-triangle-free-graphs-and-new-facet-inducing-graphs-1404.7623</loc><lastmod>2014-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stable-set-polytope-of-p-6-triangle-free-graphs-and-new-facet-inducing-graphs-1404.7623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stable-set-polytope-of-p-6-triangle-free-graphs-and-new-facet-inducing-graphs-1404.7623"/></url>
<url><loc>https://scifaro.com/en/abs/domination-games-played-on-line-graphs-of-complete-multipartite-graphs-1405.0087</loc><lastmod>2014-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domination-games-played-on-line-graphs-of-complete-multipartite-graphs-1405.0087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domination-games-played-on-line-graphs-of-complete-multipartite-graphs-1405.0087"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-induced-subgraphs-of-normal-helly-circular-arc-graphs-characterization-and-detection-1405.0329</loc><lastmod>2014-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-induced-subgraphs-of-normal-helly-circular-arc-graphs-characterization-and-detection-1405.0329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-induced-subgraphs-of-normal-helly-circular-arc-graphs-characterization-and-detection-1405.0329"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-ring-loading-problem-1405.0789</loc><lastmod>2014-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-ring-loading-problem-1405.0789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-ring-loading-problem-1405.0789"/></url>
<url><loc>https://scifaro.com/en/abs/mejora-de-la-exploracion-y-la-explotacion-de-las-heuristicas-constructivas-para-el-mlstp-1405.1980</loc><lastmod>2014-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mejora-de-la-exploracion-y-la-explotacion-de-las-heuristicas-constructivas-para-el-mlstp-1405.1980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mejora-de-la-exploracion-y-la-explotacion-de-las-heuristicas-constructivas-para-el-mlstp-1405.1980"/></url>
<url><loc>https://scifaro.com/en/abs/scheduling-algorithm-to-select-k-optimal-programme-slots-in-television-channels-a-graph-theoretic-approach-1405.2199</loc><lastmod>2014-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scheduling-algorithm-to-select-k-optimal-programme-slots-in-television-channels-a-graph-theoretic-approach-1405.2199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scheduling-algorithm-to-select-k-optimal-programme-slots-in-television-channels-a-graph-theoretic-approach-1405.2199"/></url>
<url><loc>https://scifaro.com/en/abs/upper-tail-estimates-with-combinatorial-proofs-1405.2349</loc><lastmod>2015-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-tail-estimates-with-combinatorial-proofs-1405.2349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-tail-estimates-with-combinatorial-proofs-1405.2349"/></url>
<url><loc>https://scifaro.com/en/abs/identification-location-domination-and-metric-dimension-on-interval-and-permutation-graphs-ii-algorithms-and-complexity-1405.2424</loc><lastmod>2017-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identification-location-domination-and-metric-dimension-on-interval-and-permutation-graphs-ii-algorithms-and-complexity-1405.2424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identification-location-domination-and-metric-dimension-on-interval-and-permutation-graphs-ii-algorithms-and-complexity-1405.2424"/></url>
<url><loc>https://scifaro.com/en/abs/computer-aided-proof-of-erdos-discrepancy-properties-1405.3097</loc><lastmod>2014-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-aided-proof-of-erdos-discrepancy-properties-1405.3097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-aided-proof-of-erdos-discrepancy-properties-1405.3097"/></url>
<url><loc>https://scifaro.com/en/abs/planar-graphs-with-delta-geq-7-and-no-triangle-adjacent-to-a-c-4-are-minimally-edge-and-total-choosable-1405.3422</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-graphs-with-delta-geq-7-and-no-triangle-adjacent-to-a-c-4-are-minimally-edge-and-total-choosable-1405.3422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-graphs-with-delta-geq-7-and-no-triangle-adjacent-to-a-c-4-are-minimally-edge-and-total-choosable-1405.3422"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-lattice-reduction-block-korkin-zolotarev-method-to-mimo-decoding-1405.3599</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-lattice-reduction-block-korkin-zolotarev-method-to-mimo-decoding-1405.3599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-lattice-reduction-block-korkin-zolotarev-method-to-mimo-decoding-1405.3599"/></url>
<url><loc>https://scifaro.com/en/abs/signed-graph-embedding-when-everybody-can-sit-closer-to-friends-than-enemies-1405.5023</loc><lastmod>2014-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signed-graph-embedding-when-everybody-can-sit-closer-to-friends-than-enemies-1405.5023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signed-graph-embedding-when-everybody-can-sit-closer-to-friends-than-enemies-1405.5023"/></url>
<url><loc>https://scifaro.com/en/abs/towards-k-connectivity-of-the-random-graph-induced-by-a-pairwise-key-predistribution-scheme-with-unreliable-links-1405.5193</loc><lastmod>2017-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-k-connectivity-of-the-random-graph-induced-by-a-pairwise-key-predistribution-scheme-with-unreliable-links-1405.5193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-k-connectivity-of-the-random-graph-induced-by-a-pairwise-key-predistribution-scheme-with-unreliable-links-1405.5193"/></url>
<url><loc>https://scifaro.com/en/abs/twenty-five-comparators-is-optimal-when-sorting-nine-inputs-and-twenty-nine-for-ten-1405.5754</loc><lastmod>2016-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twenty-five-comparators-is-optimal-when-sorting-nine-inputs-and-twenty-nine-for-ten-1405.5754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twenty-five-comparators-is-optimal-when-sorting-nine-inputs-and-twenty-nine-for-ten-1405.5754"/></url>
<url><loc>https://scifaro.com/en/abs/isometry-on-interval-valued-fuzzy-graphs-1405.6003</loc><lastmod>2014-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isometry-on-interval-valued-fuzzy-graphs-1405.6003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isometry-on-interval-valued-fuzzy-graphs-1405.6003"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-programming-formulation-of-the-minimum-common-string-partition-problem-1405.6081</loc><lastmod>2015-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-programming-formulation-of-the-minimum-common-string-partition-problem-1405.6081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-programming-formulation-of-the-minimum-common-string-partition-problem-1405.6081"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-of-constraint-systems-1405.6131</loc><lastmod>2014-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-of-constraint-systems-1405.6131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-of-constraint-systems-1405.6131"/></url>
<url><loc>https://scifaro.com/en/abs/zero-forcing-number-constrained-matchings-and-strong-structural-controllability-1405.6222</loc><lastmod>2015-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zero-forcing-number-constrained-matchings-and-strong-structural-controllability-1405.6222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zero-forcing-number-constrained-matchings-and-strong-structural-controllability-1405.6222"/></url>
<url><loc>https://scifaro.com/en/abs/exact-values-for-the-grundy-number-of-some-graphs-1405.6432</loc><lastmod>2014-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-values-for-the-grundy-number-of-some-graphs-1405.6432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-values-for-the-grundy-number-of-some-graphs-1405.6432"/></url>
<url><loc>https://scifaro.com/en/abs/results-for-grundy-number-of-the-complement-of-bipartite-graphs-1405.6433</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/results-for-grundy-number-of-the-complement-of-bipartite-graphs-1405.6433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/results-for-grundy-number-of-the-complement-of-bipartite-graphs-1405.6433"/></url>
<url><loc>https://scifaro.com/en/abs/computing-minimum-rainbow-and-strong-rainbow-colorings-of-block-graphs-1405.6893</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-minimum-rainbow-and-strong-rainbow-colorings-of-block-graphs-1405.6893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-minimum-rainbow-and-strong-rainbow-colorings-of-block-graphs-1405.6893"/></url>
<url><loc>https://scifaro.com/en/abs/an-exact-dsatur-based-algorithm-for-the-equitable-coloring-problem-1405.7011</loc><lastmod>2014-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-exact-dsatur-based-algorithm-for-the-equitable-coloring-problem-1405.7011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-exact-dsatur-based-algorithm-for-the-equitable-coloring-problem-1405.7011"/></url>
<url><loc>https://scifaro.com/en/abs/a-tabu-search-heuristic-for-the-equitable-coloring-problem-1405.7020</loc><lastmod>2017-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tabu-search-heuristic-for-the-equitable-coloring-problem-1405.7020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tabu-search-heuristic-for-the-equitable-coloring-problem-1405.7020"/></url>
<url><loc>https://scifaro.com/en/abs/clique-width-of-graph-classes-defined-by-two-forbidden-induced-subgraphs-1405.7092</loc><lastmod>2015-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-width-of-graph-classes-defined-by-two-forbidden-induced-subgraphs-1405.7092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-width-of-graph-classes-defined-by-two-forbidden-induced-subgraphs-1405.7092"/></url>
<url><loc>https://scifaro.com/en/abs/coloration-de-nombre-de-grundy-pour-les-graphes-triangul-es-1405.7383</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloration-de-nombre-de-grundy-pour-les-graphes-triangul-es-1405.7383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloration-de-nombre-de-grundy-pour-les-graphes-triangul-es-1405.7383"/></url>
<url><loc>https://scifaro.com/en/abs/superconcentrators-of-density-25-3-1405.7828</loc><lastmod>2016-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superconcentrators-of-density-25-3-1405.7828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superconcentrators-of-density-25-3-1405.7828"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-galois-lattice-of-bipartite-distance-hereditary-graphs-1406.0154</loc><lastmod>2014-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-galois-lattice-of-bipartite-distance-hereditary-graphs-1406.0154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-galois-lattice-of-bipartite-distance-hereditary-graphs-1406.0154"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-algorithm-for-the-grundy-number-of-a-tree-1406.0196</loc><lastmod>2015-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-algorithm-for-the-grundy-number-of-a-tree-1406.0196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-algorithm-for-the-grundy-number-of-a-tree-1406.0196"/></url>
<url><loc>https://scifaro.com/en/abs/the-runs-theorem-1406.0263</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-runs-theorem-1406.0263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-runs-theorem-1406.0263"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-framework-for-the-real-time-solution-of-inverse-problems-on-embedded-systems-1406.0380</loc><lastmod>2014-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-framework-for-the-real-time-solution-of-inverse-problems-on-embedded-systems-1406.0380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-framework-for-the-real-time-solution-of-inverse-problems-on-embedded-systems-1406.0380"/></url>
<url><loc>https://scifaro.com/en/abs/fourier-transforms-and-bent-functions-on-finite-abelian-group-acted-sets-1406.1049</loc><lastmod>2014-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fourier-transforms-and-bent-functions-on-finite-abelian-group-acted-sets-1406.1049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fourier-transforms-and-bent-functions-on-finite-abelian-group-acted-sets-1406.1049"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmes-dynamiques-pour-la-communication-dans-le-r-eseau-ad-hoc-coloration-des-graphes-1406.1329</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmes-dynamiques-pour-la-communication-dans-le-r-eseau-ad-hoc-coloration-des-graphes-1406.1329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmes-dynamiques-pour-la-communication-dans-le-r-eseau-ad-hoc-coloration-des-graphes-1406.1329"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguring-independent-sets-in-cographs-1406.1433</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguring-independent-sets-in-cographs-1406.1433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguring-independent-sets-in-cographs-1406.1433"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-constructions-of-some-d-restriction-problems-1406.2108</loc><lastmod>2014-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-constructions-of-some-d-restriction-problems-1406.2108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-constructions-of-some-d-restriction-problems-1406.2108"/></url>
<url><loc>https://scifaro.com/en/abs/on-bipartization-of-cubic-graphs-by-removal-of-an-independent-set-1406.2728</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bipartization-of-cubic-graphs-by-removal-of-an-independent-set-1406.2728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bipartization-of-cubic-graphs-by-removal-of-an-independent-set-1406.2728"/></url>
<url><loc>https://scifaro.com/en/abs/indeterminate-strings-prefix-arrays-undirected-graphs-1406.3289</loc><lastmod>2014-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indeterminate-strings-prefix-arrays-undirected-graphs-1406.3289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indeterminate-strings-prefix-arrays-undirected-graphs-1406.3289"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-non-reconstruction-thresholds-for-colourings-of-general-galton-watson-trees-1406.3617</loc><lastmod>2015-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-non-reconstruction-thresholds-for-colourings-of-general-galton-watson-trees-1406.3617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-non-reconstruction-thresholds-for-colourings-of-general-galton-watson-trees-1406.3617"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-polynomial-factoring-under-the-assumption-of-the-extended-riemann-hypothesis-erh-1406.3672</loc><lastmod>2015-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-polynomial-factoring-under-the-assumption-of-the-extended-riemann-hypothesis-erh-1406.3672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-polynomial-factoring-under-the-assumption-of-the-extended-riemann-hypothesis-erh-1406.3672"/></url>
<url><loc>https://scifaro.com/en/abs/regular-interval-exchange-transformations-over-a-quadratic-field-1406.4075</loc><lastmod>2014-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-interval-exchange-transformations-over-a-quadratic-field-1406.4075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-interval-exchange-transformations-over-a-quadratic-field-1406.4075"/></url>
<url><loc>https://scifaro.com/en/abs/entropy-compression-method-applied-to-graph-colorings-1406.4380</loc><lastmod>2015-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entropy-compression-method-applied-to-graph-colorings-1406.4380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entropy-compression-method-applied-to-graph-colorings-1406.4380"/></url>
<url><loc>https://scifaro.com/en/abs/z2z4-additive-cyclic-codes-generator-polynomials-and-dual-codes-1406.4425</loc><lastmod>2016-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/z2z4-additive-cyclic-codes-generator-polynomials-and-dual-codes-1406.4425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/z2z4-additive-cyclic-codes-generator-polynomials-and-dual-codes-1406.4425"/></url>
<url><loc>https://scifaro.com/en/abs/proper-hamiltonian-paths-in-edge-coloured-multigraphs-1406.5376</loc><lastmod>2014-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proper-hamiltonian-paths-in-edge-coloured-multigraphs-1406.5376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proper-hamiltonian-paths-in-edge-coloured-multigraphs-1406.5376"/></url>
<url><loc>https://scifaro.com/en/abs/universal-lyndon-words-1406.5895</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-lyndon-words-1406.5895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-lyndon-words-1406.5895"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-clique-width-via-perfect-graphs-1406.6298</loc><lastmod>2015-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-clique-width-via-perfect-graphs-1406.6298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-clique-width-via-perfect-graphs-1406.6298"/></url>
<url><loc>https://scifaro.com/en/abs/minimally-unbalanced-diamond-free-graphs-and-dyck-paths-1406.6494</loc><lastmod>2014-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimally-unbalanced-diamond-free-graphs-and-dyck-paths-1406.6494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimally-unbalanced-diamond-free-graphs-and-dyck-paths-1406.6494"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-parameter-tractability-of-token-jumping-on-planar-graphs-1406.6567</loc><lastmod>2015-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-parameter-tractability-of-token-jumping-on-planar-graphs-1406.6567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-parameter-tractability-of-token-jumping-on-planar-graphs-1406.6567"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-algorithm-for-sliding-tokens-on-trees-1406.6576</loc><lastmod>2014-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-algorithm-for-sliding-tokens-on-trees-1406.6576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-algorithm-for-sliding-tokens-on-trees-1406.6576"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-of-maxgeneralized-mean-mingeneralized-mean-powers-of-intuitionistic-fuzzy-matrices-1407.0189</loc><lastmod>2014-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-of-maxgeneralized-mean-mingeneralized-mean-powers-of-intuitionistic-fuzzy-matrices-1407.0189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-of-maxgeneralized-mean-mingeneralized-mean-powers-of-intuitionistic-fuzzy-matrices-1407.0189"/></url>
<url><loc>https://scifaro.com/en/abs/non-regular-graphs-with-minimal-total-irregularity-1407.1276</loc><lastmod>2014-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-regular-graphs-with-minimal-total-irregularity-1407.1276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-regular-graphs-with-minimal-total-irregularity-1407.1276"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-and-algorithms-for-limited-packings-in-graphs-1407.1637</loc><lastmod>2014-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-and-algorithms-for-limited-packings-in-graphs-1407.1637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-and-algorithms-for-limited-packings-in-graphs-1407.1637"/></url>
<url><loc>https://scifaro.com/en/abs/cops-and-robbers-game-theory-and-zermelo-s-early-results-1407.1647</loc><lastmod>2014-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cops-and-robbers-game-theory-and-zermelo-s-early-results-1407.1647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cops-and-robbers-game-theory-and-zermelo-s-early-results-1407.1647"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-enumeration-of-minimal-dominating-sets-and-related-notions-1407.2053</loc><lastmod>2014-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-enumeration-of-minimal-dominating-sets-and-related-notions-1407.2053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-enumeration-of-minimal-dominating-sets-and-related-notions-1407.2053"/></url>
<url><loc>https://scifaro.com/en/abs/eulerian-digraphs-and-dyck-words-a-bijection-1407.2461</loc><lastmod>2014-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eulerian-digraphs-and-dyck-words-a-bijection-1407.2461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eulerian-digraphs-and-dyck-words-a-bijection-1407.2461"/></url>
<url><loc>https://scifaro.com/en/abs/4-coloring-p-6-free-graphs-with-no-induced-5-cycles-1407.2487</loc><lastmod>2014-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/4-coloring-p-6-free-graphs-with-no-induced-5-cycles-1407.2487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/4-coloring-p-6-free-graphs-with-no-induced-5-cycles-1407.2487"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-erdos-discrepancy-problem-1407.2510</loc><lastmod>2014-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-erdos-discrepancy-problem-1407.2510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-erdos-discrepancy-problem-1407.2510"/></url>
<url><loc>https://scifaro.com/en/abs/distinguishing-views-in-symmetric-networks-a-tight-lower-bound-1407.2511</loc><lastmod>2015-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distinguishing-views-in-symmetric-networks-a-tight-lower-bound-1407.2511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distinguishing-views-in-symmetric-networks-a-tight-lower-bound-1407.2511"/></url>
<url><loc>https://scifaro.com/en/abs/the-relaxed-square-property-1407.3164</loc><lastmod>2014-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relaxed-square-property-1407.3164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relaxed-square-property-1407.3164"/></url>
<url><loc>https://scifaro.com/en/abs/lock-in-problem-for-parallel-rotor-router-walks-1407.3200</loc><lastmod>2015-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lock-in-problem-for-parallel-rotor-router-walks-1407.3200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lock-in-problem-for-parallel-rotor-router-walks-1407.3200"/></url>
<url><loc>https://scifaro.com/en/abs/a-complexity-analysis-of-policy-iteration-through-combinatorial-matrices-arising-from-unique-sink-orientations-1407.4293</loc><lastmod>2015-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complexity-analysis-of-policy-iteration-through-combinatorial-matrices-arising-from-unique-sink-orientations-1407.4293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complexity-analysis-of-policy-iteration-through-combinatorial-matrices-arising-from-unique-sink-orientations-1407.4293"/></url>
<url><loc>https://scifaro.com/en/abs/generating-asymptotically-non-terminating-initial-values-for-linear-programs-1407.4556</loc><lastmod>2014-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-asymptotically-non-terminating-initial-values-for-linear-programs-1407.4556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-asymptotically-non-terminating-initial-values-for-linear-programs-1407.4556"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-efficient-domination-for-p-5-kp-2-free-graphs-in-polynomial-time-1407.4593</loc><lastmod>2014-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-efficient-domination-for-p-5-kp-2-free-graphs-in-polynomial-time-1407.4593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-efficient-domination-for-p-5-kp-2-free-graphs-in-polynomial-time-1407.4593"/></url>
<url><loc>https://scifaro.com/en/abs/mixed-integer-quadratic-programming-is-in-np-1407.4798</loc><lastmod>2014-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixed-integer-quadratic-programming-is-in-np-1407.4798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixed-integer-quadratic-programming-is-in-np-1407.4798"/></url>
<url><loc>https://scifaro.com/en/abs/acyclic-edge-coloring-through-the-lov-asz-local-lemma-1407.5374</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclic-edge-coloring-through-the-lov-asz-local-lemma-1407.5374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclic-edge-coloring-through-the-lov-asz-local-lemma-1407.5374"/></url>
<url><loc>https://scifaro.com/en/abs/l-2-1-labelling-of-circular-arc-graph-1407.5488</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-2-1-labelling-of-circular-arc-graph-1407.5488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-2-1-labelling-of-circular-arc-graph-1407.5488"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-codes-in-hereditary-classes-of-graphs-and-vc-dimension-1407.5833</loc><lastmod>2017-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-codes-in-hereditary-classes-of-graphs-and-vc-dimension-1407.5833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-codes-in-hereditary-classes-of-graphs-and-vc-dimension-1407.5833"/></url>
<url><loc>https://scifaro.com/en/abs/irregular-interval-valued-fuzzy-graphs-1407.6190</loc><lastmod>2014-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irregular-interval-valued-fuzzy-graphs-1407.6190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irregular-interval-valued-fuzzy-graphs-1407.6190"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-distance-preserving-trees-in-graphs-1407.6416</loc><lastmod>2014-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-distance-preserving-trees-in-graphs-1407.6416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-distance-preserving-trees-in-graphs-1407.6416"/></url>
<url><loc>https://scifaro.com/en/abs/how-when-and-how-much-a-card-deck-is-well-shuffled-1407.6950</loc><lastmod>2014-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-when-and-how-much-a-card-deck-is-well-shuffled-1407.6950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-when-and-how-much-a-card-deck-is-well-shuffled-1407.6950"/></url>
<url><loc>https://scifaro.com/en/abs/critical-independent-sets-of-a-graph-1407.7368</loc><lastmod>2014-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-independent-sets-of-a-graph-1407.7368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-independent-sets-of-a-graph-1407.7368"/></url>
<url><loc>https://scifaro.com/en/abs/induced-matchings-in-graphs-of-degree-at-most-4-1407.7604</loc><lastmod>2014-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induced-matchings-in-graphs-of-degree-at-most-4-1407.7604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induced-matchings-in-graphs-of-degree-at-most-4-1407.7604"/></url>
<url><loc>https://scifaro.com/en/abs/genus-distributions-of-cubic-series-parallel-graphs-1407.8031</loc><lastmod>2014-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/genus-distributions-of-cubic-series-parallel-graphs-1407.8031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/genus-distributions-of-cubic-series-parallel-graphs-1407.8031"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-a-tree-3-spanner-on-trapezoid-graphs-1407.8132</loc><lastmod>2014-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-a-tree-3-spanner-on-trapezoid-graphs-1407.8132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-a-tree-3-spanner-on-trapezoid-graphs-1407.8132"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-size-linear-programs-for-problems-in-p-1408.0807</loc><lastmod>2018-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-size-linear-programs-for-problems-in-p-1408.0807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-size-linear-programs-for-problems-in-p-1408.0807"/></url>
<url><loc>https://scifaro.com/en/abs/on-multiaspect-graphs-1408.0943</loc><lastmod>2016-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-multiaspect-graphs-1408.0943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-multiaspect-graphs-1408.0943"/></url>
<url><loc>https://scifaro.com/en/abs/ordering-without-forbidden-patterns-1408.1461</loc><lastmod>2014-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordering-without-forbidden-patterns-1408.1461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordering-without-forbidden-patterns-1408.1461"/></url>
<url><loc>https://scifaro.com/en/abs/the-erd-h-o-s-hajnal-conjecture-for-long-holes-and-anti-holes-1408.1964</loc><lastmod>2014-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-erd-h-o-s-hajnal-conjecture-for-long-holes-and-anti-holes-1408.1964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-erd-h-o-s-hajnal-conjecture-for-long-holes-and-anti-holes-1408.1964"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-arithmetic-read-once-formulae-1408.1995</loc><lastmod>2014-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-arithmetic-read-once-formulae-1408.1995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-arithmetic-read-once-formulae-1408.1995"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-large-chromatic-number-induce-3k-cycles-1408.2172</loc><lastmod>2014-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-large-chromatic-number-induce-3k-cycles-1408.2172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-large-chromatic-number-induce-3k-cycles-1408.2172"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraph-markov-operators-eigenvalues-and-approximation-algorithms-1408.2425</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraph-markov-operators-eigenvalues-and-approximation-algorithms-1408.2425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraph-markov-operators-eigenvalues-and-approximation-algorithms-1408.2425"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-structure-characterization-of-circular-arc-graphs-and-a-certifying-recognition-algorithm-1408.2639</loc><lastmod>2014-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-structure-characterization-of-circular-arc-graphs-and-a-certifying-recognition-algorithm-1408.2639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-structure-characterization-of-circular-arc-graphs-and-a-certifying-recognition-algorithm-1408.2639"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-structure-and-the-number-of-prime-implicants-of-2-cnfs-1408.2662</loc><lastmod>2015-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-structure-and-the-number-of-prime-implicants-of-2-cnfs-1408.2662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-structure-and-the-number-of-prime-implicants-of-2-cnfs-1408.2662"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-neighbour-sum-distinguishing-index-of-planar-graphs-1408.3190</loc><lastmod>2018-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-neighbour-sum-distinguishing-index-of-planar-graphs-1408.3190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-neighbour-sum-distinguishing-index-of-planar-graphs-1408.3190"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-minimal-and-short-representations-of-unit-interval-and-unit-circular-arc-graphs-1408.3443</loc><lastmod>2014-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-minimal-and-short-representations-of-unit-interval-and-unit-circular-arc-graphs-1408.3443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-minimal-and-short-representations-of-unit-interval-and-unit-circular-arc-graphs-1408.3443"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-generalization-of-eight-blocks-to-madness-1408.3696</loc><lastmod>2015-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-generalization-of-eight-blocks-to-madness-1408.3696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-generalization-of-eight-blocks-to-madness-1408.3696"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-tree-enumeration-in-2-trees-sequential-and-parallel-perspective-1408.3977</loc><lastmod>2014-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-tree-enumeration-in-2-trees-sequential-and-parallel-perspective-1408.3977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-tree-enumeration-in-2-trees-sequential-and-parallel-perspective-1408.3977"/></url>
<url><loc>https://scifaro.com/en/abs/cactus-graphs-and-some-algorithms-1408.4005</loc><lastmod>2014-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cactus-graphs-and-some-algorithms-1408.4005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cactus-graphs-and-some-algorithms-1408.4005"/></url>
<url><loc>https://scifaro.com/en/abs/mahonian-stat-on-words-1408.4290</loc><lastmod>2014-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mahonian-stat-on-words-1408.4290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mahonian-stat-on-words-1408.4290"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-of-optimal-and-near-optimal-target-sets-in-consensus-models-1408.4364</loc><lastmod>2014-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-of-optimal-and-near-optimal-target-sets-in-consensus-models-1408.4364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-of-optimal-and-near-optimal-target-sets-in-consensus-models-1408.4364"/></url>
<url><loc>https://scifaro.com/en/abs/directed-width-measures-and-monotonicity-of-directed-graph-searching-1408.4745</loc><lastmod>2014-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-width-measures-and-monotonicity-of-directed-graph-searching-1408.4745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-width-measures-and-monotonicity-of-directed-graph-searching-1408.4745"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-bounds-on-the-equilateral-dimension-of-hypercubes-1408.5027</loc><lastmod>2016-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-bounds-on-the-equilateral-dimension-of-hypercubes-1408.5027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-bounds-on-the-equilateral-dimension-of-hypercubes-1408.5027"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-game-invariance-1408.5274</loc><lastmod>2014-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-game-invariance-1408.5274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-game-invariance-1408.5274"/></url>
<url><loc>https://scifaro.com/en/abs/almost-every-graph-is-divergent-under-the-biclique-operator-1408.6063</loc><lastmod>2015-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-every-graph-is-divergent-under-the-biclique-operator-1408.6063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-every-graph-is-divergent-under-the-biclique-operator-1408.6063"/></url>
<url><loc>https://scifaro.com/en/abs/weak-unit-disk-and-interval-representation-of-planar-graphs-1408.6928</loc><lastmod>2014-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-unit-disk-and-interval-representation-of-planar-graphs-1408.6928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-unit-disk-and-interval-representation-of-planar-graphs-1408.6928"/></url>
<url><loc>https://scifaro.com/en/abs/on-k-gons-and-k-holes-in-point-sets-1409.0081</loc><lastmod>2014-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-k-gons-and-k-holes-in-point-sets-1409.0081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-k-gons-and-k-holes-in-point-sets-1409.0081"/></url>
<url><loc>https://scifaro.com/en/abs/a-coloring-algorithm-for-disambiguating-graph-and-map-drawings-1409.0436</loc><lastmod>2014-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coloring-algorithm-for-disambiguating-graph-and-map-drawings-1409.0436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coloring-algorithm-for-disambiguating-graph-and-map-drawings-1409.0436"/></url>
<url><loc>https://scifaro.com/en/abs/equitable-coloring-of-corona-products-of-cubic-graphs-is-harder-than-ordinary-coloring-1409.0650</loc><lastmod>2014-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equitable-coloring-of-corona-products-of-cubic-graphs-is-harder-than-ordinary-coloring-1409.0650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equitable-coloring-of-corona-products-of-cubic-graphs-is-harder-than-ordinary-coloring-1409.0650"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-algorithms-for-minimum-weighted-colorings-of-p-5-bar-p-5-free-graphs-and-related-graph-classes-1409.0893</loc><lastmod>2014-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-minimum-weighted-colorings-of-p-5-bar-p-5-free-graphs-and-related-graph-classes-1409.0893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-minimum-weighted-colorings-of-p-5-bar-p-5-free-graphs-and-related-graph-classes-1409.0893"/></url>
<url><loc>https://scifaro.com/en/abs/path-relinking-for-bandwidth-coloring-problem-1409.0973</loc><lastmod>2014-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/path-relinking-for-bandwidth-coloring-problem-1409.0973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/path-relinking-for-bandwidth-coloring-problem-1409.0973"/></url>
<url><loc>https://scifaro.com/en/abs/large-induced-forests-in-planar-graphs-with-girth-4-or-5-1409.1348</loc><lastmod>2014-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-induced-forests-in-planar-graphs-with-girth-4-or-5-1409.1348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-induced-forests-in-planar-graphs-with-girth-4-or-5-1409.1348"/></url>
<url><loc>https://scifaro.com/en/abs/well-dominated-graphs-without-cycles-of-lengths-4-and-5-1409.1466</loc><lastmod>2014-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-dominated-graphs-without-cycles-of-lengths-4-and-5-1409.1466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-dominated-graphs-without-cycles-of-lengths-4-and-5-1409.1466"/></url>
<url><loc>https://scifaro.com/en/abs/a-manually-checkable-proof-for-the-np-hardness-of-11-color-pattern-self-assembly-tile-set-synthesis-1409.1619</loc><lastmod>2014-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-manually-checkable-proof-for-the-np-hardness-of-11-color-pattern-self-assembly-tile-set-synthesis-1409.1619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-manually-checkable-proof-for-the-np-hardness-of-11-color-pattern-self-assembly-tile-set-synthesis-1409.1619"/></url>
<url><loc>https://scifaro.com/en/abs/new-polynomial-case-for-efficient-domination-in-p-6-free-graphs-1409.1676</loc><lastmod>2014-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-polynomial-case-for-efficient-domination-in-p-6-free-graphs-1409.1676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-polynomial-case-for-efficient-domination-in-p-6-free-graphs-1409.1676"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-to-find-wiener-index-of-some-graphs-1409.1987</loc><lastmod>2014-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-to-find-wiener-index-of-some-graphs-1409.1987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-to-find-wiener-index-of-some-graphs-1409.1987"/></url>
<url><loc>https://scifaro.com/en/abs/on-vertex-attack-tolerance-in-regular-graphs-1409.2172</loc><lastmod>2014-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-vertex-attack-tolerance-in-regular-graphs-1409.2172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-vertex-attack-tolerance-in-regular-graphs-1409.2172"/></url>
<url><loc>https://scifaro.com/en/abs/scattered-packings-of-cycles-1409.2733</loc><lastmod>2016-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scattered-packings-of-cycles-1409.2733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scattered-packings-of-cycles-1409.2733"/></url>
<url><loc>https://scifaro.com/en/abs/colorful-linear-programming-nash-equilibrium-and-pivots-1409.3436</loc><lastmod>2016-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colorful-linear-programming-nash-equilibrium-and-pivots-1409.3436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colorful-linear-programming-nash-equilibrium-and-pivots-1409.3436"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-termination-of-linear-and-affine-programs-over-the-integers-1409.4230</loc><lastmod>2014-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-termination-of-linear-and-affine-programs-over-the-integers-1409.4230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-termination-of-linear-and-affine-programs-over-the-integers-1409.4230"/></url>
<url><loc>https://scifaro.com/en/abs/automated-discharging-arguments-for-density-problems-in-grids-1409.5922</loc><lastmod>2014-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-discharging-arguments-for-density-problems-in-grids-1409.5922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-discharging-arguments-for-density-problems-in-grids-1409.5922"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-strengths-of-connectivity-and-robustness-in-general-random-intersection-graphs-1409.5995</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-strengths-of-connectivity-and-robustness-in-general-random-intersection-graphs-1409.5995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-strengths-of-connectivity-and-robustness-in-general-random-intersection-graphs-1409.5995"/></url>
<url><loc>https://scifaro.com/en/abs/completely-independent-spanning-trees-in-some-regular-graphs-1409.6002</loc><lastmod>2014-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completely-independent-spanning-trees-in-some-regular-graphs-1409.6002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completely-independent-spanning-trees-in-some-regular-graphs-1409.6002"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-points-of-boolean-networks-guessing-graphs-and-coding-theory-1409.6144</loc><lastmod>2014-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-points-of-boolean-networks-guessing-graphs-and-coding-theory-1409.6144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-points-of-boolean-networks-guessing-graphs-and-coding-theory-1409.6144"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-k-differential-coloring-problem-1409.8133</loc><lastmod>2014-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-k-differential-coloring-problem-1409.8133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-k-differential-coloring-problem-1409.8133"/></url>
<url><loc>https://scifaro.com/en/abs/on-searching-zimin-patterns-1409.8235</loc><lastmod>2015-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-searching-zimin-patterns-1409.8235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-searching-zimin-patterns-1409.8235"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-algorithms-for-weighted-efficient-domination-problems-in-at-free-graphs-and-dually-chordal-graphs-1410.0770</loc><lastmod>2014-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-weighted-efficient-domination-problems-in-at-free-graphs-and-dually-chordal-graphs-1410.0770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-weighted-efficient-domination-problems-in-at-free-graphs-and-dually-chordal-graphs-1410.0770"/></url>
<url><loc>https://scifaro.com/en/abs/extended-formulation-lower-bounds-via-hypergraph-coloring-1410.1150</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-formulation-lower-bounds-via-hypergraph-coloring-1410.1150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-formulation-lower-bounds-via-hypergraph-coloring-1410.1150"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-in-the-heptagrid-with-three-states-1410.1864</loc><lastmod>2014-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-in-the-heptagrid-with-three-states-1410.1864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-in-the-heptagrid-with-three-states-1410.1864"/></url>
<url><loc>https://scifaro.com/en/abs/unit-length-embedding-of-cycles-and-paths-on-grid-graphs-1410.2388</loc><lastmod>2014-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unit-length-embedding-of-cycles-and-paths-on-grid-graphs-1410.2388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unit-length-embedding-of-cycles-and-paths-on-grid-graphs-1410.2388"/></url>
<url><loc>https://scifaro.com/en/abs/1-j-set-problem-in-graphs-1410.3091</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-j-set-problem-in-graphs-1410.3091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-j-set-problem-in-graphs-1410.3091"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-length-and-clustering-1410.3173</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-length-and-clustering-1410.3173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-length-and-clustering-1410.3173"/></url>
<url><loc>https://scifaro.com/en/abs/the-clique-problem-on-inductive-k-independent-graphs-1410.3302</loc><lastmod>2017-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-clique-problem-on-inductive-k-independent-graphs-1410.3302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-clique-problem-on-inductive-k-independent-graphs-1410.3302"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-upper-bound-for-achlioptas-processes-1410.3876</loc><lastmod>2014-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-upper-bound-for-achlioptas-processes-1410.3876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-upper-bound-for-achlioptas-processes-1410.3876"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-fibonacci-and-lucas-cubes-arising-from-powers-of-paths-and-cycles-1410.4080</loc><lastmod>2015-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-fibonacci-and-lucas-cubes-arising-from-powers-of-paths-and-cycles-1410.4080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-fibonacci-and-lucas-cubes-arising-from-powers-of-paths-and-cycles-1410.4080"/></url>
<url><loc>https://scifaro.com/en/abs/sturmian-words-and-the-stern-sequence-1410.4085</loc><lastmod>2014-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sturmian-words-and-the-stern-sequence-1410.4085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sturmian-words-and-the-stern-sequence-1410.4085"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-linear-arrangement-of-series-parallel-graphs-1410.4395</loc><lastmod>2014-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-linear-arrangement-of-series-parallel-graphs-1410.4395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-linear-arrangement-of-series-parallel-graphs-1410.4395"/></url>
<url><loc>https://scifaro.com/en/abs/discovering-the-structure-of-complex-networks-by-minimizing-cyclic-bandwidth-sum-1410.6108</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discovering-the-structure-of-complex-networks-by-minimizing-cyclic-bandwidth-sum-1410.6108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discovering-the-structure-of-complex-networks-by-minimizing-cyclic-bandwidth-sum-1410.6108"/></url>
<url><loc>https://scifaro.com/en/abs/justifying-the-small-world-phenomenon-via-random-recursive-trees-1410.6397</loc><lastmod>2014-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/justifying-the-small-world-phenomenon-via-random-recursive-trees-1410.6397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/justifying-the-small-world-phenomenon-via-random-recursive-trees-1410.6397"/></url>
<url><loc>https://scifaro.com/en/abs/detection-of-core-periphery-structure-in-networks-using-spectral-methods-and-geodesic-paths-1410.6572</loc><lastmod>2016-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detection-of-core-periphery-structure-in-networks-using-spectral-methods-and-geodesic-paths-1410.6572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detection-of-core-periphery-structure-in-networks-using-spectral-methods-and-geodesic-paths-1410.6572"/></url>
<url><loc>https://scifaro.com/en/abs/editing-to-eulerian-graphs-1410.6863</loc><lastmod>2014-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/editing-to-eulerian-graphs-1410.6863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/editing-to-eulerian-graphs-1410.6863"/></url>
<url><loc>https://scifaro.com/en/abs/random-almost-popular-matchings-1410.6890</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-almost-popular-matchings-1410.6890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-almost-popular-matchings-1410.6890"/></url>
<url><loc>https://scifaro.com/en/abs/lost-in-self-stabilization-1410.7669</loc><lastmod>2014-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lost-in-self-stabilization-1410.7669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lost-in-self-stabilization-1410.7669"/></url>
<url><loc>https://scifaro.com/en/abs/tree-simplification-and-the-plateaux-phenomenon-of-graph-laplacian-eigenvalues-1410.7842</loc><lastmod>2014-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-simplification-and-the-plateaux-phenomenon-of-graph-laplacian-eigenvalues-1410.7842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-simplification-and-the-plateaux-phenomenon-of-graph-laplacian-eigenvalues-1410.7842"/></url>
<url><loc>https://scifaro.com/en/abs/a-description-of-the-subgraph-induced-at-a-labeling-of-a-graph-by-the-subset-of-vertices-with-an-interval-spectrum-1410.7927</loc><lastmod>2014-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-description-of-the-subgraph-induced-at-a-labeling-of-a-graph-by-the-subset-of-vertices-with-an-interval-spectrum-1410.7927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-description-of-the-subgraph-induced-at-a-labeling-of-a-graph-by-the-subset-of-vertices-with-an-interval-spectrum-1410.7927"/></url>
<url><loc>https://scifaro.com/en/abs/on-finding-orientations-with-fewest-number-of-vartices-with-small-out-degree-1410.8154</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finding-orientations-with-fewest-number-of-vartices-with-small-out-degree-1410.8154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finding-orientations-with-fewest-number-of-vartices-with-small-out-degree-1410.8154"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-inequalities-of-projected-volumes-and-the-constructible-region-1410.8663</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-inequalities-of-projected-volumes-and-the-constructible-region-1410.8663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-inequalities-of-projected-volumes-and-the-constructible-region-1410.8663"/></url>
<url><loc>https://scifaro.com/en/abs/labeled-embedding-of-n-n-2-graphs-in-their-complements-1410.8694</loc><lastmod>2014-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/labeled-embedding-of-n-n-2-graphs-in-their-complements-1410.8694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/labeled-embedding-of-n-n-2-graphs-in-their-complements-1410.8694"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorics-and-algorithms-for-augmenting-graphs-1410.8774</loc><lastmod>2014-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorics-and-algorithms-for-augmenting-graphs-1410.8774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorics-and-algorithms-for-augmenting-graphs-1410.8774"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-signed-k-submatching-in-graphs-1411.0132</loc><lastmod>2014-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-signed-k-submatching-in-graphs-1411.0132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-signed-k-submatching-in-graphs-1411.0132"/></url>
<url><loc>https://scifaro.com/en/abs/planting-colourings-silently-1411.0610</loc><lastmod>2017-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planting-colourings-silently-1411.0610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planting-colourings-silently-1411.0610"/></url>
<url><loc>https://scifaro.com/en/abs/a-spectral-assignment-approach-for-the-graph-isomorphism-problem-1411.0969</loc><lastmod>2019-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spectral-assignment-approach-for-the-graph-isomorphism-problem-1411.0969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spectral-assignment-approach-for-the-graph-isomorphism-problem-1411.0969"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-optimality-with-bounded-regret-in-dynamic-matching-models-1411.1044</loc><lastmod>2016-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-optimality-with-bounded-regret-in-dynamic-matching-models-1411.1044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-optimality-with-bounded-regret-in-dynamic-matching-models-1411.1044"/></url>
<url><loc>https://scifaro.com/en/abs/a-filtering-technique-for-markov-chains-with-applications-to-spectral-embedding-1411.1638</loc><lastmod>2014-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-filtering-technique-for-markov-chains-with-applications-to-spectral-embedding-1411.1638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-filtering-technique-for-markov-chains-with-applications-to-spectral-embedding-1411.1638"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-isomorphism-dichotomy-for-hereditary-graph-classes-1411.1977</loc><lastmod>2014-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-isomorphism-dichotomy-for-hereditary-graph-classes-1411.1977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-isomorphism-dichotomy-for-hereditary-graph-classes-1411.1977"/></url>
<url><loc>https://scifaro.com/en/abs/lov-asz-schrijver-sdp-operator-near-perfect-graphs-and-near-bipartite-graphs-1411.2069</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lov-asz-schrijver-sdp-operator-near-perfect-graphs-and-near-bipartite-graphs-1411.2069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lov-asz-schrijver-sdp-operator-near-perfect-graphs-and-near-bipartite-graphs-1411.2069"/></url>
<url><loc>https://scifaro.com/en/abs/spiders-can-be-recognized-by-counting-their-legs-1411.2105</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spiders-can-be-recognized-by-counting-their-legs-1411.2105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spiders-can-be-recognized-by-counting-their-legs-1411.2105"/></url>
<url><loc>https://scifaro.com/en/abs/univariate-niho-bent-functions-from-o-polynomials-1411.2394</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/univariate-niho-bent-functions-from-o-polynomials-1411.2394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/univariate-niho-bent-functions-from-o-polynomials-1411.2394"/></url>
<url><loc>https://scifaro.com/en/abs/dag-width-is-pspace-complete-1411.2438</loc><lastmod>2020-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dag-width-is-pspace-complete-1411.2438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dag-width-is-pspace-complete-1411.2438"/></url>
<url><loc>https://scifaro.com/en/abs/homothetic-polygons-and-beyond-intersection-graphs-recognition-and-maximum-clique-1411.2928</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homothetic-polygons-and-beyond-intersection-graphs-recognition-and-maximum-clique-1411.2928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homothetic-polygons-and-beyond-intersection-graphs-recognition-and-maximum-clique-1411.2928"/></url>
<url><loc>https://scifaro.com/en/abs/quantification-of-reachable-attractors-in-asynchronous-discrete-dynamics-1411.3539</loc><lastmod>2014-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantification-of-reachable-attractors-in-asynchronous-discrete-dynamics-1411.3539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantification-of-reachable-attractors-in-asynchronous-discrete-dynamics-1411.3539"/></url>
<url><loc>https://scifaro.com/en/abs/network-installation-and-recovery-approximation-lower-bounds-and-faster-exact-formulations-1411.3640</loc><lastmod>2014-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/network-installation-and-recovery-approximation-lower-bounds-and-faster-exact-formulations-1411.3640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/network-installation-and-recovery-approximation-lower-bounds-and-faster-exact-formulations-1411.3640"/></url>
<url><loc>https://scifaro.com/en/abs/a-discrete-logarithm-based-approach-to-compute-low-weight-multiples-of-binary-polynomials-1411.4024</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-discrete-logarithm-based-approach-to-compute-low-weight-multiples-of-binary-polynomials-1411.4024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-discrete-logarithm-based-approach-to-compute-low-weight-multiples-of-binary-polynomials-1411.4024"/></url>
<url><loc>https://scifaro.com/en/abs/counting-k-4-subdivisions-1411.4819</loc><lastmod>2015-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-k-4-subdivisions-1411.4819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-k-4-subdivisions-1411.4819"/></url>
<url><loc>https://scifaro.com/en/abs/proper-hamiltonian-cycles-in-edge-colored-multigraphs-1411.5240</loc><lastmod>2017-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proper-hamiltonian-cycles-in-edge-colored-multigraphs-1411.5240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proper-hamiltonian-cycles-in-edge-colored-multigraphs-1411.5240"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-repetitions-in-sturmian-words-a-new-proof-1411.5474</loc><lastmod>2015-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-repetitions-in-sturmian-words-a-new-proof-1411.5474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-repetitions-in-sturmian-words-a-new-proof-1411.5474"/></url>
<url><loc>https://scifaro.com/en/abs/interval-edge-colorings-of-complete-graphs-1411.5661</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-edge-colorings-of-complete-graphs-1411.5661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-edge-colorings-of-complete-graphs-1411.5661"/></url>
<url><loc>https://scifaro.com/en/abs/the-directed-grid-theorem-1411.5681</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-directed-grid-theorem-1411.5681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-directed-grid-theorem-1411.5681"/></url>
<url><loc>https://scifaro.com/en/abs/analogous-dynamics-of-boolean-network-1411.6135</loc><lastmod>2014-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analogous-dynamics-of-boolean-network-1411.6135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analogous-dynamics-of-boolean-network-1411.6135"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-digital-n-manifolds-1412.0134</loc><lastmod>2014-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-digital-n-manifolds-1412.0134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-digital-n-manifolds-1412.0134"/></url>
<url><loc>https://scifaro.com/en/abs/simple-pairs-of-points-in-digital-spaces-topology-preserving-transformations-of-digital-spaces-by-contracting-simple-pairs-of-points-1412.0218</loc><lastmod>2014-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-pairs-of-points-in-digital-spaces-topology-preserving-transformations-of-digital-spaces-by-contracting-simple-pairs-of-points-1412.0218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-pairs-of-points-in-digital-spaces-topology-preserving-transformations-of-digital-spaces-by-contracting-simple-pairs-of-points-1412.0218"/></url>
<url><loc>https://scifaro.com/en/abs/stable-marriage-and-roommates-problems-with-restricted-edges-complexity-and-approximability-1412.0271</loc><lastmod>2016-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-marriage-and-roommates-problems-with-restricted-edges-complexity-and-approximability-1412.0271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-marriage-and-roommates-problems-with-restricted-edges-complexity-and-approximability-1412.0271"/></url>
<url><loc>https://scifaro.com/en/abs/matchings-with-lower-quotas-algorithms-and-complexity-1412.0325</loc><lastmod>2016-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matchings-with-lower-quotas-algorithms-and-complexity-1412.0325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matchings-with-lower-quotas-algorithms-and-complexity-1412.0325"/></url>
<url><loc>https://scifaro.com/en/abs/completion-of-the-mixed-unit-interval-graphs-hierarchy-1412.0540</loc><lastmod>2017-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completion-of-the-mixed-unit-interval-graphs-hierarchy-1412.0540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completion-of-the-mixed-unit-interval-graphs-hierarchy-1412.0540"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-vector-connectivity-problem-1412.2559</loc><lastmod>2014-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-vector-connectivity-problem-1412.2559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-vector-connectivity-problem-1412.2559"/></url>
<url><loc>https://scifaro.com/en/abs/strong-edge-coloring-of-3-delta-bipartite-graphs-1412.2624</loc><lastmod>2015-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-edge-coloring-of-3-delta-bipartite-graphs-1412.2624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-edge-coloring-of-3-delta-bipartite-graphs-1412.2624"/></url>
<url><loc>https://scifaro.com/en/abs/a-necessary-and-sufficient-condition-for-a-graph-g-which-satisfies-the-equality-mu-21-g-v-g-1412.3610</loc><lastmod>2014-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-necessary-and-sufficient-condition-for-a-graph-g-which-satisfies-the-equality-mu-21-g-v-g-1412.3610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-necessary-and-sufficient-condition-for-a-graph-g-which-satisfies-the-equality-mu-21-g-v-g-1412.3610"/></url>
<url><loc>https://scifaro.com/en/abs/size-sensitive-packing-number-for-hamming-cube-and-its-consequences-1412.3922</loc><lastmod>2014-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-sensitive-packing-number-for-hamming-cube-and-its-consequences-1412.3922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-sensitive-packing-number-for-hamming-cube-and-its-consequences-1412.3922"/></url>
<url><loc>https://scifaro.com/en/abs/irreversible-2-conversion-set-in-graphs-of-bounded-degree-1412.4188</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irreversible-2-conversion-set-in-graphs-of-bounded-degree-1412.4188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irreversible-2-conversion-set-in-graphs-of-bounded-degree-1412.4188"/></url>
<url><loc>https://scifaro.com/en/abs/an-important-corollary-for-the-fast-solution-of-dynamic-maximal-clique-enumeration-problems-1412.4620</loc><lastmod>2014-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-important-corollary-for-the-fast-solution-of-dynamic-maximal-clique-enumeration-problems-1412.4620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-important-corollary-for-the-fast-solution-of-dynamic-maximal-clique-enumeration-problems-1412.4620"/></url>
<url><loc>https://scifaro.com/en/abs/fewer-runs-than-word-length-1412.4646</loc><lastmod>2015-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fewer-runs-than-word-length-1412.4646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fewer-runs-than-word-length-1412.4646"/></url>
<url><loc>https://scifaro.com/en/abs/densities-in-large-permutations-and-parameter-testing-1412.5622</loc><lastmod>2016-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/densities-in-large-permutations-and-parameter-testing-1412.5622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/densities-in-large-permutations-and-parameter-testing-1412.5622"/></url>
<url><loc>https://scifaro.com/en/abs/dense-testers-almost-linear-time-and-locally-explicit-constructions-1412.5889</loc><lastmod>2014-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dense-testers-almost-linear-time-and-locally-explicit-constructions-1412.5889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dense-testers-almost-linear-time-and-locally-explicit-constructions-1412.5889"/></url>
<url><loc>https://scifaro.com/en/abs/a-nested-family-of-k-total-effective-rewards-for-positional-games-1412.6072</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-nested-family-of-k-total-effective-rewards-for-positional-games-1412.6072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-nested-family-of-k-total-effective-rewards-for-positional-games-1412.6072"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-the-structure-of-bipartite-graphs-for-algebraic-and-spectral-graph-theory-applications-1412.6073</loc><lastmod>2015-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-the-structure-of-bipartite-graphs-for-algebraic-and-spectral-graph-theory-applications-1412.6073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-the-structure-of-bipartite-graphs-for-algebraic-and-spectral-graph-theory-applications-1412.6073"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-cheeger-inequality-1412.6075</loc><lastmod>2014-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-cheeger-inequality-1412.6075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-cheeger-inequality-1412.6075"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-algebraic-connectivity-for-certain-families-of-graphs-1412.6147</loc><lastmod>2014-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-algebraic-connectivity-for-certain-families-of-graphs-1412.6147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-algebraic-connectivity-for-certain-families-of-graphs-1412.6147"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-lower-bounds-on-the-number-of-perfect-pairs-1412.6793</loc><lastmod>2014-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-lower-bounds-on-the-number-of-perfect-pairs-1412.6793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-lower-bounds-on-the-number-of-perfect-pairs-1412.6793"/></url>
<url><loc>https://scifaro.com/en/abs/incidence-coloring-of-graphs-with-high-maximum-average-degree-1412.6803</loc><lastmod>2015-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incidence-coloring-of-graphs-with-high-maximum-average-degree-1412.6803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incidence-coloring-of-graphs-with-high-maximum-average-degree-1412.6803"/></url>
<url><loc>https://scifaro.com/en/abs/the-approximation-ratio-of-the-greedy-algorithm-for-the-metric-traveling-salesman-problem-1412.7366</loc><lastmod>2014-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-approximation-ratio-of-the-greedy-algorithm-for-the-metric-traveling-salesman-problem-1412.7366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-approximation-ratio-of-the-greedy-algorithm-for-the-metric-traveling-salesman-problem-1412.7366"/></url>
<url><loc>https://scifaro.com/en/abs/a-kochen-specker-system-has-at-least-22-vectors-extended-abstract-1412.8544</loc><lastmod>2015-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-kochen-specker-system-has-at-least-22-vectors-extended-abstract-1412.8544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-kochen-specker-system-has-at-least-22-vectors-extended-abstract-1412.8544"/></url>
<url><loc>https://scifaro.com/en/abs/bicoloring-covers-for-graphs-and-hypergraphs-1501.00343</loc><lastmod>2016-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bicoloring-covers-for-graphs-and-hypergraphs-1501.00343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bicoloring-covers-for-graphs-and-hypergraphs-1501.00343"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-perfect-forests-1501.01079</loc><lastmod>2015-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-perfect-forests-1501.01079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-perfect-forests-1501.01079"/></url>
<url><loc>https://scifaro.com/en/abs/two-answers-to-a-common-question-on-diagonalization-1501.01207</loc><lastmod>2015-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-answers-to-a-common-question-on-diagonalization-1501.01207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-answers-to-a-common-question-on-diagonalization-1501.01207"/></url>
<url><loc>https://scifaro.com/en/abs/new-algorithms-for-k-degenerate-graphs-1501.01819</loc><lastmod>2017-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-algorithms-for-k-degenerate-graphs-1501.01819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-algorithms-for-k-degenerate-graphs-1501.01819"/></url>
<url><loc>https://scifaro.com/en/abs/some-new-results-on-binary-relations-1501.01914</loc><lastmod>2015-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-new-results-on-binary-relations-1501.01914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-new-results-on-binary-relations-1501.01914"/></url>
<url><loc>https://scifaro.com/en/abs/topological-properties-on-the-diameters-of-the-integer-simplex-1501.02870</loc><lastmod>2015-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-properties-on-the-diameters-of-the-integer-simplex-1501.02870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-properties-on-the-diameters-of-the-integer-simplex-1501.02870"/></url>
<url><loc>https://scifaro.com/en/abs/on-lipschitz-bijections-between-boolean-functions-1501.03016</loc><lastmod>2015-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lipschitz-bijections-between-boolean-functions-1501.03016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lipschitz-bijections-between-boolean-functions-1501.03016"/></url>
<url><loc>https://scifaro.com/en/abs/on-symbolic-ultrametrics-cotree-representations-and-cograph-edge-decompositions-and-partitions-1501.03931</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-symbolic-ultrametrics-cotree-representations-and-cograph-edge-decompositions-and-partitions-1501.03931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-symbolic-ultrametrics-cotree-representations-and-cograph-edge-decompositions-and-partitions-1501.03931"/></url>
<url><loc>https://scifaro.com/en/abs/pspace-completeness-of-majority-automata-networks-1501.03992</loc><lastmod>2015-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pspace-completeness-of-majority-automata-networks-1501.03992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pspace-completeness-of-majority-automata-networks-1501.03992"/></url>
<url><loc>https://scifaro.com/en/abs/chromatic-and-flow-polynomials-of-generalized-vertex-join-graphs-and-outerplanar-graphs-1501.04388</loc><lastmod>2015-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chromatic-and-flow-polynomials-of-generalized-vertex-join-graphs-and-outerplanar-graphs-1501.04388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chromatic-and-flow-polynomials-of-generalized-vertex-join-graphs-and-outerplanar-graphs-1501.04388"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebra-to-merge-heterogeneous-classifiers-1501.05141</loc><lastmod>2015-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebra-to-merge-heterogeneous-classifiers-1501.05141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebra-to-merge-heterogeneous-classifiers-1501.05141"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-structure-of-schnyder-woods-on-orientable-surfaces-1501.05475</loc><lastmod>2016-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-structure-of-schnyder-woods-on-orientable-surfaces-1501.05475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-structure-of-schnyder-woods-on-orientable-surfaces-1501.05475"/></url>
<url><loc>https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-ii-1501.05752</loc><lastmod>2015-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-ii-1501.05752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-ii-1501.05752"/></url>
<url><loc>https://scifaro.com/en/abs/an-cal-o-m-log-n-algorithm-for-the-weighted-stable-set-problem-in-claw-free-graphs-with-alpha-g-le-3-1501.05773</loc><lastmod>2015-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-cal-o-m-log-n-algorithm-for-the-weighted-stable-set-problem-in-claw-free-graphs-with-alpha-g-le-3-1501.05773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-cal-o-m-log-n-algorithm-for-the-weighted-stable-set-problem-in-claw-free-graphs-with-alpha-g-le-3-1501.05773"/></url>
<url><loc>https://scifaro.com/en/abs/an-cal-o-n-2-log-n-algorithm-for-the-weighted-stable-set-problem-in-claw-free-graphs-1501.05775</loc><lastmod>2019-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-cal-o-n-2-log-n-algorithm-for-the-weighted-stable-set-problem-in-claw-free-graphs-1501.05775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-cal-o-n-2-log-n-algorithm-for-the-weighted-stable-set-problem-in-claw-free-graphs-1501.05775"/></url>
<url><loc>https://scifaro.com/en/abs/an-cal-o-n-sqrt-m-algorithm-for-the-weighted-stable-set-problem-in-claw-net-free-graphs-with-alpha-g-ge-4-1501.05851</loc><lastmod>2015-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-cal-o-n-sqrt-m-algorithm-for-the-weighted-stable-set-problem-in-claw-net-free-graphs-with-alpha-g-ge-4-1501.05851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-cal-o-n-sqrt-m-algorithm-for-the-weighted-stable-set-problem-in-claw-net-free-graphs-with-alpha-g-ge-4-1501.05851"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-common-subelement-metrics-and-its-applications-to-graphs-1501.06774</loc><lastmod>2015-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-common-subelement-metrics-and-its-applications-to-graphs-1501.06774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-common-subelement-metrics-and-its-applications-to-graphs-1501.06774"/></url>
<url><loc>https://scifaro.com/en/abs/new-bounds-on-optimal-sorting-networks-1501.06946</loc><lastmod>2015-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-bounds-on-optimal-sorting-networks-1501.06946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-bounds-on-optimal-sorting-networks-1501.06946"/></url>
<url><loc>https://scifaro.com/en/abs/finding-connected-dense-k-subgraphs-1501.07348</loc><lastmod>2015-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-connected-dense-k-subgraphs-1501.07348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-connected-dense-k-subgraphs-1501.07348"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-and-perfect-domination-on-circular-arc-graphs-1502.01523</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-and-perfect-domination-on-circular-arc-graphs-1502.01523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-and-perfect-domination-on-circular-arc-graphs-1502.01523"/></url>
<url><loc>https://scifaro.com/en/abs/derandomized-construction-of-combinatorial-batch-codes-1502.02472</loc><lastmod>2015-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derandomized-construction-of-combinatorial-batch-codes-1502.02472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derandomized-construction-of-combinatorial-batch-codes-1502.02472"/></url>
<url><loc>https://scifaro.com/en/abs/subgraph-polytopes-and-independence-polytopes-of-count-matroids-1502.02817</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subgraph-polytopes-and-independence-polytopes-of-count-matroids-1502.02817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subgraph-polytopes-and-independence-polytopes-of-count-matroids-1502.02817"/></url>
<url><loc>https://scifaro.com/en/abs/dag-width-and-circumference-of-digraphs-1502.03241</loc><lastmod>2015-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dag-width-and-circumference-of-digraphs-1502.03241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dag-width-and-circumference-of-digraphs-1502.03241"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-cover-free-families-1502.03578</loc><lastmod>2015-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-cover-free-families-1502.03578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-cover-free-families-1502.03578"/></url>
<url><loc>https://scifaro.com/en/abs/reassembling-trees-for-the-traveling-salesman-1502.03715</loc><lastmod>2016-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reassembling-trees-for-the-traveling-salesman-1502.03715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reassembling-trees-for-the-traveling-salesman-1502.03715"/></url>
<url><loc>https://scifaro.com/en/abs/building-nim-1502.04068</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-nim-1502.04068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-nim-1502.04068"/></url>
<url><loc>https://scifaro.com/en/abs/sequences-of-formation-width-4-and-alternation-length-5-1502.04095</loc><lastmod>2015-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequences-of-formation-width-4-and-alternation-length-5-1502.04095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequences-of-formation-width-4-and-alternation-length-5-1502.04095"/></url>
<url><loc>https://scifaro.com/en/abs/scheduling-of-unit-length-jobs-with-cubic-incompatibility-graphs-on-three-uniform-machines-1502.04240</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scheduling-of-unit-length-jobs-with-cubic-incompatibility-graphs-on-three-uniform-machines-1502.04240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scheduling-of-unit-length-jobs-with-cubic-incompatibility-graphs-on-three-uniform-machines-1502.04240"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-causal-graph-dynamics-1502.04368</loc><lastmod>2017-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-causal-graph-dynamics-1502.04368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-causal-graph-dynamics-1502.04368"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-network-optimization-subject-to-connectivity-constraints-1502.04382</loc><lastmod>2018-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-network-optimization-subject-to-connectivity-constraints-1502.04382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-network-optimization-subject-to-connectivity-constraints-1502.04382"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-optimal-design-of-temporally-connected-graphs-1502.04579</loc><lastmod>2016-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-optimal-design-of-temporally-connected-graphs-1502.04579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-optimal-design-of-temporally-connected-graphs-1502.04579"/></url>
<url><loc>https://scifaro.com/en/abs/structural-properties-of-an-open-problem-in-preemptive-scheduling-1502.04600</loc><lastmod>2021-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-properties-of-an-open-problem-in-preemptive-scheduling-1502.04600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-properties-of-an-open-problem-in-preemptive-scheduling-1502.04600"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-non-adaptive-solutions-for-the-counterfeit-coin-problem-1502.04896</loc><lastmod>2015-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-non-adaptive-solutions-for-the-counterfeit-coin-problem-1502.04896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-non-adaptive-solutions-for-the-counterfeit-coin-problem-1502.04896"/></url>
<url><loc>https://scifaro.com/en/abs/cross-bifix-free-sets-in-two-dimensions-1502.05275</loc><lastmod>2015-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cross-bifix-free-sets-in-two-dimensions-1502.05275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cross-bifix-free-sets-in-two-dimensions-1502.05275"/></url>
<url><loc>https://scifaro.com/en/abs/rotor-routing-orbits-in-directed-graphs-and-the-picard-group-1502.05811</loc><lastmod>2015-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rotor-routing-orbits-in-directed-graphs-and-the-picard-group-1502.05811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rotor-routing-orbits-in-directed-graphs-and-the-picard-group-1502.05811"/></url>
<url><loc>https://scifaro.com/en/abs/sorting-networks-the-final-countdown-1502.05983</loc><lastmod>2015-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sorting-networks-the-final-countdown-1502.05983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sorting-networks-the-final-countdown-1502.05983"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-representation-of-the-search-region-in-multi-objective-optimization-1502.06111</loc><lastmod>2015-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-representation-of-the-search-region-in-multi-objective-optimization-1502.06111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-representation-of-the-search-region-in-multi-objective-optimization-1502.06111"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistency-indicator-maps-on-groups-for-pairwise-comparisons-1502.06160</loc><lastmod>2017-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistency-indicator-maps-on-groups-for-pairwise-comparisons-1502.06160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistency-indicator-maps-on-groups-for-pairwise-comparisons-1502.06160"/></url>
<url><loc>https://scifaro.com/en/abs/swendsen-wang-algorithm-on-the-mean-field-potts-model-1502.06593</loc><lastmod>2017-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/swendsen-wang-algorithm-on-the-mean-field-potts-model-1502.06593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/swendsen-wang-algorithm-on-the-mean-field-potts-model-1502.06593"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-clique-width-of-h-free-chordal-graphs-1502.06948</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-clique-width-of-h-free-chordal-graphs-1502.06948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-clique-width-of-h-free-chordal-graphs-1502.06948"/></url>
<url><loc>https://scifaro.com/en/abs/rainbow-domination-and-related-problems-on-some-classes-of-perfect-graphs-1502.07492</loc><lastmod>2015-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rainbow-domination-and-related-problems-on-some-classes-of-perfect-graphs-1502.07492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rainbow-domination-and-related-problems-on-some-classes-of-perfect-graphs-1502.07492"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-disjunctive-domination-in-graphs-1502.07718</loc><lastmod>2015-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-disjunctive-domination-in-graphs-1502.07718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-disjunctive-domination-in-graphs-1502.07718"/></url>
<url><loc>https://scifaro.com/en/abs/product-measure-approximation-of-symmetric-graph-properties-1502.07787</loc><lastmod>2015-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/product-measure-approximation-of-symmetric-graph-properties-1502.07787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/product-measure-approximation-of-symmetric-graph-properties-1502.07787"/></url>
<url><loc>https://scifaro.com/en/abs/infinigons-of-the-hyperbolic-plane-and-grossone-1502.07990</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinigons-of-the-hyperbolic-plane-and-grossone-1502.07990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinigons-of-the-hyperbolic-plane-and-grossone-1502.07990"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-domination-for-some-subclasses-of-p-6-free-graphs-in-polynomial-time-1503.00091</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-domination-for-some-subclasses-of-p-6-free-graphs-in-polynomial-time-1503.00091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-domination-for-some-subclasses-of-p-6-free-graphs-in-polynomial-time-1503.00091"/></url>
<url><loc>https://scifaro.com/en/abs/contagious-sets-in-dense-graphs-1503.00158</loc><lastmod>2015-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contagious-sets-in-dense-graphs-1503.00158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contagious-sets-in-dense-graphs-1503.00158"/></url>
<url><loc>https://scifaro.com/en/abs/computing-with-tangles-1503.00190</loc><lastmod>2016-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-with-tangles-1503.00190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-with-tangles-1503.00190"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-temporal-graphs-an-algorithmic-perspective-1503.00278</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-temporal-graphs-an-algorithmic-perspective-1503.00278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-temporal-graphs-an-algorithmic-perspective-1503.00278"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-aspects-of-the-triangle-path-convexity-1503.00458</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-aspects-of-the-triangle-path-convexity-1503.00458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-aspects-of-the-triangle-path-convexity-1503.00458"/></url>
<url><loc>https://scifaro.com/en/abs/well-quasi-ordering-does-not-imply-bounded-clique-width-1503.00571</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-quasi-ordering-does-not-imply-bounded-clique-width-1503.00571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-quasi-ordering-does-not-imply-bounded-clique-width-1503.00571"/></url>
<url><loc>https://scifaro.com/en/abs/dag-width-of-control-flow-graphs-with-applications-to-model-checking-1503.00793</loc><lastmod>2015-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dag-width-of-control-flow-graphs-with-applications-to-model-checking-1503.00793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dag-width-of-control-flow-graphs-with-applications-to-model-checking-1503.00793"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-dominating-set-reconfiguration-1503.00833</loc><lastmod>2015-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-dominating-set-reconfiguration-1503.00833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-dominating-set-reconfiguration-1503.00833"/></url>
<url><loc>https://scifaro.com/en/abs/tropical-dominating-sets-in-vertex-coloured-graphs-1503.01008</loc><lastmod>2016-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tropical-dominating-sets-in-vertex-coloured-graphs-1503.01008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tropical-dominating-sets-in-vertex-coloured-graphs-1503.01008"/></url>
<url><loc>https://scifaro.com/en/abs/bvns-para-el-problema-del-bosque-generador-k-etiquetado-1503.01376</loc><lastmod>2015-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bvns-para-el-problema-del-bosque-generador-k-etiquetado-1503.01376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bvns-para-el-problema-del-bosque-generador-k-etiquetado-1503.01376"/></url>
<url><loc>https://scifaro.com/en/abs/the-coloring-problem-for-p-5-bar-p-5-free-graphs-and-p-5-k-p-e-free-graphs-is-polynomial-1503.02550</loc><lastmod>2015-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-coloring-problem-for-p-5-bar-p-5-free-graphs-and-p-5-k-p-e-free-graphs-is-polynomial-1503.02550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-coloring-problem-for-p-5-bar-p-5-free-graphs-and-p-5-k-p-e-free-graphs-is-polynomial-1503.02550"/></url>
<url><loc>https://scifaro.com/en/abs/new-algorithms-for-computing-a-single-component-of-the-discrete-fourier-transform-1503.02577</loc><lastmod>2018-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-algorithms-for-computing-a-single-component-of-the-discrete-fourier-transform-1503.02577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-algorithms-for-computing-a-single-component-of-the-discrete-fourier-transform-1503.02577"/></url>
<url><loc>https://scifaro.com/en/abs/on-acyclic-edge-coloring-of-complete-bipartite-graphs-1503.03283</loc><lastmod>2015-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-acyclic-edge-coloring-of-complete-bipartite-graphs-1503.03283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-acyclic-edge-coloring-of-complete-bipartite-graphs-1503.03283"/></url>
<url><loc>https://scifaro.com/en/abs/toward-an-uncertainty-principle-for-weighted-graphs-1503.03291</loc><lastmod>2016-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-an-uncertainty-principle-for-weighted-graphs-1503.03291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-an-uncertainty-principle-for-weighted-graphs-1503.03291"/></url>
<url><loc>https://scifaro.com/en/abs/kempe-equivalence-of-colourings-of-cubic-graphs-1503.03430</loc><lastmod>2015-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kempe-equivalence-of-colourings-of-cubic-graphs-1503.03430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kempe-equivalence-of-colourings-of-cubic-graphs-1503.03430"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-and-properties-for-positive-symmetrizable-matrices-1503.03468</loc><lastmod>2015-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-and-properties-for-positive-symmetrizable-matrices-1503.03468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-and-properties-for-positive-symmetrizable-matrices-1503.03468"/></url>
<url><loc>https://scifaro.com/en/abs/three-coloring-graphs-with-no-induced-seven-vertex-path-ii-using-a-triangle-1503.03573</loc><lastmod>2015-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-coloring-graphs-with-no-induced-seven-vertex-path-ii-using-a-triangle-1503.03573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-coloring-graphs-with-no-induced-seven-vertex-path-ii-using-a-triangle-1503.03573"/></url>
<url><loc>https://scifaro.com/en/abs/the-discrete-cosine-transform-over-prime-finite-fields-1503.03763</loc><lastmod>2020-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-discrete-cosine-transform-over-prime-finite-fields-1503.03763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-discrete-cosine-transform-over-prime-finite-fields-1503.03763"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-and-optimization-of-graph-decompositions-by-lifted-multicuts-1503.03791</loc><lastmod>2017-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-and-optimization-of-graph-decompositions-by-lifted-multicuts-1503.03791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-and-optimization-of-graph-decompositions-by-lifted-multicuts-1503.03791"/></url>
<url><loc>https://scifaro.com/en/abs/radix-2-fast-hartley-transform-revisited-1503.03794</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/radix-2-fast-hartley-transform-revisited-1503.03794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/radix-2-fast-hartley-transform-revisited-1503.03794"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-networks-through-heterogeneous-mobile-guards-1503.04473</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-networks-through-heterogeneous-mobile-guards-1503.04473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-networks-through-heterogeneous-mobile-guards-1503.04473"/></url>
<url><loc>https://scifaro.com/en/abs/simple-dynamics-on-graphs-1503.04688</loc><lastmod>2016-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-dynamics-on-graphs-1503.04688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-dynamics-on-graphs-1503.04688"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-degree-up-to-local-complementation-bounds-parameterized-complexity-and-exact-algorithms-1503.04702</loc><lastmod>2016-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-degree-up-to-local-complementation-bounds-parameterized-complexity-and-exact-algorithms-1503.04702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-degree-up-to-local-complementation-bounds-parameterized-complexity-and-exact-algorithms-1503.04702"/></url>
<url><loc>https://scifaro.com/en/abs/there-are-no-finite-partial-cubes-of-girth-more-than-6-and-minimum-degree-at-least-3-1503.04706</loc><lastmod>2016-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/there-are-no-finite-partial-cubes-of-girth-more-than-6-and-minimum-degree-at-least-3-1503.04706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/there-are-no-finite-partial-cubes-of-girth-more-than-6-and-minimum-degree-at-least-3-1503.04706"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-efficient-domination-in-classes-of-p-6-free-graphs-1503.06025</loc><lastmod>2015-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-efficient-domination-in-classes-of-p-6-free-graphs-1503.06025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-efficient-domination-in-classes-of-p-6-free-graphs-1503.06025"/></url>
<url><loc>https://scifaro.com/en/abs/tree-spanners-of-small-diameter-1503.06063</loc><lastmod>2015-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-spanners-of-small-diameter-1503.06063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-spanners-of-small-diameter-1503.06063"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-formul-ae-in-neutral-sets-1503.06081</loc><lastmod>2015-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-formul-ae-in-neutral-sets-1503.06081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-formul-ae-in-neutral-sets-1503.06081"/></url>
<url><loc>https://scifaro.com/en/abs/exact-sampling-of-graphs-with-prescribed-degree-correlations-1503.06725</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-sampling-of-graphs-with-prescribed-degree-correlations-1503.06725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-sampling-of-graphs-with-prescribed-degree-correlations-1503.06725"/></url>
<url><loc>https://scifaro.com/en/abs/tree-spanners-of-bounded-degree-graphs-1503.06822</loc><lastmod>2018-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-spanners-of-bounded-degree-graphs-1503.06822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-spanners-of-bounded-degree-graphs-1503.06822"/></url>
<url><loc>https://scifaro.com/en/abs/graph-isomorphism-completeness-for-trapezoid-graphs-1503.06929</loc><lastmod>2016-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-isomorphism-completeness-for-trapezoid-graphs-1503.06929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-isomorphism-completeness-for-trapezoid-graphs-1503.06929"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-graphs-with-no-even-hole-geq-6-the-triangle-free-case-1503.08057</loc><lastmod>2017-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-graphs-with-no-even-hole-geq-6-the-triangle-free-case-1503.08057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-graphs-with-no-even-hole-geq-6-the-triangle-free-case-1503.08057"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-joint-entropy-of-d-wise-independent-variables-1503.08154</loc><lastmod>2022-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-joint-entropy-of-d-wise-independent-variables-1503.08154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-joint-entropy-of-d-wise-independent-variables-1503.08154"/></url>
<url><loc>https://scifaro.com/en/abs/counting-independent-sets-via-divide-measure-and-conquer-method-1503.08323</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-independent-sets-via-divide-measure-and-conquer-method-1503.08323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-independent-sets-via-divide-measure-and-conquer-method-1503.08323"/></url>
<url><loc>https://scifaro.com/en/abs/exact-bounds-of-the-m-o-bius-inverse-of-monotone-set-functions-1503.08550</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-bounds-of-the-m-o-bius-inverse-of-monotone-set-functions-1503.08550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-bounds-of-the-m-o-bius-inverse-of-monotone-set-functions-1503.08550"/></url>
<url><loc>https://scifaro.com/en/abs/random-sampling-in-computational-algebra-helly-numbers-and-violator-spaces-1503.08804</loc><lastmod>2015-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-sampling-in-computational-algebra-helly-numbers-and-violator-spaces-1503.08804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-sampling-in-computational-algebra-helly-numbers-and-violator-spaces-1503.08804"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-version-of-the-game-of-zombies-and-survivors-on-graphs-1503.08810</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-version-of-the-game-of-zombies-and-survivors-on-graphs-1503.08810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-version-of-the-game-of-zombies-and-survivors-on-graphs-1503.08810"/></url>
<url><loc>https://scifaro.com/en/abs/ricci-ollivier-curvature-of-the-rooted-phylogenetic-subtree-prune-regraft-graph-1504.00304</loc><lastmod>2015-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ricci-ollivier-curvature-of-the-rooted-phylogenetic-subtree-prune-regraft-graph-1504.00304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ricci-ollivier-curvature-of-the-rooted-phylogenetic-subtree-prune-regraft-graph-1504.00304"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-tournaments-with-forbidden-substructures-1504.01119</loc><lastmod>2015-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-tournaments-with-forbidden-substructures-1504.01119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-tournaments-with-forbidden-substructures-1504.01119"/></url>
<url><loc>https://scifaro.com/en/abs/ptas-for-map-assignment-on-pairwise-markov-random-fields-in-planar-graphs-1504.01311</loc><lastmod>2015-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ptas-for-map-assignment-on-pairwise-markov-random-fields-in-planar-graphs-1504.01311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ptas-for-map-assignment-on-pairwise-markov-random-fields-in-planar-graphs-1504.01311"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-on-the-order-of-the-largest-induced-forest-in-planar-graphs-with-high-girth-1504.01949</loc><lastmod>2015-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-on-the-order-of-the-largest-induced-forest-in-planar-graphs-with-high-girth-1504.01949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-on-the-order-of-the-largest-induced-forest-in-planar-graphs-with-high-girth-1504.01949"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-3-neighbour-traveling-salesman-problem-on-halin-graphs-and-extensions-1504.02151</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-3-neighbour-traveling-salesman-problem-on-halin-graphs-and-extensions-1504.02151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-3-neighbour-traveling-salesman-problem-on-halin-graphs-and-extensions-1504.02151"/></url>
<url><loc>https://scifaro.com/en/abs/periodic-power-spectrum-with-applications-in-detection-of-latent-periodicities-in-dna-sequences-1504.02367</loc><lastmod>2016-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/periodic-power-spectrum-with-applications-in-detection-of-latent-periodicities-in-dna-sequences-1504.02367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/periodic-power-spectrum-with-applications-in-detection-of-latent-periodicities-in-dna-sequences-1504.02367"/></url>
<url><loc>https://scifaro.com/en/abs/line-broadcasting-in-complete-k-trees-1504.02491</loc><lastmod>2015-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/line-broadcasting-in-complete-k-trees-1504.02491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/line-broadcasting-in-complete-k-trees-1504.02491"/></url>
<url><loc>https://scifaro.com/en/abs/random-intersection-graphs-and-their-applications-in-security-wireless-communication-and-social-networks-1504.03161</loc><lastmod>2015-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-intersection-graphs-and-their-applications-in-security-wireless-communication-and-social-networks-1504.03161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-intersection-graphs-and-their-applications-in-security-wireless-communication-and-social-networks-1504.03161"/></url>
<url><loc>https://scifaro.com/en/abs/extended-formulations-for-independence-polytopes-of-regular-matroids-1504.03872</loc><lastmod>2019-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-formulations-for-independence-polytopes-of-regular-matroids-1504.03872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-formulations-for-independence-polytopes-of-regular-matroids-1504.03872"/></url>
<url><loc>https://scifaro.com/en/abs/speeding-up-glauber-dynamics-for-random-generation-of-independent-sets-1504.04517</loc><lastmod>2015-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-glauber-dynamics-for-random-generation-of-independent-sets-1504.04517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-glauber-dynamics-for-random-generation-of-independent-sets-1504.04517"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-readability-of-overlap-digraphs-1504.04616</loc><lastmod>2015-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-readability-of-overlap-digraphs-1504.04616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-readability-of-overlap-digraphs-1504.04616"/></url>
<url><loc>https://scifaro.com/en/abs/equitable-total-coloring-of-corona-of-cubic-graphs-1504.04869</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equitable-total-coloring-of-corona-of-cubic-graphs-1504.04869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equitable-total-coloring-of-corona-of-cubic-graphs-1504.04869"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-independent-sets-in-a-subclass-of-p-6-free-graphs-1504.05401</loc><lastmod>2015-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-independent-sets-in-a-subclass-of-p-6-free-graphs-1504.05401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-independent-sets-in-a-subclass-of-p-6-free-graphs-1504.05401"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-approximation-algorithms-for-computing-emph-k-disjoint-restricted-shortest-paths-1504.05519</loc><lastmod>2015-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-approximation-algorithms-for-computing-emph-k-disjoint-restricted-shortest-paths-1504.05519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-approximation-algorithms-for-computing-emph-k-disjoint-restricted-shortest-paths-1504.05519"/></url>
<url><loc>https://scifaro.com/en/abs/semidefinite-programs-on-sparse-random-graphs-and-their-application-to-community-detection-1504.05910</loc><lastmod>2015-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semidefinite-programs-on-sparse-random-graphs-and-their-application-to-community-detection-1504.05910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semidefinite-programs-on-sparse-random-graphs-and-their-application-to-community-detection-1504.05910"/></url>
<url><loc>https://scifaro.com/en/abs/quasiperiodicity-and-non-computability-in-tilings-1504.06130</loc><lastmod>2015-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasiperiodicity-and-non-computability-in-tilings-1504.06130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasiperiodicity-and-non-computability-in-tilings-1504.06130"/></url>
<url><loc>https://scifaro.com/en/abs/on-pairwise-compatibility-of-some-graph-super-classes-1504.06454</loc><lastmod>2015-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-pairwise-compatibility-of-some-graph-super-classes-1504.06454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-pairwise-compatibility-of-some-graph-super-classes-1504.06454"/></url>
<url><loc>https://scifaro.com/en/abs/a-lex-bfs-based-recognition-algorithm-for-robinsonian-matrices-1504.06586</loc><lastmod>2016-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lex-bfs-based-recognition-algorithm-for-robinsonian-matrices-1504.06586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lex-bfs-based-recognition-algorithm-for-robinsonian-matrices-1504.06586"/></url>
<url><loc>https://scifaro.com/en/abs/node-balancing-by-edge-increments-1504.06919</loc><lastmod>2015-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/node-balancing-by-edge-increments-1504.06919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/node-balancing-by-edge-increments-1504.06919"/></url>
<url><loc>https://scifaro.com/en/abs/stratification-and-enumeration-of-boolean-functions-by-canalizing-depth-1504.07591</loc><lastmod>2015-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stratification-and-enumeration-of-boolean-functions-by-canalizing-depth-1504.07591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stratification-and-enumeration-of-boolean-functions-by-canalizing-depth-1504.07591"/></url>
<url><loc>https://scifaro.com/en/abs/hydras-directed-hypergraphs-and-horn-formulas-1504.07753</loc><lastmod>2015-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hydras-directed-hypergraphs-and-horn-formulas-1504.07753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hydras-directed-hypergraphs-and-horn-formulas-1504.07753"/></url>
<url><loc>https://scifaro.com/en/abs/multiaspect-graphs-algebraic-representation-and-algorithms-1504.07893</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiaspect-graphs-algebraic-representation-and-algorithms-1504.07893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiaspect-graphs-algebraic-representation-and-algorithms-1504.07893"/></url>
<url><loc>https://scifaro.com/en/abs/differential-calculus-on-cayley-graphs-1504.08013</loc><lastmod>2015-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-calculus-on-cayley-graphs-1504.08013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-calculus-on-cayley-graphs-1504.08013"/></url>
<url><loc>https://scifaro.com/en/abs/regular-graphs-are-antimagic-1504.08146</loc><lastmod>2019-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-graphs-are-antimagic-1504.08146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-graphs-are-antimagic-1504.08146"/></url>
<url><loc>https://scifaro.com/en/abs/pde-approaches-to-graph-analysis-1505.00185</loc><lastmod>2015-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pde-approaches-to-graph-analysis-1505.00185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pde-approaches-to-graph-analysis-1505.00185"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-the-minimum-sum-coloring-problem-a-review-1505.00449</loc><lastmod>2016-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-the-minimum-sum-coloring-problem-a-review-1505.00449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-the-minimum-sum-coloring-problem-a-review-1505.00449"/></url>
<url><loc>https://scifaro.com/en/abs/specular-sets-1505.00707</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specular-sets-1505.00707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specular-sets-1505.00707"/></url>
<url><loc>https://scifaro.com/en/abs/the-minimal-and-maximal-sensitivity-of-the-simplified-weighted-sum-function-1505.00887</loc><lastmod>2016-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-minimal-and-maximal-sensitivity-of-the-simplified-weighted-sum-function-1505.00887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-minimal-and-maximal-sensitivity-of-the-simplified-weighted-sum-function-1505.00887"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-convergence-of-the-pairwise-comparisons-inconsistency-reduction-process-1505.01325</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-convergence-of-the-pairwise-comparisons-inconsistency-reduction-process-1505.01325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-convergence-of-the-pairwise-comparisons-inconsistency-reduction-process-1505.01325"/></url>
<url><loc>https://scifaro.com/en/abs/an-improvement-on-the-hasse-weil-bound-and-applications-to-character-sums-cryptography-and-coding-1505.01700</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improvement-on-the-hasse-weil-bound-and-applications-to-character-sums-cryptography-and-coding-1505.01700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improvement-on-the-hasse-weil-bound-and-applications-to-character-sums-cryptography-and-coding-1505.01700"/></url>
<url><loc>https://scifaro.com/en/abs/observability-of-lattice-graphs-1505.02224</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/observability-of-lattice-graphs-1505.02224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/observability-of-lattice-graphs-1505.02224"/></url>
<url><loc>https://scifaro.com/en/abs/parameters-for-minimal-unsatisfiability-smarandache-primitive-numbers-and-full-clauses-1505.02318</loc><lastmod>2015-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameters-for-minimal-unsatisfiability-smarandache-primitive-numbers-and-full-clauses-1505.02318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameters-for-minimal-unsatisfiability-smarandache-primitive-numbers-and-full-clauses-1505.02318"/></url>
<url><loc>https://scifaro.com/en/abs/representation-of-traces-by-vectors-of-words-1505.02403</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representation-of-traces-by-vectors-of-words-1505.02403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representation-of-traces-by-vectors-of-words-1505.02403"/></url>
<url><loc>https://scifaro.com/en/abs/dominating-induced-matchings-in-graphs-containing-no-long-claw-1505.02558</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dominating-induced-matchings-in-graphs-containing-no-long-claw-1505.02558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dominating-induced-matchings-in-graphs-containing-no-long-claw-1505.02558"/></url>
<url><loc>https://scifaro.com/en/abs/an-alternative-proof-for-the-constructive-asymmetric-lov-asz-local-lemma-1505.02568</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-alternative-proof-for-the-constructive-asymmetric-lov-asz-local-lemma-1505.02568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-alternative-proof-for-the-constructive-asymmetric-lov-asz-local-lemma-1505.02568"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-heuristic-of-approximating-polynomials-over-finite-fields-by-random-mappings-1505.02983</loc><lastmod>2016-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-heuristic-of-approximating-polynomials-over-finite-fields-by-random-mappings-1505.02983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-heuristic-of-approximating-polynomials-over-finite-fields-by-random-mappings-1505.02983"/></url>
<url><loc>https://scifaro.com/en/abs/the-minimum-bisection-in-the-planted-bisection-model-1505.02985</loc><lastmod>2017-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-minimum-bisection-in-the-planted-bisection-model-1505.02985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-minimum-bisection-in-the-planted-bisection-model-1505.02985"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphism-testing-for-graphs-of-bounded-rank-width-1505.03737</loc><lastmod>2015-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphism-testing-for-graphs-of-bounded-rank-width-1505.03737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphism-testing-for-graphs-of-bounded-rank-width-1505.03737"/></url>
<url><loc>https://scifaro.com/en/abs/triangulating-planar-graphs-while-keeping-the-pathwidth-small-1505.04235</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangulating-planar-graphs-while-keeping-the-pathwidth-small-1505.04235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangulating-planar-graphs-while-keeping-the-pathwidth-small-1505.04235"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-maximum-quartet-distance-between-phylogenetic-trees-1505.04344</loc><lastmod>2016-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-maximum-quartet-distance-between-phylogenetic-trees-1505.04344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-maximum-quartet-distance-between-phylogenetic-trees-1505.04344"/></url>
<url><loc>https://scifaro.com/en/abs/sublinear-approximation-algorithms-for-boxicity-and-related-problems-1505.04918</loc><lastmod>2015-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sublinear-approximation-algorithms-for-boxicity-and-related-problems-1505.04918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sublinear-approximation-algorithms-for-boxicity-and-related-problems-1505.04918"/></url>
<url><loc>https://scifaro.com/en/abs/the-key-properties-of-inconsistency-indicators-for-a-triad-in-pairwise-comparison-matrices-1505.05220</loc><lastmod>2015-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-key-properties-of-inconsistency-indicators-for-a-triad-in-pairwise-comparison-matrices-1505.05220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-key-properties-of-inconsistency-indicators-for-a-triad-in-pairwise-comparison-matrices-1505.05220"/></url>
<url><loc>https://scifaro.com/en/abs/submodular-function-maximization-over-distributive-and-integer-lattices-1505.05423</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submodular-function-maximization-over-distributive-and-integer-lattices-1505.05423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submodular-function-maximization-over-distributive-and-integer-lattices-1505.05423"/></url>
<url><loc>https://scifaro.com/en/abs/computational-lower-limits-on-small-ramsey-numbers-1505.07186</loc><lastmod>2016-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-lower-limits-on-small-ramsey-numbers-1505.07186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-lower-limits-on-small-ramsey-numbers-1505.07186"/></url>
<url><loc>https://scifaro.com/en/abs/differentially-private-response-mechanisms-on-categorical-data-1505.07254</loc><lastmod>2015-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentially-private-response-mechanisms-on-categorical-data-1505.07254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentially-private-response-mechanisms-on-categorical-data-1505.07254"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-reducibility-in-closure-spaces-with-applications-to-logic-and-algebra-1505.07578</loc><lastmod>2017-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-reducibility-in-closure-spaces-with-applications-to-logic-and-algebra-1505.07578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-reducibility-in-closure-spaces-with-applications-to-logic-and-algebra-1505.07578"/></url>
<url><loc>https://scifaro.com/en/abs/path-graphs-clique-trees-and-flowers-1505.07702</loc><lastmod>2015-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/path-graphs-clique-trees-and-flowers-1505.07702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/path-graphs-clique-trees-and-flowers-1505.07702"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-b-chromatic-and-partial-grundy-numbers-by-induced-subgraphs-1505.07780</loc><lastmod>2016-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-b-chromatic-and-partial-grundy-numbers-by-induced-subgraphs-1505.07780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-b-chromatic-and-partial-grundy-numbers-by-induced-subgraphs-1505.07780"/></url>
<url><loc>https://scifaro.com/en/abs/subdivision-into-i-packings-and-s-packing-chromatic-number-of-some-lattices-1505.07781</loc><lastmod>2015-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subdivision-into-i-packings-and-s-packing-chromatic-number-of-some-lattices-1505.07781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subdivision-into-i-packings-and-s-packing-chromatic-number-of-some-lattices-1505.07781"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-cycles-in-linear-convex-supergrid-graphs-1506.00190</loc><lastmod>2015-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-cycles-in-linear-convex-supergrid-graphs-1506.00190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-cycles-in-linear-convex-supergrid-graphs-1506.00190"/></url>
<url><loc>https://scifaro.com/en/abs/a-complexity-dichotomy-for-the-dominating-set-problem-1506.00202</loc><lastmod>2015-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complexity-dichotomy-for-the-dominating-set-problem-1506.00202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complexity-dichotomy-for-the-dominating-set-problem-1506.00202"/></url>
<url><loc>https://scifaro.com/en/abs/monotonic-properties-of-collections-of-maximum-independent-sets-of-a-graph-1506.00249</loc><lastmod>2015-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotonic-properties-of-collections-of-maximum-independent-sets-of-a-graph-1506.00249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotonic-properties-of-collections-of-maximum-independent-sets-of-a-graph-1506.00249"/></url>
<url><loc>https://scifaro.com/en/abs/critical-and-maximum-independent-sets-of-a-graph-1506.00255</loc><lastmod>2015-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-and-maximum-independent-sets-of-a-graph-1506.00255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-and-maximum-independent-sets-of-a-graph-1506.00255"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-shortest-path-game-extended-version-1506.00462</loc><lastmod>2015-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-shortest-path-game-extended-version-1506.00462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-shortest-path-game-extended-version-1506.00462"/></url>
<url><loc>https://scifaro.com/en/abs/peeling-algorithm-on-random-hypergraphs-with-superlinear-number-of-hyperedges-1506.00718</loc><lastmod>2015-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peeling-algorithm-on-random-hypergraphs-with-superlinear-number-of-hyperedges-1506.00718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peeling-algorithm-on-random-hypergraphs-with-superlinear-number-of-hyperedges-1506.00718"/></url>
<url><loc>https://scifaro.com/en/abs/phase-transitions-for-the-uniform-distribution-in-the-pml-problem-and-its-bethe-approximation-1506.00753</loc><lastmod>2015-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/phase-transitions-for-the-uniform-distribution-in-the-pml-problem-and-its-bethe-approximation-1506.00753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/phase-transitions-for-the-uniform-distribution-in-the-pml-problem-and-its-bethe-approximation-1506.00753"/></url>
<url><loc>https://scifaro.com/en/abs/an-inequality-for-the-fourier-spectrum-of-parity-decision-trees-1506.01055</loc><lastmod>2015-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-inequality-for-the-fourier-spectrum-of-parity-decision-trees-1506.01055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-inequality-for-the-fourier-spectrum-of-parity-decision-trees-1506.01055"/></url>
<url><loc>https://scifaro.com/en/abs/carry-value-transformation-cvt-exclusive-or-xor-tree-and-its-significant-properties-1506.01544</loc><lastmod>2015-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/carry-value-transformation-cvt-exclusive-or-xor-tree-and-its-significant-properties-1506.01544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/carry-value-transformation-cvt-exclusive-or-xor-tree-and-its-significant-properties-1506.01544"/></url>
<url><loc>https://scifaro.com/en/abs/bias-vs-structure-of-polynomials-in-large-fields-and-applications-in-information-theory-1506.02047</loc><lastmod>2022-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bias-vs-structure-of-polynomials-in-large-fields-and-applications-in-information-theory-1506.02047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bias-vs-structure-of-polynomials-in-large-fields-and-applications-in-information-theory-1506.02047"/></url>
<url><loc>https://scifaro.com/en/abs/topology-preserving-digitization-of-n-dimensional-objects-by-constructing-cubical-models-1506.02678</loc><lastmod>2015-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-preserving-digitization-of-n-dimensional-objects-by-constructing-cubical-models-1506.02678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-preserving-digitization-of-n-dimensional-objects-by-constructing-cubical-models-1506.02678"/></url>
<url><loc>https://scifaro.com/en/abs/words-with-the-maximum-number-of-abelian-squares-1506.03562</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/words-with-the-maximum-number-of-abelian-squares-1506.03562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/words-with-the-maximum-number-of-abelian-squares-1506.03562"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneously-moving-cops-and-robbers-1506.03613</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneously-moving-cops-and-robbers-1506.03613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneously-moving-cops-and-robbers-1506.03613"/></url>
<url><loc>https://scifaro.com/en/abs/some-extensions-of-the-inversion-complexity-of-boolean-functions-1506.04485</loc><lastmod>2015-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-extensions-of-the-inversion-complexity-of-boolean-functions-1506.04485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-extensions-of-the-inversion-complexity-of-boolean-functions-1506.04485"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-pattern-structure-projections-1506.05018</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-pattern-structure-projections-1506.05018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-pattern-structure-projections-1506.05018"/></url>
<url><loc>https://scifaro.com/en/abs/automorphism-groups-of-comparability-graphs-1506.05064</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automorphism-groups-of-comparability-graphs-1506.05064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automorphism-groups-of-comparability-graphs-1506.05064"/></url>
<url><loc>https://scifaro.com/en/abs/non-dominating-sequences-of-vectors-using-only-resets-and-increments-1506.05279</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-dominating-sequences-of-vectors-using-only-resets-and-increments-1506.05279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-dominating-sequences-of-vectors-using-only-resets-and-increments-1506.05279"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-converse-of-talagrand-s-influence-inequality-1506.06325</loc><lastmod>2015-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-converse-of-talagrand-s-influence-inequality-1506.06325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-converse-of-talagrand-s-influence-inequality-1506.06325"/></url>
<url><loc>https://scifaro.com/en/abs/cubic-tsp-a-1-3-approximation-1506.06369</loc><lastmod>2016-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubic-tsp-a-1-3-approximation-1506.06369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubic-tsp-a-1-3-approximation-1506.06369"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-algebra-for-cascade-effects-1506.06394</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-algebra-for-cascade-effects-1506.06394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-algebra-for-cascade-effects-1506.06394"/></url>
<url><loc>https://scifaro.com/en/abs/the-jordan-brouwer-theorem-for-graphs-1506.06440</loc><lastmod>2015-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-jordan-brouwer-theorem-for-graphs-1506.06440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-jordan-brouwer-theorem-for-graphs-1506.06440"/></url>
<url><loc>https://scifaro.com/en/abs/an-aperiodic-set-of-11-wang-tiles-1506.06492</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-aperiodic-set-of-11-wang-tiles-1506.06492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-aperiodic-set-of-11-wang-tiles-1506.06492"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-for-the-clique-cover-width-of-factors-of-the-apex-graph-of-the-planar-grid-1506.06813</loc><lastmod>2016-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-for-the-clique-cover-width-of-factors-of-the-apex-graph-of-the-planar-grid-1506.06813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-for-the-clique-cover-width-of-factors-of-the-apex-graph-of-the-planar-grid-1506.06813"/></url>
<url><loc>https://scifaro.com/en/abs/packing-coloring-of-some-undirected-and-oriented-coronae-graphs-1506.07248</loc><lastmod>2015-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-coloring-of-some-undirected-and-oriented-coronae-graphs-1506.07248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-coloring-of-some-undirected-and-oriented-coronae-graphs-1506.07248"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedral-aspects-of-submodularity-convexity-and-concavity-1506.07329</loc><lastmod>2015-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedral-aspects-of-submodularity-convexity-and-concavity-1506.07329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedral-aspects-of-submodularity-convexity-and-concavity-1506.07329"/></url>
<url><loc>https://scifaro.com/en/abs/orienting-edges-to-fight-fire-in-graphs-1506.07338</loc><lastmod>2015-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orienting-edges-to-fight-fire-in-graphs-1506.07338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orienting-edges-to-fight-fire-in-graphs-1506.07338"/></url>
<url><loc>https://scifaro.com/en/abs/a-multidimensional-maximum-bisection-problem-1506.07731</loc><lastmod>2015-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multidimensional-maximum-bisection-problem-1506.07731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multidimensional-maximum-bisection-problem-1506.07731"/></url>
<url><loc>https://scifaro.com/en/abs/comparison-of-coverability-and-multi-scale-coverability-in-one-and-two-dimensions-1506.08375</loc><lastmod>2015-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparison-of-coverability-and-multi-scale-coverability-in-one-and-two-dimensions-1506.08375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparison-of-coverability-and-multi-scale-coverability-in-one-and-two-dimensions-1506.08375"/></url>
<url><loc>https://scifaro.com/en/abs/iv-matching-is-strongly-np-hard-1506.08388</loc><lastmod>2015-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iv-matching-is-strongly-np-hard-1506.08388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iv-matching-is-strongly-np-hard-1506.08388"/></url>
<url><loc>https://scifaro.com/en/abs/adding-isolated-vertices-makes-some-online-algorithms-optimal-1506.08592</loc><lastmod>2017-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-isolated-vertices-makes-some-online-algorithms-optimal-1506.08592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-isolated-vertices-makes-some-online-algorithms-optimal-1506.08592"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-decompositions-through-methods-using-congruence-relations-1506.08658</loc><lastmod>2015-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-decompositions-through-methods-using-congruence-relations-1506.08658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-decompositions-through-methods-using-congruence-relations-1506.08658"/></url>
<url><loc>https://scifaro.com/en/abs/counting-skolem-sequences-1507.00315</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-skolem-sequences-1507.00315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-skolem-sequences-1507.00315"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-and-recognition-of-some-opposition-and-coalition-graph-classes-1507.00557</loc><lastmod>2015-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-and-recognition-of-some-opposition-and-coalition-graph-classes-1507.00557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-and-recognition-of-some-opposition-and-coalition-graph-classes-1507.00557"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-parameter-complexity-of-distance-constrained-labeling-and-uniform-channel-assignment-problems-1507.00640</loc><lastmod>2015-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-parameter-complexity-of-distance-constrained-labeling-and-uniform-channel-assignment-problems-1507.00640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-parameter-complexity-of-distance-constrained-labeling-and-uniform-channel-assignment-problems-1507.00640"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-moment-distance-of-poisson-processes-1507.01048</loc><lastmod>2017-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-moment-distance-of-poisson-processes-1507.01048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-moment-distance-of-poisson-processes-1507.01048"/></url>
<url><loc>https://scifaro.com/en/abs/pixel-and-voxel-representations-of-graphs-1507.01450</loc><lastmod>2015-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pixel-and-voxel-representations-of-graphs-1507.01450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pixel-and-voxel-representations-of-graphs-1507.01450"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-clique-number-of-complete-k-partite-graphs-1507.01613</loc><lastmod>2015-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-clique-number-of-complete-k-partite-graphs-1507.01613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-clique-number-of-complete-k-partite-graphs-1507.01613"/></url>
<url><loc>https://scifaro.com/en/abs/well-formed-separator-sequences-with-an-application-to-hypergraph-drawing-1507.02350</loc><lastmod>2015-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-formed-separator-sequences-with-an-application-to-hypergraph-drawing-1507.02350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-formed-separator-sequences-with-an-application-to-hypergraph-drawing-1507.02350"/></url>
<url><loc>https://scifaro.com/en/abs/ride-sharing-with-a-vehicle-of-unlimited-capacity-1507.02414</loc><lastmod>2016-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ride-sharing-with-a-vehicle-of-unlimited-capacity-1507.02414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ride-sharing-with-a-vehicle-of-unlimited-capacity-1507.02414"/></url>
<url><loc>https://scifaro.com/en/abs/an-extremal-problem-in-proper-r-p-coloring-of-hypergraphs-1507.02463</loc><lastmod>2015-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extremal-problem-in-proper-r-p-coloring-of-hypergraphs-1507.02463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extremal-problem-in-proper-r-p-coloring-of-hypergraphs-1507.02463"/></url>
<url><loc>https://scifaro.com/en/abs/avoidability-of-long-k-abelian-repetitions-1507.02581</loc><lastmod>2015-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoidability-of-long-k-abelian-repetitions-1507.02581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoidability-of-long-k-abelian-repetitions-1507.02581"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-and-enumerative-aspects-of-the-moser-tardos-distribution-1507.02674</loc><lastmod>2023-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-and-enumerative-aspects-of-the-moser-tardos-distribution-1507.02674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-and-enumerative-aspects-of-the-moser-tardos-distribution-1507.02674"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-connectedness-of-clash-free-timetables-1507.02805</loc><lastmod>2015-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-connectedness-of-clash-free-timetables-1507.02805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-connectedness-of-clash-free-timetables-1507.02805"/></url>
<url><loc>https://scifaro.com/en/abs/estimation-of-laplacian-spectra-of-direct-and-strong-product-graphs-1507.03030</loc><lastmod>2017-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimation-of-laplacian-spectra-of-direct-and-strong-product-graphs-1507.03030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimation-of-laplacian-spectra-of-direct-and-strong-product-graphs-1507.03030"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-tree-decomposition-method-for-permanents-and-mixed-discriminants-1507.03046</loc><lastmod>2016-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-tree-decomposition-method-for-permanents-and-mixed-discriminants-1507.03046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-tree-decomposition-method-for-permanents-and-mixed-discriminants-1507.03046"/></url>
<url><loc>https://scifaro.com/en/abs/strong-r-p-cover-for-hypergraphs-1507.03160</loc><lastmod>2015-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-r-p-cover-for-hypergraphs-1507.03160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-r-p-cover-for-hypergraphs-1507.03160"/></url>
<url><loc>https://scifaro.com/en/abs/the-coloring-game-on-planar-graphs-with-large-girth-by-a-result-on-sparse-cactuses-1507.03195</loc><lastmod>2015-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-coloring-game-on-planar-graphs-with-large-girth-by-a-result-on-sparse-cactuses-1507.03195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-coloring-game-on-planar-graphs-with-large-girth-by-a-result-on-sparse-cactuses-1507.03195"/></url>
<url><loc>https://scifaro.com/en/abs/strong-games-played-on-random-graphs-1507.04229</loc><lastmod>2015-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-games-played-on-random-graphs-1507.04229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-games-played-on-random-graphs-1507.04229"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-generalized-mst-and-tsp-in-grid-clusters-1507.04438</loc><lastmod>2015-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-generalized-mst-and-tsp-in-grid-clusters-1507.04438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-generalized-mst-and-tsp-in-grid-clusters-1507.04438"/></url>
<url><loc>https://scifaro.com/en/abs/fast-clique-minor-generation-in-chimera-qubit-connectivity-graphs-1507.04774</loc><lastmod>2020-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-clique-minor-generation-in-chimera-qubit-connectivity-graphs-1507.04774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-clique-minor-generation-in-chimera-qubit-connectivity-graphs-1507.04774"/></url>
<url><loc>https://scifaro.com/en/abs/ordering-with-precedence-constraints-and-budget-minimization-1507.04885</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordering-with-precedence-constraints-and-budget-minimization-1507.04885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordering-with-precedence-constraints-and-budget-minimization-1507.04885"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-toroidal-triangulations-1507.05461</loc><lastmod>2015-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-toroidal-triangulations-1507.05461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-toroidal-triangulations-1507.05461"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-aggregation-of-blocks-into-subproblems-in-linear-programs-with-block-diagonal-structure-1507.05753</loc><lastmod>2015-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-aggregation-of-blocks-into-subproblems-in-linear-programs-with-block-diagonal-structure-1507.05753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-aggregation-of-blocks-into-subproblems-in-linear-programs-with-block-diagonal-structure-1507.05753"/></url>
<url><loc>https://scifaro.com/en/abs/dominating-induced-matchings-for-p-8-free-graphs-in-polynomial-time-1507.06541</loc><lastmod>2016-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dominating-induced-matchings-for-p-8-free-graphs-in-polynomial-time-1507.06541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dominating-induced-matchings-for-p-8-free-graphs-in-polynomial-time-1507.06541"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-efficient-domination-for-p-5-free-graphs-in-linear-time-1507.06765</loc><lastmod>2015-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-efficient-domination-for-p-5-free-graphs-in-linear-time-1507.06765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-efficient-domination-for-p-5-free-graphs-in-linear-time-1507.06765"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-geodesics-and-cellular-automata-1507.06836</loc><lastmod>2016-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-geodesics-and-cellular-automata-1507.06836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-geodesics-and-cellular-automata-1507.06836"/></url>
<url><loc>https://scifaro.com/en/abs/almost-optimal-cover-free-families-1507.07368</loc><lastmod>2015-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-optimal-cover-free-families-1507.07368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-optimal-cover-free-families-1507.07368"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-parallel-algorithm-for-spectral-sparsification-of-laplacian-and-sddm-matrix-polynomials-1507.07497</loc><lastmod>2016-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-parallel-algorithm-for-spectral-sparsification-of-laplacian-and-sddm-matrix-polynomials-1507.07497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-parallel-algorithm-for-spectral-sparsification-of-laplacian-and-sddm-matrix-polynomials-1507.07497"/></url>
<url><loc>https://scifaro.com/en/abs/building-an-iterative-heuristic-solver-for-a-quantum-annealer-1507.07605</loc><lastmod>2016-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-an-iterative-heuristic-solver-for-a-quantum-annealer-1507.07605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-an-iterative-heuristic-solver-for-a-quantum-annealer-1507.07605"/></url>
<url><loc>https://scifaro.com/en/abs/focused-stochastic-local-search-and-the-lov-asz-local-lemma-1507.07633</loc><lastmod>2015-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focused-stochastic-local-search-and-the-lov-asz-local-lemma-1507.07633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focused-stochastic-local-search-and-the-lov-asz-local-lemma-1507.07633"/></url>
<url><loc>https://scifaro.com/en/abs/parabolic-equations-on-digital-spaces-solutions-on-the-digital-moebius-strip-and-the-digital-projective-plane-1507.08109</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parabolic-equations-on-digital-spaces-solutions-on-the-digital-moebius-strip-and-the-digital-projective-plane-1507.08109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parabolic-equations-on-digital-spaces-solutions-on-the-digital-moebius-strip-and-the-digital-projective-plane-1507.08109"/></url>
<url><loc>https://scifaro.com/en/abs/identification-location-domination-and-metric-dimension-on-interval-and-permutation-graphs-i-bounds-1507.08164</loc><lastmod>2017-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identification-location-domination-and-metric-dimension-on-interval-and-permutation-graphs-i-bounds-1507.08164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identification-location-domination-and-metric-dimension-on-interval-and-permutation-graphs-i-bounds-1507.08164"/></url>
<url><loc>https://scifaro.com/en/abs/signals-on-graphs-uncertainty-principle-and-sampling-1507.08822</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signals-on-graphs-uncertainty-principle-and-sampling-1507.08822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signals-on-graphs-uncertainty-principle-and-sampling-1507.08822"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-property-of-hamilton-graphs-1508.00068</loc><lastmod>2015-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-property-of-hamilton-graphs-1508.00068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-property-of-hamilton-graphs-1508.00068"/></url>
<url><loc>https://scifaro.com/en/abs/popular-edges-and-dominant-matchings-1508.00614</loc><lastmod>2015-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/popular-edges-and-dominant-matchings-1508.00614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/popular-edges-and-dominant-matchings-1508.00614"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-distance-edge-labeling-1508.01014</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-distance-edge-labeling-1508.01014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-distance-edge-labeling-1508.01014"/></url>
<url><loc>https://scifaro.com/en/abs/degree-constrained-subgraph-reconfiguration-is-in-p-1508.01372</loc><lastmod>2015-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-constrained-subgraph-reconfiguration-is-in-p-1508.01372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-constrained-subgraph-reconfiguration-is-in-p-1508.01372"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-the-filament-and-overlap-graphs-of-subtrees-of-limited-trees-1508.01441</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-the-filament-and-overlap-graphs-of-subtrees-of-limited-trees-1508.01441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-the-filament-and-overlap-graphs-of-subtrees-of-limited-trees-1508.01441"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraph-coloring-up-to-condensation-1508.01841</loc><lastmod>2018-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraph-coloring-up-to-condensation-1508.01841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraph-coloring-up-to-condensation-1508.01841"/></url>
<url><loc>https://scifaro.com/en/abs/the-graph-spectrum-of-barycentric-refinements-1508.02027</loc><lastmod>2015-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graph-spectrum-of-barycentric-refinements-1508.02027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graph-spectrum-of-barycentric-refinements-1508.02027"/></url>
<url><loc>https://scifaro.com/en/abs/minority-population-in-the-one-dimensional-schelling-model-of-segregation-1508.02497</loc><lastmod>2015-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minority-population-in-the-one-dimensional-schelling-model-of-segregation-1508.02497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minority-population-in-the-one-dimensional-schelling-model-of-segregation-1508.02497"/></url>
<url><loc>https://scifaro.com/en/abs/on-interval-edge-colorings-of-bipartite-graphs-of-small-order-1508.02851</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-interval-edge-colorings-of-bipartite-graphs-of-small-order-1508.02851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-interval-edge-colorings-of-bipartite-graphs-of-small-order-1508.02851"/></url>
<url><loc>https://scifaro.com/en/abs/a-hausdorff-dimension-for-finite-sets-1508.02946</loc><lastmod>2015-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hausdorff-dimension-for-finite-sets-1508.02946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hausdorff-dimension-for-finite-sets-1508.02946"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-structure-of-pan-even-hole-free-graphs-1508.03062</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-structure-of-pan-even-hole-free-graphs-1508.03062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-structure-of-pan-even-hole-free-graphs-1508.03062"/></url>
<url><loc>https://scifaro.com/en/abs/total-variation-discrepancy-of-deterministic-random-walks-for-ergodic-markov-chains-1508.03458</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-variation-discrepancy-of-deterministic-random-walks-for-ergodic-markov-chains-1508.03458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-variation-discrepancy-of-deterministic-random-walks-for-ergodic-markov-chains-1508.03458"/></url>
<url><loc>https://scifaro.com/en/abs/corona-graphs-as-a-model-of-small-world-networks-1508.03800</loc><lastmod>2016-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/corona-graphs-as-a-model-of-small-world-networks-1508.03800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/corona-graphs-as-a-model-of-small-world-networks-1508.03800"/></url>
<url><loc>https://scifaro.com/en/abs/max-point-tolerance-graphs-1508.03810</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/max-point-tolerance-graphs-1508.03810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/max-point-tolerance-graphs-1508.03810"/></url>
<url><loc>https://scifaro.com/en/abs/on-connectivity-in-a-general-random-intersection-graph-1508.03890</loc><lastmod>2015-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-connectivity-in-a-general-random-intersection-graph-1508.03890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-connectivity-in-a-general-random-intersection-graph-1508.03890"/></url>
<url><loc>https://scifaro.com/en/abs/simulated-tempering-and-swapping-on-mean-field-models-1508.04521</loc><lastmod>2016-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulated-tempering-and-swapping-on-mean-field-models-1508.04521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulated-tempering-and-swapping-on-mean-field-models-1508.04521"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-graphs-into-induced-subgraphs-1508.04725</loc><lastmod>2016-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-graphs-into-induced-subgraphs-1508.04725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-graphs-into-induced-subgraphs-1508.04725"/></url>
<url><loc>https://scifaro.com/en/abs/marathon-an-open-source-software-library-for-the-analysis-of-markov-chain-monte-carlo-algorithms-1508.04740</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/marathon-an-open-source-software-library-for-the-analysis-of-markov-chain-monte-carlo-algorithms-1508.04740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/marathon-an-open-source-software-library-for-the-analysis-of-markov-chain-monte-carlo-algorithms-1508.04740"/></url>
<url><loc>https://scifaro.com/en/abs/arrow-type-impossibility-theorems-over-median-algebras-1508.04741</loc><lastmod>2015-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arrow-type-impossibility-theorems-over-median-algebras-1508.04741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arrow-type-impossibility-theorems-over-median-algebras-1508.04741"/></url>
<url><loc>https://scifaro.com/en/abs/stable-states-of-perturbed-markov-chains-1508.05299</loc><lastmod>2016-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-states-of-perturbed-markov-chains-1508.05299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-states-of-perturbed-markov-chains-1508.05299"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithm-for-minimum-weight-k-m-cds-problem-in-unit-disk-graph-1508.05515</loc><lastmod>2019-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithm-for-minimum-weight-k-m-cds-problem-in-unit-disk-graph-1508.05515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithm-for-minimum-weight-k-m-cds-problem-in-unit-disk-graph-1508.05515"/></url>
<url><loc>https://scifaro.com/en/abs/a-sard-theorem-for-graph-theory-1508.05657</loc><lastmod>2015-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sard-theorem-for-graph-theory-1508.05657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sard-theorem-for-graph-theory-1508.05657"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-the-clar-number-problem-and-an-fpt-algorithm-1508.06889</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-the-clar-number-problem-and-an-fpt-algorithm-1508.06889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-the-clar-number-problem-and-an-fpt-algorithm-1508.06889"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-algorithm-for-coloring-m-clique-holes-1508.06967</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-algorithm-for-coloring-m-clique-holes-1508.06967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-algorithm-for-coloring-m-clique-holes-1508.06967"/></url>
<url><loc>https://scifaro.com/en/abs/fast-factorization-of-cartesian-products-of-hypergraphs-1508.07181</loc><lastmod>2015-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-factorization-of-cartesian-products-of-hypergraphs-1508.07181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-factorization-of-cartesian-products-of-hypergraphs-1508.07181"/></url>
<url><loc>https://scifaro.com/en/abs/on-homomorphism-of-oriented-graphs-with-respect-to-push-operation-1508.07217</loc><lastmod>2015-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-homomorphism-of-oriented-graphs-with-respect-to-push-operation-1508.07217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-homomorphism-of-oriented-graphs-with-respect-to-push-operation-1508.07217"/></url>
<url><loc>https://scifaro.com/en/abs/on-chromatic-number-of-colored-mixed-graphs-1508.07222</loc><lastmod>2015-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-chromatic-number-of-colored-mixed-graphs-1508.07222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-chromatic-number-of-colored-mixed-graphs-1508.07222"/></url>
<url><loc>https://scifaro.com/en/abs/on-ultralimits-of-sparse-graph-classes-1508.07256</loc><lastmod>2015-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-ultralimits-of-sparse-graph-classes-1508.07256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-ultralimits-of-sparse-graph-classes-1508.07256"/></url>
<url><loc>https://scifaro.com/en/abs/mixed-covering-arrays-on-3-uniform-hypergraphs-1508.07393</loc><lastmod>2015-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixed-covering-arrays-on-3-uniform-hypergraphs-1508.07393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixed-covering-arrays-on-3-uniform-hypergraphs-1508.07393"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-efficient-domination-for-p-6-free-graphs-in-polynomial-time-1508.07733</loc><lastmod>2015-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-efficient-domination-for-p-6-free-graphs-in-polynomial-time-1508.07733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-efficient-domination-for-p-6-free-graphs-in-polynomial-time-1508.07733"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-and-fixed-parameter-algorithms-for-weighted-improper-coloring-extended-version-1509.00099</loc><lastmod>2015-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-and-fixed-parameter-algorithms-for-weighted-improper-coloring-extended-version-1509.00099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-and-fixed-parameter-algorithms-for-weighted-improper-coloring-extended-version-1509.00099"/></url>
<url><loc>https://scifaro.com/en/abs/completing-orientations-of-partially-oriented-graphs-1509.01301</loc><lastmod>2015-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completing-orientations-of-partially-oriented-graphs-1509.01301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completing-orientations-of-partially-oriented-graphs-1509.01301"/></url>
<url><loc>https://scifaro.com/en/abs/end-vertices-of-lbfs-of-at-free-bigraphs-1509.01307</loc><lastmod>2015-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/end-vertices-of-lbfs-of-at-free-bigraphs-1509.01307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/end-vertices-of-lbfs-of-at-free-bigraphs-1509.01307"/></url>
<url><loc>https://scifaro.com/en/abs/invertibility-modulo-dead-ending-no-p-universes-1509.01576</loc><lastmod>2015-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invertibility-modulo-dead-ending-no-p-universes-1509.01576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invertibility-modulo-dead-ending-no-p-universes-1509.01576"/></url>
<url><loc>https://scifaro.com/en/abs/on-hardness-of-the-joint-crossing-number-1509.01787</loc><lastmod>2015-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-hardness-of-the-joint-crossing-number-1509.01787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-hardness-of-the-joint-crossing-number-1509.01787"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-paths-between-partitions-1509.01852</loc><lastmod>2016-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-paths-between-partitions-1509.01852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-paths-between-partitions-1509.01852"/></url>
<url><loc>https://scifaro.com/en/abs/de-bruijn-entropy-and-string-similarity-1509.02975</loc><lastmod>2022-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/de-bruijn-entropy-and-string-similarity-1509.02975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/de-bruijn-entropy-and-string-similarity-1509.02975"/></url>
<url><loc>https://scifaro.com/en/abs/self-correlation-and-maximum-independence-in-finite-relations-1509.03016</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-correlation-and-maximum-independence-in-finite-relations-1509.03016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-correlation-and-maximum-independence-in-finite-relations-1509.03016"/></url>
<url><loc>https://scifaro.com/en/abs/improved-strength-four-covering-arrays-with-three-symbols-1509.03547</loc><lastmod>2015-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-strength-four-covering-arrays-with-three-symbols-1509.03547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-strength-four-covering-arrays-with-three-symbols-1509.03547"/></url>
<url><loc>https://scifaro.com/en/abs/on-extremal-trees-with-respect-to-the-f-index-1509.03574</loc><lastmod>2015-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-extremal-trees-with-respect-to-the-f-index-1509.03574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-extremal-trees-with-respect-to-the-f-index-1509.03574"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-parametric-flow-over-time-1509.03817</loc><lastmod>2015-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-parametric-flow-over-time-1509.03817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-parametric-flow-over-time-1509.03817"/></url>
<url><loc>https://scifaro.com/en/abs/i-mark-a-new-subtraction-division-game-1509.04199</loc><lastmod>2015-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/i-mark-a-new-subtraction-division-game-1509.04199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/i-mark-a-new-subtraction-division-game-1509.04199"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-clique-width-of-h-free-split-graphs-1509.04273</loc><lastmod>2015-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-clique-width-of-h-free-split-graphs-1509.04273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-clique-width-of-h-free-split-graphs-1509.04273"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-vertex-transitive-cubic-partial-cubes-1509.04565</loc><lastmod>2016-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-vertex-transitive-cubic-partial-cubes-1509.04565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-vertex-transitive-cubic-partial-cubes-1509.04565"/></url>
<url><loc>https://scifaro.com/en/abs/cycles-in-enhanced-hypercubes-1509.04932</loc><lastmod>2015-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cycles-in-enhanced-hypercubes-1509.04932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cycles-in-enhanced-hypercubes-1509.04932"/></url>
<url><loc>https://scifaro.com/en/abs/convexities-in-some-special-graph-classes-new-results-in-at-free-graphs-and-beyond-1509.04944</loc><lastmod>2015-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convexities-in-some-special-graph-classes-new-results-in-at-free-graphs-and-beyond-1509.04944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convexities-in-some-special-graph-classes-new-results-in-at-free-graphs-and-beyond-1509.04944"/></url>
<url><loc>https://scifaro.com/en/abs/on-tree-representations-of-relations-and-graphs-symbolic-ultrametrics-and-cograph-edge-decompositions-1509.05069</loc><lastmod>2015-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-tree-representations-of-relations-and-graphs-symbolic-ultrametrics-and-cograph-edge-decompositions-1509.05069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-tree-representations-of-relations-and-graphs-symbolic-ultrametrics-and-cograph-edge-decompositions-1509.05069"/></url>
<url><loc>https://scifaro.com/en/abs/disjoint-difference-families-and-their-applications-1509.05255</loc><lastmod>2015-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjoint-difference-families-and-their-applications-1509.05255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjoint-difference-families-and-their-applications-1509.05255"/></url>
<url><loc>https://scifaro.com/en/abs/gray-coding-planar-maps-1509.05807</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gray-coding-planar-maps-1509.05807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gray-coding-planar-maps-1509.05807"/></url>
<url><loc>https://scifaro.com/en/abs/group-theoretical-vector-space-model-1509.05977</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/group-theoretical-vector-space-model-1509.05977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/group-theoretical-vector-space-model-1509.05977"/></url>
<url><loc>https://scifaro.com/en/abs/product-space-models-of-correlation-between-noise-stability-and-additive-combinatorics-1509.06191</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/product-space-models-of-correlation-between-noise-stability-and-additive-combinatorics-1509.06191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/product-space-models-of-correlation-between-noise-stability-and-additive-combinatorics-1509.06191"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-linearization-technique-for-solving-quadratic-set-covering-problem-and-variations-1509.06305</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-linearization-technique-for-solving-quadratic-set-covering-problem-and-variations-1509.06305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-linearization-technique-for-solving-quadratic-set-covering-problem-and-variations-1509.06305"/></url>
<url><loc>https://scifaro.com/en/abs/a-square-root-map-on-sturmian-words-1509.06349</loc><lastmod>2017-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-square-root-map-on-sturmian-words-1509.06349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-square-root-map-on-sturmian-words-1509.06349"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-algorithms-and-concentration-bounds-for-the-lovasz-local-lemma-via-witness-dags-1509.06430</loc><lastmod>2023-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-algorithms-and-concentration-bounds-for-the-lovasz-local-lemma-via-witness-dags-1509.06430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-algorithms-and-concentration-bounds-for-the-lovasz-local-lemma-via-witness-dags-1509.06430"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-reassembling-of-graphs-part-1-the-linear-case-1509.06434</loc><lastmod>2016-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-reassembling-of-graphs-part-1-the-linear-case-1509.06434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-reassembling-of-graphs-part-1-the-linear-case-1509.06434"/></url>
<url><loc>https://scifaro.com/en/abs/an-effective-decomposition-approach-and-heuristics-to-generate-spanning-trees-with-a-small-number-of-branch-vertices-1509.06562</loc><lastmod>2016-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-effective-decomposition-approach-and-heuristics-to-generate-spanning-trees-with-a-small-number-of-branch-vertices-1509.06562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-effective-decomposition-approach-and-heuristics-to-generate-spanning-trees-with-a-small-number-of-branch-vertices-1509.06562"/></url>
<url><loc>https://scifaro.com/en/abs/techniques-for-the-cograph-editing-problem-module-merge-is-equivalent-to-editing-p4s-1509.06983</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/techniques-for-the-cograph-editing-problem-module-merge-is-equivalent-to-editing-p4s-1509.06983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/techniques-for-the-cograph-editing-problem-module-merge-is-equivalent-to-editing-p4s-1509.06983"/></url>
<url><loc>https://scifaro.com/en/abs/the-global-packing-number-for-an-optical-network-1509.07029</loc><lastmod>2015-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-global-packing-number-for-an-optical-network-1509.07029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-global-packing-number-for-an-optical-network-1509.07029"/></url>
<url><loc>https://scifaro.com/en/abs/graphic-realizations-of-joint-degree-matrices-1509.07076</loc><lastmod>2015-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphic-realizations-of-joint-degree-matrices-1509.07076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphic-realizations-of-joint-degree-matrices-1509.07076"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-points-and-connections-between-positive-and-negative-cycles-in-boolean-networks-1509.07702</loc><lastmod>2017-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-points-and-connections-between-positive-and-negative-cycles-in-boolean-networks-1509.07702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-points-and-connections-between-positive-and-negative-cycles-in-boolean-networks-1509.07702"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-set-packing-and-near-boolean-functions-1509.07986</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-set-packing-and-near-boolean-functions-1509.07986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-set-packing-and-near-boolean-functions-1509.07986"/></url>
<url><loc>https://scifaro.com/en/abs/linear-arrangement-of-halin-graphs-1509.08145</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-arrangement-of-halin-graphs-1509.08145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-arrangement-of-halin-graphs-1509.08145"/></url>
<url><loc>https://scifaro.com/en/abs/fast-algorithms-for-finding-pattern-avoiders-and-counting-pattern-occurrences-in-permutations-1509.08216</loc><lastmod>2017-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-algorithms-for-finding-pattern-avoiders-and-counting-pattern-occurrences-in-permutations-1509.08216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-algorithms-for-finding-pattern-avoiders-and-counting-pattern-occurrences-in-permutations-1509.08216"/></url>
<url><loc>https://scifaro.com/en/abs/multilinear-objective-function-based-clustering-1509.08456</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multilinear-objective-function-based-clustering-1509.08456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multilinear-objective-function-based-clustering-1509.08456"/></url>
<url><loc>https://scifaro.com/en/abs/traffic-signal-optimization-combining-static-and-dynamic-models-1509.08709</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/traffic-signal-optimization-combining-static-and-dynamic-models-1509.08709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/traffic-signal-optimization-combining-static-and-dynamic-models-1509.08709"/></url>
<url><loc>https://scifaro.com/en/abs/self-coordinated-corona-graphs-a-model-for-complex-networks-1509.08773</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-coordinated-corona-graphs-a-model-for-complex-networks-1509.08773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-coordinated-corona-graphs-a-model-for-complex-networks-1509.08773"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-spectral-clustering-efficiency-and-guarantees-1509.09188</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-spectral-clustering-efficiency-and-guarantees-1509.09188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-spectral-clustering-efficiency-and-guarantees-1509.09188"/></url>
<url><loc>https://scifaro.com/en/abs/on-chudnovsky-based-arithmetic-algorithms-in-finite-fields-1510.00090</loc><lastmod>2015-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-chudnovsky-based-arithmetic-algorithms-in-finite-fields-1510.00090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-chudnovsky-based-arithmetic-algorithms-in-finite-fields-1510.00090"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-geometric-approach-to-nivat-s-conjecture-1510.00177</loc><lastmod>2015-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-geometric-approach-to-nivat-s-conjecture-1510.00177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-geometric-approach-to-nivat-s-conjecture-1510.00177"/></url>
<url><loc>https://scifaro.com/en/abs/discretizations-of-isometries-1510.00722</loc><lastmod>2015-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discretizations-of-isometries-1510.00722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discretizations-of-isometries-1510.00722"/></url>
<url><loc>https://scifaro.com/en/abs/rank-aggregation-new-bounds-for-mcx-1510.00738</loc><lastmod>2015-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rank-aggregation-new-bounds-for-mcx-1510.00738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rank-aggregation-new-bounds-for-mcx-1510.00738"/></url>
<url><loc>https://scifaro.com/en/abs/tight-lower-bounds-on-the-number-of-bicliques-in-false-twin-free-graphs-1510.01165</loc><lastmod>2016-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-lower-bounds-on-the-number-of-bicliques-in-false-twin-free-graphs-1510.01165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-lower-bounds-on-the-number-of-bicliques-in-false-twin-free-graphs-1510.01165"/></url>
<url><loc>https://scifaro.com/en/abs/hadamard-product-decomposition-and-mutually-exclusive-matrices-on-network-structure-and-utilization-1510.01276</loc><lastmod>2015-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hadamard-product-decomposition-and-mutually-exclusive-matrices-on-network-structure-and-utilization-1510.01276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hadamard-product-decomposition-and-mutually-exclusive-matrices-on-network-structure-and-utilization-1510.01276"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-properties-of-laplacian-and-stochastic-diffusion-process-for-edge-expansion-in-hypergraphs-1510.01520</loc><lastmod>2015-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-properties-of-laplacian-and-stochastic-diffusion-process-for-edge-expansion-in-hypergraphs-1510.01520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-properties-of-laplacian-and-stochastic-diffusion-process-for-edge-expansion-in-hypergraphs-1510.01520"/></url>
<url><loc>https://scifaro.com/en/abs/doubled-patterns-are-3-avoidable-1510.01753</loc><lastmod>2015-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/doubled-patterns-are-3-avoidable-1510.01753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/doubled-patterns-are-3-avoidable-1510.01753"/></url>
<url><loc>https://scifaro.com/en/abs/a-box-decomposition-algorithm-to-compute-the-hypervolume-indicator-1510.01963</loc><lastmod>2015-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-box-decomposition-algorithm-to-compute-the-hypervolume-indicator-1510.01963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-box-decomposition-algorithm-to-compute-the-hypervolume-indicator-1510.01963"/></url>
<url><loc>https://scifaro.com/en/abs/aperiodic-subshifts-on-polycyclic-groups-1510.02360</loc><lastmod>2016-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aperiodic-subshifts-on-polycyclic-groups-1510.02360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aperiodic-subshifts-on-polycyclic-groups-1510.02360"/></url>
<url><loc>https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-infinite-square-lattice-is-between-13-and-15-1510.02374</loc><lastmod>2017-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-infinite-square-lattice-is-between-13-and-15-1510.02374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-infinite-square-lattice-is-between-13-and-15-1510.02374"/></url>
<url><loc>https://scifaro.com/en/abs/on-path-decompositions-of-2k-regular-graphs-1510.02526</loc><lastmod>2015-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-path-decompositions-of-2k-regular-graphs-1510.02526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-path-decompositions-of-2k-regular-graphs-1510.02526"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-discrete-methods-in-algebraic-statistics-for-networks-1510.02838</loc><lastmod>2016-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-discrete-methods-in-algebraic-statistics-for-networks-1510.02838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-discrete-methods-in-algebraic-statistics-for-networks-1510.02838"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-rainbow-coloring-problems-1510.03614</loc><lastmod>2015-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-rainbow-coloring-problems-1510.03614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-rainbow-coloring-problems-1510.03614"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-classes-of-interval-graphs-of-limited-nesting-and-count-of-lengths-1510.03998</loc><lastmod>2017-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-classes-of-interval-graphs-of-limited-nesting-and-count-of-lengths-1510.03998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-classes-of-interval-graphs-of-limited-nesting-and-count-of-lengths-1510.03998"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-flora-of-asynchronous-locally-non-monotonic-boolean-automata-networks-1510.05452</loc><lastmod>2016-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-flora-of-asynchronous-locally-non-monotonic-boolean-automata-networks-1510.05452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-flora-of-asynchronous-locally-non-monotonic-boolean-automata-networks-1510.05452"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-signed-graph-and-edge-coloured-graph-homomorphisms-1510.05502</loc><lastmod>2016-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-signed-graph-and-edge-coloured-graph-homomorphisms-1510.05502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-signed-graph-and-edge-coloured-graph-homomorphisms-1510.05502"/></url>
<url><loc>https://scifaro.com/en/abs/arithmetic-for-rooted-trees-1510.05512</loc><lastmod>2016-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arithmetic-for-rooted-trees-1510.05512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arithmetic-for-rooted-trees-1510.05512"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-packing-chromatic-number-on-hamming-graphs-and-general-graphs-1510.05524</loc><lastmod>2015-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-packing-chromatic-number-on-hamming-graphs-and-general-graphs-1510.05524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-packing-chromatic-number-on-hamming-graphs-and-general-graphs-1510.05524"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithm-for-minimum-weight-connected-m-fold-dominating-set-1510.05886</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithm-for-minimum-weight-connected-m-fold-dominating-set-1510.05886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithm-for-minimum-weight-connected-m-fold-dominating-set-1510.05886"/></url>
<url><loc>https://scifaro.com/en/abs/inversion-complexity-of-functions-of-multi-valued-logic-1510.05942</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inversion-complexity-of-functions-of-multi-valued-logic-1510.05942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inversion-complexity-of-functions-of-multi-valued-logic-1510.05942"/></url>
<url><loc>https://scifaro.com/en/abs/random-cluster-dynamics-in-mathbb-z-2-1510.06762</loc><lastmod>2022-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-cluster-dynamics-in-mathbb-z-2-1510.06762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-cluster-dynamics-in-mathbb-z-2-1510.06762"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-the-galois-lattice-of-bipartite-distance-hereditary-graphs-1510.06883</loc><lastmod>2015-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-the-galois-lattice-of-bipartite-distance-hereditary-graphs-1510.06883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-the-galois-lattice-of-bipartite-distance-hereditary-graphs-1510.06883"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-conjecture-of-mohar-concerning-kempe-equivalence-of-regular-graphs-1510.06964</loc><lastmod>2016-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-conjecture-of-mohar-concerning-kempe-equivalence-of-regular-graphs-1510.06964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-conjecture-of-mohar-concerning-kempe-equivalence-of-regular-graphs-1510.06964"/></url>
<url><loc>https://scifaro.com/en/abs/the-number-and-degree-distribution-of-spanning-trees-in-the-tower-of-hanoi-graph-1510.07949</loc><lastmod>2016-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-number-and-degree-distribution-of-spanning-trees-in-the-tower-of-hanoi-graph-1510.07949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-number-and-degree-distribution-of-spanning-trees-in-the-tower-of-hanoi-graph-1510.07949"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-representatives-of-morphic-permutations-1510.08371</loc><lastmod>2015-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-representatives-of-morphic-permutations-1510.08371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-representatives-of-morphic-permutations-1510.08371"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-pentagrid-with-three-states-1510.09129</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-pentagrid-with-three-states-1510.09129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-pentagrid-with-three-states-1510.09129"/></url>
<url><loc>https://scifaro.com/en/abs/a-multiple-search-operator-heuristic-for-the-max-k-cut-problem-1510.09156</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multiple-search-operator-heuristic-for-the-max-k-cut-problem-1510.09156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multiple-search-operator-heuristic-for-the-max-k-cut-problem-1510.09156"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-coloring-even-hole-cap-free-graphs-1510.09192</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-coloring-even-hole-cap-free-graphs-1510.09192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-coloring-even-hole-cap-free-graphs-1510.09192"/></url>
<url><loc>https://scifaro.com/en/abs/abelian-logic-gates-1511.00422</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abelian-logic-gates-1511.00422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abelian-logic-gates-1511.00422"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-gossip-1511.00867</loc><lastmod>2018-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-gossip-1511.00867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-gossip-1511.00867"/></url>
<url><loc>https://scifaro.com/en/abs/horton-law-in-self-similar-trees-1511.01558</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horton-law-in-self-similar-trees-1511.01558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horton-law-in-self-similar-trees-1511.01558"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-perfect-forests-in-digraphs-1511.01661</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-perfect-forests-in-digraphs-1511.01661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-perfect-forests-in-digraphs-1511.01661"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-steiner-tree-in-split-graphs-dichotomy-results-1511.01668</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-steiner-tree-in-split-graphs-dichotomy-results-1511.01668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-steiner-tree-in-split-graphs-dichotomy-results-1511.01668"/></url>
<url><loc>https://scifaro.com/en/abs/listing-all-spanning-trees-in-halin-graphs-sequential-and-parallel-view-1511.01696</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/listing-all-spanning-trees-in-halin-graphs-sequential-and-parallel-view-1511.01696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/listing-all-spanning-trees-in-halin-graphs-sequential-and-parallel-view-1511.01696"/></url>
<url><loc>https://scifaro.com/en/abs/flood-it-on-at-free-graphs-1511.01806</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flood-it-on-at-free-graphs-1511.01806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flood-it-on-at-free-graphs-1511.01806"/></url>
<url><loc>https://scifaro.com/en/abs/2-trees-structural-insights-and-the-study-of-hamiltonian-paths-1511.02038</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-trees-structural-insights-and-the-study-of-hamiltonian-paths-1511.02038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-trees-structural-insights-and-the-study-of-hamiltonian-paths-1511.02038"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-relation-between-series-parallel-graphs-and-bipartite-distance-hereditary-graphs-1511.03100</loc><lastmod>2015-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-relation-between-series-parallel-graphs-and-bipartite-distance-hereditary-graphs-1511.03100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-relation-between-series-parallel-graphs-and-bipartite-distance-hereditary-graphs-1511.03100"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-for-the-distribution-free-testing-of-monotone-conjunctions-1511.03333</loc><lastmod>2015-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-for-the-distribution-free-testing-of-monotone-conjunctions-1511.03333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-for-the-distribution-free-testing-of-monotone-conjunctions-1511.03333"/></url>
<url><loc>https://scifaro.com/en/abs/acyclic-colourings-of-graphs-with-bounded-degree-1511.04207</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclic-colourings-of-graphs-with-bounded-degree-1511.04207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclic-colourings-of-graphs-with-bounded-degree-1511.04207"/></url>
<url><loc>https://scifaro.com/en/abs/multi-clique-width-1511.04479</loc><lastmod>2015-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-clique-width-1511.04479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-clique-width-1511.04479"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-permutation-arrays-from-groups-1511.04494</loc><lastmod>2016-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-permutation-arrays-from-groups-1511.04494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-permutation-arrays-from-groups-1511.04494"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-eccentricity-shortest-paths-in-some-structured-graph-classes-1511.05109</loc><lastmod>2015-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-eccentricity-shortest-paths-in-some-structured-graph-classes-1511.05109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-eccentricity-shortest-paths-in-some-structured-graph-classes-1511.05109"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-existence-of-tree-backbones-that-realize-the-chromatic-number-on-a-backbone-coloring-1511.05398</loc><lastmod>2015-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-existence-of-tree-backbones-that-realize-the-chromatic-number-on-a-backbone-coloring-1511.05398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-existence-of-tree-backbones-that-realize-the-chromatic-number-on-a-backbone-coloring-1511.05398"/></url>
<url><loc>https://scifaro.com/en/abs/edge-b-coloring-trees-1511.05422</loc><lastmod>2015-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-b-coloring-trees-1511.05422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-b-coloring-trees-1511.05422"/></url>
<url><loc>https://scifaro.com/en/abs/better-s-t-tours-by-gao-trees-1511.05514</loc><lastmod>2015-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-s-t-tours-by-gao-trees-1511.05514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-s-t-tours-by-gao-trees-1511.05514"/></url>
<url><loc>https://scifaro.com/en/abs/trees-with-small-b-chromatic-index-1511.05847</loc><lastmod>2015-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-with-small-b-chromatic-index-1511.05847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-with-small-b-chromatic-index-1511.05847"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-and-random-generation-of-unlabeled-classes-of-graphs-a-practical-study-of-cycle-pointing-and-the-dissymmetry-theorem-1511.06037</loc><lastmod>2015-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-and-random-generation-of-unlabeled-classes-of-graphs-a-practical-study-of-cycle-pointing-and-the-dissymmetry-theorem-1511.06037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-and-random-generation-of-unlabeled-classes-of-graphs-a-practical-study-of-cycle-pointing-and-the-dissymmetry-theorem-1511.06037"/></url>
<url><loc>https://scifaro.com/en/abs/matchings-of-quadratic-size-extend-to-long-cycles-in-hypercubes-1511.06568</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matchings-of-quadratic-size-extend-to-long-cycles-in-hypercubes-1511.06568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matchings-of-quadratic-size-extend-to-long-cycles-in-hypercubes-1511.06568"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-total-k-r-domination-number-of-random-graphs-1511.07249</loc><lastmod>2015-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-total-k-r-domination-number-of-random-graphs-1511.07249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-total-k-r-domination-number-of-random-graphs-1511.07249"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-weight-independent-sets-for-p-7-triangle-free-graphs-in-polynomial-time-1511.08066</loc><lastmod>2016-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-weight-independent-sets-for-p-7-triangle-free-graphs-in-polynomial-time-1511.08066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-weight-independent-sets-for-p-7-triangle-free-graphs-in-polynomial-time-1511.08066"/></url>
<url><loc>https://scifaro.com/en/abs/on-bounding-the-difference-between-the-maximum-degree-and-the-chromatic-number-by-a-constant-1511.08403</loc><lastmod>2016-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bounding-the-difference-between-the-maximum-degree-and-the-chromatic-number-by-a-constant-1511.08403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bounding-the-difference-between-the-maximum-degree-and-the-chromatic-number-by-a-constant-1511.08403"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-constructions-of-optimal-m-n-4-2-optical-orthogonal-signature-pattern-codes-1511.09289</loc><lastmod>2016-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-constructions-of-optimal-m-n-4-2-optical-orthogonal-signature-pattern-codes-1511.09289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-constructions-of-optimal-m-n-4-2-optical-orthogonal-signature-pattern-codes-1511.09289"/></url>
<url><loc>https://scifaro.com/en/abs/the-role-of-twins-in-computing-planar-supports-of-hypergraphs-1511.09389</loc><lastmod>2022-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-role-of-twins-in-computing-planar-supports-of-hypergraphs-1511.09389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-role-of-twins-in-computing-planar-supports-of-hypergraphs-1511.09389"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-the-equational-properties-of-the-well-founded-fixed-point-1511.09423</loc><lastmod>2015-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-the-equational-properties-of-the-well-founded-fixed-point-1511.09423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-the-equational-properties-of-the-well-founded-fixed-point-1511.09423"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-diameter-of-hyperbolic-random-graphs-1512.00184</loc><lastmod>2015-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-diameter-of-hyperbolic-random-graphs-1512.00184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-diameter-of-hyperbolic-random-graphs-1512.00184"/></url>
<url><loc>https://scifaro.com/en/abs/a-connected-multidimensional-maximum-bisection-problem-1512.00614</loc><lastmod>2015-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-connected-multidimensional-maximum-bisection-problem-1512.00614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-connected-multidimensional-maximum-bisection-problem-1512.00614"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-hidden-structure-in-selecting-dimensions-that-distinguish-vectors-1512.01150</loc><lastmod>2017-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-hidden-structure-in-selecting-dimensions-that-distinguish-vectors-1512.01150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-hidden-structure-in-selecting-dimensions-that-distinguish-vectors-1512.01150"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-bounds-for-decoupling-with-applications-1512.01603</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-bounds-for-decoupling-with-applications-1512.01603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-bounds-for-decoupling-with-applications-1512.01603"/></url>
<url><loc>https://scifaro.com/en/abs/on-konig-egervary-collections-of-maximum-critical-independent-sets-1512.01994</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-konig-egervary-collections-of-maximum-critical-independent-sets-1512.01994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-konig-egervary-collections-of-maximum-critical-independent-sets-1512.01994"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-scatter-tsp-on-a-regular-grid-1512.02054</loc><lastmod>2017-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-scatter-tsp-on-a-regular-grid-1512.02054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-scatter-tsp-on-a-regular-grid-1512.02054"/></url>
<url><loc>https://scifaro.com/en/abs/right-jumps-and-pattern-avoiding-permutations-1512.02171</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/right-jumps-and-pattern-avoiding-permutations-1512.02171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/right-jumps-and-pattern-avoiding-permutations-1512.02171"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-partitioning-into-disjoint-cliques-and-a-triangle-free-graph-1512.02207</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-partitioning-into-disjoint-cliques-and-a-triangle-free-graph-1512.02207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-partitioning-into-disjoint-cliques-and-a-triangle-free-graph-1512.02207"/></url>
<url><loc>https://scifaro.com/en/abs/even-and-odd-cycles-passing-a-given-edge-or-a-vertex-1512.02443</loc><lastmod>2015-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/even-and-odd-cycles-passing-a-given-edge-or-a-vertex-1512.02443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/even-and-odd-cycles-passing-a-given-edge-or-a-vertex-1512.02443"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-disjoint-matchings-and-some-inequalities-1512.02546</loc><lastmod>2025-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-disjoint-matchings-and-some-inequalities-1512.02546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-disjoint-matchings-and-some-inequalities-1512.02546"/></url>
<url><loc>https://scifaro.com/en/abs/the-minimum-volume-of-subspace-trades-1512.02592</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-minimum-volume-of-subspace-trades-1512.02592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-minimum-volume-of-subspace-trades-1512.02592"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-orthogonality-in-construction-a-lattices-1512.02734</loc><lastmod>2015-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-orthogonality-in-construction-a-lattices-1512.02734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-orthogonality-in-construction-a-lattices-1512.02734"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-of-the-graph-isomorphism-problem-to-equality-checking-of-n-variables-polynomials-and-the-algorithms-that-use-the-reduction-1512.03139</loc><lastmod>2024-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-of-the-graph-isomorphism-problem-to-equality-checking-of-n-variables-polynomials-and-the-algorithms-that-use-the-reduction-1512.03139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-of-the-graph-isomorphism-problem-to-equality-checking-of-n-variables-polynomials-and-the-algorithms-that-use-the-reduction-1512.03139"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-find-the-least-upper-bound-on-the-van-der-waerden-number-w-r-k-that-is-some-integer-power-of-the-coloring-integer-r-1512.03631</loc><lastmod>2016-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-find-the-least-upper-bound-on-the-van-der-waerden-number-w-r-k-that-is-some-integer-power-of-the-coloring-integer-r-1512.03631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-find-the-least-upper-bound-on-the-van-der-waerden-number-w-r-k-that-is-some-integer-power-of-the-coloring-integer-r-1512.03631"/></url>
<url><loc>https://scifaro.com/en/abs/parameterizing-edge-modification-problems-above-lower-bounds-1512.04047</loc><lastmod>2019-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterizing-edge-modification-problems-above-lower-bounds-1512.04047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterizing-edge-modification-problems-above-lower-bounds-1512.04047"/></url>
<url><loc>https://scifaro.com/en/abs/co-clustering-under-the-maximum-norm-1512.05693</loc><lastmod>2019-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/co-clustering-under-the-maximum-norm-1512.05693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/co-clustering-under-the-maximum-norm-1512.05693"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-shelling-antimatroids-of-split-graphs-1512.06073</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-shelling-antimatroids-of-split-graphs-1512.06073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-shelling-antimatroids-of-split-graphs-1512.06073"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-the-domination-numbers-of-connected-graphs-without-short-cycles-1512.06338</loc><lastmod>2016-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-the-domination-numbers-of-connected-graphs-without-short-cycles-1512.06338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-the-domination-numbers-of-connected-graphs-without-short-cycles-1512.06338"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-of-edge-intersecting-and-non-splitting-one-bend-paths-in-a-grid-1512.06440</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-of-edge-intersecting-and-non-splitting-one-bend-paths-in-a-grid-1512.06440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-of-edge-intersecting-and-non-splitting-one-bend-paths-in-a-grid-1512.06440"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-cardinality-cut-problem-is-polynomial-in-proper-interval-graphs-1512.06893</loc><lastmod>2015-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-cardinality-cut-problem-is-polynomial-in-proper-interval-graphs-1512.06893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-cardinality-cut-problem-is-polynomial-in-proper-interval-graphs-1512.06893"/></url>
<url><loc>https://scifaro.com/en/abs/covering-arrays-on-product-graphs-1512.06966</loc><lastmod>2015-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-arrays-on-product-graphs-1512.06966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-arrays-on-product-graphs-1512.06966"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-proof-of-the-first-selection-lemma-and-weak-frac-1-r-nets-for-moving-points-1512.07505</loc><lastmod>2015-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-proof-of-the-first-selection-lemma-and-weak-frac-1-r-nets-for-moving-points-1512.07505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-proof-of-the-first-selection-lemma-and-weak-frac-1-r-nets-for-moving-points-1512.07505"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-topological-entropy-based-approach-for-measuring-similarities-among-piecewise-linear-functions-1512.07613</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-topological-entropy-based-approach-for-measuring-similarities-among-piecewise-linear-functions-1512.07613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-topological-entropy-based-approach-for-measuring-similarities-among-piecewise-linear-functions-1512.07613"/></url>
<url><loc>https://scifaro.com/en/abs/hangable-graphs-1512.07767</loc><lastmod>2016-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hangable-graphs-1512.07767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hangable-graphs-1512.07767"/></url>
<url><loc>https://scifaro.com/en/abs/colouring-diamond-free-graphs-1512.07849</loc><lastmod>2016-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colouring-diamond-free-graphs-1512.07849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colouring-diamond-free-graphs-1512.07849"/></url>
<url><loc>https://scifaro.com/en/abs/simple-set-cardinality-estimation-through-random-sampling-1512.07901</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-set-cardinality-estimation-through-random-sampling-1512.07901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-set-cardinality-estimation-through-random-sampling-1512.07901"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-pentagrid-with-two-states-1512.07988</loc><lastmod>2016-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-pentagrid-with-two-states-1512.07988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-pentagrid-with-two-states-1512.07988"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-graphs-based-on-homotopy-equivalence-homotopy-equivalent-graphs-basic-graphs-and-complexity-of-homotopy-equivalence-classes-of-graphs-1512.07989</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-graphs-based-on-homotopy-equivalence-homotopy-equivalent-graphs-basic-graphs-and-complexity-of-homotopy-equivalence-classes-of-graphs-1512.07989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-graphs-based-on-homotopy-equivalence-homotopy-equivalent-graphs-basic-graphs-and-complexity-of-homotopy-equivalence-classes-of-graphs-1512.07989"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithms-for-exact-and-approximate-boolean-matrix-decomposition-1512.08041</loc><lastmod>2015-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithms-for-exact-and-approximate-boolean-matrix-decomposition-1512.08041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithms-for-exact-and-approximate-boolean-matrix-decomposition-1512.08041"/></url>
<url><loc>https://scifaro.com/en/abs/toward-a-6-5-bound-for-the-minimum-cost-2-edge-connected-spanning-subgraph-problem-1512.08070</loc><lastmod>2016-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-a-6-5-bound-for-the-minimum-cost-2-edge-connected-spanning-subgraph-problem-1512.08070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-a-6-5-bound-for-the-minimum-cost-2-edge-connected-spanning-subgraph-problem-1512.08070"/></url>
<url><loc>https://scifaro.com/en/abs/improper-graceful-and-odd-graceful-labellings-of-graph-theory-1512.08634</loc><lastmod>2015-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improper-graceful-and-odd-graceful-labellings-of-graph-theory-1512.08634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improper-graceful-and-odd-graceful-labellings-of-graph-theory-1512.08634"/></url>
<url><loc>https://scifaro.com/en/abs/general-cut-generating-procedures-for-the-stable-set-polytope-1512.08757</loc><lastmod>2017-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-cut-generating-procedures-for-the-stable-set-polytope-1512.08757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-cut-generating-procedures-for-the-stable-set-polytope-1512.08757"/></url>
<url><loc>https://scifaro.com/en/abs/neighborhood-covering-and-independence-on-two-superclasses-of-cographs-1601.00032</loc><lastmod>2016-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighborhood-covering-and-independence-on-two-superclasses-of-cographs-1601.00032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighborhood-covering-and-independence-on-two-superclasses-of-cographs-1601.00032"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-online-colouring-with-buffering-1601.00252</loc><lastmod>2016-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-online-colouring-with-buffering-1601.00252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-online-colouring-with-buffering-1601.00252"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-distribution-of-the-median-and-other-robust-estimators-on-uncertain-data-1601.00630</loc><lastmod>2018-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-distribution-of-the-median-and-other-robust-estimators-on-uncertain-data-1601.00630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-distribution-of-the-median-and-other-robust-estimators-on-uncertain-data-1601.00630"/></url>
<url><loc>https://scifaro.com/en/abs/three-coloring-triangle-free-graphs-on-surfaces-vii-a-linear-time-algorithm-1601.01197</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-coloring-triangle-free-graphs-on-surfaces-vii-a-linear-time-algorithm-1601.01197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-coloring-triangle-free-graphs-on-surfaces-vii-a-linear-time-algorithm-1601.01197"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-a-triangle-free-planar-graph-into-a-forest-and-a-forest-of-bounded-degree-1601.01523</loc><lastmod>2016-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-a-triangle-free-planar-graph-into-a-forest-and-a-forest-of-bounded-degree-1601.01523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-a-triangle-free-planar-graph-into-a-forest-and-a-forest-of-bounded-degree-1601.01523"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-choosability-with-a-small-palette-of-colors-1601.01768</loc><lastmod>2017-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-choosability-with-a-small-palette-of-colors-1601.01768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-choosability-with-a-small-palette-of-colors-1601.01768"/></url>
<url><loc>https://scifaro.com/en/abs/acyclicity-in-edge-colored-graphs-1601.01824</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclicity-in-edge-colored-graphs-1601.01824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclicity-in-edge-colored-graphs-1601.01824"/></url>
<url><loc>https://scifaro.com/en/abs/improper-twin-edge-coloring-of-graphs-1601.02267</loc><lastmod>2016-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improper-twin-edge-coloring-of-graphs-1601.02267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improper-twin-edge-coloring-of-graphs-1601.02267"/></url>
<url><loc>https://scifaro.com/en/abs/energy-efficient-routing-of-hybrid-vehicles-1601.02371</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/energy-efficient-routing-of-hybrid-vehicles-1601.02371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/energy-efficient-routing-of-hybrid-vehicles-1601.02371"/></url>
<url><loc>https://scifaro.com/en/abs/new-integrality-gap-results-for-the-firefighters-problem-on-trees-1601.02388</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-integrality-gap-results-for-the-firefighters-problem-on-trees-1601.02388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-integrality-gap-results-for-the-firefighters-problem-on-trees-1601.02388"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-thue-games-1601.02453</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-thue-games-1601.02453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-thue-games-1601.02453"/></url>
<url><loc>https://scifaro.com/en/abs/similarity-first-search-a-new-algorithm-with-application-to-robinsonian-matrix-recognition-1601.03521</loc><lastmod>2016-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/similarity-first-search-a-new-algorithm-with-application-to-robinsonian-matrix-recognition-1601.03521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/similarity-first-search-a-new-algorithm-with-application-to-robinsonian-matrix-recognition-1601.03521"/></url>
<url><loc>https://scifaro.com/en/abs/protection-of-flows-under-targeted-attacks-1601.03603</loc><lastmod>2016-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/protection-of-flows-under-targeted-attacks-1601.03603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/protection-of-flows-under-targeted-attacks-1601.03603"/></url>
<url><loc>https://scifaro.com/en/abs/adjacencies-in-permutations-1601.04469</loc><lastmod>2016-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjacencies-in-permutations-1601.04469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjacencies-in-permutations-1601.04469"/></url>
<url><loc>https://scifaro.com/en/abs/gauss-bonnet-for-multi-linear-valuations-1601.04533</loc><lastmod>2016-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gauss-bonnet-for-multi-linear-valuations-1601.04533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gauss-bonnet-for-multi-linear-valuations-1601.04533"/></url>
<url><loc>https://scifaro.com/en/abs/separating-hash-families-a-johnson-type-bound-and-new-constructions-1601.04807</loc><lastmod>2016-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-hash-families-a-johnson-type-bound-and-new-constructions-1601.04807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-hash-families-a-johnson-type-bound-and-new-constructions-1601.04807"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-for-consensus-systems-convergence-1601.04975</loc><lastmod>2016-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-for-consensus-systems-convergence-1601.04975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-for-consensus-systems-convergence-1601.04975"/></url>
<url><loc>https://scifaro.com/en/abs/solvability-of-matrix-exponential-equations-1601.05002</loc><lastmod>2017-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solvability-of-matrix-exponential-equations-1601.05002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solvability-of-matrix-exponential-equations-1601.05002"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-edge-isoperimetric-numbers-and-regular-graphs-1601.05190</loc><lastmod>2016-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-edge-isoperimetric-numbers-and-regular-graphs-1601.05190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-edge-isoperimetric-numbers-and-regular-graphs-1601.05190"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decomposition-of-generalized-additive-independence-models-1601.05978</loc><lastmod>2016-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decomposition-of-generalized-additive-independence-models-1601.05978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decomposition-of-generalized-additive-independence-models-1601.05978"/></url>
<url><loc>https://scifaro.com/en/abs/flip-distance-to-a-non-crossing-perfect-matching-1601.05989</loc><lastmod>2016-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-distance-to-a-non-crossing-perfect-matching-1601.05989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-distance-to-a-non-crossing-perfect-matching-1601.05989"/></url>
<url><loc>https://scifaro.com/en/abs/fortuitous-sequences-of-flips-of-the-top-of-a-stack-of-n-burnt-pancakes-for-all-n-24-1601.06278</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fortuitous-sequences-of-flips-of-the-top-of-a-stack-of-n-burnt-pancakes-for-all-n-24-1601.06278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fortuitous-sequences-of-flips-of-the-top-of-a-stack-of-n-burnt-pancakes-for-all-n-24-1601.06278"/></url>
<url><loc>https://scifaro.com/en/abs/non-overlapping-matrices-1601.07723</loc><lastmod>2016-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-overlapping-matrices-1601.07723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-overlapping-matrices-1601.07723"/></url>
<url><loc>https://scifaro.com/en/abs/universality-of-causal-graph-dynamics-1602.01352</loc><lastmod>2016-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universality-of-causal-graph-dynamics-1602.01352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universality-of-causal-graph-dynamics-1602.01352"/></url>
<url><loc>https://scifaro.com/en/abs/orientations-of-simplices-determined-by-orderings-on-the-coordinates-of-their-vertices-1602.01641</loc><lastmod>2016-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orientations-of-simplices-determined-by-orderings-on-the-coordinates-of-their-vertices-1602.01641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orientations-of-simplices-determined-by-orderings-on-the-coordinates-of-their-vertices-1602.01641"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-the-excluded-grid-theorem-1602.02629</loc><lastmod>2016-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-the-excluded-grid-theorem-1602.02629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-the-excluded-grid-theorem-1602.02629"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-sanders-freiman-ruzsa-theorem-in-mathbb-f-p-n-and-its-application-to-non-malleable-codes-1602.02788</loc><lastmod>2016-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-sanders-freiman-ruzsa-theorem-in-mathbb-f-p-n-and-its-application-to-non-malleable-codes-1602.02788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-sanders-freiman-ruzsa-theorem-in-mathbb-f-p-n-and-its-application-to-non-malleable-codes-1602.02788"/></url>
<url><loc>https://scifaro.com/en/abs/weak-oddness-as-an-approximation-of-oddness-and-resistance-in-cubic-graphs-1602.02949</loc><lastmod>2016-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-oddness-as-an-approximation-of-oddness-and-resistance-in-cubic-graphs-1602.02949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-oddness-as-an-approximation-of-oddness-and-resistance-in-cubic-graphs-1602.02949"/></url>
<url><loc>https://scifaro.com/en/abs/on-christoffel-and-standard-words-and-their-derivatives-1602.03231</loc><lastmod>2016-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-christoffel-and-standard-words-and-their-derivatives-1602.03231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-christoffel-and-standard-words-and-their-derivatives-1602.03231"/></url>
<url><loc>https://scifaro.com/en/abs/hitting-families-of-schedules-for-asynchronous-programs-1602.03755</loc><lastmod>2016-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hitting-families-of-schedules-for-asynchronous-programs-1602.03755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hitting-families-of-schedules-for-asynchronous-programs-1602.03755"/></url>
<url><loc>https://scifaro.com/en/abs/row-constrained-effective-sets-of-colourings-in-the-2-fold-horocyclic-tessellations-of-mathbb-h-2-are-sofic-1602.04061</loc><lastmod>2016-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/row-constrained-effective-sets-of-colourings-in-the-2-fold-horocyclic-tessellations-of-mathbb-h-2-are-sofic-1602.04061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/row-constrained-effective-sets-of-colourings-in-the-2-fold-horocyclic-tessellations-of-mathbb-h-2-are-sofic-1602.04061"/></url>
<url><loc>https://scifaro.com/en/abs/systematic-and-deterministic-graph-minor-embedding-for-cartesian-products-of-graphs-1602.04274</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/systematic-and-deterministic-graph-minor-embedding-for-cartesian-products-of-graphs-1602.04274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/systematic-and-deterministic-graph-minor-embedding-for-cartesian-products-of-graphs-1602.04274"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-4-connected-components-1602.04505</loc><lastmod>2016-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-4-connected-components-1602.04505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-4-connected-components-1602.04505"/></url>
<url><loc>https://scifaro.com/en/abs/on-minimum-maximal-distance-k-matchings-1602.04581</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-minimum-maximal-distance-k-matchings-1602.04581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-minimum-maximal-distance-k-matchings-1602.04581"/></url>
<url><loc>https://scifaro.com/en/abs/tangles-and-connectivity-in-graphs-1602.04727</loc><lastmod>2016-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tangles-and-connectivity-in-graphs-1602.04727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tangles-and-connectivity-in-graphs-1602.04727"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-all-the-irreducible-polynomials-over-finite-field-1602.05032</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-all-the-irreducible-polynomials-over-finite-field-1602.05032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-all-the-irreducible-polynomials-over-finite-field-1602.05032"/></url>
<url><loc>https://scifaro.com/en/abs/spectrum-graph-coloring-and-applications-to-wifi-channel-assignment-1602.05038</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectrum-graph-coloring-and-applications-to-wifi-channel-assignment-1602.05038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectrum-graph-coloring-and-applications-to-wifi-channel-assignment-1602.05038"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-condition-for-the-existence-of-transversals-1602.05181</loc><lastmod>2016-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-condition-for-the-existence-of-transversals-1602.05181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-condition-for-the-existence-of-transversals-1602.05181"/></url>
<url><loc>https://scifaro.com/en/abs/average-distance-in-a-general-class-of-scale-free-networks-with-underlying-geometry-1602.05712</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-distance-in-a-general-class-of-scale-free-networks-with-underlying-geometry-1602.05712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-distance-in-a-general-class-of-scale-free-networks-with-underlying-geometry-1602.05712"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-weight-independent-set-in-lclaw-free-graphs-in-polynomial-time-1602.05838</loc><lastmod>2016-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-weight-independent-set-in-lclaw-free-graphs-in-polynomial-time-1602.05838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-weight-independent-set-in-lclaw-free-graphs-in-polynomial-time-1602.05838"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-weighted-greedy-matchings-1602.05909</loc><lastmod>2016-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-weighted-greedy-matchings-1602.05909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-weighted-greedy-matchings-1602.05909"/></url>
<url><loc>https://scifaro.com/en/abs/prime-factoring-and-the-complexity-of-1602.06910</loc><lastmod>2016-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prime-factoring-and-the-complexity-of-1602.06910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prime-factoring-and-the-complexity-of-1602.06910"/></url>
<url><loc>https://scifaro.com/en/abs/periodicity-in-rectangular-arrays-1602.06915</loc><lastmod>2016-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/periodicity-in-rectangular-arrays-1602.06915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/periodicity-in-rectangular-arrays-1602.06915"/></url>
<url><loc>https://scifaro.com/en/abs/on-closure-operators-related-to-maximal-tricliques-in-tripartite-hypergraphs-1602.07267</loc><lastmod>2017-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-closure-operators-related-to-maximal-tricliques-in-tripartite-hypergraphs-1602.07267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-closure-operators-related-to-maximal-tricliques-in-tripartite-hypergraphs-1602.07267"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-additive-chromatic-number-of-several-families-of-graphs-1602.07675</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-additive-chromatic-number-of-several-families-of-graphs-1602.07675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-additive-chromatic-number-of-several-families-of-graphs-1602.07675"/></url>
<url><loc>https://scifaro.com/en/abs/the-cover-time-of-deterministic-random-walks-for-general-transition-probabilities-1602.07729</loc><lastmod>2016-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cover-time-of-deterministic-random-walks-for-general-transition-probabilities-1602.07729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cover-time-of-deterministic-random-walks-for-general-transition-probabilities-1602.07729"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-optimal-1-planar-graphs-in-linear-time-1602.08022</loc><lastmod>2018-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-optimal-1-planar-graphs-in-linear-time-1602.08022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-optimal-1-planar-graphs-in-linear-time-1602.08022"/></url>
<url><loc>https://scifaro.com/en/abs/dijkstra-graphs-1602.08653</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dijkstra-graphs-1602.08653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dijkstra-graphs-1602.08653"/></url>
<url><loc>https://scifaro.com/en/abs/2-distance-colorings-of-integer-distance-graphs-1602.09111</loc><lastmod>2016-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-distance-colorings-of-integer-distance-graphs-1602.09111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-distance-colorings-of-integer-distance-graphs-1602.09111"/></url>
<url><loc>https://scifaro.com/en/abs/more-results-on-weighted-independent-domination-1602.09124</loc><lastmod>2017-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/more-results-on-weighted-independent-domination-1602.09124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/more-results-on-weighted-independent-domination-1602.09124"/></url>
<url><loc>https://scifaro.com/en/abs/edge-stable-equimatchable-graphs-1602.09127</loc><lastmod>2018-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-stable-equimatchable-graphs-1602.09127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-stable-equimatchable-graphs-1602.09127"/></url>
<url><loc>https://scifaro.com/en/abs/large-peg-army-maneuvers-1603.00898</loc><lastmod>2016-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-peg-army-maneuvers-1603.00898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-peg-army-maneuvers-1603.00898"/></url>
<url><loc>https://scifaro.com/en/abs/read-networks-and-k-laminar-graphs-1603.01179</loc><lastmod>2016-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/read-networks-and-k-laminar-graphs-1603.01179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/read-networks-and-k-laminar-graphs-1603.01179"/></url>
<url><loc>https://scifaro.com/en/abs/a-fixed-parameter-algorithm-for-a-routing-open-shop-problem-unit-processing-times-few-machines-and-locations-1603.01191</loc><lastmod>2017-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fixed-parameter-algorithm-for-a-routing-open-shop-problem-unit-processing-times-few-machines-and-locations-1603.01191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fixed-parameter-algorithm-for-a-routing-open-shop-problem-unit-processing-times-few-machines-and-locations-1603.01191"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-cycles-in-a-graph-1603.01807</loc><lastmod>2016-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-cycles-in-a-graph-1603.01807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-cycles-in-a-graph-1603.01807"/></url>
<url><loc>https://scifaro.com/en/abs/hanabi-is-np-hard-even-for-cheaters-who-look-at-their-cards-1603.01911</loc><lastmod>2017-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hanabi-is-np-hard-even-for-cheaters-who-look-at-their-cards-1603.01911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hanabi-is-np-hard-even-for-cheaters-who-look-at-their-cards-1603.01911"/></url>
<url><loc>https://scifaro.com/en/abs/graph-theoretic-investigations-on-inefficiencies-in-network-models-1603.01983</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-theoretic-investigations-on-inefficiencies-in-network-models-1603.01983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-theoretic-investigations-on-inefficiencies-in-network-models-1603.01983"/></url>
<url><loc>https://scifaro.com/en/abs/independent-sets-in-classes-related-to-chair-fork-free-graphs-1603.02011</loc><lastmod>2016-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-sets-in-classes-related-to-chair-fork-free-graphs-1603.02011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-sets-in-classes-related-to-chair-fork-free-graphs-1603.02011"/></url>
<url><loc>https://scifaro.com/en/abs/the-mathematics-of-xenology-di-cographs-symbolic-ultrametrics-2-structures-and-tree-representable-systems-of-binary-relations-1603.02467</loc><lastmod>2016-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mathematics-of-xenology-di-cographs-symbolic-ultrametrics-2-structures-and-tree-representable-systems-of-binary-relations-1603.02467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mathematics-of-xenology-di-cographs-symbolic-ultrametrics-2-structures-and-tree-representable-systems-of-binary-relations-1603.02467"/></url>
<url><loc>https://scifaro.com/en/abs/the-erdos-posa-property-for-directed-graphs-1603.02504</loc><lastmod>2016-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-erdos-posa-property-for-directed-graphs-1603.02504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-erdos-posa-property-for-directed-graphs-1603.02504"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-algorithm-for-brick-wang-tiling-1603.04292</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-algorithm-for-brick-wang-tiling-1603.04292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-algorithm-for-brick-wang-tiling-1603.04292"/></url>
<url><loc>https://scifaro.com/en/abs/recent-techniques-and-results-on-the-erd-h-o-s-p-osa-property-1603.04615</loc><lastmod>2016-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recent-techniques-and-results-on-the-erd-h-o-s-p-osa-property-1603.04615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recent-techniques-and-results-on-the-erd-h-o-s-p-osa-property-1603.04615"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-representing-orthology-relations-by-trees-1603.04632</loc><lastmod>2016-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-representing-orthology-relations-by-trees-1603.04632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-representing-orthology-relations-by-trees-1603.04632"/></url>
<url><loc>https://scifaro.com/en/abs/a-2-542-approximation-for-precedence-constrained-single-machine-scheduling-with-release-dates-and-total-weighted-completion-time-objective-1603.04690</loc><lastmod>2016-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-2-542-approximation-for-precedence-constrained-single-machine-scheduling-with-release-dates-and-total-weighted-completion-time-objective-1603.04690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-2-542-approximation-for-precedence-constrained-single-machine-scheduling-with-release-dates-and-total-weighted-completion-time-objective-1603.04690"/></url>
<url><loc>https://scifaro.com/en/abs/many-to-many-correspondences-between-partitions-introducing-a-cut-based-approach-1603.04788</loc><lastmod>2018-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-to-many-correspondences-between-partitions-introducing-a-cut-based-approach-1603.04788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-to-many-correspondences-between-partitions-introducing-a-cut-based-approach-1603.04788"/></url>
<url><loc>https://scifaro.com/en/abs/splines-and-wavelets-on-circulant-graphs-1603.04917</loc><lastmod>2017-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/splines-and-wavelets-on-circulant-graphs-1603.04917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/splines-and-wavelets-on-circulant-graphs-1603.04917"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-complementarity-based-characterization-of-the-weighted-independence-number-and-the-independent-domination-number-in-graphs-1603.05075</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-complementarity-based-characterization-of-the-weighted-independence-number-and-the-independent-domination-number-in-graphs-1603.05075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-complementarity-based-characterization-of-the-weighted-independence-number-and-the-independent-domination-number-in-graphs-1603.05075"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-identifiable-subgraph-problem-revisited-1603.06226</loc><lastmod>2016-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-identifiable-subgraph-problem-revisited-1603.06226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-identifiable-subgraph-problem-revisited-1603.06226"/></url>
<url><loc>https://scifaro.com/en/abs/popular-matchings-with-two-sided-preferences-and-one-sided-ties-1603.07168</loc><lastmod>2016-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/popular-matchings-with-two-sided-preferences-and-one-sided-ties-1603.07168"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/popular-matchings-with-two-sided-preferences-and-one-sided-ties-1603.07168"/></url>
<url><loc>https://scifaro.com/en/abs/pre-expansivity-in-cellular-automata-1603.07215</loc><lastmod>2019-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pre-expansivity-in-cellular-automata-1603.07215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pre-expansivity-in-cellular-automata-1603.07215"/></url>
<url><loc>https://scifaro.com/en/abs/heredity-for-generalized-power-domination-1603.07243</loc><lastmod>2016-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heredity-for-generalized-power-domination-1603.07243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heredity-for-generalized-power-domination-1603.07243"/></url>
<url><loc>https://scifaro.com/en/abs/all-binomial-identities-are-orderable-1603.08743</loc><lastmod>2016-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-binomial-identities-are-orderable-1603.08743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-binomial-identities-are-orderable-1603.08743"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-gray-codes-with-prescribed-ends-1603.08827</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-gray-codes-with-prescribed-ends-1603.08827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-gray-codes-with-prescribed-ends-1603.08827"/></url>
<url><loc>https://scifaro.com/en/abs/a-comprehensive-theory-of-cascading-via-paths-and-the-reciprocal-pointer-chain-method-1603.09205</loc><lastmod>2016-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comprehensive-theory-of-cascading-via-paths-and-the-reciprocal-pointer-chain-method-1603.09205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comprehensive-theory-of-cascading-via-paths-and-the-reciprocal-pointer-chain-method-1603.09205"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-bounded-expansion-by-neighbourhood-complexity-1603.09532</loc><lastmod>2016-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-bounded-expansion-by-neighbourhood-complexity-1603.09532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-bounded-expansion-by-neighbourhood-complexity-1603.09532"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-special-class-of-boxicity-2-graphs-1603.09561</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-special-class-of-boxicity-2-graphs-1603.09561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-special-class-of-boxicity-2-graphs-1603.09561"/></url>
<url><loc>https://scifaro.com/en/abs/on-local-structures-of-cubicity-2-graphs-1603.09570</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-local-structures-of-cubicity-2-graphs-1603.09570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-local-structures-of-cubicity-2-graphs-1603.09570"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-local-information-in-pagerank-1604.00202</loc><lastmod>2016-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-local-information-in-pagerank-1604.00202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-local-information-in-pagerank-1604.00202"/></url>
<url><loc>https://scifaro.com/en/abs/characterizations-of-the-connected-forcing-number-of-a-graph-1604.00740</loc><lastmod>2016-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizations-of-the-connected-forcing-number-of-a-graph-1604.00740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizations-of-the-connected-forcing-number-of-a-graph-1604.00740"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiable-hitting-clause-sets-with-three-more-clauses-than-variables-1604.01288</loc><lastmod>2016-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-hitting-clause-sets-with-three-more-clauses-than-variables-1604.01288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-hitting-clause-sets-with-three-more-clauses-than-variables-1604.01288"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-of-mcmc-and-loopy-bp-in-the-tree-uniqueness-region-for-the-hard-core-model-1604.01422</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-of-mcmc-and-loopy-bp-in-the-tree-uniqueness-region-for-the-hard-core-model-1604.01422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-of-mcmc-and-loopy-bp-in-the-tree-uniqueness-region-for-the-hard-core-model-1604.01422"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-number-of-distinct-and-nonequivalent-nonstandard-squares-in-a-word-1604.02238</loc><lastmod>2016-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-number-of-distinct-and-nonequivalent-nonstandard-squares-in-a-word-1604.02238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-number-of-distinct-and-nonequivalent-nonstandard-squares-in-a-word-1604.02238"/></url>
<url><loc>https://scifaro.com/en/abs/on-4-critical-t-perfect-graphs-1604.02288</loc><lastmod>2016-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-4-critical-t-perfect-graphs-1604.02288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-4-critical-t-perfect-graphs-1604.02288"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-the-membership-problem-for-2-times-2-integer-matrices-1604.02303</loc><lastmod>2016-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-the-membership-problem-for-2-times-2-integer-matrices-1604.02303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-the-membership-problem-for-2-times-2-integer-matrices-1604.02303"/></url>
<url><loc>https://scifaro.com/en/abs/the-salesman-s-improved-paths-3-2-1-34-integrality-gap-and-approximation-ratio-1604.02486</loc><lastmod>2018-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-salesman-s-improved-paths-3-2-1-34-integrality-gap-and-approximation-ratio-1604.02486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-salesman-s-improved-paths-3-2-1-34-integrality-gap-and-approximation-ratio-1604.02486"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-binary-matrices-related-to-bipartite-graphs-1604.02714</loc><lastmod>2016-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-binary-matrices-related-to-bipartite-graphs-1604.02714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-binary-matrices-related-to-bipartite-graphs-1604.02714"/></url>
<url><loc>https://scifaro.com/en/abs/the-vulnerability-of-the-diameter-of-enhanced-hypercubes-1604.02906</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vulnerability-of-the-diameter-of-enhanced-hypercubes-1604.02906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vulnerability-of-the-diameter-of-enhanced-hypercubes-1604.02906"/></url>
<url><loc>https://scifaro.com/en/abs/a-heuristic-approach-for-dividing-graphs-into-bi-connected-components-with-a-size-constraint-1604.04829</loc><lastmod>2016-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-heuristic-approach-for-dividing-graphs-into-bi-connected-components-with-a-size-constraint-1604.04829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-heuristic-approach-for-dividing-graphs-into-bi-connected-components-with-a-size-constraint-1604.04829"/></url>
<url><loc>https://scifaro.com/en/abs/fault-tolerant-supergraphs-with-automorphisms-1604.04855</loc><lastmod>2017-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fault-tolerant-supergraphs-with-automorphisms-1604.04855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fault-tolerant-supergraphs-with-automorphisms-1604.04855"/></url>
<url><loc>https://scifaro.com/en/abs/routing-and-sorting-via-matchings-on-graphs-1604.04978</loc><lastmod>2016-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-and-sorting-via-matchings-on-graphs-1604.04978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-and-sorting-via-matchings-on-graphs-1604.04978"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-the-maximum-carpool-matching-problem-1604.05609</loc><lastmod>2016-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-maximum-carpool-matching-problem-1604.05609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-maximum-carpool-matching-problem-1604.05609"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-subgraph-bounds-for-parallel-repetition-and-the-density-hales-jewett-theorem-1604.05757</loc><lastmod>2016-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-subgraph-bounds-for-parallel-repetition-and-the-density-hales-jewett-theorem-1604.05757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-subgraph-bounds-for-parallel-repetition-and-the-density-hales-jewett-theorem-1604.05757"/></url>
<url><loc>https://scifaro.com/en/abs/circular-backbone-colorings-on-matching-and-tree-backbones-of-planar-graphs-1604.05958</loc><lastmod>2016-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circular-backbone-colorings-on-matching-and-tree-backbones-of-planar-graphs-1604.05958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circular-backbone-colorings-on-matching-and-tree-backbones-of-planar-graphs-1604.05958"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithm-for-fault-tolerant-virtual-backbone-in-wireless-sensor-networks-1604.06181</loc><lastmod>2017-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithm-for-fault-tolerant-virtual-backbone-in-wireless-sensor-networks-1604.06181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithm-for-fault-tolerant-virtual-backbone-in-wireless-sensor-networks-1604.06181"/></url>
<url><loc>https://scifaro.com/en/abs/a-parameterized-algorithmics-framework-for-degree-sequence-completion-problems-in-directed-graphs-1604.06302</loc><lastmod>2018-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parameterized-algorithmics-framework-for-degree-sequence-completion-problems-in-directed-graphs-1604.06302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parameterized-algorithmics-framework-for-degree-sequence-completion-problems-in-directed-graphs-1604.06302"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-inference-of-graph-transformation-rules-using-the-cyclic-nature-of-chemical-reactions-1604.06379</loc><lastmod>2016-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-inference-of-graph-transformation-rules-using-the-cyclic-nature-of-chemical-reactions-1604.06379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-inference-of-graph-transformation-rules-using-the-cyclic-nature-of-chemical-reactions-1604.06379"/></url>
<url><loc>https://scifaro.com/en/abs/loopless-gray-code-enumeration-and-the-tower-of-bucharest-1604.06707</loc><lastmod>2018-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/loopless-gray-code-enumeration-and-the-tower-of-bucharest-1604.06707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/loopless-gray-code-enumeration-and-the-tower-of-bucharest-1604.06707"/></url>
<url><loc>https://scifaro.com/en/abs/discordant-voting-processes-on-finite-graphs-1604.06884</loc><lastmod>2016-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discordant-voting-processes-on-finite-graphs-1604.06884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discordant-voting-processes-on-finite-graphs-1604.06884"/></url>
<url><loc>https://scifaro.com/en/abs/uniquely-restricted-matchings-in-interval-graphs-1604.07016</loc><lastmod>2016-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniquely-restricted-matchings-in-interval-graphs-1604.07016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniquely-restricted-matchings-in-interval-graphs-1604.07016"/></url>
<url><loc>https://scifaro.com/en/abs/a-radix-representation-for-each-van-der-waerden-number-w-r-k-with-r-colors-why-log-r-w-r-k-k-2-is-true-whenever-k-is-the-number-of-terms-in-the-arithmetic-progression-1604.07036</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-radix-representation-for-each-van-der-waerden-number-w-r-k-with-r-colors-why-log-r-w-r-k-k-2-is-true-whenever-k-is-the-number-of-terms-in-the-arithmetic-progression-1604.07036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-radix-representation-for-each-van-der-waerden-number-w-r-k-with-r-colors-why-log-r-w-r-k-k-2-is-true-whenever-k-is-the-number-of-terms-in-the-arithmetic-progression-1604.07036"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-grundy-number-of-cameron-graphs-1604.07128</loc><lastmod>2016-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-grundy-number-of-cameron-graphs-1604.07128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-grundy-number-of-cameron-graphs-1604.07128"/></url>
<url><loc>https://scifaro.com/en/abs/discriminators-and-k-regular-sequences-1605.00092</loc><lastmod>2016-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discriminators-and-k-regular-sequences-1605.00092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discriminators-and-k-regular-sequences-1605.00092"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-lower-bound-for-the-weights-of-maximum-weight-matching-in-bipartite-graphs-1605.00406</loc><lastmod>2019-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-lower-bound-for-the-weights-of-maximum-weight-matching-in-bipartite-graphs-1605.00406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-lower-bound-for-the-weights-of-maximum-weight-matching-in-bipartite-graphs-1605.00406"/></url>
<url><loc>https://scifaro.com/en/abs/token-sliding-on-chordal-graphs-1605.00442</loc><lastmod>2016-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/token-sliding-on-chordal-graphs-1605.00442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/token-sliding-on-chordal-graphs-1605.00442"/></url>
<url><loc>https://scifaro.com/en/abs/solving-and-verifying-the-boolean-pythagorean-triples-problem-via-cube-and-conquer-1605.00723</loc><lastmod>2016-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-and-verifying-the-boolean-pythagorean-triples-problem-via-cube-and-conquer-1605.00723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-and-verifying-the-boolean-pythagorean-triples-problem-via-cube-and-conquer-1605.00723"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mathematics-of-data-centre-network-topologies-1605.00863</loc><lastmod>2016-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mathematics-of-data-centre-network-topologies-1605.00863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mathematics-of-data-centre-network-topologies-1605.00863"/></url>
<url><loc>https://scifaro.com/en/abs/2-2-3-sat-problem-and-its-applications-in-dominating-set-problems-1605.01319</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-2-3-sat-problem-and-its-applications-in-dominating-set-problems-1605.01319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-2-3-sat-problem-and-its-applications-in-dominating-set-problems-1605.01319"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-properties-of-hypergraph-laplacian-and-approximation-algorithms-1605.01483</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-properties-of-hypergraph-laplacian-and-approximation-algorithms-1605.01483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-properties-of-hypergraph-laplacian-and-approximation-algorithms-1605.01483"/></url>
<url><loc>https://scifaro.com/en/abs/a-combinatorial-problem-about-binary-necklaces-and-attractors-of-boolean-automata-networks-1605.01505</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-combinatorial-problem-about-binary-necklaces-and-attractors-of-boolean-automata-networks-1605.01505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-combinatorial-problem-about-binary-necklaces-and-attractors-of-boolean-automata-networks-1605.01505"/></url>
<url><loc>https://scifaro.com/en/abs/some-reflections-on-directed-lattice-paths-1605.01687</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-reflections-on-directed-lattice-paths-1605.01687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-reflections-on-directed-lattice-paths-1605.01687"/></url>
<url><loc>https://scifaro.com/en/abs/a-vizing-like-theorem-for-union-vertex-distinguishing-edge-coloring-1605.02588</loc><lastmod>2026-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-vizing-like-theorem-for-union-vertex-distinguishing-edge-coloring-1605.02588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-vizing-like-theorem-for-union-vertex-distinguishing-edge-coloring-1605.02588"/></url>
<url><loc>https://scifaro.com/en/abs/path-additions-of-graphs-1605.02891</loc><lastmod>2016-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/path-additions-of-graphs-1605.02891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/path-additions-of-graphs-1605.02891"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-algorithms-for-permutations-biased-by-their-number-of-records-1605.02905</loc><lastmod>2016-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-algorithms-for-permutations-biased-by-their-number-of-records-1605.02905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-algorithms-for-permutations-biased-by-their-number-of-records-1605.02905"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-paths-of-slope-2-5-1605.02967</loc><lastmod>2016-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-paths-of-slope-2-5-1605.02967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-paths-of-slope-2-5-1605.02967"/></url>
<url><loc>https://scifaro.com/en/abs/unique-reconstruction-threshold-for-random-jigsaw-puzzles-1605.03043</loc><lastmod>2016-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-reconstruction-threshold-for-random-jigsaw-puzzles-1605.03043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-reconstruction-threshold-for-random-jigsaw-puzzles-1605.03043"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-and-topology-of-rooted-weighted-trees-modeling-layered-cyber-security-systems-1605.03569</loc><lastmod>2016-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-and-topology-of-rooted-weighted-trees-modeling-layered-cyber-security-systems-1605.03569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-and-topology-of-rooted-weighted-trees-modeling-layered-cyber-security-systems-1605.03569"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-block-size-of-critical-random-graphs-1605.04340</loc><lastmod>2016-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-block-size-of-critical-random-graphs-1605.04340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-block-size-of-critical-random-graphs-1605.04340"/></url>
<url><loc>https://scifaro.com/en/abs/the-stable-roommates-problem-with-short-lists-1605.04609</loc><lastmod>2017-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stable-roommates-problem-with-short-lists-1605.04609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stable-roommates-problem-with-short-lists-1605.04609"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-shortest-common-superstring-of-ngs-reads-1605.05542</loc><lastmod>2016-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-shortest-common-superstring-of-ngs-reads-1605.05542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-shortest-common-superstring-of-ngs-reads-1605.05542"/></url>
<url><loc>https://scifaro.com/en/abs/axioms-of-the-analytic-hierarchy-process-ahp-and-its-generalization-to-dependence-and-feedback-the-analytic-network-process-anp-1605.05777</loc><lastmod>2016-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axioms-of-the-analytic-hierarchy-process-ahp-and-its-generalization-to-dependence-and-feedback-the-analytic-network-process-anp-1605.05777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axioms-of-the-analytic-hierarchy-process-ahp-and-its-generalization-to-dependence-and-feedback-the-analytic-network-process-anp-1605.05777"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-equitable-partitions-for-efficient-block-triangularization-1605.05924</loc><lastmod>2016-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-equitable-partitions-for-efficient-block-triangularization-1605.05924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-equitable-partitions-for-efficient-block-triangularization-1605.05924"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-geometric-approach-to-nivat-s-conjecture-1605.05929</loc><lastmod>2016-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-geometric-approach-to-nivat-s-conjecture-1605.05929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-geometric-approach-to-nivat-s-conjecture-1605.05929"/></url>
<url><loc>https://scifaro.com/en/abs/parallelizing-asymptotically-optimal-algorithms-for-large-scale-dualization-problems-1605.06692</loc><lastmod>2016-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallelizing-asymptotically-optimal-algorithms-for-large-scale-dualization-problems-1605.06692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallelizing-asymptotically-optimal-algorithms-for-large-scale-dualization-problems-1605.06692"/></url>
<url><loc>https://scifaro.com/en/abs/tangled-up-in-blue-a-survey-on-connectivity-decompositions-and-tangles-1605.06704</loc><lastmod>2016-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tangled-up-in-blue-a-survey-on-connectivity-decompositions-and-tangles-1605.06704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tangled-up-in-blue-a-survey-on-connectivity-decompositions-and-tangles-1605.06704"/></url>
<url><loc>https://scifaro.com/en/abs/experimental-evaluation-of-modified-decomposition-algorithm-for-maximum-weight-bipartite-matching-1605.06989</loc><lastmod>2019-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experimental-evaluation-of-modified-decomposition-algorithm-for-maximum-weight-bipartite-matching-1605.06989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experimental-evaluation-of-modified-decomposition-algorithm-for-maximum-weight-bipartite-matching-1605.06989"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-simple-triangle-graphs-by-restricted-2-chain-subgraph-cover-1605.07322</loc><lastmod>2017-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-simple-triangle-graphs-by-restricted-2-chain-subgraph-cover-1605.07322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-simple-triangle-graphs-by-restricted-2-chain-subgraph-cover-1605.07322"/></url>
<url><loc>https://scifaro.com/en/abs/chi-bounded-families-of-oriented-graphs-1605.07411</loc><lastmod>2016-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chi-bounded-families-of-oriented-graphs-1605.07411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chi-bounded-families-of-oriented-graphs-1605.07411"/></url>
<url><loc>https://scifaro.com/en/abs/edge-complexity-of-geometric-graphs-on-convex-independent-point-sets-1605.08066</loc><lastmod>2017-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-complexity-of-geometric-graphs-on-convex-independent-point-sets-1605.08066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-complexity-of-geometric-graphs-on-convex-independent-point-sets-1605.08066"/></url>
<url><loc>https://scifaro.com/en/abs/hitting-minors-subdivisions-and-immersions-in-tournaments-1605.08366</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hitting-minors-subdivisions-and-immersions-in-tournaments-1605.08366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hitting-minors-subdivisions-and-immersions-in-tournaments-1605.08366"/></url>
<url><loc>https://scifaro.com/en/abs/fast-plurality-consensus-in-regular-expanders-1605.08403</loc><lastmod>2017-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-plurality-consensus-in-regular-expanders-1605.08403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-plurality-consensus-in-regular-expanders-1605.08403"/></url>
<url><loc>https://scifaro.com/en/abs/induced-minor-free-graphs-isomorphism-and-clique-width-1605.08540</loc><lastmod>2016-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induced-minor-free-graphs-isomorphism-and-clique-width-1605.08540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induced-minor-free-graphs-isomorphism-and-clique-width-1605.08540"/></url>
<url><loc>https://scifaro.com/en/abs/k-neighborhood-for-cellular-automata-1605.08870</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-neighborhood-for-cellular-automata-1605.08870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-neighborhood-for-cellular-automata-1605.08870"/></url>
<url><loc>https://scifaro.com/en/abs/a-study-of-k-dipath-colourings-of-oriented-graphs-1605.08905</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-study-of-k-dipath-colourings-of-oriented-graphs-1605.08905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-study-of-k-dipath-colourings-of-oriented-graphs-1605.08905"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-tessellation-9-3-1605.09518</loc><lastmod>2016-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-tessellation-9-3-1605.09518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-tessellation-9-3-1605.09518"/></url>
<url><loc>https://scifaro.com/en/abs/on-strictly-chordality-k-graphs-1606.00359</loc><lastmod>2017-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-strictly-chordality-k-graphs-1606.00359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-strictly-chordality-k-graphs-1606.00359"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-theoretical-analysis-of-low-power-coding-schemes-for-one-hop-networks-1606.00974</loc><lastmod>2016-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-theoretical-analysis-of-low-power-coding-schemes-for-one-hop-networks-1606.00974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-theoretical-analysis-of-low-power-coding-schemes-for-one-hop-networks-1606.00974"/></url>
<url><loc>https://scifaro.com/en/abs/packing-coloring-of-undirected-and-oriented-generalized-theta-graphs-1606.01107</loc><lastmod>2016-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-coloring-of-undirected-and-oriented-generalized-theta-graphs-1606.01107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-coloring-of-undirected-and-oriented-generalized-theta-graphs-1606.01107"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-calculus-of-finite-sequences-1606.02182</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-calculus-of-finite-sequences-1606.02182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-calculus-of-finite-sequences-1606.02182"/></url>
<url><loc>https://scifaro.com/en/abs/some-algorithmic-results-on-restrained-domination-in-graphs-1606.02340</loc><lastmod>2016-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-algorithmic-results-on-restrained-domination-in-graphs-1606.02340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-algorithmic-results-on-restrained-domination-in-graphs-1606.02340"/></url>
<url><loc>https://scifaro.com/en/abs/neighborhood-preserving-translations-on-graphs-1606.02479</loc><lastmod>2016-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighborhood-preserving-translations-on-graphs-1606.02479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighborhood-preserving-translations-on-graphs-1606.02479"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-trajectories-and-reversibility-in-boolean-automata-networks-1606.02613</loc><lastmod>2017-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-trajectories-and-reversibility-in-boolean-automata-networks-1606.02613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-trajectories-and-reversibility-in-boolean-automata-networks-1606.02613"/></url>
<url><loc>https://scifaro.com/en/abs/anti-powers-in-infinite-words-1606.02868</loc><lastmod>2018-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anti-powers-in-infinite-words-1606.02868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anti-powers-in-infinite-words-1606.02868"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-extension-of-dirac-s-theorem-on-hamiltonicity-1606.03687</loc><lastmod>2016-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-extension-of-dirac-s-theorem-on-hamiltonicity-1606.03687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-extension-of-dirac-s-theorem-on-hamiltonicity-1606.03687"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-tessellation-8-3-1606.03938</loc><lastmod>2016-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-tessellation-8-3-1606.03938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-on-the-tessellation-8-3-1606.03938"/></url>
<url><loc>https://scifaro.com/en/abs/avoidability-of-formulas-with-two-variables-1606.03955</loc><lastmod>2016-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoidability-of-formulas-with-two-variables-1606.03955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoidability-of-formulas-with-two-variables-1606.03955"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-sparse-graphs-into-an-independent-set-and-a-forest-of-bounded-degree-1606.04394</loc><lastmod>2016-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-sparse-graphs-into-an-independent-set-and-a-forest-of-bounded-degree-1606.04394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-sparse-graphs-into-an-independent-set-and-a-forest-of-bounded-degree-1606.04394"/></url>
<url><loc>https://scifaro.com/en/abs/average-shortest-path-length-of-graphs-of-diameter-3-1606.05119</loc><lastmod>2016-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-shortest-path-length-of-graphs-of-diameter-3-1606.05119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-shortest-path-length-of-graphs-of-diameter-3-1606.05119"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-simulation-of-boolean-networks-by-monotone-boolean-networks-1606.05172</loc><lastmod>2016-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-simulation-of-boolean-networks-by-monotone-boolean-networks-1606.05172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-simulation-of-boolean-networks-by-monotone-boolean-networks-1606.05172"/></url>
<url><loc>https://scifaro.com/en/abs/f-index-of-total-transformation-graphs-1606.05989</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/f-index-of-total-transformation-graphs-1606.05989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/f-index-of-total-transformation-graphs-1606.05989"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-time-algorithm-for-middle-levels-gray-codes-1606.06172</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-time-algorithm-for-middle-levels-gray-codes-1606.06172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-time-algorithm-for-middle-levels-gray-codes-1606.06172"/></url>
<url><loc>https://scifaro.com/en/abs/uniqueness-trees-a-possible-polynomial-approach-to-the-graph-isomorphism-problem-1606.06399</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniqueness-trees-a-possible-polynomial-approach-to-the-graph-isomorphism-problem-1606.06399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniqueness-trees-a-possible-polynomial-approach-to-the-graph-isomorphism-problem-1606.06399"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-moment-distance-between-sensors-and-anchor-points-1606.06865</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-moment-distance-between-sensors-and-anchor-points-1606.06865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-moment-distance-between-sensors-and-anchor-points-1606.06865"/></url>
<url><loc>https://scifaro.com/en/abs/the-niceness-of-unique-sink-orientations-1606.07709</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-niceness-of-unique-sink-orientations-1606.07709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-niceness-of-unique-sink-orientations-1606.07709"/></url>
<url><loc>https://scifaro.com/en/abs/a-permutation-code-preserving-a-double-eulerian-bistatistic-1606.07913</loc><lastmod>2016-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-permutation-code-preserving-a-double-eulerian-bistatistic-1606.07913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-permutation-code-preserving-a-double-eulerian-bistatistic-1606.07913"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-and-reconstruction-of-sparse-signals-on-circulant-graphs-an-introduction-to-graph-fri-1606.08085</loc><lastmod>2017-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-and-reconstruction-of-sparse-signals-on-circulant-graphs-an-introduction-to-graph-fri-1606.08085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-and-reconstruction-of-sparse-signals-on-circulant-graphs-an-introduction-to-graph-fri-1606.08085"/></url>
<url><loc>https://scifaro.com/en/abs/weak-embeddings-of-posets-to-the-boolean-lattice-1606.08226</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-embeddings-of-posets-to-the-boolean-lattice-1606.08226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-embeddings-of-posets-to-the-boolean-lattice-1606.08226"/></url>
<url><loc>https://scifaro.com/en/abs/the-kernel-method-for-lattice-paths-below-a-line-of-rational-slope-1606.08412</loc><lastmod>2016-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-kernel-method-for-lattice-paths-below-a-line-of-rational-slope-1606.08412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-kernel-method-for-lattice-paths-below-a-line-of-rational-slope-1606.08412"/></url>
<url><loc>https://scifaro.com/en/abs/the-generalised-colouring-numbers-on-classes-of-bounded-expansion-1606.08972</loc><lastmod>2016-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-generalised-colouring-numbers-on-classes-of-bounded-expansion-1606.08972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-generalised-colouring-numbers-on-classes-of-bounded-expansion-1606.08972"/></url>
<url><loc>https://scifaro.com/en/abs/how-many-subsets-of-edges-of-a-directed-multigraph-can-be-represented-as-trails-1606.09107</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-many-subsets-of-edges-of-a-directed-multigraph-can-be-represented-as-trails-1606.09107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-many-subsets-of-edges-of-a-directed-multigraph-can-be-represented-as-trails-1606.09107"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-construction-and-analysis-of-seminormalized-hadamard-matrices-1606.09368</loc><lastmod>2016-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-construction-and-analysis-of-seminormalized-hadamard-matrices-1606.09368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-construction-and-analysis-of-seminormalized-hadamard-matrices-1606.09368"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-in-the-heptagrid-1606.09488</loc><lastmod>2016-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-in-the-heptagrid-1606.09488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-in-the-heptagrid-1606.09488"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-extended-euclid-s-algorithm-1607.00106</loc><lastmod>2016-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-extended-euclid-s-algorithm-1607.00106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-extended-euclid-s-algorithm-1607.00106"/></url>
<url><loc>https://scifaro.com/en/abs/equimatchable-claw-free-graphs-1607.00476</loc><lastmod>2018-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equimatchable-claw-free-graphs-1607.00476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equimatchable-claw-free-graphs-1607.00476"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-computation-of-connected-zero-forcing-1607.00658</loc><lastmod>2016-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-computation-of-connected-zero-forcing-1607.00658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-computation-of-connected-zero-forcing-1607.00658"/></url>
<url><loc>https://scifaro.com/en/abs/identity-of-king-and-flajolet-al-formulae-for-lru-miss-rate-exact-computation-1607.01283</loc><lastmod>2016-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identity-of-king-and-flajolet-al-formulae-for-lru-miss-rate-exact-computation-1607.01283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identity-of-king-and-flajolet-al-formulae-for-lru-miss-rate-exact-computation-1607.01283"/></url>
<url><loc>https://scifaro.com/en/abs/randomly-generated-subgroups-of-the-symmetric-group-and-random-lifts-of-graphs-1607.01330</loc><lastmod>2017-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomly-generated-subgroups-of-the-symmetric-group-and-random-lifts-of-graphs-1607.01330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomly-generated-subgroups-of-the-symmetric-group-and-random-lifts-of-graphs-1607.01330"/></url>
<url><loc>https://scifaro.com/en/abs/complete-description-of-matching-polytopes-with-one-linearized-quadratic-term-for-bipartite-graphs-1607.01880</loc><lastmod>2019-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-description-of-matching-polytopes-with-one-linearized-quadratic-term-for-bipartite-graphs-1607.01880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-description-of-matching-polytopes-with-one-linearized-quadratic-term-for-bipartite-graphs-1607.01880"/></url>
<url><loc>https://scifaro.com/en/abs/network-flows-under-thermal-restrictions-1607.02637</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/network-flows-under-thermal-restrictions-1607.02637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/network-flows-under-thermal-restrictions-1607.02637"/></url>
<url><loc>https://scifaro.com/en/abs/periodicity-of-identifying-codes-in-strips-1607.03848</loc><lastmod>2016-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/periodicity-of-identifying-codes-in-strips-1607.03848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/periodicity-of-identifying-codes-in-strips-1607.03848"/></url>
<url><loc>https://scifaro.com/en/abs/graph-isomorphism-restricted-by-lists-1607.03918</loc><lastmod>2016-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-isomorphism-restricted-by-lists-1607.03918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-isomorphism-restricted-by-lists-1607.03918"/></url>
<url><loc>https://scifaro.com/en/abs/edge-orders-1607.04431</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-orders-1607.04431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-orders-1607.04431"/></url>
<url><loc>https://scifaro.com/en/abs/best-case-analysis-of-mergesort-with-an-application-to-the-sum-of-digits-problem-a-manuscript-ms-v2-1607.04604</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-case-analysis-of-mergesort-with-an-application-to-the-sum-of-digits-problem-a-manuscript-ms-v2-1607.04604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-case-analysis-of-mergesort-with-an-application-to-the-sum-of-digits-problem-a-manuscript-ms-v2-1607.04604"/></url>
<url><loc>https://scifaro.com/en/abs/selfish-cops-and-passive-robber-qualitative-games-1607.05434</loc><lastmod>2016-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/selfish-cops-and-passive-robber-qualitative-games-1607.05434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/selfish-cops-and-passive-robber-qualitative-games-1607.05434"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-trees-in-2-trees-1607.05817</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-trees-in-2-trees-1607.05817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-trees-in-2-trees-1607.05817"/></url>
<url><loc>https://scifaro.com/en/abs/shared-multi-processor-scheduling-1607.06021</loc><lastmod>2021-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shared-multi-processor-scheduling-1607.06021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shared-multi-processor-scheduling-1607.06021"/></url>
<url><loc>https://scifaro.com/en/abs/dappled-tiling-1607.06138</loc><lastmod>2018-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dappled-tiling-1607.06138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dappled-tiling-1607.06138"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-control-via-entropy-compression-1607.06494</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-control-via-entropy-compression-1607.06494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-control-via-entropy-compression-1607.06494"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-causal-graph-dynamics-1607.06700</loc><lastmod>2021-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-causal-graph-dynamics-1607.06700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-causal-graph-dynamics-1607.06700"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-whether-there-are-infinitely-many-prime-graphs-with-forbidden-induced-subgraphs-1607.06864</loc><lastmod>2019-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-whether-there-are-infinitely-many-prime-graphs-with-forbidden-induced-subgraphs-1607.06864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-whether-there-are-infinitely-many-prime-graphs-with-forbidden-induced-subgraphs-1607.06864"/></url>
<url><loc>https://scifaro.com/en/abs/fixing-improper-colorings-of-graphs-1607.06911</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixing-improper-colorings-of-graphs-1607.06911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixing-improper-colorings-of-graphs-1607.06911"/></url>
<url><loc>https://scifaro.com/en/abs/a-search-algorithm-for-simplicial-complexes-1607.07009</loc><lastmod>2016-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-search-algorithm-for-simplicial-complexes-1607.07009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-search-algorithm-for-simplicial-complexes-1607.07009"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-edge-capacitated-steiner-tree-problem-1607.07082</loc><lastmod>2016-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-edge-capacitated-steiner-tree-problem-1607.07082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-edge-capacitated-steiner-tree-problem-1607.07082"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-multicut-and-the-demand-graph-1607.07200</loc><lastmod>2016-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-multicut-and-the-demand-graph-1607.07200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-multicut-and-the-demand-graph-1607.07200"/></url>
<url><loc>https://scifaro.com/en/abs/h-supermagic-labelings-for-firecrackers-banana-trees-and-flowers-1607.07911</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/h-supermagic-labelings-for-firecrackers-banana-trees-and-flowers-1607.07911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/h-supermagic-labelings-for-firecrackers-banana-trees-and-flowers-1607.07911"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-complex-networks-with-forman-ricci-curvature-and-associated-geometric-flows-1607.08654</loc><lastmod>2016-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-complex-networks-with-forman-ricci-curvature-and-associated-geometric-flows-1607.08654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-complex-networks-with-forman-ricci-curvature-and-associated-geometric-flows-1607.08654"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-on-the-mim-width-of-some-graph-classes-1608.01542</loc><lastmod>2017-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-on-the-mim-width-of-some-graph-classes-1608.01542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-on-the-mim-width-of-some-graph-classes-1608.01542"/></url>
<url><loc>https://scifaro.com/en/abs/derandomizing-chernoff-bound-with-union-bound-with-an-application-to-k-wise-independent-sets-1608.01568</loc><lastmod>2016-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derandomizing-chernoff-bound-with-union-bound-with-an-application-to-k-wise-independent-sets-1608.01568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derandomizing-chernoff-bound-with-union-bound-with-an-application-to-k-wise-independent-sets-1608.01568"/></url>
<url><loc>https://scifaro.com/en/abs/binarisation-for-valued-constraint-satisfaction-problems-1608.01628</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binarisation-for-valued-constraint-satisfaction-problems-1608.01628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binarisation-for-valued-constraint-satisfaction-problems-1608.01628"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-clique-width-of-s-1-2-2-triangle-free-graphs-1608.01820</loc><lastmod>2016-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-clique-width-of-s-1-2-2-triangle-free-graphs-1608.01820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-clique-width-of-s-1-2-2-triangle-free-graphs-1608.01820"/></url>
<url><loc>https://scifaro.com/en/abs/r-connectivity-augmentation-in-trees-1608.01971</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/r-connectivity-augmentation-in-trees-1608.01971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/r-connectivity-augmentation-in-trees-1608.01971"/></url>
<url><loc>https://scifaro.com/en/abs/on-h-topological-intersection-graphs-1608.02389</loc><lastmod>2021-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-h-topological-intersection-graphs-1608.02389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-h-topological-intersection-graphs-1608.02389"/></url>
<url><loc>https://scifaro.com/en/abs/on-information-theoretic-characterizations-of-markov-random-fields-and-subfields-1608.03697</loc><lastmod>2018-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-information-theoretic-characterizations-of-markov-random-fields-and-subfields-1608.03697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-information-theoretic-characterizations-of-markov-random-fields-and-subfields-1608.03697"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-lombardi-flow-in-orthogonal-drawings-by-minimizing-the-number-of-segments-1608.03943</loc><lastmod>2016-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-lombardi-flow-in-orthogonal-drawings-by-minimizing-the-number-of-segments-1608.03943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-lombardi-flow-in-orthogonal-drawings-by-minimizing-the-number-of-segments-1608.03943"/></url>
<url><loc>https://scifaro.com/en/abs/brun-expansions-of-stepped-surfaces-1608.03965</loc><lastmod>2016-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/brun-expansions-of-stepped-surfaces-1608.03965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/brun-expansions-of-stepped-surfaces-1608.03965"/></url>
<url><loc>https://scifaro.com/en/abs/an-iterated-local-search-algorithm-for-the-minimum-differential-dispersion-problem-1608.04217</loc><lastmod>2016-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-iterated-local-search-algorithm-for-the-minimum-differential-dispersion-problem-1608.04217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-iterated-local-search-algorithm-for-the-minimum-differential-dispersion-problem-1608.04217"/></url>
<url><loc>https://scifaro.com/en/abs/narumi-katayama-index-of-total-transformation-graphs-1608.04319</loc><lastmod>2016-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/narumi-katayama-index-of-total-transformation-graphs-1608.04319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/narumi-katayama-index-of-total-transformation-graphs-1608.04319"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-distinguishing-number-of-cyclic-tournaments-towards-the-albertson-collins-conjecture-1608.04866</loc><lastmod>2018-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-distinguishing-number-of-cyclic-tournaments-towards-the-albertson-collins-conjecture-1608.04866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-distinguishing-number-of-cyclic-tournaments-towards-the-albertson-collins-conjecture-1608.04866"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-chromatic-polynomial-1608.04883</loc><lastmod>2016-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-chromatic-polynomial-1608.04883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-chromatic-polynomial-1608.04883"/></url>
<url><loc>https://scifaro.com/en/abs/p-3-games-1608.05169</loc><lastmod>2016-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/p-3-games-1608.05169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/p-3-games-1608.05169"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-irregularity-of-some-molecular-structures-1608.05235</loc><lastmod>2016-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-irregularity-of-some-molecular-structures-1608.05235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-irregularity-of-some-molecular-structures-1608.05235"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-slepian-functions-for-arbitrary-regions-on-the-sphere-1608.05479</loc><lastmod>2017-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-slepian-functions-for-arbitrary-regions-on-the-sphere-1608.05479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-slepian-functions-for-arbitrary-regions-on-the-sphere-1608.05479"/></url>
<url><loc>https://scifaro.com/en/abs/relationship-between-the-reprogramming-determinants-of-boolean-networks-and-their-interaction-graph-1608.05552</loc><lastmod>2016-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relationship-between-the-reprogramming-determinants-of-boolean-networks-and-their-interaction-graph-1608.05552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relationship-between-the-reprogramming-determinants-of-boolean-networks-and-their-interaction-graph-1608.05552"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-kernels-and-wideness-properties-of-nowhere-dense-graph-classes-1608.05637</loc><lastmod>2018-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-kernels-and-wideness-properties-of-nowhere-dense-graph-classes-1608.05637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-kernels-and-wideness-properties-of-nowhere-dense-graph-classes-1608.05637"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-queue-number-of-graphs-with-bounded-tree-width-1608.06091</loc><lastmod>2016-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-queue-number-of-graphs-with-bounded-tree-width-1608.06091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-queue-number-of-graphs-with-bounded-tree-width-1608.06091"/></url>
<url><loc>https://scifaro.com/en/abs/robust-flows-over-time-models-and-complexity-results-1608.06520</loc><lastmod>2018-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-flows-over-time-models-and-complexity-results-1608.06520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-flows-over-time-models-and-complexity-results-1608.06520"/></url>
<url><loc>https://scifaro.com/en/abs/additive-stabilizers-for-unstable-graphs-1608.06797</loc><lastmod>2016-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/additive-stabilizers-for-unstable-graphs-1608.06797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/additive-stabilizers-for-unstable-graphs-1608.06797"/></url>
<url><loc>https://scifaro.com/en/abs/the-minimum-rank-of-typical-fooling-set-matrices-1608.07038</loc><lastmod>2016-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-minimum-rank-of-typical-fooling-set-matrices-1608.07038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-minimum-rank-of-typical-fooling-set-matrices-1608.07038"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-inheritance-of-mathcal-f-convexity-for-restricted-games-induced-by-minimum-partitions-1608.07260</loc><lastmod>2016-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-inheritance-of-mathcal-f-convexity-for-restricted-games-induced-by-minimum-partitions-1608.07260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-inheritance-of-mathcal-f-convexity-for-restricted-games-induced-by-minimum-partitions-1608.07260"/></url>
<url><loc>https://scifaro.com/en/abs/chi-bounds-operations-and-chords-1608.07413</loc><lastmod>2023-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chi-bounds-operations-and-chords-1608.07413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chi-bounds-operations-and-chords-1608.07413"/></url>
<url><loc>https://scifaro.com/en/abs/graphic-tsp-in-cubic-graphs-1608.07568</loc><lastmod>2016-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphic-tsp-in-cubic-graphs-1608.07568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphic-tsp-in-cubic-graphs-1608.07568"/></url>
<url><loc>https://scifaro.com/en/abs/performance-guaranteed-approximation-algorithm-for-minimum-k-connected-m-fold-dominating-set-1608.07634</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/performance-guaranteed-approximation-algorithm-for-minimum-k-connected-m-fold-dominating-set-1608.07634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/performance-guaranteed-approximation-algorithm-for-minimum-k-connected-m-fold-dominating-set-1608.07634"/></url>
<url><loc>https://scifaro.com/en/abs/graph-parameters-ramsey-theory-and-the-speed-of-hereditary-properties-1608.07727</loc><lastmod>2018-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-parameters-ramsey-theory-and-the-speed-of-hereditary-properties-1608.07727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-parameters-ramsey-theory-and-the-speed-of-hereditary-properties-1608.07727"/></url>
<url><loc>https://scifaro.com/en/abs/1700-forests-1608.08740</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1700-forests-1608.08740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1700-forests-1608.08740"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-list-edge-coloring-reconfiguration-problem-1609.00109</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-list-edge-coloring-reconfiguration-problem-1609.00109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-list-edge-coloring-reconfiguration-problem-1609.00109"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-simultaneous-broadcasting-by-level-disjoint-partitions-1609.01116</loc><lastmod>2016-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-simultaneous-broadcasting-by-level-disjoint-partitions-1609.01116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-simultaneous-broadcasting-by-level-disjoint-partitions-1609.01116"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-and-minimum-unit-circular-arc-models-1609.01266</loc><lastmod>2017-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-and-minimum-unit-circular-arc-models-1609.01266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-and-minimum-unit-circular-arc-models-1609.01266"/></url>
<url><loc>https://scifaro.com/en/abs/upper-domination-towards-a-dichotomy-through-boundary-properties-1609.01510</loc><lastmod>2016-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-domination-towards-a-dichotomy-through-boundary-properties-1609.01510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-domination-towards-a-dichotomy-through-boundary-properties-1609.01510"/></url>
<url><loc>https://scifaro.com/en/abs/o-f-bi-approximation-for-capacitated-covering-with-hard-capacities-1609.02640</loc><lastmod>2016-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/o-f-bi-approximation-for-capacitated-covering-with-hard-capacities-1609.02640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/o-f-bi-approximation-for-capacitated-covering-with-hard-capacities-1609.02640"/></url>
<url><loc>https://scifaro.com/en/abs/convex-independence-in-permutation-graphs-1609.02657</loc><lastmod>2016-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-independence-in-permutation-graphs-1609.02657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-independence-in-permutation-graphs-1609.02657"/></url>
<url><loc>https://scifaro.com/en/abs/sum-coloring-new-upper-bounds-for-the-chromatic-strength-1609.02726</loc><lastmod>2016-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sum-coloring-new-upper-bounds-for-the-chromatic-strength-1609.02726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sum-coloring-new-upper-bounds-for-the-chromatic-strength-1609.02726"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-regular-graph-covers-1609.03013</loc><lastmod>2017-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-regular-graph-covers-1609.03013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-regular-graph-covers-1609.03013"/></url>
<url><loc>https://scifaro.com/en/abs/directed-graphs-and-its-boundary-vertices-1609.03110</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-graphs-and-its-boundary-vertices-1609.03110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-graphs-and-its-boundary-vertices-1609.03110"/></url>
<url><loc>https://scifaro.com/en/abs/small-extended-formulation-for-knapsack-cover-inequalities-from-monotone-circuits-1609.03737</loc><lastmod>2016-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-extended-formulation-for-knapsack-cover-inequalities-from-monotone-circuits-1609.03737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-extended-formulation-for-knapsack-cover-inequalities-from-monotone-circuits-1609.03737"/></url>
<url><loc>https://scifaro.com/en/abs/what-you-will-gain-by-rounding-theory-and-algorithms-for-rounding-rank-1609.05034</loc><lastmod>2016-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-you-will-gain-by-rounding-theory-and-algorithms-for-rounding-rank-1609.05034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-you-will-gain-by-rounding-theory-and-algorithms-for-rounding-rank-1609.05034"/></url>
<url><loc>https://scifaro.com/en/abs/a-grasp-approach-for-solving-the-2-connected-m-dominating-set-problem-1609.05662</loc><lastmod>2016-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-grasp-approach-for-solving-the-2-connected-m-dominating-set-problem-1609.05662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-grasp-approach-for-solving-the-2-connected-m-dominating-set-problem-1609.05662"/></url>
<url><loc>https://scifaro.com/en/abs/a-variation-on-chip-firing-the-diffusion-game-1609.05792</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-variation-on-chip-firing-the-diffusion-game-1609.05792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-variation-on-chip-firing-the-diffusion-game-1609.05792"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-algorithm-for-sampling-colourings-of-g-n-d-n-up-to-gibbs-uniqueness-threshold-1609.05934</loc><lastmod>2016-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-algorithm-for-sampling-colourings-of-g-n-d-n-up-to-gibbs-uniqueness-threshold-1609.05934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-algorithm-for-sampling-colourings-of-g-n-d-n-up-to-gibbs-uniqueness-threshold-1609.05934"/></url>
<url><loc>https://scifaro.com/en/abs/computing-vertex-disjoint-paths-using-maos-1609.06522</loc><lastmod>2016-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-vertex-disjoint-paths-using-maos-1609.06522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-vertex-disjoint-paths-using-maos-1609.06522"/></url>
<url><loc>https://scifaro.com/en/abs/no-hole-lambda-l-k-k-1-ldots-2-1-labeling-for-square-grid-1609.06630</loc><lastmod>2016-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-hole-lambda-l-k-k-1-ldots-2-1-labeling-for-square-grid-1609.06630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-hole-lambda-l-k-k-1-ldots-2-1-labeling-for-square-grid-1609.06630"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-on-the-maximum-number-of-shortest-unique-substrings-1609.07220</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-on-the-maximum-number-of-shortest-unique-substrings-1609.07220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-on-the-maximum-number-of-shortest-unique-substrings-1609.07220"/></url>
<url><loc>https://scifaro.com/en/abs/random-popular-matchings-with-incomplete-preference-lists-1609.07288</loc><lastmod>2019-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-popular-matchings-with-incomplete-preference-lists-1609.07288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-popular-matchings-with-incomplete-preference-lists-1609.07288"/></url>
<url><loc>https://scifaro.com/en/abs/strong-connectivity-and-its-applications-1609.07355</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-connectivity-and-its-applications-1609.07355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-connectivity-and-its-applications-1609.07355"/></url>
<url><loc>https://scifaro.com/en/abs/functional-clones-and-expressibility-of-partition-functions-1609.07377</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-clones-and-expressibility-of-partition-functions-1609.07377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-clones-and-expressibility-of-partition-functions-1609.07377"/></url>
<url><loc>https://scifaro.com/en/abs/finding-long-simple-paths-in-a-weighted-digraph-using-pseudo-topological-orderings-1609.07450</loc><lastmod>2018-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-long-simple-paths-in-a-weighted-digraph-using-pseudo-topological-orderings-1609.07450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-long-simple-paths-in-a-weighted-digraph-using-pseudo-topological-orderings-1609.07450"/></url>
<url><loc>https://scifaro.com/en/abs/structural-characterization-of-cayley-graphs-1609.08272</loc><lastmod>2016-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-characterization-of-cayley-graphs-1609.08272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-characterization-of-cayley-graphs-1609.08272"/></url>
<url><loc>https://scifaro.com/en/abs/localization-bounds-for-the-graph-translation-1609.08820</loc><lastmod>2020-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/localization-bounds-for-the-graph-translation-1609.08820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/localization-bounds-for-the-graph-translation-1609.08820"/></url>
<url><loc>https://scifaro.com/en/abs/independent-sets-near-the-lower-bound-in-bounded-degree-graphs-1609.09134</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-sets-near-the-lower-bound-in-bounded-degree-graphs-1609.09134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-sets-near-the-lower-bound-in-bounded-degree-graphs-1609.09134"/></url>
<url><loc>https://scifaro.com/en/abs/closed-form-expressions-for-the-n-queens-problem-and-related-problems-1609.09585</loc><lastmod>2017-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closed-form-expressions-for-the-n-queens-problem-and-related-problems-1609.09585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closed-form-expressions-for-the-n-queens-problem-and-related-problems-1609.09585"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-ideal-flow-and-the-transportation-network-1609.09739</loc><lastmod>2016-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-ideal-flow-and-the-transportation-network-1609.09739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-ideal-flow-and-the-transportation-network-1609.09739"/></url>
<url><loc>https://scifaro.com/en/abs/the-multi-stripe-travelling-salesman-problem-1609.09796</loc><lastmod>2016-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-multi-stripe-travelling-salesman-problem-1609.09796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-multi-stripe-travelling-salesman-problem-1609.09796"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-orthogonal-latin-squares-from-linear-cellular-automata-1610.00139</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-orthogonal-latin-squares-from-linear-cellular-automata-1610.00139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-orthogonal-latin-squares-from-linear-cellular-automata-1610.00139"/></url>
<url><loc>https://scifaro.com/en/abs/the-hamiltonian-cycle-in-k-1-r-free-split-graphs-a-dichotomy-1610.00855</loc><lastmod>2020-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hamiltonian-cycle-in-k-1-r-free-split-graphs-a-dichotomy-1610.00855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hamiltonian-cycle-in-k-1-r-free-split-graphs-a-dichotomy-1610.00855"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-searching-of-partial-grids-1610.01458</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-searching-of-partial-grids-1610.01458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-searching-of-partial-grids-1610.01458"/></url>
<url><loc>https://scifaro.com/en/abs/the-recurrence-function-of-a-random-sturmian-word-1610.01479</loc><lastmod>2016-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-recurrence-function-of-a-random-sturmian-word-1610.01479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-recurrence-function-of-a-random-sturmian-word-1610.01479"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-lower-bound-for-collaborative-tree-exploration-1610.01753</loc><lastmod>2016-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-lower-bound-for-collaborative-tree-exploration-1610.01753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-lower-bound-for-collaborative-tree-exploration-1610.01753"/></url>
<url><loc>https://scifaro.com/en/abs/f-index-and-coindex-of-some-derived-graphs-1610.02175</loc><lastmod>2016-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/f-index-and-coindex-of-some-derived-graphs-1610.02175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/f-index-and-coindex-of-some-derived-graphs-1610.02175"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-pursuit-algorithms-for-probabilistic-adversaries-on-connected-graphs-1610.02724</loc><lastmod>2016-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-pursuit-algorithms-for-probabilistic-adversaries-on-connected-graphs-1610.02724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-pursuit-algorithms-for-probabilistic-adversaries-on-connected-graphs-1610.02724"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-b-continuity-of-the-lexicographic-product-of-graphs-1610.03084</loc><lastmod>2016-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-b-continuity-of-the-lexicographic-product-of-graphs-1610.03084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-b-continuity-of-the-lexicographic-product-of-graphs-1610.03084"/></url>
<url><loc>https://scifaro.com/en/abs/independent-set-reconfiguration-thresholds-of-hereditary-graph-classes-1610.03766</loc><lastmod>2019-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-set-reconfiguration-thresholds-of-hereditary-graph-classes-1610.03766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-set-reconfiguration-thresholds-of-hereditary-graph-classes-1610.03766"/></url>
<url><loc>https://scifaro.com/en/abs/greed-is-good-for-deterministic-scale-free-networks-1610.04217</loc><lastmod>2020-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greed-is-good-for-deterministic-scale-free-networks-1610.04217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greed-is-good-for-deterministic-scale-free-networks-1610.04217"/></url>
<url><loc>https://scifaro.com/en/abs/avoidability-of-circular-formulas-1610.04439</loc><lastmod>2016-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoidability-of-circular-formulas-1610.04439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoidability-of-circular-formulas-1610.04439"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-k-terminal-reliability-of-circle-graphs-1610.04544</loc><lastmod>2016-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-k-terminal-reliability-of-circle-graphs-1610.04544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-k-terminal-reliability-of-circle-graphs-1610.04544"/></url>
<url><loc>https://scifaro.com/en/abs/how-well-do-local-algorithms-solve-semidefinite-programs-1610.05350</loc><lastmod>2016-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-well-do-local-algorithms-solve-semidefinite-programs-1610.05350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-well-do-local-algorithms-solve-semidefinite-programs-1610.05350"/></url>
<url><loc>https://scifaro.com/en/abs/automorphisms-of-the-cube-n-d-1610.05498</loc><lastmod>2020-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automorphisms-of-the-cube-n-d-1610.05498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automorphisms-of-the-cube-n-d-1610.05498"/></url>
<url><loc>https://scifaro.com/en/abs/the-constant-of-recognizability-is-computable-for-primitive-morphisms-1610.05577</loc><lastmod>2016-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-constant-of-recognizability-is-computable-for-primitive-morphisms-1610.05577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-constant-of-recognizability-is-computable-for-primitive-morphisms-1610.05577"/></url>
<url><loc>https://scifaro.com/en/abs/the-spread-of-cooperative-strategies-on-grids-with-random-asynchronous-updating-1610.06237</loc><lastmod>2017-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-spread-of-cooperative-strategies-on-grids-with-random-asynchronous-updating-1610.06237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-spread-of-cooperative-strategies-on-grids-with-random-asynchronous-updating-1610.06237"/></url>
<url><loc>https://scifaro.com/en/abs/on-lexicographic-approximations-of-integer-programs-1610.06470</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lexicographic-approximations-of-integer-programs-1610.06470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lexicographic-approximations-of-integer-programs-1610.06470"/></url>
<url><loc>https://scifaro.com/en/abs/colouring-of-p3up2-free-graphs-1610.07177</loc><lastmod>2018-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colouring-of-p3up2-free-graphs-1610.07177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colouring-of-p3up2-free-graphs-1610.07177"/></url>
<url><loc>https://scifaro.com/en/abs/online-submodular-maximization-with-free-disposal-randomization-beats-0-25-for-partition-matroids-1610.07770</loc><lastmod>2016-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-submodular-maximization-with-free-disposal-randomization-beats-0-25-for-partition-matroids-1610.07770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-submodular-maximization-with-free-disposal-randomization-beats-0-25-for-partition-matroids-1610.07770"/></url>
<url><loc>https://scifaro.com/en/abs/a-proposed-algorithm-for-minimum-vertex-cover-problem-and-its-testing-1610.08461</loc><lastmod>2016-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proposed-algorithm-for-minimum-vertex-cover-problem-and-its-testing-1610.08461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proposed-algorithm-for-minimum-vertex-cover-problem-and-its-testing-1610.08461"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-unsatisfiability-and-deficiency-recent-developments-1610.08575</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-unsatisfiability-and-deficiency-recent-developments-1610.08575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-unsatisfiability-and-deficiency-recent-developments-1610.08575"/></url>
<url><loc>https://scifaro.com/en/abs/bin-packing-problem-a-linear-constant-space-3-2-approximation-algorithm-1610.08820</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bin-packing-problem-a-linear-constant-space-3-2-approximation-algorithm-1610.08820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bin-packing-problem-a-linear-constant-space-3-2-approximation-algorithm-1610.08820"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-ic-planar-and-nic-planar-graphs-1610.08884</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-ic-planar-and-nic-planar-graphs-1610.08884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-ic-planar-and-nic-planar-graphs-1610.08884"/></url>
<url><loc>https://scifaro.com/en/abs/information-theoretic-thresholds-from-the-cavity-method-1611.00814</loc><lastmod>2018-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-theoretic-thresholds-from-the-cavity-method-1611.00814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-theoretic-thresholds-from-the-cavity-method-1611.00814"/></url>
<url><loc>https://scifaro.com/en/abs/finite-generating-sets-for-reversible-gate-sets-under-general-conservation-laws-1611.01523</loc><lastmod>2016-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-generating-sets-for-reversible-gate-sets-under-general-conservation-laws-1611.01523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-generating-sets-for-reversible-gate-sets-under-general-conservation-laws-1611.01523"/></url>
<url><loc>https://scifaro.com/en/abs/amplifiers-and-suppressors-of-selection-for-the-moran-process-on-undirected-graphs-1611.01585</loc><lastmod>2016-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/amplifiers-and-suppressors-of-selection-for-the-moran-process-on-undirected-graphs-1611.01585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/amplifiers-and-suppressors-of-selection-for-the-moran-process-on-undirected-graphs-1611.01585"/></url>
<url><loc>https://scifaro.com/en/abs/twenty-simple-questions-1611.01655</loc><lastmod>2017-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twenty-simple-questions-1611.01655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twenty-simple-questions-1611.01655"/></url>
<url><loc>https://scifaro.com/en/abs/geodetic-graphs-homeomorphic-to-a-given-geodetic-graph-1611.01873</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodetic-graphs-homeomorphic-to-a-given-geodetic-graph-1611.01873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodetic-graphs-homeomorphic-to-a-given-geodetic-graph-1611.01873"/></url>
<url><loc>https://scifaro.com/en/abs/maximal-cliques-structure-for-cocomparability-graphs-and-applications-1611.02002</loc><lastmod>2016-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximal-cliques-structure-for-cocomparability-graphs-and-applications-1611.02002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximal-cliques-structure-for-cocomparability-graphs-and-applications-1611.02002"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-reed-s-conjecture-about-omega-delta-and-chi-with-respect-to-vertices-of-high-degree-1611.02063</loc><lastmod>2016-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-reed-s-conjecture-about-omega-delta-and-chi-with-respect-to-vertices-of-high-degree-1611.02063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-reed-s-conjecture-about-omega-delta-and-chi-with-respect-to-vertices-of-high-degree-1611.02063"/></url>
<url><loc>https://scifaro.com/en/abs/chain-reduction-preserves-the-unrooted-subtree-prune-and-regraft-distance-1611.02351</loc><lastmod>2016-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chain-reduction-preserves-the-unrooted-subtree-prune-and-regraft-distance-1611.02351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chain-reduction-preserves-the-unrooted-subtree-prune-and-regraft-distance-1611.02351"/></url>
<url><loc>https://scifaro.com/en/abs/the-sub-k-domination-number-of-a-graph-with-applications-to-k-domination-1611.02379</loc><lastmod>2016-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sub-k-domination-number-of-a-graph-with-applications-to-k-domination-1611.02379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sub-k-domination-number-of-a-graph-with-applications-to-k-domination-1611.02379"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-theoretic-approach-to-multitasking-1611.02400</loc><lastmod>2017-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-theoretic-approach-to-multitasking-1611.02400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-theoretic-approach-to-multitasking-1611.02400"/></url>
<url><loc>https://scifaro.com/en/abs/on-coalescence-time-in-graphs-when-is-coalescing-as-fast-as-meeting-1611.02460</loc><lastmod>2018-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-coalescence-time-in-graphs-when-is-coalescing-as-fast-as-meeting-1611.02460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-coalescence-time-in-graphs-when-is-coalescing-as-fast-as-meeting-1611.02460"/></url>
<url><loc>https://scifaro.com/en/abs/solutions-of-grinberg-equation-and-removable-cycles-in-a-cycle-basis-1611.03273</loc><lastmod>2016-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solutions-of-grinberg-equation-and-removable-cycles-in-a-cycle-basis-1611.03273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solutions-of-grinberg-equation-and-removable-cycles-in-a-cycle-basis-1611.03273"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-of-generalized-unary-coding-1611.03353</loc><lastmod>2016-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-of-generalized-unary-coding-1611.03353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-of-generalized-unary-coding-1611.03353"/></url>
<url><loc>https://scifaro.com/en/abs/invertibility-and-largest-eigenvalue-of-symmetric-matrix-signings-1611.03624</loc><lastmod>2017-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invertibility-and-largest-eigenvalue-of-symmetric-matrix-signings-1611.03624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invertibility-and-largest-eigenvalue-of-symmetric-matrix-signings-1611.03624"/></url>
<url><loc>https://scifaro.com/en/abs/chromatic-number-of-isk4-free-graphs-1611.04279</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chromatic-number-of-isk4-free-graphs-1611.04279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chromatic-number-of-isk4-free-graphs-1611.04279"/></url>
<url><loc>https://scifaro.com/en/abs/ilp-formulations-for-the-two-stage-stochastic-steiner-tree-problem-1611.04324</loc><lastmod>2016-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ilp-formulations-for-the-two-stage-stochastic-steiner-tree-problem-1611.04324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ilp-formulations-for-the-two-stage-stochastic-steiner-tree-problem-1611.04324"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-and-constructions-for-overline-3-strongly-separable-codes-with-length-3-1611.04349</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-and-constructions-for-overline-3-strongly-separable-codes-with-length-3-1611.04349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-and-constructions-for-overline-3-strongly-separable-codes-with-length-3-1611.04349"/></url>
<url><loc>https://scifaro.com/en/abs/variable-neighborhood-search-algorithms-for-the-multi-depot-dial-a-ride-problem-with-heterogeneous-vehicles-and-users-1611.05187</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-neighborhood-search-algorithms-for-the-multi-depot-dial-a-ride-problem-with-heterogeneous-vehicles-and-users-1611.05187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-neighborhood-search-algorithms-for-the-multi-depot-dial-a-ride-problem-with-heterogeneous-vehicles-and-users-1611.05187"/></url>
<url><loc>https://scifaro.com/en/abs/sensitivity-analysis-for-convex-separable-optimization-over-integral-polymatroids-1611.05372</loc><lastmod>2016-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sensitivity-analysis-for-convex-separable-optimization-over-integral-polymatroids-1611.05372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sensitivity-analysis-for-convex-separable-optimization-over-integral-polymatroids-1611.05372"/></url>
<url><loc>https://scifaro.com/en/abs/minor-complexities-of-finite-operations-1611.05633</loc><lastmod>2016-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minor-complexities-of-finite-operations-1611.05633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minor-complexities-of-finite-operations-1611.05633"/></url>
<url><loc>https://scifaro.com/en/abs/f-index-of-four-operations-on-graphs-1611.07468</loc><lastmod>2016-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/f-index-of-four-operations-on-graphs-1611.07468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/f-index-of-four-operations-on-graphs-1611.07468"/></url>
<url><loc>https://scifaro.com/en/abs/patterns-in-treeshelves-1611.07793</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/patterns-in-treeshelves-1611.07793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/patterns-in-treeshelves-1611.07793"/></url>
<url><loc>https://scifaro.com/en/abs/routing-number-of-a-pyramid-1611.07933</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-number-of-a-pyramid-1611.07933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-number-of-a-pyramid-1611.07933"/></url>
<url><loc>https://scifaro.com/en/abs/on-1-epsilon-restricted-max-min-fair-allocation-problem-1611.08060</loc><lastmod>2016-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-1-epsilon-restricted-max-min-fair-allocation-problem-1611.08060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-1-epsilon-restricted-max-min-fair-allocation-problem-1611.08060"/></url>
<url><loc>https://scifaro.com/en/abs/structure-and-algorithms-for-cap-even-hole-free-graphs-1611.08066</loc><lastmod>2016-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-and-algorithms-for-cap-even-hole-free-graphs-1611.08066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-and-algorithms-for-cap-even-hole-free-graphs-1611.08066"/></url>
<url><loc>https://scifaro.com/en/abs/perpetually-dominating-large-grids-1611.08204</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perpetually-dominating-large-grids-1611.08204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perpetually-dominating-large-grids-1611.08204"/></url>
<url><loc>https://scifaro.com/en/abs/laplacian-integrality-in-p4-sparse-and-p4-extendible-graphs-1611.08271</loc><lastmod>2016-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/laplacian-integrality-in-p4-sparse-and-p4-extendible-graphs-1611.08271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/laplacian-integrality-in-p4-sparse-and-p4-extendible-graphs-1611.08271"/></url>
<url><loc>https://scifaro.com/en/abs/nondeterministic-communication-complexity-of-random-boolean-functions-1611.08400</loc><lastmod>2016-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nondeterministic-communication-complexity-of-random-boolean-functions-1611.08400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nondeterministic-communication-complexity-of-random-boolean-functions-1611.08400"/></url>
<url><loc>https://scifaro.com/en/abs/the-graph-of-the-pedigree-polytope-is-asymptotically-almost-complete-extended-abstract-1611.08419</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graph-of-the-pedigree-polytope-is-asymptotically-almost-complete-extended-abstract-1611.08419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graph-of-the-pedigree-polytope-is-asymptotically-almost-complete-extended-abstract-1611.08419"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-graph-of-the-pedigree-polytope-1611.08431</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-graph-of-the-pedigree-polytope-1611.08431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-graph-of-the-pedigree-polytope-1611.08431"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-discrepancy-minimization-via-the-multiplicative-weight-update-method-1611.08752</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-discrepancy-minimization-via-the-multiplicative-weight-update-method-1611.08752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-discrepancy-minimization-via-the-multiplicative-weight-update-method-1611.08752"/></url>
<url><loc>https://scifaro.com/en/abs/number-balancing-is-as-hard-as-minkowski-s-theorem-and-shortest-vector-1611.08757</loc><lastmod>2016-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/number-balancing-is-as-hard-as-minkowski-s-theorem-and-shortest-vector-1611.08757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/number-balancing-is-as-hard-as-minkowski-s-theorem-and-shortest-vector-1611.08757"/></url>
<url><loc>https://scifaro.com/en/abs/a-vertex-ordering-characterization-of-simple-triangle-graphs-1611.09003</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-vertex-ordering-characterization-of-simple-triangle-graphs-1611.09003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-vertex-ordering-characterization-of-simple-triangle-graphs-1611.09003"/></url>
<url><loc>https://scifaro.com/en/abs/on-prefix-normal-words-and-prefix-normal-forms-1611.09017</loc><lastmod>2017-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-prefix-normal-words-and-prefix-normal-forms-1611.09017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-prefix-normal-words-and-prefix-normal-forms-1611.09017"/></url>
<url><loc>https://scifaro.com/en/abs/on-mixing-in-pairwise-markov-random-fields-with-application-to-social-networks-1611.09189</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-mixing-in-pairwise-markov-random-fields-with-application-to-social-networks-1611.09189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-mixing-in-pairwise-markov-random-fields-with-application-to-social-networks-1611.09189"/></url>
<url><loc>https://scifaro.com/en/abs/generic-and-efficient-solution-solves-the-shortest-paths-problem-in-square-runtime-1611.09666</loc><lastmod>2016-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-and-efficient-solution-solves-the-shortest-paths-problem-in-square-runtime-1611.09666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-and-efficient-solution-solves-the-shortest-paths-problem-in-square-runtime-1611.09666"/></url>
<url><loc>https://scifaro.com/en/abs/on-rank-width-of-even-hole-free-graphs-1611.09907</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-rank-width-of-even-hole-free-graphs-1611.09907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-rank-width-of-even-hole-free-graphs-1611.09907"/></url>
<url><loc>https://scifaro.com/en/abs/spatial-mixing-and-systematic-scan-markov-chains-1612.01576</loc><lastmod>2017-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spatial-mixing-and-systematic-scan-markov-chains-1612.01576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spatial-mixing-and-systematic-scan-markov-chains-1612.01576"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-power-domination-number-of-de-bruijn-and-kautz-digraphs-1612.01721</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-power-domination-number-of-de-bruijn-and-kautz-digraphs-1612.01721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-power-domination-number-of-de-bruijn-and-kautz-digraphs-1612.01721"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-triangle-inequality-for-the-jaccard-distance-1612.02696</loc><lastmod>2016-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-triangle-inequality-for-the-jaccard-distance-1612.02696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-triangle-inequality-for-the-jaccard-distance-1612.02696"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-graphs-of-rays-and-grounded-segments-1612.03638</loc><lastmod>2016-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-graphs-of-rays-and-grounded-segments-1612.03638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-graphs-of-rays-and-grounded-segments-1612.03638"/></url>
<url><loc>https://scifaro.com/en/abs/touchard-s-drunkard-1612.04076</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/touchard-s-drunkard-1612.04076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/touchard-s-drunkard-1612.04076"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-dag-depth-of-directed-graphs-1612.04980</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-dag-depth-of-directed-graphs-1612.04980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-dag-depth-of-directed-graphs-1612.04980"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-cut-based-genetic-algorithm-for-graph-partitioning-applied-to-cell-formation-1612.05536</loc><lastmod>2016-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-cut-based-genetic-algorithm-for-graph-partitioning-applied-to-cell-formation-1612.05536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-cut-based-genetic-algorithm-for-graph-partitioning-applied-to-cell-formation-1612.05536"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-duality-theory-for-topology-optimization-1612.05684</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-duality-theory-for-topology-optimization-1612.05684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-duality-theory-for-topology-optimization-1612.05684"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometric-lattice-of-embedded-subsets-1612.05814</loc><lastmod>2016-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometric-lattice-of-embedded-subsets-1612.05814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometric-lattice-of-embedded-subsets-1612.05814"/></url>
<url><loc>https://scifaro.com/en/abs/cograph-generation-with-linear-delay-1612.05827</loc><lastmod>2018-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cograph-generation-with-linear-delay-1612.05827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cograph-generation-with-linear-delay-1612.05827"/></url>
<url><loc>https://scifaro.com/en/abs/sparsity-measure-of-a-network-graph-gini-index-1612.07074</loc><lastmod>2018-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparsity-measure-of-a-network-graph-gini-index-1612.07074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparsity-measure-of-a-network-graph-gini-index-1612.07074"/></url>
<url><loc>https://scifaro.com/en/abs/readability-of-digraphs-and-bipartite-graphs-1612.07113</loc><lastmod>2016-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/readability-of-digraphs-and-bipartite-graphs-1612.07113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/readability-of-digraphs-and-bipartite-graphs-1612.07113"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complete-width-and-edge-clique-cover-problems-1612.08057</loc><lastmod>2016-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complete-width-and-edge-clique-cover-problems-1612.08057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complete-width-and-edge-clique-cover-problems-1612.08057"/></url>
<url><loc>https://scifaro.com/en/abs/neighborhood-complexity-and-kernelization-for-nowhere-dense-classes-of-graphs-1612.08197</loc><lastmod>2016-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighborhood-complexity-and-kernelization-for-nowhere-dense-classes-of-graphs-1612.08197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighborhood-complexity-and-kernelization-for-nowhere-dense-classes-of-graphs-1612.08197"/></url>
<url><loc>https://scifaro.com/en/abs/on-fixed-parameter-tractability-of-the-mixed-domination-problem-for-graphs-with-bounded-tree-width-1612.08234</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-fixed-parameter-tractability-of-the-mixed-domination-problem-for-graphs-with-bounded-tree-width-1612.08234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-fixed-parameter-tractability-of-the-mixed-domination-problem-for-graphs-with-bounded-tree-width-1612.08234"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-caterpillars-1612.08283</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-caterpillars-1612.08283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-caterpillars-1612.08283"/></url>
<url><loc>https://scifaro.com/en/abs/making-bipartite-graphs-dm-irreducible-1612.08828</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-bipartite-graphs-dm-irreducible-1612.08828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-bipartite-graphs-dm-irreducible-1612.08828"/></url>
<url><loc>https://scifaro.com/en/abs/inference-of-phylogenetic-trees-from-the-knowledge-of-rare-evolutionary-events-1612.09093</loc><lastmod>2017-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inference-of-phylogenetic-trees-from-the-knowledge-of-rare-evolutionary-events-1612.09093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inference-of-phylogenetic-trees-from-the-knowledge-of-rare-evolutionary-events-1612.09093"/></url>
<url><loc>https://scifaro.com/en/abs/circular-separation-dimension-of-a-subclass-of-planar-graphs-1612.09436</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circular-separation-dimension-of-a-subclass-of-planar-graphs-1612.09436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circular-separation-dimension-of-a-subclass-of-planar-graphs-1612.09436"/></url>
<url><loc>https://scifaro.com/en/abs/fast-counting-of-medium-sized-rooted-subgraphs-1701.00177</loc><lastmod>2017-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-counting-of-medium-sized-rooted-subgraphs-1701.00177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-counting-of-medium-sized-rooted-subgraphs-1701.00177"/></url>
<url><loc>https://scifaro.com/en/abs/topological-analysis-and-synthesis-of-structures-related-to-certain-classes-of-k-geodetic-computer-networks-1701.00302</loc><lastmod>2024-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-analysis-and-synthesis-of-structures-related-to-certain-classes-of-k-geodetic-computer-networks-1701.00302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-analysis-and-synthesis-of-structures-related-to-certain-classes-of-k-geodetic-computer-networks-1701.00302"/></url>
<url><loc>https://scifaro.com/en/abs/fooling-sets-and-the-spanning-tree-polytope-1701.00350</loc><lastmod>2017-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fooling-sets-and-the-spanning-tree-polytope-1701.00350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fooling-sets-and-the-spanning-tree-polytope-1701.00350"/></url>
<url><loc>https://scifaro.com/en/abs/extended-formulations-for-polytopes-of-regular-matroids-1701.00538</loc><lastmod>2017-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-formulations-for-polytopes-of-regular-matroids-1701.00538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-formulations-for-polytopes-of-regular-matroids-1701.00538"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-parameters-of-minimally-non-linear-patterns-1701.00706</loc><lastmod>2017-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-parameters-of-minimally-non-linear-patterns-1701.00706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-parameters-of-minimally-non-linear-patterns-1701.00706"/></url>
<url><loc>https://scifaro.com/en/abs/a-structural-characterization-for-certifying-robinsonian-matrices-1701.00806</loc><lastmod>2018-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-structural-characterization-for-certifying-robinsonian-matrices-1701.00806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-structural-characterization-for-certifying-robinsonian-matrices-1701.00806"/></url>
<url><loc>https://scifaro.com/en/abs/abelian-square-rich-words-1701.00948</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abelian-square-rich-words-1701.00948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abelian-square-rich-words-1701.00948"/></url>
<url><loc>https://scifaro.com/en/abs/the-sequence-of-open-and-closed-prefixes-of-a-sturmian-word-1701.01580</loc><lastmod>2018-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sequence-of-open-and-closed-prefixes-of-a-sturmian-word-1701.01580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sequence-of-open-and-closed-prefixes-of-a-sturmian-word-1701.01580"/></url>
<url><loc>https://scifaro.com/en/abs/an-anti-incursion-algorithm-for-unknown-probabilistic-adversaries-on-connected-graphs-1701.01599</loc><lastmod>2017-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-anti-incursion-algorithm-for-unknown-probabilistic-adversaries-on-connected-graphs-1701.01599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-anti-incursion-algorithm-for-unknown-probabilistic-adversaries-on-connected-graphs-1701.01599"/></url>
<url><loc>https://scifaro.com/en/abs/on-eccentricity-version-of-laplacian-energy-of-a-graph-1701.02000</loc><lastmod>2017-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-eccentricity-version-of-laplacian-energy-of-a-graph-1701.02000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-eccentricity-version-of-laplacian-energy-of-a-graph-1701.02000"/></url>
<url><loc>https://scifaro.com/en/abs/toward-quantum-combinatorial-games-1701.02193</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-quantum-combinatorial-games-1701.02193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-quantum-combinatorial-games-1701.02193"/></url>
<url><loc>https://scifaro.com/en/abs/multiset-combinatorial-batch-codes-1701.02708</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiset-combinatorial-batch-codes-1701.02708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiset-combinatorial-batch-codes-1701.02708"/></url>
<url><loc>https://scifaro.com/en/abs/on-efficient-domination-for-some-classes-of-h-free-chordal-graphs-1701.03414</loc><lastmod>2019-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-efficient-domination-for-some-classes-of-h-free-chordal-graphs-1701.03414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-efficient-domination-for-some-classes-of-h-free-chordal-graphs-1701.03414"/></url>
<url><loc>https://scifaro.com/en/abs/subgaussian-tail-bounds-via-stability-arguments-1701.03493</loc><lastmod>2017-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subgaussian-tail-bounds-via-stability-arguments-1701.03493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subgaussian-tail-bounds-via-stability-arguments-1701.03493"/></url>
<url><loc>https://scifaro.com/en/abs/the-g-good-neighbor-conditional-diagnosability-of-locally-twisted-cubes-1701.03827</loc><lastmod>2017-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-g-good-neighbor-conditional-diagnosability-of-locally-twisted-cubes-1701.03827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-g-good-neighbor-conditional-diagnosability-of-locally-twisted-cubes-1701.03827"/></url>
<url><loc>https://scifaro.com/en/abs/the-flip-markov-chain-for-connected-regular-graphs-1701.03856</loc><lastmod>2018-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-flip-markov-chain-for-connected-regular-graphs-1701.03856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-flip-markov-chain-for-connected-regular-graphs-1701.03856"/></url>
<url><loc>https://scifaro.com/en/abs/nic-planar-graphs-1701.04375</loc><lastmod>2017-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nic-planar-graphs-1701.04375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nic-planar-graphs-1701.04375"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-characteristic-and-permanent-polynomials-of-a-matrix-1701.04420</loc><lastmod>2018-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-characteristic-and-permanent-polynomials-of-a-matrix-1701.04420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-characteristic-and-permanent-polynomials-of-a-matrix-1701.04420"/></url>
<url><loc>https://scifaro.com/en/abs/analytic-connectivity-in-general-hypergraphs-1701.04548</loc><lastmod>2017-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analytic-connectivity-in-general-hypergraphs-1701.04548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analytic-connectivity-in-general-hypergraphs-1701.04548"/></url>
<url><loc>https://scifaro.com/en/abs/equitable-neighbour-sum-distinguishing-edge-and-total-colourings-1701.04648</loc><lastmod>2017-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equitable-neighbour-sum-distinguishing-edge-and-total-colourings-1701.04648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equitable-neighbour-sum-distinguishing-edge-and-total-colourings-1701.04648"/></url>
<url><loc>https://scifaro.com/en/abs/structure-of-a-parabolic-partial-differential-equation-on-graphs-and-digital-spaces-solution-of-pde-on-digital-spaces-a-klein-bottle-a-projective-plane-a-4d-sphere-and-a-moebius-band-1701.05232</loc><lastmod>2017-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-of-a-parabolic-partial-differential-equation-on-graphs-and-digital-spaces-solution-of-pde-on-digital-spaces-a-klein-bottle-a-projective-plane-a-4d-sphere-and-a-moebius-band-1701.05232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-of-a-parabolic-partial-differential-equation-on-graphs-and-digital-spaces-solution-of-pde-on-digital-spaces-a-klein-bottle-a-projective-plane-a-4d-sphere-and-a-moebius-band-1701.05232"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-phylogenies-via-branchings-in-acyclic-digraphs-and-a-generalization-of-dilworth-s-theorem-1701.05492</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-phylogenies-via-branchings-in-acyclic-digraphs-and-a-generalization-of-dilworth-s-theorem-1701.05492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-phylogenies-via-branchings-in-acyclic-digraphs-and-a-generalization-of-dilworth-s-theorem-1701.05492"/></url>
<url><loc>https://scifaro.com/en/abs/characterizations-of-minimal-dominating-sets-and-the-well-dominated-property-in-lexicographic-product-graphs-1701.05886</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizations-of-minimal-dominating-sets-and-the-well-dominated-property-in-lexicographic-product-graphs-1701.05886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizations-of-minimal-dominating-sets-and-the-well-dominated-property-in-lexicographic-product-graphs-1701.05886"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-free-coloring-of-planar-graphs-1701.05999</loc><lastmod>2018-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-free-coloring-of-planar-graphs-1701.05999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-free-coloring-of-planar-graphs-1701.05999"/></url>
<url><loc>https://scifaro.com/en/abs/general-bounds-on-satisfiability-thresholds-for-random-csps-via-fourier-analysis-1701.06258</loc><lastmod>2017-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-bounds-on-satisfiability-thresholds-for-random-csps-via-fourier-analysis-1701.06258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-bounds-on-satisfiability-thresholds-for-random-csps-via-fourier-analysis-1701.06258"/></url>
<url><loc>https://scifaro.com/en/abs/on-distance-preserving-and-sequentially-distance-preserving-graphs-1701.06404</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-distance-preserving-and-sequentially-distance-preserving-graphs-1701.06404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-distance-preserving-and-sequentially-distance-preserving-graphs-1701.06404"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-complexity-of-proper-labeling-problems-1701.06669</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-complexity-of-proper-labeling-problems-1701.06669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-complexity-of-proper-labeling-problems-1701.06669"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-gray-codes-with-prescribed-ends-of-small-dimensions-1701.06705</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-gray-codes-with-prescribed-ends-of-small-dimensions-1701.06705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-gray-codes-with-prescribed-ends-of-small-dimensions-1701.06705"/></url>
<url><loc>https://scifaro.com/en/abs/the-switch-markov-chain-for-sampling-irregular-graphs-and-digraphs-1701.07101</loc><lastmod>2017-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-switch-markov-chain-for-sampling-irregular-graphs-and-digraphs-1701.07101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-switch-markov-chain-for-sampling-irregular-graphs-and-digraphs-1701.07101"/></url>
<url><loc>https://scifaro.com/en/abs/sorting-by-reversals-and-the-theory-of-4-regular-graphs-1701.07463</loc><lastmod>2017-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sorting-by-reversals-and-the-theory-of-4-regular-graphs-1701.07463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sorting-by-reversals-and-the-theory-of-4-regular-graphs-1701.07463"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-convexity-in-joint-winner-property-1701.07645</loc><lastmod>2018-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-convexity-in-joint-winner-property-1701.07645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-convexity-in-joint-winner-property-1701.07645"/></url>
<url><loc>https://scifaro.com/en/abs/biologically-feasible-gene-trees-reconciliation-maps-and-informative-triples-1701.07689</loc><lastmod>2017-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/biologically-feasible-gene-trees-reconciliation-maps-and-informative-triples-1701.07689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/biologically-feasible-gene-trees-reconciliation-maps-and-informative-triples-1701.07689"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-extremal-connected-forcing-numbers-1701.08500</loc><lastmod>2017-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-extremal-connected-forcing-numbers-1701.08500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-extremal-connected-forcing-numbers-1701.08500"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-periodic-fibonacci-like-sequences-1701.08566</loc><lastmod>2017-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-periodic-fibonacci-like-sequences-1701.08566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-periodic-fibonacci-like-sequences-1701.08566"/></url>
<url><loc>https://scifaro.com/en/abs/chromatic-bounds-for-some-classes-of-2k-2-free-graphs-1702.00622</loc><lastmod>2018-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chromatic-bounds-for-some-classes-of-2k-2-free-graphs-1702.00622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chromatic-bounds-for-some-classes-of-2k-2-free-graphs-1702.00622"/></url>
<url><loc>https://scifaro.com/en/abs/on-repetition-thresholds-of-caterpillars-and-trees-of-bounded-degree-1702.01058</loc><lastmod>2018-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-repetition-thresholds-of-caterpillars-and-trees-of-bounded-degree-1702.01058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-repetition-thresholds-of-caterpillars-and-trees-of-bounded-degree-1702.01058"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistency-in-the-ordinal-pairwise-comparisons-method-with-and-without-ties-1702.01126</loc><lastmod>2018-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistency-in-the-ordinal-pairwise-comparisons-method-with-and-without-ties-1702.01126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistency-in-the-ordinal-pairwise-comparisons-method-with-and-without-ties-1702.01126"/></url>
<url><loc>https://scifaro.com/en/abs/2-subcoloring-is-np-complete-for-planar-comparability-graphs-1702.01283</loc><lastmod>2017-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-subcoloring-is-np-complete-for-planar-comparability-graphs-1702.01283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-subcoloring-is-np-complete-for-planar-comparability-graphs-1702.01283"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-combinatorial-lower-bound-for-the-extension-complexity-of-the-spanning-tree-polytope-1702.01424</loc><lastmod>2017-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-combinatorial-lower-bound-for-the-extension-complexity-of-the-spanning-tree-polytope-1702.01424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-combinatorial-lower-bound-for-the-extension-complexity-of-the-spanning-tree-polytope-1702.01424"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-aspects-of-linear-and-affine-closed-lambda-terms-1702.03085</loc><lastmod>2017-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-aspects-of-linear-and-affine-closed-lambda-terms-1702.03085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-aspects-of-linear-and-affine-closed-lambda-terms-1702.03085"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-cost-of-simulating-a-parallel-boolean-automata-network-by-a-block-sequential-one-1702.03101</loc><lastmod>2017-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-cost-of-simulating-a-parallel-boolean-automata-network-by-a-block-sequential-one-1702.03101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-cost-of-simulating-a-parallel-boolean-automata-network-by-a-block-sequential-one-1702.03101"/></url>
<url><loc>https://scifaro.com/en/abs/the-stochastic-shortest-path-problem-a-polyhedral-combinatorics-perspective-1702.03186</loc><lastmod>2017-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stochastic-shortest-path-problem-a-polyhedral-combinatorics-perspective-1702.03186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stochastic-shortest-path-problem-a-polyhedral-combinatorics-perspective-1702.03186"/></url>
<url><loc>https://scifaro.com/en/abs/submodular-goal-value-of-boolean-functions-1702.04067</loc><lastmod>2017-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submodular-goal-value-of-boolean-functions-1702.04067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submodular-goal-value-of-boolean-functions-1702.04067"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-relaxations-for-the-traveling-salesman-problem-1702.05224</loc><lastmod>2019-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-relaxations-for-the-traveling-salesman-problem-1702.05224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-relaxations-for-the-traveling-salesman-problem-1702.05224"/></url>
<url><loc>https://scifaro.com/en/abs/a-frac-3-2-approximation-algorithm-for-tree-augmentation-via-chv-atal-gomory-cuts-1702.05567</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-frac-3-2-approximation-algorithm-for-tree-augmentation-via-chv-atal-gomory-cuts-1702.05567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-frac-3-2-approximation-algorithm-for-tree-augmentation-via-chv-atal-gomory-cuts-1702.05567"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-framework-for-path-convexities-1702.06112</loc><lastmod>2019-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-framework-for-path-convexities-1702.06112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-framework-for-path-convexities-1702.06112"/></url>
<url><loc>https://scifaro.com/en/abs/eigenvalues-of-weakly-balanced-signed-graphs-and-graphs-with-negative-cliques-1702.06322</loc><lastmod>2018-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eigenvalues-of-weakly-balanced-signed-graphs-and-graphs-with-negative-cliques-1702.06322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eigenvalues-of-weakly-balanced-signed-graphs-and-graphs-with-negative-cliques-1702.06322"/></url>
<url><loc>https://scifaro.com/en/abs/multi-shell-sampling-scheme-with-accurate-and-efficient-transforms-for-diffusion-mri-1702.07056</loc><lastmod>2017-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-shell-sampling-scheme-with-accurate-and-efficient-transforms-for-diffusion-mri-1702.07056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-shell-sampling-scheme-with-accurate-and-efficient-transforms-for-diffusion-mri-1702.07056"/></url>
<url><loc>https://scifaro.com/en/abs/on-normalization-of-inconsistency-indicators-in-pairwise-comparisons-1702.07205</loc><lastmod>2017-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-normalization-of-inconsistency-indicators-in-pairwise-comparisons-1702.07205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-normalization-of-inconsistency-indicators-in-pairwise-comparisons-1702.07205"/></url>
<url><loc>https://scifaro.com/en/abs/heuristic-for-maximizing-grouping-efficiency-in-the-cell-formation-problem-1702.07266</loc><lastmod>2017-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristic-for-maximizing-grouping-efficiency-in-the-cell-formation-problem-1702.07266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristic-for-maximizing-grouping-efficiency-in-the-cell-formation-problem-1702.07266"/></url>
<url><loc>https://scifaro.com/en/abs/second-order-conservative-languages-with-a-maltsev-polymorphism-also-have-a-majority-polymorphism-1702.07267</loc><lastmod>2017-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-order-conservative-languages-with-a-maltsev-polymorphism-also-have-a-majority-polymorphism-1702.07267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-order-conservative-languages-with-a-maltsev-polymorphism-also-have-a-majority-polymorphism-1702.07267"/></url>
<url><loc>https://scifaro.com/en/abs/cograph-editing-merging-modules-is-equivalent-to-editing-p4-s-1702.07499</loc><lastmod>2019-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cograph-editing-merging-modules-is-equivalent-to-editing-p4-s-1702.07499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cograph-editing-merging-modules-is-equivalent-to-editing-p4-s-1702.07499"/></url>
<url><loc>https://scifaro.com/en/abs/generalization-of-schnyder-woods-to-orientable-surfaces-and-applications-1702.07589</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalization-of-schnyder-woods-to-orientable-surfaces-and-applications-1702.07589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalization-of-schnyder-woods-to-orientable-surfaces-and-applications-1702.07589"/></url>
<url><loc>https://scifaro.com/en/abs/exact-localisations-of-feedback-sets-1702.07612</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-localisations-of-feedback-sets-1702.07612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-localisations-of-feedback-sets-1702.07612"/></url>
<url><loc>https://scifaro.com/en/abs/on-chordal-k-generalized-split-graphs-1702.07914</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-chordal-k-generalized-split-graphs-1702.07914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-chordal-k-generalized-split-graphs-1702.07914"/></url>
<url><loc>https://scifaro.com/en/abs/the-metric-dimension-of-the-circulant-graph-c-n-pm-1-2-3-4-1702.08178</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-metric-dimension-of-the-circulant-graph-c-n-pm-1-2-3-4-1702.08178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-metric-dimension-of-the-circulant-graph-c-n-pm-1-2-3-4-1702.08178"/></url>
<url><loc>https://scifaro.com/en/abs/almost-disjoint-spanning-trees-relaxing-the-conditions-for-completely-independent-spanning-trees-1702.08289</loc><lastmod>2017-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-disjoint-spanning-trees-relaxing-the-conditions-for-completely-independent-spanning-trees-1702.08289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-disjoint-spanning-trees-relaxing-the-conditions-for-completely-independent-spanning-trees-1702.08289"/></url>
<url><loc>https://scifaro.com/en/abs/combining-the-k-cnf-and-xor-phase-transitions-1702.08392</loc><lastmod>2017-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-the-k-cnf-and-xor-phase-transitions-1702.08392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-the-k-cnf-and-xor-phase-transitions-1702.08392"/></url>
<url><loc>https://scifaro.com/en/abs/extension-complexity-of-stable-set-polytopes-of-bipartite-graphs-1702.08741</loc><lastmod>2017-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extension-complexity-of-stable-set-polytopes-of-bipartite-graphs-1702.08741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extension-complexity-of-stable-set-polytopes-of-bipartite-graphs-1702.08741"/></url>
<url><loc>https://scifaro.com/en/abs/factoring-odd-integers-without-multiplication-and-division-1703.00372</loc><lastmod>2017-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factoring-odd-integers-without-multiplication-and-division-1703.00372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factoring-odd-integers-without-multiplication-and-division-1703.00372"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-finding-all-possible-input-nodes-for-controlling-complex-networks-1703.00876</loc><lastmod>2022-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-finding-all-possible-input-nodes-for-controlling-complex-networks-1703.00876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-finding-all-possible-input-nodes-for-controlling-complex-networks-1703.00876"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-minimum-linear-arrangement-for-bc-graphs-1703.01149</loc><lastmod>2017-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-minimum-linear-arrangement-for-bc-graphs-1703.01149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-minimum-linear-arrangement-for-bc-graphs-1703.01149"/></url>
<url><loc>https://scifaro.com/en/abs/on-von-schelling-formula-for-the-generalized-coupon-collector-problem-1703.01886</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-von-schelling-formula-for-the-generalized-coupon-collector-problem-1703.01886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-von-schelling-formula-for-the-generalized-coupon-collector-problem-1703.01886"/></url>
<url><loc>https://scifaro.com/en/abs/guarantees-for-greedy-maximization-of-non-submodular-functions-with-applications-1703.02100</loc><lastmod>2019-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarantees-for-greedy-maximization-of-non-submodular-functions-with-applications-1703.02100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarantees-for-greedy-maximization-of-non-submodular-functions-with-applications-1703.02100"/></url>
<url><loc>https://scifaro.com/en/abs/the-half-integral-erd-os-p-osa-property-for-non-null-cycles-1703.02866</loc><lastmod>2017-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-half-integral-erd-os-p-osa-property-for-non-null-cycles-1703.02866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-half-integral-erd-os-p-osa-property-for-non-null-cycles-1703.02866"/></url>
<url><loc>https://scifaro.com/en/abs/compressibility-and-probabilistic-proofs-1703.03342</loc><lastmod>2017-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compressibility-and-probabilistic-proofs-1703.03342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compressibility-and-probabilistic-proofs-1703.03342"/></url>
<url><loc>https://scifaro.com/en/abs/faster-greedy-map-inference-for-determinantal-point-processes-1703.03389</loc><lastmod>2017-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-greedy-map-inference-for-determinantal-point-processes-1703.03389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-greedy-map-inference-for-determinantal-point-processes-1703.03389"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-induced-subdivision-of-k-4-1703.04637</loc><lastmod>2017-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-induced-subdivision-of-k-4-1703.04637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-induced-subdivision-of-k-4-1703.04637"/></url>
<url><loc>https://scifaro.com/en/abs/on-packing-chromatic-number-of-subcubic-outerplanar-graphs-1703.05023</loc><lastmod>2018-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-packing-chromatic-number-of-subcubic-outerplanar-graphs-1703.05023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-packing-chromatic-number-of-subcubic-outerplanar-graphs-1703.05023"/></url>
<url><loc>https://scifaro.com/en/abs/average-whenever-you-meet-opportunistic-protocols-for-community-detection-1703.05045</loc><lastmod>2018-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-whenever-you-meet-opportunistic-protocols-for-community-detection-1703.05045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-whenever-you-meet-opportunistic-protocols-for-community-detection-1703.05045"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-a-simple-local-search-algorithm-for-graph-colouring-1703.05129</loc><lastmod>2017-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-a-simple-local-search-algorithm-for-graph-colouring-1703.05129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-a-simple-local-search-algorithm-for-graph-colouring-1703.05129"/></url>
<url><loc>https://scifaro.com/en/abs/randomly-coloring-simple-hypergraphs-with-fewer-colors-1703.05173</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomly-coloring-simple-hypergraphs-with-fewer-colors-1703.05173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomly-coloring-simple-hypergraphs-with-fewer-colors-1703.05173"/></url>
<url><loc>https://scifaro.com/en/abs/the-interactive-sum-choice-number-of-graphs-1703.05380</loc><lastmod>2021-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-interactive-sum-choice-number-of-graphs-1703.05380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-interactive-sum-choice-number-of-graphs-1703.05380"/></url>
<url><loc>https://scifaro.com/en/abs/smart-elements-in-combinatorial-group-testing-problems-1703.05398</loc><lastmod>2018-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smart-elements-in-combinatorial-group-testing-problems-1703.05398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smart-elements-in-combinatorial-group-testing-problems-1703.05398"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-correspondence-homomorphisms-1703.05881</loc><lastmod>2018-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-correspondence-homomorphisms-1703.05881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-correspondence-homomorphisms-1703.05881"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-topology-shape-metrics-framework-for-ortho-radial-drawings-1703.06040</loc><lastmod>2017-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-topology-shape-metrics-framework-for-ortho-radial-drawings-1703.06040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-topology-shape-metrics-framework-for-ortho-radial-drawings-1703.06040"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-forcing-sets-for-1d-origami-1703.06373</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-forcing-sets-for-1d-origami-1703.06373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-forcing-sets-for-1d-origami-1703.06373"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-conversion-of-multivalued-to-boolean-dynamics-1703.06746</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-conversion-of-multivalued-to-boolean-dynamics-1703.06746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-conversion-of-multivalued-to-boolean-dynamics-1703.06746"/></url>
<url><loc>https://scifaro.com/en/abs/layers-and-matroids-for-the-traveling-salesman-s-paths-1703.07170</loc><lastmod>2017-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layers-and-matroids-for-the-traveling-salesman-s-paths-1703.07170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layers-and-matroids-for-the-traveling-salesman-s-paths-1703.07170"/></url>
<url><loc>https://scifaro.com/en/abs/embedded-width-a-variant-of-treewidth-for-plane-graphs-1703.07532</loc><lastmod>2017-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedded-width-a-variant-of-treewidth-for-plane-graphs-1703.07532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedded-width-a-variant-of-treewidth-for-plane-graphs-1703.07532"/></url>
<url><loc>https://scifaro.com/en/abs/selfish-cops-and-active-robber-multi-player-pursuit-evasion-on-graphs-1703.07695</loc><lastmod>2018-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/selfish-cops-and-active-robber-multi-player-pursuit-evasion-on-graphs-1703.07695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/selfish-cops-and-active-robber-multi-player-pursuit-evasion-on-graphs-1703.07695"/></url>
<url><loc>https://scifaro.com/en/abs/on-strongly-chordal-graphs-that-are-not-leaf-powers-1703.08018</loc><lastmod>2017-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-strongly-chordal-graphs-that-are-not-leaf-powers-1703.08018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-strongly-chordal-graphs-that-are-not-leaf-powers-1703.08018"/></url>
<url><loc>https://scifaro.com/en/abs/hyper-zagreb-index-of-bridge-and-chain-grpahs-1703.08325</loc><lastmod>2017-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyper-zagreb-index-of-bridge-and-chain-grpahs-1703.08325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyper-zagreb-index-of-bridge-and-chain-grpahs-1703.08325"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-matchings-constructed-during-edmonds-weighted-perfect-matching-algorithm-1703.09505</loc><lastmod>2017-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-matchings-constructed-during-edmonds-weighted-perfect-matching-algorithm-1703.09505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-matchings-constructed-during-edmonds-weighted-perfect-matching-algorithm-1703.09505"/></url>
<url><loc>https://scifaro.com/en/abs/fleet-management-for-autonomous-vehicles-online-pdp-under-special-constraints-1703.10565</loc><lastmod>2017-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fleet-management-for-autonomous-vehicles-online-pdp-under-special-constraints-1703.10565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fleet-management-for-autonomous-vehicles-online-pdp-under-special-constraints-1703.10565"/></url>
<url><loc>https://scifaro.com/en/abs/treewidth-distance-on-phylogenetic-trees-1703.10840</loc><lastmod>2017-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/treewidth-distance-on-phylogenetic-trees-1703.10840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/treewidth-distance-on-phylogenetic-trees-1703.10840"/></url>
<url><loc>https://scifaro.com/en/abs/thin-graph-classes-and-polynomial-time-approximation-schemes-1704.00125</loc><lastmod>2017-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/thin-graph-classes-and-polynomial-time-approximation-schemes-1704.00125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/thin-graph-classes-and-polynomial-time-approximation-schemes-1704.00125"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-clique-cover-problem-on-bull-c-4-free-graphs-1704.00316</loc><lastmod>2017-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-clique-cover-problem-on-bull-c-4-free-graphs-1704.00316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-clique-cover-problem-on-bull-c-4-free-graphs-1704.00316"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-thinness-and-proper-thinness-of-a-graph-1704.00379</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-thinness-and-proper-thinness-of-a-graph-1704.00379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-thinness-and-proper-thinness-of-a-graph-1704.00379"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-rank-maximal-matchings-1704.00899</loc><lastmod>2017-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-rank-maximal-matchings-1704.00899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-rank-maximal-matchings-1704.00899"/></url>
<url><loc>https://scifaro.com/en/abs/charting-the-replica-symmetric-phase-1704.01043</loc><lastmod>2018-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/charting-the-replica-symmetric-phase-1704.01043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/charting-the-replica-symmetric-phase-1704.01043"/></url>
<url><loc>https://scifaro.com/en/abs/seymour-s-second-neighbourhood-conjecture-for-quasi-transitive-oriented-graphs-1704.01389</loc><lastmod>2017-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/seymour-s-second-neighbourhood-conjecture-for-quasi-transitive-oriented-graphs-1704.01389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/seymour-s-second-neighbourhood-conjecture-for-quasi-transitive-oriented-graphs-1704.01389"/></url>
<url><loc>https://scifaro.com/en/abs/computational-approaches-for-zero-forcing-and-related-problems-1704.02065</loc><lastmod>2018-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-approaches-for-zero-forcing-and-related-problems-1704.02065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-approaches-for-zero-forcing-and-related-problems-1704.02065"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-bound-for-shortest-augmenting-paths-on-trees-1704.02093</loc><lastmod>2017-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-bound-for-shortest-augmenting-paths-on-trees-1704.02093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-bound-for-shortest-augmenting-paths-on-trees-1704.02093"/></url>
<url><loc>https://scifaro.com/en/abs/the-geodetic-hull-number-is-hard-for-chordal-graphs-1704.02242</loc><lastmod>2017-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geodetic-hull-number-is-hard-for-chordal-graphs-1704.02242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geodetic-hull-number-is-hard-for-chordal-graphs-1704.02242"/></url>
<url><loc>https://scifaro.com/en/abs/finding-optimal-sinks-for-random-walkers-in-a-network-1704.02365</loc><lastmod>2017-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-optimal-sinks-for-random-walkers-in-a-network-1704.02365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-optimal-sinks-for-random-walkers-in-a-network-1704.02365"/></url>
<url><loc>https://scifaro.com/en/abs/commutative-algorithms-approximate-the-lll-distribution-1704.02796</loc><lastmod>2019-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/commutative-algorithms-approximate-the-lll-distribution-1704.02796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/commutative-algorithms-approximate-the-lll-distribution-1704.02796"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-pattern-containment-in-0-1-matrices-1704.05207</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-pattern-containment-in-0-1-matrices-1704.05207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-pattern-containment-in-0-1-matrices-1704.05207"/></url>
<url><loc>https://scifaro.com/en/abs/results-on-pattern-avoidance-games-1704.05211</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/results-on-pattern-avoidance-games-1704.05211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/results-on-pattern-avoidance-games-1704.05211"/></url>
<url><loc>https://scifaro.com/en/abs/computing-reformulated-first-zagreb-index-of-some-chemical-graphs-as-an-application-of-generalized-hierarchical-product-of-graphs-1704.05476</loc><lastmod>2017-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-reformulated-first-zagreb-index-of-some-chemical-graphs-as-an-application-of-generalized-hierarchical-product-of-graphs-1704.05476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-reformulated-first-zagreb-index-of-some-chemical-graphs-as-an-application-of-generalized-hierarchical-product-of-graphs-1704.05476"/></url>
<url><loc>https://scifaro.com/en/abs/ubergraphs-a-definition-of-a-recursive-hypergraph-structure-1704.05547</loc><lastmod>2017-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ubergraphs-a-definition-of-a-recursive-hypergraph-structure-1704.05547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ubergraphs-a-definition-of-a-recursive-hypergraph-structure-1704.05547"/></url>
<url><loc>https://scifaro.com/en/abs/equitable-colorings-of-l-corona-products-of-cubic-graphs-1704.05929</loc><lastmod>2017-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equitable-colorings-of-l-corona-products-of-cubic-graphs-1704.05929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equitable-colorings-of-l-corona-products-of-cubic-graphs-1704.05929"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-uncapacitated-single-allocation-p-hub-median-problem-on-gpu-1704.06258</loc><lastmod>2018-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-uncapacitated-single-allocation-p-hub-median-problem-on-gpu-1704.06258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-uncapacitated-single-allocation-p-hub-median-problem-on-gpu-1704.06258"/></url>
<url><loc>https://scifaro.com/en/abs/shared-processor-scheduling-1704.06361</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shared-processor-scheduling-1704.06361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shared-processor-scheduling-1704.06361"/></url>
<url><loc>https://scifaro.com/en/abs/rerouting-flows-when-links-fail-1704.07067</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rerouting-flows-when-links-fail-1704.07067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rerouting-flows-when-links-fail-1704.07067"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-computing-a-robust-flow-1704.08241</loc><lastmod>2017-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-computing-a-robust-flow-1704.08241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-computing-a-robust-flow-1704.08241"/></url>
<url><loc>https://scifaro.com/en/abs/the-primal-dual-greedy-algorithm-for-weighted-covering-problems-1704.08522</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-primal-dual-greedy-algorithm-for-weighted-covering-problems-1704.08522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-primal-dual-greedy-algorithm-for-weighted-covering-problems-1704.08522"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-randomized-reduction-from-tournament-isomorphism-to-tournament-asymmetry-1704.08529</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-randomized-reduction-from-tournament-isomorphism-to-tournament-asymmetry-1704.08529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-randomized-reduction-from-tournament-isomorphism-to-tournament-asymmetry-1704.08529"/></url>
<url><loc>https://scifaro.com/en/abs/on-1-factorizations-of-bipartite-kneser-graphs-1704.08852</loc><lastmod>2019-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-1-factorizations-of-bipartite-kneser-graphs-1704.08852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-1-factorizations-of-bipartite-kneser-graphs-1704.08852"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-hypergraph-degree-sequences-1705.00186</loc><lastmod>2017-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-hypergraph-degree-sequences-1705.00186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-hypergraph-degree-sequences-1705.00186"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-algorithms-for-sliding-tokens-on-cactus-graphs-and-block-graphs-1705.00429</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-sliding-tokens-on-cactus-graphs-and-block-graphs-1705.00429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-sliding-tokens-on-cactus-graphs-and-block-graphs-1705.00429"/></url>
<url><loc>https://scifaro.com/en/abs/topological-containment-of-the-5-clique-minus-an-edge-in-4-connected-graphs-1705.01224</loc><lastmod>2017-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-containment-of-the-5-clique-minus-an-edge-in-4-connected-graphs-1705.01224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-containment-of-the-5-clique-minus-an-edge-in-4-connected-graphs-1705.01224"/></url>
<url><loc>https://scifaro.com/en/abs/incidence-choosability-of-graphs-1705.01744</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incidence-choosability-of-graphs-1705.01744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incidence-choosability-of-graphs-1705.01744"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-quasiperiodic-sft-1705.01876</loc><lastmod>2017-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-quasiperiodic-sft-1705.01876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-quasiperiodic-sft-1705.01876"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-time-travel-characterization-of-time-consistent-tree-reconciliation-maps-1705.02179</loc><lastmod>2017-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-time-travel-characterization-of-time-consistent-tree-reconciliation-maps-1705.02179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-time-travel-characterization-of-time-consistent-tree-reconciliation-maps-1705.02179"/></url>
<url><loc>https://scifaro.com/en/abs/the-salesman-s-improved-tours-for-fundamental-classes-1705.02385</loc><lastmod>2018-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-salesman-s-improved-tours-for-fundamental-classes-1705.02385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-salesman-s-improved-tours-for-fundamental-classes-1705.02385"/></url>
<url><loc>https://scifaro.com/en/abs/mathcal-b-partitions-application-to-determinant-and-permanent-of-graphs-1705.02517</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathcal-b-partitions-application-to-determinant-and-permanent-of-graphs-1705.02517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathcal-b-partitions-application-to-determinant-and-permanent-of-graphs-1705.02517"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-prime-factor-decomposition-algorithm-for-strong-product-graphs-1705.03817</loc><lastmod>2017-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-prime-factor-decomposition-algorithm-for-strong-product-graphs-1705.03817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-prime-factor-decomposition-algorithm-for-strong-product-graphs-1705.03817"/></url>
<url><loc>https://scifaro.com/en/abs/local-algorithms-for-the-prime-factorization-of-strong-product-graphs-1705.03823</loc><lastmod>2017-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-algorithms-for-the-prime-factorization-of-strong-product-graphs-1705.03823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-algorithms-for-the-prime-factorization-of-strong-product-graphs-1705.03823"/></url>
<url><loc>https://scifaro.com/en/abs/critical-graphs-for-minimum-vertex-cover-1705.04111</loc><lastmod>2017-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-graphs-for-minimum-vertex-cover-1705.04111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-graphs-for-minimum-vertex-cover-1705.04111"/></url>
<url><loc>https://scifaro.com/en/abs/from-event-labeled-gene-trees-to-species-trees-1705.04190</loc><lastmod>2017-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-event-labeled-gene-trees-to-species-trees-1705.04190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-event-labeled-gene-trees-to-species-trees-1705.04190"/></url>
<url><loc>https://scifaro.com/en/abs/a-class-of-exponential-neighbourhoods-for-the-quadratic-travelling-salesman-problem-1705.05393</loc><lastmod>2019-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-class-of-exponential-neighbourhoods-for-the-quadratic-travelling-salesman-problem-1705.05393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-class-of-exponential-neighbourhoods-for-the-quadratic-travelling-salesman-problem-1705.05393"/></url>
<url><loc>https://scifaro.com/en/abs/invariance-a-theoretical-approach-for-coding-sets-of-words-modulo-literal-anti-morphisms-1705.05564</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invariance-a-theoretical-approach-for-coding-sets-of-words-modulo-literal-anti-morphisms-1705.05564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invariance-a-theoretical-approach-for-coding-sets-of-words-modulo-literal-anti-morphisms-1705.05564"/></url>
<url><loc>https://scifaro.com/en/abs/counting-perfect-matchings-and-the-switch-chain-1705.05790</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-perfect-matchings-and-the-switch-chain-1705.05790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-perfect-matchings-and-the-switch-chain-1705.05790"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-hypergraph-products-erratum-1705.06037</loc><lastmod>2017-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-hypergraph-products-erratum-1705.06037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-hypergraph-products-erratum-1705.06037"/></url>
<url><loc>https://scifaro.com/en/abs/an-exact-upper-bound-on-the-size-of-minimal-clique-covers-1705.06326</loc><lastmod>2017-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-exact-upper-bound-on-the-size-of-minimal-clique-covers-1705.06326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-exact-upper-bound-on-the-size-of-minimal-clique-covers-1705.06326"/></url>
<url><loc>https://scifaro.com/en/abs/robust-randomized-matchings-1705.06631</loc><lastmod>2017-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-randomized-matchings-1705.06631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-randomized-matchings-1705.06631"/></url>
<url><loc>https://scifaro.com/en/abs/towards-effective-exact-algorithms-for-the-maximum-balanced-biclique-problem-1705.07338</loc><lastmod>2017-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-effective-exact-algorithms-for-the-maximum-balanced-biclique-problem-1705.07338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-effective-exact-algorithms-for-the-maximum-balanced-biclique-problem-1705.07338"/></url>
<url><loc>https://scifaro.com/en/abs/goal-clustering-vns-based-heuristics-1705.07666</loc><lastmod>2017-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/goal-clustering-vns-based-heuristics-1705.07666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/goal-clustering-vns-based-heuristics-1705.07666"/></url>
<url><loc>https://scifaro.com/en/abs/clique-width-for-graph-classes-closed-under-complementation-1705.07681</loc><lastmod>2017-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-width-for-graph-classes-closed-under-complementation-1705.07681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-width-for-graph-classes-closed-under-complementation-1705.07681"/></url>
<url><loc>https://scifaro.com/en/abs/computational-methods-for-path-based-robust-flows-1705.08161</loc><lastmod>2017-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-methods-for-path-based-robust-flows-1705.08161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-methods-for-path-based-robust-flows-1705.08161"/></url>
<url><loc>https://scifaro.com/en/abs/behavior-of-digital-sequences-through-exotic-numeration-systems-1705.08322</loc><lastmod>2017-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavior-of-digital-sequences-through-exotic-numeration-systems-1705.08322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavior-of-digital-sequences-through-exotic-numeration-systems-1705.08322"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-edge-domination-hard-and-solvable-cases-1705.08379</loc><lastmod>2017-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-edge-domination-hard-and-solvable-cases-1705.08379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-edge-domination-hard-and-solvable-cases-1705.08379"/></url>
<url><loc>https://scifaro.com/en/abs/conscious-and-controlling-elements-in-combinatorial-group-testing-problems-with-more-defectives-1705.08539</loc><lastmod>2017-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conscious-and-controlling-elements-in-combinatorial-group-testing-problems-with-more-defectives-1705.08539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conscious-and-controlling-elements-in-combinatorial-group-testing-problems-with-more-defectives-1705.08539"/></url>
<url><loc>https://scifaro.com/en/abs/fast-algorithms-for-anti-distance-matrices-as-a-generalization-of-boolean-matrices-1705.08743</loc><lastmod>2017-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-algorithms-for-anti-distance-matrices-as-a-generalization-of-boolean-matrices-1705.08743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-algorithms-for-anti-distance-matrices-as-a-generalization-of-boolean-matrices-1705.08743"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expected-moments-between-two-identical-random-processes-with-application-to-sensor-network-1705.08855</loc><lastmod>2018-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expected-moments-between-two-identical-random-processes-with-application-to-sensor-network-1705.08855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expected-moments-between-two-identical-random-processes-with-application-to-sensor-network-1705.08855"/></url>
<url><loc>https://scifaro.com/en/abs/matroids-hitting-sets-and-unsupervised-dependency-grammar-induction-1705.08992</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matroids-hitting-sets-and-unsupervised-dependency-grammar-induction-1705.08992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matroids-hitting-sets-and-unsupervised-dependency-grammar-induction-1705.08992"/></url>
<url><loc>https://scifaro.com/en/abs/the-tessellation-problem-of-quantum-walks-1705.09014</loc><lastmod>2021-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tessellation-problem-of-quantum-walks-1705.09014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tessellation-problem-of-quantum-walks-1705.09014"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-types-in-sparse-graphs-1705.09336</loc><lastmod>2017-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-types-in-sparse-graphs-1705.09336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-types-in-sparse-graphs-1705.09336"/></url>
<url><loc>https://scifaro.com/en/abs/slimness-of-graphs-1705.09797</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slimness-of-graphs-1705.09797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slimness-of-graphs-1705.09797"/></url>
<url><loc>https://scifaro.com/en/abs/k-geodetic-graphs-and-their-applications-to-analysis-across-different-scales-of-dynamics-of-complex-systems-1705.10036</loc><lastmod>2017-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-geodetic-graphs-and-their-applications-to-analysis-across-different-scales-of-dynamics-of-complex-systems-1705.10036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-geodetic-graphs-and-their-applications-to-analysis-across-different-scales-of-dynamics-of-complex-systems-1705.10036"/></url>
<url><loc>https://scifaro.com/en/abs/directed-random-walks-on-polytopes-with-few-facets-1705.10243</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-random-walks-on-polytopes-with-few-facets-1705.10243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-random-walks-on-polytopes-with-few-facets-1705.10243"/></url>
<url><loc>https://scifaro.com/en/abs/general-bounds-for-incremental-maximization-1705.10253</loc><lastmod>2018-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-bounds-for-incremental-maximization-1705.10253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-bounds-for-incremental-maximization-1705.10253"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-recognizing-minimally-tough-graphs-1705.10570</loc><lastmod>2022-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-recognizing-minimally-tough-graphs-1705.10570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-recognizing-minimally-tough-graphs-1705.10570"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-the-cost-of-team-exploration-1705.10826</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-the-cost-of-team-exploration-1705.10826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-the-cost-of-team-exploration-1705.10826"/></url>
<url><loc>https://scifaro.com/en/abs/identification-of-points-using-disks-1705.11116</loc><lastmod>2017-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identification-of-points-using-disks-1705.11116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identification-of-points-using-disks-1705.11116"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-on-the-order-of-the-largest-induced-linear-forest-in-triangle-free-planar-graphs-1705.11133</loc><lastmod>2017-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-on-the-order-of-the-largest-induced-linear-forest-in-triangle-free-planar-graphs-1705.11133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-on-the-order-of-the-largest-induced-linear-forest-in-triangle-free-planar-graphs-1705.11133"/></url>
<url><loc>https://scifaro.com/en/abs/the-cop-number-of-the-one-cop-moves-game-on-planar-graphs-1705.11184</loc><lastmod>2018-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cop-number-of-the-one-cop-moves-game-on-planar-graphs-1705.11184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cop-number-of-the-one-cop-moves-game-on-planar-graphs-1705.11184"/></url>
<url><loc>https://scifaro.com/en/abs/f-index-of-graphs-based-on-four-operations-related-to-the-lexicographic-product-1706.00464</loc><lastmod>2017-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/f-index-of-graphs-based-on-four-operations-related-to-the-lexicographic-product-1706.00464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/f-index-of-graphs-based-on-four-operations-related-to-the-lexicographic-product-1706.00464"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-problems-on-h-graphs-1706.00575</loc><lastmod>2017-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-problems-on-h-graphs-1706.00575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-problems-on-h-graphs-1706.00575"/></url>
<url><loc>https://scifaro.com/en/abs/extending-partial-representations-of-unit-circular-arc-graphs-1706.00928</loc><lastmod>2017-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-partial-representations-of-unit-circular-arc-graphs-1706.00928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-partial-representations-of-unit-circular-arc-graphs-1706.00928"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-shift-rule-for-the-prefer-max-de-bruijn-sequence-1706.01106</loc><lastmod>2018-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-shift-rule-for-the-prefer-max-de-bruijn-sequence-1706.01106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-shift-rule-for-the-prefer-max-de-bruijn-sequence-1706.01106"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-of-7n-6-for-the-minimum-size-2ec-on-cubic-3-edge-connected-graphs-1706.01609</loc><lastmod>2017-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-of-7n-6-for-the-minimum-size-2ec-on-cubic-3-edge-connected-graphs-1706.01609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-of-7n-6-for-the-minimum-size-2ec-on-cubic-3-edge-connected-graphs-1706.01609"/></url>
<url><loc>https://scifaro.com/en/abs/min-max-regret-scheduling-to-minimize-the-total-weight-of-late-jobs-with-interval-uncertainty-1706.03103</loc><lastmod>2017-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/min-max-regret-scheduling-to-minimize-the-total-weight-of-late-jobs-with-interval-uncertainty-1706.03103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/min-max-regret-scheduling-to-minimize-the-total-weight-of-late-jobs-with-interval-uncertainty-1706.03103"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-interesting-ternary-formulas-1706.03233</loc><lastmod>2018-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-interesting-ternary-formulas-1706.03233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-interesting-ternary-formulas-1706.03233"/></url>
<url><loc>https://scifaro.com/en/abs/contracting-bipartite-graphs-to-paths-and-cycles-1706.03750</loc><lastmod>2017-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contracting-bipartite-graphs-to-paths-and-cycles-1706.03750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contracting-bipartite-graphs-to-paths-and-cycles-1706.03750"/></url>
<url><loc>https://scifaro.com/en/abs/the-rosenberg-strong-pairing-function-1706.04129</loc><lastmod>2019-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rosenberg-strong-pairing-function-1706.04129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rosenberg-strong-pairing-function-1706.04129"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-identity-problem-for-the-special-linear-group-and-the-heisenberg-group-1706.04166</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-identity-problem-for-the-special-linear-group-and-the-heisenberg-group-1706.04166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-identity-problem-for-the-special-linear-group-and-the-heisenberg-group-1706.04166"/></url>
<url><loc>https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-s-2-2-3-free-graphs-in-polynomial-time-1706.04894</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-s-2-2-3-free-graphs-in-polynomial-time-1706.04894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-s-2-2-3-free-graphs-in-polynomial-time-1706.04894"/></url>
<url><loc>https://scifaro.com/en/abs/new-results-on-edge-partitions-of-1-plane-graphs-1706.05161</loc><lastmod>2017-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-results-on-edge-partitions-of-1-plane-graphs-1706.05161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-results-on-edge-partitions-of-1-plane-graphs-1706.05161"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-reload-cost-cycle-cover-in-complete-graphs-1706.05225</loc><lastmod>2021-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-reload-cost-cycle-cover-in-complete-graphs-1706.05225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-reload-cost-cycle-cover-in-complete-graphs-1706.05225"/></url>
<url><loc>https://scifaro.com/en/abs/contributions-to-the-generalized-coupon-collector-and-lru-problems-1706.05250</loc><lastmod>2017-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contributions-to-the-generalized-coupon-collector-and-lru-problems-1706.05250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contributions-to-the-generalized-coupon-collector-and-lru-problems-1706.05250"/></url>
<url><loc>https://scifaro.com/en/abs/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints-1706.06084</loc><lastmod>2020-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints-1706.06084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints-1706.06084"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-combinatorics-of-the-2-class-classification-problem-1706.06214</loc><lastmod>2017-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-combinatorics-of-the-2-class-classification-problem-1706.06214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-combinatorics-of-the-2-class-classification-problem-1706.06214"/></url>
<url><loc>https://scifaro.com/en/abs/out-colourings-of-digraphs-1706.06441</loc><lastmod>2017-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/out-colourings-of-digraphs-1706.06441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/out-colourings-of-digraphs-1706.06441"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-integrality-gap-of-the-prize-collecting-steiner-forest-lp-1706.06565</loc><lastmod>2017-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-integrality-gap-of-the-prize-collecting-steiner-forest-lp-1706.06565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-integrality-gap-of-the-prize-collecting-steiner-forest-lp-1706.06565"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-of-trees-and-paths-via-correlation-1706.06822</loc><lastmod>2017-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-of-trees-and-paths-via-correlation-1706.06822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-of-trees-and-paths-via-correlation-1706.06822"/></url>
<url><loc>https://scifaro.com/en/abs/online-submodular-maximization-problem-with-vector-packing-constraint-1706.06922</loc><lastmod>2017-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-submodular-maximization-problem-with-vector-packing-constraint-1706.06922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-submodular-maximization-problem-with-vector-packing-constraint-1706.06922"/></url>
<url><loc>https://scifaro.com/en/abs/study-morphology-of-minimum-spanning-tree-problem-and-generalized-algorithms-1706.07708</loc><lastmod>2017-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/study-morphology-of-minimum-spanning-tree-problem-and-generalized-algorithms-1706.07708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/study-morphology-of-minimum-spanning-tree-problem-and-generalized-algorithms-1706.07708"/></url>
<url><loc>https://scifaro.com/en/abs/effective-optimization-using-sample-persistence-a-case-study-on-quantum-annealers-and-various-monte-carlo-optimization-methods-1706.07826</loc><lastmod>2017-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-optimization-using-sample-persistence-a-case-study-on-quantum-annealers-and-various-monte-carlo-optimization-methods-1706.07826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-optimization-using-sample-persistence-a-case-study-on-quantum-annealers-and-various-monte-carlo-optimization-methods-1706.07826"/></url>
<url><loc>https://scifaro.com/en/abs/on-subtrees-of-the-representation-tree-in-rational-base-numeration-systems-1706.08266</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-subtrees-of-the-representation-tree-in-rational-base-numeration-systems-1706.08266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-subtrees-of-the-representation-tree-in-rational-base-numeration-systems-1706.08266"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-the-satisfiability-threshold-for-power-law-distributed-random-sat-1706.08431</loc><lastmod>2019-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-the-satisfiability-threshold-for-power-law-distributed-random-sat-1706.08431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-the-satisfiability-threshold-for-power-law-distributed-random-sat-1706.08431"/></url>
<url><loc>https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-iv-solving-a-conjecture-about-the-pendent-paths-of-length-three-1706.08587</loc><lastmod>2017-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-iv-solving-a-conjecture-about-the-pendent-paths-of-length-three-1706.08587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-structural-properties-of-trees-with-minimal-atom-bond-connectivity-index-iv-solving-a-conjecture-about-the-pendent-paths-of-length-three-1706.08587"/></url>
<url><loc>https://scifaro.com/en/abs/assortment-and-price-optimization-under-the-two-stage-luce-model-1706.08599</loc><lastmod>2019-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assortment-and-price-optimization-under-the-two-stage-luce-model-1706.08599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assortment-and-price-optimization-under-the-two-stage-luce-model-1706.08599"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-branches-in-trees-with-minimal-atom-bond-connectivity-index-1706.08680</loc><lastmod>2017-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-branches-in-trees-with-minimal-atom-bond-connectivity-index-1706.08680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-branches-in-trees-with-minimal-atom-bond-connectivity-index-1706.08680"/></url>
<url><loc>https://scifaro.com/en/abs/dominating-induced-matchings-in-s-1-2-4-free-graphs-1706.09301</loc><lastmod>2019-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dominating-induced-matchings-in-s-1-2-4-free-graphs-1706.09301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dominating-induced-matchings-in-s-1-2-4-free-graphs-1706.09301"/></url>
<url><loc>https://scifaro.com/en/abs/exponential-lower-bounds-for-history-based-simplex-pivot-rules-on-abstract-cubes-1706.09380</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exponential-lower-bounds-for-history-based-simplex-pivot-rules-on-abstract-cubes-1706.09380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exponential-lower-bounds-for-history-based-simplex-pivot-rules-on-abstract-cubes-1706.09380"/></url>
<url><loc>https://scifaro.com/en/abs/symmetry-guided-design-of-topologies-for-supercomputer-networks-1706.09506</loc><lastmod>2017-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetry-guided-design-of-topologies-for-supercomputer-networks-1706.09506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetry-guided-design-of-topologies-for-supercomputer-networks-1706.09506"/></url>
<url><loc>https://scifaro.com/en/abs/power-domination-in-maximal-planar-graphs-1706.10047</loc><lastmod>2019-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/power-domination-in-maximal-planar-graphs-1706.10047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/power-domination-in-maximal-planar-graphs-1706.10047"/></url>
<url><loc>https://scifaro.com/en/abs/proximity-results-and-faster-algorithms-for-integer-programming-using-the-steinitz-lemma-1707.00481</loc><lastmod>2019-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proximity-results-and-faster-algorithms-for-integer-programming-using-the-steinitz-lemma-1707.00481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proximity-results-and-faster-algorithms-for-integer-programming-using-the-steinitz-lemma-1707.00481"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-properties-of-sparse-digraphs-1707.01701</loc><lastmod>2017-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-properties-of-sparse-digraphs-1707.01701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-properties-of-sparse-digraphs-1707.01701"/></url>
<url><loc>https://scifaro.com/en/abs/random-walks-on-small-world-networks-1707.02467</loc><lastmod>2020-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-walks-on-small-world-networks-1707.02467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-walks-on-small-world-networks-1707.02467"/></url>
<url><loc>https://scifaro.com/en/abs/decycling-a-graph-by-the-removal-of-a-matching-new-algorithmic-and-structural-aspects-in-some-classes-of-graphs-1707.02473</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decycling-a-graph-by-the-removal-of-a-matching-new-algorithmic-and-structural-aspects-in-some-classes-of-graphs-1707.02473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decycling-a-graph-by-the-removal-of-a-matching-new-algorithmic-and-structural-aspects-in-some-classes-of-graphs-1707.02473"/></url>
<url><loc>https://scifaro.com/en/abs/assortment-optimization-under-the-sequential-multinomial-logit-model-1707.02572</loc><lastmod>2018-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assortment-optimization-under-the-sequential-multinomial-logit-model-1707.02572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assortment-optimization-under-the-sequential-multinomial-logit-model-1707.02572"/></url>
<url><loc>https://scifaro.com/en/abs/generation-and-analysis-of-lamplighter-programs-1707.02652</loc><lastmod>2018-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generation-and-analysis-of-lamplighter-programs-1707.02652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generation-and-analysis-of-lamplighter-programs-1707.02652"/></url>
<url><loc>https://scifaro.com/en/abs/power-domination-on-triangular-grids-1707.02760</loc><lastmod>2017-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/power-domination-on-triangular-grids-1707.02760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/power-domination-on-triangular-grids-1707.02760"/></url>
<url><loc>https://scifaro.com/en/abs/no-idle-no-wait-when-shop-scheduling-meets-dominoes-eulerian-and-hamiltonian-paths-1707.02849</loc><lastmod>2017-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-idle-no-wait-when-shop-scheduling-meets-dominoes-eulerian-and-hamiltonian-paths-1707.02849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-idle-no-wait-when-shop-scheduling-meets-dominoes-eulerian-and-hamiltonian-paths-1707.02849"/></url>
<url><loc>https://scifaro.com/en/abs/strong-immersion-is-a-well-quasi-ordering-for-semi-complete-digraphs-1707.03563</loc><lastmod>2017-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-immersion-is-a-well-quasi-ordering-for-semi-complete-digraphs-1707.03563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-immersion-is-a-well-quasi-ordering-for-semi-complete-digraphs-1707.03563"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-random-colorings-of-sparse-random-graphs-1707.03796</loc><lastmod>2017-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-random-colorings-of-sparse-random-graphs-1707.03796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-random-colorings-of-sparse-random-graphs-1707.03796"/></url>
<url><loc>https://scifaro.com/en/abs/additive-non-approximability-of-chromatic-number-in-proper-minor-closed-classes-1707.03888</loc><lastmod>2017-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/additive-non-approximability-of-chromatic-number-in-proper-minor-closed-classes-1707.03888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/additive-non-approximability-of-chromatic-number-in-proper-minor-closed-classes-1707.03888"/></url>
<url><loc>https://scifaro.com/en/abs/approaching-frac-3-2-for-the-s-t-path-tsp-1707.03992</loc><lastmod>2019-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approaching-frac-3-2-for-the-s-t-path-tsp-1707.03992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approaching-frac-3-2-for-the-s-t-path-tsp-1707.03992"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-inheritance-of-the-isometry-dual-property-under-puncturing-ag-codes-1707.04062</loc><lastmod>2019-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-inheritance-of-the-isometry-dual-property-under-puncturing-ag-codes-1707.04062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-inheritance-of-the-isometry-dual-property-under-puncturing-ag-codes-1707.04062"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-submodular-maximization-beyond-cardinality-constraints-does-randomization-help-greedy-1707.04347</loc><lastmod>2017-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-submodular-maximization-beyond-cardinality-constraints-does-randomization-help-greedy-1707.04347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-submodular-maximization-beyond-cardinality-constraints-does-randomization-help-greedy-1707.04347"/></url>
<url><loc>https://scifaro.com/en/abs/online-codes-for-analog-signals-1707.05199</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-codes-for-analog-signals-1707.05199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-codes-for-analog-signals-1707.05199"/></url>
<url><loc>https://scifaro.com/en/abs/binary-tomography-reconstructions-with-few-projections-1707.05231</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-tomography-reconstructions-with-few-projections-1707.05231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-tomography-reconstructions-with-few-projections-1707.05231"/></url>
<url><loc>https://scifaro.com/en/abs/an-alon-boppana-type-bound-for-weighted-graphs-and-lowerbounds-for-spectral-sparsification-1707.06364</loc><lastmod>2017-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-alon-boppana-type-bound-for-weighted-graphs-and-lowerbounds-for-spectral-sparsification-1707.06364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-alon-boppana-type-bound-for-weighted-graphs-and-lowerbounds-for-spectral-sparsification-1707.06364"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-algorithm-for-computing-gamma-1-2-set-in-generalized-series-parallel-graphs-1707.06443</loc><lastmod>2017-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-algorithm-for-computing-gamma-1-2-set-in-generalized-series-parallel-graphs-1707.06443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-algorithm-for-computing-gamma-1-2-set-in-generalized-series-parallel-graphs-1707.06443"/></url>
<url><loc>https://scifaro.com/en/abs/an-explicit-construction-of-optimal-dominating-sets-in-grid-1707.06471</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-explicit-construction-of-optimal-dominating-sets-in-grid-1707.06471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-explicit-construction-of-optimal-dominating-sets-in-grid-1707.06471"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-orbits-of-crossed-cubes-1707.06763</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-orbits-of-crossed-cubes-1707.06763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-orbits-of-crossed-cubes-1707.06763"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-on-nowhere-dense-graph-classes-1707.06775</loc><lastmod>2018-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-on-nowhere-dense-graph-classes-1707.06775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-on-nowhere-dense-graph-classes-1707.06775"/></url>
<url><loc>https://scifaro.com/en/abs/some-classes-of-graphs-that-are-not-pcgs-1707.07436</loc><lastmod>2017-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-classes-of-graphs-that-are-not-pcgs-1707.07436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-classes-of-graphs-that-are-not-pcgs-1707.07436"/></url>
<url><loc>https://scifaro.com/en/abs/the-switch-operators-and-push-the-button-games-a-sequential-compound-over-rulesets-1707.07966</loc><lastmod>2017-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-switch-operators-and-push-the-button-games-a-sequential-compound-over-rulesets-1707.07966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-switch-operators-and-push-the-button-games-a-sequential-compound-over-rulesets-1707.07966"/></url>
<url><loc>https://scifaro.com/en/abs/a-bijection-for-essentially-4-connected-toroidal-triangulations-1707.08191</loc><lastmod>2017-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bijection-for-essentially-4-connected-toroidal-triangulations-1707.08191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bijection-for-essentially-4-connected-toroidal-triangulations-1707.08191"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-ic-planar-graphs-1707.08652</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-ic-planar-graphs-1707.08652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-ic-planar-graphs-1707.08652"/></url>
<url><loc>https://scifaro.com/en/abs/a-family-of-metrics-for-clustering-algorithms-1707.08912</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-family-of-metrics-for-clustering-algorithms-1707.08912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-family-of-metrics-for-clustering-algorithms-1707.08912"/></url>
<url><loc>https://scifaro.com/en/abs/physically-feasible-decomposition-of-engino-circledr-toy-models-a-graph-theoretic-approach-1707.09040</loc><lastmod>2018-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/physically-feasible-decomposition-of-engino-circledr-toy-models-a-graph-theoretic-approach-1707.09040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/physically-feasible-decomposition-of-engino-circledr-toy-models-a-graph-theoretic-approach-1707.09040"/></url>
<url><loc>https://scifaro.com/en/abs/out-degree-reducing-partitions-of-digraphs-1707.09349</loc><lastmod>2017-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/out-degree-reducing-partitions-of-digraphs-1707.09349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/out-degree-reducing-partitions-of-digraphs-1707.09349"/></url>
<url><loc>https://scifaro.com/en/abs/bipartite-spanning-sub-di-graphs-induced-by-2-partitions-1707.09400</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bipartite-spanning-sub-di-graphs-induced-by-2-partitions-1707.09400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bipartite-spanning-sub-di-graphs-induced-by-2-partitions-1707.09400"/></url>
<url><loc>https://scifaro.com/en/abs/relations-between-greedy-and-bit-optimal-lz77-encodings-1707.09789</loc><lastmod>2018-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relations-between-greedy-and-bit-optimal-lz77-encodings-1707.09789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relations-between-greedy-and-bit-optimal-lz77-encodings-1707.09789"/></url>
<url><loc>https://scifaro.com/en/abs/lossy-kernels-for-connected-distance-r-domination-on-nowhere-dense-graph-classes-1707.09819</loc><lastmod>2018-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lossy-kernels-for-connected-distance-r-domination-on-nowhere-dense-graph-classes-1707.09819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lossy-kernels-for-connected-distance-r-domination-on-nowhere-dense-graph-classes-1707.09819"/></url>
<url><loc>https://scifaro.com/en/abs/on-outer-connected-domination-for-graph-products-1708.00188</loc><lastmod>2017-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-outer-connected-domination-for-graph-products-1708.00188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-outer-connected-domination-for-graph-products-1708.00188"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-on-1-k-sets-of-lexicographic-products-of-graphs-1708.00219</loc><lastmod>2017-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-on-1-k-sets-of-lexicographic-products-of-graphs-1708.00219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-on-1-k-sets-of-lexicographic-products-of-graphs-1708.00219"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-mixed-domination-on-generalized-series-parallel-graphs-1708.00240</loc><lastmod>2017-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-mixed-domination-on-generalized-series-parallel-graphs-1708.00240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-mixed-domination-on-generalized-series-parallel-graphs-1708.00240"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-sum-labeling-of-graphs-1708.00552</loc><lastmod>2017-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-sum-labeling-of-graphs-1708.00552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-sum-labeling-of-graphs-1708.00552"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-average-straightness-in-spatial-graphs-1708.00743</loc><lastmod>2023-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-average-straightness-in-spatial-graphs-1708.00743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-average-straightness-in-spatial-graphs-1708.00743"/></url>
<url><loc>https://scifaro.com/en/abs/exact-values-for-three-domination-like-problems-in-circular-and-infinite-grid-graphs-of-small-height-1708.00758</loc><lastmod>2017-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-values-for-three-domination-like-problems-in-circular-and-infinite-grid-graphs-of-small-height-1708.00758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-values-for-three-domination-like-problems-in-circular-and-infinite-grid-graphs-of-small-height-1708.00758"/></url>
<url><loc>https://scifaro.com/en/abs/solving-and-sampling-with-many-solutions-satisfiability-and-other-hard-problems-1708.01122</loc><lastmod>2017-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-and-sampling-with-many-solutions-satisfiability-and-other-hard-problems-1708.01122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-and-sampling-with-many-solutions-satisfiability-and-other-hard-problems-1708.01122"/></url>
<url><loc>https://scifaro.com/en/abs/spatial-mixing-and-non-local-markov-chains-1708.01513</loc><lastmod>2017-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spatial-mixing-and-non-local-markov-chains-1708.01513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spatial-mixing-and-non-local-markov-chains-1708.01513"/></url>
<url><loc>https://scifaro.com/en/abs/inheritance-of-convexity-for-the-mathcal-p-min-restricted-game-1708.02675</loc><lastmod>2019-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inheritance-of-convexity-for-the-mathcal-p-min-restricted-game-1708.02675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inheritance-of-convexity-for-the-mathcal-p-min-restricted-game-1708.02675"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-quantum-computing-without-the-physics-1708.03684</loc><lastmod>2020-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-quantum-computing-without-the-physics-1708.03684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-quantum-computing-without-the-physics-1708.03684"/></url>
<url><loc>https://scifaro.com/en/abs/an-interactive-version-of-the-lov-asz-local-lemma-1708.03954</loc><lastmod>2018-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interactive-version-of-the-lov-asz-local-lemma-1708.03954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interactive-version-of-the-lov-asz-local-lemma-1708.03954"/></url>
<url><loc>https://scifaro.com/en/abs/on-almost-well-covered-graphs-of-girth-at-least-6-1708.04632</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-almost-well-covered-graphs-of-girth-at-least-6-1708.04632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-almost-well-covered-graphs-of-girth-at-least-6-1708.04632"/></url>
<url><loc>https://scifaro.com/en/abs/distances-and-isomorphism-between-networks-stability-and-convergence-of-network-invariants-1708.04727</loc><lastmod>2022-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distances-and-isomorphism-between-networks-stability-and-convergence-of-network-invariants-1708.04727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distances-and-isomorphism-between-networks-stability-and-convergence-of-network-invariants-1708.04727"/></url>
<url><loc>https://scifaro.com/en/abs/rapid-mixing-of-k-class-biased-permutations-1708.05078</loc><lastmod>2017-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rapid-mixing-of-k-class-biased-permutations-1708.05078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rapid-mixing-of-k-class-biased-permutations-1708.05078"/></url>
<url><loc>https://scifaro.com/en/abs/structure-learning-of-h-colorings-1708.05118</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-learning-of-h-colorings-1708.05118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-learning-of-h-colorings-1708.05118"/></url>
<url><loc>https://scifaro.com/en/abs/triangle-free-penny-graphs-degeneracy-choosability-and-edge-count-1708.05152</loc><lastmod>2018-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangle-free-penny-graphs-degeneracy-choosability-and-edge-count-1708.05152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangle-free-penny-graphs-degeneracy-choosability-and-edge-count-1708.05152"/></url>
<url><loc>https://scifaro.com/en/abs/the-effect-of-planarization-on-width-1708.05155</loc><lastmod>2018-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-effect-of-planarization-on-width-1708.05155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-effect-of-planarization-on-width-1708.05155"/></url>
<url><loc>https://scifaro.com/en/abs/when-data-mining-meets-optimization-a-case-study-on-the-quadratic-assignment-problem-1708.05214</loc><lastmod>2017-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-data-mining-meets-optimization-a-case-study-on-the-quadratic-assignment-problem-1708.05214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-data-mining-meets-optimization-a-case-study-on-the-quadratic-assignment-problem-1708.05214"/></url>
<url><loc>https://scifaro.com/en/abs/min-max-theorems-for-packing-and-covering-odd-u-v-trails-1708.06857</loc><lastmod>2017-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/min-max-theorems-for-packing-and-covering-odd-u-v-trails-1708.06857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/min-max-theorems-for-packing-and-covering-odd-u-v-trails-1708.06857"/></url>
<url><loc>https://scifaro.com/en/abs/limited-visibility-cops-and-robbers-1708.07179</loc><lastmod>2017-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limited-visibility-cops-and-robbers-1708.07179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limited-visibility-cops-and-robbers-1708.07179"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-linearizable-instances-of-the-quadratic-traveling-salesman-problem-1708.07217</loc><lastmod>2018-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-linearizable-instances-of-the-quadratic-traveling-salesman-problem-1708.07217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-linearizable-instances-of-the-quadratic-traveling-salesman-problem-1708.07217"/></url>
<url><loc>https://scifaro.com/en/abs/the-weisfeiler-leman-dimension-of-planar-graphs-is-at-most-3-1708.07354</loc><lastmod>2017-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weisfeiler-leman-dimension-of-planar-graphs-is-at-most-3-1708.07354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weisfeiler-leman-dimension-of-planar-graphs-is-at-most-3-1708.07354"/></url>
<url><loc>https://scifaro.com/en/abs/a-human-checkable-four-color-theorem-proof-1708.07442</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-human-checkable-four-color-theorem-proof-1708.07442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-human-checkable-four-color-theorem-proof-1708.07442"/></url>
<url><loc>https://scifaro.com/en/abs/inverse-of-a-special-matrix-and-application-1708.07795</loc><lastmod>2017-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inverse-of-a-special-matrix-and-application-1708.07795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inverse-of-a-special-matrix-and-application-1708.07795"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-outerplanarity-1708.08723</loc><lastmod>2024-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-outerplanarity-1708.08723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-outerplanarity-1708.08723"/></url>
<url><loc>https://scifaro.com/en/abs/differentiable-cellular-automata-1708.09546</loc><lastmod>2017-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentiable-cellular-automata-1708.09546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentiable-cellular-automata-1708.09546"/></url>
<url><loc>https://scifaro.com/en/abs/structural-properties-of-biclique-graphs-and-the-distance-formula-1708.09686</loc><lastmod>2021-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-properties-of-biclique-graphs-and-the-distance-formula-1708.09686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-properties-of-biclique-graphs-and-the-distance-formula-1708.09686"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-note-on-the-joint-entropy-of-n-2-wise-independence-1709.00752</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-note-on-the-joint-entropy-of-n-2-wise-independence-1709.00752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-note-on-the-joint-entropy-of-n-2-wise-independence-1709.00752"/></url>
<url><loc>https://scifaro.com/en/abs/making-bidirected-graphs-strongly-connected-1709.00824</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-bidirected-graphs-strongly-connected-1709.00824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-bidirected-graphs-strongly-connected-1709.00824"/></url>
<url><loc>https://scifaro.com/en/abs/mip-formulations-for-the-steiner-forest-problem-1709.01124</loc><lastmod>2017-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mip-formulations-for-the-steiner-forest-problem-1709.01124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mip-formulations-for-the-steiner-forest-problem-1709.01124"/></url>
<url><loc>https://scifaro.com/en/abs/simple-necessary-conditions-for-the-existence-of-a-hamiltonian-path-with-applications-to-cactus-graphs-1709.01367</loc><lastmod>2017-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-necessary-conditions-for-the-existence-of-a-hamiltonian-path-with-applications-to-cactus-graphs-1709.01367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-necessary-conditions-for-the-existence-of-a-hamiltonian-path-with-applications-to-cactus-graphs-1709.01367"/></url>
<url><loc>https://scifaro.com/en/abs/an-exact-approach-for-the-balanced-k-way-partitioning-problem-with-weight-constraints-and-its-application-to-sports-team-realignment-1709.01433</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-exact-approach-for-the-balanced-k-way-partitioning-problem-with-weight-constraints-and-its-application-to-sports-team-realignment-1709.01433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-exact-approach-for-the-balanced-k-way-partitioning-problem-with-weight-constraints-and-its-application-to-sports-team-realignment-1709.01433"/></url>
<url><loc>https://scifaro.com/en/abs/connectivity-in-interdependent-networks-1709.03034</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connectivity-in-interdependent-networks-1709.03034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connectivity-in-interdependent-networks-1709.03034"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-cake-cutting-with-unequal-shares-1709.03152</loc><lastmod>2018-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-cake-cutting-with-unequal-shares-1709.03152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-cake-cutting-with-unequal-shares-1709.03152"/></url>
<url><loc>https://scifaro.com/en/abs/a-neighborhood-preserving-translation-operator-on-graphs-1709.03859</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-neighborhood-preserving-translation-operator-on-graphs-1709.03859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-neighborhood-preserving-translation-operator-on-graphs-1709.03859"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-matchings-and-minimum-dominating-sets-in-apollonian-networks-and-extended-tower-of-hanoi-graphs-1709.04404</loc><lastmod>2017-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-matchings-and-minimum-dominating-sets-in-apollonian-networks-and-extended-tower-of-hanoi-graphs-1709.04404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-matchings-and-minimum-dominating-sets-in-apollonian-networks-and-extended-tower-of-hanoi-graphs-1709.04404"/></url>
<url><loc>https://scifaro.com/en/abs/embedded-graph-theory-1709.04710</loc><lastmod>2017-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedded-graph-theory-1709.04710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedded-graph-theory-1709.04710"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-and-locally-bounded-list-colorings-in-split-graphs-cographs-and-partial-k-trees-1709.05000</loc><lastmod>2017-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-and-locally-bounded-list-colorings-in-split-graphs-cographs-and-partial-k-trees-1709.05000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-and-locally-bounded-list-colorings-in-split-graphs-cographs-and-partial-k-trees-1709.05000"/></url>
<url><loc>https://scifaro.com/en/abs/variable-version-lov-asz-local-lemma-beyond-shearer-s-bound-1709.05143</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-version-lov-asz-local-lemma-beyond-shearer-s-bound-1709.05143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-version-lov-asz-local-lemma-beyond-shearer-s-bound-1709.05143"/></url>
<url><loc>https://scifaro.com/en/abs/on-graphs-and-the-gotsman-linial-conjecture-for-d-2-1709.06650</loc><lastmod>2017-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-graphs-and-the-gotsman-linial-conjecture-for-d-2-1709.06650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-graphs-and-the-gotsman-linial-conjecture-for-d-2-1709.06650"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-the-switch-and-curveball-markov-chains-for-sampling-binary-matrices-with-fixed-marginals-1709.07290</loc><lastmod>2017-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-the-switch-and-curveball-markov-chains-for-sampling-binary-matrices-with-fixed-marginals-1709.07290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-the-switch-and-curveball-markov-chains-for-sampling-binary-matrices-with-fixed-marginals-1709.07290"/></url>
<url><loc>https://scifaro.com/en/abs/interdependence-of-clusters-measures-and-distance-distribution-in-compact-metric-spaces-1709.08280</loc><lastmod>2017-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interdependence-of-clusters-measures-and-distance-distribution-in-compact-metric-spaces-1709.08280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interdependence-of-clusters-measures-and-distance-distribution-in-compact-metric-spaces-1709.08280"/></url>
<url><loc>https://scifaro.com/en/abs/on-improved-bound-for-measure-of-cluster-structure-in-compact-metric-spaces-1709.08286</loc><lastmod>2017-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-improved-bound-for-measure-of-cluster-structure-in-compact-metric-spaces-1709.08286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-improved-bound-for-measure-of-cluster-structure-in-compact-metric-spaces-1709.08286"/></url>
<url><loc>https://scifaro.com/en/abs/cluster-editing-for-multi-layer-and-temporal-graphs-1709.09100</loc><lastmod>2018-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cluster-editing-for-multi-layer-and-temporal-graphs-1709.09100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cluster-editing-for-multi-layer-and-temporal-graphs-1709.09100"/></url>
<url><loc>https://scifaro.com/en/abs/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-application-1709.09152</loc><lastmod>2018-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-application-1709.09152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-application-1709.09152"/></url>
<url><loc>https://scifaro.com/en/abs/random-overlapping-communities-approximating-motif-densities-of-large-graphs-1709.09477</loc><lastmod>2017-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-overlapping-communities-approximating-motif-densities-of-large-graphs-1709.09477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-overlapping-communities-approximating-motif-densities-of-large-graphs-1709.09477"/></url>
<url><loc>https://scifaro.com/en/abs/recovering-sparse-graphs-1709.09985</loc><lastmod>2018-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recovering-sparse-graphs-1709.09985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recovering-sparse-graphs-1709.09985"/></url>
<url><loc>https://scifaro.com/en/abs/target-set-selection-parameterized-by-clique-width-and-maximum-threshold-1710.00635</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/target-set-selection-parameterized-by-clique-width-and-maximum-threshold-1710.00635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/target-set-selection-parameterized-by-clique-width-and-maximum-threshold-1710.00635"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-domination-models-for-placement-of-electric-vehicle-charging-stations-in-road-networks-1710.01294</loc><lastmod>2017-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-domination-models-for-placement-of-electric-vehicle-charging-stations-in-road-networks-1710.01294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-domination-models-for-placement-of-electric-vehicle-charging-stations-in-road-networks-1710.01294"/></url>
<url><loc>https://scifaro.com/en/abs/normality-of-the-ehrenfeucht-mycielski-sequence-1710.01325</loc><lastmod>2017-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normality-of-the-ehrenfeucht-mycielski-sequence-1710.01325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normality-of-the-ehrenfeucht-mycielski-sequence-1710.01325"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-centrality-improvement-in-networks-1710.01576</loc><lastmod>2017-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-centrality-improvement-in-networks-1710.01576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-centrality-improvement-in-networks-1710.01576"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-edge-monitoring-on-some-graph-classes-1710.02013</loc><lastmod>2017-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-edge-monitoring-on-some-graph-classes-1710.02013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-edge-monitoring-on-some-graph-classes-1710.02013"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-miller-hagberg-algorithm-for-randomization-of-dense-networks-1710.02733</loc><lastmod>2017-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-miller-hagberg-algorithm-for-randomization-of-dense-networks-1710.02733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-miller-hagberg-algorithm-for-randomization-of-dense-networks-1710.02733"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-difficulties-in-the-addition-of-trapezoidal-ordered-fuzzy-numbers-1710.03541</loc><lastmod>2017-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-difficulties-in-the-addition-of-trapezoidal-ordered-fuzzy-numbers-1710.03541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-difficulties-in-the-addition-of-trapezoidal-ordered-fuzzy-numbers-1710.03541"/></url>
<url><loc>https://scifaro.com/en/abs/modular-decomposition-of-transitive-graphs-and-transitively-orienting-their-complements-1710.04333</loc><lastmod>2017-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-decomposition-of-transitive-graphs-and-transitively-orienting-their-complements-1710.04333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-decomposition-of-transitive-graphs-and-transitively-orienting-their-complements-1710.04333"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-maximum-matching-width-is-np-hard-1710.05117</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-maximum-matching-width-is-np-hard-1710.05117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-maximum-matching-width-is-np-hard-1710.05117"/></url>
<url><loc>https://scifaro.com/en/abs/nivat-s-conjecture-holds-for-sums-of-two-periodic-configurations-1710.05360</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nivat-s-conjecture-holds-for-sums-of-two-periodic-configurations-1710.05360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nivat-s-conjecture-holds-for-sums-of-two-periodic-configurations-1710.05360"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-erd-h-o-s-p-osa-function-for-wheel-minors-1710.06282</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-erd-h-o-s-p-osa-function-for-wheel-minors-1710.06282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-erd-h-o-s-p-osa-function-for-wheel-minors-1710.06282"/></url>
<url><loc>https://scifaro.com/en/abs/the-hard-problems-are-almost-everywhere-for-random-cnf-xor-formulas-1710.06378</loc><lastmod>2017-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hard-problems-are-almost-everywhere-for-random-cnf-xor-formulas-1710.06378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hard-problems-are-almost-everywhere-for-random-cnf-xor-formulas-1710.06378"/></url>
<url><loc>https://scifaro.com/en/abs/relaxation-based-coarsening-for-multilevel-hypergraph-partitioning-1710.06552</loc><lastmod>2022-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relaxation-based-coarsening-for-multilevel-hypergraph-partitioning-1710.06552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relaxation-based-coarsening-for-multilevel-hypergraph-partitioning-1710.06552"/></url>
<url><loc>https://scifaro.com/en/abs/a-recognition-algorithm-for-simple-triangle-graphs-1710.06559</loc><lastmod>2018-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recognition-algorithm-for-simple-triangle-graphs-1710.06559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recognition-algorithm-for-simple-triangle-graphs-1710.06559"/></url>
<url><loc>https://scifaro.com/en/abs/a-1-1-algorithm-for-the-hamilton-cycle-problem-1710.06974</loc><lastmod>2020-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-1-1-algorithm-for-the-hamilton-cycle-problem-1710.06974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-1-1-algorithm-for-the-hamilton-cycle-problem-1710.06974"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computational-complexity-of-the-bipartizing-matching-problem-1710.07741</loc><lastmod>2019-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computational-complexity-of-the-bipartizing-matching-problem-1710.07741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computational-complexity-of-the-bipartizing-matching-problem-1710.07741"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-pursuits-on-graphs-1710.08107</loc><lastmod>2019-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-pursuits-on-graphs-1710.08107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-pursuits-on-graphs-1710.08107"/></url>
<url><loc>https://scifaro.com/en/abs/two-dichotomies-for-model-checking-in-multi-layer-structures-1710.08758</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-dichotomies-for-model-checking-in-multi-layer-structures-1710.08758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-dichotomies-for-model-checking-in-multi-layer-structures-1710.08758"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-locally-injective-homomorphisms-to-tournaments-1710.08825</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-locally-injective-homomorphisms-to-tournaments-1710.08825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-locally-injective-homomorphisms-to-tournaments-1710.08825"/></url>
<url><loc>https://scifaro.com/en/abs/cross-identification-of-stellar-catalogs-with-multiple-stars-complexity-and-resolution-1710.09417</loc><lastmod>2018-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cross-identification-of-stellar-catalogs-with-multiple-stars-complexity-and-resolution-1710.09417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cross-identification-of-stellar-catalogs-with-multiple-stars-complexity-and-resolution-1710.09417"/></url>
<url><loc>https://scifaro.com/en/abs/convolutional-neural-networks-on-irregular-domains-based-on-approximate-vertex-domain-translations-1710.10035</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convolutional-neural-networks-on-irregular-domains-based-on-approximate-vertex-domain-translations-1710.10035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convolutional-neural-networks-on-irregular-domains-based-on-approximate-vertex-domain-translations-1710.10035"/></url>
<url><loc>https://scifaro.com/en/abs/rapidly-mixing-markov-chain-monte-carlo-technique-for-matching-problems-with-global-utility-function-1710.10037</loc><lastmod>2017-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rapidly-mixing-markov-chain-monte-carlo-technique-for-matching-problems-with-global-utility-function-1710.10037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rapidly-mixing-markov-chain-monte-carlo-technique-for-matching-problems-with-global-utility-function-1710.10037"/></url>
<url><loc>https://scifaro.com/en/abs/a-o-d-cdot-text-polylog-n-monotonicity-tester-for-boolean-functions-over-the-hypergrid-n-d-1710.10545</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-o-d-cdot-text-polylog-n-monotonicity-tester-for-boolean-functions-over-the-hypergrid-n-d-1710.10545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-o-d-cdot-text-polylog-n-monotonicity-tester-for-boolean-functions-over-the-hypergrid-n-d-1710.10545"/></url>
<url><loc>https://scifaro.com/en/abs/variations-of-the-cop-and-robber-game-on-graphs-1710.11352</loc><lastmod>2017-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variations-of-the-cop-and-robber-game-on-graphs-1710.11352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variations-of-the-cop-and-robber-game-on-graphs-1710.11352"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-concatenation-construction-for-q-ary-1-perfect-codes-1711.00189</loc><lastmod>2017-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-concatenation-construction-for-q-ary-1-perfect-codes-1711.00189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-concatenation-construction-for-q-ary-1-perfect-codes-1711.00189"/></url>
<url><loc>https://scifaro.com/en/abs/partial-homology-relations-satisfiability-in-terms-of-di-cographs-1711.00504</loc><lastmod>2018-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-homology-relations-satisfiability-in-terms-of-di-cographs-1711.00504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-homology-relations-satisfiability-in-terms-of-di-cographs-1711.00504"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-approximation-algorithm-for-network-immunization-1711.00784</loc><lastmod>2017-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-approximation-algorithm-for-network-immunization-1711.00784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-approximation-algorithm-for-network-immunization-1711.00784"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-methods-for-immunization-of-large-networks-1711.00791</loc><lastmod>2017-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-methods-for-immunization-of-large-networks-1711.00791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-methods-for-immunization-of-large-networks-1711.00791"/></url>
<url><loc>https://scifaro.com/en/abs/a-simply-exponential-upper-bound-on-the-maximum-number-of-stable-matchings-1711.01032</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simply-exponential-upper-bound-on-the-maximum-number-of-stable-matchings-1711.01032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simply-exponential-upper-bound-on-the-maximum-number-of-stable-matchings-1711.01032"/></url>
<url><loc>https://scifaro.com/en/abs/finding-branch-decompositions-of-matroids-hypergraphs-and-more-1711.01381</loc><lastmod>2022-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-branch-decompositions-of-matroids-hypergraphs-and-more-1711.01381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-branch-decompositions-of-matroids-hypergraphs-and-more-1711.01381"/></url>
<url><loc>https://scifaro.com/en/abs/diffusion-operator-and-spectral-analysis-for-directed-hypergraph-laplacian-1711.01560</loc><lastmod>2017-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diffusion-operator-and-spectral-analysis-for-directed-hypergraph-laplacian-1711.01560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diffusion-operator-and-spectral-analysis-for-directed-hypergraph-laplacian-1711.01560"/></url>
<url><loc>https://scifaro.com/en/abs/directed-graph-minors-and-serial-parallel-width-1711.01806</loc><lastmod>2019-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-graph-minors-and-serial-parallel-width-1711.01806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-graph-minors-and-serial-parallel-width-1711.01806"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-aspects-of-point-visibility-graphs-1711.01811</loc><lastmod>2018-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-aspects-of-point-visibility-graphs-1711.01811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-aspects-of-point-visibility-graphs-1711.01811"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-gene-trees-from-fitch-s-xenology-relation-1711.02152</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-gene-trees-from-fitch-s-xenology-relation-1711.02152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-gene-trees-from-fitch-s-xenology-relation-1711.02152"/></url>
<url><loc>https://scifaro.com/en/abs/yet-another-proof-of-the-aperiodicity-of-robinson-tiles-1711.03401</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/yet-another-proof-of-the-aperiodicity-of-robinson-tiles-1711.03401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/yet-another-proof-of-the-aperiodicity-of-robinson-tiles-1711.03401"/></url>
<url><loc>https://scifaro.com/en/abs/scheduling-with-regular-performance-measures-and-optional-job-rejection-on-a-single-machine-1711.03720</loc><lastmod>2018-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scheduling-with-regular-performance-measures-and-optional-job-rejection-on-a-single-machine-1711.03720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scheduling-with-regular-performance-measures-and-optional-job-rejection-on-a-single-machine-1711.03720"/></url>
<url><loc>https://scifaro.com/en/abs/group-connectivity-mathbb-z-4-v-mathbb-z-2-2-1711.03895</loc><lastmod>2017-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/group-connectivity-mathbb-z-4-v-mathbb-z-2-2-1711.03895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/group-connectivity-mathbb-z-4-v-mathbb-z-2-2-1711.03895"/></url>
<url><loc>https://scifaro.com/en/abs/sequences-of-radius-k-for-complete-bipartite-graphs-1711.05091</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequences-of-radius-k-for-complete-bipartite-graphs-1711.05091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequences-of-radius-k-for-complete-bipartite-graphs-1711.05091"/></url>
<url><loc>https://scifaro.com/en/abs/on-edge-intersection-graphs-of-paths-with-2-bends-1711.05096</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-edge-intersection-graphs-of-paths-with-2-bends-1711.05096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-edge-intersection-graphs-of-paths-with-2-bends-1711.05096"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-convergence-time-of-local-probabilistic-evolution-1711.06024</loc><lastmod>2017-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-convergence-time-of-local-probabilistic-evolution-1711.06024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-convergence-time-of-local-probabilistic-evolution-1711.06024"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parikh-de-bruijn-grid-1711.06264</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parikh-de-bruijn-grid-1711.06264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parikh-de-bruijn-grid-1711.06264"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-graph-rewiring-algorithm-for-sampling-spanning-trees-1711.07432</loc><lastmod>2017-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-graph-rewiring-algorithm-for-sampling-spanning-trees-1711.07432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-graph-rewiring-algorithm-for-sampling-spanning-trees-1711.07432"/></url>
<url><loc>https://scifaro.com/en/abs/on-p-5-free-chordal-bipartite-graphs-1711.07736</loc><lastmod>2017-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-p-5-free-chordal-bipartite-graphs-1711.07736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-p-5-free-chordal-bipartite-graphs-1711.07736"/></url>
<url><loc>https://scifaro.com/en/abs/solving-graph-isomorphism-problem-for-a-special-case-1711.08222</loc><lastmod>2017-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-graph-isomorphism-problem-for-a-special-case-1711.08222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-graph-isomorphism-problem-for-a-special-case-1711.08222"/></url>
<url><loc>https://scifaro.com/en/abs/vertex-partitions-of-c-3-c-4-c-6-free-planar-graphs-1711.08710</loc><lastmod>2017-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertex-partitions-of-c-3-c-4-c-6-free-planar-graphs-1711.08710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertex-partitions-of-c-3-c-4-c-6-free-planar-graphs-1711.08710"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-path-in-split-graphs-a-dichotomy-1711.09262</loc><lastmod>2017-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-path-in-split-graphs-a-dichotomy-1711.09262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-path-in-split-graphs-a-dichotomy-1711.09262"/></url>
<url><loc>https://scifaro.com/en/abs/new-covering-array-numbers-1711.10040</loc><lastmod>2020-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-covering-array-numbers-1711.10040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-covering-array-numbers-1711.10040"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-semitotal-domination-in-graphs-1711.10891</loc><lastmod>2017-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-semitotal-domination-in-graphs-1711.10891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-semitotal-domination-in-graphs-1711.10891"/></url>
<url><loc>https://scifaro.com/en/abs/on-s-packing-edge-colorings-of-cubic-graphs-1711.10906</loc><lastmod>2017-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-s-packing-edge-colorings-of-cubic-graphs-1711.10906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-s-packing-edge-colorings-of-cubic-graphs-1711.10906"/></url>
<url><loc>https://scifaro.com/en/abs/on-density-of-subgraphs-of-halved-cubes-1711.11414</loc><lastmod>2017-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-density-of-subgraphs-of-halved-cubes-1711.11414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-density-of-subgraphs-of-halved-cubes-1711.11414"/></url>
<url><loc>https://scifaro.com/en/abs/on-density-of-subgraphs-of-cartesian-products-1711.11485</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-density-of-subgraphs-of-cartesian-products-1711.11485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-density-of-subgraphs-of-cartesian-products-1711.11485"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-simultaneous-minimum-spanning-trees-problem-1712.00253</loc><lastmod>2017-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-simultaneous-minimum-spanning-trees-problem-1712.00253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-simultaneous-minimum-spanning-trees-problem-1712.00253"/></url>
<url><loc>https://scifaro.com/en/abs/the-snow-team-problem-clearing-directed-subgraphs-by-mobile-agents-1712.00316</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-snow-team-problem-clearing-directed-subgraphs-by-mobile-agents-1712.00316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-snow-team-problem-clearing-directed-subgraphs-by-mobile-agents-1712.00316"/></url>
<url><loc>https://scifaro.com/en/abs/digraph-polynomials-for-counting-cycles-and-paths-1712.00686</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digraph-polynomials-for-counting-cycles-and-paths-1712.00686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digraph-polynomials-for-counting-cycles-and-paths-1712.00686"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-note-on-undirected-fitch-graphs-1712.01544</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-note-on-undirected-fitch-graphs-1712.01544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-note-on-undirected-fitch-graphs-1712.01544"/></url>
<url><loc>https://scifaro.com/en/abs/lifting-linear-extension-complexity-bounds-to-the-mixed-integer-setting-1712.02176</loc><lastmod>2017-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifting-linear-extension-complexity-bounds-to-the-mixed-integer-setting-1712.02176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifting-linear-extension-complexity-bounds-to-the-mixed-integer-setting-1712.02176"/></url>
<url><loc>https://scifaro.com/en/abs/sets-of-stochastic-matrices-with-converging-products-bounds-and-complexity-1712.02614</loc><lastmod>2017-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sets-of-stochastic-matrices-with-converging-products-bounds-and-complexity-1712.02614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sets-of-stochastic-matrices-with-converging-products-bounds-and-complexity-1712.02614"/></url>
<url><loc>https://scifaro.com/en/abs/dispersion-processes-1712.03389</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dispersion-processes-1712.03389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dispersion-processes-1712.03389"/></url>
<url><loc>https://scifaro.com/en/abs/the-minimum-edge-compact-spanner-network-design-problem-1712.04010</loc><lastmod>2017-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-minimum-edge-compact-spanner-network-design-problem-1712.04010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-minimum-edge-compact-spanner-network-design-problem-1712.04010"/></url>
<url><loc>https://scifaro.com/en/abs/closing-the-gap-for-pseudo-polynomial-strip-packing-1712.04922</loc><lastmod>2019-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closing-the-gap-for-pseudo-polynomial-strip-packing-1712.04922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closing-the-gap-for-pseudo-polynomial-strip-packing-1712.04922"/></url>
<url><loc>https://scifaro.com/en/abs/one-pass-graphic-approximation-of-integer-sequences-1712.05240</loc><lastmod>2017-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-pass-graphic-approximation-of-integer-sequences-1712.05240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-pass-graphic-approximation-of-integer-sequences-1712.05240"/></url>
<url><loc>https://scifaro.com/en/abs/results-for-the-maximum-weight-planar-subgraph-problem-1712.05711</loc><lastmod>2017-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/results-for-the-maximum-weight-planar-subgraph-problem-1712.05711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/results-for-the-maximum-weight-planar-subgraph-problem-1712.05711"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-digital-n-dimensional-spheres-and-manifolds-separation-of-digital-manifolds-1712.06108</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-digital-n-dimensional-spheres-and-manifolds-separation-of-digital-manifolds-1712.06108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-digital-n-dimensional-spheres-and-manifolds-separation-of-digital-manifolds-1712.06108"/></url>
<url><loc>https://scifaro.com/en/abs/network-coding-algorithms-for-multi-layered-video-broadcast-1712.06435</loc><lastmod>2017-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/network-coding-algorithms-for-multi-layered-video-broadcast-1712.06435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/network-coding-algorithms-for-multi-layered-video-broadcast-1712.06435"/></url>
<url><loc>https://scifaro.com/en/abs/phylogenomics-with-paralogs-1712.06442</loc><lastmod>2017-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/phylogenomics-with-paralogs-1712.06442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/phylogenomics-with-paralogs-1712.06442"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-k-independent-graphs-and-c-colorable-subgraphs-in-scheduling-a-review-1712.06481</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-k-independent-graphs-and-c-colorable-subgraphs-in-scheduling-a-review-1712.06481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-k-independent-graphs-and-c-colorable-subgraphs-in-scheduling-a-review-1712.06481"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-sch-o-nemann-s-theorem-via-a-graph-theoretic-method-1712.06770</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-sch-o-nemann-s-theorem-via-a-graph-theoretic-method-1712.06770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-sch-o-nemann-s-theorem-via-a-graph-theoretic-method-1712.06770"/></url>
<url><loc>https://scifaro.com/en/abs/on-fan-crossing-graphs-1712.06840</loc><lastmod>2017-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-fan-crossing-graphs-1712.06840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-fan-crossing-graphs-1712.06840"/></url>
<url><loc>https://scifaro.com/en/abs/transversals-of-longest-paths-1712.07086</loc><lastmod>2017-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transversals-of-longest-paths-1712.07086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transversals-of-longest-paths-1712.07086"/></url>
<url><loc>https://scifaro.com/en/abs/the-graph-tessellation-cover-number-extremal-bounds-efficient-algorithms-and-hardness-1712.07476</loc><lastmod>2021-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graph-tessellation-cover-number-extremal-bounds-efficient-algorithms-and-hardness-1712.07476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graph-tessellation-cover-number-extremal-bounds-efficient-algorithms-and-hardness-1712.07476"/></url>
<url><loc>https://scifaro.com/en/abs/phoeg-helps-obtaining-extremal-graphs-1712.07861</loc><lastmod>2017-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/phoeg-helps-obtaining-extremal-graphs-1712.07861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/phoeg-helps-obtaining-extremal-graphs-1712.07861"/></url>
<url><loc>https://scifaro.com/en/abs/adjacency-and-tensor-representation-in-general-hypergraphs-part-1-e-adjacency-tensor-uniformisation-using-homogeneous-polynomials-1712.08189</loc><lastmod>2018-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjacency-and-tensor-representation-in-general-hypergraphs-part-1-e-adjacency-tensor-uniformisation-using-homogeneous-polynomials-1712.08189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjacency-and-tensor-representation-in-general-hypergraphs-part-1-e-adjacency-tensor-uniformisation-using-homogeneous-polynomials-1712.08189"/></url>
<url><loc>https://scifaro.com/en/abs/finding-submodularity-hidden-in-symmetric-difference-1712.08721</loc><lastmod>2019-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-submodularity-hidden-in-symmetric-difference-1712.08721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-submodularity-hidden-in-symmetric-difference-1712.08721"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-planarity-density-results-for-bipartite-graphs-1712.09855</loc><lastmod>2017-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-planarity-density-results-for-bipartite-graphs-1712.09855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-planarity-density-results-for-bipartite-graphs-1712.09855"/></url>
<url><loc>https://scifaro.com/en/abs/simple-cubic-graphs-with-no-short-traveling-salesman-tour-1712.10167</loc><lastmod>2018-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-cubic-graphs-with-no-short-traveling-salesman-tour-1712.10167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-cubic-graphs-with-no-short-traveling-salesman-tour-1712.10167"/></url>
<url><loc>https://scifaro.com/en/abs/on-approximating-the-stationary-distribution-of-time-reversible-markov-chains-1801.00196</loc><lastmod>2018-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-approximating-the-stationary-distribution-of-time-reversible-markov-chains-1801.00196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-approximating-the-stationary-distribution-of-time-reversible-markov-chains-1801.00196"/></url>
<url><loc>https://scifaro.com/en/abs/butterfly-counting-in-bipartite-networks-1801.00338</loc><lastmod>2018-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/butterfly-counting-in-bipartite-networks-1801.00338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/butterfly-counting-in-bipartite-networks-1801.00338"/></url>
<url><loc>https://scifaro.com/en/abs/secretary-problem-graphs-matroids-and-greedoids-1801.00814</loc><lastmod>2021-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/secretary-problem-graphs-matroids-and-greedoids-1801.00814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/secretary-problem-graphs-matroids-and-greedoids-1801.00814"/></url>
<url><loc>https://scifaro.com/en/abs/on-periodicity-lemma-for-partial-words-1801.01096</loc><lastmod>2018-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-periodicity-lemma-for-partial-words-1801.01096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-periodicity-lemma-for-partial-words-1801.01096"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-the-kawaguchi-kyan-bound-to-stochastic-parallel-machine-scheduling-1801.01105</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-the-kawaguchi-kyan-bound-to-stochastic-parallel-machine-scheduling-1801.01105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-the-kawaguchi-kyan-bound-to-stochastic-parallel-machine-scheduling-1801.01105"/></url>
<url><loc>https://scifaro.com/en/abs/a-tractable-class-of-binary-vcsps-via-m-convex-intersection-1801.02199</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tractable-class-of-binary-vcsps-via-m-convex-intersection-1801.02199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tractable-class-of-binary-vcsps-via-m-convex-intersection-1801.02199"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-graphs-with-polynomially-computable-kernels-1801.02253</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-graphs-with-polynomially-computable-kernels-1801.02253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-graphs-with-polynomially-computable-kernels-1801.02253"/></url>
<url><loc>https://scifaro.com/en/abs/five-proofs-of-chernoff-s-bound-with-applications-1801.03365</loc><lastmod>2019-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/five-proofs-of-chernoff-s-bound-with-applications-1801.03365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/five-proofs-of-chernoff-s-bound-with-applications-1801.03365"/></url>
<url><loc>https://scifaro.com/en/abs/structure-entropy-and-resistor-graphs-1801.03404</loc><lastmod>2018-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-entropy-and-resistor-graphs-1801.03404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-entropy-and-resistor-graphs-1801.03404"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-stackelberg-subset-sum-game-1801.03698</loc><lastmod>2018-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-stackelberg-subset-sum-game-1801.03698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-stackelberg-subset-sum-game-1801.03698"/></url>
<url><loc>https://scifaro.com/en/abs/discovering-the-hidden-community-structure-of-public-transportation-networks-1801.03857</loc><lastmod>2019-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discovering-the-hidden-community-structure-of-public-transportation-networks-1801.03857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discovering-the-hidden-community-structure-of-public-transportation-networks-1801.03857"/></url>
<url><loc>https://scifaro.com/en/abs/self-predicting-boolean-functions-1801.04103</loc><lastmod>2019-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-predicting-boolean-functions-1801.04103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-predicting-boolean-functions-1801.04103"/></url>
<url><loc>https://scifaro.com/en/abs/not-all-equal-and-1-in-degree-decompositions-algorithmic-complexity-and-applications-1801.04472</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/not-all-equal-and-1-in-degree-decompositions-algorithmic-complexity-and-applications-1801.04472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/not-all-equal-and-1-in-degree-decompositions-algorithmic-complexity-and-applications-1801.04472"/></url>
<url><loc>https://scifaro.com/en/abs/mixing-time-on-the-kagome-lattice-1801.04739</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixing-time-on-the-kagome-lattice-1801.04739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixing-time-on-the-kagome-lattice-1801.04739"/></url>
<url><loc>https://scifaro.com/en/abs/mixing-time-for-square-tilings-1801.04835</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixing-time-for-square-tilings-1801.04835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixing-time-for-square-tilings-1801.04835"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-a-theta-invariant-code-into-a-complete-one-1801.05164</loc><lastmod>2018-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-a-theta-invariant-code-into-a-complete-one-1801.05164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-a-theta-invariant-code-into-a-complete-one-1801.05164"/></url>
<url><loc>https://scifaro.com/en/abs/quasimonotone-graphs-1801.06494</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasimonotone-graphs-1801.06494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasimonotone-graphs-1801.06494"/></url>
<url><loc>https://scifaro.com/en/abs/even-flying-cops-should-think-ahead-1801.07193</loc><lastmod>2018-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/even-flying-cops-should-think-ahead-1801.07193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/even-flying-cops-should-think-ahead-1801.07193"/></url>
<url><loc>https://scifaro.com/en/abs/greed-is-still-good-maximizing-monotone-submodular-supermodular-functions-1801.07413</loc><lastmod>2018-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greed-is-still-good-maximizing-monotone-submodular-supermodular-functions-1801.07413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greed-is-still-good-maximizing-monotone-submodular-supermodular-functions-1801.07413"/></url>
<url><loc>https://scifaro.com/en/abs/stable-gonality-is-computable-1801.07553</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-gonality-is-computable-1801.07553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-gonality-is-computable-1801.07553"/></url>
<url><loc>https://scifaro.com/en/abs/integrality-gaps-for-colorful-matchings-1801.07937</loc><lastmod>2019-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrality-gaps-for-colorful-matchings-1801.07937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrality-gaps-for-colorful-matchings-1801.07937"/></url>
<url><loc>https://scifaro.com/en/abs/random-walk-fundamental-tensor-and-its-applications-to-network-analysis-1801.08583</loc><lastmod>2018-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-walk-fundamental-tensor-and-its-applications-to-network-analysis-1801.08583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-walk-fundamental-tensor-and-its-applications-to-network-analysis-1801.08583"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-algorithmic-complexity-of-decomposing-graphs-into-regular-irregular-structures-1801.08876</loc><lastmod>2018-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-algorithmic-complexity-of-decomposing-graphs-into-regular-irregular-structures-1801.08876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-algorithmic-complexity-of-decomposing-graphs-into-regular-irregular-structures-1801.08876"/></url>
<url><loc>https://scifaro.com/en/abs/a-method-to-compute-the-sparse-graphs-for-traveling-salesman-problem-based-on-frequency-quadrilaterals-1801.09407</loc><lastmod>2018-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-method-to-compute-the-sparse-graphs-for-traveling-salesman-problem-based-on-frequency-quadrilaterals-1801.09407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-method-to-compute-the-sparse-graphs-for-traveling-salesman-problem-based-on-frequency-quadrilaterals-1801.09407"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-generalized-shift-rule-for-the-prefer-max-de-bruijn-sequence-1801.10091</loc><lastmod>2019-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-generalized-shift-rule-for-the-prefer-max-de-bruijn-sequence-1801.10091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-generalized-shift-rule-for-the-prefer-max-de-bruijn-sequence-1801.10091"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-the-continued-logarithm-algorithm-1801.10139</loc><lastmod>2018-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-the-continued-logarithm-algorithm-1801.10139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-the-continued-logarithm-algorithm-1801.10139"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-outer-connected-bondage-and-the-outer-connected-reinforcement-problems-1802.00649</loc><lastmod>2018-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-outer-connected-bondage-and-the-outer-connected-reinforcement-problems-1802.00649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-outer-connected-bondage-and-the-outer-connected-reinforcement-problems-1802.00649"/></url>
<url><loc>https://scifaro.com/en/abs/listening-to-the-cohomology-of-graphs-1802.01238</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/listening-to-the-cohomology-of-graphs-1802.01238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/listening-to-the-cohomology-of-graphs-1802.01238"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-bounds-on-codes-for-location-in-circulant-graphs-1802.01325</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-bounds-on-codes-for-location-in-circulant-graphs-1802.01325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-bounds-on-codes-for-location-in-circulant-graphs-1802.01325"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressiveness-of-quasiperiodic-and-minimal-shifts-of-finite-type-1802.01461</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressiveness-of-quasiperiodic-and-minimal-shifts-of-finite-type-1802.01461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressiveness-of-quasiperiodic-and-minimal-shifts-of-finite-type-1802.01461"/></url>
<url><loc>https://scifaro.com/en/abs/the-b-branching-problem-in-digraphs-1802.02381</loc><lastmod>2018-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-b-branching-problem-in-digraphs-1802.02381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-b-branching-problem-in-digraphs-1802.02381"/></url>
<url><loc>https://scifaro.com/en/abs/when-is-the-condition-of-order-preservation-met-1802.02397</loc><lastmod>2019-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-is-the-condition-of-order-preservation-met-1802.02397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-is-the-condition-of-order-preservation-met-1802.02397"/></url>
<url><loc>https://scifaro.com/en/abs/strong-amplifiers-of-natural-selection-proofs-1802.02509</loc><lastmod>2018-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-amplifiers-of-natural-selection-proofs-1802.02509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-amplifiers-of-natural-selection-proofs-1802.02509"/></url>
<url><loc>https://scifaro.com/en/abs/the-b-bibranching-problem-tdi-system-packing-and-discrete-convexity-1802.03235</loc><lastmod>2018-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-b-bibranching-problem-tdi-system-packing-and-discrete-convexity-1802.03235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-b-bibranching-problem-tdi-system-packing-and-discrete-convexity-1802.03235"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-fitch-graphs-edge-labeled-graphs-that-are-explained-by-edge-labeled-trees-1802.03657</loc><lastmod>2018-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-fitch-graphs-edge-labeled-graphs-that-are-explained-by-edge-labeled-trees-1802.03657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-fitch-graphs-edge-labeled-graphs-that-are-explained-by-edge-labeled-trees-1802.03657"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-monopolies-for-interval-graphs-with-bounded-thresholds-1802.03935</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-monopolies-for-interval-graphs-with-bounded-thresholds-1802.03935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-monopolies-for-interval-graphs-with-bounded-thresholds-1802.03935"/></url>
<url><loc>https://scifaro.com/en/abs/subtyping-for-hierarchical-reconfigurable-petri-nets-1802.04698</loc><lastmod>2018-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subtyping-for-hierarchical-reconfigurable-petri-nets-1802.04698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subtyping-for-hierarchical-reconfigurable-petri-nets-1802.04698"/></url>
<url><loc>https://scifaro.com/en/abs/a-combinatorial-problem-arising-from-ecology-the-maximum-empower-problem-1802.05974</loc><lastmod>2018-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-combinatorial-problem-arising-from-ecology-the-maximum-empower-problem-1802.05974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-combinatorial-problem-arising-from-ecology-the-maximum-empower-problem-1802.05974"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-integer-programs-with-block-structure-1802.06289</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-integer-programs-with-block-structure-1802.06289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-integer-programs-with-block-structure-1802.06289"/></url>
<url><loc>https://scifaro.com/en/abs/arc-disjoint-cycle-packing-in-tournament-classical-and-parameterized-complexity-1802.06669</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arc-disjoint-cycle-packing-in-tournament-classical-and-parameterized-complexity-1802.06669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arc-disjoint-cycle-packing-in-tournament-classical-and-parameterized-complexity-1802.06669"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-steiner-network-problem-with-respect-to-the-number-of-terminals-1802.08189</loc><lastmod>2018-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-steiner-network-problem-with-respect-to-the-number-of-terminals-1802.08189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-steiner-network-problem-with-respect-to-the-number-of-terminals-1802.08189"/></url>
<url><loc>https://scifaro.com/en/abs/random-walks-on-polytopes-of-constant-corank-1802.09324</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-walks-on-polytopes-of-constant-corank-1802.09324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-walks-on-polytopes-of-constant-corank-1802.09324"/></url>
<url><loc>https://scifaro.com/en/abs/on-strong-np-completeness-of-rational-problems-1802.09465</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-strong-np-completeness-of-rational-problems-1802.09465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-strong-np-completeness-of-rational-problems-1802.09465"/></url>
<url><loc>https://scifaro.com/en/abs/on-tradeoffs-between-width-and-fill-like-graph-parameters-1802.09620</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-tradeoffs-between-width-and-fill-like-graph-parameters-1802.09620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-tradeoffs-between-width-and-fill-like-graph-parameters-1802.09620"/></url>
<url><loc>https://scifaro.com/en/abs/empirical-evaluation-of-approximation-algorithms-for-generalized-graph-coloring-and-uniform-quasi-wideness-1802.09801</loc><lastmod>2019-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/empirical-evaluation-of-approximation-algorithms-for-generalized-graph-coloring-and-uniform-quasi-wideness-1802.09801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/empirical-evaluation-of-approximation-algorithms-for-generalized-graph-coloring-and-uniform-quasi-wideness-1802.09801"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-graphs-with-limited-resources-1802.09844</loc><lastmod>2018-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-graphs-with-limited-resources-1802.09844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-graphs-with-limited-resources-1802.09844"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-de-composing-with-boolean-automata-networks-1802.10400</loc><lastmod>2018-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-de-composing-with-boolean-automata-networks-1802.10400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-de-composing-with-boolean-automata-networks-1802.10400"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-cycles-in-hypercubes-with-faulty-edges-1803.00064</loc><lastmod>2021-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-cycles-in-hypercubes-with-faulty-edges-1803.00064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-cycles-in-hypercubes-with-faulty-edges-1803.00064"/></url>
<url><loc>https://scifaro.com/en/abs/strong-subgraph-k-connectivity-bounds-1803.00281</loc><lastmod>2018-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-subgraph-k-connectivity-bounds-1803.00281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-subgraph-k-connectivity-bounds-1803.00281"/></url>
<url><loc>https://scifaro.com/en/abs/strong-subgraph-k-connectivity-1803.00284</loc><lastmod>2018-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-subgraph-k-connectivity-1803.00284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-subgraph-k-connectivity-1803.00284"/></url>
<url><loc>https://scifaro.com/en/abs/fast-algorithms-for-indices-of-nested-split-graphs-approximating-real-complex-networks-1803.00306</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-algorithms-for-indices-of-nested-split-graphs-approximating-real-complex-networks-1803.00306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-algorithms-for-indices-of-nested-split-graphs-approximating-real-complex-networks-1803.00306"/></url>
<url><loc>https://scifaro.com/en/abs/sequentialization-and-procedural-complexity-in-automata-networks-1803.00438</loc><lastmod>2018-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequentialization-and-procedural-complexity-in-automata-networks-1803.00438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequentialization-and-procedural-complexity-in-automata-networks-1803.00438"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-series-parallel-concurrent-systems-the-case-of-arch-processes-1803.00843</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-series-parallel-concurrent-systems-the-case-of-arch-processes-1803.00843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-series-parallel-concurrent-systems-the-case-of-arch-processes-1803.00843"/></url>
<url><loc>https://scifaro.com/en/abs/rapid-mixing-of-the-switch-markov-chain-for-strongly-stable-degree-sequences-and-2-class-joint-degree-matrices-1803.01338</loc><lastmod>2018-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rapid-mixing-of-the-switch-markov-chain-for-strongly-stable-degree-sequences-and-2-class-joint-degree-matrices-1803.01338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rapid-mixing-of-the-switch-markov-chain-for-strongly-stable-degree-sequences-and-2-class-joint-degree-matrices-1803.01338"/></url>
<url><loc>https://scifaro.com/en/abs/two-sided-popular-matchings-in-bipartite-graphs-with-forbidden-forced-elements-and-weights-1803.01478</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-sided-popular-matchings-in-bipartite-graphs-with-forbidden-forced-elements-and-weights-1803.01478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-sided-popular-matchings-in-bipartite-graphs-with-forbidden-forced-elements-and-weights-1803.01478"/></url>
<url><loc>https://scifaro.com/en/abs/some-relations-on-prefix-reversal-generators-of-the-symmetric-and-hyperoctahedral-group-1803.01760</loc><lastmod>2018-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-relations-on-prefix-reversal-generators-of-the-symmetric-and-hyperoctahedral-group-1803.01760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-relations-on-prefix-reversal-generators-of-the-symmetric-and-hyperoctahedral-group-1803.01760"/></url>
<url><loc>https://scifaro.com/en/abs/local-negative-circuits-and-cyclic-attractors-in-boolean-networks-with-at-most-five-components-1803.02095</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-negative-circuits-and-cyclic-attractors-in-boolean-networks-with-at-most-five-components-1803.02095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-negative-circuits-and-cyclic-attractors-in-boolean-networks-with-at-most-five-components-1803.02095"/></url>
<url><loc>https://scifaro.com/en/abs/mds-matrices-over-small-fields-a-proof-of-the-gm-mds-conjecture-1803.02523</loc><lastmod>2018-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mds-matrices-over-small-fields-a-proof-of-the-gm-mds-conjecture-1803.02523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mds-matrices-over-small-fields-a-proof-of-the-gm-mds-conjecture-1803.02523"/></url>
<url><loc>https://scifaro.com/en/abs/quasiperiods-of-biinfinite-sturmian-words-1803.02643</loc><lastmod>2018-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasiperiods-of-biinfinite-sturmian-words-1803.02643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasiperiods-of-biinfinite-sturmian-words-1803.02643"/></url>
<url><loc>https://scifaro.com/en/abs/listing-maximal-subgraphs-in-strongly-accessible-set-systems-1803.03659</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/listing-maximal-subgraphs-in-strongly-accessible-set-systems-1803.03659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/listing-maximal-subgraphs-in-strongly-accessible-set-systems-1803.03659"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-and-lp-based-heuristics-for-the-quadratic-travelling-salesman-problem-1803.03681</loc><lastmod>2021-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-and-lp-based-heuristics-for-the-quadratic-travelling-salesman-problem-1803.03681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-and-lp-based-heuristics-for-the-quadratic-travelling-salesman-problem-1803.03681"/></url>
<url><loc>https://scifaro.com/en/abs/exact-uniform-sampling-over-catalan-structures-1803.03945</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-uniform-sampling-over-catalan-structures-1803.03945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-uniform-sampling-over-catalan-structures-1803.03945"/></url>
<url><loc>https://scifaro.com/en/abs/nonsingular-block-graphs-an-open-problem-1803.03947</loc><lastmod>2020-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonsingular-block-graphs-an-open-problem-1803.03947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonsingular-block-graphs-an-open-problem-1803.03947"/></url>
<url><loc>https://scifaro.com/en/abs/counting-of-shortest-paths-in-cubic-grid-1803.04190</loc><lastmod>2024-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-of-shortest-paths-in-cubic-grid-1803.04190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-of-shortest-paths-in-cubic-grid-1803.04190"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-a-graph-into-degenerate-subgraphs-1803.04388</loc><lastmod>2019-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-a-graph-into-degenerate-subgraphs-1803.04388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-a-graph-into-degenerate-subgraphs-1803.04388"/></url>
<url><loc>https://scifaro.com/en/abs/certificates-in-p-and-subquadratic-time-computation-of-radius-diameter-and-all-eccentricities-in-graphs-1803.04660</loc><lastmod>2026-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certificates-in-p-and-subquadratic-time-computation-of-radius-diameter-and-all-eccentricities-in-graphs-1803.04660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certificates-in-p-and-subquadratic-time-computation-of-radius-diameter-and-all-eccentricities-in-graphs-1803.04660"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-bounds-for-johnson-lindenstrauss-transformations-1803.05350</loc><lastmod>2018-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-bounds-for-johnson-lindenstrauss-transformations-1803.05350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-bounds-for-johnson-lindenstrauss-transformations-1803.05350"/></url>
<url><loc>https://scifaro.com/en/abs/h-colouring-p-t-free-graphs-in-subexponential-time-1803.05396</loc><lastmod>2019-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/h-colouring-p-t-free-graphs-in-subexponential-time-1803.05396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/h-colouring-p-t-free-graphs-in-subexponential-time-1803.05396"/></url>
<url><loc>https://scifaro.com/en/abs/linearity-is-strictly-more-powerful-than-contiguity-for-encoding-graphs-1803.05414</loc><lastmod>2018-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearity-is-strictly-more-powerful-than-contiguity-for-encoding-graphs-1803.05414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearity-is-strictly-more-powerful-than-contiguity-for-encoding-graphs-1803.05414"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-ratio-approximation-algorithm-for-a-class-of-hub-and-spoke-network-design-problems-and-metric-labeling-problems-star-metric-case-1803.06114</loc><lastmod>2018-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-ratio-approximation-algorithm-for-a-class-of-hub-and-spoke-network-design-problems-and-metric-labeling-problems-star-metric-case-1803.06114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-ratio-approximation-algorithm-for-a-class-of-hub-and-spoke-network-design-problems-and-metric-labeling-problems-star-metric-case-1803.06114"/></url>
<url><loc>https://scifaro.com/en/abs/parameter-space-abstraction-and-unfolding-semantics-of-discrete-regulatory-networks-1803.06157</loc><lastmod>2018-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameter-space-abstraction-and-unfolding-semantics-of-discrete-regulatory-networks-1803.06157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameter-space-abstraction-and-unfolding-semantics-of-discrete-regulatory-networks-1803.06157"/></url>
<url><loc>https://scifaro.com/en/abs/the-graph-structure-of-chebyshev-polynomials-over-finite-fields-and-applications-1803.06539</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graph-structure-of-chebyshev-polynomials-over-finite-fields-and-applications-1803.06539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graph-structure-of-chebyshev-polynomials-over-finite-fields-and-applications-1803.06539"/></url>
<url><loc>https://scifaro.com/en/abs/packing-and-covering-induced-subdivisions-1803.07581</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-and-covering-induced-subdivisions-1803.07581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-and-covering-induced-subdivisions-1803.07581"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-by-forbidden-induced-subgraphs-of-some-subclasses-of-chordal-graphs-1803.07684</loc><lastmod>2018-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-by-forbidden-induced-subgraphs-of-some-subclasses-of-chordal-graphs-1803.07684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-by-forbidden-induced-subgraphs-of-some-subclasses-of-chordal-graphs-1803.07684"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-black-and-white-coloring-problem-on-knights-chessboards-1803.07693</loc><lastmod>2018-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-black-and-white-coloring-problem-on-knights-chessboards-1803.07693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-black-and-white-coloring-problem-on-knights-chessboards-1803.07693"/></url>
<url><loc>https://scifaro.com/en/abs/on-cayley-graphs-of-algebraic-structures-1803.08518</loc><lastmod>2018-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cayley-graphs-of-algebraic-structures-1803.08518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cayley-graphs-of-algebraic-structures-1803.08518"/></url>
<url><loc>https://scifaro.com/en/abs/on-large-scale-graph-generation-with-validation-of-diverse-triangle-statistics-at-edges-and-vertices-1803.09021</loc><lastmod>2018-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-large-scale-graph-generation-with-validation-of-diverse-triangle-statistics-at-edges-and-vertices-1803.09021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-large-scale-graph-generation-with-validation-of-diverse-triangle-statistics-at-edges-and-vertices-1803.09021"/></url>
<url><loc>https://scifaro.com/en/abs/dushnik-miller-dimension-of-td-delaunay-complexes-1803.09576</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dushnik-miller-dimension-of-td-delaunay-complexes-1803.09576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dushnik-miller-dimension-of-td-delaunay-complexes-1803.09576"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-morse-theory-for-the-collapsibility-of-supremum-sections-1803.09577</loc><lastmod>2018-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-morse-theory-for-the-collapsibility-of-supremum-sections-1803.09577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-morse-theory-for-the-collapsibility-of-supremum-sections-1803.09577"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-multipacking-number-of-grid-graphs-1803.09639</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-multipacking-number-of-grid-graphs-1803.09639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-multipacking-number-of-grid-graphs-1803.09639"/></url>
<url><loc>https://scifaro.com/en/abs/on-dispersable-book-embeddings-1803.10030</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-dispersable-book-embeddings-1803.10030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-dispersable-book-embeddings-1803.10030"/></url>
<url><loc>https://scifaro.com/en/abs/parity-polytopes-and-binarization-1803.10561</loc><lastmod>2018-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parity-polytopes-and-binarization-1803.10561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parity-polytopes-and-binarization-1803.10561"/></url>
<url><loc>https://scifaro.com/en/abs/the-fine-structure-of-preferential-attachment-graphs-i-somewhere-denseness-1803.11114</loc><lastmod>2018-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fine-structure-of-preferential-attachment-graphs-i-somewhere-denseness-1803.11114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fine-structure-of-preferential-attachment-graphs-i-somewhere-denseness-1803.11114"/></url>
<url><loc>https://scifaro.com/en/abs/the-metric-space-of-networks-1804.02820</loc><lastmod>2022-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-metric-space-of-networks-1804.02820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-metric-space-of-networks-1804.02820"/></url>
<url><loc>https://scifaro.com/en/abs/tight-hardness-results-for-consensus-problems-on-circular-strings-and-time-series-1804.02854</loc><lastmod>2019-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-hardness-results-for-consensus-problems-on-circular-strings-and-time-series-1804.02854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-hardness-results-for-consensus-problems-on-circular-strings-and-time-series-1804.02854"/></url>
<url><loc>https://scifaro.com/en/abs/beating-the-integrality-ratio-for-s-t-tours-in-graphs-1804.03112</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beating-the-integrality-ratio-for-s-t-tours-in-graphs-1804.03112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beating-the-integrality-ratio-for-s-t-tours-in-graphs-1804.03112"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-extremal-bound-on-the-lov-a-sz-cactus-number-in-planar-graphs-1804.03485</loc><lastmod>2019-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-extremal-bound-on-the-lov-a-sz-cactus-number-in-planar-graphs-1804.03485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-extremal-bound-on-the-lov-a-sz-cactus-number-in-planar-graphs-1804.03485"/></url>
<url><loc>https://scifaro.com/en/abs/uniqueness-for-the-3-state-antiferromagnetic-potts-model-on-the-tree-1804.03514</loc><lastmod>2018-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniqueness-for-the-3-state-antiferromagnetic-potts-model-on-the-tree-1804.03514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniqueness-for-the-3-state-antiferromagnetic-potts-model-on-the-tree-1804.03514"/></url>
<url><loc>https://scifaro.com/en/abs/rapid-mixing-of-glauber-dynamics-for-colorings-below-vigoda-s-11-6-threshold-1804.04025</loc><lastmod>2018-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rapid-mixing-of-glauber-dynamics-for-colorings-below-vigoda-s-11-6-threshold-1804.04025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rapid-mixing-of-glauber-dynamics-for-colorings-below-vigoda-s-11-6-threshold-1804.04025"/></url>
<url><loc>https://scifaro.com/en/abs/connectivity-in-random-annulus-graphs-and-the-geometric-block-model-1804.05013</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connectivity-in-random-annulus-graphs-and-the-geometric-block-model-1804.05013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connectivity-in-random-annulus-graphs-and-the-geometric-block-model-1804.05013"/></url>
<url><loc>https://scifaro.com/en/abs/interval-like-graphs-and-digraphs-1804.05258</loc><lastmod>2018-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-like-graphs-and-digraphs-1804.05258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-like-graphs-and-digraphs-1804.05258"/></url>
<url><loc>https://scifaro.com/en/abs/hidden-hamiltonian-cycle-recovery-via-linear-programming-1804.05436</loc><lastmod>2018-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hidden-hamiltonian-cycle-recovery-via-linear-programming-1804.05436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hidden-hamiltonian-cycle-recovery-via-linear-programming-1804.05436"/></url>
<url><loc>https://scifaro.com/en/abs/a-structural-and-algorithmic-study-of-stable-matching-lattices-of-nearby-instances-with-applications-1804.05537</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-structural-and-algorithmic-study-of-stable-matching-lattices-of-nearby-instances-with-applications-1804.05537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-structural-and-algorithmic-study-of-stable-matching-lattices-of-nearby-instances-with-applications-1804.05537"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-and-structural-results-for-half-squares-of-restricted-tree-convex-bipartite-graphs-1804.05793</loc><lastmod>2018-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-and-structural-results-for-half-squares-of-restricted-tree-convex-bipartite-graphs-1804.05793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-and-structural-results-for-half-squares-of-restricted-tree-convex-bipartite-graphs-1804.05793"/></url>
<url><loc>https://scifaro.com/en/abs/preference-cycles-in-stable-matchings-1804.05982</loc><lastmod>2018-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preference-cycles-in-stable-matchings-1804.05982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preference-cycles-in-stable-matchings-1804.05982"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-stab-number-of-rectangle-intersection-graphs-1804.06571</loc><lastmod>2018-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-stab-number-of-rectangle-intersection-graphs-1804.06571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-stab-number-of-rectangle-intersection-graphs-1804.06571"/></url>
<url><loc>https://scifaro.com/en/abs/on-bounds-on-bend-number-of-split-and-cocomparability-graphs-1804.06584</loc><lastmod>2018-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bounds-on-bend-number-of-split-and-cocomparability-graphs-1804.06584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bounds-on-bend-number-of-split-and-cocomparability-graphs-1804.06584"/></url>
<url><loc>https://scifaro.com/en/abs/entropy-rates-for-horton-self-similar-trees-1804.06989</loc><lastmod>2018-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entropy-rates-for-horton-self-similar-trees-1804.06989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entropy-rates-for-horton-self-similar-trees-1804.06989"/></url>
<url><loc>https://scifaro.com/en/abs/a-third-strike-against-perfect-phylogeny-1804.07232</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-third-strike-against-perfect-phylogeny-1804.07232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-third-strike-against-perfect-phylogeny-1804.07232"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-the-game-2048-and-its-generalization-in-higher-dimensions-1804.07393</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-the-game-2048-and-its-generalization-in-higher-dimensions-1804.07393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-the-game-2048-and-its-generalization-in-higher-dimensions-1804.07393"/></url>
<url><loc>https://scifaro.com/en/abs/making-change-in-2048-1804.07396</loc><lastmod>2018-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-change-in-2048-1804.07396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-change-in-2048-1804.07396"/></url>
<url><loc>https://scifaro.com/en/abs/planar-steiner-orientation-is-np-complete-1804.07496</loc><lastmod>2018-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-steiner-orientation-is-np-complete-1804.07496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-steiner-orientation-is-np-complete-1804.07496"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-in-uniqueness-from-the-potts-and-random-cluster-models-on-random-regular-graphs-1804.08111</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-in-uniqueness-from-the-potts-and-random-cluster-models-on-random-regular-graphs-1804.08111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-in-uniqueness-from-the-potts-and-random-cluster-models-on-random-regular-graphs-1804.08111"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-realize-a-graph-on-random-points-1804.08680</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-realize-a-graph-on-random-points-1804.08680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-realize-a-graph-on-random-points-1804.08680"/></url>
<url><loc>https://scifaro.com/en/abs/principally-box-integer-polyhedra-and-equimodular-matrices-1804.08977</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/principally-box-integer-polyhedra-and-equimodular-matrices-1804.08977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/principally-box-integer-polyhedra-and-equimodular-matrices-1804.08977"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-optimization-of-independent-sets-under-reachability-constraints-1804.09422</loc><lastmod>2018-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-optimization-of-independent-sets-under-reachability-constraints-1804.09422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-optimization-of-independent-sets-under-reachability-constraints-1804.09422"/></url>
<url><loc>https://scifaro.com/en/abs/degree-based-topological-indices-of-hanoi-graph-1804.09431</loc><lastmod>2018-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-based-topological-indices-of-hanoi-graph-1804.09431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-based-topological-indices-of-hanoi-graph-1804.09431"/></url>
<url><loc>https://scifaro.com/en/abs/normal-edge-colorings-of-cubic-graphs-1804.09449</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-edge-colorings-of-cubic-graphs-1804.09449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-edge-colorings-of-cubic-graphs-1804.09449"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-programming-approach-to-the-student-project-allocation-problem-with-preferences-over-projects-1804.09993</loc><lastmod>2018-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-programming-approach-to-the-student-project-allocation-problem-with-preferences-over-projects-1804.09993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-programming-approach-to-the-student-project-allocation-problem-with-preferences-over-projects-1804.09993"/></url>
<url><loc>https://scifaro.com/en/abs/average-case-analysis-of-leaf-centric-binary-tree-sources-1804.10396</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-case-analysis-of-leaf-centric-binary-tree-sources-1804.10396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-case-analysis-of-leaf-centric-binary-tree-sources-1804.10396"/></url>
<url><loc>https://scifaro.com/en/abs/intersecting-edge-distinguishing-colorings-of-hypergraphs-1804.10470</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersecting-edge-distinguishing-colorings-of-hypergraphs-1804.10470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersecting-edge-distinguishing-colorings-of-hypergraphs-1804.10470"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-the-hypergraph-laplacian-via-a-diffusion-process-with-mediators-1804.11128</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-the-hypergraph-laplacian-via-a-diffusion-process-with-mediators-1804.11128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-the-hypergraph-laplacian-via-a-diffusion-process-with-mediators-1804.11128"/></url>
<url><loc>https://scifaro.com/en/abs/an-updated-experimental-evaluation-of-graph-bipartization-methods-1805.01041</loc><lastmod>2021-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-updated-experimental-evaluation-of-graph-bipartization-methods-1805.01041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-updated-experimental-evaluation-of-graph-bipartization-methods-1805.01041"/></url>
<url><loc>https://scifaro.com/en/abs/strong-subgraph-k-arc-connectivity-1805.01687</loc><lastmod>2018-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-subgraph-k-arc-connectivity-1805.01687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-subgraph-k-arc-connectivity-1805.01687"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-even-hole-free-graphs-with-no-star-cutset-1805.01948</loc><lastmod>2018-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-even-hole-free-graphs-with-no-star-cutset-1805.01948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-even-hole-free-graphs-with-no-star-cutset-1805.01948"/></url>
<url><loc>https://scifaro.com/en/abs/connected-greedy-colouring-in-claw-free-graphs-1805.01953</loc><lastmod>2018-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connected-greedy-colouring-in-claw-free-graphs-1805.01953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connected-greedy-colouring-in-claw-free-graphs-1805.01953"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-the-lovasz-local-lemma-point-to-set-correlations-and-their-algorithmic-applications-1805.02026</loc><lastmod>2020-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-the-lovasz-local-lemma-point-to-set-correlations-and-their-algorithmic-applications-1805.02026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-the-lovasz-local-lemma-point-to-set-correlations-and-their-algorithmic-applications-1805.02026"/></url>
<url><loc>https://scifaro.com/en/abs/an-sdp-primal-dual-approximation-algorithm-for-directed-hypergraph-expansion-and-sparsest-cut-with-product-demands-1805.02042</loc><lastmod>2018-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-sdp-primal-dual-approximation-algorithm-for-directed-hypergraph-expansion-and-sparsest-cut-with-product-demands-1805.02042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-sdp-primal-dual-approximation-algorithm-for-directed-hypergraph-expansion-and-sparsest-cut-with-product-demands-1805.02042"/></url>
<url><loc>https://scifaro.com/en/abs/domination-cover-number-of-graphs-1805.02345</loc><lastmod>2018-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domination-cover-number-of-graphs-1805.02345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domination-cover-number-of-graphs-1805.02345"/></url>
<url><loc>https://scifaro.com/en/abs/de-bruijn-sequences-from-games-to-shift-rules-to-a-proof-of-the-fredricksen-kessler-maiorana-theorem-1805.02405</loc><lastmod>2020-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/de-bruijn-sequences-from-games-to-shift-rules-to-a-proof-of-the-fredricksen-kessler-maiorana-theorem-1805.02405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/de-bruijn-sequences-from-games-to-shift-rules-to-a-proof-of-the-fredricksen-kessler-maiorana-theorem-1805.02405"/></url>
<url><loc>https://scifaro.com/en/abs/neighborhood-inclusions-for-minimal-dominating-sets-enumeration-linear-and-polynomial-delay-algorithms-in-p-7-free-and-p-8-free-chordal-graphs-1805.02412</loc><lastmod>2019-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighborhood-inclusions-for-minimal-dominating-sets-enumeration-linear-and-polynomial-delay-algorithms-in-p-7-free-and-p-8-free-chordal-graphs-1805.02412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighborhood-inclusions-for-minimal-dominating-sets-enumeration-linear-and-polynomial-delay-algorithms-in-p-7-free-and-p-8-free-chordal-graphs-1805.02412"/></url>
<url><loc>https://scifaro.com/en/abs/non-monochromatic-and-conflict-free-coloring-on-tree-spaces-and-planar-network-spaces-1805.02538</loc><lastmod>2018-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-monochromatic-and-conflict-free-coloring-on-tree-spaces-and-planar-network-spaces-1805.02538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-monochromatic-and-conflict-free-coloring-on-tree-spaces-and-planar-network-spaces-1805.02538"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-rendezvous-with-advice-how-to-rendezvous-in-a-disk-1805.03351</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-rendezvous-with-advice-how-to-rendezvous-in-a-disk-1805.03351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-rendezvous-with-advice-how-to-rendezvous-in-a-disk-1805.03351"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-circuit-complexity-of-model-checking-first-order-logic-on-sparse-structures-1805.03488</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-circuit-complexity-of-model-checking-first-order-logic-on-sparse-structures-1805.03488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-circuit-complexity-of-model-checking-first-order-logic-on-sparse-structures-1805.03488"/></url>
<url><loc>https://scifaro.com/en/abs/priority-evacuation-from-a-disk-using-mobile-robots-1805.03568</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/priority-evacuation-from-a-disk-using-mobile-robots-1805.03568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/priority-evacuation-from-a-disk-using-mobile-robots-1805.03568"/></url>
<url><loc>https://scifaro.com/en/abs/resource-bounded-kolmogorov-complexity-provides-an-obstacle-to-soficness-of-multidimensional-shifts-1805.03929</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-bounded-kolmogorov-complexity-provides-an-obstacle-to-soficness-of-multidimensional-shifts-1805.03929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-bounded-kolmogorov-complexity-provides-an-obstacle-to-soficness-of-multidimensional-shifts-1805.03929"/></url>
<url><loc>https://scifaro.com/en/abs/a-1-5-approximation-for-path-tsp-1805.04131</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-1-5-approximation-for-path-tsp-1805.04131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-1-5-approximation-for-path-tsp-1805.04131"/></url>
<url><loc>https://scifaro.com/en/abs/bipartite-graphs-of-small-readability-1805.04765</loc><lastmod>2018-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bipartite-graphs-of-small-readability-1805.04765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bipartite-graphs-of-small-readability-1805.04765"/></url>
<url><loc>https://scifaro.com/en/abs/square-free-graphs-with-no-six-vertex-induced-path-1805.05007</loc><lastmod>2019-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-free-graphs-with-no-six-vertex-induced-path-1805.05007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-free-graphs-with-no-six-vertex-induced-path-1805.05007"/></url>
<url><loc>https://scifaro.com/en/abs/on-two-consequences-of-berge-fulkerson-conjecture-1805.06828</loc><lastmod>2018-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-two-consequences-of-berge-fulkerson-conjecture-1805.06828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-two-consequences-of-berge-fulkerson-conjecture-1805.06828"/></url>
<url><loc>https://scifaro.com/en/abs/short-combinatorial-proof-that-the-dfj-polytope-is-contained-in-the-mtz-polytope-for-the-asymmetric-traveling-salesman-problem-1805.06997</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-combinatorial-proof-that-the-dfj-polytope-is-contained-in-the-mtz-polytope-for-the-asymmetric-traveling-salesman-problem-1805.06997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-combinatorial-proof-that-the-dfj-polytope-is-contained-in-the-mtz-polytope-for-the-asymmetric-traveling-salesman-problem-1805.06997"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-delta-decomposition-algorithm-for-positive-dnfs-1805.08177</loc><lastmod>2019-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-delta-decomposition-algorithm-for-positive-dnfs-1805.08177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-delta-decomposition-algorithm-for-positive-dnfs-1805.08177"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-polytime-factorization-algorithm-for-multilinear-polynomials-over-f2-1805.08186</loc><lastmod>2019-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-polytime-factorization-algorithm-for-multilinear-polynomials-over-f2-1805.08186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-polytime-factorization-algorithm-for-multilinear-polynomials-over-f2-1805.08186"/></url>
<url><loc>https://scifaro.com/en/abs/finding-forbidden-minors-in-sublinear-time-a-n-1-2-o-1-query-one-sided-tester-for-minor-closed-properties-on-bounded-degree-graphs-1805.08187</loc><lastmod>2018-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-forbidden-minors-in-sublinear-time-a-n-1-2-o-1-query-one-sided-tester-for-minor-closed-properties-on-bounded-degree-graphs-1805.08187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-forbidden-minors-in-sublinear-time-a-n-1-2-o-1-query-one-sided-tester-for-minor-closed-properties-on-bounded-degree-graphs-1805.08187"/></url>
<url><loc>https://scifaro.com/en/abs/aperiodic-points-in-mathbb-z-2-subshifts-1805.08829</loc><lastmod>2018-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aperiodic-points-in-mathbb-z-2-subshifts-1805.08829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aperiodic-points-in-mathbb-z-2-subshifts-1805.08829"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-approximation-algorithms-for-the-combinatorial-motion-planning-problem-1805.08978</loc><lastmod>2018-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-approximation-algorithms-for-the-combinatorial-motion-planning-problem-1805.08978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-approximation-algorithms-for-the-combinatorial-motion-planning-problem-1805.08978"/></url>
<url><loc>https://scifaro.com/en/abs/rectangular-young-tableaux-with-local-decreases-and-the-density-method-for-uniform-random-generation-short-version-1805.09017</loc><lastmod>2018-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangular-young-tableaux-with-local-decreases-and-the-density-method-for-uniform-random-generation-short-version-1805.09017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangular-young-tableaux-with-local-decreases-and-the-density-method-for-uniform-random-generation-short-version-1805.09017"/></url>
<url><loc>https://scifaro.com/en/abs/eternal-dominating-sets-on-digraphs-and-orientations-of-graphs-1805.09623</loc><lastmod>2018-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eternal-dominating-sets-on-digraphs-and-orientations-of-graphs-1805.09623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eternal-dominating-sets-on-digraphs-and-orientations-of-graphs-1805.09623"/></url>
<url><loc>https://scifaro.com/en/abs/modular-decomposition-of-graphs-and-the-distance-preserving-property-1805.09853</loc><lastmod>2018-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-decomposition-of-graphs-and-the-distance-preserving-property-1805.09853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-decomposition-of-graphs-and-the-distance-preserving-property-1805.09853"/></url>
<url><loc>https://scifaro.com/en/abs/causal-dynamics-of-discrete-manifolds-1805.10051</loc><lastmod>2018-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-dynamics-of-discrete-manifolds-1805.10051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-dynamics-of-discrete-manifolds-1805.10051"/></url>
<url><loc>https://scifaro.com/en/abs/extended-formulations-for-radial-cones-1805.10325</loc><lastmod>2018-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-formulations-for-radial-cones-1805.10325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-formulations-for-radial-cones-1805.10325"/></url>
<url><loc>https://scifaro.com/en/abs/size-varying-reversible-causal-graph-dynamics-1805.10330</loc><lastmod>2025-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-varying-reversible-causal-graph-dynamics-1805.10330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-varying-reversible-causal-graph-dynamics-1805.10330"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-of-the-pareto-set-in-bicriteria-asymmetric-traveling-salesman-problem-1805.10606</loc><lastmod>2018-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-of-the-pareto-set-in-bicriteria-asymmetric-traveling-salesman-problem-1805.10606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-of-the-pareto-set-in-bicriteria-asymmetric-traveling-salesman-problem-1805.10606"/></url>
<url><loc>https://scifaro.com/en/abs/popular-matchings-and-limits-to-tractability-1805.11473</loc><lastmod>2018-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/popular-matchings-and-limits-to-tractability-1805.11473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/popular-matchings-and-limits-to-tractability-1805.11473"/></url>
<url><loc>https://scifaro.com/en/abs/adjacency-and-tensor-representation-in-general-hypergraphs-part-2-multisets-hb-graphs-and-related-e-adjacency-tensors-1805.11952</loc><lastmod>2018-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjacency-and-tensor-representation-in-general-hypergraphs-part-2-multisets-hb-graphs-and-related-e-adjacency-tensors-1805.11952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjacency-and-tensor-representation-in-general-hypergraphs-part-2-multisets-hb-graphs-and-related-e-adjacency-tensors-1805.11952"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-influence-of-the-interaction-graph-on-a-finite-dynamical-system-1805.12247</loc><lastmod>2018-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-influence-of-the-interaction-graph-on-a-finite-dynamical-system-1805.12247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-influence-of-the-interaction-graph-on-a-finite-dynamical-system-1805.12247"/></url>
<url><loc>https://scifaro.com/en/abs/a-parameterized-complexity-view-on-collapsing-k-cores-1805.12453</loc><lastmod>2018-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parameterized-complexity-view-on-collapsing-k-cores-1805.12453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parameterized-complexity-view-on-collapsing-k-cores-1805.12453"/></url>
<url><loc>https://scifaro.com/en/abs/on-efficient-domination-for-some-classes-of-h-free-bipartite-graphs-1806.00386</loc><lastmod>2019-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-efficient-domination-for-some-classes-of-h-free-bipartite-graphs-1806.00386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-efficient-domination-for-some-classes-of-h-free-bipartite-graphs-1806.00386"/></url>
<url><loc>https://scifaro.com/en/abs/extension-complexity-of-the-correlation-polytope-1806.00541</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extension-complexity-of-the-correlation-polytope-1806.00541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extension-complexity-of-the-correlation-polytope-1806.00541"/></url>
<url><loc>https://scifaro.com/en/abs/maximal-matching-and-path-matching-counting-in-polynomial-time-for-graphs-of-bounded-clique-width-1806.00791</loc><lastmod>2018-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximal-matching-and-path-matching-counting-in-polynomial-time-for-graphs-of-bounded-clique-width-1806.00791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximal-matching-and-path-matching-counting-in-polynomial-time-for-graphs-of-bounded-clique-width-1806.00791"/></url>
<url><loc>https://scifaro.com/en/abs/percolation-of-lipschitz-surface-and-tight-bounds-on-the-spread-of-information-among-mobile-agents-1806.01140</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/percolation-of-lipschitz-surface-and-tight-bounds-on-the-spread-of-information-among-mobile-agents-1806.01140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/percolation-of-lipschitz-surface-and-tight-bounds-on-the-spread-of-information-among-mobile-agents-1806.01140"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-the-multiplicity-of-cycles-in-bipartite-graphs-using-the-degree-distribution-and-the-spectrum-of-the-graph-1806.01433</loc><lastmod>2019-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-the-multiplicity-of-cycles-in-bipartite-graphs-using-the-degree-distribution-and-the-spectrum-of-the-graph-1806.01433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-the-multiplicity-of-cycles-in-bipartite-graphs-using-the-degree-distribution-and-the-spectrum-of-the-graph-1806.01433"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-domination-on-biclique-free-graphs-1806.02590</loc><lastmod>2019-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-domination-on-biclique-free-graphs-1806.02590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-domination-on-biclique-free-graphs-1806.02590"/></url>
<url><loc>https://scifaro.com/en/abs/periodic-p-olya-urns-and-an-application-to-young-tableaux-1806.03133</loc><lastmod>2018-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/periodic-p-olya-urns-and-an-application-to-young-tableaux-1806.03133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/periodic-p-olya-urns-and-an-application-to-young-tableaux-1806.03133"/></url>
<url><loc>https://scifaro.com/en/abs/swendsen-wang-dynamics-for-general-graphs-in-the-tree-uniqueness-region-1806.04602</loc><lastmod>2018-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/swendsen-wang-dynamics-for-general-graphs-in-the-tree-uniqueness-region-1806.04602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/swendsen-wang-dynamics-for-general-graphs-in-the-tree-uniqueness-region-1806.04602"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-choosability-with-defect-1-of-graphs-on-surfaces-1806.06149</loc><lastmod>2018-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-choosability-with-defect-1-of-graphs-on-surfaces-1806.06149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-choosability-with-defect-1-of-graphs-on-surfaces-1806.06149"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-manifolds-are-hamiltonian-1806.06436</loc><lastmod>2018-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-manifolds-are-hamiltonian-1806.06436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-manifolds-are-hamiltonian-1806.06436"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-bias-of-reed-muller-codes-over-odd-prime-fields-1806.06973</loc><lastmod>2018-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-bias-of-reed-muller-codes-over-odd-prime-fields-1806.06973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-bias-of-reed-muller-codes-over-odd-prime-fields-1806.06973"/></url>
<url><loc>https://scifaro.com/en/abs/slopes-of-3-dimensional-subshifts-of-finite-type-1806.07101</loc><lastmod>2018-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slopes-of-3-dimensional-subshifts-of-finite-type-1806.07101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slopes-of-3-dimensional-subshifts-of-finite-type-1806.07101"/></url>
<url><loc>https://scifaro.com/en/abs/topological-data-analysis-made-easy-with-the-topology-toolkit-1806.08126</loc><lastmod>2018-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-data-analysis-made-easy-with-the-topology-toolkit-1806.08126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-data-analysis-made-easy-with-the-topology-toolkit-1806.08126"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-of-the-dth-power-of-the-face-centered-cubic-grid-1806.08136</loc><lastmod>2018-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-of-the-dth-power-of-the-face-centered-cubic-grid-1806.08136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-of-the-dth-power-of-the-face-centered-cubic-grid-1806.08136"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-theory-of-mixing-graphs-a-characterization-of-perfect-mixability-1806.08875</loc><lastmod>2019-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-theory-of-mixing-graphs-a-characterization-of-perfect-mixability-1806.08875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-theory-of-mixing-graphs-a-characterization-of-perfect-mixability-1806.08875"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-weight-independent-sets-for-s-1-2-4-triangle-free-graphs-in-polynomial-time-1806.09472</loc><lastmod>2019-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-weight-independent-sets-for-s-1-2-4-triangle-free-graphs-in-polynomial-time-1806.09472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-weight-independent-sets-for-s-1-2-4-triangle-free-graphs-in-polynomial-time-1806.09472"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-integer-linear-program-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints-1806.10697</loc><lastmod>2018-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-integer-linear-program-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints-1806.10697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-integer-linear-program-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints-1806.10697"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-without-a-partition-into-two-proportionally-dense-subgraphs-1806.10963</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-without-a-partition-into-two-proportionally-dense-subgraphs-1806.10963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-without-a-partition-into-two-proportionally-dense-subgraphs-1806.10963"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-vertex-transitivity-in-graphs-1807.00131</loc><lastmod>2018-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-vertex-transitivity-in-graphs-1807.00131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-vertex-transitivity-in-graphs-1807.00131"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-large-scale-graphs-based-on-quantum-probability-theory-1807.00252</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-large-scale-graphs-based-on-quantum-probability-theory-1807.00252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-large-scale-graphs-based-on-quantum-probability-theory-1807.00252"/></url>
<url><loc>https://scifaro.com/en/abs/a-sat-encoding-for-the-n-fractions-problem-1807.00507</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sat-encoding-for-the-n-fractions-problem-1807.00507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sat-encoding-for-the-n-fractions-problem-1807.00507"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-minimum-quartet-tree-cost-problem-1807.00566</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-minimum-quartet-tree-cost-problem-1807.00566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-minimum-quartet-tree-cost-problem-1807.00566"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-labelling-bi-connectivity-1807.00570</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-labelling-bi-connectivity-1807.00570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-labelling-bi-connectivity-1807.00570"/></url>
<url><loc>https://scifaro.com/en/abs/popular-matchings-in-complete-graphs-1807.01112</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/popular-matchings-in-complete-graphs-1807.01112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/popular-matchings-in-complete-graphs-1807.01112"/></url>
<url><loc>https://scifaro.com/en/abs/centrality-friendship-paradoxes-when-our-friends-are-more-important-than-us-1807.01496</loc><lastmod>2018-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/centrality-friendship-paradoxes-when-our-friends-are-more-important-than-us-1807.01496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/centrality-friendship-paradoxes-when-our-friends-are-more-important-than-us-1807.01496"/></url>
<url><loc>https://scifaro.com/en/abs/digital-geometry-a-survey-1807.02222</loc><lastmod>2018-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digital-geometry-a-survey-1807.02222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digital-geometry-a-survey-1807.02222"/></url>
<url><loc>https://scifaro.com/en/abs/new-limits-of-treewidth-based-tractability-in-optimization-1807.02551</loc><lastmod>2019-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-limits-of-treewidth-based-tractability-in-optimization-1807.02551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-limits-of-treewidth-based-tractability-in-optimization-1807.02551"/></url>
<url><loc>https://scifaro.com/en/abs/corrigendum-to-new-generalized-cyclotomic-binary-sequences-of-period-p-2-1807.03088</loc><lastmod>2018-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/corrigendum-to-new-generalized-cyclotomic-binary-sequences-of-period-p-2-1807.03088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/corrigendum-to-new-generalized-cyclotomic-binary-sequences-of-period-p-2-1807.03088"/></url>
<url><loc>https://scifaro.com/en/abs/an-interesting-structural-property-related-to-the-problem-of-computing-all-the-best-swap-edges-of-a-tree-spanner-in-unweighted-graphs-1807.03331</loc><lastmod>2018-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interesting-structural-property-related-to-the-problem-of-computing-all-the-best-swap-edges-of-a-tree-spanner-in-unweighted-graphs-1807.03331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interesting-structural-property-related-to-the-problem-of-computing-all-the-best-swap-edges-of-a-tree-spanner-in-unweighted-graphs-1807.03331"/></url>
<url><loc>https://scifaro.com/en/abs/tractable-n-metrics-for-multiple-graphs-1807.03368</loc><lastmod>2020-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractable-n-metrics-for-multiple-graphs-1807.03368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractable-n-metrics-for-multiple-graphs-1807.03368"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-bounds-for-centered-colorings-on-proper-minor-closed-graph-classes-1807.03683</loc><lastmod>2020-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-bounds-for-centered-colorings-on-proper-minor-closed-graph-classes-1807.03683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-bounds-for-centered-colorings-on-proper-minor-closed-graph-classes-1807.03683"/></url>
<url><loc>https://scifaro.com/en/abs/rank-of-weighted-digraphs-with-blocks-1807.04208</loc><lastmod>2018-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rank-of-weighted-digraphs-with-blocks-1807.04208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rank-of-weighted-digraphs-with-blocks-1807.04208"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-approximating-the-matching-polynomial-in-the-complex-plane-1807.04930</loc><lastmod>2021-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-approximating-the-matching-polynomial-in-the-complex-plane-1807.04930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-approximating-the-matching-polynomial-in-the-complex-plane-1807.04930"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-at-free-graphs-with-bfs-1807.05065</loc><lastmod>2018-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-at-free-graphs-with-bfs-1807.05065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-at-free-graphs-with-bfs-1807.05065"/></url>
<url><loc>https://scifaro.com/en/abs/counting-integral-points-in-polytopes-via-numerical-analysis-of-contour-integration-1807.05348</loc><lastmod>2018-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-integral-points-in-polytopes-via-numerical-analysis-of-contour-integration-1807.05348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-integral-points-in-polytopes-via-numerical-analysis-of-contour-integration-1807.05348"/></url>
<url><loc>https://scifaro.com/en/abs/computing-minimum-weight-cycles-to-leverage-mispricings-in-cryptocurrency-market-networks-1807.05715</loc><lastmod>2018-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-minimum-weight-cycles-to-leverage-mispricings-in-cryptocurrency-market-networks-1807.05715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-minimum-weight-cycles-to-leverage-mispricings-in-cryptocurrency-market-networks-1807.05715"/></url>
<url><loc>https://scifaro.com/en/abs/avoidance-markov-metrics-and-node-pivotality-ranking-1807.06420</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoidance-markov-metrics-and-node-pivotality-ranking-1807.06420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoidance-markov-metrics-and-node-pivotality-ranking-1807.06420"/></url>
<url><loc>https://scifaro.com/en/abs/linear-algebra-and-number-of-spanning-trees-1807.06427</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-algebra-and-number-of-spanning-trees-1807.06427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-algebra-and-number-of-spanning-trees-1807.06427"/></url>
<url><loc>https://scifaro.com/en/abs/trees-in-the-real-field-1807.06440</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-in-the-real-field-1807.06440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-in-the-real-field-1807.06440"/></url>
<url><loc>https://scifaro.com/en/abs/the-simplex-geometry-of-graphs-1807.06475</loc><lastmod>2021-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simplex-geometry-of-graphs-1807.06475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simplex-geometry-of-graphs-1807.06475"/></url>
<url><loc>https://scifaro.com/en/abs/on-maximum-k-edge-colorable-subgraphs-of-bipartite-graphs-1807.06556</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-maximum-k-edge-colorable-subgraphs-of-bipartite-graphs-1807.06556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-maximum-k-edge-colorable-subgraphs-of-bipartite-graphs-1807.06556"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-lower-bound-for-the-hardness-of-clutters-1807.06568</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-lower-bound-for-the-hardness-of-clutters-1807.06568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-lower-bound-for-the-hardness-of-clutters-1807.06568"/></url>
<url><loc>https://scifaro.com/en/abs/supermodular-locality-sensitive-hashes-1807.06686</loc><lastmod>2018-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/supermodular-locality-sensitive-hashes-1807.06686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/supermodular-locality-sensitive-hashes-1807.06686"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-on-k-cycle-covering-and-k-clique-covering-1807.06867</loc><lastmod>2018-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-on-k-cycle-covering-and-k-clique-covering-1807.06867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-on-k-cycle-covering-and-k-clique-covering-1807.06867"/></url>
<url><loc>https://scifaro.com/en/abs/searching-for-network-modules-1807.07275</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-for-network-modules-1807.07275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-for-network-modules-1807.07275"/></url>
<url><loc>https://scifaro.com/en/abs/when-do-gomory-hu-subtrees-exist-1807.07331</loc><lastmod>2018-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-do-gomory-hu-subtrees-exist-1807.07331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-do-gomory-hu-subtrees-exist-1807.07331"/></url>
<url><loc>https://scifaro.com/en/abs/the-limiting-eigenvalue-distribution-of-iterated-k-regular-graph-cylinders-1807.07624</loc><lastmod>2018-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-limiting-eigenvalue-distribution-of-iterated-k-regular-graph-cylinders-1807.07624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-limiting-eigenvalue-distribution-of-iterated-k-regular-graph-cylinders-1807.07624"/></url>
<url><loc>https://scifaro.com/en/abs/shared-processor-scheduling-of-multiprocessor-jobs-1807.08011</loc><lastmod>2024-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shared-processor-scheduling-of-multiprocessor-jobs-1807.08011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shared-processor-scheduling-of-multiprocessor-jobs-1807.08011"/></url>
<url><loc>https://scifaro.com/en/abs/s-12-and-p-12-colorings-of-cubic-graphs-1807.08138</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/s-12-and-p-12-colorings-of-cubic-graphs-1807.08138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/s-12-and-p-12-colorings-of-cubic-graphs-1807.08138"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-geodetic-hull-number-of-complementary-prisms-1807.08295</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-geodetic-hull-number-of-complementary-prisms-1807.08295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-geodetic-hull-number-of-complementary-prisms-1807.08295"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-cops-and-robbers-a-multi-player-pursuit-game-on-graphs-1807.08500</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-cops-and-robbers-a-multi-player-pursuit-game-on-graphs-1807.08500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-cops-and-robbers-a-multi-player-pursuit-game-on-graphs-1807.08500"/></url>
<url><loc>https://scifaro.com/en/abs/average-case-worst-case-tradeoffs-for-evacuating-2-robots-from-the-disk-in-the-face-to-face-model-1807.08640</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-case-worst-case-tradeoffs-for-evacuating-2-robots-from-the-disk-in-the-face-to-face-model-1807.08640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-case-worst-case-tradeoffs-for-evacuating-2-robots-from-the-disk-in-the-face-to-face-model-1807.08640"/></url>
<url><loc>https://scifaro.com/en/abs/on-critical-and-maximal-digraphs-1807.09026</loc><lastmod>2018-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-critical-and-maximal-digraphs-1807.09026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-critical-and-maximal-digraphs-1807.09026"/></url>
<url><loc>https://scifaro.com/en/abs/maker-breaker-domination-game-1807.09479</loc><lastmod>2018-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maker-breaker-domination-game-1807.09479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maker-breaker-domination-game-1807.09479"/></url>
<url><loc>https://scifaro.com/en/abs/triangle-free-equimatchable-graphs-1807.09520</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangle-free-equimatchable-graphs-1807.09520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangle-free-equimatchable-graphs-1807.09520"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-grinberg-condition-in-the-cycle-spaces-1807.10187</loc><lastmod>2020-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-grinberg-condition-in-the-cycle-spaces-1807.10187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-grinberg-condition-in-the-cycle-spaces-1807.10187"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-reduction-of-the-weighted-induced-bipartite-subgraph-problem-to-the-weighted-independent-set-problem-1807.10277</loc><lastmod>2018-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-reduction-of-the-weighted-induced-bipartite-subgraph-problem-to-the-weighted-independent-set-problem-1807.10277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-reduction-of-the-weighted-induced-bipartite-subgraph-problem-to-the-weighted-independent-set-problem-1807.10277"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-sample-connected-k-partitions-of-a-graph-1808.00050</loc><lastmod>2018-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-sample-connected-k-partitions-of-a-graph-1808.00050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-sample-connected-k-partitions-of-a-graph-1808.00050"/></url>
<url><loc>https://scifaro.com/en/abs/counting-short-cycles-of-c-d-regular-bipartite-graphs-1808.00352</loc><lastmod>2018-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-short-cycles-of-c-d-regular-bipartite-graphs-1808.00352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-short-cycles-of-c-d-regular-bipartite-graphs-1808.00352"/></url>
<url><loc>https://scifaro.com/en/abs/devito-v3-1-0-an-embedded-domain-specific-language-for-finite-differences-and-geophysical-exploration-1808.01995</loc><lastmod>2019-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/devito-v3-1-0-an-embedded-domain-specific-language-for-finite-differences-and-geophysical-exploration-1808.01995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/devito-v3-1-0-an-embedded-domain-specific-language-for-finite-differences-and-geophysical-exploration-1808.01995"/></url>
<url><loc>https://scifaro.com/en/abs/flow-smoothing-and-denoising-graph-signal-processing-in-the-edge-space-1808.02111</loc><lastmod>2019-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flow-smoothing-and-denoising-graph-signal-processing-in-the-edge-space-1808.02111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flow-smoothing-and-denoising-graph-signal-processing-in-the-edge-space-1808.02111"/></url>
<url><loc>https://scifaro.com/en/abs/extending-some-results-on-the-second-neighborhood-conjecture-1808.02247</loc><lastmod>2021-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-some-results-on-the-second-neighborhood-conjecture-1808.02247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-some-results-on-the-second-neighborhood-conjecture-1808.02247"/></url>
<url><loc>https://scifaro.com/en/abs/partially-perfect-hash-functions-for-intersecting-families-1808.02273</loc><lastmod>2018-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partially-perfect-hash-functions-for-intersecting-families-1808.02273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partially-perfect-hash-functions-for-intersecting-families-1808.02273"/></url>
<url><loc>https://scifaro.com/en/abs/packing-colouring-of-some-classes-of-cubic-graphs-1808.02675</loc><lastmod>2018-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-colouring-of-some-classes-of-cubic-graphs-1808.02675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-colouring-of-some-classes-of-cubic-graphs-1808.02675"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-infinite-lsp-words-and-endomorphisms-preserving-the-lsp-property-1808.02680</loc><lastmod>2018-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-infinite-lsp-words-and-endomorphisms-preserving-the-lsp-property-1808.02680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-infinite-lsp-words-and-endomorphisms-preserving-the-lsp-property-1808.02680"/></url>
<url><loc>https://scifaro.com/en/abs/strong-subgraph-connectivity-of-digraphs-a-survey-1808.02740</loc><lastmod>2018-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-subgraph-connectivity-of-digraphs-a-survey-1808.02740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-subgraph-connectivity-of-digraphs-a-survey-1808.02740"/></url>
<url><loc>https://scifaro.com/en/abs/hard-to-solve-instances-of-the-euclidean-traveling-salesman-problem-1808.02859</loc><lastmod>2020-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hard-to-solve-instances-of-the-euclidean-traveling-salesman-problem-1808.02859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hard-to-solve-instances-of-the-euclidean-traveling-salesman-problem-1808.02859"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-conditions-for-connectedness-of-discretized-sets-1808.03053</loc><lastmod>2018-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-conditions-for-connectedness-of-discretized-sets-1808.03053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-conditions-for-connectedness-of-discretized-sets-1808.03053"/></url>
<url><loc>https://scifaro.com/en/abs/the-gromov-wasserstein-distance-between-networks-and-stable-network-invariants-1808.04337</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-gromov-wasserstein-distance-between-networks-and-stable-network-invariants-1808.04337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-gromov-wasserstein-distance-between-networks-and-stable-network-invariants-1808.04337"/></url>
<url><loc>https://scifaro.com/en/abs/cycles-in-the-burnt-pancake-graphs-1808.04890</loc><lastmod>2019-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cycles-in-the-burnt-pancake-graphs-1808.04890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cycles-in-the-burnt-pancake-graphs-1808.04890"/></url>
<url><loc>https://scifaro.com/en/abs/the-4-component-connectivity-of-alternating-group-networks-1808.06160</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-4-component-connectivity-of-alternating-group-networks-1808.06160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-4-component-connectivity-of-alternating-group-networks-1808.06160"/></url>
<url><loc>https://scifaro.com/en/abs/the-asymmetric-traveling-salesman-path-lp-has-constant-integrality-ratio-1808.06542</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-asymmetric-traveling-salesman-path-lp-has-constant-integrality-ratio-1808.06542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-asymmetric-traveling-salesman-path-lp-has-constant-integrality-ratio-1808.06542"/></url>
<url><loc>https://scifaro.com/en/abs/eulerian-edge-refinements-geodesics-billiards-and-sphere-coloring-1808.07207</loc><lastmod>2018-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eulerian-edge-refinements-geodesics-billiards-and-sphere-coloring-1808.07207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eulerian-edge-refinements-geodesics-billiards-and-sphere-coloring-1808.07207"/></url>
<url><loc>https://scifaro.com/en/abs/on-reachability-mixed-arborescence-packing-1808.07332</loc><lastmod>2018-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-reachability-mixed-arborescence-packing-1808.07332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-reachability-mixed-arborescence-packing-1808.07332"/></url>
<url><loc>https://scifaro.com/en/abs/clustered-planarity-flat-clustered-planarity-1808.07437</loc><lastmod>2018-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustered-planarity-flat-clustered-planarity-1808.07437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustered-planarity-flat-clustered-planarity-1808.07437"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-numbers-and-stress-of-random-graphs-1808.07558</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-numbers-and-stress-of-random-graphs-1808.07558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-numbers-and-stress-of-random-graphs-1808.07558"/></url>
<url><loc>https://scifaro.com/en/abs/bisplit-graphs-satisfy-the-chen-chv-atal-conjecture-1808.08710</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisplit-graphs-satisfy-the-chen-chv-atal-conjecture-1808.08710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisplit-graphs-satisfy-the-chen-chv-atal-conjecture-1808.08710"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-grid-drawings-of-complete-multipartite-graphs-and-an-integer-variant-of-the-algebraic-connectivity-1808.09024</loc><lastmod>2018-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-grid-drawings-of-complete-multipartite-graphs-and-an-integer-variant-of-the-algebraic-connectivity-1808.09024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-grid-drawings-of-complete-multipartite-graphs-and-an-integer-variant-of-the-algebraic-connectivity-1808.09024"/></url>
<url><loc>https://scifaro.com/en/abs/the-dispersion-time-of-random-walks-on-finite-graphs-1808.09219</loc><lastmod>2019-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dispersion-time-of-random-walks-on-finite-graphs-1808.09219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dispersion-time-of-random-walks-on-finite-graphs-1808.09219"/></url>
<url><loc>https://scifaro.com/en/abs/the-eternal-dominating-set-problem-for-interval-graphs-1808.09591</loc><lastmod>2018-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-eternal-dominating-set-problem-for-interval-graphs-1808.09591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-eternal-dominating-set-problem-for-interval-graphs-1808.09591"/></url>
<url><loc>https://scifaro.com/en/abs/counting-independent-sets-in-cocomparability-graphs-1808.09853</loc><lastmod>2018-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-independent-sets-in-cocomparability-graphs-1808.09853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-independent-sets-in-cocomparability-graphs-1808.09853"/></url>
<url><loc>https://scifaro.com/en/abs/level-planarity-transitivity-vs-even-crossings-1808.09931</loc><lastmod>2018-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/level-planarity-transitivity-vs-even-crossings-1808.09931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/level-planarity-transitivity-vs-even-crossings-1808.09931"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-eccentric-connectivity-index-for-graphs-with-given-diameter-1808.10203</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-eccentric-connectivity-index-for-graphs-with-given-diameter-1808.10203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-eccentric-connectivity-index-for-graphs-with-given-diameter-1808.10203"/></url>
<url><loc>https://scifaro.com/en/abs/empilements-compacts-avec-trois-tailles-de-disque-1808.10677</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/empilements-compacts-avec-trois-tailles-de-disque-1808.10677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/empilements-compacts-avec-trois-tailles-de-disque-1808.10677"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-upper-bound-on-the-integrality-ratio-for-the-s-t-path-tsp-1808.10734</loc><lastmod>2019-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-upper-bound-on-the-integrality-ratio-for-the-s-t-path-tsp-1808.10734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-upper-bound-on-the-integrality-ratio-for-the-s-t-path-tsp-1808.10734"/></url>
<url><loc>https://scifaro.com/en/abs/exhaustive-generation-for-permutations-avoiding-a-colored-regular-sets-of-patterns-1809.00742</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exhaustive-generation-for-permutations-avoiding-a-colored-regular-sets-of-patterns-1809.00742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exhaustive-generation-for-permutations-avoiding-a-colored-regular-sets-of-patterns-1809.00742"/></url>
<url><loc>https://scifaro.com/en/abs/repetition-avoidance-in-products-of-factors-1809.01426</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/repetition-avoidance-in-products-of-factors-1809.01426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/repetition-avoidance-in-products-of-factors-1809.01426"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-lemma-for-focused-stochastic-algorithms-1809.01537</loc><lastmod>2018-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-lemma-for-focused-stochastic-algorithms-1809.01537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-lemma-for-focused-stochastic-algorithms-1809.01537"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-eccentric-connectivity-index-for-graphs-with-fixed-order-and-fixed-number-of-pending-vertices-1809.03158</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-eccentric-connectivity-index-for-graphs-with-fixed-order-and-fixed-number-of-pending-vertices-1809.03158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-eccentric-connectivity-index-for-graphs-with-fixed-order-and-fixed-number-of-pending-vertices-1809.03158"/></url>
<url><loc>https://scifaro.com/en/abs/the-simple-chromatic-number-of-m-n-mixed-graphs-1809.04675</loc><lastmod>2019-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simple-chromatic-number-of-m-n-mixed-graphs-1809.04675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simple-chromatic-number-of-m-n-mixed-graphs-1809.04675"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-machine-scheduling-with-a-single-resource-per-job-1809.05009</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-machine-scheduling-with-a-single-resource-per-job-1809.05009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-machine-scheduling-with-a-single-resource-per-job-1809.05009"/></url>
<url><loc>https://scifaro.com/en/abs/dushnik-miller-dimension-of-d-dimensional-tilings-with-boxes-1809.05287</loc><lastmod>2018-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dushnik-miller-dimension-of-d-dimensional-tilings-with-boxes-1809.05287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dushnik-miller-dimension-of-d-dimensional-tilings-with-boxes-1809.05287"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-graphs-with-connectivity-constraints-1809.05443</loc><lastmod>2018-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-graphs-with-connectivity-constraints-1809.05443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-graphs-with-connectivity-constraints-1809.05443"/></url>
<url><loc>https://scifaro.com/en/abs/kernelization-and-approximation-of-distance-r-independent-sets-on-nowhere-dense-graphs-1809.05675</loc><lastmod>2020-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kernelization-and-approximation-of-distance-r-independent-sets-on-nowhere-dense-graphs-1809.05675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kernelization-and-approximation-of-distance-r-independent-sets-on-nowhere-dense-graphs-1809.05675"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonicity-in-convex-bipartite-graphs-1809.06113</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonicity-in-convex-bipartite-graphs-1809.06113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonicity-in-convex-bipartite-graphs-1809.06113"/></url>
<url><loc>https://scifaro.com/en/abs/binary-proportional-pairing-functions-1809.06876</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-proportional-pairing-functions-1809.06876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-proportional-pairing-functions-1809.06876"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-vector-and-weight-distribution-of-a-linear-code-1809.07090</loc><lastmod>2021-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-vector-and-weight-distribution-of-a-linear-code-1809.07090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-vector-and-weight-distribution-of-a-linear-code-1809.07090"/></url>
<url><loc>https://scifaro.com/en/abs/the-warm-starting-sequential-selection-problem-and-its-multi-round-extension-1809.07299</loc><lastmod>2019-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-warm-starting-sequential-selection-problem-and-its-multi-round-extension-1809.07299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-warm-starting-sequential-selection-problem-and-its-multi-round-extension-1809.07299"/></url>
<url><loc>https://scifaro.com/en/abs/functional-repair-codes-a-view-from-projective-geometry-1809.08138</loc><lastmod>2018-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-repair-codes-a-view-from-projective-geometry-1809.08138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-repair-codes-a-view-from-projective-geometry-1809.08138"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-search-based-heuristic-for-the-unrestricted-block-relocation-problem-1809.08201</loc><lastmod>2019-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-search-based-heuristic-for-the-unrestricted-block-relocation-problem-1809.08201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-search-based-heuristic-for-the-unrestricted-block-relocation-problem-1809.08201"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-convexity-number-for-complementary-prisms-1809.08220</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-convexity-number-for-complementary-prisms-1809.08220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-convexity-number-for-complementary-prisms-1809.08220"/></url>
<url><loc>https://scifaro.com/en/abs/the-balanced-connected-subgraph-problem-1809.08856</loc><lastmod>2018-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-balanced-connected-subgraph-problem-1809.08856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-balanced-connected-subgraph-problem-1809.08856"/></url>
<url><loc>https://scifaro.com/en/abs/on-k-abelian-equivalence-and-generalized-lagrange-spectra-1809.09047</loc><lastmod>2020-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-k-abelian-equivalence-and-generalized-lagrange-spectra-1809.09047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-k-abelian-equivalence-and-generalized-lagrange-spectra-1809.09047"/></url>
<url><loc>https://scifaro.com/en/abs/diversity-maximization-in-doubling-metrics-1809.09521</loc><lastmod>2018-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diversity-maximization-in-doubling-metrics-1809.09521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diversity-maximization-in-doubling-metrics-1809.09521"/></url>
<url><loc>https://scifaro.com/en/abs/on-monotone-sequences-of-directed-flips-triangulations-of-polyhedra-and-structural-properties-of-a-directed-flip-graph-1809.09701</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-monotone-sequences-of-directed-flips-triangulations-of-polyhedra-and-structural-properties-of-a-directed-flip-graph-1809.09701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-monotone-sequences-of-directed-flips-triangulations-of-polyhedra-and-structural-properties-of-a-directed-flip-graph-1809.09701"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-information-theoretical-proof-of-the-fueter-p-olya-conjecture-1809.09871</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-information-theoretical-proof-of-the-fueter-p-olya-conjecture-1809.09871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-information-theoretical-proof-of-the-fueter-p-olya-conjecture-1809.09871"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-minimum-dominating-set-on-string-graphs-1809.09990</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-minimum-dominating-set-on-string-graphs-1809.09990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-minimum-dominating-set-on-string-graphs-1809.09990"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-analysis-of-edge-elimination-for-euclidean-tsp-1809.10469</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-analysis-of-edge-elimination-for-euclidean-tsp-1809.10469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-analysis-of-edge-elimination-for-euclidean-tsp-1809.10469"/></url>
<url><loc>https://scifaro.com/en/abs/distance-and-routing-labeling-schemes-for-cube-free-median-graphs-1809.10508</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-and-routing-labeling-schemes-for-cube-free-median-graphs-1809.10508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-and-routing-labeling-schemes-for-cube-free-median-graphs-1809.10508"/></url>
<url><loc>https://scifaro.com/en/abs/plane-and-planarity-thresholds-for-random-geometric-graphs-1809.10737</loc><lastmod>2018-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-and-planarity-thresholds-for-random-geometric-graphs-1809.10737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-and-planarity-thresholds-for-random-geometric-graphs-1809.10737"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-cliques-admit-sparse-spanners-1810.00104</loc><lastmod>2021-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-cliques-admit-sparse-spanners-1810.00104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-cliques-admit-sparse-spanners-1810.00104"/></url>
<url><loc>https://scifaro.com/en/abs/pairwise-preferences-in-the-stable-marriage-problem-1810.00392</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pairwise-preferences-in-the-stable-marriage-problem-1810.00392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pairwise-preferences-in-the-stable-marriage-problem-1810.00392"/></url>
<url><loc>https://scifaro.com/en/abs/new-bounds-on-the-anti-ramsey-numbers-of-star-graphs-1810.00624</loc><lastmod>2023-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-bounds-on-the-anti-ramsey-numbers-of-star-graphs-1810.00624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-bounds-on-the-anti-ramsey-numbers-of-star-graphs-1810.00624"/></url>
<url><loc>https://scifaro.com/en/abs/towards-cereceda-s-conjecture-for-planar-graphs-1810.00731</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-cereceda-s-conjecture-for-planar-graphs-1810.00731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-cereceda-s-conjecture-for-planar-graphs-1810.00731"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-minimal-dominating-sets-in-k-t-free-graphs-and-variants-1810.00789</loc><lastmod>2020-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-minimal-dominating-sets-in-k-t-free-graphs-and-variants-1810.00789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-minimal-dominating-sets-in-k-t-free-graphs-and-variants-1810.00789"/></url>
<url><loc>https://scifaro.com/en/abs/two-known-results-about-graphs-with-no-short-odd-cycles-1810.01832</loc><lastmod>2018-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-known-results-about-graphs-with-no-short-odd-cycles-1810.01832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-known-results-about-graphs-with-no-short-odd-cycles-1810.01832"/></url>
<url><loc>https://scifaro.com/en/abs/compact-packings-of-the-plane-with-three-sizes-of-discs-1810.02231</loc><lastmod>2020-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-packings-of-the-plane-with-three-sizes-of-discs-1810.02231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-packings-of-the-plane-with-three-sizes-of-discs-1810.02231"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-interpretations-of-bounded-expansion-classes-1810.02389</loc><lastmod>2018-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-interpretations-of-bounded-expansion-classes-1810.02389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-interpretations-of-bounded-expansion-classes-1810.02389"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-size-of-largest-bins-using-placement-with-linear-transformations-1810.04161</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-size-of-largest-bins-using-placement-with-linear-transformations-1810.04161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-size-of-largest-bins-using-placement-with-linear-transformations-1810.04161"/></url>
<url><loc>https://scifaro.com/en/abs/on-relative-clique-number-of-colored-mixed-graphs-1810.05503</loc><lastmod>2018-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-relative-clique-number-of-colored-mixed-graphs-1810.05503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-relative-clique-number-of-colored-mixed-graphs-1810.05503"/></url>
<url><loc>https://scifaro.com/en/abs/chromatic-polynomials-of-oriented-graphs-1810.05590</loc><lastmod>2018-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chromatic-polynomials-of-oriented-graphs-1810.05590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chromatic-polynomials-of-oriented-graphs-1810.05590"/></url>
<url><loc>https://scifaro.com/en/abs/a-recognition-algorithm-for-adjusted-interval-digraphs-1810.06162</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recognition-algorithm-for-adjusted-interval-digraphs-1810.06162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recognition-algorithm-for-adjusted-interval-digraphs-1810.06162"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-dynamic-cluster-editing-1810.06625</loc><lastmod>2018-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-dynamic-cluster-editing-1810.06625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-dynamic-cluster-editing-1810.06625"/></url>
<url><loc>https://scifaro.com/en/abs/balancedness-and-coboundaries-in-symbolic-systems-1810.07453</loc><lastmod>2018-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balancedness-and-coboundaries-in-symbolic-systems-1810.07453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balancedness-and-coboundaries-in-symbolic-systems-1810.07453"/></url>
<url><loc>https://scifaro.com/en/abs/forman-s-ricci-curvature-from-networks-to-hypernetworks-1810.07749</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forman-s-ricci-curvature-from-networks-to-hypernetworks-1810.07749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forman-s-ricci-curvature-from-networks-to-hypernetworks-1810.07749"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-color-avoiding-site-and-bond-percolation-1810.08484</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-color-avoiding-site-and-bond-percolation-1810.08484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-color-avoiding-site-and-bond-percolation-1810.08484"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-control-of-dynamic-bipartite-matching-models-1810.08541</loc><lastmod>2020-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-control-of-dynamic-bipartite-matching-models-1810.08541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-control-of-dynamic-bipartite-matching-models-1810.08541"/></url>
<url><loc>https://scifaro.com/en/abs/erratum-for-on-oriented-cliques-with-respect-to-push-operation-1810.08660</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/erratum-for-on-oriented-cliques-with-respect-to-push-operation-1810.08660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/erratum-for-on-oriented-cliques-with-respect-to-push-operation-1810.08660"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-information-distortions-and-incompressibility-in-uniform-multidimensional-networks-1810.11719</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-information-distortions-and-incompressibility-in-uniform-multidimensional-networks-1810.11719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-information-distortions-and-incompressibility-in-uniform-multidimensional-networks-1810.11719"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-end-vertex-problem-of-graph-searches-1810.12253</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-end-vertex-problem-of-graph-searches-1810.12253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-end-vertex-problem-of-graph-searches-1810.12253"/></url>
<url><loc>https://scifaro.com/en/abs/the-2-domination-and-roman-domination-numbers-of-grid-graphs-1810.12896</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-2-domination-and-roman-domination-numbers-of-grid-graphs-1810.12896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-2-domination-and-roman-domination-numbers-of-grid-graphs-1810.12896"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-equitable-coloring-1810.13036</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-equitable-coloring-1810.13036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-equitable-coloring-1810.13036"/></url>
<url><loc>https://scifaro.com/en/abs/generation-of-random-chordal-graphs-using-subtrees-of-a-tree-1810.13326</loc><lastmod>2018-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generation-of-random-chordal-graphs-using-subtrees-of-a-tree-1810.13326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generation-of-random-chordal-graphs-using-subtrees-of-a-tree-1810.13326"/></url>
<url><loc>https://scifaro.com/en/abs/domain-reduction-for-monotonicity-testing-a-o-d-tester-for-boolean-functions-in-d-dimensions-1811.01427</loc><lastmod>2019-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-reduction-for-monotonicity-testing-a-o-d-tester-for-boolean-functions-in-d-dimensions-1811.01427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-reduction-for-monotonicity-testing-a-o-d-tester-for-boolean-functions-in-d-dimensions-1811.01427"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-simultaneous-representation-problem-for-interval-and-circular-arc-graphs-1811.04062</loc><lastmod>2018-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-simultaneous-representation-problem-for-interval-and-circular-arc-graphs-1811.04062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-simultaneous-representation-problem-for-interval-and-circular-arc-graphs-1811.04062"/></url>
<url><loc>https://scifaro.com/en/abs/some-problems-and-algorithms-related-to-the-weight-order-relation-on-the-n-dimensional-boolean-cube-1811.04421</loc><lastmod>2020-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-problems-and-algorithms-related-to-the-weight-order-relation-on-the-n-dimensional-boolean-cube-1811.04421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-problems-and-algorithms-related-to-the-weight-order-relation-on-the-n-dimensional-boolean-cube-1811.04421"/></url>
<url><loc>https://scifaro.com/en/abs/generating-subgraphs-in-chordal-graphs-1811.04429</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-subgraphs-in-chordal-graphs-1811.04429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-subgraphs-in-chordal-graphs-1811.04429"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-generating-subgraphs-revisited-1811.04433</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-generating-subgraphs-revisited-1811.04433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-generating-subgraphs-revisited-1811.04433"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-vs-synthesis-with-structure-an-investigation-of-union-of-subspace-models-on-graphs-1811.04493</loc><lastmod>2022-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-vs-synthesis-with-structure-an-investigation-of-union-of-subspace-models-on-graphs-1811.04493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-vs-synthesis-with-structure-an-investigation-of-union-of-subspace-models-on-graphs-1811.04493"/></url>
<url><loc>https://scifaro.com/en/abs/sliding-window-temporal-graph-coloring-1811.04753</loc><lastmod>2019-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sliding-window-temporal-graph-coloring-1811.04753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sliding-window-temporal-graph-coloring-1811.04753"/></url>
<url><loc>https://scifaro.com/en/abs/on-weisfeiler-leman-invariance-subgraph-counts-and-related-graph-properties-1811.04801</loc><lastmod>2019-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-weisfeiler-leman-invariance-subgraph-counts-and-related-graph-properties-1811.04801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-weisfeiler-leman-invariance-subgraph-counts-and-related-graph-properties-1811.04801"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-maximization-of-functions-with-bounded-curvature-under-partition-matroid-constraints-1811.05351</loc><lastmod>2019-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-maximization-of-functions-with-bounded-curvature-under-partition-matroid-constraints-1811.05351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-maximization-of-functions-with-bounded-curvature-under-partition-matroid-constraints-1811.05351"/></url>
<url><loc>https://scifaro.com/en/abs/spectrum-graph-coloring-to-improve-wi-fi-channel-assignment-in-a-real-world-scenario-via-edge-contraction-1811.06832</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectrum-graph-coloring-to-improve-wi-fi-channel-assignment-in-a-real-world-scenario-via-edge-contraction-1811.06832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectrum-graph-coloring-to-improve-wi-fi-channel-assignment-in-a-real-world-scenario-via-edge-contraction-1811.06832"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-popular-matchings-via-stable-matchings-1811.06897</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-popular-matchings-via-stable-matchings-1811.06897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-popular-matchings-via-stable-matchings-1811.06897"/></url>
<url><loc>https://scifaro.com/en/abs/forman-ricci-curvature-for-hypergraphs-1811.07825</loc><lastmod>2019-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forman-ricci-curvature-for-hypergraphs-1811.07825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forman-ricci-curvature-for-hypergraphs-1811.07825"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithm-for-the-partial-set-multi-cover-problem-1811.08185</loc><lastmod>2019-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithm-for-the-partial-set-multi-cover-problem-1811.08185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithm-for-the-partial-set-multi-cover-problem-1811.08185"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-guesswork-with-an-unreliable-oracle-1811.08528</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-guesswork-with-an-unreliable-oracle-1811.08528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-guesswork-with-an-unreliable-oracle-1811.08528"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-graph-search-trees-1811.09249</loc><lastmod>2018-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-graph-search-trees-1811.09249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-graph-search-trees-1811.09249"/></url>
<url><loc>https://scifaro.com/en/abs/on-independent-cliques-and-linear-complementarity-problems-1811.09798</loc><lastmod>2018-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-independent-cliques-and-linear-complementarity-problems-1811.09798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-independent-cliques-and-linear-complementarity-problems-1811.09798"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-constructions-of-convex-combinations-for-2-edge-connected-subgraphs-on-fundamental-classes-1811.09906</loc><lastmod>2021-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-constructions-of-convex-combinations-for-2-edge-connected-subgraphs-on-fundamental-classes-1811.09906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-constructions-of-convex-combinations-for-2-edge-connected-subgraphs-on-fundamental-classes-1811.09906"/></url>
<url><loc>https://scifaro.com/en/abs/maintaining-perfect-matchings-at-low-cost-1811.10580</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maintaining-perfect-matchings-at-low-cost-1811.10580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maintaining-perfect-matchings-at-low-cost-1811.10580"/></url>
<url><loc>https://scifaro.com/en/abs/modular-decomposition-of-graphs-and-hierarchical-modeling-1811.10705</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-decomposition-of-graphs-and-hierarchical-modeling-1811.10705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-decomposition-of-graphs-and-hierarchical-modeling-1811.10705"/></url>
<url><loc>https://scifaro.com/en/abs/a-schur-complement-cheeger-inequality-1811.10834</loc><lastmod>2018-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-schur-complement-cheeger-inequality-1811.10834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-schur-complement-cheeger-inequality-1811.10834"/></url>
<url><loc>https://scifaro.com/en/abs/robust-invariant-sets-computation-for-switched-discrete-time-polynomial-systems-1811.11454</loc><lastmod>2021-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-invariant-sets-computation-for-switched-discrete-time-polynomial-systems-1811.11454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-invariant-sets-computation-for-switched-discrete-time-polynomial-systems-1811.11454"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-cycles-and-paths-in-hypercubes-with-disjoint-faulty-edges-1811.11516</loc><lastmod>2021-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-cycles-and-paths-in-hypercubes-with-disjoint-faulty-edges-1811.11516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-cycles-and-paths-in-hypercubes-with-disjoint-faulty-edges-1811.11516"/></url>
<url><loc>https://scifaro.com/en/abs/toward-breaking-the-curse-of-dimensionality-an-fptas-for-stochastic-dynamic-programs-with-multidimensional-actions-and-scalar-states-1811.11680</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-breaking-the-curse-of-dimensionality-an-fptas-for-stochastic-dynamic-programs-with-multidimensional-actions-and-scalar-states-1811.11680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-breaking-the-curse-of-dimensionality-an-fptas-for-stochastic-dynamic-programs-with-multidimensional-actions-and-scalar-states-1811.11680"/></url>
<url><loc>https://scifaro.com/en/abs/game-tree-search-in-a-robust-multistage-optimization-framework-exploiting-pruning-mechanisms-1811.12146</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-tree-search-in-a-robust-multistage-optimization-framework-exploiting-pruning-mechanisms-1811.12146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-tree-search-in-a-robust-multistage-optimization-framework-exploiting-pruning-mechanisms-1811.12146"/></url>
<url><loc>https://scifaro.com/en/abs/graph-isomorphism-for-h-1-h-2-free-graphs-an-almost-complete-dichotomy-1811.12252</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-isomorphism-for-h-1-h-2-free-graphs-an-almost-complete-dichotomy-1811.12252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-isomorphism-for-h-1-h-2-free-graphs-an-almost-complete-dichotomy-1811.12252"/></url>
<url><loc>https://scifaro.com/en/abs/the-polytope-of-legal-sequences-1811.12360</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-polytope-of-legal-sequences-1811.12360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-polytope-of-legal-sequences-1811.12360"/></url>
<url><loc>https://scifaro.com/en/abs/a-branch-and-price-algorithm-for-list-coloring-problem-1812.00040</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-branch-and-price-algorithm-for-list-coloring-problem-1812.00040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-branch-and-price-algorithm-for-list-coloring-problem-1812.00040"/></url>
<url><loc>https://scifaro.com/en/abs/the-component-connectivity-of-alternating-group-graphs-and-split-stars-1812.00617</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-component-connectivity-of-alternating-group-graphs-and-split-stars-1812.00617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-component-connectivity-of-alternating-group-graphs-and-split-stars-1812.00617"/></url>
<url><loc>https://scifaro.com/en/abs/total-2-domination-of-proper-interval-graphs-1812.00689</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-2-domination-of-proper-interval-graphs-1812.00689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-2-domination-of-proper-interval-graphs-1812.00689"/></url>
<url><loc>https://scifaro.com/en/abs/on-mixed-domination-in-generalized-petersen-graphs-1812.00977</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-mixed-domination-in-generalized-petersen-graphs-1812.00977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-mixed-domination-in-generalized-petersen-graphs-1812.00977"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-boolean-locality-sensitive-hashing-1812.01557</loc><lastmod>2018-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-boolean-locality-sensitive-hashing-1812.01557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-boolean-locality-sensitive-hashing-1812.01557"/></url>
<url><loc>https://scifaro.com/en/abs/solving-group-steiner-problems-as-steiner-problems-the-rigorous-proof-1812.01678</loc><lastmod>2019-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-group-steiner-problems-as-steiner-problems-the-rigorous-proof-1812.01678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-group-steiner-problems-as-steiner-problems-the-rigorous-proof-1812.01678"/></url>
<url><loc>https://scifaro.com/en/abs/unlabeled-sample-compression-schemes-and-corner-peelings-for-ample-and-maximum-classes-1812.02099</loc><lastmod>2022-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unlabeled-sample-compression-schemes-and-corner-peelings-for-ample-and-maximum-classes-1812.02099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unlabeled-sample-compression-schemes-and-corner-peelings-for-ample-and-maximum-classes-1812.02099"/></url>
<url><loc>https://scifaro.com/en/abs/the-spread-of-voting-attitudes-in-social-networks-1812.02143</loc><lastmod>2020-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-spread-of-voting-attitudes-in-social-networks-1812.02143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-spread-of-voting-attitudes-in-social-networks-1812.02143"/></url>
<url><loc>https://scifaro.com/en/abs/hardy-muckenhoupt-bounds-for-laplacian-eigenvalues-1812.02841</loc><lastmod>2018-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardy-muckenhoupt-bounds-for-laplacian-eigenvalues-1812.02841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardy-muckenhoupt-bounds-for-laplacian-eigenvalues-1812.02841"/></url>
<url><loc>https://scifaro.com/en/abs/non-crossing-geometric-spanning-trees-with-bounded-degree-and-monochromatic-leaves-on-bicolored-point-sets-1812.02866</loc><lastmod>2018-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-crossing-geometric-spanning-trees-with-bounded-degree-and-monochromatic-leaves-on-bicolored-point-sets-1812.02866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-crossing-geometric-spanning-trees-with-bounded-degree-and-monochromatic-leaves-on-bicolored-point-sets-1812.02866"/></url>
<url><loc>https://scifaro.com/en/abs/counting-independent-sets-in-graphs-with-bounded-bipartite-pathwidth-1812.03195</loc><lastmod>2020-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-independent-sets-in-graphs-with-bounded-bipartite-pathwidth-1812.03195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-independent-sets-in-graphs-with-bounded-bipartite-pathwidth-1812.03195"/></url>
<url><loc>https://scifaro.com/en/abs/cut-polytope-has-vertices-on-a-line-1812.03212</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-polytope-has-vertices-on-a-line-1812.03212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-polytope-has-vertices-on-a-line-1812.03212"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-conversion-number-of-regular-graphs-1812.03250</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-conversion-number-of-regular-graphs-1812.03250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-conversion-number-of-regular-graphs-1812.03250"/></url>
<url><loc>https://scifaro.com/en/abs/towards-quantification-of-incompleteness-in-the-pairwise-comparisons-method-1812.03589</loc><lastmod>2019-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-quantification-of-incompleteness-in-the-pairwise-comparisons-method-1812.03589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-quantification-of-incompleteness-in-the-pairwise-comparisons-method-1812.03589"/></url>
<url><loc>https://scifaro.com/en/abs/map-graphs-having-witnesses-of-large-girth-1812.04102</loc><lastmod>2018-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/map-graphs-having-witnesses-of-large-girth-1812.04102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/map-graphs-having-witnesses-of-large-girth-1812.04102"/></url>
<url><loc>https://scifaro.com/en/abs/on-generalized-lyndon-words-1812.04515</loc><lastmod>2018-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-generalized-lyndon-words-1812.04515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-generalized-lyndon-words-1812.04515"/></url>
<url><loc>https://scifaro.com/en/abs/on-graphs-whose-eternal-vertex-cover-number-and-vertex-cover-number-coincide-1812.05125</loc><lastmod>2019-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-graphs-whose-eternal-vertex-cover-number-and-vertex-cover-number-coincide-1812.05125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-graphs-whose-eternal-vertex-cover-number-and-vertex-cover-number-coincide-1812.05125"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-unavoidability-of-oriented-trees-1812.05167</loc><lastmod>2018-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-unavoidability-of-oriented-trees-1812.05167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-unavoidability-of-oriented-trees-1812.05167"/></url>
<url><loc>https://scifaro.com/en/abs/oriented-colourings-of-graphs-with-maximum-degree-three-and-four-1812.05510</loc><lastmod>2018-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oriented-colourings-of-graphs-with-maximum-degree-three-and-four-1812.05510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oriented-colourings-of-graphs-with-maximum-degree-three-and-four-1812.05510"/></url>
<url><loc>https://scifaro.com/en/abs/minuet-a-method-to-solve-sudoku-puzzles-by-hand-1812.06778</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minuet-a-method-to-solve-sudoku-puzzles-by-hand-1812.06778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minuet-a-method-to-solve-sudoku-puzzles-by-hand-1812.06778"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-k-binomial-complexity-of-the-thue-morse-word-1812.07330</loc><lastmod>2018-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-k-binomial-complexity-of-the-thue-morse-word-1812.07330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-k-binomial-complexity-of-the-thue-morse-word-1812.07330"/></url>
<url><loc>https://scifaro.com/en/abs/optimality-clue-for-graph-coloring-problem-1812.07734</loc><lastmod>2018-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimality-clue-for-graph-coloring-problem-1812.07734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimality-clue-for-graph-coloring-problem-1812.07734"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-entropy-of-coverable-subshifts-1812.08022</loc><lastmod>2018-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-entropy-of-coverable-subshifts-1812.08022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-entropy-of-coverable-subshifts-1812.08022"/></url>
<url><loc>https://scifaro.com/en/abs/arc-disjoint-strong-spanning-subdigraphs-in-compositions-and-products-of-digraphs-1812.08809</loc><lastmod>2018-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arc-disjoint-strong-spanning-subdigraphs-in-compositions-and-products-of-digraphs-1812.08809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arc-disjoint-strong-spanning-subdigraphs-in-compositions-and-products-of-digraphs-1812.08809"/></url>
<url><loc>https://scifaro.com/en/abs/using-first-hitting-times-to-find-sets-that-maximize-the-convergence-rate-to-consensus-1812.08881</loc><lastmod>2018-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-first-hitting-times-to-find-sets-that-maximize-the-convergence-rate-to-consensus-1812.08881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-first-hitting-times-to-find-sets-that-maximize-the-convergence-rate-to-consensus-1812.08881"/></url>
<url><loc>https://scifaro.com/en/abs/the-fair-division-of-hereditary-set-systems-1812.09561</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fair-division-of-hereditary-set-systems-1812.09561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fair-division-of-hereditary-set-systems-1812.09561"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-list-edge-coloring-multigraphs-asymptotically-optimally-1812.10309</loc><lastmod>2021-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-list-edge-coloring-multigraphs-asymptotically-optimally-1812.10309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-list-edge-coloring-multigraphs-asymptotically-optimally-1812.10309"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-watermark-numbers-encoded-as-reducible-permutation-graphs-against-malicious-attacks-1812.11080</loc><lastmod>2018-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-watermark-numbers-encoded-as-reducible-permutation-graphs-against-malicious-attacks-1812.11080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-watermark-numbers-encoded-as-reducible-permutation-graphs-against-malicious-attacks-1812.11080"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-of-unweighted-complex-networks-via-discrete-morse-theory-1901.00395</loc><lastmod>2019-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-of-unweighted-complex-networks-via-discrete-morse-theory-1901.00395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-of-unweighted-complex-networks-via-discrete-morse-theory-1901.00395"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-divide-conquer-strategies-for-the-0-1-minimization-knapsack-problem-1901.01215</loc><lastmod>2020-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-divide-conquer-strategies-for-the-0-1-minimization-knapsack-problem-1901.01215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-divide-conquer-strategies-for-the-0-1-minimization-knapsack-problem-1901.01215"/></url>
<url><loc>https://scifaro.com/en/abs/baker-game-and-polynomial-time-approximation-schemes-1901.01797</loc><lastmod>2019-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/baker-game-and-polynomial-time-approximation-schemes-1901.01797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/baker-game-and-polynomial-time-approximation-schemes-1901.01797"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-k-edge-colouring-1901.01861</loc><lastmod>2019-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-k-edge-colouring-1901.01861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-k-edge-colouring-1901.01861"/></url>
<url><loc>https://scifaro.com/en/abs/on-induced-online-ramsey-number-of-paths-cycles-and-trees-1901.03671</loc><lastmod>2019-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-induced-online-ramsey-number-of-paths-cycles-and-trees-1901.03671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-induced-online-ramsey-number-of-paths-cycles-and-trees-1901.03671"/></url>
<url><loc>https://scifaro.com/en/abs/the-range-of-non-linear-natural-polynomials-cannot-be-context-free-1901.03913</loc><lastmod>2019-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-range-of-non-linear-natural-polynomials-cannot-be-context-free-1901.03913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-range-of-non-linear-natural-polynomials-cannot-be-context-free-1901.03913"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-on-the-tree-width-of-graphs-with-irrelevant-vertices-1901.04325</loc><lastmod>2019-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-on-the-tree-width-of-graphs-with-irrelevant-vertices-1901.04325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-on-the-tree-width-of-graphs-with-irrelevant-vertices-1901.04325"/></url>
<url><loc>https://scifaro.com/en/abs/extremality-and-sharp-bounds-for-the-k-edge-connectivity-of-graphs-1901.06100</loc><lastmod>2019-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extremality-and-sharp-bounds-for-the-k-edge-connectivity-of-graphs-1901.06100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extremality-and-sharp-bounds-for-the-k-edge-connectivity-of-graphs-1901.06100"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-distance-and-algorithms-of-strong-product-digraphs-1901.06456</loc><lastmod>2019-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-distance-and-algorithms-of-strong-product-digraphs-1901.06456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-distance-and-algorithms-of-strong-product-digraphs-1901.06456"/></url>
<url><loc>https://scifaro.com/en/abs/computing-height-optimal-tangles-faster-1901.06548</loc><lastmod>2024-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-height-optimal-tangles-faster-1901.06548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-height-optimal-tangles-faster-1901.06548"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-path-finding-and-structure-from-acyclicity-1901.07028</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-path-finding-and-structure-from-acyclicity-1901.07028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-path-finding-and-structure-from-acyclicity-1901.07028"/></url>
<url><loc>https://scifaro.com/en/abs/dualization-in-lattices-given-by-implicational-bases-1901.07503</loc><lastmod>2020-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dualization-in-lattices-given-by-implicational-bases-1901.07503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dualization-in-lattices-given-by-implicational-bases-1901.07503"/></url>
<url><loc>https://scifaro.com/en/abs/partial-order-on-the-set-of-boolean-regulatory-functions-1901.07623</loc><lastmod>2019-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-order-on-the-set-of-boolean-regulatory-functions-1901.07623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-order-on-the-set-of-boolean-regulatory-functions-1901.07623"/></url>
<url><loc>https://scifaro.com/en/abs/towards-tight-er-bounds-for-the-excluded-grid-theorem-1901.07944</loc><lastmod>2019-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-tight-er-bounds-for-the-excluded-grid-theorem-1901.07944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-tight-er-bounds-for-the-excluded-grid-theorem-1901.07944"/></url>
<url><loc>https://scifaro.com/en/abs/no-three-in-line-problem-on-a-torus-periodicity-1901.09012</loc><lastmod>2019-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-three-in-line-problem-on-a-torus-periodicity-1901.09012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-three-in-line-problem-on-a-torus-periodicity-1901.09012"/></url>
<url><loc>https://scifaro.com/en/abs/on-multifold-packings-of-radius-1-balls-in-hamming-graphs-1902.00023</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-multifold-packings-of-radius-1-balls-in-hamming-graphs-1902.00023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-multifold-packings-of-radius-1-balls-in-hamming-graphs-1902.00023"/></url>
<url><loc>https://scifaro.com/en/abs/some-enumeration-problems-in-the-duplication-loss-model-of-genome-rearrangement-1902.00230</loc><lastmod>2019-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-enumeration-problems-in-the-duplication-loss-model-of-genome-rearrangement-1902.00230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-enumeration-problems-in-the-duplication-loss-model-of-genome-rearrangement-1902.00230"/></url>
<url><loc>https://scifaro.com/en/abs/eternal-domination-on-prisms-of-graphs-1902.00799</loc><lastmod>2019-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eternal-domination-on-prisms-of-graphs-1902.00799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eternal-domination-on-prisms-of-graphs-1902.00799"/></url>
<url><loc>https://scifaro.com/en/abs/recycling-solutions-for-vertex-coloring-heuristics-1902.01206</loc><lastmod>2021-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recycling-solutions-for-vertex-coloring-heuristics-1902.01206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recycling-solutions-for-vertex-coloring-heuristics-1902.01206"/></url>
<url><loc>https://scifaro.com/en/abs/stabilization-time-in-weighted-minority-processes-1902.01228</loc><lastmod>2019-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabilization-time-in-weighted-minority-processes-1902.01228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabilization-time-in-weighted-minority-processes-1902.01228"/></url>
<url><loc>https://scifaro.com/en/abs/exact-markov-chain-based-runtime-analysis-of-a-discrete-particle-swarm-optimization-algorithm-on-sorting-and-onemax-1902.01810</loc><lastmod>2021-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-markov-chain-based-runtime-analysis-of-a-discrete-particle-swarm-optimization-algorithm-on-sorting-and-onemax-1902.01810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-markov-chain-based-runtime-analysis-of-a-discrete-particle-swarm-optimization-algorithm-on-sorting-and-onemax-1902.01810"/></url>
<url><loc>https://scifaro.com/en/abs/information-theoretic-and-algorithmic-thresholds-for-group-testing-1902.02202</loc><lastmod>2021-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-theoretic-and-algorithmic-thresholds-for-group-testing-1902.02202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-theoretic-and-algorithmic-thresholds-for-group-testing-1902.02202"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-locally-uniform-2-lobsters-1902.02998</loc><lastmod>2019-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-locally-uniform-2-lobsters-1902.02998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-locally-uniform-2-lobsters-1902.02998"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-pancake-stacks-requiring-four-flips-to-be-sorted-1902.04055</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-pancake-stacks-requiring-four-flips-to-be-sorted-1902.04055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-pancake-stacks-requiring-four-flips-to-be-sorted-1902.04055"/></url>
<url><loc>https://scifaro.com/en/abs/dsa-aware-multiple-patterning-for-the-manufacturing-of-vias-connections-to-graph-coloring-problems-ip-formulations-and-numerical-experiments-1902.04145</loc><lastmod>2019-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dsa-aware-multiple-patterning-for-the-manufacturing-of-vias-connections-to-graph-coloring-problems-ip-formulations-and-numerical-experiments-1902.04145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dsa-aware-multiple-patterning-for-the-manufacturing-of-vias-connections-to-graph-coloring-problems-ip-formulations-and-numerical-experiments-1902.04145"/></url>
<url><loc>https://scifaro.com/en/abs/on-long-words-avoiding-zimin-patterns-1902.05540</loc><lastmod>2019-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-long-words-avoiding-zimin-patterns-1902.05540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-long-words-avoiding-zimin-patterns-1902.05540"/></url>
<url><loc>https://scifaro.com/en/abs/expected-capture-time-and-throttling-number-for-cop-versus-gambler-1902.05860</loc><lastmod>2019-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expected-capture-time-and-throttling-number-for-cop-versus-gambler-1902.05860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expected-capture-time-and-throttling-number-for-cop-versus-gambler-1902.05860"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-and-algorithmic-properties-of-one-matrix-structure-at-monotone-boolean-functions-1902.06110</loc><lastmod>2019-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-and-algorithmic-properties-of-one-matrix-structure-at-monotone-boolean-functions-1902.06110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-and-algorithmic-properties-of-one-matrix-structure-at-monotone-boolean-functions-1902.06110"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-unique-computational-graphs-via-an-iterative-graph-invariant-1902.06192</loc><lastmod>2019-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-unique-computational-graphs-via-an-iterative-graph-invariant-1902.06192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-unique-computational-graphs-via-an-iterative-graph-invariant-1902.06192"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-dualization-in-distributive-lattices-and-related-problems-1902.07004</loc><lastmod>2020-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-dualization-in-distributive-lattices-and-related-problems-1902.07004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-dualization-in-distributive-lattices-and-related-problems-1902.07004"/></url>
<url><loc>https://scifaro.com/en/abs/biasing-boolean-functions-and-collective-coin-flipping-protocols-over-arbitrary-product-distributions-1902.07426</loc><lastmod>2019-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/biasing-boolean-functions-and-collective-coin-flipping-protocols-over-arbitrary-product-distributions-1902.07426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/biasing-boolean-functions-and-collective-coin-flipping-protocols-over-arbitrary-product-distributions-1902.07426"/></url>
<url><loc>https://scifaro.com/en/abs/from-sharma-mittal-to-von-neumann-entropy-of-a-graph-1902.07548</loc><lastmod>2019-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-sharma-mittal-to-von-neumann-entropy-of-a-graph-1902.07548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-sharma-mittal-to-von-neumann-entropy-of-a-graph-1902.07548"/></url>
<url><loc>https://scifaro.com/en/abs/a-unifying-framework-for-spectrum-preserving-graph-sparsification-and-coarsening-1902.09702</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unifying-framework-for-spectrum-preserving-graph-sparsification-and-coarsening-1902.09702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unifying-framework-for-spectrum-preserving-graph-sparsification-and-coarsening-1902.09702"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mortality-problem-from-multiplicative-matrix-equations-to-linear-recurrence-sequences-and-beyond-1902.10188</loc><lastmod>2019-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mortality-problem-from-multiplicative-matrix-equations-to-linear-recurrence-sequences-and-beyond-1902.10188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mortality-problem-from-multiplicative-matrix-equations-to-linear-recurrence-sequences-and-beyond-1902.10188"/></url>
<url><loc>https://scifaro.com/en/abs/formal-structure-of-periodic-system-of-elements-1902.10752</loc><lastmod>2019-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-structure-of-periodic-system-of-elements-1902.10752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-structure-of-periodic-system-of-elements-1902.10752"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-connected-graph-partitions-1902.10765</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-connected-graph-partitions-1902.10765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-connected-graph-partitions-1902.10765"/></url>
<url><loc>https://scifaro.com/en/abs/colourful-components-in-k-caterpillars-and-planar-graphs-1902.11191</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colourful-components-in-k-caterpillars-and-planar-graphs-1902.11191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colourful-components-in-k-caterpillars-and-planar-graphs-1902.11191"/></url>
<url><loc>https://scifaro.com/en/abs/multi-criteria-dimensionality-reduction-with-applications-to-fairness-1902.11281</loc><lastmod>2020-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-criteria-dimensionality-reduction-with-applications-to-fairness-1902.11281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-criteria-dimensionality-reduction-with-applications-to-fairness-1902.11281"/></url>
<url><loc>https://scifaro.com/en/abs/longest-paths-in-2-edge-connected-cubic-graphs-1903.02508</loc><lastmod>2019-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/longest-paths-in-2-edge-connected-cubic-graphs-1903.02508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/longest-paths-in-2-edge-connected-cubic-graphs-1903.02508"/></url>
<url><loc>https://scifaro.com/en/abs/well-indumatched-trees-and-graphs-of-bounded-girth-1903.03197</loc><lastmod>2019-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-indumatched-trees-and-graphs-of-bounded-girth-1903.03197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-indumatched-trees-and-graphs-of-bounded-girth-1903.03197"/></url>
<url><loc>https://scifaro.com/en/abs/how-far-away-must-forced-letters-be-so-that-squares-are-still-avoidable-1903.04214</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-far-away-must-forced-letters-be-so-that-squares-are-still-avoidable-1903.04214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-far-away-must-forced-letters-be-so-that-squares-are-still-avoidable-1903.04214"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-minimum-labeling-global-cut-problem-by-mathematical-programming-1903.04319</loc><lastmod>2019-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-minimum-labeling-global-cut-problem-by-mathematical-programming-1903.04319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-minimum-labeling-global-cut-problem-by-mathematical-programming-1903.04319"/></url>
<url><loc>https://scifaro.com/en/abs/the-relationship-between-word-complexity-and-computational-complexity-in-subshifts-1903.04325</loc><lastmod>2019-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relationship-between-word-complexity-and-computational-complexity-in-subshifts-1903.04325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relationship-between-word-complexity-and-computational-complexity-in-subshifts-1903.04325"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-dominating-sets-in-a-tree-counting-enumeration-and-extremal-results-1903.04517</loc><lastmod>2019-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-dominating-sets-in-a-tree-counting-enumeration-and-extremal-results-1903.04517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-dominating-sets-in-a-tree-counting-enumeration-and-extremal-results-1903.04517"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-maximum-weight-independent-set-problem-in-graphs-without-induced-cycles-of-length-at-least-five-1903.04761</loc><lastmod>2020-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-maximum-weight-independent-set-problem-in-graphs-without-induced-cycles-of-length-at-least-five-1903.04761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-maximum-weight-independent-set-problem-in-graphs-without-induced-cycles-of-length-at-least-five-1903.04761"/></url>
<url><loc>https://scifaro.com/en/abs/an-unique-and-novel-graph-matrix-for-efficient-extraction-of-structural-information-of-networks-1903.05341</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-unique-and-novel-graph-matrix-for-efficient-extraction-of-structural-information-of-networks-1903.05341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-unique-and-novel-graph-matrix-for-efficient-extraction-of-structural-information-of-networks-1903.05341"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-version-of-cereceda-s-conjecture-1903.05619</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-version-of-cereceda-s-conjecture-1903.05619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-version-of-cereceda-s-conjecture-1903.05619"/></url>
<url><loc>https://scifaro.com/en/abs/normal-6-edge-colorings-of-some-bridgeless-cubic-graphs-1903.06043</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-6-edge-colorings-of-some-bridgeless-cubic-graphs-1903.06043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-6-edge-colorings-of-some-bridgeless-cubic-graphs-1903.06043"/></url>
<url><loc>https://scifaro.com/en/abs/on-cayley-graphs-of-basic-algebraic-structures-1903.06521</loc><lastmod>2019-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cayley-graphs-of-basic-algebraic-structures-1903.06521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cayley-graphs-of-basic-algebraic-structures-1903.06521"/></url>
<url><loc>https://scifaro.com/en/abs/a-tighter-bound-on-the-number-of-relevant-variables-in-a-bounded-degree-boolean-function-1903.08214</loc><lastmod>2019-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tighter-bound-on-the-number-of-relevant-variables-in-a-bounded-degree-boolean-function-1903.08214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tighter-bound-on-the-number-of-relevant-variables-in-a-bounded-degree-boolean-function-1903.08214"/></url>
<url><loc>https://scifaro.com/en/abs/any-finite-distributive-lattice-is-isomorphic-to-the-minimizer-set-of-an-rm-m-natural-concave-set-function-1903.08343</loc><lastmod>2019-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/any-finite-distributive-lattice-is-isomorphic-to-the-minimizer-set-of-an-rm-m-natural-concave-set-function-1903.08343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/any-finite-distributive-lattice-is-isomorphic-to-the-minimizer-set-of-an-rm-m-natural-concave-set-function-1903.08343"/></url>
<url><loc>https://scifaro.com/en/abs/best-of-three-voting-on-dense-graphs-1903.09524</loc><lastmod>2019-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-of-three-voting-on-dense-graphs-1903.09524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-of-three-voting-on-dense-graphs-1903.09524"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-bound-on-the-k-rendezvous-time-for-primitive-sets-of-nz-matrices-1903.10421</loc><lastmod>2021-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-bound-on-the-k-rendezvous-time-for-primitive-sets-of-nz-matrices-1903.10421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-bound-on-the-k-rendezvous-time-for-primitive-sets-of-nz-matrices-1903.10421"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistency-indices-for-incomplete-pairwise-comparisons-matrices-1903.11873</loc><lastmod>2020-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistency-indices-for-incomplete-pairwise-comparisons-matrices-1903.11873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistency-indices-for-incomplete-pairwise-comparisons-matrices-1903.11873"/></url>
<url><loc>https://scifaro.com/en/abs/arc-disjoint-strong-spanning-subdigraphs-of-semicomplete-compositions-1903.12225</loc><lastmod>2019-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arc-disjoint-strong-spanning-subdigraphs-of-semicomplete-compositions-1903.12225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arc-disjoint-strong-spanning-subdigraphs-of-semicomplete-compositions-1903.12225"/></url>
<url><loc>https://scifaro.com/en/abs/color-refinement-homomorphisms-and-hypergraphs-1903.12432</loc><lastmod>2019-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/color-refinement-homomorphisms-and-hypergraphs-1903.12432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/color-refinement-homomorphisms-and-hypergraphs-1903.12432"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-longest-common-subsequence-of-thue-morse-words-1904.00248</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-longest-common-subsequence-of-thue-morse-words-1904.00248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-longest-common-subsequence-of-thue-morse-words-1904.00248"/></url>
<url><loc>https://scifaro.com/en/abs/pebble-exchange-group-of-graphs-1904.00402</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pebble-exchange-group-of-graphs-1904.00402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pebble-exchange-group-of-graphs-1904.00402"/></url>
<url><loc>https://scifaro.com/en/abs/some-variations-on-lyndon-words-1904.00954</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-variations-on-lyndon-words-1904.00954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-variations-on-lyndon-words-1904.00954"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-algorithms-for-semipaired-domination-in-graphs-1904.00964</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-algorithms-for-semipaired-domination-in-graphs-1904.00964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-algorithms-for-semipaired-domination-in-graphs-1904.00964"/></url>
<url><loc>https://scifaro.com/en/abs/random-walks-and-forbidden-minors-ii-a-text-poly-d-varepsilon-1-query-tester-for-minor-closed-properties-of-bounded-degree-graphs-1904.01055</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-walks-and-forbidden-minors-ii-a-text-poly-d-varepsilon-1-query-tester-for-minor-closed-properties-of-bounded-degree-graphs-1904.01055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-walks-and-forbidden-minors-ii-a-text-poly-d-varepsilon-1-query-tester-for-minor-closed-properties-of-bounded-degree-graphs-1904.01055"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-and-an-integer-program-for-multi-level-graph-spanners-1904.01135</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-and-an-integer-program-for-multi-level-graph-spanners-1904.01135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-and-an-integer-program-for-multi-level-graph-spanners-1904.01135"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-and-periodicity-of-low-complexity-tilings-1904.01267</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-and-periodicity-of-low-complexity-tilings-1904.01267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-and-periodicity-of-low-complexity-tilings-1904.01267"/></url>
<url><loc>https://scifaro.com/en/abs/on-transitive-uniform-partitions-of-f-n-into-binary-hamming-codes-1904.01282</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-transitive-uniform-partitions-of-f-n-into-binary-hamming-codes-1904.01282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-transitive-uniform-partitions-of-f-n-into-binary-hamming-codes-1904.01282"/></url>
<url><loc>https://scifaro.com/en/abs/the-satisfiability-threshold-for-non-uniform-random-2-sat-1904.02027</loc><lastmod>2022-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-satisfiability-threshold-for-non-uniform-random-2-sat-1904.02027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-satisfiability-threshold-for-non-uniform-random-2-sat-1904.02027"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-upper-bound-for-the-ring-loading-problem-1904.02119</loc><lastmod>2019-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-upper-bound-for-the-ring-loading-problem-1904.02119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-upper-bound-for-the-ring-loading-problem-1904.02119"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-analysis-of-lateral-inhibition-1904.02544</loc><lastmod>2020-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-analysis-of-lateral-inhibition-1904.02544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-analysis-of-lateral-inhibition-1904.02544"/></url>
<url><loc>https://scifaro.com/en/abs/the-hamiltonicity-hamiltonian-connectivity-and-longest-s-t-path-of-l-shaped-supergrid-graphs-1904.02581</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hamiltonicity-hamiltonian-connectivity-and-longest-s-t-path-of-l-shaped-supergrid-graphs-1904.02581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hamiltonicity-hamiltonian-connectivity-and-longest-s-t-path-of-l-shaped-supergrid-graphs-1904.02581"/></url>
<url><loc>https://scifaro.com/en/abs/normal-5-edge-colorings-of-a-family-of-loupekhine-snarks-1904.02661</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-5-edge-colorings-of-a-family-of-loupekhine-snarks-1904.02661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-5-edge-colorings-of-a-family-of-loupekhine-snarks-1904.02661"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-maximal-2-dimensional-subgraphs-of-transitive-graphs-1904.03558</loc><lastmod>2019-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-maximal-2-dimensional-subgraphs-of-transitive-graphs-1904.03558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-maximal-2-dimensional-subgraphs-of-transitive-graphs-1904.03558"/></url>
<url><loc>https://scifaro.com/en/abs/planar-graphs-have-bounded-queue-number-1904.04791</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-graphs-have-bounded-queue-number-1904.04791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-graphs-have-bounded-queue-number-1904.04791"/></url>
<url><loc>https://scifaro.com/en/abs/prolific-compositions-1904.05533</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prolific-compositions-1904.05533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prolific-compositions-1904.05533"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-separators-in-graphs-1904.06595</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-separators-in-graphs-1904.06595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-separators-in-graphs-1904.06595"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-upper-bound-on-the-weisfeiler-leman-dimension-of-graphs-of-bounded-genus-1904.07216</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-upper-bound-on-the-weisfeiler-leman-dimension-of-graphs-of-bounded-genus-1904.07216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-upper-bound-on-the-weisfeiler-leman-dimension-of-graphs-of-bounded-genus-1904.07216"/></url>
<url><loc>https://scifaro.com/en/abs/the-intersection-of-two-vertex-coloring-problems-1904.08180</loc><lastmod>2019-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-intersection-of-two-vertex-coloring-problems-1904.08180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-intersection-of-two-vertex-coloring-problems-1904.08180"/></url>
<url><loc>https://scifaro.com/en/abs/assigning-tasks-to-agents-under-time-conflicts-a-parameterized-complexity-approach-1904.09246</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assigning-tasks-to-agents-under-time-conflicts-a-parameterized-complexity-approach-1904.09246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assigning-tasks-to-agents-under-time-conflicts-a-parameterized-complexity-approach-1904.09246"/></url>
<url><loc>https://scifaro.com/en/abs/energy-consumption-of-group-search-on-a-line-1904.09714</loc><lastmod>2019-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/energy-consumption-of-group-search-on-a-line-1904.09714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/energy-consumption-of-group-search-on-a-line-1904.09714"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-biased-diffusion-limited-aggregation-1904.10011</loc><lastmod>2021-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-biased-diffusion-limited-aggregation-1904.10011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-biased-diffusion-limited-aggregation-1904.10011"/></url>
<url><loc>https://scifaro.com/en/abs/a-category-theoretic-interpretation-of-gandy-s-principles-for-mechanisms-1904.10109</loc><lastmod>2019-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-category-theoretic-interpretation-of-gandy-s-principles-for-mechanisms-1904.10109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-category-theoretic-interpretation-of-gandy-s-principles-for-mechanisms-1904.10109"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-architecture-of-oritatami-systems-for-simulating-arbitrary-finite-automata-1904.10174</loc><lastmod>2019-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-architecture-of-oritatami-systems-for-simulating-arbitrary-finite-automata-1904.10174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-architecture-of-oritatami-systems-for-simulating-arbitrary-finite-automata-1904.10174"/></url>
<url><loc>https://scifaro.com/en/abs/palindromes-in-two-dimensional-words-1904.11334</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/palindromes-in-two-dimensional-words-1904.11334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/palindromes-in-two-dimensional-words-1904.11334"/></url>
<url><loc>https://scifaro.com/en/abs/a-multi-start-local-search-algorithm-for-the-hamiltonian-completion-problem-on-undirected-graphs-1904.11337</loc><lastmod>2020-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multi-start-local-search-algorithm-for-the-hamiltonian-completion-problem-on-undirected-graphs-1904.11337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multi-start-local-search-algorithm-for-the-hamiltonian-completion-problem-on-undirected-graphs-1904.11337"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-path-coloring-problem-in-graphs-with-bounded-treewidth-an-application-in-integrated-circuit-manufacturing-1904.11805</loc><lastmod>2019-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-path-coloring-problem-in-graphs-with-bounded-treewidth-an-application-in-integrated-circuit-manufacturing-1904.11805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-path-coloring-problem-in-graphs-with-bounded-treewidth-an-application-in-integrated-circuit-manufacturing-1904.11805"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-the-maximum-connectivity-improvement-problem-1904.12000</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-the-maximum-connectivity-improvement-problem-1904.12000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-the-maximum-connectivity-improvement-problem-1904.12000"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-algorithms-for-partial-vertex-covers-in-bipartite-graphs-1904.12011</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-algorithms-for-partial-vertex-covers-in-bipartite-graphs-1904.12011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-algorithms-for-partial-vertex-covers-in-bipartite-graphs-1904.12011"/></url>
<url><loc>https://scifaro.com/en/abs/every-planar-graph-with-delta-geqslant-8-is-totally-delta-2-choosable-1904.12060</loc><lastmod>2022-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/every-planar-graph-with-delta-geqslant-8-is-totally-delta-2-choosable-1904.12060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/every-planar-graph-with-delta-geqslant-8-is-totally-delta-2-choosable-1904.12060"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-the-excluded-minor-approximation-of-treedepth-1904.13077</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-the-excluded-minor-approximation-of-treedepth-1904.13077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-the-excluded-minor-approximation-of-treedepth-1904.13077"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-hull-number-in-toll-convexity-1905.00109</loc><lastmod>2020-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-hull-number-in-toll-convexity-1905.00109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-hull-number-in-toll-convexity-1905.00109"/></url>
<url><loc>https://scifaro.com/en/abs/warshall-s-algorithm-survey-and-applications-1905.00276</loc><lastmod>2019-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/warshall-s-algorithm-survey-and-applications-1905.00276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/warshall-s-algorithm-survey-and-applications-1905.00276"/></url>
<url><loc>https://scifaro.com/en/abs/multi-level-graph-sketches-via-single-level-solvers-1905.00536</loc><lastmod>2019-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-level-graph-sketches-via-single-level-solvers-1905.00536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-level-graph-sketches-via-single-level-solvers-1905.00536"/></url>
<url><loc>https://scifaro.com/en/abs/benchmark-instances-and-branch-and-cut-algorithm-for-the-hashiwokakero-puzzle-1905.00973</loc><lastmod>2019-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/benchmark-instances-and-branch-and-cut-algorithm-for-the-hashiwokakero-puzzle-1905.00973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/benchmark-instances-and-branch-and-cut-algorithm-for-the-hashiwokakero-puzzle-1905.00973"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-proof-of-a-concentration-bound-for-real-valued-random-variables-1905.01172</loc><lastmod>2020-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-proof-of-a-concentration-bound-for-real-valued-random-variables-1905.01172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-proof-of-a-concentration-bound-for-real-valued-random-variables-1905.01172"/></url>
<url><loc>https://scifaro.com/en/abs/palindromic-ziv-lempel-and-crochemore-factorizations-of-m-bonacci-infinite-words-1905.01340</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/palindromic-ziv-lempel-and-crochemore-factorizations-of-m-bonacci-infinite-words-1905.01340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/palindromic-ziv-lempel-and-crochemore-factorizations-of-m-bonacci-infinite-words-1905.01340"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parallel-reconstruction-from-pooled-data-1905.01458</loc><lastmod>2022-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parallel-reconstruction-from-pooled-data-1905.01458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parallel-reconstruction-from-pooled-data-1905.01458"/></url>
<url><loc>https://scifaro.com/en/abs/scaling-limits-for-random-triangulations-on-the-torus-1905.01873</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scaling-limits-for-random-triangulations-on-the-torus-1905.01873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scaling-limits-for-random-triangulations-on-the-torus-1905.01873"/></url>
<url><loc>https://scifaro.com/en/abs/nonsingular-vertex-weighted-block-graphs-1905.01921</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonsingular-vertex-weighted-block-graphs-1905.01921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonsingular-vertex-weighted-block-graphs-1905.01921"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-sparse-graphs-into-an-independent-set-and-a-graph-with-bounded-size-components-1905.02123</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-sparse-graphs-into-an-independent-set-and-a-graph-with-bounded-size-components-1905.02123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-sparse-graphs-into-an-independent-set-and-a-graph-with-bounded-size-components-1905.02123"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-of-graphs-with-given-number-of-blocks-and-the-maximum-wiener-index-1905.02633</loc><lastmod>2019-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-of-graphs-with-given-number-of-blocks-and-the-maximum-wiener-index-1905.02633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-of-graphs-with-given-number-of-blocks-and-the-maximum-wiener-index-1905.02633"/></url>
<url><loc>https://scifaro.com/en/abs/kendall-tau-sequence-distance-extending-kendall-tau-from-ranks-to-sequences-1905.02752</loc><lastmod>2020-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kendall-tau-sequence-distance-extending-kendall-tau-from-ranks-to-sequences-1905.02752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kendall-tau-sequence-distance-extending-kendall-tau-from-ranks-to-sequences-1905.02752"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-semi-proper-orientations-of-graphs-1905.02867</loc><lastmod>2019-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-semi-proper-orientations-of-graphs-1905.02867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-semi-proper-orientations-of-graphs-1905.02867"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-a-new-form-of-heredity-motivated-by-dynamic-networks-1905.04106</loc><lastmod>2019-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-a-new-form-of-heredity-motivated-by-dynamic-networks-1905.04106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-a-new-form-of-heredity-motivated-by-dynamic-networks-1905.04106"/></url>
<url><loc>https://scifaro.com/en/abs/low-complexity-tilings-of-the-plane-1905.04183</loc><lastmod>2019-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-complexity-tilings-of-the-plane-1905.04183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-complexity-tilings-of-the-plane-1905.04183"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-the-second-and-third-maximum-wiener-index-over-the-2-vertex-connected-graphs-1905.04291</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-the-second-and-third-maximum-wiener-index-over-the-2-vertex-connected-graphs-1905.04291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-the-second-and-third-maximum-wiener-index-over-the-2-vertex-connected-graphs-1905.04291"/></url>
<url><loc>https://scifaro.com/en/abs/triangle-creation-processes-on-cubic-graphs-1905.04490</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangle-creation-processes-on-cubic-graphs-1905.04490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangle-creation-processes-on-cubic-graphs-1905.04490"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-geometric-mean-method-for-incomplete-pairwise-comparisons-1905.04609</loc><lastmod>2020-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-geometric-mean-method-for-incomplete-pairwise-comparisons-1905.04609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-geometric-mean-method-for-incomplete-pairwise-comparisons-1905.04609"/></url>
<url><loc>https://scifaro.com/en/abs/routing-and-scheduling-of-network-flows-with-deadlines-and-discrete-capacity-allocation-1905.04719</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-and-scheduling-of-network-flows-with-deadlines-and-discrete-capacity-allocation-1905.04719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-and-scheduling-of-network-flows-with-deadlines-and-discrete-capacity-allocation-1905.04719"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-threshold-for-power-law-random-2-sat-in-configuration-model-1905.04827</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-threshold-for-power-law-random-2-sat-in-configuration-model-1905.04827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-threshold-for-power-law-random-2-sat-in-configuration-model-1905.04827"/></url>
<url><loc>https://scifaro.com/en/abs/computing-maximum-matchings-in-temporal-graphs-1905.05304</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-maximum-matchings-in-temporal-graphs-1905.05304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-maximum-matchings-in-temporal-graphs-1905.05304"/></url>
<url><loc>https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-s-1-1-5-free-graphs-in-polynomial-time-1905.05582</loc><lastmod>2020-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-s-1-1-5-free-graphs-in-polynomial-time-1905.05582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-s-1-1-5-free-graphs-in-polynomial-time-1905.05582"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-italian-domination-on-planar-and-regular-graphs-1905.06293</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-italian-domination-on-planar-and-regular-graphs-1905.06293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-italian-domination-on-planar-and-regular-graphs-1905.06293"/></url>
<url><loc>https://scifaro.com/en/abs/fake-news-and-rumors-a-trigger-for-proliferation-or-fading-away-1905.06894</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fake-news-and-rumors-a-trigger-for-proliferation-or-fading-away-1905.06894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fake-news-and-rumors-a-trigger-for-proliferation-or-fading-away-1905.06894"/></url>
<url><loc>https://scifaro.com/en/abs/fast-computing-the-algebraic-degree-of-boolean-functions-1905.08649</loc><lastmod>2019-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-computing-the-algebraic-degree-of-boolean-functions-1905.08649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-computing-the-algebraic-degree-of-boolean-functions-1905.08649"/></url>
<url><loc>https://scifaro.com/en/abs/a-hypergraph-based-approach-for-the-4-constraint-satisfaction-problem-tractability-1905.09083</loc><lastmod>2019-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hypergraph-based-approach-for-the-4-constraint-satisfaction-problem-tractability-1905.09083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hypergraph-based-approach-for-the-4-constraint-satisfaction-problem-tractability-1905.09083"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-critical-difference-of-almost-bipartite-graphs-1905.09462</loc><lastmod>2019-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-critical-difference-of-almost-bipartite-graphs-1905.09462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-critical-difference-of-almost-bipartite-graphs-1905.09462"/></url>
<url><loc>https://scifaro.com/en/abs/evacuating-two-robots-from-a-disk-a-second-cut-1905.10592</loc><lastmod>2019-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evacuating-two-robots-from-a-disk-a-second-cut-1905.10592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evacuating-two-robots-from-a-disk-a-second-cut-1905.10592"/></url>
<url><loc>https://scifaro.com/en/abs/taxonomization-of-combinatorial-optimization-problems-in-fourier-space-1905.10852</loc><lastmod>2019-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taxonomization-of-combinatorial-optimization-problems-in-fourier-space-1905.10852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taxonomization-of-combinatorial-optimization-problems-in-fourier-space-1905.10852"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-eulerian-subdigraphs-in-semicomplete-digraphs-1905.11019</loc><lastmod>2019-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-eulerian-subdigraphs-in-semicomplete-digraphs-1905.11019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-eulerian-subdigraphs-in-semicomplete-digraphs-1905.11019"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchy-of-transportation-network-parameters-and-hardness-results-1905.11166</loc><lastmod>2019-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchy-of-transportation-network-parameters-and-hardness-results-1905.11166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchy-of-transportation-network-parameters-and-hardness-results-1905.11166"/></url>
<url><loc>https://scifaro.com/en/abs/oriented-coloring-of-graphs-with-low-maximum-degree-1905.12484</loc><lastmod>2019-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oriented-coloring-of-graphs-with-low-maximum-degree-1905.12484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oriented-coloring-of-graphs-with-low-maximum-degree-1905.12484"/></url>
<url><loc>https://scifaro.com/en/abs/parametrised-algorithms-for-directed-modular-width-1905.13203</loc><lastmod>2019-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametrised-algorithms-for-directed-modular-width-1905.13203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametrised-algorithms-for-directed-modular-width-1905.13203"/></url>
<url><loc>https://scifaro.com/en/abs/cospectral-bipartite-graphs-with-the-same-degree-sequences-but-with-different-number-of-large-cycles-1905.13228</loc><lastmod>2019-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cospectral-bipartite-graphs-with-the-same-degree-sequences-but-with-different-number-of-large-cycles-1905.13228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cospectral-bipartite-graphs-with-the-same-degree-sequences-but-with-different-number-of-large-cycles-1905.13228"/></url>
<url><loc>https://scifaro.com/en/abs/budget-minimization-with-precedence-constraints-1905.13740</loc><lastmod>2019-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/budget-minimization-with-precedence-constraints-1905.13740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/budget-minimization-with-precedence-constraints-1905.13740"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-parameters-and-special-trapezoidal-words-1906.01346</loc><lastmod>2019-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-parameters-and-special-trapezoidal-words-1906.01346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-parameters-and-special-trapezoidal-words-1906.01346"/></url>
<url><loc>https://scifaro.com/en/abs/on-pattern-setups-and-pattern-multistructures-1906.02963</loc><lastmod>2019-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-pattern-setups-and-pattern-multistructures-1906.02963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-pattern-setups-and-pattern-multistructures-1906.02963"/></url>
<url><loc>https://scifaro.com/en/abs/borders-palindrome-prefixes-and-square-prefixes-1906.03689</loc><lastmod>2020-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/borders-palindrome-prefixes-and-square-prefixes-1906.03689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/borders-palindrome-prefixes-and-square-prefixes-1906.03689"/></url>
<url><loc>https://scifaro.com/en/abs/symmetry-properties-of-nested-canalyzing-functions-1906.03752</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetry-properties-of-nested-canalyzing-functions-1906.03752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetry-properties-of-nested-canalyzing-functions-1906.03752"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-algorithm-for-minimum-dominator-colorings-of-orientations-of-paths-1906.04523</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-algorithm-for-minimum-dominator-colorings-of-orientations-of-paths-1906.04523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-algorithm-for-minimum-dominator-colorings-of-orientations-of-paths-1906.04523"/></url>
<url><loc>https://scifaro.com/en/abs/a-mixed-integer-linear-programming-approach-for-soft-graph-clustering-1906.04860</loc><lastmod>2019-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mixed-integer-linear-programming-approach-for-soft-graph-clustering-1906.04860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mixed-integer-linear-programming-approach-for-soft-graph-clustering-1906.04860"/></url>
<url><loc>https://scifaro.com/en/abs/relative-hausdorff-distance-for-network-analysis-1906.04936</loc><lastmod>2019-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-hausdorff-distance-for-network-analysis-1906.04936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-hausdorff-distance-for-network-analysis-1906.04936"/></url>
<url><loc>https://scifaro.com/en/abs/broadcasts-on-paths-and-cycles-1906.05089</loc><lastmod>2020-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/broadcasts-on-paths-and-cycles-1906.05089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/broadcasts-on-paths-and-cycles-1906.05089"/></url>
<url><loc>https://scifaro.com/en/abs/decremental-optimization-of-dominating-sets-under-the-reconfiguration-framework-1906.05163</loc><lastmod>2020-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decremental-optimization-of-dominating-sets-under-the-reconfiguration-framework-1906.05163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decremental-optimization-of-dominating-sets-under-the-reconfiguration-framework-1906.05163"/></url>
<url><loc>https://scifaro.com/en/abs/link-dimension-and-exact-construction-of-a-graph-1906.05916</loc><lastmod>2023-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/link-dimension-and-exact-construction-of-a-graph-1906.05916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/link-dimension-and-exact-construction-of-a-graph-1906.05916"/></url>
<url><loc>https://scifaro.com/en/abs/exact-crossing-number-parameterized-by-vertex-cover-1906.06048</loc><lastmod>2019-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-crossing-number-parameterized-by-vertex-cover-1906.06048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-crossing-number-parameterized-by-vertex-cover-1906.06048"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-i-fundamentals-1906.06069</loc><lastmod>2021-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-i-fundamentals-1906.06069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-i-fundamentals-1906.06069"/></url>
<url><loc>https://scifaro.com/en/abs/onion-de-bruijn-sequences-fixed-window-counting-by-growing-the-alphabet-1906.06157</loc><lastmod>2026-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/onion-de-bruijn-sequences-fixed-window-counting-by-growing-the-alphabet-1906.06157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/onion-de-bruijn-sequences-fixed-window-counting-by-growing-the-alphabet-1906.06157"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-characterization-for-perfect-plane-near-triangulations-1906.06200</loc><lastmod>2020-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-characterization-for-perfect-plane-near-triangulations-1906.06200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-characterization-for-perfect-plane-near-triangulations-1906.06200"/></url>
<url><loc>https://scifaro.com/en/abs/matroidal-approximations-of-independence-systems-1906.06217</loc><lastmod>2020-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matroidal-approximations-of-independence-systems-1906.06217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matroidal-approximations-of-independence-systems-1906.06217"/></url>
<url><loc>https://scifaro.com/en/abs/qspr-analysis-of-some-novel-neighborhood-degree-based-topological-descriptors-1906.06660</loc><lastmod>2019-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qspr-analysis-of-some-novel-neighborhood-degree-based-topological-descriptors-1906.06660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qspr-analysis-of-some-novel-neighborhood-degree-based-topological-descriptors-1906.06660"/></url>
<url><loc>https://scifaro.com/en/abs/a-concise-guide-to-existing-and-emerging-vehicle-routing-problem-variants-1906.06750</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-concise-guide-to-existing-and-emerging-vehicle-routing-problem-variants-1906.06750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-concise-guide-to-existing-and-emerging-vehicle-routing-problem-variants-1906.06750"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-calculus-with-cubic-cells-on-discrete-manifolds-1906.07054</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-calculus-with-cubic-cells-on-discrete-manifolds-1906.07054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-calculus-with-cubic-cells-on-discrete-manifolds-1906.07054"/></url>
<url><loc>https://scifaro.com/en/abs/arc-disjoint-in-and-out-branchings-rooted-at-the-same-vertex-in-compositions-of-digraphs-1906.08052</loc><lastmod>2019-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arc-disjoint-in-and-out-branchings-rooted-at-the-same-vertex-in-compositions-of-digraphs-1906.08052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arc-disjoint-in-and-out-branchings-rooted-at-the-same-vertex-in-compositions-of-digraphs-1906.08052"/></url>
<url><loc>https://scifaro.com/en/abs/mutually-orthogonal-latin-squares-based-on-cellular-automata-1906.08249</loc><lastmod>2019-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutually-orthogonal-latin-squares-based-on-cellular-automata-1906.08249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutually-orthogonal-latin-squares-based-on-cellular-automata-1906.08249"/></url>
<url><loc>https://scifaro.com/en/abs/prefix-palindromic-length-of-the-thue-morse-word-1906.09392</loc><lastmod>2020-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prefix-palindromic-length-of-the-thue-morse-word-1906.09392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prefix-palindromic-length-of-the-thue-morse-word-1906.09392"/></url>
<url><loc>https://scifaro.com/en/abs/non-hamilton-cycle-sets-of-having-solutions-and-their-properties-1906.09678</loc><lastmod>2020-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-hamilton-cycle-sets-of-having-solutions-and-their-properties-1906.09678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-hamilton-cycle-sets-of-having-solutions-and-their-properties-1906.09678"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-growth-rate-of-square-grids-dominating-sets-a-symbolic-dynamics-approach-1906.10779</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-growth-rate-of-square-grids-dominating-sets-a-symbolic-dynamics-approach-1906.10779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-growth-rate-of-square-grids-dominating-sets-a-symbolic-dynamics-approach-1906.10779"/></url>
<url><loc>https://scifaro.com/en/abs/the-induced-subgraph-k-2-3-in-a-non-hamiltonian-graphs-1906.10847</loc><lastmod>2020-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-induced-subgraph-k-2-3-in-a-non-hamiltonian-graphs-1906.10847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-induced-subgraph-k-2-3-in-a-non-hamiltonian-graphs-1906.10847"/></url>
<url><loc>https://scifaro.com/en/abs/theta-triangle-free-and-even-hole-k-4-free-graphs-part-1-layered-wheels-1906.10998</loc><lastmod>2023-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theta-triangle-free-and-even-hole-k-4-free-graphs-part-1-layered-wheels-1906.10998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theta-triangle-free-and-even-hole-k-4-free-graphs-part-1-layered-wheels-1906.10998"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-helly-b-1-epg-graph-recognition-1906.11185</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-helly-b-1-epg-graph-recognition-1906.11185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-helly-b-1-epg-graph-recognition-1906.11185"/></url>
<url><loc>https://scifaro.com/en/abs/improved-upper-bounds-on-the-growth-constants-of-polyominoes-and-polycubes-1906.11447</loc><lastmod>2019-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-upper-bounds-on-the-growth-constants-of-polyominoes-and-polycubes-1906.11447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-upper-bounds-on-the-growth-constants-of-polyominoes-and-polycubes-1906.11447"/></url>
<url><loc>https://scifaro.com/en/abs/1-2-domination-in-generalized-petersen-graphs-1906.11966</loc><lastmod>2019-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-2-domination-in-generalized-petersen-graphs-1906.11966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-2-domination-in-generalized-petersen-graphs-1906.11966"/></url>
<url><loc>https://scifaro.com/en/abs/on-nested-and-2-nested-graphs-two-subclasses-of-graphs-between-threshold-and-split-graphs-1906.11970</loc><lastmod>2020-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-nested-and-2-nested-graphs-two-subclasses-of-graphs-between-threshold-and-split-graphs-1906.11970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-nested-and-2-nested-graphs-two-subclasses-of-graphs-between-threshold-and-split-graphs-1906.11970"/></url>
<url><loc>https://scifaro.com/en/abs/blocking-dominating-sets-for-h-free-graphs-via-edge-contractions-1906.12297</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blocking-dominating-sets-for-h-free-graphs-via-edge-contractions-1906.12297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blocking-dominating-sets-for-h-free-graphs-via-edge-contractions-1906.12297"/></url>
<url><loc>https://scifaro.com/en/abs/extending-de-bruijn-sequences-to-larger-alphabets-1907.00056</loc><lastmod>2020-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-de-bruijn-sequences-to-larger-alphabets-1907.00056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-de-bruijn-sequences-to-larger-alphabets-1907.00056"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-acyclic-colorings-of-graphs-and-digraphs-with-degree-and-girth-constraints-1907.00061</loc><lastmod>2020-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-acyclic-colorings-of-graphs-and-digraphs-with-degree-and-girth-constraints-1907.00061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-acyclic-colorings-of-graphs-and-digraphs-with-degree-and-girth-constraints-1907.00061"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-graphs-of-non-crossing-paths-1907.00272</loc><lastmod>2020-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-graphs-of-non-crossing-paths-1907.00272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-graphs-of-non-crossing-paths-1907.00272"/></url>
<url><loc>https://scifaro.com/en/abs/proper-walk-connection-number-of-graphs-1907.00428</loc><lastmod>2020-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proper-walk-connection-number-of-graphs-1907.00428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proper-walk-connection-number-of-graphs-1907.00428"/></url>
<url><loc>https://scifaro.com/en/abs/binary-expression-of-ancestors-in-the-collatz-graph-1907.00775</loc><lastmod>2020-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-expression-of-ancestors-in-the-collatz-graph-1907.00775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-expression-of-ancestors-in-the-collatz-graph-1907.00775"/></url>
<url><loc>https://scifaro.com/en/abs/on-characterizations-for-subclasses-of-directed-co-graphs-1907.00801</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-characterizations-for-subclasses-of-directed-co-graphs-1907.00801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-characterizations-for-subclasses-of-directed-co-graphs-1907.00801"/></url>
<url><loc>https://scifaro.com/en/abs/fast-uniform-dispersion-of-a-crash-prone-swarm-1907.00956</loc><lastmod>2020-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-uniform-dispersion-of-a-crash-prone-swarm-1907.00956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-uniform-dispersion-of-a-crash-prone-swarm-1907.00956"/></url>
<url><loc>https://scifaro.com/en/abs/estimating-gaps-in-martingales-and-applications-to-coin-tossing-constructions-and-hardness-1907.01694</loc><lastmod>2019-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimating-gaps-in-martingales-and-applications-to-coin-tossing-constructions-and-hardness-1907.01694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimating-gaps-in-martingales-and-applications-to-coin-tossing-constructions-and-hardness-1907.01694"/></url>
<url><loc>https://scifaro.com/en/abs/linear-transformations-between-colorings-in-chordal-graphs-1907.01863</loc><lastmod>2019-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-transformations-between-colorings-in-chordal-graphs-1907.01863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-transformations-between-colorings-in-chordal-graphs-1907.01863"/></url>
<url><loc>https://scifaro.com/en/abs/stabilization-time-in-minority-processes-1907.02131</loc><lastmod>2019-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabilization-time-in-minority-processes-1907.02131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabilization-time-in-minority-processes-1907.02131"/></url>
<url><loc>https://scifaro.com/en/abs/packing-directed-cycles-quarter-and-half-integrally-1907.02494</loc><lastmod>2023-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-directed-cycles-quarter-and-half-integrally-1907.02494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-directed-cycles-quarter-and-half-integrally-1907.02494"/></url>
<url><loc>https://scifaro.com/en/abs/about-fibonacci-trees-ii-generalized-fibonacci-trees-1907.04677</loc><lastmod>2019-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-fibonacci-trees-ii-generalized-fibonacci-trees-1907.04677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-fibonacci-trees-ii-generalized-fibonacci-trees-1907.04677"/></url>
<url><loc>https://scifaro.com/en/abs/ollivier-ricci-curvature-of-directed-hypergraphs-1907.04727</loc><lastmod>2019-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ollivier-ricci-curvature-of-directed-hypergraphs-1907.04727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ollivier-ricci-curvature-of-directed-hypergraphs-1907.04727"/></url>
<url><loc>https://scifaro.com/en/abs/the-almost-disjoint-2-path-decomposition-problem-1907.04906</loc><lastmod>2019-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-almost-disjoint-2-path-decomposition-problem-1907.04906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-almost-disjoint-2-path-decomposition-problem-1907.04906"/></url>
<url><loc>https://scifaro.com/en/abs/integer-laplacian-eigenvalues-of-chordal-graphs-1907.04979</loc><lastmod>2019-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-laplacian-eigenvalues-of-chordal-graphs-1907.04979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-laplacian-eigenvalues-of-chordal-graphs-1907.04979"/></url>
<url><loc>https://scifaro.com/en/abs/eccentricity-function-in-distance-hereditary-graphs-1907.05445</loc><lastmod>2020-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eccentricity-function-in-distance-hereditary-graphs-1907.05445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eccentricity-function-in-distance-hereditary-graphs-1907.05445"/></url>
<url><loc>https://scifaro.com/en/abs/navigating-an-infinite-space-with-unreliable-movements-1907.05935</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/navigating-an-infinite-space-with-unreliable-movements-1907.05935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/navigating-an-infinite-space-with-unreliable-movements-1907.05935"/></url>
<url><loc>https://scifaro.com/en/abs/resolvability-of-hamming-graphs-1907.05974</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolvability-of-hamming-graphs-1907.05974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolvability-of-hamming-graphs-1907.05974"/></url>
<url><loc>https://scifaro.com/en/abs/containment-graphs-posets-and-related-classes-of-graphs-1907.07414</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/containment-graphs-posets-and-related-classes-of-graphs-1907.07414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/containment-graphs-posets-and-related-classes-of-graphs-1907.07414"/></url>
<url><loc>https://scifaro.com/en/abs/online-firefighting-on-grids-1907.07450</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-firefighting-on-grids-1907.07450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-firefighting-on-grids-1907.07450"/></url>
<url><loc>https://scifaro.com/en/abs/a-simpler-approach-to-linear-programming-1907.07811</loc><lastmod>2019-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simpler-approach-to-linear-programming-1907.07811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simpler-approach-to-linear-programming-1907.07811"/></url>
<url><loc>https://scifaro.com/en/abs/linear-semiorders-and-their-incomparability-graphs-1907.07845</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-semiorders-and-their-incomparability-graphs-1907.07845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-semiorders-and-their-incomparability-graphs-1907.07845"/></url>
<url><loc>https://scifaro.com/en/abs/the-simultaneous-conjugacy-problem-in-the-symmetric-group-1907.07889</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simultaneous-conjugacy-problem-in-the-symmetric-group-1907.07889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simultaneous-conjugacy-problem-in-the-symmetric-group-1907.07889"/></url>
<url><loc>https://scifaro.com/en/abs/makespan-minimization-with-or-precedence-constraints-1907.08111</loc><lastmod>2020-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/makespan-minimization-with-or-precedence-constraints-1907.08111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/makespan-minimization-with-or-precedence-constraints-1907.08111"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-fixed-parameter-algorithm-for-constructing-tree-child-networks-from-multiple-binary-trees-1907.08474</loc><lastmod>2019-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-fixed-parameter-algorithm-for-constructing-tree-child-networks-from-multiple-binary-trees-1907.08474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-fixed-parameter-algorithm-for-constructing-tree-child-networks-from-multiple-binary-trees-1907.08474"/></url>
<url><loc>https://scifaro.com/en/abs/logical-classification-of-partially-ordered-data-1907.08962</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-classification-of-partially-ordered-data-1907.08962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-classification-of-partially-ordered-data-1907.08962"/></url>
<url><loc>https://scifaro.com/en/abs/performance-complexity-tradeoffs-in-greedy-weak-submodular-maximization-with-random-sampling-1907.09064</loc><lastmod>2021-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/performance-complexity-tradeoffs-in-greedy-weak-submodular-maximization-with-random-sampling-1907.09064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/performance-complexity-tradeoffs-in-greedy-weak-submodular-maximization-with-random-sampling-1907.09064"/></url>
<url><loc>https://scifaro.com/en/abs/robust-approach-to-restricted-items-selection-problem-1907.09242</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-approach-to-restricted-items-selection-problem-1907.09242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-approach-to-restricted-items-selection-problem-1907.09242"/></url>
<url><loc>https://scifaro.com/en/abs/translating-between-the-representations-of-a-ranked-convex-geometry-1907.09433</loc><lastmod>2021-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-between-the-representations-of-a-ranked-convex-geometry-1907.09433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-between-the-representations-of-a-ranked-convex-geometry-1907.09433"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-linear-codes-using-canonical-augmentation-1907.10363</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-linear-codes-using-canonical-augmentation-1907.10363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-linear-codes-using-canonical-augmentation-1907.10363"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-path-tsp-to-tsp-1907.10376</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-path-tsp-to-tsp-1907.10376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-path-tsp-to-tsp-1907.10376"/></url>
<url><loc>https://scifaro.com/en/abs/medians-in-median-graphs-and-their-cube-complexes-in-linear-time-1907.10398</loc><lastmod>2022-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/medians-in-median-graphs-and-their-cube-complexes-in-linear-time-1907.10398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/medians-in-median-graphs-and-their-cube-complexes-in-linear-time-1907.10398"/></url>
<url><loc>https://scifaro.com/en/abs/the-stable-marriage-problem-with-ties-and-restricted-edges-1907.10458</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stable-marriage-problem-with-ties-and-restricted-edges-1907.10458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stable-marriage-problem-with-ties-and-restricted-edges-1907.10458"/></url>
<url><loc>https://scifaro.com/en/abs/high-dimensional-expanders-from-expanders-1907.10771</loc><lastmod>2019-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-dimensional-expanders-from-expanders-1907.10771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-dimensional-expanders-from-expanders-1907.10771"/></url>
<url><loc>https://scifaro.com/en/abs/subtour-elimination-constraints-imply-a-matrix-tree-theorem-sdp-constraint-for-the-tsp-1907.11669</loc><lastmod>2019-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subtour-elimination-constraints-imply-a-matrix-tree-theorem-sdp-constraint-for-the-tsp-1907.11669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subtour-elimination-constraints-imply-a-matrix-tree-theorem-sdp-constraint-for-the-tsp-1907.11669"/></url>
<url><loc>https://scifaro.com/en/abs/a-connected-version-of-the-graph-coloring-game-1907.12276</loc><lastmod>2020-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-connected-version-of-the-graph-coloring-game-1907.12276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-connected-version-of-the-graph-coloring-game-1907.12276"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-record-of-graph-enumeration-enabled-by-parallel-processing-1907.12455</loc><lastmod>2019-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-record-of-graph-enumeration-enabled-by-parallel-processing-1907.12455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-record-of-graph-enumeration-enabled-by-parallel-processing-1907.12455"/></url>
<url><loc>https://scifaro.com/en/abs/b-continuity-and-partial-grundy-coloring-of-graphs-with-large-girth-1908.00674</loc><lastmod>2019-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/b-continuity-and-partial-grundy-coloring-of-graphs-with-large-girth-1908.00674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/b-continuity-and-partial-grundy-coloring-of-graphs-with-large-girth-1908.00674"/></url>
<url><loc>https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-p-9-free-graphs-in-polynomial-time-1908.00978</loc><lastmod>2020-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-p-9-free-graphs-in-polynomial-time-1908.00978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-dominating-induced-matchings-in-p-9-free-graphs-in-polynomial-time-1908.00978"/></url>
<url><loc>https://scifaro.com/en/abs/a-constraint-model-for-the-tree-decomposition-of-a-graph-1908.02530</loc><lastmod>2019-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constraint-model-for-the-tree-decomposition-of-a-graph-1908.02530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constraint-model-for-the-tree-decomposition-of-a-graph-1908.02530"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-colourings-of-connected-oriented-cubic-graphs-1908.02883</loc><lastmod>2020-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-colourings-of-connected-oriented-cubic-graphs-1908.02883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-colourings-of-connected-oriented-cubic-graphs-1908.02883"/></url>
<url><loc>https://scifaro.com/en/abs/avoidable-paths-in-graphs-1908.03788</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoidable-paths-in-graphs-1908.03788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoidable-paths-in-graphs-1908.03788"/></url>
<url><loc>https://scifaro.com/en/abs/nonleaf-patterns-in-trees-protected-nodes-and-fine-numbers-1908.04329</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonleaf-patterns-in-trees-protected-nodes-and-fine-numbers-1908.04329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonleaf-patterns-in-trees-protected-nodes-and-fine-numbers-1908.04329"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-the-weisfeiler-leman-algorithm-to-decompose-graphs-1908.05268</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-the-weisfeiler-leman-algorithm-to-decompose-graphs-1908.05268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-the-weisfeiler-leman-algorithm-to-decompose-graphs-1908.05268"/></url>
<url><loc>https://scifaro.com/en/abs/tracking-paths-in-planar-graphs-1908.05445</loc><lastmod>2019-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracking-paths-in-planar-graphs-1908.05445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracking-paths-in-planar-graphs-1908.05445"/></url>
<url><loc>https://scifaro.com/en/abs/the-stable-set-problem-in-graphs-with-bounded-genus-and-bounded-odd-cycle-packing-number-1908.06300</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stable-set-problem-in-graphs-with-bounded-genus-and-bounded-odd-cycle-packing-number-1908.06300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stable-set-problem-in-graphs-with-bounded-genus-and-bounded-odd-cycle-packing-number-1908.06300"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-edge-biclique-graph-and-the-iterated-edge-biclique-operator-1908.06656</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-edge-biclique-graph-and-the-iterated-edge-biclique-operator-1908.06656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-edge-biclique-graph-and-the-iterated-edge-biclique-operator-1908.06656"/></url>
<url><loc>https://scifaro.com/en/abs/freezing-bounded-change-and-convergent-cellular-automata-1908.06751</loc><lastmod>2022-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/freezing-bounded-change-and-convergent-cellular-automata-1908.06751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/freezing-bounded-change-and-convergent-cellular-automata-1908.06751"/></url>
<url><loc>https://scifaro.com/en/abs/an-omega-n-2-lower-bound-for-random-universal-sets-for-planar-graphs-1908.07097</loc><lastmod>2019-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-omega-n-2-lower-bound-for-random-universal-sets-for-planar-graphs-1908.07097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-omega-n-2-lower-bound-for-random-universal-sets-for-planar-graphs-1908.07097"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-edge-vertex-ratio-of-maximal-thrackles-1908.08857</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-edge-vertex-ratio-of-maximal-thrackles-1908.08857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-edge-vertex-ratio-of-maximal-thrackles-1908.08857"/></url>
<url><loc>https://scifaro.com/en/abs/local-graph-stability-in-exponential-family-random-graph-models-1908.09470</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-graph-stability-in-exponential-family-random-graph-models-1908.09470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-graph-stability-in-exponential-family-random-graph-models-1908.09470"/></url>
<url><loc>https://scifaro.com/en/abs/frustrated-random-walks-a-faster-algorithm-to-evaluate-node-distances-on-connected-and-undirected-graphs-1908.09644</loc><lastmod>2020-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frustrated-random-walks-a-faster-algorithm-to-evaluate-node-distances-on-connected-and-undirected-graphs-1908.09644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frustrated-random-walks-a-faster-algorithm-to-evaluate-node-distances-on-connected-and-undirected-graphs-1908.09644"/></url>
<url><loc>https://scifaro.com/en/abs/interval-permutation-segment-graphs-1908.10491</loc><lastmod>2019-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-permutation-segment-graphs-1908.10491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-permutation-segment-graphs-1908.10491"/></url>
<url><loc>https://scifaro.com/en/abs/carving-width-and-contraction-trees-for-tensor-networks-1908.11034</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/carving-width-and-contraction-trees-for-tensor-networks-1908.11034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/carving-width-and-contraction-trees-for-tensor-networks-1908.11034"/></url>
<url><loc>https://scifaro.com/en/abs/practical-implementation-of-a-quantum-backtracking-algorithm-1908.11291</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-implementation-of-a-quantum-backtracking-algorithm-1908.11291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-implementation-of-a-quantum-backtracking-algorithm-1908.11291"/></url>
<url><loc>https://scifaro.com/en/abs/homothetic-triangle-representations-of-planar-graphs-1908.11749</loc><lastmod>2019-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homothetic-triangle-representations-of-planar-graphs-1908.11749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homothetic-triangle-representations-of-planar-graphs-1908.11749"/></url>
<url><loc>https://scifaro.com/en/abs/signified-chromatic-number-of-grids-is-at-most-9-1909.00371</loc><lastmod>2021-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signified-chromatic-number-of-grids-is-at-most-9-1909.00371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signified-chromatic-number-of-grids-is-at-most-9-1909.00371"/></url>
<url><loc>https://scifaro.com/en/abs/about-fibonacci-trees-iii-multiple-fibonacci-trees-1909.01893</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-fibonacci-trees-iii-multiple-fibonacci-trees-1909.01893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-fibonacci-trees-iii-multiple-fibonacci-trees-1909.01893"/></url>
<url><loc>https://scifaro.com/en/abs/on-orthogonal-vector-edge-coloring-1909.01918</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-orthogonal-vector-edge-coloring-1909.01918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-orthogonal-vector-edge-coloring-1909.01918"/></url>
<url><loc>https://scifaro.com/en/abs/an-effective-upperbound-on-treewidth-using-partial-fill-in-of-separators-1909.02789</loc><lastmod>2019-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-effective-upperbound-on-treewidth-using-partial-fill-in-of-separators-1909.02789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-effective-upperbound-on-treewidth-using-partial-fill-in-of-separators-1909.02789"/></url>
<url><loc>https://scifaro.com/en/abs/graph-spanners-a-tutorial-review-1909.03152</loc><lastmod>2020-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-spanners-a-tutorial-review-1909.03152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-spanners-a-tutorial-review-1909.03152"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-matchings-rank-of-connection-tensors-and-graph-homomorphisms-1909.03179</loc><lastmod>2020-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-matchings-rank-of-connection-tensors-and-graph-homomorphisms-1909.03179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-matchings-rank-of-connection-tensors-and-graph-homomorphisms-1909.03179"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-counting-feedback-arc-sets-1909.03339</loc><lastmod>2022-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-counting-feedback-arc-sets-1909.03339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-counting-feedback-arc-sets-1909.03339"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-status-matching-and-domination-of-graphs-1909.03381</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-status-matching-and-domination-of-graphs-1909.03381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-status-matching-and-domination-of-graphs-1909.03381"/></url>
<url><loc>https://scifaro.com/en/abs/counting-weighted-independent-sets-beyond-the-permanent-1909.03414</loc><lastmod>2021-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-weighted-independent-sets-beyond-the-permanent-1909.03414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-weighted-independent-sets-beyond-the-permanent-1909.03414"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-theorem-of-lov-asz-that-hom-cdot-h-determines-the-isomorphism-type-of-h-1909.03693</loc><lastmod>2021-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-theorem-of-lov-asz-that-hom-cdot-h-determines-the-isomorphism-type-of-h-1909.03693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-theorem-of-lov-asz-that-hom-cdot-h-determines-the-isomorphism-type-of-h-1909.03693"/></url>
<url><loc>https://scifaro.com/en/abs/on-domination-coloring-in-graphs-1909.03715</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-domination-coloring-in-graphs-1909.03715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-domination-coloring-in-graphs-1909.03715"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-connected-subgraph-problem-in-geometric-intersection-graphs-1909.03872</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-connected-subgraph-problem-in-geometric-intersection-graphs-1909.03872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-connected-subgraph-problem-in-geometric-intersection-graphs-1909.03872"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-bipartite-subgraph-of-geometric-intersection-graphs-1909.03896</loc><lastmod>2020-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-bipartite-subgraph-of-geometric-intersection-graphs-1909.03896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-bipartite-subgraph-of-geometric-intersection-graphs-1909.03896"/></url>
<url><loc>https://scifaro.com/en/abs/effects-of-some-operations-on-domination-chromatic-number-in-graphs-1909.05510</loc><lastmod>2019-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effects-of-some-operations-on-domination-chromatic-number-in-graphs-1909.05510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effects-of-some-operations-on-domination-chromatic-number-in-graphs-1909.05510"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-circular-arc-contact-b-0-vpg-graphs-1909.06231</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-circular-arc-contact-b-0-vpg-graphs-1909.06231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-circular-arc-contact-b-0-vpg-graphs-1909.06231"/></url>
<url><loc>https://scifaro.com/en/abs/the-computational-complexity-of-finding-temporal-paths-under-waiting-time-constraints-1909.06437</loc><lastmod>2021-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-computational-complexity-of-finding-temporal-paths-under-waiting-time-constraints-1909.06437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-computational-complexity-of-finding-temporal-paths-under-waiting-time-constraints-1909.06437"/></url>
<url><loc>https://scifaro.com/en/abs/nowhere-dense-graph-classes-and-algorithmic-applications-a-tutorial-at-highlights-of-logic-games-and-automata-2019-1909.06752</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nowhere-dense-graph-classes-and-algorithmic-applications-a-tutorial-at-highlights-of-logic-games-and-automata-2019-1909.06752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nowhere-dense-graph-classes-and-algorithmic-applications-a-tutorial-at-highlights-of-logic-games-and-automata-2019-1909.06752"/></url>
<url><loc>https://scifaro.com/en/abs/improved-strong-spatial-mixing-for-colorings-on-trees-1909.07059</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-strong-spatial-mixing-for-colorings-on-trees-1909.07059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-strong-spatial-mixing-for-colorings-on-trees-1909.07059"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-binary-tree-problem-1909.07915</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-binary-tree-problem-1909.07915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-binary-tree-problem-1909.07915"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-and-approximation-for-the-geodetic-set-problem-in-some-graph-classes-1909.08795</loc><lastmod>2020-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-and-approximation-for-the-geodetic-set-problem-in-some-graph-classes-1909.08795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-and-approximation-for-the-geodetic-set-problem-in-some-graph-classes-1909.08795"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bound-for-sum-coloring-problem-1909.08906</loc><lastmod>2019-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bound-for-sum-coloring-problem-1909.08906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bound-for-sum-coloring-problem-1909.08906"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-neighbour-distinguishing-index-of-digraphs-1909.10240</loc><lastmod>2019-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-neighbour-distinguishing-index-of-digraphs-1909.10240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-neighbour-distinguishing-index-of-digraphs-1909.10240"/></url>
<url><loc>https://scifaro.com/en/abs/decreasing-the-maximum-average-degree-by-deleting-an-independent-set-or-a-d-degenerate-subgraph-1909.10701</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decreasing-the-maximum-average-degree-by-deleting-an-independent-set-or-a-d-degenerate-subgraph-1909.10701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decreasing-the-maximum-average-degree-by-deleting-an-independent-set-or-a-d-degenerate-subgraph-1909.10701"/></url>
<url><loc>https://scifaro.com/en/abs/random-k-out-subgraph-leaves-only-o-n-k-inter-component-edges-1909.11147</loc><lastmod>2019-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-k-out-subgraph-leaves-only-o-n-k-inter-component-edges-1909.11147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-k-out-subgraph-leaves-only-o-n-k-inter-component-edges-1909.11147"/></url>
<url><loc>https://scifaro.com/en/abs/the-approximation-ratio-of-the-2-opt-heuristic-for-the-metric-traveling-salesman-problem-1909.12025</loc><lastmod>2020-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-approximation-ratio-of-the-2-opt-heuristic-for-the-metric-traveling-salesman-problem-1909.12025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-approximation-ratio-of-the-2-opt-heuristic-for-the-metric-traveling-salesman-problem-1909.12025"/></url>
<url><loc>https://scifaro.com/en/abs/how-hard-is-it-to-predict-sandpiles-on-lattices-a-survey-1909.12150</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-hard-is-it-to-predict-sandpiles-on-lattices-a-survey-1909.12150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-hard-is-it-to-predict-sandpiles-on-lattices-a-survey-1909.12150"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-approximation-ratio-of-the-k-opt-and-lin-kernighan-algorithm-1909.12755</loc><lastmod>2024-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-approximation-ratio-of-the-k-opt-and-lin-kernighan-algorithm-1909.12755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-approximation-ratio-of-the-k-opt-and-lin-kernighan-algorithm-1909.12755"/></url>
<url><loc>https://scifaro.com/en/abs/r-wise-fractional-l-intersecting-family-1909.13217</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/r-wise-fractional-l-intersecting-family-1909.13217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/r-wise-fractional-l-intersecting-family-1909.13217"/></url>
<url><loc>https://scifaro.com/en/abs/the-minimization-of-random-hypergraphs-1910.00308</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-minimization-of-random-hypergraphs-1910.00308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-minimization-of-random-hypergraphs-1910.00308"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-of-bounded-cliquewidth-are-polynomially-chi-bounded-1910.00697</loc><lastmod>2020-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-of-bounded-cliquewidth-are-polynomially-chi-bounded-1910.00697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-of-bounded-cliquewidth-are-polynomially-chi-bounded-1910.00697"/></url>
<url><loc>https://scifaro.com/en/abs/a-unique-extension-of-rich-words-1910.00826</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unique-extension-of-rich-words-1910.00826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unique-extension-of-rich-words-1910.00826"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-free-coloring-on-open-neighborhoods-1910.00863</loc><lastmod>2019-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-free-coloring-on-open-neighborhoods-1910.00863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-free-coloring-on-open-neighborhoods-1910.00863"/></url>
<url><loc>https://scifaro.com/en/abs/rectangle-blanket-problem-binary-integer-linear-programming-formulation-and-solution-algorithms-1910.01193</loc><lastmod>2019-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangle-blanket-problem-binary-integer-linear-programming-formulation-and-solution-algorithms-1910.01193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangle-blanket-problem-binary-integer-linear-programming-formulation-and-solution-algorithms-1910.01193"/></url>
<url><loc>https://scifaro.com/en/abs/diamond-subgraphs-in-the-reduction-graph-of-a-one-rule-string-rewriting-system-1910.02644</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diamond-subgraphs-in-the-reduction-graph-of-a-one-rule-string-rewriting-system-1910.02644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diamond-subgraphs-in-the-reduction-graph-of-a-one-rule-string-rewriting-system-1910.02644"/></url>
<url><loc>https://scifaro.com/en/abs/improved-lower-bounds-on-parity-vertex-colourings-of-binary-trees-1910.03341</loc><lastmod>2019-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-lower-bounds-on-parity-vertex-colourings-of-binary-trees-1910.03341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-lower-bounds-on-parity-vertex-colourings-of-binary-trees-1910.03341"/></url>
<url><loc>https://scifaro.com/en/abs/on-vertex-edge-and-independent-vertex-edge-domination-1910.03635</loc><lastmod>2019-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-vertex-edge-and-independent-vertex-edge-domination-1910.03635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-vertex-edge-and-independent-vertex-edge-domination-1910.03635"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-whether-a-lattice-has-an-orthonormal-basis-is-in-co-np-1910.03838</loc><lastmod>2019-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-whether-a-lattice-has-an-orthonormal-basis-is-in-co-np-1910.03838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-whether-a-lattice-has-an-orthonormal-basis-is-in-co-np-1910.03838"/></url>
<url><loc>https://scifaro.com/en/abs/edge-crossings-in-random-linear-arrangements-1910.03926</loc><lastmod>2020-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-crossings-in-random-linear-arrangements-1910.03926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-crossings-in-random-linear-arrangements-1910.03926"/></url>
<url><loc>https://scifaro.com/en/abs/metric-dimension-1910.04103</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-dimension-1910.04103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-dimension-1910.04103"/></url>
<url><loc>https://scifaro.com/en/abs/mobile-sensor-networks-bounds-on-capacity-and-complexity-of-realizability-1910.04162</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mobile-sensor-networks-bounds-on-capacity-and-complexity-of-realizability-1910.04162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mobile-sensor-networks-bounds-on-capacity-and-complexity-of-realizability-1910.04162"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-lower-bound-for-eternal-vertex-cover-number-1910.05042</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-lower-bound-for-eternal-vertex-cover-number-1910.05042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-lower-bound-for-eternal-vertex-cover-number-1910.05042"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-binary-steinhaus-triangles-and-parity-regular-steinhaus-graphs-1910.05936</loc><lastmod>2022-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-binary-steinhaus-triangles-and-parity-regular-steinhaus-graphs-1910.05936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-binary-steinhaus-triangles-and-parity-regular-steinhaus-graphs-1910.05936"/></url>
<url><loc>https://scifaro.com/en/abs/negative-closed-walks-in-signed-graphs-a-note-1910.06032</loc><lastmod>2019-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negative-closed-walks-in-signed-graphs-a-note-1910.06032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negative-closed-walks-in-signed-graphs-a-note-1910.06032"/></url>
<url><loc>https://scifaro.com/en/abs/algorithm-and-hardness-results-on-neighborhood-total-domination-in-graphs-1910.06423</loc><lastmod>2021-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithm-and-hardness-results-on-neighborhood-total-domination-in-graphs-1910.06423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithm-and-hardness-results-on-neighborhood-total-domination-in-graphs-1910.06423"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-acyclic-modules-in-automata-networks-1910.07299</loc><lastmod>2020-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-acyclic-modules-in-automata-networks-1910.07299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-acyclic-modules-in-automata-networks-1910.07299"/></url>
<url><loc>https://scifaro.com/en/abs/quasiperiodic-bobbin-lace-patterns-1910.07935</loc><lastmod>2019-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasiperiodic-bobbin-lace-patterns-1910.07935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasiperiodic-bobbin-lace-patterns-1910.07935"/></url>
<url><loc>https://scifaro.com/en/abs/smoothing-graph-signals-via-random-spanning-forests-1910.07963</loc><lastmod>2020-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smoothing-graph-signals-via-random-spanning-forests-1910.07963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smoothing-graph-signals-via-random-spanning-forests-1910.07963"/></url>
<url><loc>https://scifaro.com/en/abs/strengthening-some-complexity-results-on-toughness-of-graphs-1910.08752</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strengthening-some-complexity-results-on-toughness-of-graphs-1910.08752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strengthening-some-complexity-results-on-toughness-of-graphs-1910.08752"/></url>
<url><loc>https://scifaro.com/en/abs/order-distances-and-split-systems-1910.10119</loc><lastmod>2019-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-distances-and-split-systems-1910.10119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-distances-and-split-systems-1910.10119"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-colouring-antiprismatic-graphs-1910.11001</loc><lastmod>2023-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-colouring-antiprismatic-graphs-1910.11001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-colouring-antiprismatic-graphs-1910.11001"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-colourings-of-connected-2-edge-coloured-cubic-graphs-1910.11394</loc><lastmod>2019-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-colourings-of-connected-2-edge-coloured-cubic-graphs-1910.11394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-colourings-of-connected-2-edge-coloured-cubic-graphs-1910.11394"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximation-for-maximum-edge-colouring-problem-1910.11753</loc><lastmod>2019-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximation-for-maximum-edge-colouring-problem-1910.11753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximation-for-maximum-edge-colouring-problem-1910.11753"/></url>
<url><loc>https://scifaro.com/en/abs/neighbor-connectivity-of-k-ary-n-cubes-1910.12364</loc><lastmod>2019-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighbor-connectivity-of-k-ary-n-cubes-1910.12364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighbor-connectivity-of-k-ary-n-cubes-1910.12364"/></url>
<url><loc>https://scifaro.com/en/abs/distinguishing-numbers-and-distinguishing-indices-of-oriented-graphs-1910.12738</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distinguishing-numbers-and-distinguishing-indices-of-oriented-graphs-1910.12738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distinguishing-numbers-and-distinguishing-indices-of-oriented-graphs-1910.12738"/></url>
<url><loc>https://scifaro.com/en/abs/estimating-the-density-of-states-of-boolean-satisfiability-problems-on-classical-and-quantum-computing-platforms-1910.13088</loc><lastmod>2019-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimating-the-density-of-states-of-boolean-satisfiability-problems-on-classical-and-quantum-computing-platforms-1910.13088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimating-the-density-of-states-of-boolean-satisfiability-problems-on-classical-and-quantum-computing-platforms-1910.13088"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-time-consistent-species-trees-1910.13123</loc><lastmod>2019-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-time-consistent-species-trees-1910.13123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-time-consistent-species-trees-1910.13123"/></url>
<url><loc>https://scifaro.com/en/abs/a-structured-table-of-graphs-with-symmetries-and-other-special-properties-1910.13539</loc><lastmod>2019-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-structured-table-of-graphs-with-symmetries-and-other-special-properties-1910.13539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-structured-table-of-graphs-with-symmetries-and-other-special-properties-1910.13539"/></url>
<url><loc>https://scifaro.com/en/abs/all-4-variable-functions-can-be-perfectly-quadratized-with-only-1-auxiliary-variable-1910.13583</loc><lastmod>2019-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-4-variable-functions-can-be-perfectly-quadratized-with-only-1-auxiliary-variable-1910.13583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-4-variable-functions-can-be-perfectly-quadratized-with-only-1-auxiliary-variable-1910.13583"/></url>
<url><loc>https://scifaro.com/en/abs/balancing-gaussian-vectors-in-high-dimension-1910.13972</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balancing-gaussian-vectors-in-high-dimension-1910.13972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balancing-gaussian-vectors-in-high-dimension-1910.13972"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-track-numbers-of-planar-graphs-1910.14153</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-track-numbers-of-planar-graphs-1910.14153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-track-numbers-of-planar-graphs-1910.14153"/></url>
<url><loc>https://scifaro.com/en/abs/and-testing-and-robust-judgement-aggregation-1911.00159</loc><lastmod>2019-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/and-testing-and-robust-judgement-aggregation-1911.00159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/and-testing-and-robust-judgement-aggregation-1911.00159"/></url>
<url><loc>https://scifaro.com/en/abs/the-lattice-structure-of-linear-subspace-codes-1911.00721</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lattice-structure-of-linear-subspace-codes-1911.00721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lattice-structure-of-linear-subspace-codes-1911.00721"/></url>
<url><loc>https://scifaro.com/en/abs/fast-reliability-ranking-of-matchstick-minimal-networks-1911.01153</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-reliability-ranking-of-matchstick-minimal-networks-1911.01153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-reliability-ranking-of-matchstick-minimal-networks-1911.01153"/></url>
<url><loc>https://scifaro.com/en/abs/persistency-of-linear-programming-relaxations-for-the-stable-set-problem-1911.01478</loc><lastmod>2020-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistency-of-linear-programming-relaxations-for-the-stable-set-problem-1911.01478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistency-of-linear-programming-relaxations-for-the-stable-set-problem-1911.01478"/></url>
<url><loc>https://scifaro.com/en/abs/on-connectivity-and-robustness-in-random-intersection-graphs-1911.01822</loc><lastmod>2019-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-connectivity-and-robustness-in-random-intersection-graphs-1911.01822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-connectivity-and-robustness-in-random-intersection-graphs-1911.01822"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-connectivity-of-heterogeneous-secure-sensor-networks-1911.01890</loc><lastmod>2019-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-connectivity-of-heterogeneous-secure-sensor-networks-1911.01890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-connectivity-of-heterogeneous-secure-sensor-networks-1911.01890"/></url>
<url><loc>https://scifaro.com/en/abs/are-highly-connected-1-planar-graphs-hamiltonian-1911.02153</loc><lastmod>2019-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-highly-connected-1-planar-graphs-hamiltonian-1911.02153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-highly-connected-1-planar-graphs-hamiltonian-1911.02153"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-group-testing-1911.02287</loc><lastmod>2021-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-group-testing-1911.02287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-group-testing-1911.02287"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-bridge-analytics-ii-network-optimization-and-combinatorial-chaining-for-asset-exchange-1911.03036</loc><lastmod>2020-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-bridge-analytics-ii-network-optimization-and-combinatorial-chaining-for-asset-exchange-1911.03036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-bridge-analytics-ii-network-optimization-and-combinatorial-chaining-for-asset-exchange-1911.03036"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-convexity-of-independent-set-games-1911.03169</loc><lastmod>2020-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-convexity-of-independent-set-games-1911.03169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-convexity-of-independent-set-games-1911.03169"/></url>
<url><loc>https://scifaro.com/en/abs/pliability-and-approximating-max-csps-1911.03204</loc><lastmod>2024-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pliability-and-approximating-max-csps-1911.03204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pliability-and-approximating-max-csps-1911.03204"/></url>
<url><loc>https://scifaro.com/en/abs/boundary-type-sets-of-strong-product-of-directed-graphs-1911.03637</loc><lastmod>2019-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boundary-type-sets-of-strong-product-of-directed-graphs-1911.03637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boundary-type-sets-of-strong-product-of-directed-graphs-1911.03637"/></url>
<url><loc>https://scifaro.com/en/abs/a-nonexistence-certificate-for-projective-planes-of-order-ten-with-weight-15-codewords-1911.04032</loc><lastmod>2020-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-nonexistence-certificate-for-projective-planes-of-order-ten-with-weight-15-codewords-1911.04032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-nonexistence-certificate-for-projective-planes-of-order-ten-with-weight-15-codewords-1911.04032"/></url>
<url><loc>https://scifaro.com/en/abs/paired-domination-versus-domination-and-packing-number-in-graphs-1911.04098</loc><lastmod>2019-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paired-domination-versus-domination-and-packing-number-in-graphs-1911.04098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paired-domination-versus-domination-and-packing-number-in-graphs-1911.04098"/></url>
<url><loc>https://scifaro.com/en/abs/matchings-in-1-planar-graphs-with-large-minimum-degree-1911.04603</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matchings-in-1-planar-graphs-with-large-minimum-degree-1911.04603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matchings-in-1-planar-graphs-with-large-minimum-degree-1911.04603"/></url>
<url><loc>https://scifaro.com/en/abs/systematic-analysis-of-cluster-similarity-indices-how-to-validate-validation-measures-1911.04773</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/systematic-analysis-of-cluster-similarity-indices-how-to-validate-validation-measures-1911.04773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/systematic-analysis-of-cluster-similarity-indices-how-to-validate-validation-measures-1911.04773"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-graphs-and-cyclic-polytope-triangulations-1911.05012</loc><lastmod>2021-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-graphs-and-cyclic-polytope-triangulations-1911.05012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-graphs-and-cyclic-polytope-triangulations-1911.05012"/></url>
<url><loc>https://scifaro.com/en/abs/popularity-of-patterns-over-d-equivalence-classes-of-words-and-permutations-1911.05067</loc><lastmod>2019-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/popularity-of-patterns-over-d-equivalence-classes-of-words-and-permutations-1911.05067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/popularity-of-patterns-over-d-equivalence-classes-of-words-and-permutations-1911.05067"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimal-ordering-in-the-optimal-stopping-problem-1911.05096</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimal-ordering-in-the-optimal-stopping-problem-1911.05096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimal-ordering-in-the-optimal-stopping-problem-1911.05096"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-two-choices-for-random-walks-1911.05170</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-two-choices-for-random-walks-1911.05170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-two-choices-for-random-walks-1911.05170"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-i-main-theorems-examples-and-outline-of-proof-1911.05688</loc><lastmod>2019-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-i-main-theorems-examples-and-outline-of-proof-1911.05688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-i-main-theorems-examples-and-outline-of-proof-1911.05688"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relativized-alon-eigenvalue-conjecture-ii-asymptotic-expansion-theorems-for-walks-1911.05705</loc><lastmod>2019-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relativized-alon-eigenvalue-conjecture-ii-asymptotic-expansion-theorems-for-walks-1911.05705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relativized-alon-eigenvalue-conjecture-ii-asymptotic-expansion-theorems-for-walks-1911.05705"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-iii-asymptotic-expansions-for-tangle-free-hashimoto-traces-1911.05710</loc><lastmod>2019-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-iii-asymptotic-expansions-for-tangle-free-hashimoto-traces-1911.05710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-iii-asymptotic-expansions-for-tangle-free-hashimoto-traces-1911.05710"/></url>
<url><loc>https://scifaro.com/en/abs/integer-programming-approaches-to-balanced-connected-k-partition-1911.05723</loc><lastmod>2019-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-programming-approaches-to-balanced-connected-k-partition-1911.05723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-programming-approaches-to-balanced-connected-k-partition-1911.05723"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-vi-sharp-bounds-for-ramanujan-base-graphs-1911.05775</loc><lastmod>2019-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-vi-sharp-bounds-for-ramanujan-base-graphs-1911.05775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-vi-sharp-bounds-for-ramanujan-base-graphs-1911.05775"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-v-proof-of-the-relativized-alon-conjecture-for-regular-base-graphs-1911.06620</loc><lastmod>2019-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-v-proof-of-the-relativized-alon-conjecture-for-regular-base-graphs-1911.06620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relativized-alon-second-eigenvalue-conjecture-v-proof-of-the-relativized-alon-conjecture-for-regular-base-graphs-1911.06620"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-adaptive-group-testing-1911.06647</loc><lastmod>2019-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-adaptive-group-testing-1911.06647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-adaptive-group-testing-1911.06647"/></url>
<url><loc>https://scifaro.com/en/abs/integrality-of-linearizations-of-polynomials-over-binary-variables-using-additional-monomials-1911.06894</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrality-of-linearizations-of-polynomials-over-binary-variables-using-additional-monomials-1911.06894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrality-of-linearizations-of-polynomials-over-binary-variables-using-additional-monomials-1911.06894"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-fitch-graphs-ii-sets-of-binary-relations-that-are-explained-by-edge-labeled-trees-1911.07469</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-fitch-graphs-ii-sets-of-binary-relations-that-are-explained-by-edge-labeled-trees-1911.07469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-fitch-graphs-ii-sets-of-binary-relations-that-are-explained-by-edge-labeled-trees-1911.07469"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-path-partition-number-of-6-regular-graphs-1911.08397</loc><lastmod>2019-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-path-partition-number-of-6-regular-graphs-1911.08397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-path-partition-number-of-6-regular-graphs-1911.08397"/></url>
<url><loc>https://scifaro.com/en/abs/the-longest-s-t-paths-of-o-shaped-supergrid-graphs-1911.08558</loc><lastmod>2019-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-longest-s-t-paths-of-o-shaped-supergrid-graphs-1911.08558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-longest-s-t-paths-of-o-shaped-supergrid-graphs-1911.08558"/></url>
<url><loc>https://scifaro.com/en/abs/steepest-ascent-can-be-exponential-in-bounded-treewidth-problems-1911.08600</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steepest-ascent-can-be-exponential-in-bounded-treewidth-problems-1911.08600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steepest-ascent-can-be-exponential-in-bounded-treewidth-problems-1911.08600"/></url>
<url><loc>https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-the-expanding-search-problem-1911.08959</loc><lastmod>2019-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-the-expanding-search-problem-1911.08959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-the-expanding-search-problem-1911.08959"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-promise-sat-on-non-boolean-domains-1911.09065</loc><lastmod>2021-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-promise-sat-on-non-boolean-domains-1911.09065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-promise-sat-on-non-boolean-domains-1911.09065"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-characterization-of-path-graphs-1911.09069</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-characterization-of-path-graphs-1911.09069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-characterization-of-path-graphs-1911.09069"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-separation-of-shape-and-temporal-patterns-in-time-series-application-to-signature-authentication-1911.09360</loc><lastmod>2019-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-separation-of-shape-and-temporal-patterns-in-time-series-application-to-signature-authentication-1911.09360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-separation-of-shape-and-temporal-patterns-in-time-series-application-to-signature-authentication-1911.09360"/></url>
<url><loc>https://scifaro.com/en/abs/degree-bounded-generalized-polymatroids-and-approximating-the-metric-many-visits-tsp-1911.09890</loc><lastmod>2019-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-bounded-generalized-polymatroids-and-approximating-the-metric-many-visits-tsp-1911.09890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-bounded-generalized-polymatroids-and-approximating-the-metric-many-visits-tsp-1911.09890"/></url>
<url><loc>https://scifaro.com/en/abs/pushable-chromatic-number-of-graphs-with-degree-constraints-1911.09909</loc><lastmod>2019-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pushable-chromatic-number-of-graphs-with-degree-constraints-1911.09909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pushable-chromatic-number-of-graphs-with-degree-constraints-1911.09909"/></url>
<url><loc>https://scifaro.com/en/abs/satisfaction-of-the-condition-of-order-preservation-a-simulation-study-1911.10173</loc><lastmod>2021-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfaction-of-the-condition-of-order-preservation-a-simulation-study-1911.10173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfaction-of-the-condition-of-order-preservation-a-simulation-study-1911.10173"/></url>
<url><loc>https://scifaro.com/en/abs/oriented-diameter-of-star-graphs-1911.10340</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oriented-diameter-of-star-graphs-1911.10340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oriented-diameter-of-star-graphs-1911.10340"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-some-variants-of-the-graph-coloring-game-1911.10363</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-some-variants-of-the-graph-coloring-game-1911.10363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-some-variants-of-the-graph-coloring-game-1911.10363"/></url>
<url><loc>https://scifaro.com/en/abs/list-colouring-of-two-matroids-through-reduction-to-partition-matroids-1911.10485</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/list-colouring-of-two-matroids-through-reduction-to-partition-matroids-1911.10485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/list-colouring-of-two-matroids-through-reduction-to-partition-matroids-1911.10485"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-proof-of-the-fourier-entropy-conjecture-1911.10579</loc><lastmod>2020-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-proof-of-the-fourier-entropy-conjecture-1911.10579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-proof-of-the-fourier-entropy-conjecture-1911.10579"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-cost-integer-circulations-in-given-homology-classes-1911.10912</loc><lastmod>2020-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-cost-integer-circulations-in-given-homology-classes-1911.10912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-cost-integer-circulations-in-given-homology-classes-1911.10912"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedral-study-of-the-convex-recoloring-problem-1911.11099</loc><lastmod>2019-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedral-study-of-the-convex-recoloring-problem-1911.11099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedral-study-of-the-convex-recoloring-problem-1911.11099"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bound-for-the-number-of-closed-and-privileged-words-1911.11197</loc><lastmod>2020-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bound-for-the-number-of-closed-and-privileged-words-1911.11197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bound-for-the-number-of-closed-and-privileged-words-1911.11197"/></url>
<url><loc>https://scifaro.com/en/abs/the-sitting-closer-to-friends-than-enemies-problem-in-trees-1911.11494</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sitting-closer-to-friends-than-enemies-problem-in-trees-1911.11494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sitting-closer-to-friends-than-enemies-problem-in-trees-1911.11494"/></url>
<url><loc>https://scifaro.com/en/abs/extended-formulations-for-stable-set-polytopes-of-graphs-without-two-disjoint-odd-cycles-1911.12179</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-formulations-for-stable-set-polytopes-of-graphs-without-two-disjoint-odd-cycles-1911.12179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-formulations-for-stable-set-polytopes-of-graphs-without-two-disjoint-odd-cycles-1911.12179"/></url>
<url><loc>https://scifaro.com/en/abs/tree-search-algorithms-for-the-sequential-ordering-problem-1911.12427</loc><lastmod>2020-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-search-algorithms-for-the-sequential-ordering-problem-1911.12427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-search-algorithms-for-the-sequential-ordering-problem-1911.12427"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-on-dominating-induced-matchings-1912.00511</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-on-dominating-induced-matchings-1912.00511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-on-dominating-induced-matchings-1912.00511"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-atsp-1912.00670</loc><lastmod>2021-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-atsp-1912.00670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-atsp-1912.00670"/></url>
<url><loc>https://scifaro.com/en/abs/on-irreversible-spread-of-influence-in-edge-weighted-graphs-1912.01243</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-irreversible-spread-of-influence-in-edge-weighted-graphs-1912.01243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-irreversible-spread-of-influence-in-edge-weighted-graphs-1912.01243"/></url>
<url><loc>https://scifaro.com/en/abs/cubic-spline-approximation-of-the-reliability-polynomials-of-two-dual-hammock-networks-1912.03037</loc><lastmod>2019-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubic-spline-approximation-of-the-reliability-polynomials-of-two-dual-hammock-networks-1912.03037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubic-spline-approximation-of-the-reliability-polynomials-of-two-dual-hammock-networks-1912.03037"/></url>
<url><loc>https://scifaro.com/en/abs/combining-networks-using-cherry-picking-sequences-1912.03999</loc><lastmod>2019-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-networks-using-cherry-picking-sequences-1912.03999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-networks-using-cherry-picking-sequences-1912.03999"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-bounding-extremal-functions-of-forbidden-sequences-1912.04897</loc><lastmod>2019-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-bounding-extremal-functions-of-forbidden-sequences-1912.04897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-bounding-extremal-functions-of-forbidden-sequences-1912.04897"/></url>
<url><loc>https://scifaro.com/en/abs/ear-slicing-for-matchings-in-hypergraphs-1912.05486</loc><lastmod>2019-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ear-slicing-for-matchings-in-hypergraphs-1912.05486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ear-slicing-for-matchings-in-hypergraphs-1912.05486"/></url>
<url><loc>https://scifaro.com/en/abs/the-lexicographic-method-for-the-threshold-cover-problem-1912.05819</loc><lastmod>2020-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lexicographic-method-for-the-threshold-cover-problem-1912.05819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lexicographic-method-for-the-threshold-cover-problem-1912.05819"/></url>
<url><loc>https://scifaro.com/en/abs/small-connected-planar-graph-with-1-cop-move-number-4-1912.07004</loc><lastmod>2019-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-connected-planar-graph-with-1-cop-move-number-4-1912.07004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-connected-planar-graph-with-1-cop-move-number-4-1912.07004"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-method-for-verifying-d-mc-candidates-1912.08605</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-method-for-verifying-d-mc-candidates-1912.08605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-method-for-verifying-d-mc-candidates-1912.08605"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-permutations-and-ternary-bent-functions-1912.08615</loc><lastmod>2019-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-permutations-and-ternary-bent-functions-1912.08615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-permutations-and-ternary-bent-functions-1912.08615"/></url>
<url><loc>https://scifaro.com/en/abs/catalan-words-avoiding-pairs-of-length-three-patterns-1912.10447</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/catalan-words-avoiding-pairs-of-length-three-patterns-1912.10447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/catalan-words-avoiding-pairs-of-length-three-patterns-1912.10447"/></url>
<url><loc>https://scifaro.com/en/abs/on-metric-regularity-of-reed-muller-codes-1912.10811</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-metric-regularity-of-reed-muller-codes-1912.10811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-metric-regularity-of-reed-muller-codes-1912.10811"/></url>
<url><loc>https://scifaro.com/en/abs/a-brooks-like-result-for-graph-powers-1912.11181</loc><lastmod>2019-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-brooks-like-result-for-graph-powers-1912.11181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-brooks-like-result-for-graph-powers-1912.11181"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-elementary-construction-of-high-dimensional-expanders-of-kaufman-and-oppenheim-1912.11225</loc><lastmod>2022-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-elementary-construction-of-high-dimensional-expanders-of-kaufman-and-oppenheim-1912.11225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-elementary-construction-of-high-dimensional-expanders-of-kaufman-and-oppenheim-1912.11225"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-independent-sets-in-pyramid-even-hole-free-graphs-1912.11246</loc><lastmod>2019-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-independent-sets-in-pyramid-even-hole-free-graphs-1912.11246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-independent-sets-in-pyramid-even-hole-free-graphs-1912.11246"/></url>
<url><loc>https://scifaro.com/en/abs/forman-ricci-curvature-and-persistent-homology-of-unweighted-complex-networks-1912.11337</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forman-ricci-curvature-and-persistent-homology-of-unweighted-complex-networks-1912.11337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forman-ricci-curvature-and-persistent-homology-of-unweighted-complex-networks-1912.11337"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-exact-map-inference-on-discrete-models-with-global-dependencies-1912.12090</loc><lastmod>2022-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-exact-map-inference-on-discrete-models-with-global-dependencies-1912.12090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-exact-map-inference-on-discrete-models-with-global-dependencies-1912.12090"/></url>
<url><loc>https://scifaro.com/en/abs/transversals-of-longest-cycles-in-partial-k-trees-and-chordal-graphs-1912.12230</loc><lastmod>2019-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transversals-of-longest-cycles-in-partial-k-trees-and-chordal-graphs-1912.12230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transversals-of-longest-cycles-in-partial-k-trees-and-chordal-graphs-1912.12230"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-programming-approach-for-solving-a-generalized-version-of-the-grundy-domination-number-1912.12752</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-programming-approach-for-solving-a-generalized-version-of-the-grundy-domination-number-1912.12752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-programming-approach-for-solving-a-generalized-version-of-the-grundy-domination-number-1912.12752"/></url>
<url><loc>https://scifaro.com/en/abs/multi-transversals-for-triangles-and-the-tuza-s-conjecture-2001.00257</loc><lastmod>2021-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-transversals-for-triangles-and-the-tuza-s-conjecture-2001.00257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-transversals-for-triangles-and-the-tuza-s-conjecture-2001.00257"/></url>
<url><loc>https://scifaro.com/en/abs/representing-graphs-as-the-intersection-of-cographs-and-threshold-graphs-2001.00798</loc><lastmod>2020-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-graphs-as-the-intersection-of-cographs-and-threshold-graphs-2001.00798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-graphs-as-the-intersection-of-cographs-and-threshold-graphs-2001.00798"/></url>
<url><loc>https://scifaro.com/en/abs/tight-localizations-of-feedback-sets-2001.01440</loc><lastmod>2025-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-localizations-of-feedback-sets-2001.01440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-localizations-of-feedback-sets-2001.01440"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-1-d-cutting-stock-problem-2001.01531</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-1-d-cutting-stock-problem-2001.01531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-1-d-cutting-stock-problem-2001.01531"/></url>
<url><loc>https://scifaro.com/en/abs/theta-triangle-free-and-even-hole-k-4-free-graphs-part-2-bounds-on-treewidth-2001.01607</loc><lastmod>2023-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theta-triangle-free-and-even-hole-k-4-free-graphs-part-2-bounds-on-treewidth-2001.01607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theta-triangle-free-and-even-hole-k-4-free-graphs-part-2-bounds-on-treewidth-2001.01607"/></url>
<url><loc>https://scifaro.com/en/abs/transition-property-for-alpha-power-free-languages-with-alpha-geq-2-and-k-geq-3-letters-2001.02184</loc><lastmod>2020-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transition-property-for-alpha-power-free-languages-with-alpha-geq-2-and-k-geq-3-letters-2001.02184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transition-property-for-alpha-power-free-languages-with-alpha-geq-2-and-k-geq-3-letters-2001.02184"/></url>
<url><loc>https://scifaro.com/en/abs/induced-odd-cycle-packing-number-independent-sets-and-chromatic-number-2001.02411</loc><lastmod>2021-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induced-odd-cycle-packing-number-independent-sets-and-chromatic-number-2001.02411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induced-odd-cycle-packing-number-independent-sets-and-chromatic-number-2001.02411"/></url>
<url><loc>https://scifaro.com/en/abs/independent-domination-in-subcubic-graphs-2001.02946</loc><lastmod>2020-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-domination-in-subcubic-graphs-2001.02946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-domination-in-subcubic-graphs-2001.02946"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-teo-and-sethuraman-s-median-stable-marriage-theorem-2001.03133</loc><lastmod>2020-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-teo-and-sethuraman-s-median-stable-marriage-theorem-2001.03133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-teo-and-sethuraman-s-median-stable-marriage-theorem-2001.03133"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-shoreline-searching-with-2-or-more-robots-2001.04311</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-shoreline-searching-with-2-or-more-robots-2001.04311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-shoreline-searching-with-2-or-more-robots-2001.04311"/></url>
<url><loc>https://scifaro.com/en/abs/domination-in-signed-petri-net-2001.04374</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domination-in-signed-petri-net-2001.04374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domination-in-signed-petri-net-2001.04374"/></url>
<url><loc>https://scifaro.com/en/abs/1-planar-graphs-with-minimum-degree-at-least-3-have-bounded-girth-2001.05402</loc><lastmod>2020-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-planar-graphs-with-minimum-degree-at-least-3-have-bounded-girth-2001.05402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-planar-graphs-with-minimum-degree-at-least-3-have-bounded-girth-2001.05402"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-fitch-graphs-iii-symmetrized-fitch-maps-and-sets-of-symmetric-binary-relations-that-are-explained-by-unrooted-edge-labeled-trees-2001.05921</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-fitch-graphs-iii-symmetrized-fitch-maps-and-sets-of-symmetric-binary-relations-that-are-explained-by-unrooted-edge-labeled-trees-2001.05921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-fitch-graphs-iii-symmetrized-fitch-maps-and-sets-of-symmetric-binary-relations-that-are-explained-by-unrooted-edge-labeled-trees-2001.05921"/></url>
<url><loc>https://scifaro.com/en/abs/tourneys-and-the-fast-generation-and-obfuscation-of-closed-knight-s-tours-2001.06044</loc><lastmod>2020-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tourneys-and-the-fast-generation-and-obfuscation-of-closed-knight-s-tours-2001.06044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tourneys-and-the-fast-generation-and-obfuscation-of-closed-knight-s-tours-2001.06044"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilar-conversion-of-multi-valued-networks-to-boolean-networks-2001.07371</loc><lastmod>2020-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilar-conversion-of-multi-valued-networks-to-boolean-networks-2001.07371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilar-conversion-of-multi-valued-networks-to-boolean-networks-2001.07371"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-limit-cycle-problems-in-boolean-networks-2001.07391</loc><lastmod>2020-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-limit-cycle-problems-in-boolean-networks-2001.07391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-limit-cycle-problems-in-boolean-networks-2001.07391"/></url>
<url><loc>https://scifaro.com/en/abs/bipartite-perfect-matching-as-a-real-polynomial-2001.07642</loc><lastmod>2020-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bipartite-perfect-matching-as-a-real-polynomial-2001.07642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bipartite-perfect-matching-as-a-real-polynomial-2001.07642"/></url>
<url><loc>https://scifaro.com/en/abs/certificate-complexity-and-symmetry-of-nested-canalizing-functions-2001.09094</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certificate-complexity-and-symmetry-of-nested-canalizing-functions-2001.09094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certificate-complexity-and-symmetry-of-nested-canalizing-functions-2001.09094"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-secure-connected-domination-in-graphs-2001.11250</loc><lastmod>2020-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-secure-connected-domination-in-graphs-2001.11250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-secure-connected-domination-in-graphs-2001.11250"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiability-proofs-for-weight-16-codewords-in-lam-s-problem-2001.11973</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiability-proofs-for-weight-16-codewords-in-lam-s-problem-2001.11973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiability-proofs-for-weight-16-codewords-in-lam-s-problem-2001.11973"/></url>
<url><loc>https://scifaro.com/en/abs/nonexistence-certificates-for-ovals-in-a-projective-plane-of-order-ten-2001.11974</loc><lastmod>2020-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonexistence-certificates-for-ovals-in-a-projective-plane-of-order-ten-2001.11974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonexistence-certificates-for-ovals-in-a-projective-plane-of-order-ten-2001.11974"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-some-variants-of-domination-in-graphs-2002.00002</loc><lastmod>2020-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-some-variants-of-domination-in-graphs-2002.00002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-some-variants-of-domination-in-graphs-2002.00002"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-algorithms-for-matrix-completion-with-radius-constraints-2002.00645</loc><lastmod>2020-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-algorithms-for-matrix-completion-with-radius-constraints-2002.00645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-algorithms-for-matrix-completion-with-radius-constraints-2002.00645"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-complexity-of-secure-connected-domination-in-graphs-2002.00713</loc><lastmod>2020-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-complexity-of-secure-connected-domination-in-graphs-2002.00713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-complexity-of-secure-connected-domination-in-graphs-2002.00713"/></url>
<url><loc>https://scifaro.com/en/abs/faster-binary-mean-computation-under-dynamic-time-warping-2002.01178</loc><lastmod>2020-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-binary-mean-computation-under-dynamic-time-warping-2002.01178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-binary-mean-computation-under-dynamic-time-warping-2002.01178"/></url>
<url><loc>https://scifaro.com/en/abs/avoidance-of-split-overlaps-2002.01968</loc><lastmod>2020-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoidance-of-split-overlaps-2002.01968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoidance-of-split-overlaps-2002.01968"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-2-secure-domination-in-graphs-2002.02408</loc><lastmod>2020-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-2-secure-domination-in-graphs-2002.02408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-2-secure-domination-in-graphs-2002.02408"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraphs-an-introduction-and-review-2002.05014</loc><lastmod>2020-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraphs-an-introduction-and-review-2002.05014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraphs-an-introduction-and-review-2002.05014"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-complexity-of-isolate-secure-domination-in-graphs-2002.05538</loc><lastmod>2020-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-complexity-of-isolate-secure-domination-in-graphs-2002.05538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-complexity-of-isolate-secure-domination-in-graphs-2002.05538"/></url>
<url><loc>https://scifaro.com/en/abs/directed-graph-hashing-2002.06653</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-graph-hashing-2002.06653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-graph-hashing-2002.06653"/></url>
<url><loc>https://scifaro.com/en/abs/generating-clause-sequences-of-a-cnf-formula-2002.06727</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-clause-sequences-of-a-cnf-formula-2002.06727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-clause-sequences-of-a-cnf-formula-2002.06727"/></url>
<url><loc>https://scifaro.com/en/abs/unique-key-horn-functions-2002.06964</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-key-horn-functions-2002.06964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-key-horn-functions-2002.06964"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-additive-spanners-2002.07152</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-additive-spanners-2002.07152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-additive-spanners-2002.07152"/></url>
<url><loc>https://scifaro.com/en/abs/cover-combinatorial-filters-and-their-minimization-problem-extended-version-2002.07153</loc><lastmod>2022-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cover-combinatorial-filters-and-their-minimization-problem-extended-version-2002.07153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cover-combinatorial-filters-and-their-minimization-problem-extended-version-2002.07153"/></url>
<url><loc>https://scifaro.com/en/abs/density-of-binary-disc-packings-the-9-compact-packings-2002.07168</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/density-of-binary-disc-packings-the-9-compact-packings-2002.07168"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/density-of-binary-disc-packings-the-9-compact-packings-2002.07168"/></url>
<url><loc>https://scifaro.com/en/abs/generating-random-bigraphs-with-preferential-attachment-2002.07448</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-random-bigraphs-with-preferential-attachment-2002.07448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-random-bigraphs-with-preferential-attachment-2002.07448"/></url>
<url><loc>https://scifaro.com/en/abs/representations-for-the-largest-extension-of-a-closure-system-2002.07680</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representations-for-the-largest-extension-of-a-closure-system-2002.07680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representations-for-the-largest-extension-of-a-closure-system-2002.07680"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-simultaneous-congruences-2002.07746</loc><lastmod>2020-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-simultaneous-congruences-2002.07746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-simultaneous-congruences-2002.07746"/></url>
<url><loc>https://scifaro.com/en/abs/bb-evac-fast-location-sensitive-behavior-based-building-evacuation-2002.08114</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bb-evac-fast-location-sensitive-behavior-based-building-evacuation-2002.08114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bb-evac-fast-location-sensitive-behavior-based-building-evacuation-2002.08114"/></url>
<url><loc>https://scifaro.com/en/abs/eccentricity-terrain-of-delta-hyperbolic-graphs-2002.08495</loc><lastmod>2020-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eccentricity-terrain-of-delta-hyperbolic-graphs-2002.08495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eccentricity-terrain-of-delta-hyperbolic-graphs-2002.08495"/></url>
<url><loc>https://scifaro.com/en/abs/iterated-global-models-for-complex-networks-2002.08739</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterated-global-models-for-complex-networks-2002.08739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterated-global-models-for-complex-networks-2002.08739"/></url>
<url><loc>https://scifaro.com/en/abs/total-tessellation-cover-and-quantum-walk-2002.08992</loc><lastmod>2020-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-tessellation-cover-and-quantum-walk-2002.08992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-tessellation-cover-and-quantum-walk-2002.08992"/></url>
<url><loc>https://scifaro.com/en/abs/vizing-goldberg-type-bounds-for-the-equitable-chromatic-number-of-block-graphs-2002.10151</loc><lastmod>2020-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vizing-goldberg-type-bounds-for-the-equitable-chromatic-number-of-block-graphs-2002.10151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vizing-goldberg-type-bounds-for-the-equitable-chromatic-number-of-block-graphs-2002.10151"/></url>
<url><loc>https://scifaro.com/en/abs/genome-assembly-from-practice-to-theory-safe-complete-and-linear-time-2002.10498</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/genome-assembly-from-practice-to-theory-safe-complete-and-linear-time-2002.10498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/genome-assembly-from-practice-to-theory-safe-complete-and-linear-time-2002.10498"/></url>
<url><loc>https://scifaro.com/en/abs/feedback-game-on-3-chromatic-eulerian-triangulations-of-surfaces-2002.10679</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feedback-game-on-3-chromatic-eulerian-triangulations-of-surfaces-2002.10679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feedback-game-on-3-chromatic-eulerian-triangulations-of-surfaces-2002.10679"/></url>
<url><loc>https://scifaro.com/en/abs/intensive-use-of-computing-resources-for-dominations-in-grids-and-other-combinatorial-problems-2002.11615</loc><lastmod>2020-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intensive-use-of-computing-resources-for-dominations-in-grids-and-other-combinatorial-problems-2002.11615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intensive-use-of-computing-resources-for-dominations-in-grids-and-other-combinatorial-problems-2002.11615"/></url>
<url><loc>https://scifaro.com/en/abs/trapping-problem-on-star-type-graphs-with-applications-2002.11713</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trapping-problem-on-star-type-graphs-with-applications-2002.11713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trapping-problem-on-star-type-graphs-with-applications-2002.11713"/></url>
<url><loc>https://scifaro.com/en/abs/edge-corona-product-as-an-approach-to-modeling-complex-simplical-networks-2002.12219</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-corona-product-as-an-approach-to-modeling-complex-simplical-networks-2002.12219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-corona-product-as-an-approach-to-modeling-complex-simplical-networks-2002.12219"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-finding-tangles-2002.12251</loc><lastmod>2024-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-finding-tangles-2002.12251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-finding-tangles-2002.12251"/></url>
<url><loc>https://scifaro.com/en/abs/criteria-for-the-numerical-constant-recognition-2002.12690</loc><lastmod>2021-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/criteria-for-the-numerical-constant-recognition-2002.12690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/criteria-for-the-numerical-constant-recognition-2002.12690"/></url>
<url><loc>https://scifaro.com/en/abs/a-method-for-eternally-dominating-strong-grids-2003.01495</loc><lastmod>2020-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-method-for-eternally-dominating-strong-grids-2003.01495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-method-for-eternally-dominating-strong-grids-2003.01495"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-and-codes-produced-by-a-new-method-for-dividing-a-natural-number-by-two-2003.01691</loc><lastmod>2020-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-and-codes-produced-by-a-new-method-for-dividing-a-natural-number-by-two-2003.01691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-and-codes-produced-by-a-new-method-for-dividing-a-natural-number-by-two-2003.01691"/></url>
<url><loc>https://scifaro.com/en/abs/building-a-larger-class-of-graphs-for-efficient-reconfiguration-of-vertex-colouring-2003.01818</loc><lastmod>2020-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-a-larger-class-of-graphs-for-efficient-reconfiguration-of-vertex-colouring-2003.01818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-a-larger-class-of-graphs-for-efficient-reconfiguration-of-vertex-colouring-2003.01818"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-the-rainbow-vertex-coloring-problem-on-graph-classes-2003.03108</loc><lastmod>2020-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-the-rainbow-vertex-coloring-problem-on-graph-classes-2003.03108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-the-rainbow-vertex-coloring-problem-on-graph-classes-2003.03108"/></url>
<url><loc>https://scifaro.com/en/abs/reappraising-the-distribution-of-the-number-of-edge-crossings-of-graphs-on-a-sphere-2003.03353</loc><lastmod>2020-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reappraising-the-distribution-of-the-number-of-edge-crossings-of-graphs-on-a-sphere-2003.03353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reappraising-the-distribution-of-the-number-of-edge-crossings-of-graphs-on-a-sphere-2003.03353"/></url>
<url><loc>https://scifaro.com/en/abs/clustering-powers-of-sparse-graphs-2003.03605</loc><lastmod>2020-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustering-powers-of-sparse-graphs-2003.03605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustering-powers-of-sparse-graphs-2003.03605"/></url>
<url><loc>https://scifaro.com/en/abs/the-classification-of-minimally-unsatisfiable-2-cnfs-a-fundamental-study-2003.03639</loc><lastmod>2026-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-classification-of-minimally-unsatisfiable-2-cnfs-a-fundamental-study-2003.03639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-classification-of-minimally-unsatisfiable-2-cnfs-a-fundamental-study-2003.03639"/></url>
<url><loc>https://scifaro.com/en/abs/the-game-of-cops-and-eternal-robbers-2003.03791</loc><lastmod>2020-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-game-of-cops-and-eternal-robbers-2003.03791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-game-of-cops-and-eternal-robbers-2003.03791"/></url>
<url><loc>https://scifaro.com/en/abs/the-epsilon-t-net-problem-2003.07061</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-epsilon-t-net-problem-2003.07061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-epsilon-t-net-problem-2003.07061"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-of-irredundant-forests-2003.08144</loc><lastmod>2022-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-of-irredundant-forests-2003.08144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-of-irredundant-forests-2003.08144"/></url>
<url><loc>https://scifaro.com/en/abs/fan-crossing-free-graphs-and-their-relationship-to-other-beyond-planar-graphs-2003.08468</loc><lastmod>2020-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fan-crossing-free-graphs-and-their-relationship-to-other-beyond-planar-graphs-2003.08468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fan-crossing-free-graphs-and-their-relationship-to-other-beyond-planar-graphs-2003.08468"/></url>
<url><loc>https://scifaro.com/en/abs/independent-sets-in-p-4-p-4-triangle-free-graphs-2003.08649</loc><lastmod>2020-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-sets-in-p-4-p-4-triangle-free-graphs-2003.08649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-sets-in-p-4-p-4-triangle-free-graphs-2003.08649"/></url>
<url><loc>https://scifaro.com/en/abs/a-real-polynomial-for-bipartite-graph-minimum-weight-perfect-matchings-2003.08917</loc><lastmod>2020-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-real-polynomial-for-bipartite-graph-minimum-weight-perfect-matchings-2003.08917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-real-polynomial-for-bipartite-graph-minimum-weight-perfect-matchings-2003.08917"/></url>
<url><loc>https://scifaro.com/en/abs/new-heuristics-for-burning-graphs-2003.09314</loc><lastmod>2020-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-heuristics-for-burning-graphs-2003.09314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-heuristics-for-burning-graphs-2003.09314"/></url>
<url><loc>https://scifaro.com/en/abs/an-online-framework-to-interact-and-efficiently-compute-linear-layouts-of-graphs-2003.09642</loc><lastmod>2023-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-online-framework-to-interact-and-efficiently-compute-linear-layouts-of-graphs-2003.09642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-online-framework-to-interact-and-efficiently-compute-linear-layouts-of-graphs-2003.09642"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-diameter-of-the-polytope-of-the-stable-marriage-with-ties-2003.10277</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-diameter-of-the-polytope-of-the-stable-marriage-with-ties-2003.10277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-diameter-of-the-polytope-of-the-stable-marriage-with-ties-2003.10277"/></url>
<url><loc>https://scifaro.com/en/abs/fair-allocation-of-indivisible-items-with-conflict-graphs-2003.11313</loc><lastmod>2022-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fair-allocation-of-indivisible-items-with-conflict-graphs-2003.11313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fair-allocation-of-indivisible-items-with-conflict-graphs-2003.11313"/></url>
<url><loc>https://scifaro.com/en/abs/hypernetwork-science-from-multidimensional-networks-to-computational-topology-2003.11782</loc><lastmod>2020-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypernetwork-science-from-multidimensional-networks-to-computational-topology-2003.11782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypernetwork-science-from-multidimensional-networks-to-computational-topology-2003.11782"/></url>
<url><loc>https://scifaro.com/en/abs/covering-minimal-separators-and-potential-maximal-cliques-in-p-t-free-graphs-2003.12345</loc><lastmod>2020-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-minimal-separators-and-potential-maximal-cliques-in-p-t-free-graphs-2003.12345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-minimal-separators-and-potential-maximal-cliques-in-p-t-free-graphs-2003.12345"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-on-the-coeffcients-of-consecutive-k-out-of-n-f-systems-2003.12419</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-on-the-coeffcients-of-consecutive-k-out-of-n-f-systems-2003.12419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-on-the-coeffcients-of-consecutive-k-out-of-n-f-systems-2003.12419"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-counting-of-zero-dimensional-finite-topological-spaces-with-respect-to-the-covering-dimension-2003.12871</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-counting-of-zero-dimensional-finite-topological-spaces-with-respect-to-the-covering-dimension-2003.12871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-counting-of-zero-dimensional-finite-topological-spaces-with-respect-to-the-covering-dimension-2003.12871"/></url>
<url><loc>https://scifaro.com/en/abs/feedback-edge-sets-in-temporal-graphs-2003.13641</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feedback-edge-sets-in-temporal-graphs-2003.13641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feedback-edge-sets-in-temporal-graphs-2003.13641"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-fixed-points-of-a-boolean-network-from-a-positive-feedback-vertex-set-2004.01259</loc><lastmod>2020-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-fixed-points-of-a-boolean-network-from-a-positive-feedback-vertex-set-2004.01259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-fixed-points-of-a-boolean-network-from-a-positive-feedback-vertex-set-2004.01259"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-double-pooling-tests-2004.01684</loc><lastmod>2020-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-double-pooling-tests-2004.01684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-double-pooling-tests-2004.01684"/></url>
<url><loc>https://scifaro.com/en/abs/catalan-and-schr-oder-permutations-sortable-by-two-restricted-stacks-2004.01812</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/catalan-and-schr-oder-permutations-sortable-by-two-restricted-stacks-2004.01812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/catalan-and-schr-oder-permutations-sortable-by-two-restricted-stacks-2004.01812"/></url>
<url><loc>https://scifaro.com/en/abs/design-of-polynomial-delay-enumeration-algorithms-in-transitive-systems-2004.01904</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-of-polynomial-delay-enumeration-algorithms-in-transitive-systems-2004.01904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-of-polynomial-delay-enumeration-algorithms-in-transitive-systems-2004.01904"/></url>
<url><loc>https://scifaro.com/en/abs/macroscopic-network-circulation-for-planar-graphs-2004.02053</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/macroscopic-network-circulation-for-planar-graphs-2004.02053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/macroscopic-network-circulation-for-planar-graphs-2004.02053"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-coloring-locally-sparse-hypergraphs-2004.02066</loc><lastmod>2026-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-coloring-locally-sparse-hypergraphs-2004.02066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-coloring-locally-sparse-hypergraphs-2004.02066"/></url>
<url><loc>https://scifaro.com/en/abs/p-completeness-of-counting-update-digraphs-cacti-and-a-series-parallel-decomposition-method-2004.02129</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/p-completeness-of-counting-update-digraphs-cacti-and-a-series-parallel-decomposition-method-2004.02129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/p-completeness-of-counting-update-digraphs-cacti-and-a-series-parallel-decomposition-method-2004.02129"/></url>
<url><loc>https://scifaro.com/en/abs/independent-sets-of-closure-operations-2004.02465</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-sets-of-closure-operations-2004.02465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-sets-of-closure-operations-2004.02465"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-displaying-trees-in-temporal-tree-child-network-2004.02634</loc><lastmod>2021-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-displaying-trees-in-temporal-tree-child-network-2004.02634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-displaying-trees-in-temporal-tree-child-network-2004.02634"/></url>
<url><loc>https://scifaro.com/en/abs/graph-distances-and-clustering-2004.03016</loc><lastmod>2020-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-distances-and-clustering-2004.03016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-distances-and-clustering-2004.03016"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-factorizations-of-polynomials-over-finite-fields-2004.03058</loc><lastmod>2021-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-factorizations-of-polynomials-over-finite-fields-2004.03058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-factorizations-of-polynomials-over-finite-fields-2004.03058"/></url>
<url><loc>https://scifaro.com/en/abs/two-results-on-layered-pathwidth-and-linear-layouts-2004.03571</loc><lastmod>2020-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-results-on-layered-pathwidth-and-linear-layouts-2004.03571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-results-on-layered-pathwidth-and-linear-layouts-2004.03571"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-routing-flow-shop-problem-with-two-machines-an-asymmetric-network-with-a-fixed-number-of-nodes-2004.03942</loc><lastmod>2020-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-routing-flow-shop-problem-with-two-machines-an-asymmetric-network-with-a-fixed-number-of-nodes-2004.03942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-routing-flow-shop-problem-with-two-machines-an-asymmetric-network-with-a-fixed-number-of-nodes-2004.03942"/></url>
<url><loc>https://scifaro.com/en/abs/solutions-for-subset-sum-problems-with-special-digraph-constraints-2004.04712</loc><lastmod>2020-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solutions-for-subset-sum-problems-with-special-digraph-constraints-2004.04712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solutions-for-subset-sum-problems-with-special-digraph-constraints-2004.04712"/></url>
<url><loc>https://scifaro.com/en/abs/the-growth-rate-over-trees-of-any-family-of-set-defined-by-a-monadic-second-order-formula-is-semi-computable-2004.06508</loc><lastmod>2020-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-growth-rate-over-trees-of-any-family-of-set-defined-by-a-monadic-second-order-formula-is-semi-computable-2004.06508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-growth-rate-over-trees-of-any-family-of-set-defined-by-a-monadic-second-order-formula-is-semi-computable-2004.06508"/></url>
<url><loc>https://scifaro.com/en/abs/latin-hypercubes-and-cellular-automata-2004.07131</loc><lastmod>2020-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/latin-hypercubes-and-cellular-automata-2004.07131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/latin-hypercubes-and-cellular-automata-2004.07131"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-minimal-dominating-sets-in-the-in-comparability-graphs-of-bounded-dimension-posets-2004.07214</loc><lastmod>2025-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-minimal-dominating-sets-in-the-in-comparability-graphs-of-bounded-dimension-posets-2004.07214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-minimal-dominating-sets-in-the-in-comparability-graphs-of-bounded-dimension-posets-2004.07214"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-delay-enumeration-algorithms-in-set-systems-2004.07823</loc><lastmod>2022-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-delay-enumeration-algorithms-in-set-systems-2004.07823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-delay-enumeration-algorithms-in-set-systems-2004.07823"/></url>
<url><loc>https://scifaro.com/en/abs/a-class-of-models-with-the-potential-to-represent-fundamental-physics-2004.08210</loc><lastmod>2020-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-class-of-models-with-the-potential-to-represent-fundamental-physics-2004.08210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-class-of-models-with-the-potential-to-represent-fundamental-physics-2004.08210"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-existence-and-non-existence-of-improper-homomorphisms-of-oriented-and-2-edge-coloured-graphs-to-reflexive-targets-2004.08732</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-existence-and-non-existence-of-improper-homomorphisms-of-oriented-and-2-edge-coloured-graphs-to-reflexive-targets-2004.08732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-existence-and-non-existence-of-improper-homomorphisms-of-oriented-and-2-edge-coloured-graphs-to-reflexive-targets-2004.08732"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-the-exact-treedepth-problem-2004.08959</loc><lastmod>2020-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-the-exact-treedepth-problem-2004.08959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-the-exact-treedepth-problem-2004.08959"/></url>
<url><loc>https://scifaro.com/en/abs/further-evidence-towards-the-multiplicative-1-2-3-conjecture-2004.09090</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-evidence-towards-the-multiplicative-1-2-3-conjecture-2004.09090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-evidence-towards-the-multiplicative-1-2-3-conjecture-2004.09090"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-stabilization-bound-for-influence-propagation-in-graphs-2004.09185</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-stabilization-bound-for-influence-propagation-in-graphs-2004.09185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-stabilization-bound-for-influence-propagation-in-graphs-2004.09185"/></url>
<url><loc>https://scifaro.com/en/abs/an-effective-construction-for-cut-and-project-rhombus-tilings-with-global-n-fold-rotational-symmetry-2004.10128</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-effective-construction-for-cut-and-project-rhombus-tilings-with-global-n-fold-rotational-symmetry-2004.10128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-effective-construction-for-cut-and-project-rhombus-tilings-with-global-n-fold-rotational-symmetry-2004.10128"/></url>
<url><loc>https://scifaro.com/en/abs/flexibility-of-planar-graphs-sharpening-the-tools-to-get-lists-of-size-four-2004.10917</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexibility-of-planar-graphs-sharpening-the-tools-to-get-lists-of-size-four-2004.10917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexibility-of-planar-graphs-sharpening-the-tools-to-get-lists-of-size-four-2004.10917"/></url>
<url><loc>https://scifaro.com/en/abs/general-cops-and-robbers-games-with-randomness-2004.11503</loc><lastmod>2020-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-cops-and-robbers-games-with-randomness-2004.11503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-cops-and-robbers-games-with-randomness-2004.11503"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-adjacent-vertex-distinguishing-edge-colorings-of-circulant-graphs-2004.12822</loc><lastmod>2022-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-adjacent-vertex-distinguishing-edge-colorings-of-circulant-graphs-2004.12822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-adjacent-vertex-distinguishing-edge-colorings-of-circulant-graphs-2004.12822"/></url>
<url><loc>https://scifaro.com/en/abs/the-approximate-degree-of-bipartite-perfect-matching-2004.14318</loc><lastmod>2022-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-approximate-degree-of-bipartite-perfect-matching-2004.14318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-approximate-degree-of-bipartite-perfect-matching-2004.14318"/></url>
<url><loc>https://scifaro.com/en/abs/some-relativistic-and-gravitational-properties-of-the-wolfram-model-2004.14810</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-relativistic-and-gravitational-properties-of-the-wolfram-model-2004.14810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-relativistic-and-gravitational-properties-of-the-wolfram-model-2004.14810"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-treewidth-of-hanoi-graphs-2005.00179</loc><lastmod>2022-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-treewidth-of-hanoi-graphs-2005.00179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-treewidth-of-hanoi-graphs-2005.00179"/></url>
<url><loc>https://scifaro.com/en/abs/investigating-the-discrepancy-property-of-de-bruijn-sequences-2005.01638</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/investigating-the-discrepancy-property-of-de-bruijn-sequences-2005.01638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/investigating-the-discrepancy-property-of-de-bruijn-sequences-2005.01638"/></url>
<url><loc>https://scifaro.com/en/abs/helly-gap-of-a-graph-and-vertex-eccentricities-2005.01921</loc><lastmod>2020-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/helly-gap-of-a-graph-and-vertex-eccentricities-2005.01921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/helly-gap-of-a-graph-and-vertex-eccentricities-2005.01921"/></url>
<url><loc>https://scifaro.com/en/abs/search-for-developments-of-a-box-having-multiple-ways-of-folding-by-sat-solver-2005.02645</loc><lastmod>2020-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/search-for-developments-of-a-box-having-multiple-ways-of-folding-by-sat-solver-2005.02645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/search-for-developments-of-a-box-having-multiple-ways-of-folding-by-sat-solver-2005.02645"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-lexdfs-on-chordal-graphs-2005.03523</loc><lastmod>2020-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-lexdfs-on-chordal-graphs-2005.03523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-lexdfs-on-chordal-graphs-2005.03523"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-mathbf-c-closure-in-kernelization-algorithms-for-graph-problems-2005.03986</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-mathbf-c-closure-in-kernelization-algorithms-for-graph-problems-2005.03986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-mathbf-c-closure-in-kernelization-algorithms-for-graph-problems-2005.03986"/></url>
<url><loc>https://scifaro.com/en/abs/computationally-inequivalent-summations-and-their-parenthetic-forms-2005.05387</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computationally-inequivalent-summations-and-their-parenthetic-forms-2005.05387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computationally-inequivalent-summations-and-their-parenthetic-forms-2005.05387"/></url>
<url><loc>https://scifaro.com/en/abs/n-pat-a-nested-model-checker-2005.05520</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/n-pat-a-nested-model-checker-2005.05520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/n-pat-a-nested-model-checker-2005.05520"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-tree-decompositions-of-graphs-with-bounded-gonality-2005.05569</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-tree-decompositions-of-graphs-with-bounded-gonality-2005.05569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-tree-decompositions-of-graphs-with-bounded-gonality-2005.05569"/></url>
<url><loc>https://scifaro.com/en/abs/acyclic-edge-coloring-conjecture-is-true-on-planar-graphs-without-intersecting-triangles-2005.06152</loc><lastmod>2020-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclic-edge-coloring-conjecture-is-true-on-planar-graphs-without-intersecting-triangles-2005.06152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclic-edge-coloring-conjecture-is-true-on-planar-graphs-without-intersecting-triangles-2005.06152"/></url>
<url><loc>https://scifaro.com/en/abs/the-interval-function-ptolemaic-distance-hereditary-bridged-graphs-and-axiomatic-characterizations-2005.06751</loc><lastmod>2020-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-interval-function-ptolemaic-distance-hereditary-bridged-graphs-and-axiomatic-characterizations-2005.06751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-interval-function-ptolemaic-distance-hereditary-bridged-graphs-and-axiomatic-characterizations-2005.06751"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-computing-the-eternal-vertex-cover-number-of-cactus-graphs-2005.08058</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-computing-the-eternal-vertex-cover-number-of-cactus-graphs-2005.08058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-computing-the-eternal-vertex-cover-number-of-cactus-graphs-2005.08058"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-no-induced-house-nor-induced-hole-have-the-de-bruijn-erd-h-o-s-property-2005.09447</loc><lastmod>2020-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-no-induced-house-nor-induced-hole-have-the-de-bruijn-erd-h-o-s-property-2005.09447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-no-induced-house-nor-induced-hole-have-the-de-bruijn-erd-h-o-s-property-2005.09447"/></url>
<url><loc>https://scifaro.com/en/abs/growth-of-bilinear-maps-2005.09540</loc><lastmod>2021-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/growth-of-bilinear-maps-2005.09540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/growth-of-bilinear-maps-2005.09540"/></url>
<url><loc>https://scifaro.com/en/abs/the-iteration-number-of-colour-refinement-2005.10182</loc><lastmod>2020-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-iteration-number-of-colour-refinement-2005.10182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-iteration-number-of-colour-refinement-2005.10182"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-properties-of-associated-boolean-functions-of-quadratic-apn-functions-2005.10788</loc><lastmod>2020-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-properties-of-associated-boolean-functions-of-quadratic-apn-functions-2005.10788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-properties-of-associated-boolean-functions-of-quadratic-apn-functions-2005.10788"/></url>
<url><loc>https://scifaro.com/en/abs/chang-s-lemma-via-pinsker-s-inequality-2005.10830</loc><lastmod>2020-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chang-s-lemma-via-pinsker-s-inequality-2005.10830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chang-s-lemma-via-pinsker-s-inequality-2005.10830"/></url>
<url><loc>https://scifaro.com/en/abs/an-inequality-for-the-number-of-periods-in-a-word-2005.11718</loc><lastmod>2020-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-inequality-for-the-number-of-periods-in-a-word-2005.11718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-inequality-for-the-number-of-periods-in-a-word-2005.11718"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-impact-of-treewidth-in-the-computational-complexity-of-freezing-dynamics-2005.11758</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-impact-of-treewidth-in-the-computational-complexity-of-freezing-dynamics-2005.11758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-impact-of-treewidth-in-the-computational-complexity-of-freezing-dynamics-2005.11758"/></url>
<url><loc>https://scifaro.com/en/abs/on-motifs-in-colored-graphs-2005.13634</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-motifs-in-colored-graphs-2005.13634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-motifs-in-colored-graphs-2005.13634"/></url>
<url><loc>https://scifaro.com/en/abs/biclique-graphs-of-k-3-free-graphs-and-bipartite-graphs-2006.00040</loc><lastmod>2020-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/biclique-graphs-of-k-3-free-graphs-and-bipartite-graphs-2006.00040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/biclique-graphs-of-k-3-free-graphs-and-bipartite-graphs-2006.00040"/></url>
<url><loc>https://scifaro.com/en/abs/structural-characterization-of-some-problems-on-circle-and-interval-graphs-2006.00099</loc><lastmod>2020-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-characterization-of-some-problems-on-circle-and-interval-graphs-2006.00099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-characterization-of-some-problems-on-circle-and-interval-graphs-2006.00099"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-0-extension-problems-on-directed-metrics-2006.00153</loc><lastmod>2024-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-0-extension-problems-on-directed-metrics-2006.00153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-0-extension-problems-on-directed-metrics-2006.00153"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-approach-on-locally-checkable-problems-2006.00681</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-approach-on-locally-checkable-problems-2006.00681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-approach-on-locally-checkable-problems-2006.00681"/></url>
<url><loc>https://scifaro.com/en/abs/filling-in-pattern-designs-for-incomplete-pairwise-comparison-matrices-quasi-regular-graphs-with-minimal-diameter-2006.01127</loc><lastmod>2025-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filling-in-pattern-designs-for-incomplete-pairwise-comparison-matrices-quasi-regular-graphs-with-minimal-diameter-2006.01127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filling-in-pattern-designs-for-incomplete-pairwise-comparison-matrices-quasi-regular-graphs-with-minimal-diameter-2006.01127"/></url>
<url><loc>https://scifaro.com/en/abs/time-dependent-biased-random-walks-2006.02475</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-dependent-biased-random-walks-2006.02475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-dependent-biased-random-walks-2006.02475"/></url>
<url><loc>https://scifaro.com/en/abs/clique-width-harnessing-the-power-of-atoms-2006.03578</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-width-harnessing-the-power-of-atoms-2006.03578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-width-harnessing-the-power-of-atoms-2006.03578"/></url>
<url><loc>https://scifaro.com/en/abs/vertex-removal-in-biclique-graphs-2006.04583</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertex-removal-in-biclique-graphs-2006.04583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertex-removal-in-biclique-graphs-2006.04583"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-integer-programming-formulation-of-the-graphical-traveling-salesman-problem-2006.04933</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-integer-programming-formulation-of-the-graphical-traveling-salesman-problem-2006.04933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-integer-programming-formulation-of-the-graphical-traveling-salesman-problem-2006.04933"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-conjecture-for-a-hypergraph-edge-coloring-problem-2006.06393</loc><lastmod>2020-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-conjecture-for-a-hypergraph-edge-coloring-problem-2006.06393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-conjecture-for-a-hypergraph-edge-coloring-problem-2006.06393"/></url>
<url><loc>https://scifaro.com/en/abs/fractional-decomposition-tree-algorithm-a-tool-for-studying-the-integrality-gap-of-integer-programs-2006.06957</loc><lastmod>2020-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fractional-decomposition-tree-algorithm-a-tool-for-studying-the-integrality-gap-of-integer-programs-2006.06957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fractional-decomposition-tree-algorithm-a-tool-for-studying-the-integrality-gap-of-integer-programs-2006.06957"/></url>
<url><loc>https://scifaro.com/en/abs/twin-width-ii-small-classes-2006.09877</loc><lastmod>2020-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twin-width-ii-small-classes-2006.09877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twin-width-ii-small-classes-2006.09877"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchical-decompositions-of-dihypergraphs-2006.11831</loc><lastmod>2020-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchical-decompositions-of-dihypergraphs-2006.11831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchical-decompositions-of-dihypergraphs-2006.11831"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-hypergraphs-with-given-degrees-2006.12021</loc><lastmod>2021-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-hypergraphs-with-given-degrees-2006.12021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-hypergraphs-with-given-degrees-2006.12021"/></url>
<url><loc>https://scifaro.com/en/abs/lyndon-words-the-three-squares-lemma-and-primitive-squares-2006.13576</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lyndon-words-the-three-squares-lemma-and-primitive-squares-2006.13576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lyndon-words-the-three-squares-lemma-and-primitive-squares-2006.13576"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-quadrangulations-and-stacked-triangulations-with-edges-2006.13722</loc><lastmod>2020-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-quadrangulations-and-stacked-triangulations-with-edges-2006.13722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-quadrangulations-and-stacked-triangulations-with-edges-2006.13722"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-of-the-sum-of-edge-lengths-in-linear-arrangements-of-trees-2006.14069</loc><lastmod>2021-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-of-the-sum-of-edge-lengths-in-linear-arrangements-of-trees-2006.14069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-of-the-sum-of-edge-lengths-in-linear-arrangements-of-trees-2006.14069"/></url>
<url><loc>https://scifaro.com/en/abs/density-of-binary-disc-packings-playing-with-stoichiometry-2006.14232</loc><lastmod>2022-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/density-of-binary-disc-packings-playing-with-stoichiometry-2006.14232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/density-of-binary-disc-packings-playing-with-stoichiometry-2006.14232"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-model-checking-in-random-graphs-and-complex-networks-2006.14488</loc><lastmod>2020-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-model-checking-in-random-graphs-and-complex-networks-2006.14488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-model-checking-in-random-graphs-and-complex-networks-2006.14488"/></url>
<url><loc>https://scifaro.com/en/abs/on-dualization-over-distributive-lattices-2006.15337</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-dualization-over-distributive-lattices-2006.15337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-dualization-over-distributive-lattices-2006.15337"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-and-complexity-for-geodetic-sets-on-planar-and-chordal-graphs-2006.16511</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-and-complexity-for-geodetic-sets-on-planar-and-chordal-graphs-2006.16511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-and-complexity-for-geodetic-sets-on-planar-and-chordal-graphs-2006.16511"/></url>
<url><loc>https://scifaro.com/en/abs/a-quantum-algorithm-to-estimate-the-gowers-u-2-norm-and-linearity-testing-of-boolean-functions-2006.16523</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quantum-algorithm-to-estimate-the-gowers-u-2-norm-and-linearity-testing-of-boolean-functions-2006.16523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quantum-algorithm-to-estimate-the-gowers-u-2-norm-and-linearity-testing-of-boolean-functions-2006.16523"/></url>
<url><loc>https://scifaro.com/en/abs/linear-transformations-between-dominating-sets-in-the-tar-model-2006.16726</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-transformations-between-dominating-sets-in-the-tar-model-2006.16726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-transformations-between-dominating-sets-in-the-tar-model-2006.16726"/></url>
<url><loc>https://scifaro.com/en/abs/concave-aspects-of-submodular-functions-2006.16784</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concave-aspects-of-submodular-functions-2006.16784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concave-aspects-of-submodular-functions-2006.16784"/></url>
<url><loc>https://scifaro.com/en/abs/thinness-of-product-graphs-2006.16887</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/thinness-of-product-graphs-2006.16887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/thinness-of-product-graphs-2006.16887"/></url>
<url><loc>https://scifaro.com/en/abs/precedence-thinness-in-graphs-2006.16991</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/precedence-thinness-in-graphs-2006.16991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/precedence-thinness-in-graphs-2006.16991"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-induced-subgraph-characterization-of-circle-graphs-within-split-graphs-2007.00570</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-induced-subgraph-characterization-of-circle-graphs-within-split-graphs-2007.00570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-induced-subgraph-characterization-of-circle-graphs-within-split-graphs-2007.00570"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-enumeration-of-maximal-split-subgraphs-and-induced-sub-cographs-and-related-classes-2007.01031</loc><lastmod>2023-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-enumeration-of-maximal-split-subgraphs-and-induced-sub-cographs-and-related-classes-2007.01031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-enumeration-of-maximal-split-subgraphs-and-induced-sub-cographs-and-related-classes-2007.01031"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-without-gap-vertex-labellings-families-and-bounds-2007.01431</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-without-gap-vertex-labellings-families-and-bounds-2007.01431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-without-gap-vertex-labellings-families-and-bounds-2007.01431"/></url>
<url><loc>https://scifaro.com/en/abs/fractional-covers-of-hypergraphs-with-bounded-multi-intersection-2007.01830</loc><lastmod>2023-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fractional-covers-of-hypergraphs-with-bounded-multi-intersection-2007.01830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fractional-covers-of-hypergraphs-with-bounded-multi-intersection-2007.01830"/></url>
<url><loc>https://scifaro.com/en/abs/elimination-distance-to-bounded-degree-on-planar-graphs-2007.02413</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elimination-distance-to-bounded-degree-on-planar-graphs-2007.02413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elimination-distance-to-bounded-degree-on-planar-graphs-2007.02413"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-weight-and-density-bounds-of-polynomial-threshold-functions-2007.02509</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-weight-and-density-bounds-of-polynomial-threshold-functions-2007.02509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-weight-and-density-bounds-of-polynomial-threshold-functions-2007.02509"/></url>
<url><loc>https://scifaro.com/en/abs/on-b-1-epg-and-ept-graphs-2007.02755</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-b-1-epg-and-ept-graphs-2007.02755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-b-1-epg-and-ept-graphs-2007.02755"/></url>
<url><loc>https://scifaro.com/en/abs/non-separating-spanning-trees-and-out-branchings-in-digraphsof-independence-number-2-2007.02834</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-separating-spanning-trees-and-out-branchings-in-digraphsof-independence-number-2-2007.02834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-separating-spanning-trees-and-out-branchings-in-digraphsof-independence-number-2-2007.02834"/></url>
<url><loc>https://scifaro.com/en/abs/agafonov-s-proof-of-agafonov-s-theorem-a-modern-account-and-new-insights-2007.03249</loc><lastmod>2022-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/agafonov-s-proof-of-agafonov-s-theorem-a-modern-account-and-new-insights-2007.03249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/agafonov-s-proof-of-agafonov-s-theorem-a-modern-account-and-new-insights-2007.03249"/></url>
<url><loc>https://scifaro.com/en/abs/cycle-extendability-of-hamiltonian-strongly-chordal-graphs-2007.04698</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cycle-extendability-of-hamiltonian-strongly-chordal-graphs-2007.04698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cycle-extendability-of-hamiltonian-strongly-chordal-graphs-2007.04698"/></url>
<url><loc>https://scifaro.com/en/abs/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2007.05630</loc><lastmod>2022-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2007.05630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2007.05630"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-binary-polynomial-optimization-over-acyclic-hypergraphs-2007.05861</loc><lastmod>2022-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-binary-polynomial-optimization-over-acyclic-hypergraphs-2007.05861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-binary-polynomial-optimization-over-acyclic-hypergraphs-2007.05861"/></url>
<url><loc>https://scifaro.com/en/abs/integer-laplacian-eigenvalues-of-strictly-chordal-graphs-2007.06681</loc><lastmod>2020-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-laplacian-eigenvalues-of-strictly-chordal-graphs-2007.06681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-laplacian-eigenvalues-of-strictly-chordal-graphs-2007.06681"/></url>
<url><loc>https://scifaro.com/en/abs/a-self-organizing-extreme-point-tabu-search-algorithm-for-fixed-charge-network-problems-with-extensions-2007.06685</loc><lastmod>2020-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-self-organizing-extreme-point-tabu-search-algorithm-for-fixed-charge-network-problems-with-extensions-2007.06685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-self-organizing-extreme-point-tabu-search-algorithm-for-fixed-charge-network-problems-with-extensions-2007.06685"/></url>
<url><loc>https://scifaro.com/en/abs/the-collatz-process-embeds-a-base-conversion-algorithm-2007.06979</loc><lastmod>2022-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-collatz-process-embeds-a-base-conversion-algorithm-2007.06979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-collatz-process-embeds-a-base-conversion-algorithm-2007.06979"/></url>
<url><loc>https://scifaro.com/en/abs/on-sampling-symmetric-gibbs-distributions-on-sparse-random-graphs-and-hypergraphs-2007.07145</loc><lastmod>2024-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sampling-symmetric-gibbs-distributions-on-sparse-random-graphs-and-hypergraphs-2007.07145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sampling-symmetric-gibbs-distributions-on-sparse-random-graphs-and-hypergraphs-2007.07145"/></url>
<url><loc>https://scifaro.com/en/abs/inference-and-mutual-information-on-random-factor-graphs-2007.07494</loc><lastmod>2021-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inference-and-mutual-information-on-random-factor-graphs-2007.07494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inference-and-mutual-information-on-random-factor-graphs-2007.07494"/></url>
<url><loc>https://scifaro.com/en/abs/rankwidth-meets-stability-2007.07857</loc><lastmod>2020-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rankwidth-meets-stability-2007.07857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rankwidth-meets-stability-2007.07857"/></url>
<url><loc>https://scifaro.com/en/abs/ultimate-periodicity-problem-for-linear-numeration-systems-2007.08147</loc><lastmod>2023-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ultimate-periodicity-problem-for-linear-numeration-systems-2007.08147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ultimate-periodicity-problem-for-linear-numeration-systems-2007.08147"/></url>
<url><loc>https://scifaro.com/en/abs/dominated-minimal-separators-are-tame-nearly-all-others-are-feral-2007.08761</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dominated-minimal-separators-are-tame-nearly-all-others-are-feral-2007.08761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dominated-minimal-separators-are-tame-nearly-all-others-are-feral-2007.08761"/></url>
<url><loc>https://scifaro.com/en/abs/independence-versus-indetermination-basis-of-two-canonical-clustering-criteria-2007.08820</loc><lastmod>2021-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independence-versus-indetermination-basis-of-two-canonical-clustering-criteria-2007.08820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independence-versus-indetermination-basis-of-two-canonical-clustering-criteria-2007.08820"/></url>
<url><loc>https://scifaro.com/en/abs/a-greedy-algorithm-for-the-social-golfer-and-the-oberwolfach-problem-2007.10704</loc><lastmod>2021-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-greedy-algorithm-for-the-social-golfer-and-the-oberwolfach-problem-2007.10704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-greedy-algorithm-for-the-social-golfer-and-the-oberwolfach-problem-2007.10704"/></url>
<url><loc>https://scifaro.com/en/abs/stick-graphs-examples-and-counter-examples-2007.10773</loc><lastmod>2022-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stick-graphs-examples-and-counter-examples-2007.10773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stick-graphs-examples-and-counter-examples-2007.10773"/></url>
<url><loc>https://scifaro.com/en/abs/a-3-2-approximation-for-the-metric-many-visits-path-tsp-2007.11389</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-3-2-approximation-for-the-metric-many-visits-path-tsp-2007.11389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-3-2-approximation-for-the-metric-many-visits-path-tsp-2007.11389"/></url>
<url><loc>https://scifaro.com/en/abs/a-class-of-graphs-with-large-rankwidth-2007.11513</loc><lastmod>2023-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-class-of-graphs-with-large-rankwidth-2007.11513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-class-of-graphs-with-large-rankwidth-2007.11513"/></url>
<url><loc>https://scifaro.com/en/abs/the-italian-domination-numbers-of-some-products-of-directed-cycles-2007.13132</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-italian-domination-numbers-of-some-products-of-directed-cycles-2007.13132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-italian-domination-numbers-of-some-products-of-directed-cycles-2007.13132"/></url>
<url><loc>https://scifaro.com/en/abs/injective-hulls-of-various-graph-classes-2007.14377</loc><lastmod>2020-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/injective-hulls-of-various-graph-classes-2007.14377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/injective-hulls-of-various-graph-classes-2007.14377"/></url>
<url><loc>https://scifaro.com/en/abs/book-embeddings-of-graph-products-2007.15102</loc><lastmod>2020-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/book-embeddings-of-graph-products-2007.15102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/book-embeddings-of-graph-products-2007.15102"/></url>
<url><loc>https://scifaro.com/en/abs/fast-computation-of-all-pairs-of-geodesic-distances-2007.16076</loc><lastmod>2020-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-computation-of-all-pairs-of-geodesic-distances-2007.16076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-computation-of-all-pairs-of-geodesic-distances-2007.16076"/></url>
<url><loc>https://scifaro.com/en/abs/on-extremal-leaf-status-and-internal-status-of-trees-2008.00438</loc><lastmod>2020-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-extremal-leaf-status-and-internal-status-of-trees-2008.00438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-extremal-leaf-status-and-internal-status-of-trees-2008.00438"/></url>
<url><loc>https://scifaro.com/en/abs/profiles-of-dynamical-systems-and-their-algebra-2008.00843</loc><lastmod>2022-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/profiles-of-dynamical-systems-and-their-algebra-2008.00843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/profiles-of-dynamical-systems-and-their-algebra-2008.00843"/></url>
<url><loc>https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-3-3-free-bipartite-graphs-in-polynomial-time-2008.04046</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-3-3-free-bipartite-graphs-in-polynomial-time-2008.04046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-3-3-free-bipartite-graphs-in-polynomial-time-2008.04046"/></url>
<url><loc>https://scifaro.com/en/abs/critical-sets-crowns-and-local-maximum-independent-sets-2008.04587</loc><lastmod>2020-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-sets-crowns-and-local-maximum-independent-sets-2008.04587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-sets-crowns-and-local-maximum-independent-sets-2008.04587"/></url>
<url><loc>https://scifaro.com/en/abs/the-italian-bondage-and-reinforcement-numbers-of-digraphs-2008.05140</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-italian-bondage-and-reinforcement-numbers-of-digraphs-2008.05140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-italian-bondage-and-reinforcement-numbers-of-digraphs-2008.05140"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-tree-width-of-even-hole-free-graphs-2008.05504</loc><lastmod>2023-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-tree-width-of-even-hole-free-graphs-2008.05504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-tree-width-of-even-hole-free-graphs-2008.05504"/></url>
<url><loc>https://scifaro.com/en/abs/an-explicit-construction-of-graphs-of-bounded-degree-that-are-far-from-being-hamiltonian-2008.05801</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-explicit-construction-of-graphs-of-bounded-degree-that-are-far-from-being-hamiltonian-2008.05801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-explicit-construction-of-graphs-of-bounded-degree-that-are-far-from-being-hamiltonian-2008.05801"/></url>
<url><loc>https://scifaro.com/en/abs/sublinear-bounds-for-nullity-of-flows-and-approximating-tutte-s-flow-conjectures-2008.07152</loc><lastmod>2020-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sublinear-bounds-for-nullity-of-flows-and-approximating-tutte-s-flow-conjectures-2008.07152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sublinear-bounds-for-nullity-of-flows-and-approximating-tutte-s-flow-conjectures-2008.07152"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-patrolling-games-2008.07369</loc><lastmod>2022-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-patrolling-games-2008.07369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-patrolling-games-2008.07369"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-shortest-paths-in-geodetic-graphs-2008.07637</loc><lastmod>2020-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-shortest-paths-in-geodetic-graphs-2008.07637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-shortest-paths-in-geodetic-graphs-2008.07637"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-maximum-edge-colorable-subgraph-2008.07953</loc><lastmod>2020-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-maximum-edge-colorable-subgraph-2008.07953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-maximum-edge-colorable-subgraph-2008.07953"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-grid-contraction-2008.07967</loc><lastmod>2020-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-grid-contraction-2008.07967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-grid-contraction-2008.07967"/></url>
<url><loc>https://scifaro.com/en/abs/inheritance-of-convexity-for-the-tilde-mathcal-p-min-restricted-game-2008.08410</loc><lastmod>2020-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inheritance-of-convexity-for-the-tilde-mathcal-p-min-restricted-game-2008.08410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inheritance-of-convexity-for-the-tilde-mathcal-p-min-restricted-game-2008.08410"/></url>
<url><loc>https://scifaro.com/en/abs/stable-matchings-with-restricted-preferences-structure-and-complexity-2008.08480</loc><lastmod>2021-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-matchings-with-restricted-preferences-structure-and-complexity-2008.08480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-matchings-with-restricted-preferences-structure-and-complexity-2008.08480"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-tree-based-phylogenetic-networks-with-minimum-number-of-crossings-2008.08960</loc><lastmod>2020-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-tree-based-phylogenetic-networks-with-minimum-number-of-crossings-2008.08960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-tree-based-phylogenetic-networks-with-minimum-number-of-crossings-2008.08960"/></url>
<url><loc>https://scifaro.com/en/abs/2-layer-k-planar-graphs-density-crossing-lemma-relationships-and-pathwidth-2008.09329</loc><lastmod>2020-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-layer-k-planar-graphs-density-crossing-lemma-relationships-and-pathwidth-2008.09329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-layer-k-planar-graphs-density-crossing-lemma-relationships-and-pathwidth-2008.09329"/></url>
<url><loc>https://scifaro.com/en/abs/a-tipping-point-for-the-planarity-of-small-and-medium-sized-graphs-2008.09405</loc><lastmod>2020-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tipping-point-for-the-planarity-of-small-and-medium-sized-graphs-2008.09405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tipping-point-for-the-planarity-of-small-and-medium-sized-graphs-2008.09405"/></url>
<url><loc>https://scifaro.com/en/abs/acyclic-star-and-injective-colouring-a-complexity-picture-for-h-free-graphs-2008.09415</loc><lastmod>2026-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclic-star-and-injective-colouring-a-complexity-picture-for-h-free-graphs-2008.09415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclic-star-and-injective-colouring-a-complexity-picture-for-h-free-graphs-2008.09415"/></url>
<url><loc>https://scifaro.com/en/abs/extending-partial-orthogonal-drawings-2008.10280</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-partial-orthogonal-drawings-2008.10280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-partial-orthogonal-drawings-2008.10280"/></url>
<url><loc>https://scifaro.com/en/abs/on-mixed-linear-layouts-of-series-parallel-graphs-2008.10475</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-mixed-linear-layouts-of-series-parallel-graphs-2008.10475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-mixed-linear-layouts-of-series-parallel-graphs-2008.10475"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-l-p-q-edge-labelling-2008.12226</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-l-p-q-edge-labelling-2008.12226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-l-p-q-edge-labelling-2008.12226"/></url>
<url><loc>https://scifaro.com/en/abs/semipaired-domination-in-some-subclasses-of-chordal-graphs-2008.13491</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semipaired-domination-in-some-subclasses-of-chordal-graphs-2008.13491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semipaired-domination-in-some-subclasses-of-chordal-graphs-2008.13491"/></url>
<url><loc>https://scifaro.com/en/abs/collectively-canalizing-boolean-functions-2008.13741</loc><lastmod>2023-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collectively-canalizing-boolean-functions-2008.13741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collectively-canalizing-boolean-functions-2008.13741"/></url>
<url><loc>https://scifaro.com/en/abs/exact-square-coloring-of-subcubic-planar-graphs-2009.00843</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-square-coloring-of-subcubic-planar-graphs-2009.00843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-square-coloring-of-subcubic-planar-graphs-2009.00843"/></url>
<url><loc>https://scifaro.com/en/abs/max-cut-in-weighted-random-intersection-graphs-and-discrepancy-of-sparse-random-set-systems-2009.01567</loc><lastmod>2021-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/max-cut-in-weighted-random-intersection-graphs-and-discrepancy-of-sparse-random-set-systems-2009.01567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/max-cut-in-weighted-random-intersection-graphs-and-discrepancy-of-sparse-random-set-systems-2009.01567"/></url>
<url><loc>https://scifaro.com/en/abs/strong-hanani-tutte-for-the-torus-2009.01683</loc><lastmod>2021-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-hanani-tutte-for-the-torus-2009.01683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-hanani-tutte-for-the-torus-2009.01683"/></url>
<url><loc>https://scifaro.com/en/abs/edge-degeneracy-algorithmic-and-structural-results-2009.03809</loc><lastmod>2020-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-degeneracy-algorithmic-and-structural-results-2009.03809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-degeneracy-algorithmic-and-structural-results-2009.03809"/></url>
<url><loc>https://scifaro.com/en/abs/hypercontractivity-on-the-symmetric-group-2009.05503</loc><lastmod>2020-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypercontractivity-on-the-symmetric-group-2009.05503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypercontractivity-on-the-symmetric-group-2009.05503"/></url>
<url><loc>https://scifaro.com/en/abs/sparsity-of-weighted-networks-measures-and-applications-2009.06310</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparsity-of-weighted-networks-measures-and-applications-2009.06310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparsity-of-weighted-networks-measures-and-applications-2009.06310"/></url>
<url><loc>https://scifaro.com/en/abs/mip-and-set-covering-approaches-for-sparse-approximation-2009.06312</loc><lastmod>2020-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mip-and-set-covering-approaches-for-sparse-approximation-2009.06312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mip-and-set-covering-approaches-for-sparse-approximation-2009.06312"/></url>
<url><loc>https://scifaro.com/en/abs/on-path-ranking-in-time-dependent-graphs-2009.07588</loc><lastmod>2023-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-path-ranking-in-time-dependent-graphs-2009.07588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-path-ranking-in-time-dependent-graphs-2009.07588"/></url>
<url><loc>https://scifaro.com/en/abs/blocking-total-dominating-sets-via-edge-contractions-2009.08806</loc><lastmod>2020-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blocking-total-dominating-sets-via-edge-contractions-2009.08806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blocking-total-dominating-sets-via-edge-contractions-2009.08806"/></url>
<url><loc>https://scifaro.com/en/abs/improving-on-best-of-many-christofides-for-t-tours-2009.09743</loc><lastmod>2020-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-on-best-of-many-christofides-for-t-tours-2009.09743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-on-best-of-many-christofides-for-t-tours-2009.09743"/></url>
<url><loc>https://scifaro.com/en/abs/on-uncertainty-inequalities-related-to-subcube-partitions-and-additive-energy-2009.10127</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-uncertainty-inequalities-related-to-subcube-partitions-and-additive-energy-2009.10127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-uncertainty-inequalities-related-to-subcube-partitions-and-additive-energy-2009.10127"/></url>
<url><loc>https://scifaro.com/en/abs/the-quotient-in-preorder-theories-2009.10886</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-quotient-in-preorder-theories-2009.10886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-quotient-in-preorder-theories-2009.10886"/></url>
<url><loc>https://scifaro.com/en/abs/kirchhoff-s-circuit-law-applications-to-graph-simplification-in-search-problems-2009.11675</loc><lastmod>2022-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kirchhoff-s-circuit-law-applications-to-graph-simplification-in-search-problems-2009.11675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kirchhoff-s-circuit-law-applications-to-graph-simplification-in-search-problems-2009.11675"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-signed-chromatic-number-of-some-classes-of-graphs-2009.12059</loc><lastmod>2020-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-signed-chromatic-number-of-some-classes-of-graphs-2009.12059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-signed-chromatic-number-of-some-classes-of-graphs-2009.12059"/></url>
<url><loc>https://scifaro.com/en/abs/graph-theoretic-and-algorithmic-aspect-of-the-equitable-coloring-problem-in-block-graphs-2009.12784</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-theoretic-and-algorithmic-aspect-of-the-equitable-coloring-problem-in-block-graphs-2009.12784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-theoretic-and-algorithmic-aspect-of-the-equitable-coloring-problem-in-block-graphs-2009.12784"/></url>
<url><loc>https://scifaro.com/en/abs/the-canonical-directed-tree-decomposition-and-its-applications-to-the-directed-disjoint-paths-problem-2009.13184</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-canonical-directed-tree-decomposition-and-its-applications-to-the-directed-disjoint-paths-problem-2009.13184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-canonical-directed-tree-decomposition-and-its-applications-to-the-directed-disjoint-paths-problem-2009.13184"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-of-the-double-travelling-salesman-problem-with-multiple-stacks-2010.00138</loc><lastmod>2020-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-of-the-double-travelling-salesman-problem-with-multiple-stacks-2010.00138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-of-the-double-travelling-salesman-problem-with-multiple-stacks-2010.00138"/></url>
<url><loc>https://scifaro.com/en/abs/planar-projections-of-graphs-2010.01286</loc><lastmod>2020-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-projections-of-graphs-2010.01286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-projections-of-graphs-2010.01286"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-monophonic-rank-of-a-graph-2010.01365</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-monophonic-rank-of-a-graph-2010.01365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-monophonic-rank-of-a-graph-2010.01365"/></url>
<url><loc>https://scifaro.com/en/abs/burning-geometric-graphs-2010.01439</loc><lastmod>2020-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/burning-geometric-graphs-2010.01439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/burning-geometric-graphs-2010.01439"/></url>
<url><loc>https://scifaro.com/en/abs/substitution-discrete-plane-tilings-with-2n-fold-rotational-symmetry-for-odd-n-2010.01879</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/substitution-discrete-plane-tilings-with-2n-fold-rotational-symmetry-for-odd-n-2010.01879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/substitution-discrete-plane-tilings-with-2n-fold-rotational-symmetry-for-odd-n-2010.01879"/></url>
<url><loc>https://scifaro.com/en/abs/defensive-domination-in-proper-interval-graphs-2010.03865</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defensive-domination-in-proper-interval-graphs-2010.03865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defensive-domination-in-proper-interval-graphs-2010.03865"/></url>
<url><loc>https://scifaro.com/en/abs/equitable-scheduling-on-a-single-machine-2010.04643</loc><lastmod>2021-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equitable-scheduling-on-a-single-machine-2010.04643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equitable-scheduling-on-a-single-machine-2010.04643"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-similarity-between-ranking-vectors-in-the-pairwise-comparison-method-2010.04778</loc><lastmod>2021-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-similarity-between-ranking-vectors-in-the-pairwise-comparison-method-2010.04778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-similarity-between-ranking-vectors-in-the-pairwise-comparison-method-2010.04778"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-complexity-of-fibonacci-and-tribonacci-words-2010.07275</loc><lastmod>2020-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-complexity-of-fibonacci-and-tribonacci-words-2010.07275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-complexity-of-fibonacci-and-tribonacci-words-2010.07275"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-constructions-of-the-prefer-same-and-prefer-opposite-de-bruijn-sequences-2010.07960</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-constructions-of-the-prefer-same-and-prefer-opposite-de-bruijn-sequences-2010.07960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-constructions-of-the-prefer-same-and-prefer-opposite-de-bruijn-sequences-2010.07960"/></url>
<url><loc>https://scifaro.com/en/abs/group-testing-for-efficiently-sampling-hypergraphs-when-tests-have-variable-costs-2010.09205</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/group-testing-for-efficiently-sampling-hypergraphs-when-tests-have-variable-costs-2010.09205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/group-testing-for-efficiently-sampling-hypergraphs-when-tests-have-variable-costs-2010.09205"/></url>
<url><loc>https://scifaro.com/en/abs/the-graphs-of-stably-matchable-pairs-2010.09230</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graphs-of-stably-matchable-pairs-2010.09230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graphs-of-stably-matchable-pairs-2010.09230"/></url>
<url><loc>https://scifaro.com/en/abs/leader-election-and-local-identifiers-for-3d-programmable-matter-2010.09286</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leader-election-and-local-identifiers-for-3d-programmable-matter-2010.09286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leader-election-and-local-identifiers-for-3d-programmable-matter-2010.09286"/></url>
<url><loc>https://scifaro.com/en/abs/gray-codes-for-fibonacci-q-decreasing-words-2010.09505</loc><lastmod>2021-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gray-codes-for-fibonacci-q-decreasing-words-2010.09505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gray-codes-for-fibonacci-q-decreasing-words-2010.09505"/></url>
<url><loc>https://scifaro.com/en/abs/subword-complexity-of-the-fibonacci-thue-morse-sequence-the-proof-of-dekking-s-conjecture-2010.10956</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subword-complexity-of-the-fibonacci-thue-morse-sequence-the-proof-of-dekking-s-conjecture-2010.10956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subword-complexity-of-the-fibonacci-thue-morse-sequence-the-proof-of-dekking-s-conjecture-2010.10956"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-algorithms-and-heuristics-for-efficient-computation-of-high-order-line-graphs-of-hypergraphs-2010.11448</loc><lastmod>2021-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-algorithms-and-heuristics-for-efficient-computation-of-high-order-line-graphs-of-hypergraphs-2010.11448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-algorithms-and-heuristics-for-efficient-computation-of-high-order-line-graphs-of-hypergraphs-2010.11448"/></url>
<url><loc>https://scifaro.com/en/abs/towards-dynamic-point-systems-on-metric-graphs-with-longest-stabilization-time-2010.12528</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-dynamic-point-systems-on-metric-graphs-with-longest-stabilization-time-2010.12528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-dynamic-point-systems-on-metric-graphs-with-longest-stabilization-time-2010.12528"/></url>
<url><loc>https://scifaro.com/en/abs/mutual-borders-and-overlaps-2010.14663</loc><lastmod>2022-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutual-borders-and-overlaps-2010.14663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutual-borders-and-overlaps-2010.14663"/></url>
<url><loc>https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-1-5-free-bipartite-graphs-in-polynomial-time-2010.16076</loc><lastmod>2021-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-1-5-free-bipartite-graphs-in-polynomial-time-2010.16076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-1-5-free-bipartite-graphs-in-polynomial-time-2010.16076"/></url>
<url><loc>https://scifaro.com/en/abs/edge-based-analysis-of-networks-curvatures-of-graphs-and-hypergraphs-2010.16366</loc><lastmod>2020-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-based-analysis-of-networks-curvatures-of-graphs-and-hypergraphs-2010.16366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-based-analysis-of-networks-curvatures-of-graphs-and-hypergraphs-2010.16366"/></url>
<url><loc>https://scifaro.com/en/abs/similarity-between-points-in-metric-measure-spaces-2011.00616</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/similarity-between-points-in-metric-measure-spaces-2011.00616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/similarity-between-points-in-metric-measure-spaces-2011.00616"/></url>
<url><loc>https://scifaro.com/en/abs/unified-greedy-approximability-beyond-submodular-maximization-2011.00962</loc><lastmod>2022-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unified-greedy-approximability-beyond-submodular-maximization-2011.00962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unified-greedy-approximability-beyond-submodular-maximization-2011.00962"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-and-reliability-of-separable-systems-2011.02027</loc><lastmod>2020-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-and-reliability-of-separable-systems-2011.02027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-and-reliability-of-separable-systems-2011.02027"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-mixing-of-glauber-dynamics-entropy-factorization-via-high-dimensional-expansion-2011.02075</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-mixing-of-glauber-dynamics-entropy-factorization-via-high-dimensional-expansion-2011.02075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-mixing-of-glauber-dynamics-entropy-factorization-via-high-dimensional-expansion-2011.02075"/></url>
<url><loc>https://scifaro.com/en/abs/between-proper-and-strong-edge-colorings-of-subcubic-graphs-2011.02175</loc><lastmod>2022-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/between-proper-and-strong-edge-colorings-of-subcubic-graphs-2011.02175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/between-proper-and-strong-edge-colorings-of-subcubic-graphs-2011.02175"/></url>
<url><loc>https://scifaro.com/en/abs/sharp-thresholds-in-random-simple-temporal-graphs-2011.03738</loc><lastmod>2023-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharp-thresholds-in-random-simple-temporal-graphs-2011.03738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharp-thresholds-in-random-simple-temporal-graphs-2011.03738"/></url>
<url><loc>https://scifaro.com/en/abs/the-harmonic-indel-distance-2011.04072</loc><lastmod>2024-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-harmonic-indel-distance-2011.04072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-harmonic-indel-distance-2011.04072"/></url>
<url><loc>https://scifaro.com/en/abs/face-dimensions-of-general-purpose-cutting-planes-for-mixed-integer-linear-programs-2011.06076</loc><lastmod>2020-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/face-dimensions-of-general-purpose-cutting-planes-for-mixed-integer-linear-programs-2011.06076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/face-dimensions-of-general-purpose-cutting-planes-for-mixed-integer-linear-programs-2011.06076"/></url>
<url><loc>https://scifaro.com/en/abs/focal-points-and-their-implications-for-m-obius-transforms-and-dempster-shafer-theory-2011.06549</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focal-points-and-their-implications-for-m-obius-transforms-and-dempster-shafer-theory-2011.06549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focal-points-and-their-implications-for-m-obius-transforms-and-dempster-shafer-theory-2011.06549"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-vertex-coloring-heuristic-and-corresponding-chromatic-number-2011.07295</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-vertex-coloring-heuristic-and-corresponding-chromatic-number-2011.07295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-vertex-coloring-heuristic-and-corresponding-chromatic-number-2011.07295"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-connected-graph-partitions-via-recombination-2011.07378</loc><lastmod>2020-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-connected-graph-partitions-via-recombination-2011.07378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-connected-graph-partitions-via-recombination-2011.07378"/></url>
<url><loc>https://scifaro.com/en/abs/on-sets-of-indefinitely-desubstitutable-words-2011.07838</loc><lastmod>2020-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sets-of-indefinitely-desubstitutable-words-2011.07838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sets-of-indefinitely-desubstitutable-words-2011.07838"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-random-walks-on-graphs-mixing-few-to-cover-many-2011.07893</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-random-walks-on-graphs-mixing-few-to-cover-many-2011.07893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-random-walks-on-graphs-mixing-few-to-cover-many-2011.07893"/></url>
<url><loc>https://scifaro.com/en/abs/on-k-rainbow-domination-in-middle-graphs-2011.08635</loc><lastmod>2020-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-k-rainbow-domination-in-middle-graphs-2011.08635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-k-rainbow-domination-in-middle-graphs-2011.08635"/></url>
<url><loc>https://scifaro.com/en/abs/a-polyhedral-study-for-the-cubic-formulation-of-the-unconstrained-traveling-tournament-problem-2011.09135</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polyhedral-study-for-the-cubic-formulation-of-the-unconstrained-traveling-tournament-problem-2011.09135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polyhedral-study-for-the-cubic-formulation-of-the-unconstrained-traveling-tournament-problem-2011.09135"/></url>
<url><loc>https://scifaro.com/en/abs/isoperimetric-inequalities-for-real-valued-functions-with-applications-to-monotonicity-testing-2011.09441</loc><lastmod>2020-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isoperimetric-inequalities-for-real-valued-functions-with-applications-to-monotonicity-testing-2011.09441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isoperimetric-inequalities-for-real-valued-functions-with-applications-to-monotonicity-testing-2011.09441"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-geometry-of-symmetry-breaking-inequalities-2011.09641</loc><lastmod>2021-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-geometry-of-symmetry-breaking-inequalities-2011.09641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-geometry-of-symmetry-breaking-inequalities-2011.09641"/></url>
<url><loc>https://scifaro.com/en/abs/graph-tikhonov-regularization-and-interpolation-via-random-spanning-forests-2011.10450</loc><lastmod>2022-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-tikhonov-regularization-and-interpolation-via-random-spanning-forests-2011.10450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-tikhonov-regularization-and-interpolation-via-random-spanning-forests-2011.10450"/></url>
<url><loc>https://scifaro.com/en/abs/the-connected-domination-number-of-grids-2011.11328</loc><lastmod>2020-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-connected-domination-number-of-grids-2011.11328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-connected-domination-number-of-grids-2011.11328"/></url>
<url><loc>https://scifaro.com/en/abs/fiedler-vector-analysis-for-particular-cases-of-connected-graphs-2011.12369</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fiedler-vector-analysis-for-particular-cases-of-connected-graphs-2011.12369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fiedler-vector-analysis-for-particular-cases-of-connected-graphs-2011.12369"/></url>
<url><loc>https://scifaro.com/en/abs/the-hydrostructure-a-universal-framework-for-safe-and-complete-algorithms-for-genome-assembly-2011.12635</loc><lastmod>2021-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hydrostructure-a-universal-framework-for-safe-and-complete-algorithms-for-genome-assembly-2011.12635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hydrostructure-a-universal-framework-for-safe-and-complete-algorithms-for-genome-assembly-2011.12635"/></url>
<url><loc>https://scifaro.com/en/abs/synchronized-traveling-salesman-problem-2012.00311</loc><lastmod>2020-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synchronized-traveling-salesman-problem-2012.00311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synchronized-traveling-salesman-problem-2012.00311"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-inspired-classical-algorithm-for-slow-feature-analysis-2012.00824</loc><lastmod>2020-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-inspired-classical-algorithm-for-slow-feature-analysis-2012.00824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-inspired-classical-algorithm-for-slow-feature-analysis-2012.00824"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-dependency-structure-for-random-graphs-and-its-effect-on-monotone-properties-2012.02050</loc><lastmod>2020-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-dependency-structure-for-random-graphs-and-its-effect-on-monotone-properties-2012.02050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-dependency-structure-for-random-graphs-and-its-effect-on-monotone-properties-2012.02050"/></url>
<url><loc>https://scifaro.com/en/abs/a-sat-based-resolution-of-lam-s-problem-2012.04715</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sat-based-resolution-of-lam-s-problem-2012.04715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sat-based-resolution-of-lam-s-problem-2012.04715"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-depth-optimum-circuits-for-adders-and-and-or-paths-2012.05550</loc><lastmod>2020-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-depth-optimum-circuits-for-adders-and-and-or-paths-2012.05550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-depth-optimum-circuits-for-adders-and-and-or-paths-2012.05550"/></url>
<url><loc>https://scifaro.com/en/abs/concerning-iterative-graph-normalization-and-maximum-weight-independent-sets-2012.07764</loc><lastmod>2020-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concerning-iterative-graph-normalization-and-maximum-weight-independent-sets-2012.07764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concerning-iterative-graph-normalization-and-maximum-weight-independent-sets-2012.07764"/></url>
<url><loc>https://scifaro.com/en/abs/on-entropies-of-block-gluing-subshifts-2012.09415</loc><lastmod>2020-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-entropies-of-block-gluing-subshifts-2012.09415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-entropies-of-block-gluing-subshifts-2012.09415"/></url>
<url><loc>https://scifaro.com/en/abs/hedge-connectivity-without-hedge-overlaps-2012.10600</loc><lastmod>2020-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hedge-connectivity-without-hedge-overlaps-2012.10600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hedge-connectivity-without-hedge-overlaps-2012.10600"/></url>
<url><loc>https://scifaro.com/en/abs/recoloring-graphs-of-treewidth-2-2012.11459</loc><lastmod>2020-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recoloring-graphs-of-treewidth-2-2012.11459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recoloring-graphs-of-treewidth-2-2012.11459"/></url>
<url><loc>https://scifaro.com/en/abs/computing-directed-steiner-path-covers-2012.12232</loc><lastmod>2020-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-directed-steiner-path-covers-2012.12232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-directed-steiner-path-covers-2012.12232"/></url>
<url><loc>https://scifaro.com/en/abs/avoiding-monochromatic-rectangles-using-shift-patterns-2012.12582</loc><lastmod>2020-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoiding-monochromatic-rectangles-using-shift-patterns-2012.12582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoiding-monochromatic-rectangles-using-shift-patterns-2012.12582"/></url>
<url><loc>https://scifaro.com/en/abs/ptas-for-sparse-general-valued-csps-2012.12607</loc><lastmod>2023-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ptas-for-sparse-general-valued-csps-2012.12607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ptas-for-sparse-general-valued-csps-2012.12607"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-conditions-of-absorption-property-for-morphological-opening-and-closing-2012.13132</loc><lastmod>2020-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-conditions-of-absorption-property-for-morphological-opening-and-closing-2012.13132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-conditions-of-absorption-property-for-morphological-opening-and-closing-2012.13132"/></url>
<url><loc>https://scifaro.com/en/abs/graph-theory-in-the-classification-of-information-systems-2012.13182</loc><lastmod>2020-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-theory-in-the-classification-of-information-systems-2012.13182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-theory-in-the-classification-of-information-systems-2012.13182"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-method-to-minimize-couple-matchings-2012.14674</loc><lastmod>2023-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-method-to-minimize-couple-matchings-2012.14674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-method-to-minimize-couple-matchings-2012.14674"/></url>
<url><loc>https://scifaro.com/en/abs/finding-efficient-domination-for-p-8-free-bipartite-graphs-in-polynomial-time-2101.01772</loc><lastmod>2021-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-efficient-domination-for-p-8-free-bipartite-graphs-in-polynomial-time-2101.01772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-efficient-domination-for-p-8-free-bipartite-graphs-in-polynomial-time-2101.01772"/></url>
<url><loc>https://scifaro.com/en/abs/counting-independent-sets-in-strongly-orderable-graphs-2101.01997</loc><lastmod>2021-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-independent-sets-in-strongly-orderable-graphs-2101.01997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-independent-sets-in-strongly-orderable-graphs-2101.01997"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-domination-roman-domination-and-perfect-roman-domination-in-lexicographic-product-graphs-2101.02023</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-domination-roman-domination-and-perfect-roman-domination-in-lexicographic-product-graphs-2101.02023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-domination-roman-domination-and-perfect-roman-domination-in-lexicographic-product-graphs-2101.02023"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-recognition-of-strong-robinsonian-incomplete-matrices-2101.03033</loc><lastmod>2021-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-recognition-of-strong-robinsonian-incomplete-matrices-2101.03033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-recognition-of-strong-robinsonian-incomplete-matrices-2101.03033"/></url>
<url><loc>https://scifaro.com/en/abs/freezing-sandpiles-and-boolean-threshold-networks-equivalence-and-complexity-2101.04204</loc><lastmod>2021-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/freezing-sandpiles-and-boolean-threshold-networks-equivalence-and-complexity-2101.04204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/freezing-sandpiles-and-boolean-threshold-networks-equivalence-and-complexity-2101.04204"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-the-expected-value-of-a-lottery-ticket-how-to-sell-and-when-to-buy-2101.04242</loc><lastmod>2021-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-the-expected-value-of-a-lottery-ticket-how-to-sell-and-when-to-buy-2101.04242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-the-expected-value-of-a-lottery-ticket-how-to-sell-and-when-to-buy-2101.04242"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-method-for-generating-discrete-orthogonal-matrices-2101.05438</loc><lastmod>2021-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-method-for-generating-discrete-orthogonal-matrices-2101.05438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-method-for-generating-discrete-orthogonal-matrices-2101.05438"/></url>
<url><loc>https://scifaro.com/en/abs/time-critical-testing-and-search-problems-2101.05473</loc><lastmod>2021-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-critical-testing-and-search-problems-2101.05473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-critical-testing-and-search-problems-2101.05473"/></url>
<url><loc>https://scifaro.com/en/abs/enhancing-security-via-deliberate-unpredictability-of-solutions-in-optimisation-2101.06243</loc><lastmod>2021-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enhancing-security-via-deliberate-unpredictability-of-solutions-in-optimisation-2101.06243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enhancing-security-via-deliberate-unpredictability-of-solutions-in-optimisation-2101.06243"/></url>
<url><loc>https://scifaro.com/en/abs/on-unimodality-of-independence-polynomials-of-trees-2101.06744</loc><lastmod>2022-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-unimodality-of-independence-polynomials-of-trees-2101.06744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-unimodality-of-independence-polynomials-of-trees-2101.06744"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-price-of-bandit-feedback-for-mistake-bounded-online-learning-2101.06891</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-price-of-bandit-feedback-for-mistake-bounded-online-learning-2101.06891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-price-of-bandit-feedback-for-mistake-bounded-online-learning-2101.06891"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-3rd-annual-international-applied-category-theory-conference-2020-2101.07888</loc><lastmod>2021-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-3rd-annual-international-applied-category-theory-conference-2020-2101.07888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-3rd-annual-international-applied-category-theory-conference-2020-2101.07888"/></url>
<url><loc>https://scifaro.com/en/abs/alpha-beta-modules-in-graphs-2101.08881</loc><lastmod>2021-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alpha-beta-modules-in-graphs-2101.08881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alpha-beta-modules-in-graphs-2101.08881"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-framework-for-loss-distribution-of-smart-contract-risk-2101.08964</loc><lastmod>2021-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-framework-for-loss-distribution-of-smart-contract-risk-2101.08964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-framework-for-loss-distribution-of-smart-contract-risk-2101.08964"/></url>
<url><loc>https://scifaro.com/en/abs/rikudo-is-np-complete-2101.09332</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rikudo-is-np-complete-2101.09332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rikudo-is-np-complete-2101.09332"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-monotone-recognition-in-multi-valued-grids-2101.09749</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-monotone-recognition-in-multi-valued-grids-2101.09749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-monotone-recognition-in-multi-valued-grids-2101.09749"/></url>
<url><loc>https://scifaro.com/en/abs/study-of-graph-theory-distributed-average-consensus-algorithm-and-centralized-algorithm-2101.10523</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/study-of-graph-theory-distributed-average-consensus-algorithm-and-centralized-algorithm-2101.10523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/study-of-graph-theory-distributed-average-consensus-algorithm-and-centralized-algorithm-2101.10523"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-rulial-space-the-case-of-turing-machines-2101.10907</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-rulial-space-the-case-of-turing-machines-2101.10907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-rulial-space-the-case-of-turing-machines-2101.10907"/></url>
<url><loc>https://scifaro.com/en/abs/logical-combinatorial-approaches-in-dynamic-recognition-problems-2101.11066</loc><lastmod>2021-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-combinatorial-approaches-in-dynamic-recognition-problems-2101.11066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-combinatorial-approaches-in-dynamic-recognition-problems-2101.11066"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-in-graphs-of-convex-sets-2101.11565</loc><lastmod>2024-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-in-graphs-of-convex-sets-2101.11565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-in-graphs-of-convex-sets-2101.11565"/></url>
<url><loc>https://scifaro.com/en/abs/the-iterated-local-transitivity-model-for-hypergraphs-2101.12560</loc><lastmod>2021-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-iterated-local-transitivity-model-for-hypergraphs-2101.12560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-iterated-local-transitivity-model-for-hypergraphs-2101.12560"/></url>
<url><loc>https://scifaro.com/en/abs/new-formulation-for-coloring-circle-graphs-and-its-application-to-capacitated-stowage-stack-minimization-2102.00691</loc><lastmod>2025-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-formulation-for-coloring-circle-graphs-and-its-application-to-capacitated-stowage-stack-minimization-2102.00691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-formulation-for-coloring-circle-graphs-and-its-application-to-capacitated-stowage-stack-minimization-2102.00691"/></url>
<url><loc>https://scifaro.com/en/abs/faulty-picture-hanging-improved-2102.00984</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faulty-picture-hanging-improved-2102.00984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faulty-picture-hanging-improved-2102.00984"/></url>
<url><loc>https://scifaro.com/en/abs/all-subgraphs-of-a-wheel-are-5-coupled-choosable-2102.02918</loc><lastmod>2021-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-subgraphs-of-a-wheel-are-5-coupled-choosable-2102.02918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-subgraphs-of-a-wheel-are-5-coupled-choosable-2102.02918"/></url>
<url><loc>https://scifaro.com/en/abs/complex-networks-of-functions-2102.03320</loc><lastmod>2021-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complex-networks-of-functions-2102.03320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complex-networks-of-functions-2102.03320"/></url>
<url><loc>https://scifaro.com/en/abs/growth-functions-rates-and-classes-of-string-based-multiway-systems-2102.03321</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/growth-functions-rates-and-classes-of-string-based-multiway-systems-2102.03321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/growth-functions-rates-and-classes-of-string-based-multiway-systems-2102.03321"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-circulant-graphs-2102.04094</loc><lastmod>2021-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-circulant-graphs-2102.04094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-broadcast-independence-number-of-circulant-graphs-2102.04094"/></url>
<url><loc>https://scifaro.com/en/abs/a-strongly-universal-cellular-automaton-on-the-heptagrid-with-seven-states-2102.04292</loc><lastmod>2021-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strongly-universal-cellular-automaton-on-the-heptagrid-with-seven-states-2102.04292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strongly-universal-cellular-automaton-on-the-heptagrid-with-seven-states-2102.04292"/></url>
<url><loc>https://scifaro.com/en/abs/prophet-matching-meets-probing-with-commitment-2102.04325</loc><lastmod>2021-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prophet-matching-meets-probing-with-commitment-2102.04325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prophet-matching-meets-probing-with-commitment-2102.04325"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-on-the-integraliy-ratio-of-the-subtour-lp-for-the-traveling-salesman-problem-2102.04765</loc><lastmod>2021-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-on-the-integraliy-ratio-of-the-subtour-lp-for-the-traveling-salesman-problem-2102.04765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-on-the-integraliy-ratio-of-the-subtour-lp-for-the-traveling-salesman-problem-2102.04765"/></url>
<url><loc>https://scifaro.com/en/abs/multi-level-weighted-additive-spanners-2102.05831</loc><lastmod>2021-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-level-weighted-additive-spanners-2102.05831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-level-weighted-additive-spanners-2102.05831"/></url>
<url><loc>https://scifaro.com/en/abs/a-more-accurate-view-of-the-flat-wall-theorem-2102.06463</loc><lastmod>2022-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-more-accurate-view-of-the-flat-wall-theorem-2102.06463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-more-accurate-view-of-the-flat-wall-theorem-2102.06463"/></url>
<url><loc>https://scifaro.com/en/abs/dominance-inequalities-for-scheduling-around-an-unrestrictive-common-due-date-2102.07382</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dominance-inequalities-for-scheduling-around-an-unrestrictive-common-due-date-2102.07382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dominance-inequalities-for-scheduling-around-an-unrestrictive-common-due-date-2102.07382"/></url>
<url><loc>https://scifaro.com/en/abs/roman-domination-of-the-comet-double-comet-and-comb-graphs-2102.07902</loc><lastmod>2021-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/roman-domination-of-the-comet-double-comet-and-comb-graphs-2102.07902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/roman-domination-of-the-comet-double-comet-and-comb-graphs-2102.07902"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-random-walks-on-dynamic-graphs-2102.08002</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-random-walks-on-dynamic-graphs-2102.08002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-random-walks-on-dynamic-graphs-2102.08002"/></url>
<url><loc>https://scifaro.com/en/abs/scheduling-with-machine-conflicts-2102.08231</loc><lastmod>2021-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scheduling-with-machine-conflicts-2102.08231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scheduling-with-machine-conflicts-2102.08231"/></url>
<url><loc>https://scifaro.com/en/abs/k-critical-trees-and-k-minimal-trees-2102.08461</loc><lastmod>2021-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-critical-trees-and-k-minimal-trees-2102.08461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-critical-trees-and-k-minimal-trees-2102.08461"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-gapped-kmer-filters-for-robust-frequency-estimation-2102.10682</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-gapped-kmer-filters-for-robust-frequency-estimation-2102.10682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-gapped-kmer-filters-for-robust-frequency-estimation-2102.10682"/></url>
<url><loc>https://scifaro.com/en/abs/improving-gebauer-s-construction-of-3-chromatic-hypergraphs-with-few-edges-2102.11674</loc><lastmod>2021-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-gebauer-s-construction-of-3-chromatic-hypergraphs-with-few-edges-2102.11674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-gebauer-s-construction-of-3-chromatic-hypergraphs-with-few-edges-2102.11674"/></url>
<url><loc>https://scifaro.com/en/abs/graph-exploration-by-energy-sharing-mobile-agents-2102.13062</loc><lastmod>2021-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-exploration-by-energy-sharing-mobile-agents-2102.13062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-exploration-by-energy-sharing-mobile-agents-2102.13062"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-spanning-tree-cycle-intersection-problem-2102.13193</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-spanning-tree-cycle-intersection-problem-2102.13193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-spanning-tree-cycle-intersection-problem-2102.13193"/></url>
<url><loc>https://scifaro.com/en/abs/can-romeo-and-juliet-meet-or-rendezvous-games-with-adversaries-on-graphs-2102.13409</loc><lastmod>2021-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/can-romeo-and-juliet-meet-or-rendezvous-games-with-adversaries-on-graphs-2102.13409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/can-romeo-and-juliet-meet-or-rendezvous-games-with-adversaries-on-graphs-2102.13409"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-approximation-ratio-of-the-3-opt-algorithm-for-the-1-2-tsp-2103.00504</loc><lastmod>2021-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-approximation-ratio-of-the-3-opt-algorithm-for-the-1-2-tsp-2103.00504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-approximation-ratio-of-the-3-opt-algorithm-for-the-1-2-tsp-2103.00504"/></url>
<url><loc>https://scifaro.com/en/abs/nested-vehicle-routing-problem-optimizing-drone-truck-surveillance-operations-2103.01528</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-vehicle-routing-problem-optimizing-drone-truck-surveillance-operations-2103.01528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-vehicle-routing-problem-optimizing-drone-truck-surveillance-operations-2103.01528"/></url>
<url><loc>https://scifaro.com/en/abs/block-elimination-distance-2103.01872</loc><lastmod>2021-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/block-elimination-distance-2103.01872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/block-elimination-distance-2103.01872"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-multipartite-graph-series-arising-from-complex-network-modelling-2103.04447</loc><lastmod>2021-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-multipartite-graph-series-arising-from-complex-network-modelling-2103.04447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-multipartite-graph-series-arising-from-complex-network-modelling-2103.04447"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-termination-of-some-biclique-operators-on-multipartite-graphs-2103.04451</loc><lastmod>2021-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-termination-of-some-biclique-operators-on-multipartite-graphs-2103.04451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-termination-of-some-biclique-operators-on-multipartite-graphs-2103.04451"/></url>
<url><loc>https://scifaro.com/en/abs/non-ambiguous-trees-new-results-and-generalisation-full-version-2103.07294</loc><lastmod>2021-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-ambiguous-trees-new-results-and-generalisation-full-version-2103.07294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-ambiguous-trees-new-results-and-generalisation-full-version-2103.07294"/></url>
<url><loc>https://scifaro.com/en/abs/k-o-nigsberg-sightseeing-eulerian-walks-in-temporal-graphs-2103.07522</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-o-nigsberg-sightseeing-eulerian-walks-in-temporal-graphs-2103.07522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-o-nigsberg-sightseeing-eulerian-walks-in-temporal-graphs-2103.07522"/></url>
<url><loc>https://scifaro.com/en/abs/open-independent-open-locating-dominating-sets-structural-aspects-of-some-classes-of-graphs-2103.07972</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-independent-open-locating-dominating-sets-structural-aspects-of-some-classes-of-graphs-2103.07972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-independent-open-locating-dominating-sets-structural-aspects-of-some-classes-of-graphs-2103.07972"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-communication-complexity-problem-in-combinatorial-number-theory-2103.08174</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-communication-complexity-problem-in-combinatorial-number-theory-2103.08174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-communication-complexity-problem-in-combinatorial-number-theory-2103.08174"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-number-of-steps-of-topswops-on-18-and-19-cards-2103.08346</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-number-of-steps-of-topswops-on-18-and-19-cards-2103.08346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-number-of-steps-of-topswops-on-18-and-19-cards-2103.08346"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-metatheorems-for-classes-with-bounded-expansion-2103.08698</loc><lastmod>2021-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-metatheorems-for-classes-with-bounded-expansion-2103.08698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-metatheorems-for-classes-with-bounded-expansion-2103.08698"/></url>
<url><loc>https://scifaro.com/en/abs/on-additive-spanners-in-weighted-graphs-with-local-error-2103.09731</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-additive-spanners-in-weighted-graphs-with-local-error-2103.09731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-additive-spanners-in-weighted-graphs-with-local-error-2103.09731"/></url>
<url><loc>https://scifaro.com/en/abs/the-equidistribution-of-some-mahonian-statistics-over-permutations-avoiding-a-pattern-of-length-three-2103.10357</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-equidistribution-of-some-mahonian-statistics-over-permutations-avoiding-a-pattern-of-length-three-2103.10357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-equidistribution-of-some-mahonian-statistics-over-permutations-avoiding-a-pattern-of-length-three-2103.10357"/></url>
<url><loc>https://scifaro.com/en/abs/a-systematic-association-of-subgraph-counts-over-a-network-2103.10838</loc><lastmod>2021-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-systematic-association-of-subgraph-counts-over-a-network-2103.10838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-systematic-association-of-subgraph-counts-over-a-network-2103.10838"/></url>
<url><loc>https://scifaro.com/en/abs/integer-and-constraint-programming-revisited-for-mutually-orthogonal-latin-squares-2103.11018</loc><lastmod>2021-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-and-constraint-programming-revisited-for-mutually-orthogonal-latin-squares-2103.11018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-and-constraint-programming-revisited-for-mutually-orthogonal-latin-squares-2103.11018"/></url>
<url><loc>https://scifaro.com/en/abs/from-coupling-to-spectral-independence-and-blackbox-comparison-with-the-down-up-walk-2103.11609</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-coupling-to-spectral-independence-and-blackbox-comparison-with-the-down-up-walk-2103.11609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-coupling-to-spectral-independence-and-blackbox-comparison-with-the-down-up-walk-2103.11609"/></url>
<url><loc>https://scifaro.com/en/abs/approximately-counting-answers-to-conjunctive-queries-with-disequalities-and-negations-2103.12468</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximately-counting-answers-to-conjunctive-queries-with-disequalities-and-negations-2103.12468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximately-counting-answers-to-conjunctive-queries-with-disequalities-and-negations-2103.12468"/></url>
<url><loc>https://scifaro.com/en/abs/some-properties-of-the-parking-function-poset-2103.14468</loc><lastmod>2023-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-properties-of-the-parking-function-poset-2103.14468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-properties-of-the-parking-function-poset-2103.14468"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-covering-two-vertex-multigraphs-with-semi-edges-2103.15214</loc><lastmod>2025-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-covering-two-vertex-multigraphs-with-semi-edges-2103.15214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-covering-two-vertex-multigraphs-with-semi-edges-2103.15214"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-completeness-criterion-in-three-valued-logic-in-terms-of-maximal-classes-2103.16631</loc><lastmod>2021-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-completeness-criterion-in-three-valued-logic-in-terms-of-maximal-classes-2103.16631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-completeness-criterion-in-three-valued-logic-in-terms-of-maximal-classes-2103.16631"/></url>
<url><loc>https://scifaro.com/en/abs/on-deeply-critical-oriented-cliques-2103.17140</loc><lastmod>2021-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-deeply-critical-oriented-cliques-2103.17140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-deeply-critical-oriented-cliques-2103.17140"/></url>
<url><loc>https://scifaro.com/en/abs/hereditary-rigidity-separation-and-density-in-memory-of-professor-i-g-rosenberg-2104.00292</loc><lastmod>2021-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hereditary-rigidity-separation-and-density-in-memory-of-professor-i-g-rosenberg-2104.00292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hereditary-rigidity-separation-and-density-in-memory-of-professor-i-g-rosenberg-2104.00292"/></url>
<url><loc>https://scifaro.com/en/abs/pareto-optimal-exchange-with-indifferent-endowments-2104.00465</loc><lastmod>2021-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pareto-optimal-exchange-with-indifferent-endowments-2104.00465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pareto-optimal-exchange-with-indifferent-endowments-2104.00465"/></url>
<url><loc>https://scifaro.com/en/abs/using-graph-theory-to-derive-inequalities-for-the-bell-numbers-2104.00552</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-graph-theory-to-derive-inequalities-for-the-bell-numbers-2104.00552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-graph-theory-to-derive-inequalities-for-the-bell-numbers-2104.00552"/></url>
<url><loc>https://scifaro.com/en/abs/a-strongly-universal-cellular-automaton-in-the-dodecagrid-with-five-states-2104.01561</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strongly-universal-cellular-automaton-in-the-dodecagrid-with-five-states-2104.01561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strongly-universal-cellular-automaton-in-the-dodecagrid-with-five-states-2104.01561"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-chain-multiplication-and-polygon-triangulation-revisited-and-generalized-2104.01777</loc><lastmod>2021-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-chain-multiplication-and-polygon-triangulation-revisited-and-generalized-2104.01777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-chain-multiplication-and-polygon-triangulation-revisited-and-generalized-2104.01777"/></url>
<url><loc>https://scifaro.com/en/abs/a-cycle-joining-construction-of-the-prefer-max-de-bruijn-sequence-2104.02999</loc><lastmod>2021-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cycle-joining-construction-of-the-prefer-max-de-bruijn-sequence-2104.02999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cycle-joining-construction-of-the-prefer-max-de-bruijn-sequence-2104.02999"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-models-and-forbidden-pattern-characterizations-for-2-thin-and-proper-2-thin-graphs-2104.03937</loc><lastmod>2023-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-models-and-forbidden-pattern-characterizations-for-2-thin-and-proper-2-thin-graphs-2104.03937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-models-and-forbidden-pattern-characterizations-for-2-thin-and-proper-2-thin-graphs-2104.03937"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-unification-of-the-graph-edit-distance-and-graph-matching-problems-2104.06186</loc><lastmod>2021-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-unification-of-the-graph-edit-distance-and-graph-matching-problems-2104.06186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-unification-of-the-graph-edit-distance-and-graph-matching-problems-2104.06186"/></url>
<url><loc>https://scifaro.com/en/abs/tight-lower-bound-for-average-number-of-terms-in-optimal-double-base-number-system-2104.06222</loc><lastmod>2021-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-lower-bound-for-average-number-of-terms-in-optimal-double-base-number-system-2104.06222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-lower-bound-for-average-number-of-terms-in-optimal-double-base-number-system-2104.06222"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-substructures-in-formal-concept-analysis-2104.07159</loc><lastmod>2021-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-substructures-in-formal-concept-analysis-2104.07159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-substructures-in-formal-concept-analysis-2104.07159"/></url>
<url><loc>https://scifaro.com/en/abs/new-formulations-and-branch-and-cut-procedures-for-the-longest-induced-path-problem-2104.09227</loc><lastmod>2021-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-formulations-and-branch-and-cut-procedures-for-the-longest-induced-path-problem-2104.09227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-formulations-and-branch-and-cut-procedures-for-the-longest-induced-path-problem-2104.09227"/></url>
<url><loc>https://scifaro.com/en/abs/on-sublinear-approximations-for-the-petersen-coloring-conjecture-2104.09241</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sublinear-approximations-for-the-petersen-coloring-conjecture-2104.09241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sublinear-approximations-for-the-petersen-coloring-conjecture-2104.09241"/></url>
<url><loc>https://scifaro.com/en/abs/a-separation-of-gamma-and-b-via-thue-morse-words-2104.09985</loc><lastmod>2021-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-separation-of-gamma-and-b-via-thue-morse-words-2104.09985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-separation-of-gamma-and-b-via-thue-morse-words-2104.09985"/></url>
<url><loc>https://scifaro.com/en/abs/lacon-shrub-and-parity-decompositions-characterizing-transductions-of-bounded-expansion-classes-2104.10446</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lacon-shrub-and-parity-decompositions-characterizing-transductions-of-bounded-expansion-classes-2104.10446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lacon-shrub-and-parity-decompositions-characterizing-transductions-of-bounded-expansion-classes-2104.10446"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-the-partial-vertex-cover-problem-with-a-matching-constraint-in-edge-weighted-bipartite-graphs-2104.11215</loc><lastmod>2021-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-the-partial-vertex-cover-problem-with-a-matching-constraint-in-edge-weighted-bipartite-graphs-2104.11215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-the-partial-vertex-cover-problem-with-a-matching-constraint-in-edge-weighted-bipartite-graphs-2104.11215"/></url>
<url><loc>https://scifaro.com/en/abs/the-1-1-algorithm-for-travelling-salesman-problem-2104.13197</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-1-1-algorithm-for-travelling-salesman-problem-2104.13197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-1-1-algorithm-for-travelling-salesman-problem-2104.13197"/></url>
<url><loc>https://scifaro.com/en/abs/compatibility-of-partitions-with-trees-hierarchies-and-split-systems-2104.14146</loc><lastmod>2021-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compatibility-of-partitions-with-trees-hierarchies-and-split-systems-2104.14146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compatibility-of-partitions-with-trees-hierarchies-and-split-systems-2104.14146"/></url>
<url><loc>https://scifaro.com/en/abs/graph-similarity-and-homomorphism-densities-2104.14213</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-similarity-and-homomorphism-densities-2104.14213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-similarity-and-homomorphism-densities-2104.14213"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-recognizing-integrality-and-total-dual-integrality-of-the-0-1-2-closure-2104.14486</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-recognizing-integrality-and-total-dual-integrality-of-the-0-1-2-closure-2104.14486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-recognizing-integrality-and-total-dual-integrality-of-the-0-1-2-closure-2104.14486"/></url>
<url><loc>https://scifaro.com/en/abs/pattern-complexity-of-aperiodic-substitutive-subshifts-2105.00784</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pattern-complexity-of-aperiodic-substitutive-subshifts-2105.00784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pattern-complexity-of-aperiodic-substitutive-subshifts-2105.00784"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-of-parallelogram-polycubes-2105.00971</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-of-parallelogram-polycubes-2105.00971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-of-parallelogram-polycubes-2105.00971"/></url>
<url><loc>https://scifaro.com/en/abs/makespan-trade-offs-for-visiting-triangle-edges-2105.01191</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/makespan-trade-offs-for-visiting-triangle-edges-2105.01191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/makespan-trade-offs-for-visiting-triangle-edges-2105.01191"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-binary-morphisms-generating-lyndon-infinite-words-2105.01327</loc><lastmod>2021-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-binary-morphisms-generating-lyndon-infinite-words-2105.01327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-binary-morphisms-generating-lyndon-infinite-words-2105.01327"/></url>
<url><loc>https://scifaro.com/en/abs/novel-algorithm-for-computing-all-pairs-homogeneity-arc-binary-state-undirected-network-reliability-2105.01500</loc><lastmod>2021-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/novel-algorithm-for-computing-all-pairs-homogeneity-arc-binary-state-undirected-network-reliability-2105.01500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/novel-algorithm-for-computing-all-pairs-homogeneity-arc-binary-state-undirected-network-reliability-2105.01500"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-subgraph-on-disturbed-network-2105.02600</loc><lastmod>2021-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-subgraph-on-disturbed-network-2105.02600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-subgraph-on-disturbed-network-2105.02600"/></url>
<url><loc>https://scifaro.com/en/abs/searching-by-heterogeneous-agents-2105.02609</loc><lastmod>2024-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-by-heterogeneous-agents-2105.02609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-by-heterogeneous-agents-2105.02609"/></url>
<url><loc>https://scifaro.com/en/abs/topology-and-routing-problems-the-circular-frame-2105.03386</loc><lastmod>2021-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-and-routing-problems-the-circular-frame-2105.03386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-and-routing-problems-the-circular-frame-2105.03386"/></url>
<url><loc>https://scifaro.com/en/abs/discrepancy-and-sparsity-2105.03693</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrepancy-and-sparsity-2105.03693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrepancy-and-sparsity-2105.03693"/></url>
<url><loc>https://scifaro.com/en/abs/multi-layered-planar-firefighting-2105.03759</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-layered-planar-firefighting-2105.03759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-layered-planar-firefighting-2105.03759"/></url>
<url><loc>https://scifaro.com/en/abs/a-euclidean-distance-matrix-model-for-convex-clustering-2105.04947</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-euclidean-distance-matrix-model-for-convex-clustering-2105.04947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-euclidean-distance-matrix-model-for-convex-clustering-2105.04947"/></url>
<url><loc>https://scifaro.com/en/abs/a-stronger-lower-bound-on-parametric-minimum-spanning-trees-2105.05371</loc><lastmod>2021-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-stronger-lower-bound-on-parametric-minimum-spanning-trees-2105.05371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-stronger-lower-bound-on-parametric-minimum-spanning-trees-2105.05371"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphic-unordered-labeled-trees-up-to-substitution-ciphering-2105.05685</loc><lastmod>2022-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphic-unordered-labeled-trees-up-to-substitution-ciphering-2105.05685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphic-unordered-labeled-trees-up-to-substitution-ciphering-2105.05685"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-limited-visibility-graph-searching-2105.06150</loc><lastmod>2021-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-limited-visibility-graph-searching-2105.06150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-limited-visibility-graph-searching-2105.06150"/></url>
<url><loc>https://scifaro.com/en/abs/lexicographic-enumeration-of-set-partitions-2105.07472</loc><lastmod>2021-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lexicographic-enumeration-of-set-partitions-2105.07472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lexicographic-enumeration-of-set-partitions-2105.07472"/></url>
<url><loc>https://scifaro.com/en/abs/infinitely-growing-configurations-in-emil-post-s-tag-system-problem-2105.07529</loc><lastmod>2025-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitely-growing-configurations-in-emil-post-s-tag-system-problem-2105.07529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitely-growing-configurations-in-emil-post-s-tag-system-problem-2105.07529"/></url>
<url><loc>https://scifaro.com/en/abs/on-oriented-diameter-of-n-k-star-graphs-2105.08308</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-oriented-diameter-of-n-k-star-graphs-2105.08308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-oriented-diameter-of-n-k-star-graphs-2105.08308"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs-2105.08693</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs-2105.08693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs-2105.08693"/></url>
<url><loc>https://scifaro.com/en/abs/improved-product-based-high-dimensional-expanders-2105.09358</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-product-based-high-dimensional-expanders-2105.09358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-product-based-high-dimensional-expanders-2105.09358"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-super-stable-matchings-2105.09602</loc><lastmod>2021-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-super-stable-matchings-2105.09602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-super-stable-matchings-2105.09602"/></url>
<url><loc>https://scifaro.com/en/abs/total-coloring-and-total-matching-polyhedra-and-facets-2105.09827</loc><lastmod>2022-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-coloring-and-total-matching-polyhedra-and-facets-2105.09827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-coloring-and-total-matching-polyhedra-and-facets-2105.09827"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-boolean-functions-2105.10386</loc><lastmod>2021-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-boolean-functions-2105.10386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-boolean-functions-2105.10386"/></url>
<url><loc>https://scifaro.com/en/abs/on-finding-separators-in-temporal-split-and-permutation-graphs-2105.12003</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finding-separators-in-temporal-split-and-permutation-graphs-2105.12003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finding-separators-in-temporal-split-and-permutation-graphs-2105.12003"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-polymorphisms-2106.00093</loc><lastmod>2021-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-polymorphisms-2106.00093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-polymorphisms-2106.00093"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-and-exact-results-for-the-harmonious-chromatic-number-2106.00278</loc><lastmod>2021-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-and-exact-results-for-the-harmonious-chromatic-number-2106.00278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-and-exact-results-for-the-harmonious-chromatic-number-2106.00278"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-network-coloring-game-a-randomized-distributed-delta-1-coloring-algorithm-2106.00402</loc><lastmod>2022-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-network-coloring-game-a-randomized-distributed-delta-1-coloring-algorithm-2106.00402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-network-coloring-game-a-randomized-distributed-delta-1-coloring-algorithm-2106.00402"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-sets-of-questions-for-twenty-questions-2106.01737</loc><lastmod>2024-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-sets-of-questions-for-twenty-questions-2106.01737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-sets-of-questions-for-twenty-questions-2106.01737"/></url>
<url><loc>https://scifaro.com/en/abs/upward-planar-drawings-with-two-slopes-2106.02839</loc><lastmod>2022-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upward-planar-drawings-with-two-slopes-2106.02839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upward-planar-drawings-with-two-slopes-2106.02839"/></url>
<url><loc>https://scifaro.com/en/abs/lifts-for-voronoi-cells-of-lattices-2106.04432</loc><lastmod>2021-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifts-for-voronoi-cells-of-lattices-2106.04432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifts-for-voronoi-cells-of-lattices-2106.04432"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-two-choices-in-graphical-allocation-2106.06051</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-two-choices-in-graphical-allocation-2106.06051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-two-choices-in-graphical-allocation-2106.06051"/></url>
<url><loc>https://scifaro.com/en/abs/rice-s-theorem-for-generic-limit-sets-of-cellular-automata-2106.07907</loc><lastmod>2021-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rice-s-theorem-for-generic-limit-sets-of-cellular-automata-2106.07907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rice-s-theorem-for-generic-limit-sets-of-cellular-automata-2106.07907"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-two-bar-charts-packing-problem-2106.09919</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-two-bar-charts-packing-problem-2106.09919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-two-bar-charts-packing-problem-2106.09919"/></url>
<url><loc>https://scifaro.com/en/abs/remarks-about-the-arithmetic-of-graphs-2106.10093</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/remarks-about-the-arithmetic-of-graphs-2106.10093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/remarks-about-the-arithmetic-of-graphs-2106.10093"/></url>
<url><loc>https://scifaro.com/en/abs/the-graphical-traveling-salesperson-problem-has-no-integer-programming-formulation-in-the-original-space-2106.10097</loc><lastmod>2021-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graphical-traveling-salesperson-problem-has-no-integer-programming-formulation-in-the-original-space-2106.10097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graphical-traveling-salesperson-problem-has-no-integer-programming-formulation-in-the-original-space-2106.10097"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-geometrical-computation-11-slanted-firing-squad-synchronisation-on-signal-machines-2106.11176</loc><lastmod>2021-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-geometrical-computation-11-slanted-firing-squad-synchronisation-on-signal-machines-2106.11176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-geometrical-computation-11-slanted-firing-squad-synchronisation-on-signal-machines-2106.11176"/></url>
<url><loc>https://scifaro.com/en/abs/forced-pairs-in-a-stick-graphs-2106.12249</loc><lastmod>2021-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forced-pairs-in-a-stick-graphs-2106.12249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forced-pairs-in-a-stick-graphs-2106.12249"/></url>
<url><loc>https://scifaro.com/en/abs/slack-matrices-k-products-and-2-level-polytopes-2106.12829</loc><lastmod>2021-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slack-matrices-k-products-and-2-level-polytopes-2106.12829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slack-matrices-k-products-and-2-level-polytopes-2106.12829"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-majority-tournaments-and-kemeny-ranking-with-2-dimensional-euclidean-preferences-2106.13054</loc><lastmod>2022-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-majority-tournaments-and-kemeny-ranking-with-2-dimensional-euclidean-preferences-2106.13054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-majority-tournaments-and-kemeny-ranking-with-2-dimensional-euclidean-preferences-2106.13054"/></url>
<url><loc>https://scifaro.com/en/abs/representing-polynomial-of-st-connectivity-2106.15018</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-polynomial-of-st-connectivity-2106.15018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-polynomial-of-st-connectivity-2106.15018"/></url>
<url><loc>https://scifaro.com/en/abs/twin-width-is-linear-in-the-poset-width-2106.15337</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twin-width-is-linear-in-the-poset-width-2106.15337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twin-width-is-linear-in-the-poset-width-2106.15337"/></url>
<url><loc>https://scifaro.com/en/abs/restricted-adaptivity-in-stochastic-scheduling-2106.15393</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/restricted-adaptivity-in-stochastic-scheduling-2106.15393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/restricted-adaptivity-in-stochastic-scheduling-2106.15393"/></url>
<url><loc>https://scifaro.com/en/abs/valid-inequalities-and-a-branch-and-cut-algorithm-for-the-routing-and-spectrum-allocation-problem-2106.15454</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/valid-inequalities-and-a-branch-and-cut-algorithm-for-the-routing-and-spectrum-allocation-problem-2106.15454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/valid-inequalities-and-a-branch-and-cut-algorithm-for-the-routing-and-spectrum-allocation-problem-2106.15454"/></url>
<url><loc>https://scifaro.com/en/abs/close-relatives-of-feedback-vertex-set-revisited-2106.16015</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/close-relatives-of-feedback-vertex-set-revisited-2106.16015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/close-relatives-of-feedback-vertex-set-revisited-2106.16015"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-iv-elimination-trees-2106.16204</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-iv-elimination-trees-2106.16204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-iv-elimination-trees-2106.16204"/></url>
<url><loc>https://scifaro.com/en/abs/logarithmic-weisfeiler-leman-identifies-all-planar-graphs-2106.16218</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logarithmic-weisfeiler-leman-identifies-all-planar-graphs-2106.16218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logarithmic-weisfeiler-leman-identifies-all-planar-graphs-2106.16218"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-functional-graph-of-the-power-map-over-finite-groups-2107.00584</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-functional-graph-of-the-power-map-over-finite-groups-2107.00584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-functional-graph-of-the-power-map-over-finite-groups-2107.00584"/></url>
<url><loc>https://scifaro.com/en/abs/stabilization-bounds-for-influence-propagation-from-a-random-initial-state-2107.02076</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabilization-bounds-for-influence-propagation-from-a-random-initial-state-2107.02076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabilization-bounds-for-influence-propagation-from-a-random-initial-state-2107.02076"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-variable-neighborhood-search-based-algorithms-for-crossdock-truck-assignment-2107.03757</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-variable-neighborhood-search-based-algorithms-for-crossdock-truck-assignment-2107.03757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-variable-neighborhood-search-based-algorithms-for-crossdock-truck-assignment-2107.03757"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-aspects-of-quasi-kernels-2107.03793</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-aspects-of-quasi-kernels-2107.03793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-aspects-of-quasi-kernels-2107.03793"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-allocations-with-incomplete-information-the-power-of-two-queries-2107.03916</loc><lastmod>2022-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-allocations-with-incomplete-information-the-power-of-two-queries-2107.03916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-allocations-with-incomplete-information-the-power-of-two-queries-2107.03916"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-linear-programming-model-for-tilings-2107.04108</loc><lastmod>2021-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-linear-programming-model-for-tilings-2107.04108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-linear-programming-model-for-tilings-2107.04108"/></url>
<url><loc>https://scifaro.com/en/abs/petri-net-modeling-for-ising-model-formulation-in-quantum-annealing-2107.04304</loc><lastmod>2021-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-net-modeling-for-ising-model-formulation-in-quantum-annealing-2107.04304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-net-modeling-for-ising-model-formulation-in-quantum-annealing-2107.04304"/></url>
<url><loc>https://scifaro.com/en/abs/preserving-diversity-when-partitioning-a-geometric-approach-2107.04674</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preserving-diversity-when-partitioning-a-geometric-approach-2107.04674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preserving-diversity-when-partitioning-a-geometric-approach-2107.04674"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonicity-variants-and-generalization-in-p-5-free-chordal-bipartite-graphs-2107.04798</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonicity-variants-and-generalization-in-p-5-free-chordal-bipartite-graphs-2107.04798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonicity-variants-and-generalization-in-p-5-free-chordal-bipartite-graphs-2107.04798"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-diagnosis-algorithm-for-hypercube-like-networks-under-the-bgm-diagnosis-model-2107.05455</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-diagnosis-algorithm-for-hypercube-like-networks-under-the-bgm-diagnosis-model-2107.05455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-diagnosis-algorithm-for-hypercube-like-networks-under-the-bgm-diagnosis-model-2107.05455"/></url>
<url><loc>https://scifaro.com/en/abs/on-lambda-backbone-coloring-of-cliques-with-tree-backbones-in-linear-time-2107.05772</loc><lastmod>2024-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lambda-backbone-coloring-of-cliques-with-tree-backbones-in-linear-time-2107.05772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lambda-backbone-coloring-of-cliques-with-tree-backbones-in-linear-time-2107.05772"/></url>
<url><loc>https://scifaro.com/en/abs/the-perfect-matching-cut-problem-revisited-2107.06399</loc><lastmod>2021-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-perfect-matching-cut-problem-revisited-2107.06399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-perfect-matching-cut-problem-revisited-2107.06399"/></url>
<url><loc>https://scifaro.com/en/abs/polynomially-tractable-cases-in-the-popular-roommates-problem-2107.06694</loc><lastmod>2021-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomially-tractable-cases-in-the-popular-roommates-problem-2107.06694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomially-tractable-cases-in-the-popular-roommates-problem-2107.06694"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-kernel-and-related-problems-in-interval-digraphs-2107.08278</loc><lastmod>2021-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-kernel-and-related-problems-in-interval-digraphs-2107.08278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-kernel-and-related-problems-in-interval-digraphs-2107.08278"/></url>
<url><loc>https://scifaro.com/en/abs/perfectly-matched-sets-in-graphs-parameterized-and-exact-computation-2107.08584</loc><lastmod>2022-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfectly-matched-sets-in-graphs-parameterized-and-exact-computation-2107.08584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfectly-matched-sets-in-graphs-parameterized-and-exact-computation-2107.08584"/></url>
<url><loc>https://scifaro.com/en/abs/isolated-loops-2107.09154</loc><lastmod>2021-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isolated-loops-2107.09154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isolated-loops-2107.09154"/></url>
<url><loc>https://scifaro.com/en/abs/steiner-tree-in-k-star-caterpillar-convex-bipartite-graphs-a-dichotomy-2107.09382</loc><lastmod>2021-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steiner-tree-in-k-star-caterpillar-convex-bipartite-graphs-a-dichotomy-2107.09382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steiner-tree-in-k-star-caterpillar-convex-bipartite-graphs-a-dichotomy-2107.09382"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-source-sink-monotone-2-parameter-min-cut-2107.09743</loc><lastmod>2022-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-source-sink-monotone-2-parameter-min-cut-2107.09743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-source-sink-monotone-2-parameter-min-cut-2107.09743"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-method-for-assessing-and-measuring-homophily-in-networks-through-second-order-statistics-2107.10037</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-method-for-assessing-and-measuring-homophily-in-networks-through-second-order-statistics-2107.10037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-method-for-assessing-and-measuring-homophily-in-networks-through-second-order-statistics-2107.10037"/></url>
<url><loc>https://scifaro.com/en/abs/tracking-truth-with-liquid-democracy-2107.11868</loc><lastmod>2024-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracking-truth-with-liquid-democracy-2107.11868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracking-truth-with-liquid-democracy-2107.11868"/></url>
<url><loc>https://scifaro.com/en/abs/assessing-the-performance-of-smart-grid-communication-networks-under-both-time-and-budget-constraints-2107.12778</loc><lastmod>2021-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assessing-the-performance-of-smart-grid-communication-networks-under-both-time-and-budget-constraints-2107.12778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assessing-the-performance-of-smart-grid-communication-networks-under-both-time-and-budget-constraints-2107.12778"/></url>
<url><loc>https://scifaro.com/en/abs/benchmark-instances-and-optimal-solutions-for-the-traveling-salesman-problem-with-drone-2107.13275</loc><lastmod>2021-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/benchmark-instances-and-optimal-solutions-for-the-traveling-salesman-problem-with-drone-2107.13275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/benchmark-instances-and-optimal-solutions-for-the-traveling-salesman-problem-with-drone-2107.13275"/></url>
<url><loc>https://scifaro.com/en/abs/novel-direct-algorithm-for-computing-simultaneous-all-levels-reliability-of-multi-state-flow-networks-2107.13665</loc><lastmod>2021-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/novel-direct-algorithm-for-computing-simultaneous-all-levels-reliability-of-multi-state-flow-networks-2107.13665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/novel-direct-algorithm-for-computing-simultaneous-all-levels-reliability-of-multi-state-flow-networks-2107.13665"/></url>
<url><loc>https://scifaro.com/en/abs/mesosome-avoidance-2107.13813</loc><lastmod>2021-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mesosome-avoidance-2107.13813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mesosome-avoidance-2107.13813"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-the-activity-on-node-binary-state-reliability-with-uncertainty-components-2108.00405</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-the-activity-on-node-binary-state-reliability-with-uncertainty-components-2108.00405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-the-activity-on-node-binary-state-reliability-with-uncertainty-components-2108.00405"/></url>
<url><loc>https://scifaro.com/en/abs/evacuating-from-ell-p-unit-disks-in-the-wireless-model-2108.02367</loc><lastmod>2021-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evacuating-from-ell-p-unit-disks-in-the-wireless-model-2108.02367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evacuating-from-ell-p-unit-disks-in-the-wireless-model-2108.02367"/></url>
<url><loc>https://scifaro.com/en/abs/bifactor-approximation-for-location-routing-with-vehicle-and-facility-capacities-2108.02480</loc><lastmod>2021-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bifactor-approximation-for-location-routing-with-vehicle-and-facility-capacities-2108.02480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bifactor-approximation-for-location-routing-with-vehicle-and-facility-capacities-2108.02480"/></url>
<url><loc>https://scifaro.com/en/abs/counting-scattered-palindromes-in-a-finite-word-2108.02729</loc><lastmod>2021-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-scattered-palindromes-in-a-finite-word-2108.02729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-scattered-palindromes-in-a-finite-word-2108.02729"/></url>
<url><loc>https://scifaro.com/en/abs/adjusting-pagerank-parameters-and-comparing-results-2108.02997</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjusting-pagerank-parameters-and-comparing-results-2108.02997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjusting-pagerank-parameters-and-comparing-results-2108.02997"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-separation-as-a-binary-relation-a-coq-assisted-proof-2108.03018</loc><lastmod>2024-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-separation-as-a-binary-relation-a-coq-assisted-proof-2108.03018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-separation-as-a-binary-relation-a-coq-assisted-proof-2108.03018"/></url>
<url><loc>https://scifaro.com/en/abs/topological-conditional-separation-2108.03096</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-conditional-separation-2108.03096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-conditional-separation-2108.03096"/></url>
<url><loc>https://scifaro.com/en/abs/causal-inference-theory-with-information-dependency-models-2108.03099</loc><lastmod>2021-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-inference-theory-with-information-dependency-models-2108.03099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-inference-theory-with-information-dependency-models-2108.03099"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-generalized-q2r-automaton-2108.03335</loc><lastmod>2021-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-generalized-q2r-automaton-2108.03335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-generalized-q2r-automaton-2108.03335"/></url>
<url><loc>https://scifaro.com/en/abs/effect-of-stepwise-adjustment-of-damping-factor-upon-pagerank-2108.04150</loc><lastmod>2021-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effect-of-stepwise-adjustment-of-damping-factor-upon-pagerank-2108.04150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effect-of-stepwise-adjustment-of-damping-factor-upon-pagerank-2108.04150"/></url>
<url><loc>https://scifaro.com/en/abs/nonexistence-of-a-universal-algorithm-for-traveling-salesman-problems-in-constructive-mathematics-2108.05231</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonexistence-of-a-universal-algorithm-for-traveling-salesman-problems-in-constructive-mathematics-2108.05231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonexistence-of-a-universal-algorithm-for-traveling-salesman-problems-in-constructive-mathematics-2108.05231"/></url>
<url><loc>https://scifaro.com/en/abs/agnostic-online-learning-and-excellent-sets-2108.05569</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/agnostic-online-learning-and-excellent-sets-2108.05569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/agnostic-online-learning-and-excellent-sets-2108.05569"/></url>
<url><loc>https://scifaro.com/en/abs/implementation-of-sprouts-a-graph-drawing-game-2108.07671</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementation-of-sprouts-a-graph-drawing-game-2108.07671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementation-of-sprouts-a-graph-drawing-game-2108.07671"/></url>
<url><loc>https://scifaro.com/en/abs/supernodes-2108.10458</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/supernodes-2108.10458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/supernodes-2108.10458"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-the-multiplicative-1-2-3-conjecture-2108.10554</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-the-multiplicative-1-2-3-conjecture-2108.10554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-the-multiplicative-1-2-3-conjecture-2108.10554"/></url>
<url><loc>https://scifaro.com/en/abs/star-struck-by-fixed-embeddings-modern-crossing-number-heuristics-2108.11443</loc><lastmod>2026-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/star-struck-by-fixed-embeddings-modern-crossing-number-heuristics-2108.11443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/star-struck-by-fixed-embeddings-modern-crossing-number-heuristics-2108.11443"/></url>
<url><loc>https://scifaro.com/en/abs/a-class-of-trees-having-near-best-balance-2108.11496</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-class-of-trees-having-near-best-balance-2108.11496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-class-of-trees-having-near-best-balance-2108.11496"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2108.12327</loc><lastmod>2021-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2108.12327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2108.12327"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-where-search-methods-are-indistinguishable-2109.00035</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-where-search-methods-are-indistinguishable-2109.00035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-where-search-methods-are-indistinguishable-2109.00035"/></url>
<url><loc>https://scifaro.com/en/abs/how-likely-is-a-random-graph-shift-enabled-2109.00339</loc><lastmod>2021-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-likely-is-a-random-graph-shift-enabled-2109.00339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-likely-is-a-random-graph-shift-enabled-2109.00339"/></url>
<url><loc>https://scifaro.com/en/abs/ramsey-numbers-of-trails-2109.00734</loc><lastmod>2022-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ramsey-numbers-of-trails-2109.00734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ramsey-numbers-of-trails-2109.00734"/></url>
<url><loc>https://scifaro.com/en/abs/four-proofs-of-the-directed-brooks-theorem-2109.01600</loc><lastmod>2023-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/four-proofs-of-the-directed-brooks-theorem-2109.01600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/four-proofs-of-the-directed-brooks-theorem-2109.01600"/></url>
<url><loc>https://scifaro.com/en/abs/locating-dominating-sets-in-local-tournaments-2109.03102</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locating-dominating-sets-in-local-tournaments-2109.03102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locating-dominating-sets-in-local-tournaments-2109.03102"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-representation-number-of-bipartite-graphs-2109.03458</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-representation-number-of-bipartite-graphs-2109.03458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-representation-number-of-bipartite-graphs-2109.03458"/></url>
<url><loc>https://scifaro.com/en/abs/exact-defective-colorings-of-graphs-2109.05255</loc><lastmod>2021-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-defective-colorings-of-graphs-2109.05255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-defective-colorings-of-graphs-2109.05255"/></url>
<url><loc>https://scifaro.com/en/abs/on-characterization-of-finite-geometric-distributive-lattices-2109.07189</loc><lastmod>2021-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-characterization-of-finite-geometric-distributive-lattices-2109.07189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-characterization-of-finite-geometric-distributive-lattices-2109.07189"/></url>
<url><loc>https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-2-5-s-3-3-3-free-chordal-bipartite-graphs-in-polynomial-time-2109.07532</loc><lastmod>2021-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-2-5-s-3-3-3-free-chordal-bipartite-graphs-in-polynomial-time-2109.07532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-efficient-domination-for-s-1-2-5-s-3-3-3-free-chordal-bipartite-graphs-in-polynomial-time-2109.07532"/></url>
<url><loc>https://scifaro.com/en/abs/gaussian-discrepancy-a-probabilistic-relaxation-of-vector-balancing-2109.08280</loc><lastmod>2022-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gaussian-discrepancy-a-probabilistic-relaxation-of-vector-balancing-2109.08280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gaussian-discrepancy-a-probabilistic-relaxation-of-vector-balancing-2109.08280"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-2-domination-number-of-cylinders-with-small-cycles-2109.10549</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-2-domination-number-of-cylinders-with-small-cycles-2109.10549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-2-domination-number-of-cylinders-with-small-cycles-2109.10549"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-modeling-power-of-different-graph-types-2109.10708</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-modeling-power-of-different-graph-types-2109.10708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-modeling-power-of-different-graph-types-2109.10708"/></url>
<url><loc>https://scifaro.com/en/abs/0-gaps-on-3d-digital-curves-2109.13341</loc><lastmod>2021-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/0-gaps-on-3d-digital-curves-2109.13341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/0-gaps-on-3d-digital-curves-2109.13341"/></url>
<url><loc>https://scifaro.com/en/abs/compact-redistricting-plans-have-many-spanning-trees-2109.13394</loc><lastmod>2021-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-redistricting-plans-have-many-spanning-trees-2109.13394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-redistricting-plans-have-many-spanning-trees-2109.13394"/></url>
<url><loc>https://scifaro.com/en/abs/chickens-and-dukes-2109.13465</loc><lastmod>2021-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chickens-and-dukes-2109.13465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chickens-and-dukes-2109.13465"/></url>
<url><loc>https://scifaro.com/en/abs/generalising-the-achromatic-number-to-zaslavsky-s-colourings-of-signed-graphs-2109.13627</loc><lastmod>2022-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalising-the-achromatic-number-to-zaslavsky-s-colourings-of-signed-graphs-2109.13627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalising-the-achromatic-number-to-zaslavsky-s-colourings-of-signed-graphs-2109.13627"/></url>
<url><loc>https://scifaro.com/en/abs/ssag-summarization-and-sparsification-of-attributed-graphs-2109.15111</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ssag-summarization-and-sparsification-of-attributed-graphs-2109.15111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ssag-summarization-and-sparsification-of-attributed-graphs-2109.15111"/></url>
<url><loc>https://scifaro.com/en/abs/on-near-optimal-spectral-expander-graphs-of-fixed-size-2110.01407</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-near-optimal-spectral-expander-graphs-of-fixed-size-2110.01407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-near-optimal-spectral-expander-graphs-of-fixed-size-2110.01407"/></url>
<url><loc>https://scifaro.com/en/abs/solving-rep-tile-by-computers-performance-of-solvers-and-analyses-of-solutions-2110.05184</loc><lastmod>2021-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-rep-tile-by-computers-performance-of-solvers-and-analyses-of-solutions-2110.05184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-rep-tile-by-computers-performance-of-solvers-and-analyses-of-solutions-2110.05184"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computational-equivalence-of-co-np-refutations-of-a-matrix-being-a-p-matrix-2110.05644</loc><lastmod>2021-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computational-equivalence-of-co-np-refutations-of-a-matrix-being-a-p-matrix-2110.05644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computational-equivalence-of-co-np-refutations-of-a-matrix-being-a-p-matrix-2110.05644"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-proper-interval-completion-problem-within-some-chordal-subclasses-2110.07706</loc><lastmod>2023-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-proper-interval-completion-problem-within-some-chordal-subclasses-2110.07706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-proper-interval-completion-problem-within-some-chordal-subclasses-2110.07706"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-hardness-and-graph-products-on-a-pursuit-evasion-game-2110.08898</loc><lastmod>2023-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-hardness-and-graph-products-on-a-pursuit-evasion-game-2110.08898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-hardness-and-graph-products-on-a-pursuit-evasion-game-2110.08898"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-sampling-and-counting-of-graphs-with-near-regular-degree-intervals-2110.09068</loc><lastmod>2023-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-sampling-and-counting-of-graphs-with-near-regular-degree-intervals-2110.09068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-sampling-and-counting-of-graphs-with-near-regular-degree-intervals-2110.09068"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-allocations-caching-and-packing-twinning-and-thinning-2110.10759</loc><lastmod>2023-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-allocations-caching-and-packing-twinning-and-thinning-2110.10759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-allocations-caching-and-packing-twinning-and-thinning-2110.10759"/></url>
<url><loc>https://scifaro.com/en/abs/targeted-multiobjective-dijkstra-algorithm-2110.10978</loc><lastmod>2021-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/targeted-multiobjective-dijkstra-algorithm-2110.10978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/targeted-multiobjective-dijkstra-algorithm-2110.10978"/></url>
<url><loc>https://scifaro.com/en/abs/the-crew-the-quest-for-planet-nine-is-np-complete-2110.11758</loc><lastmod>2021-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crew-the-quest-for-planet-nine-is-np-complete-2110.11758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crew-the-quest-for-planet-nine-is-np-complete-2110.11758"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-chromatic-number-of-a-family-of-odd-hole-free-graphs-2110.12710</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-chromatic-number-of-a-family-of-odd-hole-free-graphs-2110.12710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-chromatic-number-of-a-family-of-odd-hole-free-graphs-2110.12710"/></url>
<url><loc>https://scifaro.com/en/abs/novel-binary-addition-tree-algorithm-bat-for-calculating-the-direct-lower-bound-of-the-highly-reliable-binary-state-network-reliability-2110.13390</loc><lastmod>2021-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/novel-binary-addition-tree-algorithm-bat-for-calculating-the-direct-lower-bound-of-the-highly-reliable-binary-state-network-reliability-2110.13390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/novel-binary-addition-tree-algorithm-bat-for-calculating-the-direct-lower-bound-of-the-highly-reliable-binary-state-network-reliability-2110.13390"/></url>
<url><loc>https://scifaro.com/en/abs/connected-greedy-colourings-of-perfect-graphs-and-other-classes-the-good-the-bad-and-the-ugly-2110.14003</loc><lastmod>2024-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connected-greedy-colourings-of-perfect-graphs-and-other-classes-the-good-the-bad-and-the-ugly-2110.14003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connected-greedy-colourings-of-perfect-graphs-and-other-classes-the-good-the-bad-and-the-ugly-2110.14003"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-maxima-in-distributed-systems-2110.14460</loc><lastmod>2021-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-maxima-in-distributed-systems-2110.14460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-maxima-in-distributed-systems-2110.14460"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-the-imbalance-problem-on-complete-bipartite-graphs-2111.00154</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-the-imbalance-problem-on-complete-bipartite-graphs-2111.00154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-the-imbalance-problem-on-complete-bipartite-graphs-2111.00154"/></url>
<url><loc>https://scifaro.com/en/abs/scalar-and-matrix-chernoff-bounds-from-ell-infty-independence-2111.02177</loc><lastmod>2022-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalar-and-matrix-chernoff-bounds-from-ell-infty-independence-2111.02177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalar-and-matrix-chernoff-bounds-from-ell-infty-independence-2111.02177"/></url>
<url><loc>https://scifaro.com/en/abs/on-bi-infinite-and-conjugate-post-correspondence-problems-2111.04484</loc><lastmod>2022-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bi-infinite-and-conjugate-post-correspondence-problems-2111.04484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bi-infinite-and-conjugate-post-correspondence-problems-2111.04484"/></url>
<url><loc>https://scifaro.com/en/abs/simple-odd-beta-cycle-inequalities-for-binary-polynomial-optimization-2111.04858</loc><lastmod>2023-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-odd-beta-cycle-inequalities-for-binary-polynomial-optimization-2111.04858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-odd-beta-cycle-inequalities-for-binary-polynomial-optimization-2111.04858"/></url>
<url><loc>https://scifaro.com/en/abs/reply-to-comment-on-tvor-finding-discrete-total-variation-outliers-among-histograms-2111.05842</loc><lastmod>2021-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reply-to-comment-on-tvor-finding-discrete-total-variation-outliers-among-histograms-2111.05842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reply-to-comment-on-tvor-finding-discrete-total-variation-outliers-among-histograms-2111.05842"/></url>
<url><loc>https://scifaro.com/en/abs/assigning-and-scheduling-generalized-malleable-jobs-under-subadditive-or-submodular-processing-speeds-2111.06225</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assigning-and-scheduling-generalized-malleable-jobs-under-subadditive-or-submodular-processing-speeds-2111.06225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assigning-and-scheduling-generalized-malleable-jobs-under-subadditive-or-submodular-processing-speeds-2111.06225"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-physical-sorting-of-mobile-agents-2111.06284</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-physical-sorting-of-mobile-agents-2111.06284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-physical-sorting-of-mobile-agents-2111.06284"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-convexity-properties-and-shape-based-approximation-in-networks-reliability-2111.06604</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-convexity-properties-and-shape-based-approximation-in-networks-reliability-2111.06604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-convexity-properties-and-shape-based-approximation-in-networks-reliability-2111.06604"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-factor-approximation-for-generalized-malleable-scheduling-under-m-natural-concave-processing-speeds-2111.06733</loc><lastmod>2021-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-generalized-malleable-scheduling-under-m-natural-concave-processing-speeds-2111.06733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-generalized-malleable-scheduling-under-m-natural-concave-processing-speeds-2111.06733"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-series-parallel-matrices-in-linear-time-2111.07628</loc><lastmod>2023-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-series-parallel-matrices-in-linear-time-2111.07628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-series-parallel-matrices-in-linear-time-2111.07628"/></url>
<url><loc>https://scifaro.com/en/abs/heuristics-for-k-domination-models-of-facility-location-problems-in-street-networks-2111.07885</loc><lastmod>2021-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristics-for-k-domination-models-of-facility-location-problems-in-street-networks-2111.07885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristics-for-k-domination-models-of-facility-location-problems-in-street-networks-2111.07885"/></url>
<url><loc>https://scifaro.com/en/abs/sometimes-convex-separable-optimization-is-much-harder-than-linear-optimization-and-other-surprises-2111.08048</loc><lastmod>2021-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sometimes-convex-separable-optimization-is-much-harder-than-linear-optimization-and-other-surprises-2111.08048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sometimes-convex-separable-optimization-is-much-harder-than-linear-optimization-and-other-surprises-2111.08048"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-maximizing-temporal-reachability-via-trip-temporalisation-2111.08328</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-maximizing-temporal-reachability-via-trip-temporalisation-2111.08328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-maximizing-temporal-reachability-via-trip-temporalisation-2111.08328"/></url>
<url><loc>https://scifaro.com/en/abs/hyperbolicity-computation-through-dominating-sets-2111.08520</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperbolicity-computation-through-dominating-sets-2111.08520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperbolicity-computation-through-dominating-sets-2111.08520"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-coalition-number-of-trees-2111.08945</loc><lastmod>2022-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-coalition-number-of-trees-2111.08945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-coalition-number-of-trees-2111.08945"/></url>
<url><loc>https://scifaro.com/en/abs/hypercontractivity-on-high-dimensional-expanders-a-local-to-global-approach-for-higher-moments-2111.09444</loc><lastmod>2021-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypercontractivity-on-high-dimensional-expanders-a-local-to-global-approach-for-higher-moments-2111.09444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypercontractivity-on-high-dimensional-expanders-a-local-to-global-approach-for-higher-moments-2111.09444"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphism-testing-for-t-graphs-in-fpt-2111.10910</loc><lastmod>2022-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphism-testing-for-t-graphs-in-fpt-2111.10910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphism-testing-for-t-graphs-in-fpt-2111.10910"/></url>
<url><loc>https://scifaro.com/en/abs/harmonic-centrality-in-some-graph-families-2111.12239</loc><lastmod>2022-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/harmonic-centrality-in-some-graph-families-2111.12239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/harmonic-centrality-in-some-graph-families-2111.12239"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-solution-of-divide-and-conquer-dividing-by-a-half-recurrences-with-polynomial-independent-term-2111.12313</loc><lastmod>2023-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-solution-of-divide-and-conquer-dividing-by-a-half-recurrences-with-polynomial-independent-term-2111.12313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-solution-of-divide-and-conquer-dividing-by-a-half-recurrences-with-polynomial-independent-term-2111.12313"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-canonical-systems-with-six-types-of-coins-for-the-change-making-problem-2111.12392</loc><lastmod>2021-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-canonical-systems-with-six-types-of-coins-for-the-change-making-problem-2111.12392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-canonical-systems-with-six-types-of-coins-for-the-change-making-problem-2111.12392"/></url>
<url><loc>https://scifaro.com/en/abs/graph-recovery-from-graph-wave-equation-2111.12874</loc><lastmod>2021-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-recovery-from-graph-wave-equation-2111.12874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-recovery-from-graph-wave-equation-2111.12874"/></url>
<url><loc>https://scifaro.com/en/abs/the-vehicle-routing-problem-with-drones-and-drone-speed-selection-2111.13050</loc><lastmod>2021-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vehicle-routing-problem-with-drones-and-drone-speed-selection-2111.13050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vehicle-routing-problem-with-drones-and-drone-speed-selection-2111.13050"/></url>
<url><loc>https://scifaro.com/en/abs/equiseparability-on-terminal-wiener-index-and-distances-2111.14716</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equiseparability-on-terminal-wiener-index-and-distances-2111.14716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equiseparability-on-terminal-wiener-index-and-distances-2111.14716"/></url>
<url><loc>https://scifaro.com/en/abs/facets-of-the-total-matching-polytope-for-bipartite-graphs-2111.15528</loc><lastmod>2021-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/facets-of-the-total-matching-polytope-for-bipartite-graphs-2111.15528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/facets-of-the-total-matching-polytope-for-bipartite-graphs-2111.15528"/></url>
<url><loc>https://scifaro.com/en/abs/orientation-of-fitch-graphs-and-detection-of-horizontal-gene-transfer-in-gene-trees-2112.00403</loc><lastmod>2021-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orientation-of-fitch-graphs-and-detection-of-horizontal-gene-transfer-in-gene-trees-2112.00403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orientation-of-fitch-graphs-and-detection-of-horizontal-gene-transfer-in-gene-trees-2112.00403"/></url>
<url><loc>https://scifaro.com/en/abs/classifying-grounded-intersection-graphs-via-ordered-forbidden-patterns-2112.00629</loc><lastmod>2021-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classifying-grounded-intersection-graphs-via-ordered-forbidden-patterns-2112.00629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classifying-grounded-intersection-graphs-via-ordered-forbidden-patterns-2112.00629"/></url>
<url><loc>https://scifaro.com/en/abs/multidimensional-assignment-problem-for-multipartite-entity-resolution-2112.03346</loc><lastmod>2021-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multidimensional-assignment-problem-for-multipartite-entity-resolution-2112.03346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multidimensional-assignment-problem-for-multipartite-entity-resolution-2112.03346"/></url>
<url><loc>https://scifaro.com/en/abs/twin-distance-hereditary-digraphs-2112.04183</loc><lastmod>2021-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twin-distance-hereditary-digraphs-2112.04183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twin-distance-hereditary-digraphs-2112.04183"/></url>
<url><loc>https://scifaro.com/en/abs/morphology-of-small-snarks-2112.04335</loc><lastmod>2021-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphology-of-small-snarks-2112.04335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphology-of-small-snarks-2112.04335"/></url>
<url><loc>https://scifaro.com/en/abs/on-anti-stochastic-properties-of-unlabeled-graphs-2112.04395</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-anti-stochastic-properties-of-unlabeled-graphs-2112.04395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-anti-stochastic-properties-of-unlabeled-graphs-2112.04395"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-large-2-crossing-critical-graphs-2112.04854</loc><lastmod>2021-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-large-2-crossing-critical-graphs-2112.04854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-large-2-crossing-critical-graphs-2112.04854"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-paired-domination-in-at-free-and-planar-graphs-2112.05486</loc><lastmod>2021-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-paired-domination-in-at-free-and-planar-graphs-2112.05486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-paired-domination-in-at-free-and-planar-graphs-2112.05486"/></url>
<url><loc>https://scifaro.com/en/abs/isometric-hamming-embeddings-of-weighted-graphs-2112.06994</loc><lastmod>2021-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isometric-hamming-embeddings-of-weighted-graphs-2112.06994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isometric-hamming-embeddings-of-weighted-graphs-2112.06994"/></url>
<url><loc>https://scifaro.com/en/abs/edge-trewidth-algorithmic-and-combinatorial-properties-2112.07524</loc><lastmod>2021-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-trewidth-algorithmic-and-combinatorial-properties-2112.07524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-trewidth-algorithmic-and-combinatorial-properties-2112.07524"/></url>
<url><loc>https://scifaro.com/en/abs/disconnected-matchings-2112.09248</loc><lastmod>2021-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disconnected-matchings-2112.09248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disconnected-matchings-2112.09248"/></url>
<url><loc>https://scifaro.com/en/abs/morphisms-and-minimisation-of-weighted-automata-2112.09387</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphisms-and-minimisation-of-weighted-automata-2112.09387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphisms-and-minimisation-of-weighted-automata-2112.09387"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-graph-transformation-for-social-network-modeling-2112.11034</loc><lastmod>2021-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-graph-transformation-for-social-network-modeling-2112.11034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-graph-transformation-for-social-network-modeling-2112.11034"/></url>
<url><loc>https://scifaro.com/en/abs/landscape-properties-of-the-very-large-scale-and-the-variable-neighborhood-search-metaheuristics-for-the-multidimensional-assignment-problem-2112.11849</loc><lastmod>2021-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/landscape-properties-of-the-very-large-scale-and-the-variable-neighborhood-search-metaheuristics-for-the-multidimensional-assignment-problem-2112.11849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/landscape-properties-of-the-very-large-scale-and-the-variable-neighborhood-search-metaheuristics-for-the-multidimensional-assignment-problem-2112.11849"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-generating-random-mixed-arity-trees-2112.12019</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-generating-random-mixed-arity-trees-2112.12019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-generating-random-mixed-arity-trees-2112.12019"/></url>
<url><loc>https://scifaro.com/en/abs/a-matheuristic-algorithm-for-the-single-source-capacitated-facility-location-problem-and-its-variants-2112.12974</loc><lastmod>2021-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-matheuristic-algorithm-for-the-single-source-capacitated-facility-location-problem-and-its-variants-2112.12974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-matheuristic-algorithm-for-the-single-source-capacitated-facility-location-problem-and-its-variants-2112.12974"/></url>
<url><loc>https://scifaro.com/en/abs/an-exact-dynamic-programming-algorithm-lower-and-upper-bounds-applied-to-the-large-block-sale-problem-2112.12983</loc><lastmod>2021-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-exact-dynamic-programming-algorithm-lower-and-upper-bounds-applied-to-the-large-block-sale-problem-2112.12983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-exact-dynamic-programming-algorithm-lower-and-upper-bounds-applied-to-the-large-block-sale-problem-2112.12983"/></url>
<url><loc>https://scifaro.com/en/abs/the-learning-and-communication-complexity-of-subsequence-containment-2112.13399</loc><lastmod>2023-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-learning-and-communication-complexity-of-subsequence-containment-2112.13399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-learning-and-communication-complexity-of-subsequence-containment-2112.13399"/></url>
<url><loc>https://scifaro.com/en/abs/orienteering-problem-with-time-windows-and-updating-delay-2201.00777</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orienteering-problem-with-time-windows-and-updating-delay-2201.00777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orienteering-problem-with-time-windows-and-updating-delay-2201.00777"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimal-beyond-planar-graphs-2201.00783</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimal-beyond-planar-graphs-2201.00783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimal-beyond-planar-graphs-2201.00783"/></url>
<url><loc>https://scifaro.com/en/abs/purely-local-growth-of-a-quasicrystal-2201.00789</loc><lastmod>2022-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/purely-local-growth-of-a-quasicrystal-2201.00789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/purely-local-growth-of-a-quasicrystal-2201.00789"/></url>
<url><loc>https://scifaro.com/en/abs/the-exact-complexity-of-a-robinson-tiling-2201.00811</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-exact-complexity-of-a-robinson-tiling-2201.00811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-exact-complexity-of-a-robinson-tiling-2201.00811"/></url>
<url><loc>https://scifaro.com/en/abs/dynamics-of-polynomial-maps-over-finite-fields-2201.00954</loc><lastmod>2022-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamics-of-polynomial-maps-over-finite-fields-2201.00954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamics-of-polynomial-maps-over-finite-fields-2201.00954"/></url>
<url><loc>https://scifaro.com/en/abs/erd-h-o-s-selfridge-theorem-for-nonmonotone-cnfs-2201.00968</loc><lastmod>2022-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/erd-h-o-s-selfridge-theorem-for-nonmonotone-cnfs-2201.00968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/erd-h-o-s-selfridge-theorem-for-nonmonotone-cnfs-2201.00968"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-convex-balls-2201.01599</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-convex-balls-2201.01599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-convex-balls-2201.01599"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-approximations-for-many-visits-multiple-traveling-salesman-problems-2201.02054</loc><lastmod>2022-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-approximations-for-many-visits-multiple-traveling-salesman-problems-2201.02054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-approximations-for-many-visits-multiple-traveling-salesman-problems-2201.02054"/></url>
<url><loc>https://scifaro.com/en/abs/long-induced-paths-in-minor-closed-graph-classes-and-beyond-2201.03880</loc><lastmod>2023-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/long-induced-paths-in-minor-closed-graph-classes-and-beyond-2201.03880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/long-induced-paths-in-minor-closed-graph-classes-and-beyond-2201.03880"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-modular-graph-transformation-rule-application-2201.04360</loc><lastmod>2022-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-modular-graph-transformation-rule-application-2201.04360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-modular-graph-transformation-rule-application-2201.04360"/></url>
<url><loc>https://scifaro.com/en/abs/representing-catalytic-mechanisms-with-rule-composition-2201.04515</loc><lastmod>2022-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-catalytic-mechanisms-with-rule-composition-2201.04515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-catalytic-mechanisms-with-rule-composition-2201.04515"/></url>
<url><loc>https://scifaro.com/en/abs/an-adjacency-labeling-scheme-based-on-a-tree-decomposition-2201.04749</loc><lastmod>2022-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-adjacency-labeling-scheme-based-on-a-tree-decomposition-2201.04749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-adjacency-labeling-scheme-based-on-a-tree-decomposition-2201.04749"/></url>
<url><loc>https://scifaro.com/en/abs/finding-s-d-hypernetworks-in-f-hypergraphs-is-np-hard-2201.04799</loc><lastmod>2022-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-s-d-hypernetworks-in-f-hypergraphs-is-np-hard-2201.04799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-s-d-hypernetworks-in-f-hypergraphs-is-np-hard-2201.04799"/></url>
<url><loc>https://scifaro.com/en/abs/the-np-completeness-of-redundant-open-locating-dominating-set-2201.05252</loc><lastmod>2022-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-np-completeness-of-redundant-open-locating-dominating-set-2201.05252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-np-completeness-of-redundant-open-locating-dominating-set-2201.05252"/></url>
<url><loc>https://scifaro.com/en/abs/performance-guaranteed-evolutionary-algorithm-for-minimum-connected-dominating-set-2201.05332</loc><lastmod>2022-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/performance-guaranteed-evolutionary-algorithm-for-minimum-connected-dominating-set-2201.05332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/performance-guaranteed-evolutionary-algorithm-for-minimum-connected-dominating-set-2201.05332"/></url>
<url><loc>https://scifaro.com/en/abs/stemp-a-fast-and-deterministic-stem-graph-approach-for-rna-and-protein-folding-prediction-2201.05724</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stemp-a-fast-and-deterministic-stem-graph-approach-for-rna-and-protein-folding-prediction-2201.05724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stemp-a-fast-and-deterministic-stem-graph-approach-for-rna-and-protein-folding-prediction-2201.05724"/></url>
<url><loc>https://scifaro.com/en/abs/self-adaptive-binary-addition-tree-algorithm-based-novel-monte-carlo-simulation-for-binary-state-network-reliability-approximation-2201.05764</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-adaptive-binary-addition-tree-algorithm-based-novel-monte-carlo-simulation-for-binary-state-network-reliability-approximation-2201.05764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-adaptive-binary-addition-tree-algorithm-based-novel-monte-carlo-simulation-for-binary-state-network-reliability-approximation-2201.05764"/></url>
<url><loc>https://scifaro.com/en/abs/eternal-vertex-cover-number-of-maximal-outerplanar-graphs-2201.06577</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eternal-vertex-cover-number-of-maximal-outerplanar-graphs-2201.06577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eternal-vertex-cover-number-of-maximal-outerplanar-graphs-2201.06577"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-on-the-span-of-l-1-2-edge-labeling-of-some-infinite-regular-grids-2201.06801</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-on-the-span-of-l-1-2-edge-labeling-of-some-infinite-regular-grids-2201.06801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-on-the-span-of-l-1-2-edge-labeling-of-some-infinite-regular-grids-2201.06801"/></url>
<url><loc>https://scifaro.com/en/abs/it-is-undecidable-whether-the-growth-rate-of-a-given-bilinear-system-is-1-2201.07630</loc><lastmod>2022-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-is-undecidable-whether-the-growth-rate-of-a-given-bilinear-system-is-1-2201.07630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-is-undecidable-whether-the-growth-rate-of-a-given-bilinear-system-is-1-2201.07630"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-twin-width-for-bounded-treewidth-graphs-planar-graphs-and-bipartite-graphs-2201.09749</loc><lastmod>2022-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-twin-width-for-bounded-treewidth-graphs-planar-graphs-and-bipartite-graphs-2201.09749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-twin-width-for-bounded-treewidth-graphs-planar-graphs-and-bipartite-graphs-2201.09749"/></url>
<url><loc>https://scifaro.com/en/abs/new-results-on-the-robust-coloring-problem-2201.12650</loc><lastmod>2023-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-results-on-the-robust-coloring-problem-2201.12650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-results-on-the-robust-coloring-problem-2201.12650"/></url>
<url><loc>https://scifaro.com/en/abs/counting-unreachable-single-side-pawn-diagrams-with-limitless-captures-2202.00428</loc><lastmod>2022-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-unreachable-single-side-pawn-diagrams-with-limitless-captures-2202.00428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-unreachable-single-side-pawn-diagrams-with-limitless-captures-2202.00428"/></url>
<url><loc>https://scifaro.com/en/abs/random-processes-with-high-variance-produce-scale-free-networks-2202.00845</loc><lastmod>2022-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-processes-with-high-variance-produce-scale-free-networks-2202.00845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-processes-with-high-variance-produce-scale-free-networks-2202.00845"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-temporal-interpretation-of-cluster-editing-2202.01103</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-temporal-interpretation-of-cluster-editing-2202.01103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-temporal-interpretation-of-cluster-editing-2202.01103"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-points-and-2-cycles-of-synchronous-dynamic-coloring-processes-on-trees-2202.01580</loc><lastmod>2022-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-points-and-2-cycles-of-synchronous-dynamic-coloring-processes-on-trees-2202.01580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-points-and-2-cycles-of-synchronous-dynamic-coloring-processes-on-trees-2202.01580"/></url>
<url><loc>https://scifaro.com/en/abs/about-code-equivalence-a-geometric-approach-2202.02086</loc><lastmod>2022-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-code-equivalence-a-geometric-approach-2202.02086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-code-equivalence-a-geometric-approach-2202.02086"/></url>
<url><loc>https://scifaro.com/en/abs/counting-kernels-in-directed-graphs-with-arbitrary-orientations-2202.04476</loc><lastmod>2024-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-kernels-in-directed-graphs-with-arbitrary-orientations-2202.04476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-kernels-in-directed-graphs-with-arbitrary-orientations-2202.04476"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-connected-matchings-2202.04746</loc><lastmod>2022-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-connected-matchings-2202.04746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-connected-matchings-2202.04746"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-identity-problem-for-unitriangular-matrices-of-dimension-four-2202.05225</loc><lastmod>2022-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-identity-problem-for-unitriangular-matrices-of-dimension-four-2202.05225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-identity-problem-for-unitriangular-matrices-of-dimension-four-2202.05225"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-matrices-with-bounded-graver-bases-and-depth-parameters-and-applications-to-integer-programming-2202.05299</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-matrices-with-bounded-graver-bases-and-depth-parameters-and-applications-to-integer-programming-2202.05299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-matrices-with-bounded-graver-bases-and-depth-parameters-and-applications-to-integer-programming-2202.05299"/></url>
<url><loc>https://scifaro.com/en/abs/edge-coloured-graphs-with-only-monochromatic-perfect-matchings-and-their-connection-to-quantum-physics-2202.05562</loc><lastmod>2023-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-coloured-graphs-with-only-monochromatic-perfect-matchings-and-their-connection-to-quantum-physics-2202.05562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-coloured-graphs-with-only-monochromatic-perfect-matchings-and-their-connection-to-quantum-physics-2202.05562"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-of-dyck-paths-with-air-pockets-2202.06893</loc><lastmod>2023-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-of-dyck-paths-with-air-pockets-2202.06893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-of-dyck-paths-with-air-pockets-2202.06893"/></url>
<url><loc>https://scifaro.com/en/abs/the-aperiodic-domino-problem-in-higher-dimension-2202.07377</loc><lastmod>2022-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-aperiodic-domino-problem-in-higher-dimension-2202.07377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-aperiodic-domino-problem-in-higher-dimension-2202.07377"/></url>
<url><loc>https://scifaro.com/en/abs/recoloring-unit-interval-graphs-with-logarithmic-recourse-budget-2202.08006</loc><lastmod>2022-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recoloring-unit-interval-graphs-with-logarithmic-recourse-budget-2202.08006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recoloring-unit-interval-graphs-with-logarithmic-recourse-budget-2202.08006"/></url>
<url><loc>https://scifaro.com/en/abs/a-polyhedral-study-of-lifted-multicuts-2202.08068</loc><lastmod>2022-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polyhedral-study-of-lifted-multicuts-2202.08068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polyhedral-study-of-lifted-multicuts-2202.08068"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-battleship-of-uncertain-shape-2202.08747</loc><lastmod>2022-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-battleship-of-uncertain-shape-2202.08747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-battleship-of-uncertain-shape-2202.08747"/></url>
<url><loc>https://scifaro.com/en/abs/structure-aware-combinatorial-group-testing-a-new-method-for-pandemic-screening-2202.09264</loc><lastmod>2022-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-aware-combinatorial-group-testing-a-new-method-for-pandemic-screening-2202.09264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-aware-combinatorial-group-testing-a-new-method-for-pandemic-screening-2202.09264"/></url>
<url><loc>https://scifaro.com/en/abs/the-open-problem-of-finding-a-general-classification-of-geodetic-graphs-2202.10663</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-open-problem-of-finding-a-general-classification-of-geodetic-graphs-2202.10663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-open-problem-of-finding-a-general-classification-of-geodetic-graphs-2202.10663"/></url>
<url><loc>https://scifaro.com/en/abs/kron-reduction-and-effective-resistance-of-directed-graphs-2202.12560</loc><lastmod>2022-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kron-reduction-and-effective-resistance-of-directed-graphs-2202.12560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kron-reduction-and-effective-resistance-of-directed-graphs-2202.12560"/></url>
<url><loc>https://scifaro.com/en/abs/automorphisms-of-set-families-and-of-families-of-cliques-in-an-interval-graph-in-fpt-time-2202.12664</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automorphisms-of-set-families-and-of-families-of-cliques-in-an-interval-graph-in-fpt-time-2202.12664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automorphisms-of-set-families-and-of-families-of-cliques-in-an-interval-graph-in-fpt-time-2202.12664"/></url>
<url><loc>https://scifaro.com/en/abs/all-graphs-with-at-most-8-nodes-are-2-interval-pcgs-2202.13844</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-graphs-with-at-most-8-nodes-are-2-interval-pcgs-2202.13844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-graphs-with-at-most-8-nodes-are-2-interval-pcgs-2202.13844"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-representations-of-unique-bipartite-perfect-matching-2203.01071</loc><lastmod>2022-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-representations-of-unique-bipartite-perfect-matching-2203.01071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-representations-of-unique-bipartite-perfect-matching-2203.01071"/></url>
<url><loc>https://scifaro.com/en/abs/on-packing-time-respecting-arborescences-2203.01096</loc><lastmod>2022-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-packing-time-respecting-arborescences-2203.01096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-packing-time-respecting-arborescences-2203.01096"/></url>
<url><loc>https://scifaro.com/en/abs/linear-cuts-in-boolean-networks-2203.01620</loc><lastmod>2022-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-cuts-in-boolean-networks-2203.01620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-cuts-in-boolean-networks-2203.01620"/></url>
<url><loc>https://scifaro.com/en/abs/worst-case-analysis-of-lpt-scheduling-on-small-number-of-non-identical-processors-2203.02724</loc><lastmod>2022-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/worst-case-analysis-of-lpt-scheduling-on-small-number-of-non-identical-processors-2203.02724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/worst-case-analysis-of-lpt-scheduling-on-small-number-of-non-identical-processors-2203.02724"/></url>
<url><loc>https://scifaro.com/en/abs/locally-checkable-problems-parameterized-by-clique-width-2203.02992</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locally-checkable-problems-parameterized-by-clique-width-2203.02992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locally-checkable-problems-parameterized-by-clique-width-2203.02992"/></url>
<url><loc>https://scifaro.com/en/abs/high-dimensional-expanders-from-chevalley-groups-2203.03705</loc><lastmod>2022-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-dimensional-expanders-from-chevalley-groups-2203.03705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-dimensional-expanders-from-chevalley-groups-2203.03705"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-simple-connection-between-delta-modular-ilp-and-lp-and-a-new-bound-on-the-number-of-integer-vertices-2203.03907</loc><lastmod>2022-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-simple-connection-between-delta-modular-ilp-and-lp-and-a-new-bound-on-the-number-of-integer-vertices-2203.03907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-simple-connection-between-delta-modular-ilp-and-lp-and-a-new-bound-on-the-number-of-integer-vertices-2203.03907"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-expressions-of-hopf-polynomial-invariants-2203.03947</loc><lastmod>2022-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-expressions-of-hopf-polynomial-invariants-2203.03947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-expressions-of-hopf-polynomial-invariants-2203.03947"/></url>
<url><loc>https://scifaro.com/en/abs/edge-intersection-graphs-of-paths-on-a-triangular-grid-2203.04250</loc><lastmod>2022-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-intersection-graphs-of-paths-on-a-triangular-grid-2203.04250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-intersection-graphs-of-paths-on-a-triangular-grid-2203.04250"/></url>
<url><loc>https://scifaro.com/en/abs/robust-radical-sylvester-gallai-theorem-for-quadratics-2203.05532</loc><lastmod>2022-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-radical-sylvester-gallai-theorem-for-quadratics-2203.05532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-radical-sylvester-gallai-theorem-for-quadratics-2203.05532"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-d-claw-vertex-deletion-problem-2203.06766</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-d-claw-vertex-deletion-problem-2203.06766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-d-claw-vertex-deletion-problem-2203.06766"/></url>
<url><loc>https://scifaro.com/en/abs/on-comparable-box-dimension-2203.07686</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-comparable-box-dimension-2203.07686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-comparable-box-dimension-2203.07686"/></url>
<url><loc>https://scifaro.com/en/abs/sparsification-lower-bound-for-linear-spanners-in-directed-graphs-2203.08601</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparsification-lower-bound-for-linear-spanners-in-directed-graphs-2203.08601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparsification-lower-bound-for-linear-spanners-in-directed-graphs-2203.08601"/></url>
<url><loc>https://scifaro.com/en/abs/tangles-and-hierarchical-clustering-2203.08731</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tangles-and-hierarchical-clustering-2203.08731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tangles-and-hierarchical-clustering-2203.08731"/></url>
<url><loc>https://scifaro.com/en/abs/planar-rosa-a-family-of-quasiperiodic-substitution-discrete-plane-tilings-with-2n-fold-rotational-symmetry-2203.08856</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-rosa-a-family-of-quasiperiodic-substitution-discrete-plane-tilings-with-2n-fold-rotational-symmetry-2203.08856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-rosa-a-family-of-quasiperiodic-substitution-discrete-plane-tilings-with-2n-fold-rotational-symmetry-2203.08856"/></url>
<url><loc>https://scifaro.com/en/abs/short-and-local-transformations-between-delta-1-colorings-2203.08885</loc><lastmod>2023-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-and-local-transformations-between-delta-1-colorings-2203.08885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-and-local-transformations-between-delta-1-colorings-2203.08885"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-and-exact-algorithms-for-class-domination-coloring-2203.09106</loc><lastmod>2022-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-and-exact-algorithms-for-class-domination-coloring-2203.09106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-and-exact-algorithms-for-class-domination-coloring-2203.09106"/></url>
<url><loc>https://scifaro.com/en/abs/a-recursive-function-coding-number-theoretic-functions-2203.09311</loc><lastmod>2022-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recursive-function-coding-number-theoretic-functions-2203.09311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recursive-function-coding-number-theoretic-functions-2203.09311"/></url>
<url><loc>https://scifaro.com/en/abs/how-expressive-are-friendly-school-partitions-2203.10772</loc><lastmod>2022-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-expressive-are-friendly-school-partitions-2203.10772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-expressive-are-friendly-school-partitions-2203.10772"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-limit-cycles-with-block-sequential-update-schedules-in-conjunctive-networks-2203.11361</loc><lastmod>2022-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-limit-cycles-with-block-sequential-update-schedules-in-conjunctive-networks-2203.11361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-limit-cycles-with-block-sequential-update-schedules-in-conjunctive-networks-2203.11361"/></url>
<url><loc>https://scifaro.com/en/abs/gradient-vector-fields-of-discrete-morse-functions-and-watershed-cuts-2203.11512</loc><lastmod>2022-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gradient-vector-fields-of-discrete-morse-functions-and-watershed-cuts-2203.11512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gradient-vector-fields-of-discrete-morse-functions-and-watershed-cuts-2203.11512"/></url>
<url><loc>https://scifaro.com/en/abs/neighbour-sum-distinguishing-edge-weightings-with-local-constraints-2203.11521</loc><lastmod>2026-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighbour-sum-distinguishing-edge-weightings-with-local-constraints-2203.11521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighbour-sum-distinguishing-edge-weightings-with-local-constraints-2203.11521"/></url>
<url><loc>https://scifaro.com/en/abs/modules-in-robinson-spaces-2203.12386</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modules-in-robinson-spaces-2203.12386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modules-in-robinson-spaces-2203.12386"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-for-repeated-balls-into-bins-2203.12400</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-for-repeated-balls-into-bins-2203.12400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-for-repeated-balls-into-bins-2203.12400"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-allocations-in-batches-simplified-and-generalized-2203.13902</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-allocations-in-batches-simplified-and-generalized-2203.13902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-allocations-in-batches-simplified-and-generalized-2203.13902"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-analysis-of-the-count-min-sketch-with-conservative-updates-2203.14549</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-analysis-of-the-count-min-sketch-with-conservative-updates-2203.14549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-analysis-of-the-count-min-sketch-with-conservative-updates-2203.14549"/></url>
<url><loc>https://scifaro.com/en/abs/some-notes-on-polyadic-concept-analysis-2203.14606</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-notes-on-polyadic-concept-analysis-2203.14606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-notes-on-polyadic-concept-analysis-2203.14606"/></url>
<url><loc>https://scifaro.com/en/abs/on-d-stable-locally-checkable-problems-parameterized-by-mim-width-2203.15724</loc><lastmod>2023-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-d-stable-locally-checkable-problems-parameterized-by-mim-width-2203.15724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-d-stable-locally-checkable-problems-parameterized-by-mim-width-2203.15724"/></url>
<url><loc>https://scifaro.com/en/abs/characterizations-of-graph-classes-via-convex-geometries-a-survey-2203.15878</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizations-of-graph-classes-via-convex-geometries-a-survey-2203.15878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizations-of-graph-classes-via-convex-geometries-a-survey-2203.15878"/></url>
<url><loc>https://scifaro.com/en/abs/homomorphisms-of-n-m-graphs-with-respect-to-generalised-switch-2204.01258</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homomorphisms-of-n-m-graphs-with-respect-to-generalised-switch-2204.01258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homomorphisms-of-n-m-graphs-with-respect-to-generalised-switch-2204.01258"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-attack-sequences-in-m-eternal-domination-2204.02720</loc><lastmod>2022-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-attack-sequences-in-m-eternal-domination-2204.02720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-attack-sequences-in-m-eternal-domination-2204.02720"/></url>
<url><loc>https://scifaro.com/en/abs/diversitree-a-new-method-to-efficiently-compute-diverse-sets-of-near-optimal-solutions-to-mixed-integer-optimization-problems-2204.03822</loc><lastmod>2023-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diversitree-a-new-method-to-efficiently-compute-diverse-sets-of-near-optimal-solutions-to-mixed-integer-optimization-problems-2204.03822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diversitree-a-new-method-to-efficiently-compute-diverse-sets-of-near-optimal-solutions-to-mixed-integer-optimization-problems-2204.03822"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-filling-in-balanced-allocations-2204.04057</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-filling-in-balanced-allocations-2204.04057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-filling-in-balanced-allocations-2204.04057"/></url>
<url><loc>https://scifaro.com/en/abs/list-covering-of-regular-multigraphs-with-semi-edges-2204.04280</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/list-covering-of-regular-multigraphs-with-semi-edges-2204.04280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/list-covering-of-regular-multigraphs-with-semi-edges-2204.04280"/></url>
<url><loc>https://scifaro.com/en/abs/a-bat-based-exact-solution-algorithm-for-the-series-parallel-redundancy-allocation-problem-with-mixed-components-2204.04472</loc><lastmod>2022-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bat-based-exact-solution-algorithm-for-the-series-parallel-redundancy-allocation-problem-with-mixed-components-2204.04472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bat-based-exact-solution-algorithm-for-the-series-parallel-redundancy-allocation-problem-with-mixed-components-2204.04472"/></url>
<url><loc>https://scifaro.com/en/abs/on-dually-cpt-and-strong-cpt-posets-2204.04729</loc><lastmod>2022-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-dually-cpt-and-strong-cpt-posets-2204.04729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-dually-cpt-and-strong-cpt-posets-2204.04729"/></url>
<url><loc>https://scifaro.com/en/abs/on-complex-roots-of-the-independence-polynomial-2204.04868</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complex-roots-of-the-independence-polynomial-2204.04868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complex-roots-of-the-independence-polynomial-2204.04868"/></url>
<url><loc>https://scifaro.com/en/abs/schwartz-zippel-for-multilinear-polynomials-mod-n-2204.05037</loc><lastmod>2022-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/schwartz-zippel-for-multilinear-polynomials-mod-n-2204.05037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/schwartz-zippel-for-multilinear-polynomials-mod-n-2204.05037"/></url>
<url><loc>https://scifaro.com/en/abs/about-the-infinite-windy-firebreak-location-problem-2204.05475</loc><lastmod>2022-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-the-infinite-windy-firebreak-location-problem-2204.05475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-the-infinite-windy-firebreak-location-problem-2204.05475"/></url>
<url><loc>https://scifaro.com/en/abs/lengths-of-cycles-in-generalized-pancake-graphs-2204.10494</loc><lastmod>2023-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lengths-of-cycles-in-generalized-pancake-graphs-2204.10494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lengths-of-cycles-in-generalized-pancake-graphs-2204.10494"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-automata-isolated-cycles-and-tangential-double-cycles-dynamics-2204.10686</loc><lastmod>2022-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-automata-isolated-cycles-and-tangential-double-cycles-dynamics-2204.10686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-automata-isolated-cycles-and-tangential-double-cycles-dynamics-2204.10686"/></url>
<url><loc>https://scifaro.com/en/abs/the-mixed-search-game-against-an-agile-and-visible-fugitive-is-monotone-2204.10691</loc><lastmod>2022-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mixed-search-game-against-an-agile-and-visible-fugitive-is-monotone-2204.10691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mixed-search-game-against-an-agile-and-visible-fugitive-is-monotone-2204.10691"/></url>
<url><loc>https://scifaro.com/en/abs/attractor-landscapes-in-boolean-networks-with-firing-memory-2204.10702</loc><lastmod>2022-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attractor-landscapes-in-boolean-networks-with-firing-memory-2204.10702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attractor-landscapes-in-boolean-networks-with-firing-memory-2204.10702"/></url>
<url><loc>https://scifaro.com/en/abs/about-block-parallel-boolean-networks-a-position-paper-2204.10712</loc><lastmod>2022-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-block-parallel-boolean-networks-a-position-paper-2204.10712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-block-parallel-boolean-networks-a-position-paper-2204.10712"/></url>
<url><loc>https://scifaro.com/en/abs/error-correcting-identifying-codes-2204.11362</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/error-correcting-identifying-codes-2204.11362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/error-correcting-identifying-codes-2204.11362"/></url>
<url><loc>https://scifaro.com/en/abs/strongly-aperiodic-sfts-on-generalized-baumslag-solitar-groups-2204.11492</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strongly-aperiodic-sfts-on-generalized-baumslag-solitar-groups-2204.11492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strongly-aperiodic-sfts-on-generalized-baumslag-solitar-groups-2204.11492"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-coarsening-of-graph-data-with-spectral-guarantees-2204.11757</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-coarsening-of-graph-data-with-spectral-guarantees-2204.11757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-coarsening-of-graph-data-with-spectral-guarantees-2204.11757"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-whose-vertices-of-degree-at-least-2-lie-in-a-triangle-2204.11785</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-whose-vertices-of-degree-at-least-2-lie-in-a-triangle-2204.11785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-whose-vertices-of-degree-at-least-2-lie-in-a-triangle-2204.11785"/></url>
<url><loc>https://scifaro.com/en/abs/exact-wirelength-of-embedding-3-ary-n-cubes-into-certain-cylinders-and-trees-2204.12079</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-wirelength-of-embedding-3-ary-n-cubes-into-certain-cylinders-and-trees-2204.12079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-wirelength-of-embedding-3-ary-n-cubes-into-certain-cylinders-and-trees-2204.12079"/></url>
<url><loc>https://scifaro.com/en/abs/transitivity-on-subclasses-of-bipartite-graphs-2204.13148</loc><lastmod>2022-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transitivity-on-subclasses-of-bipartite-graphs-2204.13148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transitivity-on-subclasses-of-bipartite-graphs-2204.13148"/></url>
<url><loc>https://scifaro.com/en/abs/twin-width-and-limits-of-tractability-of-fo-model-checking-on-geometric-graphs-2204.13742</loc><lastmod>2022-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twin-width-and-limits-of-tractability-of-fo-model-checking-on-geometric-graphs-2204.13742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twin-width-and-limits-of-tractability-of-fo-model-checking-on-geometric-graphs-2204.13742"/></url>
<url><loc>https://scifaro.com/en/abs/preferential-attachment-hypergraph-with-vertex-deactivation-2205.00071</loc><lastmod>2023-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preferential-attachment-hypergraph-with-vertex-deactivation-2205.00071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preferential-attachment-hypergraph-with-vertex-deactivation-2205.00071"/></url>
<url><loc>https://scifaro.com/en/abs/local-permutation-polynomials-and-the-action-of-e-klenian-groups-2205.00151</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-permutation-polynomials-and-the-action-of-e-klenian-groups-2205.00151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-permutation-polynomials-and-the-action-of-e-klenian-groups-2205.00151"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-utility-popular-matchings-with-bounded-instability-2205.02189</loc><lastmod>2022-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-utility-popular-matchings-with-bounded-instability-2205.02189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-utility-popular-matchings-with-bounded-instability-2205.02189"/></url>
<url><loc>https://scifaro.com/en/abs/experimental-study-of-concise-representations-of-concepts-and-dependencies-2205.02464</loc><lastmod>2022-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experimental-study-of-concise-representations-of-concepts-and-dependencies-2205.02464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experimental-study-of-concise-representations-of-concepts-and-dependencies-2205.02464"/></url>
<url><loc>https://scifaro.com/en/abs/cover-time-of-graphs-with-bounded-genus-2205.03757</loc><lastmod>2022-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cover-time-of-graphs-with-bounded-genus-2205.03757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cover-time-of-graphs-with-bounded-genus-2205.03757"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-and-optimal-algorithm-for-strict-circular-seriation-2205.04694</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-and-optimal-algorithm-for-strict-circular-seriation-2205.04694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-and-optimal-algorithm-for-strict-circular-seriation-2205.04694"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-to-genome-rearrangement-problem-using-prefix-transpositions-2205.04785</loc><lastmod>2022-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-to-genome-rearrangement-problem-using-prefix-transpositions-2205.04785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-to-genome-rearrangement-problem-using-prefix-transpositions-2205.04785"/></url>
<url><loc>https://scifaro.com/en/abs/iterative-models-for-complex-networks-formed-by-extending-cliques-2205.04918</loc><lastmod>2022-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterative-models-for-complex-networks-formed-by-extending-cliques-2205.04918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterative-models-for-complex-networks-formed-by-extending-cliques-2205.04918"/></url>
<url><loc>https://scifaro.com/en/abs/improved-upper-bound-on-independent-domination-number-for-hypercubes-2205.06671</loc><lastmod>2022-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-upper-bound-on-independent-domination-number-for-hypercubes-2205.06671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-upper-bound-on-independent-domination-number-for-hypercubes-2205.06671"/></url>
<url><loc>https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-new-proof-2205.07317</loc><lastmod>2022-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-new-proof-2205.07317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-new-proof-2205.07317"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-rigidity-of-arnoux-rauzy-words-2205.07707</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-rigidity-of-arnoux-rauzy-words-2205.07707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-rigidity-of-arnoux-rauzy-words-2205.07707"/></url>
<url><loc>https://scifaro.com/en/abs/the-hamiltonian-path-graph-is-connected-for-simple-s-t-paths-in-rectangular-grid-graphs-2205.08025</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hamiltonian-path-graph-is-connected-for-simple-s-t-paths-in-rectangular-grid-graphs-2205.08025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hamiltonian-path-graph-is-connected-for-simple-s-t-paths-in-rectangular-grid-graphs-2205.08025"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-tournaments-with-the-strong-s-k-property-and-implications-for-teaching-2205.08357</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-tournaments-with-the-strong-s-k-property-and-implications-for-teaching-2205.08357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-tournaments-with-the-strong-s-k-property-and-implications-for-teaching-2205.08357"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-of-configurations-in-one-dimensional-majority-cellular-automata-from-cell-stability-to-configuration-periodicity-2205.08972</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-of-configurations-in-one-dimensional-majority-cellular-automata-from-cell-stability-to-configuration-periodicity-2205.08972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-of-configurations-in-one-dimensional-majority-cellular-automata-from-cell-stability-to-configuration-periodicity-2205.08972"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-digraph-homomorphisms-2205.09210</loc><lastmod>2022-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-digraph-homomorphisms-2205.09210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-digraph-homomorphisms-2205.09210"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-embeddings-in-semilattices-2205.12618</loc><lastmod>2022-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-embeddings-in-semilattices-2205.12618"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-embeddings-in-semilattices-2205.12618"/></url>
<url><loc>https://scifaro.com/en/abs/square-roots-of-nearly-planar-graphs-2205.12764</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-roots-of-nearly-planar-graphs-2205.12764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-roots-of-nearly-planar-graphs-2205.12764"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-blocking-semi-total-dominating-sets-with-edge-contractions-2205.12821</loc><lastmod>2022-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-blocking-semi-total-dominating-sets-with-edge-contractions-2205.12821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-blocking-semi-total-dominating-sets-with-edge-contractions-2205.12821"/></url>
<url><loc>https://scifaro.com/en/abs/transitions-from-p-to-np-hardness-the-case-of-the-linear-ordering-problem-2205.12943</loc><lastmod>2022-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transitions-from-p-to-np-hardness-the-case-of-the-linear-ordering-problem-2205.12943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transitions-from-p-to-np-hardness-the-case-of-the-linear-ordering-problem-2205.12943"/></url>
<url><loc>https://scifaro.com/en/abs/ammann-bars-for-octagonal-tilings-2205.13973</loc><lastmod>2024-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ammann-bars-for-octagonal-tilings-2205.13973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ammann-bars-for-octagonal-tilings-2205.13973"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-l-shaped-floor-plans-2205.14434</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-l-shaped-floor-plans-2205.14434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-l-shaped-floor-plans-2205.14434"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-hardness-of-promise-hypergraph-colouring-2205.14719</loc><lastmod>2025-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-hardness-of-promise-hypergraph-colouring-2205.14719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-hardness-of-promise-hypergraph-colouring-2205.14719"/></url>
<url><loc>https://scifaro.com/en/abs/giant-components-in-random-temporal-graphs-2205.14888</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/giant-components-in-random-temporal-graphs-2205.14888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/giant-components-in-random-temporal-graphs-2205.14888"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-compose-shortest-paths-2205.15306</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-compose-shortest-paths-2205.15306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-compose-shortest-paths-2205.15306"/></url>
<url><loc>https://scifaro.com/en/abs/edge-coloring-of-graphs-of-signed-class-1-and-2-2205.15425</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-coloring-of-graphs-of-signed-class-1-and-2-2205.15425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-coloring-of-graphs-of-signed-class-1-and-2-2205.15425"/></url>
<url><loc>https://scifaro.com/en/abs/a-coxeter-type-classification-of-dynkin-type-mathbb-a-n-non-negative-posets-2205.15813</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coxeter-type-classification-of-dynkin-type-mathbb-a-n-non-negative-posets-2205.15813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coxeter-type-classification-of-dynkin-type-mathbb-a-n-non-negative-posets-2205.15813"/></url>
<url><loc>https://scifaro.com/en/abs/a-technical-note-for-a-shor-s-algorithm-by-phase-estimation-2206.00757</loc><lastmod>2022-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-technical-note-for-a-shor-s-algorithm-by-phase-estimation-2206.00757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-technical-note-for-a-shor-s-algorithm-by-phase-estimation-2206.00757"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-structure-estimation-from-bandit-feedback-using-nonvanishing-exponential-sums-2206.00861</loc><lastmod>2024-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-structure-estimation-from-bandit-feedback-using-nonvanishing-exponential-sums-2206.00861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-structure-estimation-from-bandit-feedback-using-nonvanishing-exponential-sums-2206.00861"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-lie-complexity-of-sturmian-words-2206.00995</loc><lastmod>2023-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-lie-complexity-of-sturmian-words-2206.00995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-lie-complexity-of-sturmian-words-2206.00995"/></url>
<url><loc>https://scifaro.com/en/abs/control-hubs-of-complex-networks-and-a-polynomial-time-identification-algorithm-2206.01188</loc><lastmod>2022-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/control-hubs-of-complex-networks-and-a-polynomial-time-identification-algorithm-2206.01188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/control-hubs-of-complex-networks-and-a-polynomial-time-identification-algorithm-2206.01188"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-a-ternary-infinite-word-2206.01776</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-a-ternary-infinite-word-2206.01776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-a-ternary-infinite-word-2206.01776"/></url>
<url><loc>https://scifaro.com/en/abs/on-hamiltonian-connected-and-mycielski-graphs-2206.02385</loc><lastmod>2023-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-hamiltonian-connected-and-mycielski-graphs-2206.02385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-hamiltonian-connected-and-mycielski-graphs-2206.02385"/></url>
<url><loc>https://scifaro.com/en/abs/fibonacci-like-sequences-for-variants-of-the-tower-of-hanoi-and-corresponding-graphs-and-gray-codes-2206.03047</loc><lastmod>2022-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fibonacci-like-sequences-for-variants-of-the-tower-of-hanoi-and-corresponding-graphs-and-gray-codes-2206.03047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fibonacci-like-sequences-for-variants-of-the-tower-of-hanoi-and-corresponding-graphs-and-gray-codes-2206.03047"/></url>
<url><loc>https://scifaro.com/en/abs/perturbative-methods-for-mostly-monotonic-probabilistic-satisfiability-problems-2206.03550</loc><lastmod>2022-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perturbative-methods-for-mostly-monotonic-probabilistic-satisfiability-problems-2206.03550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perturbative-methods-for-mostly-monotonic-probabilistic-satisfiability-problems-2206.03550"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximation-algorithm-for-random-generation-of-capacities-2206.04774</loc><lastmod>2022-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-random-generation-of-capacities-2206.04774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-random-generation-of-capacities-2206.04774"/></url>
<url><loc>https://scifaro.com/en/abs/an-alternative-approach-to-the-exact-network-reliability-assessment-through-the-quickest-path-2206.04865</loc><lastmod>2022-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-alternative-approach-to-the-exact-network-reliability-assessment-through-the-quickest-path-2206.04865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-alternative-approach-to-the-exact-network-reliability-assessment-through-the-quickest-path-2206.04865"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-the-tree-of-shapes-in-n-d-2206.05109</loc><lastmod>2022-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-the-tree-of-shapes-in-n-d-2206.05109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-the-tree-of-shapes-in-n-d-2206.05109"/></url>
<url><loc>https://scifaro.com/en/abs/signed-interval-graphs-and-bigraphs-a-generalization-of-interval-graphs-and-bigraphs-2206.05917</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signed-interval-graphs-and-bigraphs-a-generalization-of-interval-graphs-and-bigraphs-2206.05917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signed-interval-graphs-and-bigraphs-a-generalization-of-interval-graphs-and-bigraphs-2206.05917"/></url>
<url><loc>https://scifaro.com/en/abs/graph-comparison-based-on-adjacency-function-matrix-2206.06082</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-comparison-based-on-adjacency-function-matrix-2206.06082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-comparison-based-on-adjacency-function-matrix-2206.06082"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-allocations-with-the-choice-of-noise-2206.07503</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-allocations-with-the-choice-of-noise-2206.07503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-allocations-with-the-choice-of-noise-2206.07503"/></url>
<url><loc>https://scifaro.com/en/abs/utilitarian-welfare-optimization-in-the-generalized-vertex-coloring-games-an-implication-to-venue-selection-in-events-planning-2206.09153</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/utilitarian-welfare-optimization-in-the-generalized-vertex-coloring-games-an-implication-to-venue-selection-in-events-planning-2206.09153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/utilitarian-welfare-optimization-in-the-generalized-vertex-coloring-games-an-implication-to-venue-selection-in-events-planning-2206.09153"/></url>
<url><loc>https://scifaro.com/en/abs/list-colouring-trees-in-logarithmic-space-2206.09750</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/list-colouring-trees-in-logarithmic-space-2206.09750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/list-colouring-trees-in-logarithmic-space-2206.09750"/></url>
<url><loc>https://scifaro.com/en/abs/a-study-of-weisfeiler-leman-colorings-on-planar-graphs-2206.10557</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-study-of-weisfeiler-leman-colorings-on-planar-graphs-2206.10557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-study-of-weisfeiler-leman-colorings-on-planar-graphs-2206.10557"/></url>
<url><loc>https://scifaro.com/en/abs/attractor-separation-and-signed-cycles-in-asynchronous-boolean-networks-2206.11651</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attractor-separation-and-signed-cycles-in-asynchronous-boolean-networks-2206.11651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attractor-separation-and-signed-cycles-in-asynchronous-boolean-networks-2206.11651"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-tree-partitions-2206.11832</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-tree-partitions-2206.11832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-tree-partitions-2206.11832"/></url>
<url><loc>https://scifaro.com/en/abs/sample-compression-schemes-for-balls-in-graphs-2206.13254</loc><lastmod>2024-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sample-compression-schemes-for-balls-in-graphs-2206.13254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sample-compression-schemes-for-balls-in-graphs-2206.13254"/></url>
<url><loc>https://scifaro.com/en/abs/strengthened-partial-ordering-based-ilp-models-for-the-vertex-coloring-problem-2206.13678</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strengthened-partial-ordering-based-ilp-models-for-the-vertex-coloring-problem-2206.13678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strengthened-partial-ordering-based-ilp-models-for-the-vertex-coloring-problem-2206.13678"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-and-algorithmic-aspects-of-monadic-stability-2206.14509</loc><lastmod>2022-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-and-algorithmic-aspects-of-monadic-stability-2206.14509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-and-algorithmic-aspects-of-monadic-stability-2206.14509"/></url>
<url><loc>https://scifaro.com/en/abs/linearizing-partial-search-orders-2206.14556</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearizing-partial-search-orders-2206.14556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearizing-partial-search-orders-2206.14556"/></url>
<url><loc>https://scifaro.com/en/abs/on-graphs-coverable-by-k-shortest-paths-2206.15088</loc><lastmod>2025-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-graphs-coverable-by-k-shortest-paths-2206.15088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-graphs-coverable-by-k-shortest-paths-2206.15088"/></url>
<url><loc>https://scifaro.com/en/abs/menger-s-theorem-for-temporal-paths-not-walks-2206.15251</loc><lastmod>2025-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/menger-s-theorem-for-temporal-paths-not-walks-2206.15251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/menger-s-theorem-for-temporal-paths-not-walks-2206.15251"/></url>
<url><loc>https://scifaro.com/en/abs/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters-2206.15424</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters-2206.15424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters-2206.15424"/></url>
<url><loc>https://scifaro.com/en/abs/graph-similarity-based-on-matrix-norms-2207.00090</loc><lastmod>2022-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-similarity-based-on-matrix-norms-2207.00090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-similarity-based-on-matrix-norms-2207.00090"/></url>
<url><loc>https://scifaro.com/en/abs/counting-dominating-sets-in-directed-path-graphs-2207.00463</loc><lastmod>2022-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-dominating-sets-in-directed-path-graphs-2207.00463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-dominating-sets-in-directed-path-graphs-2207.00463"/></url>
<url><loc>https://scifaro.com/en/abs/a-gray-code-of-ordered-trees-2207.01129</loc><lastmod>2022-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gray-code-of-ordered-trees-2207.01129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gray-code-of-ordered-trees-2207.01129"/></url>
<url><loc>https://scifaro.com/en/abs/learning-to-accelerate-approximate-methods-for-solving-integer-programming-via-early-fixing-2207.02087</loc><lastmod>2022-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-to-accelerate-approximate-methods-for-solving-integer-programming-via-early-fixing-2207.02087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-to-accelerate-approximate-methods-for-solving-integer-programming-via-early-fixing-2207.02087"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-domination-on-sparse-graph-classes-2207.02669</loc><lastmod>2022-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-domination-on-sparse-graph-classes-2207.02669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-domination-on-sparse-graph-classes-2207.02669"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-approximation-to-a-minimum-dominating-set-in-a-graph-2207.04560</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-approximation-to-a-minimum-dominating-set-in-a-graph-2207.04560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-approximation-to-a-minimum-dominating-set-in-a-graph-2207.04560"/></url>
<url><loc>https://scifaro.com/en/abs/almost-optimum-ell-covering-of-mathbb-z-n-2207.05017</loc><lastmod>2024-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-optimum-ell-covering-of-mathbb-z-n-2207.05017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-optimum-ell-covering-of-mathbb-z-n-2207.05017"/></url>
<url><loc>https://scifaro.com/en/abs/an-extended-version-of-the-ordered-median-tree-location-problem-including-appendices-and-detailed-computational-results-2207.05478</loc><lastmod>2025-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extended-version-of-the-ordered-median-tree-location-problem-including-appendices-and-detailed-computational-results-2207.05478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extended-version-of-the-ordered-median-tree-location-problem-including-appendices-and-detailed-computational-results-2207.05478"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-job-scheduling-with-block-type-conflict-graphs-2207.05868</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-job-scheduling-with-block-type-conflict-graphs-2207.05868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-job-scheduling-with-block-type-conflict-graphs-2207.05868"/></url>
<url><loc>https://scifaro.com/en/abs/robust-factorizations-and-colorings-of-tensor-graphs-2207.08913</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-factorizations-and-colorings-of-tensor-graphs-2207.08913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-factorizations-and-colorings-of-tensor-graphs-2207.08913"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-the-euclidean-bipartite-edge-cover-problem-2207.09063</loc><lastmod>2022-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-the-euclidean-bipartite-edge-cover-problem-2207.09063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-the-euclidean-bipartite-edge-cover-problem-2207.09063"/></url>
<url><loc>https://scifaro.com/en/abs/pamilo-a-solver-for-multi-objective-mixed-integer-linear-optimization-and-beyond-2207.09155</loc><lastmod>2023-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pamilo-a-solver-for-multi-objective-mixed-integer-linear-optimization-and-beyond-2207.09155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pamilo-a-solver-for-multi-objective-mixed-integer-linear-optimization-and-beyond-2207.09155"/></url>
<url><loc>https://scifaro.com/en/abs/contractible-spaces-homotopy-equivalence-and-homeomorphism-in-digital-topology-2207.09730</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contractible-spaces-homotopy-equivalence-and-homeomorphism-in-digital-topology-2207.09730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contractible-spaces-homotopy-equivalence-and-homeomorphism-in-digital-topology-2207.09730"/></url>
<url><loc>https://scifaro.com/en/abs/abelian-combinatorics-on-words-a-survey-2207.09937</loc><lastmod>2023-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abelian-combinatorics-on-words-a-survey-2207.09937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abelian-combinatorics-on-words-a-survey-2207.09937"/></url>
<url><loc>https://scifaro.com/en/abs/the-two-stripe-symmetric-circulant-tsp-is-in-p-2207.10254</loc><lastmod>2022-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-two-stripe-symmetric-circulant-tsp-is-in-p-2207.10254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-two-stripe-symmetric-circulant-tsp-is-in-p-2207.10254"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-class-of-negabent-functions-2207.11015</loc><lastmod>2022-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-class-of-negabent-functions-2207.11015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-class-of-negabent-functions-2207.11015"/></url>
<url><loc>https://scifaro.com/en/abs/automaticity-of-spacetime-diagrams-generated-by-cellular-automata-on-commutative-monoids-2207.13062</loc><lastmod>2026-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automaticity-of-spacetime-diagrams-generated-by-cellular-automata-on-commutative-monoids-2207.13062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automaticity-of-spacetime-diagrams-generated-by-cellular-automata-on-commutative-monoids-2207.13062"/></url>
<url><loc>https://scifaro.com/en/abs/very-large-scale-neighborhood-search-for-drone-routing-with-energy-replenishment-2207.13940</loc><lastmod>2022-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/very-large-scale-neighborhood-search-for-drone-routing-with-energy-replenishment-2207.13940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/very-large-scale-neighborhood-search-for-drone-routing-with-energy-replenishment-2207.13940"/></url>
<url><loc>https://scifaro.com/en/abs/post-processing-of-coronary-and-myocardial-spatial-data-2207.14624</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/post-processing-of-coronary-and-myocardial-spatial-data-2207.14624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/post-processing-of-coronary-and-myocardial-spatial-data-2207.14624"/></url>
<url><loc>https://scifaro.com/en/abs/a-heuristic-technique-for-decomposing-multisets-of-non-negative-integers-according-to-the-minkowski-sum-2208.00458</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-heuristic-technique-for-decomposing-multisets-of-non-negative-integers-according-to-the-minkowski-sum-2208.00458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-heuristic-technique-for-decomposing-multisets-of-non-negative-integers-according-to-the-minkowski-sum-2208.00458"/></url>
<url><loc>https://scifaro.com/en/abs/100-prisoners-and-a-lightbulb-looking-back-2208.00771</loc><lastmod>2022-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/100-prisoners-and-a-lightbulb-looking-back-2208.00771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/100-prisoners-and-a-lightbulb-looking-back-2208.00771"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximate-generalization-of-the-okamura-seymour-theorem-2208.00795</loc><lastmod>2025-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximate-generalization-of-the-okamura-seymour-theorem-2208.00795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximate-generalization-of-the-okamura-seymour-theorem-2208.00795"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-covering-codes-in-rt-spaces-using-ordered-covering-arrays-2208.01412</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-covering-codes-in-rt-spaces-using-ordered-covering-arrays-2208.01412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-covering-codes-in-rt-spaces-using-ordered-covering-arrays-2208.01412"/></url>
<url><loc>https://scifaro.com/en/abs/extremal-numbers-of-disjoint-triangles-in-r-partite-graphs-2208.01470</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extremal-numbers-of-disjoint-triangles-in-r-partite-graphs-2208.01470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extremal-numbers-of-disjoint-triangles-in-r-partite-graphs-2208.01470"/></url>
<url><loc>https://scifaro.com/en/abs/interval-dismantling-for-lattices-2208.01479</loc><lastmod>2023-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-dismantling-for-lattices-2208.01479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-dismantling-for-lattices-2208.01479"/></url>
<url><loc>https://scifaro.com/en/abs/simple-strict-proper-happy-a-study-of-reachability-in-temporal-graphs-2208.01720</loc><lastmod>2024-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-strict-proper-happy-a-study-of-reachability-in-temporal-graphs-2208.01720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-strict-proper-happy-a-study-of-reachability-in-temporal-graphs-2208.01720"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-lower-bound-for-k-unbounded-hamiltonian-cycles-2208.02153</loc><lastmod>2022-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-lower-bound-for-k-unbounded-hamiltonian-cycles-2208.02153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-lower-bound-for-k-unbounded-hamiltonian-cycles-2208.02153"/></url>
<url><loc>https://scifaro.com/en/abs/the-identity-problem-in-nilpotent-groups-of-bounded-class-2208.02164</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-identity-problem-in-nilpotent-groups-of-bounded-class-2208.02164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-identity-problem-in-nilpotent-groups-of-bounded-class-2208.02164"/></url>
<url><loc>https://scifaro.com/en/abs/on-brooks-theorem-2208.02186</loc><lastmod>2025-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-brooks-theorem-2208.02186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-brooks-theorem-2208.02186"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-some-cosets-of-reed-muller-codes-2208.02469</loc><lastmod>2023-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-some-cosets-of-reed-muller-codes-2208.02469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-some-cosets-of-reed-muller-codes-2208.02469"/></url>
<url><loc>https://scifaro.com/en/abs/expanded-clique-graphs-and-the-domination-problem-2208.03411</loc><lastmod>2024-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expanded-clique-graphs-and-the-domination-problem-2208.03411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expanded-clique-graphs-and-the-domination-problem-2208.03411"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-independent-sets-in-sparse-dense-graphs-2208.04408</loc><lastmod>2022-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-independent-sets-in-sparse-dense-graphs-2208.04408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-independent-sets-in-sparse-dense-graphs-2208.04408"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-trickle-down-theorem-for-partite-complexes-2208.04486</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-trickle-down-theorem-for-partite-complexes-2208.04486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-trickle-down-theorem-for-partite-complexes-2208.04486"/></url>
<url><loc>https://scifaro.com/en/abs/the-weighted-tower-of-hanoi-2208.06705</loc><lastmod>2026-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weighted-tower-of-hanoi-2208.06705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weighted-tower-of-hanoi-2208.06705"/></url>
<url><loc>https://scifaro.com/en/abs/walking-on-words-2208.08913</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/walking-on-words-2208.08913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/walking-on-words-2208.08913"/></url>
<url><loc>https://scifaro.com/en/abs/the-oriented-relative-clique-number-of-triangle-free-planar-graphs-is-10-2208.10188</loc><lastmod>2022-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-oriented-relative-clique-number-of-triangle-free-planar-graphs-is-10-2208.10188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-oriented-relative-clique-number-of-triangle-free-planar-graphs-is-10-2208.10188"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-characteristic-polynomial-of-the-a-alpha-matrix-for-some-operations-of-graphs-2208.10557</loc><lastmod>2022-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-characteristic-polynomial-of-the-a-alpha-matrix-for-some-operations-of-graphs-2208.10557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-characteristic-polynomial-of-the-a-alpha-matrix-for-some-operations-of-graphs-2208.10557"/></url>
<url><loc>https://scifaro.com/en/abs/homomorphically-full-oriented-graphs-2208.10727</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homomorphically-full-oriented-graphs-2208.10727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homomorphically-full-oriented-graphs-2208.10727"/></url>
<url><loc>https://scifaro.com/en/abs/attractor-stability-in-finite-asynchronous-biological-system-models-2208.11732</loc><lastmod>2022-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attractor-stability-in-finite-asynchronous-biological-system-models-2208.11732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attractor-stability-in-finite-asynchronous-biological-system-models-2208.11732"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-load-balancing-algorithms-on-edge-markovian-evolving-graphs-2208.12130</loc><lastmod>2022-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-load-balancing-algorithms-on-edge-markovian-evolving-graphs-2208.12130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-load-balancing-algorithms-on-edge-markovian-evolving-graphs-2208.12130"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-binary-csp-vertex-cover-treedepth-and-related-parameters-2208.12543</loc><lastmod>2023-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-binary-csp-vertex-cover-treedepth-and-related-parameters-2208.12543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-binary-csp-vertex-cover-treedepth-and-related-parameters-2208.12543"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedral-results-and-stronger-lagrangean-bounds-for-stable-spanning-trees-2208.13014</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedral-results-and-stronger-lagrangean-bounds-for-stable-spanning-trees-2208.13014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedral-results-and-stronger-lagrangean-bounds-for-stable-spanning-trees-2208.13014"/></url>
<url><loc>https://scifaro.com/en/abs/mathematical-models-to-analyze-lua-hybrid-tables-and-why-they-need-a-fix-2208.13602</loc><lastmod>2023-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathematical-models-to-analyze-lua-hybrid-tables-and-why-they-need-a-fix-2208.13602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathematical-models-to-analyze-lua-hybrid-tables-and-why-they-need-a-fix-2208.13602"/></url>
<url><loc>https://scifaro.com/en/abs/consecutive-k-out-of-n-f-systems-have-unbounded-roots-2208.14173</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consecutive-k-out-of-n-f-systems-have-unbounded-roots-2208.14173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consecutive-k-out-of-n-f-systems-have-unbounded-roots-2208.14173"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-mixed-and-directional-interval-graphs-2208.14250</loc><lastmod>2024-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-mixed-and-directional-interval-graphs-2208.14250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-mixed-and-directional-interval-graphs-2208.14250"/></url>
<url><loc>https://scifaro.com/en/abs/simpler-and-efficient-characterizations-of-tree-t-spanners-for-graphs-with-few-p4-s-and-k-l-graphs-2208.14309</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simpler-and-efficient-characterizations-of-tree-t-spanners-for-graphs-with-few-p4-s-and-k-l-graphs-2208.14309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simpler-and-efficient-characterizations-of-tree-t-spanners-for-graphs-with-few-p4-s-and-k-l-graphs-2208.14309"/></url>
<url><loc>https://scifaro.com/en/abs/some-properties-of-morphic-images-of-eventually-dendric-words-2208.14718</loc><lastmod>2023-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-properties-of-morphic-images-of-eventually-dendric-words-2208.14718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-properties-of-morphic-images-of-eventually-dendric-words-2208.14718"/></url>
<url><loc>https://scifaro.com/en/abs/a-case-study-of-the-profit-maximizing-multi-vehicle-pickup-and-delivery-selection-problem-for-the-road-networks-with-the-integratable-nodes-2208.14866</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-case-study-of-the-profit-maximizing-multi-vehicle-pickup-and-delivery-selection-problem-for-the-road-networks-with-the-integratable-nodes-2208.14866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-case-study-of-the-profit-maximizing-multi-vehicle-pickup-and-delivery-selection-problem-for-the-road-networks-with-the-integratable-nodes-2208.14866"/></url>
<url><loc>https://scifaro.com/en/abs/geometrical-tilings-distance-topology-compactness-and-completeness-2208.14922</loc><lastmod>2022-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometrical-tilings-distance-topology-compactness-and-completeness-2208.14922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometrical-tilings-distance-topology-compactness-and-completeness-2208.14922"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-geometric-intersection-graphs-stabbed-by-a-line-2209.01851</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-geometric-intersection-graphs-stabbed-by-a-line-2209.01851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-geometric-intersection-graphs-stabbed-by-a-line-2209.01851"/></url>
<url><loc>https://scifaro.com/en/abs/innovative-ideas-for-teaching-supports-application-to-graph-theory-2209.05078</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/innovative-ideas-for-teaching-supports-application-to-graph-theory-2209.05078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/innovative-ideas-for-teaching-supports-application-to-graph-theory-2209.05078"/></url>
<url><loc>https://scifaro.com/en/abs/eternal-vertex-cover-number-of-infinite-and-finite-grid-graphs-2209.05102</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eternal-vertex-cover-number-of-infinite-and-finite-grid-graphs-2209.05102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eternal-vertex-cover-number-of-infinite-and-finite-grid-graphs-2209.05102"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-quickest-minimum-cost-transshipment-problem-2209.05558</loc><lastmod>2023-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-quickest-minimum-cost-transshipment-problem-2209.05558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-quickest-minimum-cost-transshipment-problem-2209.05558"/></url>
<url><loc>https://scifaro.com/en/abs/triangle-evacuation-of-2-agents-in-the-wireless-model-2209.08544</loc><lastmod>2022-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangle-evacuation-of-2-agents-in-the-wireless-model-2209.08544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangle-evacuation-of-2-agents-in-the-wireless-model-2209.08544"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-of-the-number-of-period-sets-in-strings-2209.08926</loc><lastmod>2023-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-of-the-number-of-period-sets-in-strings-2209.08926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-of-the-number-of-period-sets-in-strings-2209.08926"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-horizons-and-a-characterization-of-stable-hereditary-classes-of-graphs-2209.11229</loc><lastmod>2024-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-horizons-and-a-characterization-of-stable-hereditary-classes-of-graphs-2209.11229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-horizons-and-a-characterization-of-stable-hereditary-classes-of-graphs-2209.11229"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-cryptomorphism-between-davis-subset-lattices-atomic-lattices-and-closure-systems-under-t1-separation-axiom-2209.12256</loc><lastmod>2022-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-cryptomorphism-between-davis-subset-lattices-atomic-lattices-and-closure-systems-under-t1-separation-axiom-2209.12256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-cryptomorphism-between-davis-subset-lattices-atomic-lattices-and-closure-systems-under-t1-separation-axiom-2209.12256"/></url>
<url><loc>https://scifaro.com/en/abs/maker-breaker-is-solved-in-polynomial-time-on-hypergraphs-of-rank-3-2209.12819</loc><lastmod>2025-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maker-breaker-is-solved-in-polynomial-time-on-hypergraphs-of-rank-3-2209.12819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maker-breaker-is-solved-in-polynomial-time-on-hypergraphs-of-rank-3-2209.12819"/></url>
<url><loc>https://scifaro.com/en/abs/a-spectral-algorithm-for-finding-maximum-cliques-in-dense-random-intersection-graphs-2210.02121</loc><lastmod>2022-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spectral-algorithm-for-finding-maximum-cliques-in-dense-random-intersection-graphs-2210.02121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spectral-algorithm-for-finding-maximum-cliques-in-dense-random-intersection-graphs-2210.02121"/></url>
<url><loc>https://scifaro.com/en/abs/a-flow-based-formulation-for-parallel-machine-scheduling-using-decision-diagrams-2210.02434</loc><lastmod>2022-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-flow-based-formulation-for-parallel-machine-scheduling-using-decision-diagrams-2210.02434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-flow-based-formulation-for-parallel-machine-scheduling-using-decision-diagrams-2210.02434"/></url>
<url><loc>https://scifaro.com/en/abs/random-max-csps-inherit-algorithmic-hardness-from-spin-glasses-2210.03006</loc><lastmod>2023-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-max-csps-inherit-algorithmic-hardness-from-spin-glasses-2210.03006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-max-csps-inherit-algorithmic-hardness-from-spin-glasses-2210.03006"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-the-shortest-path-the-path-length-index-as-a-distribution-2210.03216</loc><lastmod>2022-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-the-shortest-path-the-path-length-index-as-a-distribution-2210.03216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-the-shortest-path-the-path-length-index-as-a-distribution-2210.03216"/></url>
<url><loc>https://scifaro.com/en/abs/edge-deletion-to-tree-like-graph-classes-2210.03839</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-deletion-to-tree-like-graph-classes-2210.03839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-deletion-to-tree-like-graph-classes-2210.03839"/></url>
<url><loc>https://scifaro.com/en/abs/speeding-up-the-solution-of-the-site-and-power-assignment-problem-in-wireless-networks-2210.04022</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-the-solution-of-the-site-and-power-assignment-problem-in-wireless-networks-2210.04022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-the-solution-of-the-site-and-power-assignment-problem-in-wireless-networks-2210.04022"/></url>
<url><loc>https://scifaro.com/en/abs/visualizing-multispecies-coalescent-trees-drawing-gene-trees-inside-species-trees-2210.06744</loc><lastmod>2022-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualizing-multispecies-coalescent-trees-drawing-gene-trees-inside-species-trees-2210.06744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualizing-multispecies-coalescent-trees-drawing-gene-trees-inside-species-trees-2210.06744"/></url>
<url><loc>https://scifaro.com/en/abs/cut-paths-and-their-remainder-structure-with-applications-2210.07530</loc><lastmod>2022-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-paths-and-their-remainder-structure-with-applications-2210.07530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-paths-and-their-remainder-structure-with-applications-2210.07530"/></url>
<url><loc>https://scifaro.com/en/abs/on-powers-of-circular-arc-graphs-2210.08782</loc><lastmod>2026-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-powers-of-circular-arc-graphs-2210.08782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-powers-of-circular-arc-graphs-2210.08782"/></url>
<url><loc>https://scifaro.com/en/abs/the-smallest-5-chromatic-tournament-2210.09936</loc><lastmod>2023-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-smallest-5-chromatic-tournament-2210.09936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-smallest-5-chromatic-tournament-2210.09936"/></url>
<url><loc>https://scifaro.com/en/abs/factorisation-in-the-semiring-of-finite-dynamical-systems-2210.11270</loc><lastmod>2022-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factorisation-in-the-semiring-of-finite-dynamical-systems-2210.11270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factorisation-in-the-semiring-of-finite-dynamical-systems-2210.11270"/></url>
<url><loc>https://scifaro.com/en/abs/dna-tile-self-assembly-for-3d-surfaces-towards-genus-identification-2210.13094</loc><lastmod>2023-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dna-tile-self-assembly-for-3d-surfaces-towards-genus-identification-2210.13094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dna-tile-self-assembly-for-3d-surfaces-towards-genus-identification-2210.13094"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-of-rounding-2211.02694</loc><lastmod>2022-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-of-rounding-2211.02694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-of-rounding-2211.02694"/></url>
<url><loc>https://scifaro.com/en/abs/on-fork-free-t-perfect-graphs-2211.03538</loc><lastmod>2022-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-fork-free-t-perfect-graphs-2211.03538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-fork-free-t-perfect-graphs-2211.03538"/></url>
<url><loc>https://scifaro.com/en/abs/aednet-adaptive-edge-deleting-network-for-subgraph-matching-2211.04033</loc><lastmod>2022-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aednet-adaptive-edge-deleting-network-for-subgraph-matching-2211.04033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aednet-adaptive-edge-deleting-network-for-subgraph-matching-2211.04033"/></url>
<url><loc>https://scifaro.com/en/abs/graph-classes-equivalent-to-12-representable-graphs-2211.04871</loc><lastmod>2022-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-classes-equivalent-to-12-representable-graphs-2211.04871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-classes-equivalent-to-12-representable-graphs-2211.04871"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-of-probability-marginals-for-security-games-in-max-flow-min-cut-systems-2211.04922</loc><lastmod>2023-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-of-probability-marginals-for-security-games-in-max-flow-min-cut-systems-2211.04922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-of-probability-marginals-for-security-games-in-max-flow-min-cut-systems-2211.04922"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-solving-a-system-of-difference-constraints-with-variables-restricted-to-a-finite-set-2211.05259</loc><lastmod>2022-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-solving-a-system-of-difference-constraints-with-variables-restricted-to-a-finite-set-2211.05259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-solving-a-system-of-difference-constraints-with-variables-restricted-to-a-finite-set-2211.05259"/></url>
<url><loc>https://scifaro.com/en/abs/tree-layout-based-graph-classes-proper-chordal-graphs-2211.07550</loc><lastmod>2024-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-layout-based-graph-classes-proper-chordal-graphs-2211.07550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-layout-based-graph-classes-proper-chordal-graphs-2211.07550"/></url>
<url><loc>https://scifaro.com/en/abs/geometrical-penrose-tilings-are-characterized-by-their-1-atlas-2211.08239</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometrical-penrose-tilings-are-characterized-by-their-1-atlas-2211.08239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometrical-penrose-tilings-are-characterized-by-their-1-atlas-2211.08239"/></url>
<url><loc>https://scifaro.com/en/abs/the-red-blue-separation-problem-on-graphs-2211.08283</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-red-blue-separation-problem-on-graphs-2211.08283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-red-blue-separation-problem-on-graphs-2211.08283"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-heuristics-applied-to-vertex-reliability-2211.08514</loc><lastmod>2022-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-heuristics-applied-to-vertex-reliability-2211.08514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-heuristics-applied-to-vertex-reliability-2211.08514"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-the-edges-of-product-networks-using-distances-2211.10743</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-the-edges-of-product-networks-using-distances-2211.10743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-the-edges-of-product-networks-using-distances-2211.10743"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-bounds-on-the-k-traveling-salesman-problem-and-the-traveling-repairman-problem-2211.11063</loc><lastmod>2022-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-bounds-on-the-k-traveling-salesman-problem-and-the-traveling-repairman-problem-2211.11063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-bounds-on-the-k-traveling-salesman-problem-and-the-traveling-repairman-problem-2211.11063"/></url>
<url><loc>https://scifaro.com/en/abs/additional-results-and-extensions-for-the-paper-probabilistic-bounds-on-the-k-traveling-salesman-problem-and-the-traveling-repairman-problem-2211.11065</loc><lastmod>2022-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/additional-results-and-extensions-for-the-paper-probabilistic-bounds-on-the-k-traveling-salesman-problem-and-the-traveling-repairman-problem-2211.11065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/additional-results-and-extensions-for-the-paper-probabilistic-bounds-on-the-k-traveling-salesman-problem-and-the-traveling-repairman-problem-2211.11065"/></url>
<url><loc>https://scifaro.com/en/abs/a-min-max-theorem-for-the-minimum-fleet-size-problem-2211.11173</loc><lastmod>2023-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-min-max-theorem-for-the-minimum-fleet-size-problem-2211.11173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-min-max-theorem-for-the-minimum-fleet-size-problem-2211.11173"/></url>
<url><loc>https://scifaro.com/en/abs/stabilization-of-capacitated-matching-games-2211.12179</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabilization-of-capacitated-matching-games-2211.12179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabilization-of-capacitated-matching-games-2211.12179"/></url>
<url><loc>https://scifaro.com/en/abs/equality-on-all-csp-instances-yields-constraint-function-isomorphism-via-interpolation-and-intertwiners-2211.13688</loc><lastmod>2022-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equality-on-all-csp-instances-yields-constraint-function-isomorphism-via-interpolation-and-intertwiners-2211.13688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equality-on-all-csp-instances-yields-constraint-function-isomorphism-via-interpolation-and-intertwiners-2211.13688"/></url>
<url><loc>https://scifaro.com/en/abs/fast-m-obius-and-zeta-transforms-2211.13706</loc><lastmod>2022-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-m-obius-and-zeta-transforms-2211.13706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-m-obius-and-zeta-transforms-2211.13706"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-framework-for-forbidden-subgraphs-ii-edge-subdivision-and-the-h-graphs-2211.14214</loc><lastmod>2024-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-framework-for-forbidden-subgraphs-ii-edge-subdivision-and-the-h-graphs-2211.14214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-framework-for-forbidden-subgraphs-ii-edge-subdivision-and-the-h-graphs-2211.14214"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-for-all-and-max-gain-policy-iteration-algorithms-on-deterministic-mdps-2211.15602</loc><lastmod>2023-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-for-all-and-max-gain-policy-iteration-algorithms-on-deterministic-mdps-2211.15602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-for-all-and-max-gain-policy-iteration-algorithms-on-deterministic-mdps-2211.15602"/></url>
<url><loc>https://scifaro.com/en/abs/planar-csp-equality-corresponds-to-quantum-isomorphism-a-holant-viewpoint-2212.03335</loc><lastmod>2025-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-csp-equality-corresponds-to-quantum-isomorphism-a-holant-viewpoint-2212.03335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-csp-equality-corresponds-to-quantum-isomorphism-a-holant-viewpoint-2212.03335"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-lorenz-dominance-orders-2212.03811</loc><lastmod>2022-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-lorenz-dominance-orders-2212.03811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-lorenz-dominance-orders-2212.03811"/></url>
<url><loc>https://scifaro.com/en/abs/gap-preserving-reductions-between-reconfiguration-problems-2212.04207</loc><lastmod>2025-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gap-preserving-reductions-between-reconfiguration-problems-2212.04207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gap-preserving-reductions-between-reconfiguration-problems-2212.04207"/></url>
<url><loc>https://scifaro.com/en/abs/degreewidth-a-new-parameter-for-solving-problems-on-tournaments-2212.06007</loc><lastmod>2022-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degreewidth-a-new-parameter-for-solving-problems-on-tournaments-2212.06007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degreewidth-a-new-parameter-for-solving-problems-on-tournaments-2212.06007"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-maintenance-cycles-in-systems-with-critical-and-non-critical-components-2212.06070</loc><lastmod>2022-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-maintenance-cycles-in-systems-with-critical-and-non-critical-components-2212.06070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-maintenance-cycles-in-systems-with-critical-and-non-critical-components-2212.06070"/></url>
<url><loc>https://scifaro.com/en/abs/fault-tolerant-locating-dominating-sets-with-error-correction-2212.08193</loc><lastmod>2022-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fault-tolerant-locating-dominating-sets-with-error-correction-2212.08193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fault-tolerant-locating-dominating-sets-with-error-correction-2212.08193"/></url>
<url><loc>https://scifaro.com/en/abs/factorizing-lattices-by-interval-relations-2212.10208</loc><lastmod>2022-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factorizing-lattices-by-interval-relations-2212.10208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factorizing-lattices-by-interval-relations-2212.10208"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-into-special-classes-of-cyclic-graphs-and-its-applications-in-vlsi-layout-2212.12312</loc><lastmod>2022-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-into-special-classes-of-cyclic-graphs-and-its-applications-in-vlsi-layout-2212.12312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-into-special-classes-of-cyclic-graphs-and-its-applications-in-vlsi-layout-2212.12312"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-minimal-trap-spaces-in-boolean-networks-2212.12756</loc><lastmod>2024-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-minimal-trap-spaces-in-boolean-networks-2212.12756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-minimal-trap-spaces-in-boolean-networks-2212.12756"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraphs-with-polynomial-representation-introducing-r-splits-2212.13822</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraphs-with-polynomial-representation-introducing-r-splits-2212.13822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraphs-with-polynomial-representation-introducing-r-splits-2212.13822"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-probabilistic-extension-of-the-oldenburger-kolakoski-sequence-2301.01116</loc><lastmod>2023-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-probabilistic-extension-of-the-oldenburger-kolakoski-sequence-2301.01116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-probabilistic-extension-of-the-oldenburger-kolakoski-sequence-2301.01116"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-words-using-queries-on-subwords-or-factors-2301.01571</loc><lastmod>2023-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-words-using-queries-on-subwords-or-factors-2301.01571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-words-using-queries-on-subwords-or-factors-2301.01571"/></url>
<url><loc>https://scifaro.com/en/abs/simpler-and-faster-algorithms-for-detours-in-planar-digraphs-2301.02421</loc><lastmod>2023-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simpler-and-faster-algorithms-for-detours-in-planar-digraphs-2301.02421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simpler-and-faster-algorithms-for-detours-in-planar-digraphs-2301.02421"/></url>
<url><loc>https://scifaro.com/en/abs/perturbation-results-for-distance-edge-monitoring-numbers-2301.02507</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perturbation-results-for-distance-edge-monitoring-numbers-2301.02507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perturbation-results-for-distance-edge-monitoring-numbers-2301.02507"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-for-a-alpha-eigenvalues-2301.02733</loc><lastmod>2023-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-for-a-alpha-eigenvalues-2301.02733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-for-a-alpha-eigenvalues-2301.02733"/></url>
<url><loc>https://scifaro.com/en/abs/digraph-redicolouring-2301.03417</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digraph-redicolouring-2301.03417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digraph-redicolouring-2301.03417"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-properties-of-optimal-transport-based-temporal-hypernetworks-2301.03498</loc><lastmod>2023-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-properties-of-optimal-transport-based-temporal-hypernetworks-2301.03498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-properties-of-optimal-transport-based-temporal-hypernetworks-2301.03498"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-morse-functions-and-watersheds-2301.03840</loc><lastmod>2023-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-morse-functions-and-watersheds-2301.03840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-morse-functions-and-watersheds-2301.03840"/></url>
<url><loc>https://scifaro.com/en/abs/contact-graphs-of-boxes-with-unidirectional-contacts-2301.03865</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contact-graphs-of-boxes-with-unidirectional-contacts-2301.03865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contact-graphs-of-boxes-with-unidirectional-contacts-2301.03865"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-time-formulations-for-multi-mode-project-scheduling-2301.04700</loc><lastmod>2023-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-time-formulations-for-multi-mode-project-scheduling-2301.04700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-time-formulations-for-multi-mode-project-scheduling-2301.04700"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraph-horn-functions-2301.05461</loc><lastmod>2023-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraph-horn-functions-2301.05461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraph-horn-functions-2301.05461"/></url>
<url><loc>https://scifaro.com/en/abs/dyck-words-pattern-avoidance-and-automatic-sequences-2301.06145</loc><lastmod>2026-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dyck-words-pattern-avoidance-and-automatic-sequences-2301.06145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dyck-words-pattern-avoidance-and-automatic-sequences-2301.06145"/></url>
<url><loc>https://scifaro.com/en/abs/the-binary-linearization-complexity-of-pseudo-boolean-functions-2301.06207</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-binary-linearization-complexity-of-pseudo-boolean-functions-2301.06207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-binary-linearization-complexity-of-pseudo-boolean-functions-2301.06207"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-implementation-and-a-strengthening-of-alon-tarsi-list-coloring-method-2301.06571</loc><lastmod>2023-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-implementation-and-a-strengthening-of-alon-tarsi-list-coloring-method-2301.06571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-implementation-and-a-strengthening-of-alon-tarsi-list-coloring-method-2301.06571"/></url>
<url><loc>https://scifaro.com/en/abs/expansivity-and-periodicity-in-algebraic-subshifts-2301.06868</loc><lastmod>2023-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expansivity-and-periodicity-in-algebraic-subshifts-2301.06868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expansivity-and-periodicity-in-algebraic-subshifts-2301.06868"/></url>
<url><loc>https://scifaro.com/en/abs/matchings-under-distance-constraints-ii-2301.08988</loc><lastmod>2023-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matchings-under-distance-constraints-ii-2301.08988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matchings-under-distance-constraints-ii-2301.08988"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-graphs-generators-analysis-an-illustrative-case-study-2301.09458</loc><lastmod>2023-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-graphs-generators-analysis-an-illustrative-case-study-2301.09458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-graphs-generators-analysis-an-illustrative-case-study-2301.09458"/></url>
<url><loc>https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-infinite-square-grid-is-15-2301.09757</loc><lastmod>2025-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-infinite-square-grid-is-15-2301.09757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-packing-chromatic-number-of-the-infinite-square-grid-is-15-2301.09757"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-allocations-with-heterogeneous-bins-the-power-of-memory-2301.09810</loc><lastmod>2023-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-allocations-with-heterogeneous-bins-the-power-of-memory-2301.09810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-allocations-with-heterogeneous-bins-the-power-of-memory-2301.09810"/></url>
<url><loc>https://scifaro.com/en/abs/a-strongly-polynomial-time-algorithm-for-weighted-general-factors-with-three-feasible-degrees-2301.11761</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strongly-polynomial-time-algorithm-for-weighted-general-factors-with-three-feasible-degrees-2301.11761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strongly-polynomial-time-algorithm-for-weighted-general-factors-with-three-feasible-degrees-2301.11761"/></url>
<url><loc>https://scifaro.com/en/abs/pace-solver-description-a-heuristic-directed-feedback-vertex-set-problem-algorithm-2301.11927</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pace-solver-description-a-heuristic-directed-feedback-vertex-set-problem-algorithm-2301.11927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pace-solver-description-a-heuristic-directed-feedback-vertex-set-problem-algorithm-2301.11927"/></url>
<url><loc>https://scifaro.com/en/abs/ridepooling-and-public-bus-services-a-comparative-case-study-2302.01709</loc><lastmod>2023-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ridepooling-and-public-bus-services-a-comparative-case-study-2302.01709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ridepooling-and-public-bus-services-a-comparative-case-study-2302.01709"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-for-asynchronous-boolean-networks-elimination-of-negatively-autoregulated-components-2302.03108</loc><lastmod>2024-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-for-asynchronous-boolean-networks-elimination-of-negatively-autoregulated-components-2302.03108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-for-asynchronous-boolean-networks-elimination-of-negatively-autoregulated-components-2302.03108"/></url>
<url><loc>https://scifaro.com/en/abs/degree-3-planar-graphs-as-topological-minors-of-wall-graphs-in-polynomial-time-2302.03461</loc><lastmod>2023-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-3-planar-graphs-as-topological-minors-of-wall-graphs-in-polynomial-time-2302.03461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-3-planar-graphs-as-topological-minors-of-wall-graphs-in-polynomial-time-2302.03461"/></url>
<url><loc>https://scifaro.com/en/abs/cliques-in-high-dimensional-geometric-inhomogeneous-random-graphs-2302.04113</loc><lastmod>2024-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cliques-in-high-dimensional-geometric-inhomogeneous-random-graphs-2302.04113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cliques-in-high-dimensional-geometric-inhomogeneous-random-graphs-2302.04113"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-allocations-in-batches-the-tower-of-two-choices-2302.04399</loc><lastmod>2023-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-allocations-in-batches-the-tower-of-two-choices-2302.04399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-allocations-in-batches-the-tower-of-two-choices-2302.04399"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-large-neighborhood-search-for-a-personnel-task-scheduling-problem-with-task-selection-and-parallel-task-assignments-2302.04494</loc><lastmod>2023-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-large-neighborhood-search-for-a-personnel-task-scheduling-problem-with-task-selection-and-parallel-task-assignments-2302.04494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-large-neighborhood-search-for-a-personnel-task-scheduling-problem-with-task-selection-and-parallel-task-assignments-2302.04494"/></url>
<url><loc>https://scifaro.com/en/abs/partial-optimality-in-cubic-correlation-clustering-2302.04694</loc><lastmod>2023-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-optimality-in-cubic-correlation-clustering-2302.04694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-optimality-in-cubic-correlation-clustering-2302.04694"/></url>
<url><loc>https://scifaro.com/en/abs/the-coxeter-symmetries-of-high-level-general-sequential-computation-in-the-invertible-digital-and-quantum-domains-2302.05171</loc><lastmod>2023-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-coxeter-symmetries-of-high-level-general-sequential-computation-in-the-invertible-digital-and-quantum-domains-2302.05171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-coxeter-symmetries-of-high-level-general-sequential-computation-in-the-invertible-digital-and-quantum-domains-2302.05171"/></url>
<url><loc>https://scifaro.com/en/abs/recognising-permuted-demidenko-matrices-2302.05191</loc><lastmod>2023-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognising-permuted-demidenko-matrices-2302.05191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognising-permuted-demidenko-matrices-2302.05191"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mixing-time-of-glauber-dynamics-for-the-hard-core-and-related-models-on-g-n-d-n-2302.06172</loc><lastmod>2023-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mixing-time-of-glauber-dynamics-for-the-hard-core-and-related-models-on-g-n-d-n-2302.06172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mixing-time-of-glauber-dynamics-for-the-hard-core-and-related-models-on-g-n-d-n-2302.06172"/></url>
<url><loc>https://scifaro.com/en/abs/snapshot-disjointness-in-temporal-graphs-2302.06653</loc><lastmod>2023-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/snapshot-disjointness-in-temporal-graphs-2302.06653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/snapshot-disjointness-in-temporal-graphs-2302.06653"/></url>
<url><loc>https://scifaro.com/en/abs/graph-subshifts-2302.07249</loc><lastmod>2026-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-subshifts-2302.07249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-subshifts-2302.07249"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-flows-with-time-dependent-capacities-2302.07657</loc><lastmod>2023-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-flows-with-time-dependent-capacities-2302.07657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-flows-with-time-dependent-capacities-2302.07657"/></url>
<url><loc>https://scifaro.com/en/abs/broadcasting-with-random-matrices-2302.11657</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/broadcasting-with-random-matrices-2302.11657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/broadcasting-with-random-matrices-2302.11657"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-drawing-of-layered-trees-2302.11952</loc><lastmod>2024-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-drawing-of-layered-trees-2302.11952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-drawing-of-layered-trees-2302.11952"/></url>
<url><loc>https://scifaro.com/en/abs/the-domino-problem-is-undecidable-on-every-rhombus-subshift-2302.12086</loc><lastmod>2023-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-domino-problem-is-undecidable-on-every-rhombus-subshift-2302.12086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-domino-problem-is-undecidable-on-every-rhombus-subshift-2302.12086"/></url>
<url><loc>https://scifaro.com/en/abs/cosecure-domination-hardness-results-and-algorithm-2302.13031</loc><lastmod>2023-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cosecure-domination-hardness-results-and-algorithm-2302.13031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cosecure-domination-hardness-results-and-algorithm-2302.13031"/></url>
<url><loc>https://scifaro.com/en/abs/isolated-suborders-and-their-application-to-counting-closure-operators-2302.13081</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isolated-suborders-and-their-application-to-counting-closure-operators-2302.13081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isolated-suborders-and-their-application-to-counting-closure-operators-2302.13081"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-local-identifying-and-local-locating-dominating-codes-2302.13351</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-local-identifying-and-local-locating-dominating-codes-2302.13351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-local-identifying-and-local-locating-dominating-codes-2302.13351"/></url>
<url><loc>https://scifaro.com/en/abs/the-total-matching-polytope-of-complete-bipartite-graphs-2303.00328</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-total-matching-polytope-of-complete-bipartite-graphs-2303.00328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-total-matching-polytope-of-complete-bipartite-graphs-2303.00328"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-discretization-discovery-under-hard-node-storage-constraints-2303.01419</loc><lastmod>2023-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-discretization-discovery-under-hard-node-storage-constraints-2303.01419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-discretization-discovery-under-hard-node-storage-constraints-2303.01419"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-total-dominator-coloring-in-graphs-2303.01746</loc><lastmod>2023-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-total-dominator-coloring-in-graphs-2303.01746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-total-dominator-coloring-in-graphs-2303.01746"/></url>
<url><loc>https://scifaro.com/en/abs/odd-chromatic-number-of-graph-classes-2303.03225</loc><lastmod>2023-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/odd-chromatic-number-of-graph-classes-2303.03225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/odd-chromatic-number-of-graph-classes-2303.03225"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-maximal-cliques-in-two-dimensional-random-geometric-graphs-euclidean-and-hyperbolic-2303.06301</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-maximal-cliques-in-two-dimensional-random-geometric-graphs-euclidean-and-hyperbolic-2303.06301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-maximal-cliques-in-two-dimensional-random-geometric-graphs-euclidean-and-hyperbolic-2303.06301"/></url>
<url><loc>https://scifaro.com/en/abs/a-heuristic-search-algorithm-for-discovering-large-condorcet-domains-2303.06524</loc><lastmod>2026-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-heuristic-search-algorithm-for-discovering-large-condorcet-domains-2303.06524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-heuristic-search-algorithm-for-discovering-large-condorcet-domains-2303.06524"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-graphs-from-connected-triples-2303.06609</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-graphs-from-connected-triples-2303.06609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-graphs-from-connected-triples-2303.06609"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-equivalency-of-multiset-dimension-and-id-colorings-2303.06986</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-equivalency-of-multiset-dimension-and-id-colorings-2303.06986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-equivalency-of-multiset-dimension-and-id-colorings-2303.06986"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-and-recognizing-directed-interval-graphs-2303.07960</loc><lastmod>2024-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-and-recognizing-directed-interval-graphs-2303.07960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-and-recognizing-directed-interval-graphs-2303.07960"/></url>
<url><loc>https://scifaro.com/en/abs/nonatomic-non-cooperative-neighbourhood-balancing-games-2303.08507</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonatomic-non-cooperative-neighbourhood-balancing-games-2303.08507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonatomic-non-cooperative-neighbourhood-balancing-games-2303.08507"/></url>
<url><loc>https://scifaro.com/en/abs/matrices-inducing-generalized-metric-on-sequences-2303.08725</loc><lastmod>2023-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrices-inducing-generalized-metric-on-sequences-2303.08725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrices-inducing-generalized-metric-on-sequences-2303.08725"/></url>
<url><loc>https://scifaro.com/en/abs/a-bit-parallel-tabu-search-algorithm-for-finding-e-s-2-optimal-and-minimax-optimal-supersaturated-designs-2303.09104</loc><lastmod>2023-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bit-parallel-tabu-search-algorithm-for-finding-e-s-2-optimal-and-minimax-optimal-supersaturated-designs-2303.09104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bit-parallel-tabu-search-algorithm-for-finding-e-s-2-optimal-and-minimax-optimal-supersaturated-designs-2303.09104"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-random-generations-and-rejection-method-i-with-binomial-majorant-2303.09338</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-random-generations-and-rejection-method-i-with-binomial-majorant-2303.09338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-random-generations-and-rejection-method-i-with-binomial-majorant-2303.09338"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-twin-width-graphs-are-polynomially-chi-bounded-2303.11231</loc><lastmod>2025-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-twin-width-graphs-are-polynomially-chi-bounded-2303.11231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-twin-width-graphs-are-polynomially-chi-bounded-2303.11231"/></url>
<url><loc>https://scifaro.com/en/abs/a-cheeger-inequality-for-size-specific-conductance-2303.11452</loc><lastmod>2026-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cheeger-inequality-for-size-specific-conductance-2303.11452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cheeger-inequality-for-size-specific-conductance-2303.11452"/></url>
<url><loc>https://scifaro.com/en/abs/on-interval-edge-colorings-of-planar-graphs-2303.11466</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-interval-edge-colorings-of-planar-graphs-2303.11466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-interval-edge-colorings-of-planar-graphs-2303.11466"/></url>
<url><loc>https://scifaro.com/en/abs/search-for-an-immobile-hider-on-a-binary-tree-with-unreliable-locational-information-2303.13378</loc><lastmod>2024-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/search-for-an-immobile-hider-on-a-binary-tree-with-unreliable-locational-information-2303.13378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/search-for-an-immobile-hider-on-a-binary-tree-with-unreliable-locational-information-2303.13378"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-analysis-and-efficient-random-sampling-of-directed-ordered-acyclic-graphs-2303.14710</loc><lastmod>2025-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-analysis-and-efficient-random-sampling-of-directed-ordered-acyclic-graphs-2303.14710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-analysis-and-efficient-random-sampling-of-directed-ordered-acyclic-graphs-2303.14710"/></url>
<url><loc>https://scifaro.com/en/abs/permutation-inequalities-for-walks-in-graphs-2303.14810</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permutation-inequalities-for-walks-in-graphs-2303.14810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permutation-inequalities-for-walks-in-graphs-2303.14810"/></url>
<url><loc>https://scifaro.com/en/abs/can-few-lines-of-code-change-society-beyond-fack-checking-and-moderation-how-recommender-systems-toxifies-social-networking-sites-2303.15035</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/can-few-lines-of-code-change-society-beyond-fack-checking-and-moderation-how-recommender-systems-toxifies-social-networking-sites-2303.15035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/can-few-lines-of-code-change-society-beyond-fack-checking-and-moderation-how-recommender-systems-toxifies-social-networking-sites-2303.15035"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilar-states-in-uncertain-structures-2303.15279</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilar-states-in-uncertain-structures-2303.15279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilar-states-in-uncertain-structures-2303.15279"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-alpha-spectral-radius-of-hypergraphs-2303.16631</loc><lastmod>2023-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-alpha-spectral-radius-of-hypergraphs-2303.16631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-alpha-spectral-radius-of-hypergraphs-2303.16631"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parenthesisations-of-matrix-chains-all-are-useful-few-are-essential-2303.17352</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parenthesisations-of-matrix-chains-all-are-useful-few-are-essential-2303.17352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parenthesisations-of-matrix-chains-all-are-useful-few-are-essential-2303.17352"/></url>
<url><loc>https://scifaro.com/en/abs/counting-the-minimum-number-of-arcs-in-an-oriented-graph-having-weak-diameter-2-2304.00742</loc><lastmod>2024-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-the-minimum-number-of-arcs-in-an-oriented-graph-having-weak-diameter-2-2304.00742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-the-minimum-number-of-arcs-in-an-oriented-graph-having-weak-diameter-2-2304.00742"/></url>
<url><loc>https://scifaro.com/en/abs/fast-numerical-multivariate-multipoint-evaluation-2304.01191</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-numerical-multivariate-multipoint-evaluation-2304.01191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-numerical-multivariate-multipoint-evaluation-2304.01191"/></url>
<url><loc>https://scifaro.com/en/abs/stable-matching-dealing-with-changes-in-preferences-2304.02590</loc><lastmod>2025-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-matching-dealing-with-changes-in-preferences-2304.02590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-matching-dealing-with-changes-in-preferences-2304.02590"/></url>
<url><loc>https://scifaro.com/en/abs/a-computation-of-d-9-using-fpga-supercomputing-2304.03039</loc><lastmod>2023-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computation-of-d-9-using-fpga-supercomputing-2304.03039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computation-of-d-9-using-fpga-supercomputing-2304.03039"/></url>
<url><loc>https://scifaro.com/en/abs/rayleigh-quotients-of-dillon-s-functions-2304.03884</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rayleigh-quotients-of-dillon-s-functions-2304.03884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rayleigh-quotients-of-dillon-s-functions-2304.03884"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-nash-equilibria-of-a-simple-discounted-duel-2304.05024</loc><lastmod>2023-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-nash-equilibria-of-a-simple-discounted-duel-2304.05024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-nash-equilibria-of-a-simple-discounted-duel-2304.05024"/></url>
<url><loc>https://scifaro.com/en/abs/a-hall-type-theorem-with-algorithmic-consequences-in-planar-graphs-2304.05859</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hall-type-theorem-with-algorithmic-consequences-in-planar-graphs-2304.05859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hall-type-theorem-with-algorithmic-consequences-in-planar-graphs-2304.05859"/></url>
<url><loc>https://scifaro.com/en/abs/computing-shortest-12-representants-of-labeled-graphs-2304.07507</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-shortest-12-representants-of-labeled-graphs-2304.07507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-shortest-12-representants-of-labeled-graphs-2304.07507"/></url>
<url><loc>https://scifaro.com/en/abs/traversing-combinatorial-0-1-polytopes-via-optimization-2304.08567</loc><lastmod>2024-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/traversing-combinatorial-0-1-polytopes-via-optimization-2304.08567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/traversing-combinatorial-0-1-polytopes-via-optimization-2304.08567"/></url>
<url><loc>https://scifaro.com/en/abs/on-approximate-reconfigurability-of-label-cover-2304.08746</loc><lastmod>2025-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-approximate-reconfigurability-of-label-cover-2304.08746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-approximate-reconfigurability-of-label-cover-2304.08746"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-fast-fourier-multiplication-algorithms-on-quotient-rings-2304.08860</loc><lastmod>2023-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-fast-fourier-multiplication-algorithms-on-quotient-rings-2304.08860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-fast-fourier-multiplication-algorithms-on-quotient-rings-2304.08860"/></url>
<url><loc>https://scifaro.com/en/abs/on-countings-and-enumerations-of-block-parallel-automata-networks-2304.09664</loc><lastmod>2023-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-countings-and-enumerations-of-block-parallel-automata-networks-2304.09664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-countings-and-enumerations-of-block-parallel-automata-networks-2304.09664"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-algorithm-for-max-norm-optimal-binary-labeling-of-graphs-2304.12642</loc><lastmod>2023-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-algorithm-for-max-norm-optimal-binary-labeling-of-graphs-2304.12642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-algorithm-for-max-norm-optimal-binary-labeling-of-graphs-2304.12642"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-local-search-for-hitting-sets-2304.12789</loc><lastmod>2023-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-local-search-for-hitting-sets-2304.12789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-local-search-for-hitting-sets-2304.12789"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-the-union-of-arborescences-2304.13217</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-the-union-of-arborescences-2304.13217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-the-union-of-arborescences-2304.13217"/></url>
<url><loc>https://scifaro.com/en/abs/turning-block-sequential-automata-networks-into-smaller-parallel-networks-with-isomorphic-limit-dynamics-2304.13550</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/turning-block-sequential-automata-networks-into-smaller-parallel-networks-with-isomorphic-limit-dynamics-2304.13550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/turning-block-sequential-automata-networks-into-smaller-parallel-networks-with-isomorphic-limit-dynamics-2304.13550"/></url>
<url><loc>https://scifaro.com/en/abs/an-overview-of-universal-obstructions-for-graph-parameters-2304.14121</loc><lastmod>2026-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-overview-of-universal-obstructions-for-graph-parameters-2304.14121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-overview-of-universal-obstructions-for-graph-parameters-2304.14121"/></url>
<url><loc>https://scifaro.com/en/abs/space-reduction-techniques-for-the-3-wise-kemeny-problem-2305.00140</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-reduction-techniques-for-the-3-wise-kemeny-problem-2305.00140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-reduction-techniques-for-the-3-wise-kemeny-problem-2305.00140"/></url>
<url><loc>https://scifaro.com/en/abs/integer-linear-programming-formulations-for-triple-and-quadruple-roman-domination-problems-2305.00730</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-linear-programming-formulations-for-triple-and-quadruple-roman-domination-problems-2305.00730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-linear-programming-formulations-for-triple-and-quadruple-roman-domination-problems-2305.00730"/></url>
<url><loc>https://scifaro.com/en/abs/attractor-identification-in-asynchronous-boolean-dynamics-with-network-reduction-2305.01327</loc><lastmod>2024-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attractor-identification-in-asynchronous-boolean-dynamics-with-network-reduction-2305.01327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attractor-identification-in-asynchronous-boolean-dynamics-with-network-reduction-2305.01327"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-values-of-the-sombor-index-like-graph-invariants-of-trees-and-connected-graphs-2305.02925</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-values-of-the-sombor-index-like-graph-invariants-of-trees-and-connected-graphs-2305.02925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-values-of-the-sombor-index-like-graph-invariants-of-trees-and-connected-graphs-2305.02925"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-linear-width-rethinking-the-relationship-between-single-ideal-and-linear-obstacle-2305.04740</loc><lastmod>2026-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-linear-width-rethinking-the-relationship-between-single-ideal-and-linear-obstacle-2305.04740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-linear-width-rethinking-the-relationship-between-single-ideal-and-linear-obstacle-2305.04740"/></url>
<url><loc>https://scifaro.com/en/abs/random-processes-for-generating-task-dependency-graphs-2305.05205</loc><lastmod>2023-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-processes-for-generating-task-dependency-graphs-2305.05205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-processes-for-generating-task-dependency-graphs-2305.05205"/></url>
<url><loc>https://scifaro.com/en/abs/cover-your-bases-how-to-minimize-the-sequencing-coverage-in-dna-storage-systems-2305.05656</loc><lastmod>2023-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cover-your-bases-how-to-minimize-the-sequencing-coverage-in-dna-storage-systems-2305.05656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cover-your-bases-how-to-minimize-the-sequencing-coverage-in-dna-storage-systems-2305.05656"/></url>
<url><loc>https://scifaro.com/en/abs/minor-universal-graph-for-graphs-on-surfaces-2305.06673</loc><lastmod>2023-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minor-universal-graph-for-graphs-on-surfaces-2305.06673"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minor-universal-graph-for-graphs-on-surfaces-2305.06673"/></url>
<url><loc>https://scifaro.com/en/abs/integer-points-in-the-degree-sequence-polytope-2305.06732</loc><lastmod>2023-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-points-in-the-degree-sequence-polytope-2305.06732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-points-in-the-degree-sequence-polytope-2305.06732"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-model-of-influence-2305.07604</loc><lastmod>2023-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-model-of-influence-2305.07604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-model-of-influence-2305.07604"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-general-difference-in-continuous-and-discrete-domain-2305.08098</loc><lastmod>2024-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-general-difference-in-continuous-and-discrete-domain-2305.08098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-general-difference-in-continuous-and-discrete-domain-2305.08098"/></url>
<url><loc>https://scifaro.com/en/abs/stack-number-and-queue-number-of-graphs-2305.09700</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stack-number-and-queue-number-of-graphs-2305.09700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stack-number-and-queue-number-of-graphs-2305.09700"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-complexity-of-and-algorithms-for-the-graph-traversal-edit-distance-and-its-variants-2305.10577</loc><lastmod>2023-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-complexity-of-and-algorithms-for-the-graph-traversal-edit-distance-and-its-variants-2305.10577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-complexity-of-and-algorithms-for-the-graph-traversal-edit-distance-and-its-variants-2305.10577"/></url>
<url><loc>https://scifaro.com/en/abs/stretch-width-2305.12023</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stretch-width-2305.12023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stretch-width-2305.12023"/></url>
<url><loc>https://scifaro.com/en/abs/cohomology-of-open-sets-2305.12613</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cohomology-of-open-sets-2305.12613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cohomology-of-open-sets-2305.12613"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-implementation-of-boolean-functions-on-content-addressable-memories-2305.13159</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-implementation-of-boolean-functions-on-content-addressable-memories-2305.13159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-implementation-of-boolean-functions-on-content-addressable-memories-2305.13159"/></url>
<url><loc>https://scifaro.com/en/abs/an-improvement-of-random-node-generator-for-the-uniform-generation-of-capacities-2305.13390</loc><lastmod>2023-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improvement-of-random-node-generator-for-the-uniform-generation-of-capacities-2305.13390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improvement-of-random-node-generator-for-the-uniform-generation-of-capacities-2305.13390"/></url>
<url><loc>https://scifaro.com/en/abs/new-constructions-of-cyclic-subspace-codes-2305.15627</loc><lastmod>2023-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-constructions-of-cyclic-subspace-codes-2305.15627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-constructions-of-cyclic-subspace-codes-2305.15627"/></url>
<url><loc>https://scifaro.com/en/abs/link-residual-closeness-of-harary-graphs-2305.16882</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/link-residual-closeness-of-harary-graphs-2305.16882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/link-residual-closeness-of-harary-graphs-2305.16882"/></url>
<url><loc>https://scifaro.com/en/abs/irreducibility-of-recombination-markov-chains-in-the-triangular-lattice-2305.17239</loc><lastmod>2023-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irreducibility-of-recombination-markov-chains-in-the-triangular-lattice-2305.17239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irreducibility-of-recombination-markov-chains-in-the-triangular-lattice-2305.17239"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-dynamic-discretization-discovery-via-arc-dependent-time-discretizations-2305.19176</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-dynamic-discretization-discovery-via-arc-dependent-time-discretizations-2305.19176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-dynamic-discretization-discovery-via-arc-dependent-time-discretizations-2305.19176"/></url>
<url><loc>https://scifaro.com/en/abs/best-l-p-isotonic-regressions-p-in-0-1-infty-2306.00269</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-l-p-isotonic-regressions-p-in-0-1-infty-2306.00269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-l-p-isotonic-regressions-p-in-0-1-infty-2306.00269"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-anchored-crossing-number-and-crossing-number-of-almost-planar-graphs-2306.03490</loc><lastmod>2024-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-anchored-crossing-number-and-crossing-number-of-almost-planar-graphs-2306.03490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-anchored-crossing-number-and-crossing-number-of-almost-planar-graphs-2306.03490"/></url>
<url><loc>https://scifaro.com/en/abs/perturbation-of-fiedler-vector-interest-for-graph-measures-and-shape-analysis-2306.04327</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perturbation-of-fiedler-vector-interest-for-graph-measures-and-shape-analysis-2306.04327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perturbation-of-fiedler-vector-interest-for-graph-measures-and-shape-analysis-2306.04327"/></url>
<url><loc>https://scifaro.com/en/abs/solving-np-hard-problems-on-textsc-gatex-graphs-linear-time-algorithms-for-perfect-orderings-cliques-colorings-and-independent-sets-2306.04367</loc><lastmod>2024-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-np-hard-problems-on-textsc-gatex-graphs-linear-time-algorithms-for-perfect-orderings-cliques-colorings-and-independent-sets-2306.04367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-np-hard-problems-on-textsc-gatex-graphs-linear-time-algorithms-for-perfect-orderings-cliques-colorings-and-independent-sets-2306.04367"/></url>
<url><loc>https://scifaro.com/en/abs/spectrahedral-geometry-of-graph-sparsifiers-2306.06204</loc><lastmod>2023-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectrahedral-geometry-of-graph-sparsifiers-2306.06204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectrahedral-geometry-of-graph-sparsifiers-2306.06204"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-covering-disconnected-multigraphs-2306.06431</loc><lastmod>2023-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-covering-disconnected-multigraphs-2306.06431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-covering-disconnected-multigraphs-2306.06431"/></url>
<url><loc>https://scifaro.com/en/abs/list-homomorphisms-to-separable-signed-graphs-2306.06449</loc><lastmod>2024-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/list-homomorphisms-to-separable-signed-graphs-2306.06449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/list-homomorphisms-to-separable-signed-graphs-2306.06449"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-reachability-dominating-sets-contagion-in-temporal-graphs-2306.06999</loc><lastmod>2024-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-reachability-dominating-sets-contagion-in-temporal-graphs-2306.06999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-reachability-dominating-sets-contagion-in-temporal-graphs-2306.06999"/></url>
<url><loc>https://scifaro.com/en/abs/time-arrow-without-past-hypothesis-a-toy-model-explanation-2306.07121</loc><lastmod>2024-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-arrow-without-past-hypothesis-a-toy-model-explanation-2306.07121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-arrow-without-past-hypothesis-a-toy-model-explanation-2306.07121"/></url>
<url><loc>https://scifaro.com/en/abs/new-optimal-results-on-codes-for-location-in-graphs-2306.07862</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-optimal-results-on-codes-for-location-in-graphs-2306.07862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-optimal-results-on-codes-for-location-in-graphs-2306.07862"/></url>
<url><loc>https://scifaro.com/en/abs/strong-regulatory-graphs-2306.08261</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-regulatory-graphs-2306.08261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-regulatory-graphs-2306.08261"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-vi-binary-trees-2306.08420</loc><lastmod>2024-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-vi-binary-trees-2306.08420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-generation-via-permutation-languages-vi-binary-trees-2306.08420"/></url>
<url><loc>https://scifaro.com/en/abs/modules-and-pq-trees-in-robinson-spaces-2306.08800</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modules-and-pq-trees-in-robinson-spaces-2306.08800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modules-and-pq-trees-in-robinson-spaces-2306.08800"/></url>
<url><loc>https://scifaro.com/en/abs/functional-dependencies-with-predicates-what-makes-the-g-3-error-easy-to-compute-2306.09006</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-dependencies-with-predicates-what-makes-the-g-3-error-easy-to-compute-2306.09006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-dependencies-with-predicates-what-makes-the-g-3-error-easy-to-compute-2306.09006"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-giant-component-of-geometric-inhomogeneous-random-graphs-2306.09506</loc><lastmod>2023-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-giant-component-of-geometric-inhomogeneous-random-graphs-2306.09506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-giant-component-of-geometric-inhomogeneous-random-graphs-2306.09506"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-pure-strategies-for-a-discrete-search-game-2306.10908</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-pure-strategies-for-a-discrete-search-game-2306.10908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-pure-strategies-for-a-discrete-search-game-2306.10908"/></url>
<url><loc>https://scifaro.com/en/abs/routing-one-million-customers-in-a-handful-of-minutes-2306.14205</loc><lastmod>2023-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-one-million-customers-in-a-handful-of-minutes-2306.14205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-one-million-customers-in-a-handful-of-minutes-2306.14205"/></url>
<url><loc>https://scifaro.com/en/abs/integer-linear-programming-modeling-of-addition-sequences-with-additional-constraints-for-evaluation-of-power-terms-2306.15002</loc><lastmod>2023-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-linear-programming-modeling-of-addition-sequences-with-additional-constraints-for-evaluation-of-power-terms-2306.15002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-linear-programming-modeling-of-addition-sequences-with-additional-constraints-for-evaluation-of-power-terms-2306.15002"/></url>
<url><loc>https://scifaro.com/en/abs/planar-graphs-are-acyclically-edge-delta-5-colorable-2306.15813</loc><lastmod>2023-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-graphs-are-acyclically-edge-delta-5-colorable-2306.15813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-graphs-are-acyclically-edge-delta-5-colorable-2306.15813"/></url>
<url><loc>https://scifaro.com/en/abs/condorcet-domains-of-degree-at-most-seven-2306.15993</loc><lastmod>2023-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/condorcet-domains-of-degree-at-most-seven-2306.15993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/condorcet-domains-of-degree-at-most-seven-2306.15993"/></url>
<url><loc>https://scifaro.com/en/abs/new-dynamic-programming-algorithm-for-the-multiobjective-minimum-spanning-tree-problem-2306.16203</loc><lastmod>2023-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-dynamic-programming-algorithm-for-the-multiobjective-minimum-spanning-tree-problem-2306.16203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-dynamic-programming-algorithm-for-the-multiobjective-minimum-spanning-tree-problem-2306.16203"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-connected-components-of-the-graph-using-perturbations-of-the-adjacency-matrix-2306.16389</loc><lastmod>2023-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-connected-components-of-the-graph-using-perturbations-of-the-adjacency-matrix-2306.16389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-connected-components-of-the-graph-using-perturbations-of-the-adjacency-matrix-2306.16389"/></url>
<url><loc>https://scifaro.com/en/abs/visualizing-geophylogenies-internal-and-external-labeling-with-phylogenetic-tree-constraints-2306.17348</loc><lastmod>2025-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualizing-geophylogenies-internal-and-external-labeling-with-phylogenetic-tree-constraints-2306.17348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualizing-geophylogenies-internal-and-external-labeling-with-phylogenetic-tree-constraints-2306.17348"/></url>
<url><loc>https://scifaro.com/en/abs/safe-edges-a-study-of-triangulation-in-fill-in-and-tree-width-problems-2306.17811</loc><lastmod>2023-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safe-edges-a-study-of-triangulation-in-fill-in-and-tree-width-problems-2306.17811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safe-edges-a-study-of-triangulation-in-fill-in-and-tree-width-problems-2306.17811"/></url>
<url><loc>https://scifaro.com/en/abs/solving-break-minimization-problems-in-mirrored-double-round-robin-tournament-with-qubo-solver-2307.00263</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-break-minimization-problems-in-mirrored-double-round-robin-tournament-with-qubo-solver-2307.00263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-break-minimization-problems-in-mirrored-double-round-robin-tournament-with-qubo-solver-2307.00263"/></url>
<url><loc>https://scifaro.com/en/abs/words-for-the-graphs-with-permutation-representation-number-at-most-three-2307.00301</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/words-for-the-graphs-with-permutation-representation-number-at-most-three-2307.00301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/words-for-the-graphs-with-permutation-representation-number-at-most-three-2307.00301"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-dichotomies-for-the-maximum-weighted-digraph-partition-problem-2307.01109</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-dichotomies-for-the-maximum-weighted-digraph-partition-problem-2307.01109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-dichotomies-for-the-maximum-weighted-digraph-partition-problem-2307.01109"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-arrival-problem-for-rotor-walks-in-path-multigraphs-2307.01897</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-arrival-problem-for-rotor-walks-in-path-multigraphs-2307.01897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-arrival-problem-for-rotor-walks-in-path-multigraphs-2307.01897"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-edge-colouring-problem-on-graphs-that-exclude-a-fixed-minor-2307.02314</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-edge-colouring-problem-on-graphs-that-exclude-a-fixed-minor-2307.02314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-edge-colouring-problem-on-graphs-that-exclude-a-fixed-minor-2307.02314"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-k-stable-matchings-2307.03794</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-k-stable-matchings-2307.03794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-k-stable-matchings-2307.03794"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-analysis-of-the-cops-and-robber-problem-2307.04594</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-analysis-of-the-cops-and-robber-problem-2307.04594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-analysis-of-the-cops-and-robber-problem-2307.04594"/></url>
<url><loc>https://scifaro.com/en/abs/words-fixing-the-kernel-network-and-maximum-independent-sets-in-graphs-2307.05216</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/words-fixing-the-kernel-network-and-maximum-independent-sets-in-graphs-2307.05216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/words-fixing-the-kernel-network-and-maximum-independent-sets-in-graphs-2307.05216"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-identity-and-group-problems-for-complex-heisenberg-matrices-2307.05283</loc><lastmod>2025-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-identity-and-group-problems-for-complex-heisenberg-matrices-2307.05283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-identity-and-group-problems-for-complex-heisenberg-matrices-2307.05283"/></url>
<url><loc>https://scifaro.com/en/abs/packing-squares-independently-2307.06654</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-squares-independently-2307.06654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-squares-independently-2307.06654"/></url>
<url><loc>https://scifaro.com/en/abs/closeness-centralities-of-lollipop-graphs-2307.06738</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closeness-centralities-of-lollipop-graphs-2307.06738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closeness-centralities-of-lollipop-graphs-2307.06738"/></url>
<url><loc>https://scifaro.com/en/abs/k-2-linear-connected-components-in-hypergraphs-of-rank-k-2307.06752</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-2-linear-connected-components-in-hypergraphs-of-rank-k-2307.06752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-2-linear-connected-components-in-hypergraphs-of-rank-k-2307.06752"/></url>
<url><loc>https://scifaro.com/en/abs/an-update-on-the-coin-moving-game-on-the-square-grid-2307.06767</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-update-on-the-coin-moving-game-on-the-square-grid-2307.06767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-update-on-the-coin-moving-game-on-the-square-grid-2307.06767"/></url>
<url><loc>https://scifaro.com/en/abs/graph-search-trees-and-their-leaves-2307.07279</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-search-trees-and-their-leaves-2307.07279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-search-trees-and-their-leaves-2307.07279"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximation-algorithm-for-multi-allocation-hub-location-problems-2307.07433</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-multi-allocation-hub-location-problems-2307.07433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-multi-allocation-hub-location-problems-2307.07433"/></url>
<url><loc>https://scifaro.com/en/abs/exhaustive-generation-of-linear-orthogonal-cellular-automata-2307.07505</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exhaustive-generation-of-linear-orthogonal-cellular-automata-2307.07505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exhaustive-generation-of-linear-orthogonal-cellular-automata-2307.07505"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-mixing-via-tensorization-for-random-independent-sets-on-arbitrary-trees-2307.07727</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-mixing-via-tensorization-for-random-independent-sets-on-arbitrary-trees-2307.07727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-mixing-via-tensorization-for-random-independent-sets-on-arbitrary-trees-2307.07727"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-non-planar-graphs-with-rotation-systems-on-the-klein-bottle-2307.08287</loc><lastmod>2023-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-non-planar-graphs-with-rotation-systems-on-the-klein-bottle-2307.08287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-non-planar-graphs-with-rotation-systems-on-the-klein-bottle-2307.08287"/></url>
<url><loc>https://scifaro.com/en/abs/mathcal-p-matchings-parameterized-by-treewidth-2307.09333</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathcal-p-matchings-parameterized-by-treewidth-2307.09333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathcal-p-matchings-parameterized-by-treewidth-2307.09333"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-possibility-of-a-connection-between-the-construction-of-a-class-of-bigeodetic-blocks-and-the-existence-problem-for-biplanes-2307.10133</loc><lastmod>2023-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-possibility-of-a-connection-between-the-construction-of-a-class-of-bigeodetic-blocks-and-the-existence-problem-for-biplanes-2307.10133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-possibility-of-a-connection-between-the-construction-of-a-class-of-bigeodetic-blocks-and-the-existence-problem-for-biplanes-2307.10133"/></url>
<url><loc>https://scifaro.com/en/abs/domino-snake-problems-on-groups-2307.12655</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domino-snake-problems-on-groups-2307.12655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domino-snake-problems-on-groups-2307.12655"/></url>
<url><loc>https://scifaro.com/en/abs/the-fagnano-triangle-patrolling-problem-2307.13153</loc><lastmod>2025-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fagnano-triangle-patrolling-problem-2307.13153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fagnano-triangle-patrolling-problem-2307.13153"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-independence-and-local-to-global-techniques-for-optimal-mixing-of-markov-chains-2307.13826</loc><lastmod>2025-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-independence-and-local-to-global-techniques-for-optimal-mixing-of-markov-chains-2307.13826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-independence-and-local-to-global-techniques-for-optimal-mixing-of-markov-chains-2307.13826"/></url>
<url><loc>https://scifaro.com/en/abs/single-machine-rescheduling-for-new-orders-properties-and-complexity-results-2307.14876</loc><lastmod>2025-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/single-machine-rescheduling-for-new-orders-properties-and-complexity-results-2307.14876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/single-machine-rescheduling-for-new-orders-properties-and-complexity-results-2307.14876"/></url>
<url><loc>https://scifaro.com/en/abs/polytopes-with-bounded-integral-slack-matrices-have-sub-exponential-extension-complexity-2307.16159</loc><lastmod>2024-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polytopes-with-bounded-integral-slack-matrices-have-sub-exponential-extension-complexity-2307.16159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polytopes-with-bounded-integral-slack-matrices-have-sub-exponential-extension-complexity-2307.16159"/></url>
<url><loc>https://scifaro.com/en/abs/signed-double-roman-domination-on-cubic-graphs-2308.01109</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signed-double-roman-domination-on-cubic-graphs-2308.01109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signed-double-roman-domination-on-cubic-graphs-2308.01109"/></url>
<url><loc>https://scifaro.com/en/abs/skolem-meets-bateman-horn-2308.01152</loc><lastmod>2024-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skolem-meets-bateman-horn-2308.01152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skolem-meets-bateman-horn-2308.01152"/></url>
<url><loc>https://scifaro.com/en/abs/on-rac-drawings-of-graphs-with-two-bends-per-edge-2308.02663</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-rac-drawings-of-graphs-with-two-bends-per-edge-2308.02663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-rac-drawings-of-graphs-with-two-bends-per-edge-2308.02663"/></url>
<url><loc>https://scifaro.com/en/abs/bipartite-peak-pit-domains-2308.02817</loc><lastmod>2025-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bipartite-peak-pit-domains-2308.02817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bipartite-peak-pit-domains-2308.02817"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-concentration-of-the-maximum-degree-in-the-duplication-divergence-models-2308.04336</loc><lastmod>2023-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-concentration-of-the-maximum-degree-in-the-duplication-divergence-models-2308.04336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-concentration-of-the-maximum-degree-in-the-duplication-divergence-models-2308.04336"/></url>
<url><loc>https://scifaro.com/en/abs/community-detection-in-hypergraphs-via-mutual-information-maximization-2308.04537</loc><lastmod>2023-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/community-detection-in-hypergraphs-via-mutual-information-maximization-2308.04537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/community-detection-in-hypergraphs-via-mutual-information-maximization-2308.04537"/></url>
<url><loc>https://scifaro.com/en/abs/spartan-bipartite-graphs-are-essentially-elementary-2308.04548</loc><lastmod>2023-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spartan-bipartite-graphs-are-essentially-elementary-2308.04548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spartan-bipartite-graphs-are-essentially-elementary-2308.04548"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model-2308.04575</loc><lastmod>2024-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model-2308.04575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model-2308.04575"/></url>
<url><loc>https://scifaro.com/en/abs/multipacking-and-broadcast-domination-on-cactus-graph-and-its-impact-on-hyperbolic-graph-2308.04882</loc><lastmod>2025-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multipacking-and-broadcast-domination-on-cactus-graph-and-its-impact-on-hyperbolic-graph-2308.04882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multipacking-and-broadcast-domination-on-cactus-graph-and-its-impact-on-hyperbolic-graph-2308.04882"/></url>
<url><loc>https://scifaro.com/en/abs/proving-properties-of-some-greedily-defined-integer-recurrences-via-automata-theory-2308.06544</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-properties-of-some-greedily-defined-integer-recurrences-via-automata-theory-2308.06544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-properties-of-some-greedily-defined-integer-recurrences-via-automata-theory-2308.06544"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-enumeration-of-tarski-fixed-points-2308.07923</loc><lastmod>2026-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-enumeration-of-tarski-fixed-points-2308.07923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-enumeration-of-tarski-fixed-points-2308.07923"/></url>
<url><loc>https://scifaro.com/en/abs/fair-allocation-algorithms-for-indivisible-items-under-structured-conflict-constraints-2308.09399</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fair-allocation-algorithms-for-indivisible-items-under-structured-conflict-constraints-2308.09399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fair-allocation-algorithms-for-indivisible-items-under-structured-conflict-constraints-2308.09399"/></url>
<url><loc>https://scifaro.com/en/abs/dill-maps-in-the-weyl-like-space-associated-to-the-levenshtein-distance-2308.09428</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dill-maps-in-the-weyl-like-space-associated-to-the-levenshtein-distance-2308.09428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dill-maps-in-the-weyl-like-space-associated-to-the-levenshtein-distance-2308.09428"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-branch-and-cut-approach-for-integrated-planning-in-additive-manufacturing-2308.09468</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-branch-and-cut-approach-for-integrated-planning-in-additive-manufacturing-2308.09468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-branch-and-cut-approach-for-integrated-planning-in-additive-manufacturing-2308.09468"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-chains-in-the-tree-of-numerical-semigroups-2308.09500</loc><lastmod>2024-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-chains-in-the-tree-of-numerical-semigroups-2308.09500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-chains-in-the-tree-of-numerical-semigroups-2308.09500"/></url>
<url><loc>https://scifaro.com/en/abs/random-walks-conductance-and-resistance-for-the-connection-graph-laplacian-2308.09690</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-walks-conductance-and-resistance-for-the-connection-graph-laplacian-2308.09690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-walks-conductance-and-resistance-for-the-connection-graph-laplacian-2308.09690"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-cost-effective-infrastructure-networks-2308.11033</loc><lastmod>2023-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-cost-effective-infrastructure-networks-2308.11033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-cost-effective-infrastructure-networks-2308.11033"/></url>
<url><loc>https://scifaro.com/en/abs/closeness-and-residual-closeness-of-harary-graphs-2308.11056</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closeness-and-residual-closeness-of-harary-graphs-2308.11056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closeness-and-residual-closeness-of-harary-graphs-2308.11056"/></url>
<url><loc>https://scifaro.com/en/abs/compressing-cfi-graphs-and-lower-bounds-for-the-weisfeiler-leman-refinements-2308.11970</loc><lastmod>2026-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compressing-cfi-graphs-and-lower-bounds-for-the-weisfeiler-leman-refinements-2308.11970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compressing-cfi-graphs-and-lower-bounds-for-the-weisfeiler-leman-refinements-2308.11970"/></url>
<url><loc>https://scifaro.com/en/abs/obstruction-characterization-of-co-tt-graphs-2308.12614</loc><lastmod>2024-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/obstruction-characterization-of-co-tt-graphs-2308.12614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/obstruction-characterization-of-co-tt-graphs-2308.12614"/></url>
<url><loc>https://scifaro.com/en/abs/closeness-of-some-graph-operations-2308.14491</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closeness-of-some-graph-operations-2308.14491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closeness-of-some-graph-operations-2308.14491"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-inclusion-wise-minimal-separators-enumeration-2308.15444</loc><lastmod>2023-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-inclusion-wise-minimal-separators-enumeration-2308.15444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-inclusion-wise-minimal-separators-enumeration-2308.15444"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bound-for-independence-covering-in-c-4-free-graphs-2308.15671</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bound-for-independence-covering-in-c-4-free-graphs-2308.15671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bound-for-independence-covering-in-c-4-free-graphs-2308.15671"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-suplattices-2308.16495</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-suplattices-2308.16495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-suplattices-2308.16495"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-on-the-complexity-of-mixed-integer-programs-for-stable-set-and-knapsack-2308.16711</loc><lastmod>2024-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-on-the-complexity-of-mixed-integer-programs-for-stable-set-and-knapsack-2308.16711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-on-the-complexity-of-mixed-integer-programs-for-stable-set-and-knapsack-2308.16711"/></url>
<url><loc>https://scifaro.com/en/abs/directional-movement-of-a-collective-of-compassless-automata-on-square-lattice-of-width-2-2309.00292</loc><lastmod>2023-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directional-movement-of-a-collective-of-compassless-automata-on-square-lattice-of-width-2-2309.00292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directional-movement-of-a-collective-of-compassless-automata-on-square-lattice-of-width-2-2309.00292"/></url>
<url><loc>https://scifaro.com/en/abs/loopless-algorithms-to-generate-maximum-length-gray-cycles-wrt-k-character-substitution-2309.01556</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/loopless-algorithms-to-generate-maximum-length-gray-cycles-wrt-k-character-substitution-2309.01556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/loopless-algorithms-to-generate-maximum-length-gray-cycles-wrt-k-character-substitution-2309.01556"/></url>
<url><loc>https://scifaro.com/en/abs/dynamical-stability-of-threshold-networks-over-undirected-signed-graphs-2309.01854</loc><lastmod>2024-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamical-stability-of-threshold-networks-over-undirected-signed-graphs-2309.01854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamical-stability-of-threshold-networks-over-undirected-signed-graphs-2309.01854"/></url>
<url><loc>https://scifaro.com/en/abs/topologies-for-error-detecting-variable-length-codes-2309.01997</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topologies-for-error-detecting-variable-length-codes-2309.01997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topologies-for-error-detecting-variable-length-codes-2309.01997"/></url>
<url><loc>https://scifaro.com/en/abs/on-3-coloring-circle-graphs-2309.02258</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-3-coloring-circle-graphs-2309.02258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-3-coloring-circle-graphs-2309.02258"/></url>
<url><loc>https://scifaro.com/en/abs/compatibility-graphs-in-scheduling-on-batch-processing-machines-2309.02601</loc><lastmod>2023-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compatibility-graphs-in-scheduling-on-batch-processing-machines-2309.02601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compatibility-graphs-in-scheduling-on-batch-processing-machines-2309.02601"/></url>
<url><loc>https://scifaro.com/en/abs/three-hardness-results-for-graph-similarity-problems-2309.03810</loc><lastmod>2026-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-hardness-results-for-graph-similarity-problems-2309.03810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-hardness-results-for-graph-similarity-problems-2309.03810"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-polynomial-kernelizations-of-finding-a-shortest-path-with-positive-disjunctive-constraints-2309.04346</loc><lastmod>2026-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-polynomial-kernelizations-of-finding-a-shortest-path-with-positive-disjunctive-constraints-2309.04346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-polynomial-kernelizations-of-finding-a-shortest-path-with-positive-disjunctive-constraints-2309.04346"/></url>
<url><loc>https://scifaro.com/en/abs/finite-sample-analysis-of-rotation-operator-under-l-2-norm-and-l-infty-norm-2309.04867</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-sample-analysis-of-rotation-operator-under-l-2-norm-and-l-infty-norm-2309.04867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-sample-analysis-of-rotation-operator-under-l-2-norm-and-l-infty-norm-2309.04867"/></url>
<url><loc>https://scifaro.com/en/abs/dynamicscore-a-novel-metric-for-quantifying-graph-dynamics-2309.05320</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamicscore-a-novel-metric-for-quantifying-graph-dynamics-2309.05320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamicscore-a-novel-metric-for-quantifying-graph-dynamics-2309.05320"/></url>
<url><loc>https://scifaro.com/en/abs/chemically-inspired-erd-h-o-s-r-enyi-oriented-hypergraphs-2309.06351</loc><lastmod>2024-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chemically-inspired-erd-h-o-s-r-enyi-oriented-hypergraphs-2309.06351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chemically-inspired-erd-h-o-s-r-enyi-oriented-hypergraphs-2309.06351"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-roman-domination-and-unique-response-roman-domination-2309.07018</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-roman-domination-and-unique-response-roman-domination-2309.07018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-roman-domination-and-unique-response-roman-domination-2309.07018"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-path-and-hamiltonian-cycle-are-solvable-in-polynomial-time-in-graphs-of-bounded-independence-number-2309.09228</loc><lastmod>2025-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-path-and-hamiltonian-cycle-are-solvable-in-polynomial-time-in-graphs-of-bounded-independence-number-2309.09228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-path-and-hamiltonian-cycle-are-solvable-in-polynomial-time-in-graphs-of-bounded-independence-number-2309.09228"/></url>
<url><loc>https://scifaro.com/en/abs/axioms-for-distanceless-graph-partitioning-2309.09386</loc><lastmod>2024-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axioms-for-distanceless-graph-partitioning-2309.09386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axioms-for-distanceless-graph-partitioning-2309.09386"/></url>
<url><loc>https://scifaro.com/en/abs/recent-advances-in-algorithmic-problems-for-semigroups-2309.10943</loc><lastmod>2023-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recent-advances-in-algorithmic-problems-for-semigroups-2309.10943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recent-advances-in-algorithmic-problems-for-semigroups-2309.10943"/></url>
<url><loc>https://scifaro.com/en/abs/tropical-neural-networks-and-its-applications-to-classifying-phylogenetic-trees-2309.13410</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tropical-neural-networks-and-its-applications-to-classifying-phylogenetic-trees-2309.13410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tropical-neural-networks-and-its-applications-to-classifying-phylogenetic-trees-2309.13410"/></url>
<url><loc>https://scifaro.com/en/abs/unique-least-common-ancestors-and-clusters-in-directed-acyclic-graphs-2309.13634</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-least-common-ancestors-and-clusters-in-directed-acyclic-graphs-2309.13634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-least-common-ancestors-and-clusters-in-directed-acyclic-graphs-2309.13634"/></url>
<url><loc>https://scifaro.com/en/abs/q-overlaps-in-the-random-exact-cover-problem-2309.13797</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/q-overlaps-in-the-random-exact-cover-problem-2309.13797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/q-overlaps-in-the-random-exact-cover-problem-2309.13797"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-all-maximal-clique-partitions-of-an-undirected-graph-2309.13800</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-all-maximal-clique-partitions-of-an-undirected-graph-2309.13800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-all-maximal-clique-partitions-of-an-undirected-graph-2309.13800"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-worst-case-for-classical-simplex-and-policy-iteration-pivot-rules-2309.14034</loc><lastmod>2025-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-worst-case-for-classical-simplex-and-policy-iteration-pivot-rules-2309.14034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-worst-case-for-classical-simplex-and-policy-iteration-pivot-rules-2309.14034"/></url>
<url><loc>https://scifaro.com/en/abs/further-results-on-the-hunters-and-rabbit-game-through-monotonicity-2309.16533</loc><lastmod>2023-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-results-on-the-hunters-and-rabbit-game-through-monotonicity-2309.16533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-results-on-the-hunters-and-rabbit-game-through-monotonicity-2309.16533"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-minimal-solution-sets-for-metric-graph-problems-2309.17419</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-minimal-solution-sets-for-metric-graph-problems-2309.17419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-minimal-solution-sets-for-metric-graph-problems-2309.17419"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-flows-in-networks-2310.01042</loc><lastmod>2024-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-flows-in-networks-2310.01042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-flows-in-networks-2310.01042"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-and-efficient-solution-of-milp-models-of-mixed-hamming-packings-yielding-improved-upper-bounds-2310.01883</loc><lastmod>2023-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-and-efficient-solution-of-milp-models-of-mixed-hamming-packings-yielding-improved-upper-bounds-2310.01883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-and-efficient-solution-of-milp-models-of-mixed-hamming-packings-yielding-improved-upper-bounds-2310.01883"/></url>
<url><loc>https://scifaro.com/en/abs/turning-tiles-is-pspace-complete-2310.01983</loc><lastmod>2023-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/turning-tiles-is-pspace-complete-2310.01983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/turning-tiles-is-pspace-complete-2310.01983"/></url>
<url><loc>https://scifaro.com/en/abs/estimating-systemic-importance-with-missing-data-in-input-output-graphs-2310.02394</loc><lastmod>2023-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimating-systemic-importance-with-missing-data-in-input-output-graphs-2310.02394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimating-systemic-importance-with-missing-data-in-input-output-graphs-2310.02394"/></url>
<url><loc>https://scifaro.com/en/abs/the-bright-side-of-simple-heuristics-for-the-tsp-2310.03222</loc><lastmod>2023-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bright-side-of-simple-heuristics-for-the-tsp-2310.03222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bright-side-of-simple-heuristics-for-the-tsp-2310.03222"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedral-approach-to-weighted-connected-matchings-in-general-graphs-2310.05733</loc><lastmod>2024-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedral-approach-to-weighted-connected-matchings-in-general-graphs-2310.05733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedral-approach-to-weighted-connected-matchings-in-general-graphs-2310.05733"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterised-complexity-of-integer-multicommodity-flow-2310.05784</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterised-complexity-of-integer-multicommodity-flow-2310.05784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterised-complexity-of-integer-multicommodity-flow-2310.05784"/></url>
<url><loc>https://scifaro.com/en/abs/graph-based-analysis-and-visualisation-of-mobility-data-2310.06732</loc><lastmod>2023-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-based-analysis-and-visualisation-of-mobility-data-2310.06732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-based-analysis-and-visualisation-of-mobility-data-2310.06732"/></url>
<url><loc>https://scifaro.com/en/abs/faster-location-in-combinatorial-interaction-testing-2310.07448</loc><lastmod>2023-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-location-in-combinatorial-interaction-testing-2310.07448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-location-in-combinatorial-interaction-testing-2310.07448"/></url>
<url><loc>https://scifaro.com/en/abs/construction-of-optimal-flag-codes-by-mrd-codes-2310.11285</loc><lastmod>2024-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/construction-of-optimal-flag-codes-by-mrd-codes-2310.11285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/construction-of-optimal-flag-codes-by-mrd-codes-2310.11285"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-bound-on-the-number-of-minimal-separators-and-potential-maximal-cliques-in-p-6-free-graphs-of-bounded-clique-number-2310.11573</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-bound-on-the-number-of-minimal-separators-and-potential-maximal-cliques-in-p-6-free-graphs-of-bounded-clique-number-2310.11573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-bound-on-the-number-of-minimal-separators-and-potential-maximal-cliques-in-p-6-free-graphs-of-bounded-clique-number-2310.11573"/></url>
<url><loc>https://scifaro.com/en/abs/gap-amplification-for-reconfiguration-problems-2310.14160</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gap-amplification-for-reconfiguration-problems-2310.14160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gap-amplification-for-reconfiguration-problems-2310.14160"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-balanced-forests-of-grids-in-polynomial-time-2310.15152</loc><lastmod>2024-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-balanced-forests-of-grids-in-polynomial-time-2310.15152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-balanced-forests-of-grids-in-polynomial-time-2310.15152"/></url>
<url><loc>https://scifaro.com/en/abs/linear-mim-width-of-the-square-of-trees-2310.15754</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-mim-width-of-the-square-of-trees-2310.15754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-mim-width-of-the-square-of-trees-2310.15754"/></url>
<url><loc>https://scifaro.com/en/abs/paired-2-disjoint-path-covers-of-burnt-pancake-graphs-with-faulty-elements-2310.18831</loc><lastmod>2023-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paired-2-disjoint-path-covers-of-burnt-pancake-graphs-with-faulty-elements-2310.18831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paired-2-disjoint-path-covers-of-burnt-pancake-graphs-with-faulty-elements-2310.18831"/></url>
<url><loc>https://scifaro.com/en/abs/the-weisfeiler-leman-dimension-of-conjunctive-queries-2310.19006</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weisfeiler-leman-dimension-of-conjunctive-queries-2310.19006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weisfeiler-leman-dimension-of-conjunctive-queries-2310.19006"/></url>
<url><loc>https://scifaro.com/en/abs/computing-random-r-orthogonal-latin-squares-2311.00992</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-random-r-orthogonal-latin-squares-2311.00992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-random-r-orthogonal-latin-squares-2311.00992"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-probability-marginals-beyond-affine-requirements-2311.03346</loc><lastmod>2023-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-probability-marginals-beyond-affine-requirements-2311.03346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-probability-marginals-beyond-affine-requirements-2311.03346"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-conditions-on-one-step-breadth-first-search-2311.03559</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-conditions-on-one-step-breadth-first-search-2311.03559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-conditions-on-one-step-breadth-first-search-2311.03559"/></url>
<url><loc>https://scifaro.com/en/abs/primal-separation-and-approximation-for-the-0-1-2-closure-2311.03909</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/primal-separation-and-approximation-for-the-0-1-2-closure-2311.03909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/primal-separation-and-approximation-for-the-0-1-2-closure-2311.03909"/></url>
<url><loc>https://scifaro.com/en/abs/fast-combinatorial-algorithms-for-efficient-sortation-2311.05094</loc><lastmod>2023-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-combinatorial-algorithms-for-efficient-sortation-2311.05094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-combinatorial-algorithms-for-efficient-sortation-2311.05094"/></url>
<url><loc>https://scifaro.com/en/abs/retrieving-top-k-hyperedge-triplets-models-and-applications-2311.07783</loc><lastmod>2024-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retrieving-top-k-hyperedge-triplets-models-and-applications-2311.07783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retrieving-top-k-hyperedge-triplets-models-and-applications-2311.07783"/></url>
<url><loc>https://scifaro.com/en/abs/solving-time-dependent-traveling-salesman-problem-with-time-windows-under-generic-time-dependent-travel-cost-2311.08111</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-time-dependent-traveling-salesman-problem-with-time-windows-under-generic-time-dependent-travel-cost-2311.08111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-time-dependent-traveling-salesman-problem-with-time-windows-under-generic-time-dependent-travel-cost-2311.08111"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-part-iii-2311.08854</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-part-iii-2311.08854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-part-iii-2311.08854"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-part-ii-2311.08866</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-part-ii-2311.08866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-part-ii-2311.08866"/></url>
<url><loc>https://scifaro.com/en/abs/capacitated-network-bargaining-games-stability-and-structure-2311.09904</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capacitated-network-bargaining-games-stability-and-structure-2311.09904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capacitated-network-bargaining-games-stability-and-structure-2311.09904"/></url>
<url><loc>https://scifaro.com/en/abs/counting-answers-to-unions-of-conjunctive-queries-natural-tractability-criteria-and-meta-complexity-2311.10634</loc><lastmod>2026-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-answers-to-unions-of-conjunctive-queries-natural-tractability-criteria-and-meta-complexity-2311.10634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-answers-to-unions-of-conjunctive-queries-natural-tractability-criteria-and-meta-complexity-2311.10634"/></url>
<url><loc>https://scifaro.com/en/abs/height-of-walks-with-resets-the-moran-model-and-the-discrete-gumbel-distribution-2311.13124</loc><lastmod>2023-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/height-of-walks-with-resets-the-moran-model-and-the-discrete-gumbel-distribution-2311.13124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/height-of-walks-with-resets-the-moran-model-and-the-discrete-gumbel-distribution-2311.13124"/></url>
<url><loc>https://scifaro.com/en/abs/solution-discovery-via-reconfiguration-for-problems-in-p-2311.13478</loc><lastmod>2023-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solution-discovery-via-reconfiguration-for-problems-in-p-2311.13478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solution-discovery-via-reconfiguration-for-problems-in-p-2311.13478"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-permutation-representation-number-of-bipartite-graphs-using-neighborhood-graphs-2311.13980</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-permutation-representation-number-of-bipartite-graphs-using-neighborhood-graphs-2311.13980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-permutation-representation-number-of-bipartite-graphs-using-neighborhood-graphs-2311.13980"/></url>
<url><loc>https://scifaro.com/en/abs/plane-multigraphs-with-one-bend-and-circular-arc-edges-of-a-fixed-angle-2311.15043</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-multigraphs-with-one-bend-and-circular-arc-edges-of-a-fixed-angle-2311.15043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-multigraphs-with-one-bend-and-circular-arc-edges-of-a-fixed-angle-2311.15043"/></url>
<url><loc>https://scifaro.com/en/abs/exact-methods-for-the-longest-induced-cycle-problem-2311.15899</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-methods-for-the-longest-induced-cycle-problem-2311.15899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-methods-for-the-longest-induced-cycle-problem-2311.15899"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-diagnostic-test-methods-to-the-classification-of-time-series-with-discrete-values-2311.16034</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-diagnostic-test-methods-to-the-classification-of-time-series-with-discrete-values-2311.16034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-diagnostic-test-methods-to-the-classification-of-time-series-with-discrete-values-2311.16034"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-optimization-methods-for-the-graph-isomorphism-problem-2311.16912</loc><lastmod>2025-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-optimization-methods-for-the-graph-isomorphism-problem-2311.16912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-optimization-methods-for-the-graph-isomorphism-problem-2311.16912"/></url>
<url><loc>https://scifaro.com/en/abs/local-certification-of-geometric-graph-classes-2311.16953</loc><lastmod>2026-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-certification-of-geometric-graph-classes-2311.16953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-certification-of-geometric-graph-classes-2311.16953"/></url>
<url><loc>https://scifaro.com/en/abs/rumors-with-changing-credibility-2311.17040</loc><lastmod>2023-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rumors-with-changing-credibility-2311.17040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rumors-with-changing-credibility-2311.17040"/></url>
<url><loc>https://scifaro.com/en/abs/composable-constraint-models-for-permutation-enumeration-2311.17581</loc><lastmod>2025-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/composable-constraint-models-for-permutation-enumeration-2311.17581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/composable-constraint-models-for-permutation-enumeration-2311.17581"/></url>
<url><loc>https://scifaro.com/en/abs/assessing-the-reliability-of-multistate-flow-networks-considering-distance-constraints-2311.17872</loc><lastmod>2023-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assessing-the-reliability-of-multistate-flow-networks-considering-distance-constraints-2311.17872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assessing-the-reliability-of-multistate-flow-networks-considering-distance-constraints-2311.17872"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-maximum-dissatisfaction-in-the-allocation-of-indivisible-items-under-a-common-preference-graph-2312.01804</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-maximum-dissatisfaction-in-the-allocation-of-indivisible-items-under-a-common-preference-graph-2312.01804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-maximum-dissatisfaction-in-the-allocation-of-indivisible-items-under-a-common-preference-graph-2312.01804"/></url>
<url><loc>https://scifaro.com/en/abs/testing-popularity-in-linear-time-via-maximum-matching-2312.01880</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-popularity-in-linear-time-via-maximum-matching-2312.01880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-popularity-in-linear-time-via-maximum-matching-2312.01880"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-sweeps-and-high-dimensional-expansion-2312.02089</loc><lastmod>2026-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-sweeps-and-high-dimensional-expansion-2312.02089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-sweeps-and-high-dimensional-expansion-2312.02089"/></url>
<url><loc>https://scifaro.com/en/abs/predicting-horizontal-gene-transfers-with-perfect-transfer-networks-2312.02962</loc><lastmod>2023-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicting-horizontal-gene-transfers-with-perfect-transfer-networks-2312.02962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicting-horizontal-gene-transfers-with-perfect-transfer-networks-2312.02962"/></url>
<url><loc>https://scifaro.com/en/abs/towards-tight-bounds-for-the-graph-homomorphism-problem-parameterized-by-cutwidth-via-asymptotic-rank-parameters-2312.03859</loc><lastmod>2023-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-tight-bounds-for-the-graph-homomorphism-problem-parameterized-by-cutwidth-via-asymptotic-rank-parameters-2312.03859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-tight-bounds-for-the-graph-homomorphism-problem-parameterized-by-cutwidth-via-asymptotic-rank-parameters-2312.03859"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-the-global-domination-problem-2312.04526</loc><lastmod>2024-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-the-global-domination-problem-2312.04526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-the-global-domination-problem-2312.04526"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-transshipments-over-time-2312.04991</loc><lastmod>2023-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-transshipments-over-time-2312.04991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-transshipments-over-time-2312.04991"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-capacity-path-problem-with-loss-factors-2312.05881</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-capacity-path-problem-with-loss-factors-2312.05881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-capacity-path-problem-with-loss-factors-2312.05881"/></url>
<url><loc>https://scifaro.com/en/abs/in-search-of-the-lost-tree-hardness-and-relaxation-of-spanning-trees-in-temporal-graphs-2312.06260</loc><lastmod>2026-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/in-search-of-the-lost-tree-hardness-and-relaxation-of-spanning-trees-in-temporal-graphs-2312.06260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/in-search-of-the-lost-tree-hardness-and-relaxation-of-spanning-trees-in-temporal-graphs-2312.06260"/></url>
<url><loc>https://scifaro.com/en/abs/on-searching-for-minimal-integer-representation-of-undirected-graphs-2312.08539</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-searching-for-minimal-integer-representation-of-undirected-graphs-2312.08539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-searching-for-minimal-integer-representation-of-undirected-graphs-2312.08539"/></url>
<url><loc>https://scifaro.com/en/abs/chi-binding-functions-for-squares-of-bipartite-graphs-and-its-subclasses-2312.08759</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chi-binding-functions-for-squares-of-bipartite-graphs-and-its-subclasses-2312.08759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chi-binding-functions-for-squares-of-bipartite-graphs-and-its-subclasses-2312.08759"/></url>
<url><loc>https://scifaro.com/en/abs/relation-between-broadcast-domination-and-multipacking-numbers-on-chordal-and-other-hyperbolic-graphs-2312.10485</loc><lastmod>2026-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relation-between-broadcast-domination-and-multipacking-numbers-on-chordal-and-other-hyperbolic-graphs-2312.10485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relation-between-broadcast-domination-and-multipacking-numbers-on-chordal-and-other-hyperbolic-graphs-2312.10485"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-apply-tree-decomposition-ideas-in-large-networks-2312.12354</loc><lastmod>2023-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-apply-tree-decomposition-ideas-in-large-networks-2312.12354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-apply-tree-decomposition-ideas-in-large-networks-2312.12354"/></url>
<url><loc>https://scifaro.com/en/abs/moving-a-derivation-along-a-derivation-preserves-the-spine-in-adhesive-categories-2312.13510</loc><lastmod>2025-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moving-a-derivation-along-a-derivation-preserves-the-spine-in-adhesive-categories-2312.13510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moving-a-derivation-along-a-derivation-preserves-the-spine-in-adhesive-categories-2312.13510"/></url>
<url><loc>https://scifaro.com/en/abs/theoretical-analysis-of-git-bisect-2312.13644</loc><lastmod>2024-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theoretical-analysis-of-git-bisect-2312.13644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theoretical-analysis-of-git-bisect-2312.13644"/></url>
<url><loc>https://scifaro.com/en/abs/on-separating-path-and-tree-systems-in-graphs-2312.14295</loc><lastmod>2025-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-separating-path-and-tree-systems-in-graphs-2312.14295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-separating-path-and-tree-systems-in-graphs-2312.14295"/></url>
<url><loc>https://scifaro.com/en/abs/compact-formulations-and-valid-inequalities-for-parallel-machine-scheduling-with-conflicts-2312.14777</loc><lastmod>2025-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-formulations-and-valid-inequalities-for-parallel-machine-scheduling-with-conflicts-2312.14777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-formulations-and-valid-inequalities-for-parallel-machine-scheduling-with-conflicts-2312.14777"/></url>
<url><loc>https://scifaro.com/en/abs/a-spigot-algorithm-for-square-roots-explained-and-extended-2312.15338</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spigot-algorithm-for-square-roots-explained-and-extended-2312.15338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spigot-algorithm-for-square-roots-explained-and-extended-2312.15338"/></url>
<url><loc>https://scifaro.com/en/abs/closed-and-asymptotic-formulae-for-harmonic-and-quadratic-harmonic-sums-2312.15366</loc><lastmod>2024-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closed-and-asymptotic-formulae-for-harmonic-and-quadratic-harmonic-sums-2312.15366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closed-and-asymptotic-formulae-for-harmonic-and-quadratic-harmonic-sums-2312.15366"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-1-planar-graphs-in-ten-pages-2312.15786</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-1-planar-graphs-in-ten-pages-2312.15786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-1-planar-graphs-in-ten-pages-2312.15786"/></url>
<url><loc>https://scifaro.com/en/abs/unique-triangulated-1-planar-graphs-2312.15793</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-triangulated-1-planar-graphs-2312.15793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-triangulated-1-planar-graphs-2312.15793"/></url>
<url><loc>https://scifaro.com/en/abs/probability-graphons-limits-of-large-dense-weighted-graphs-2312.15935</loc><lastmod>2025-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probability-graphons-limits-of-large-dense-weighted-graphs-2312.15935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probability-graphons-limits-of-large-dense-weighted-graphs-2312.15935"/></url>
<url><loc>https://scifaro.com/en/abs/on-rank-monotone-graph-operations-and-minimal-obstruction-graphs-for-the-lov-a-sz-schrijver-sdp-hierarchy-2401.01476</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-rank-monotone-graph-operations-and-minimal-obstruction-graphs-for-the-lov-a-sz-schrijver-sdp-hierarchy-2401.01476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-rank-monotone-graph-operations-and-minimal-obstruction-graphs-for-the-lov-a-sz-schrijver-sdp-hierarchy-2401.01476"/></url>
<url><loc>https://scifaro.com/en/abs/word-representability-of-graphs-with-respect-to-split-recomposition-2401.01954</loc><lastmod>2024-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/word-representability-of-graphs-with-respect-to-split-recomposition-2401.01954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/word-representability-of-graphs-with-respect-to-split-recomposition-2401.01954"/></url>
<url><loc>https://scifaro.com/en/abs/stable-marriage-with-one-sided-preference-2401.03231</loc><lastmod>2024-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-marriage-with-one-sided-preference-2401.03231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-marriage-with-one-sided-preference-2401.03231"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-kernel-for-proper-helly-circular-arc-vertex-deletion-2401.03415</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-kernel-for-proper-helly-circular-arc-vertex-deletion-2401.03415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-kernel-for-proper-helly-circular-arc-vertex-deletion-2401.03415"/></url>
<url><loc>https://scifaro.com/en/abs/from-geometry-to-generating-functions-rectangulations-and-permutations-2401.05558</loc><lastmod>2024-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-geometry-to-generating-functions-rectangulations-and-permutations-2401.05558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-geometry-to-generating-functions-rectangulations-and-permutations-2401.05558"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-complexity-of-subgraphs-of-k-connected-planar-cubic-graphs-2401.05892</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-complexity-of-subgraphs-of-k-connected-planar-cubic-graphs-2401.05892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-complexity-of-subgraphs-of-k-connected-planar-cubic-graphs-2401.05892"/></url>
<url><loc>https://scifaro.com/en/abs/computability-of-extender-sets-in-multidimensional-subshifts-asymptotic-growths-dynamical-constraints-2401.07549</loc><lastmod>2025-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-of-extender-sets-in-multidimensional-subshifts-asymptotic-growths-dynamical-constraints-2401.07549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-of-extender-sets-in-multidimensional-subshifts-asymptotic-growths-dynamical-constraints-2401.07549"/></url>
<url><loc>https://scifaro.com/en/abs/a-greedy-heuristic-for-graph-burning-2401.07577</loc><lastmod>2025-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-greedy-heuristic-for-graph-burning-2401.07577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-greedy-heuristic-for-graph-burning-2401.07577"/></url>
<url><loc>https://scifaro.com/en/abs/graph-structure-of-an-inversive-pseudorandom-number-generator-over-ring-mathbb-z-p-e-2401.08161</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-structure-of-an-inversive-pseudorandom-number-generator-over-ring-mathbb-z-p-e-2401.08161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-structure-of-an-inversive-pseudorandom-number-generator-over-ring-mathbb-z-p-e-2401.08161"/></url>
<url><loc>https://scifaro.com/en/abs/token-jumping-in-planar-graphs-has-linear-sized-kernels-2401.09543</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/token-jumping-in-planar-graphs-has-linear-sized-kernels-2401.09543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/token-jumping-in-planar-graphs-has-linear-sized-kernels-2401.09543"/></url>
<url><loc>https://scifaro.com/en/abs/generation-of-weighted-trees-block-trees-and-block-graphs-2401.09764</loc><lastmod>2024-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generation-of-weighted-trees-block-trees-and-block-graphs-2401.09764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generation-of-weighted-trees-block-trees-and-block-graphs-2401.09764"/></url>
<url><loc>https://scifaro.com/en/abs/fast-winning-strategies-for-the-attacker-in-eternal-domination-2401.10584</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-winning-strategies-for-the-attacker-in-eternal-domination-2401.10584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-winning-strategies-for-the-attacker-in-eternal-domination-2401.10584"/></url>
<url><loc>https://scifaro.com/en/abs/a-simulation-of-optimal-dryness-when-moving-in-the-rain-or-snow-using-matlab-2401.12023</loc><lastmod>2024-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simulation-of-optimal-dryness-when-moving-in-the-rain-or-snow-using-matlab-2401.12023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simulation-of-optimal-dryness-when-moving-in-the-rain-or-snow-using-matlab-2401.12023"/></url>
<url><loc>https://scifaro.com/en/abs/multi-machine-preventative-maintenance-scheduling-with-imperfect-interventions-a-restless-bandit-approach-2401.14055</loc><lastmod>2024-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-machine-preventative-maintenance-scheduling-with-imperfect-interventions-a-restless-bandit-approach-2401.14055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-machine-preventative-maintenance-scheduling-with-imperfect-interventions-a-restless-bandit-approach-2401.14055"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-gray-code-problems-for-combinatorial-objects-2401.14963</loc><lastmod>2024-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-gray-code-problems-for-combinatorial-objects-2401.14963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-gray-code-problems-for-combinatorial-objects-2401.14963"/></url>
<url><loc>https://scifaro.com/en/abs/transit-functions-and-clustering-systems-2401.15662</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transit-functions-and-clustering-systems-2401.15662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transit-functions-and-clustering-systems-2401.15662"/></url>
<url><loc>https://scifaro.com/en/abs/from-tripods-to-bipods-reducing-the-queue-number-of-planar-graphs-costs-just-one-leg-2401.16191</loc><lastmod>2024-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-tripods-to-bipods-reducing-the-queue-number-of-planar-graphs-costs-just-one-leg-2401.16191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-tripods-to-bipods-reducing-the-queue-number-of-planar-graphs-costs-just-one-leg-2401.16191"/></url>
<url><loc>https://scifaro.com/en/abs/heuristics-for-the-run-length-encoded-burrows-wheeler-transform-alphabet-ordering-problem-2401.16435</loc><lastmod>2025-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristics-for-the-run-length-encoded-burrows-wheeler-transform-alphabet-ordering-problem-2401.16435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristics-for-the-run-length-encoded-burrows-wheeler-transform-alphabet-ordering-problem-2401.16435"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-forcing-spectrum-of-outerplanar-graphs-in-polynomial-time-2401.17704</loc><lastmod>2024-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-forcing-spectrum-of-outerplanar-graphs-in-polynomial-time-2401.17704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-forcing-spectrum-of-outerplanar-graphs-in-polynomial-time-2401.17704"/></url>
<url><loc>https://scifaro.com/en/abs/the-1-3-conjectures-for-domination-in-cubic-graphs-2401.17820</loc><lastmod>2024-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-1-3-conjectures-for-domination-in-cubic-graphs-2401.17820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-1-3-conjectures-for-domination-in-cubic-graphs-2401.17820"/></url>
<url><loc>https://scifaro.com/en/abs/the-graph-pencil-method-mapping-subgraph-densities-to-stochastic-block-models-2402.00188</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graph-pencil-method-mapping-subgraph-densities-to-stochastic-block-models-2402.00188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graph-pencil-method-mapping-subgraph-densities-to-stochastic-block-models-2402.00188"/></url>
<url><loc>https://scifaro.com/en/abs/rdnf-oriented-analytics-to-random-boolean-functions-2402.00999</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rdnf-oriented-analytics-to-random-boolean-functions-2402.00999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rdnf-oriented-analytics-to-random-boolean-functions-2402.00999"/></url>
<url><loc>https://scifaro.com/en/abs/trees-and-co-trees-in-planar-3-connected-graphs-an-easier-proof-via-schnyder-woods-2402.01230</loc><lastmod>2024-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-and-co-trees-in-planar-3-connected-graphs-an-easier-proof-via-schnyder-woods-2402.01230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-and-co-trees-in-planar-3-connected-graphs-an-easier-proof-via-schnyder-woods-2402.01230"/></url>
<url><loc>https://scifaro.com/en/abs/polygonal-corona-limit-on-multigrid-dual-tilings-2402.01257</loc><lastmod>2024-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygonal-corona-limit-on-multigrid-dual-tilings-2402.01257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygonal-corona-limit-on-multigrid-dual-tilings-2402.01257"/></url>
<url><loc>https://scifaro.com/en/abs/morse-frames-2402.02874</loc><lastmod>2026-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morse-frames-2402.02874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morse-frames-2402.02874"/></url>
<url><loc>https://scifaro.com/en/abs/noisy-group-testing-via-spatial-coupling-2402.02895</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noisy-group-testing-via-spatial-coupling-2402.02895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noisy-group-testing-via-spatial-coupling-2402.02895"/></url>
<url><loc>https://scifaro.com/en/abs/independent-set-reconfiguration-in-h-free-graphs-2402.03063</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-set-reconfiguration-in-h-free-graphs-2402.03063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-set-reconfiguration-in-h-free-graphs-2402.03063"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-dynamics-of-isomorphic-boolean-networks-2402.03092</loc><lastmod>2026-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-dynamics-of-isomorphic-boolean-networks-2402.03092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-dynamics-of-isomorphic-boolean-networks-2402.03092"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-weisfeiler-leman-dimension-via-a-depth-analysis-of-i-r-trees-2402.03274</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-weisfeiler-leman-dimension-via-a-depth-analysis-of-i-r-trees-2402.03274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-weisfeiler-leman-dimension-via-a-depth-analysis-of-i-r-trees-2402.03274"/></url>
<url><loc>https://scifaro.com/en/abs/fast-solutions-to-k-parity-and-k-synchronisation-using-parallel-automata-networks-2402.03306</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-solutions-to-k-parity-and-k-synchronisation-using-parallel-automata-networks-2402.03306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-solutions-to-k-parity-and-k-synchronisation-using-parallel-automata-networks-2402.03306"/></url>
<url><loc>https://scifaro.com/en/abs/almost-perfect-mutually-unbiased-bases-that-are-sparse-2402.03964</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-perfect-mutually-unbiased-bases-that-are-sparse-2402.03964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-perfect-mutually-unbiased-bases-that-are-sparse-2402.03964"/></url>
<url><loc>https://scifaro.com/en/abs/further-constructions-of-amubs-for-non-prime-power-composite-dimensions-2402.04231</loc><lastmod>2024-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-constructions-of-amubs-for-non-prime-power-composite-dimensions-2402.04231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-constructions-of-amubs-for-non-prime-power-composite-dimensions-2402.04231"/></url>
<url><loc>https://scifaro.com/en/abs/the-domino-problem-is-decidable-for-robust-tilesets-2402.04438</loc><lastmod>2024-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-domino-problem-is-decidable-for-robust-tilesets-2402.04438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-domino-problem-is-decidable-for-robust-tilesets-2402.04438"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-connected-cluster-vertex-deletion-problem-on-h-free-graphs-2402.04931</loc><lastmod>2024-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-connected-cluster-vertex-deletion-problem-on-h-free-graphs-2402.04931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-connected-cluster-vertex-deletion-problem-on-h-free-graphs-2402.04931"/></url>
<url><loc>https://scifaro.com/en/abs/toward-gr-unbaum-s-conjecture-2402.05681</loc><lastmod>2024-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-gr-unbaum-s-conjecture-2402.05681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-gr-unbaum-s-conjecture-2402.05681"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-3-role-assignment-is-polynomial-time-solvable-on-complementary-prisms-2402.06068</loc><lastmod>2024-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-3-role-assignment-is-polynomial-time-solvable-on-complementary-prisms-2402.06068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-3-role-assignment-is-polynomial-time-solvable-on-complementary-prisms-2402.06068"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-boolean-automata-networks-under-block-parallel-update-modes-2402.06294</loc><lastmod>2024-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-boolean-automata-networks-under-block-parallel-update-modes-2402.06294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-boolean-automata-networks-under-block-parallel-update-modes-2402.06294"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-matchings-in-bipartite-graphs-with-ordered-vertex-sets-2402.06729</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-matchings-in-bipartite-graphs-with-ordered-vertex-sets-2402.06729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-matchings-in-bipartite-graphs-with-ordered-vertex-sets-2402.06729"/></url>
<url><loc>https://scifaro.com/en/abs/on-coloring-graphs-with-well-distributed-edge-density-2402.06803</loc><lastmod>2025-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-coloring-graphs-with-well-distributed-edge-density-2402.06803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-coloring-graphs-with-well-distributed-edge-density-2402.06803"/></url>
<url><loc>https://scifaro.com/en/abs/growth-rate-of-the-number-of-empty-triangles-in-the-plane-2402.07775</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/growth-rate-of-the-number-of-empty-triangles-in-the-plane-2402.07775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/growth-rate-of-the-number-of-empty-triangles-in-the-plane-2402.07775"/></url>
<url><loc>https://scifaro.com/en/abs/on-iiro-honkala-s-contributions-to-identifying-codes-2402.08264</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-iiro-honkala-s-contributions-to-identifying-codes-2402.08264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-iiro-honkala-s-contributions-to-identifying-codes-2402.08264"/></url>
<url><loc>https://scifaro.com/en/abs/monotonicity-of-the-cops-and-robber-game-for-bounded-depth-treewidth-2402.09139</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotonicity-of-the-cops-and-robber-game-for-bounded-depth-treewidth-2402.09139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotonicity-of-the-cops-and-robber-game-for-bounded-depth-treewidth-2402.09139"/></url>
<url><loc>https://scifaro.com/en/abs/irreducible-markov-chains-on-spaces-of-graphs-with-fixed-degree-color-sequences-2402.09568</loc><lastmod>2026-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irreducible-markov-chains-on-spaces-of-graphs-with-fixed-degree-color-sequences-2402.09568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irreducible-markov-chains-on-spaces-of-graphs-with-fixed-degree-color-sequences-2402.09568"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-independence-beyond-uniqueness-with-the-topological-method-an-extended-view-2402.11647</loc><lastmod>2025-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-independence-beyond-uniqueness-with-the-topological-method-an-extended-view-2402.11647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-independence-beyond-uniqueness-with-the-topological-method-an-extended-view-2402.11647"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-reduce-temporal-cliques-to-find-sparse-spanners-2402.13624</loc><lastmod>2024-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-reduce-temporal-cliques-to-find-sparse-spanners-2402.13624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-reduce-temporal-cliques-to-find-sparse-spanners-2402.13624"/></url>
<url><loc>https://scifaro.com/en/abs/extending-the-definition-of-set-tolerances-2402.14542</loc><lastmod>2024-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-the-definition-of-set-tolerances-2402.14542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-the-definition-of-set-tolerances-2402.14542"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-involving-the-a-alpha-eigenvalues-for-graphs-and-line-graphs-2402.15470</loc><lastmod>2024-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-involving-the-a-alpha-eigenvalues-for-graphs-and-line-graphs-2402.15470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-involving-the-a-alpha-eigenvalues-for-graphs-and-line-graphs-2402.15470"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-listings-as-computation-2402.15885</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-listings-as-computation-2402.15885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-listings-as-computation-2402.15885"/></url>
<url><loc>https://scifaro.com/en/abs/problems-on-group-labeled-matroid-bases-2402.16259</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/problems-on-group-labeled-matroid-bases-2402.16259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/problems-on-group-labeled-matroid-bases-2402.16259"/></url>
<url><loc>https://scifaro.com/en/abs/box-facets-and-cut-facets-of-lifted-multicut-polytopes-2402.16814</loc><lastmod>2024-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/box-facets-and-cut-facets-of-lifted-multicut-polytopes-2402.16814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/box-facets-and-cut-facets-of-lifted-multicut-polytopes-2402.16814"/></url>
<url><loc>https://scifaro.com/en/abs/on-solving-basic-equations-over-the-semiring-of-functional-digraphs-2402.16923</loc><lastmod>2025-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-solving-basic-equations-over-the-semiring-of-functional-digraphs-2402.16923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-solving-basic-equations-over-the-semiring-of-functional-digraphs-2402.16923"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-leaf-rank-of-leaf-powers-2402.18245</loc><lastmod>2024-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-leaf-rank-of-leaf-powers-2402.18245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-leaf-rank-of-leaf-powers-2402.18245"/></url>
<url><loc>https://scifaro.com/en/abs/more-algorithmic-results-for-problems-of-spread-of-influence-in-edge-weighted-graphs-with-and-without-incentives-2402.19257</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/more-algorithmic-results-for-problems-of-spread-of-influence-in-edge-weighted-graphs-with-and-without-incentives-2402.19257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/more-algorithmic-results-for-problems-of-spread-of-influence-in-edge-weighted-graphs-with-and-without-incentives-2402.19257"/></url>
<url><loc>https://scifaro.com/en/abs/graph-drawing-applications-in-combinatorial-theory-of-maturity-models-2403.02026</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-drawing-applications-in-combinatorial-theory-of-maturity-models-2403.02026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-drawing-applications-in-combinatorial-theory-of-maturity-models-2403.02026"/></url>
<url><loc>https://scifaro.com/en/abs/payment-scheduling-in-the-interval-debt-model-2403.02198</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/payment-scheduling-in-the-interval-debt-model-2403.02198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/payment-scheduling-in-the-interval-debt-model-2403.02198"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-and-verifying-the-convergence-stairs-of-the-collatz-program-2403.04777</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-and-verifying-the-convergence-stairs-of-the-collatz-program-2403.04777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-and-verifying-the-convergence-stairs-of-the-collatz-program-2403.04777"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-maximum-edge-2-coloring-by-normalizing-graphs-2403.06691</loc><lastmod>2025-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-maximum-edge-2-coloring-by-normalizing-graphs-2403.06691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-maximum-edge-2-coloring-by-normalizing-graphs-2403.06691"/></url>
<url><loc>https://scifaro.com/en/abs/ensuring-connectedness-for-the-maximum-quasi-clique-and-densest-k-subgraph-problems-2403.08534</loc><lastmod>2024-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ensuring-connectedness-for-the-maximum-quasi-clique-and-densest-k-subgraph-problems-2403.08534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ensuring-connectedness-for-the-maximum-quasi-clique-and-densest-k-subgraph-problems-2403.08534"/></url>
<url><loc>https://scifaro.com/en/abs/improved-dynamics-for-the-maximum-common-subgraph-problem-2403.08703</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-dynamics-for-the-maximum-common-subgraph-problem-2403.08703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-dynamics-for-the-maximum-common-subgraph-problem-2403.08703"/></url>
<url><loc>https://scifaro.com/en/abs/on-sampling-diluted-spin-glasses-using-glauber-dynamics-2403.08921</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sampling-diluted-spin-glasses-using-glauber-dynamics-2403.08921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sampling-diluted-spin-glasses-using-glauber-dynamics-2403.08921"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-and-extremal-graphs-for-monitoring-edge-geodetic-sets-in-graphs-2403.09122</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-and-extremal-graphs-for-monitoring-edge-geodetic-sets-in-graphs-2403.09122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-and-extremal-graphs-for-monitoring-edge-geodetic-sets-in-graphs-2403.09122"/></url>
<url><loc>https://scifaro.com/en/abs/binary-stretch-embedding-of-weighted-graphs-2403.09311</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-stretch-embedding-of-weighted-graphs-2403.09311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-stretch-embedding-of-weighted-graphs-2403.09311"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-multiobjective-quasi-clique-problem-2403.10896</loc><lastmod>2026-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-multiobjective-quasi-clique-problem-2403.10896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-multiobjective-quasi-clique-problem-2403.10896"/></url>
<url><loc>https://scifaro.com/en/abs/home-spaces-and-invariants-to-analyze-parameterized-petri-nets-2403.11779</loc><lastmod>2024-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/home-spaces-and-invariants-to-analyze-parameterized-petri-nets-2403.11779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/home-spaces-and-invariants-to-analyze-parameterized-petri-nets-2403.11779"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-on-the-weisfeiler-leman-dimension-2403.12581</loc><lastmod>2025-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-on-the-weisfeiler-leman-dimension-2403.12581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-on-the-weisfeiler-leman-dimension-2403.12581"/></url>
<url><loc>https://scifaro.com/en/abs/the-ultrametric-backbone-is-the-union-of-all-minimum-spanning-forests-2403.12705</loc><lastmod>2024-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-ultrametric-backbone-is-the-union-of-all-minimum-spanning-forests-2403.12705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-ultrametric-backbone-is-the-union-of-all-minimum-spanning-forests-2403.12705"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-the-crochemore-and-ziv-lempel-factorizations-of-some-automatic-sequences-with-the-software-walnut-2403.15215</loc><lastmod>2024-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-the-crochemore-and-ziv-lempel-factorizations-of-some-automatic-sequences-with-the-software-walnut-2403.15215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-the-crochemore-and-ziv-lempel-factorizations-of-some-automatic-sequences-with-the-software-walnut-2403.15215"/></url>
<url><loc>https://scifaro.com/en/abs/robust-filter-design-for-graph-signals-2403.16983</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-filter-design-for-graph-signals-2403.16983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-filter-design-for-graph-signals-2403.16983"/></url>
<url><loc>https://scifaro.com/en/abs/antimagic-labeling-of-graphs-using-prime-numbers-2403.17969</loc><lastmod>2024-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/antimagic-labeling-of-graphs-using-prime-numbers-2403.17969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/antimagic-labeling-of-graphs-using-prime-numbers-2403.17969"/></url>
<url><loc>https://scifaro.com/en/abs/a-temporal-graph-model-to-study-the-dynamics-of-collective-behavior-and-performance-in-team-sports-an-application-to-basketball-2404.01909</loc><lastmod>2024-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-temporal-graph-model-to-study-the-dynamics-of-collective-behavior-and-performance-in-team-sports-an-application-to-basketball-2404.01909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-temporal-graph-model-to-study-the-dynamics-of-collective-behavior-and-performance-in-team-sports-an-application-to-basketball-2404.01909"/></url>
<url><loc>https://scifaro.com/en/abs/automated-inference-of-graph-transformation-rules-2404.02692</loc><lastmod>2024-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-inference-of-graph-transformation-rules-2404.02692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-inference-of-graph-transformation-rules-2404.02692"/></url>
<url><loc>https://scifaro.com/en/abs/the-steady-states-of-splitter-networks-2404.05472</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-steady-states-of-splitter-networks-2404.05472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-steady-states-of-splitter-networks-2404.05472"/></url>
<url><loc>https://scifaro.com/en/abs/space-time-deterministic-graph-rewriting-2404.05838</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-time-deterministic-graph-rewriting-2404.05838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-time-deterministic-graph-rewriting-2404.05838"/></url>
<url><loc>https://scifaro.com/en/abs/the-central-spanning-tree-problem-2404.06447</loc><lastmod>2024-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-central-spanning-tree-problem-2404.06447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-central-spanning-tree-problem-2404.06447"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-estimates-of-the-diameters-of-the-rubik-s-cube-groups-2404.07337</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-estimates-of-the-diameters-of-the-rubik-s-cube-groups-2404.07337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-estimates-of-the-diameters-of-the-rubik-s-cube-groups-2404.07337"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-on-demand-ride-sharing-with-mass-transit-at-scale-2404.07691</loc><lastmod>2024-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-on-demand-ride-sharing-with-mass-transit-at-scale-2404.07691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-on-demand-ride-sharing-with-mass-transit-at-scale-2404.07691"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-some-classical-linearizations-of-the-quadratic-binary-optimization-problem-2404.09437</loc><lastmod>2024-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-some-classical-linearizations-of-the-quadratic-binary-optimization-problem-2404.09437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-some-classical-linearizations-of-the-quadratic-binary-optimization-problem-2404.09437"/></url>
<url><loc>https://scifaro.com/en/abs/robot-positioning-using-torus-packing-for-multisets-2404.09981</loc><lastmod>2024-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robot-positioning-using-torus-packing-for-multisets-2404.09981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robot-positioning-using-torus-packing-for-multisets-2404.09981"/></url>
<url><loc>https://scifaro.com/en/abs/the-simultaneous-interval-number-a-new-width-parameter-that-measures-the-similarity-to-interval-graphs-2404.10670</loc><lastmod>2024-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simultaneous-interval-number-a-new-width-parameter-that-measures-the-similarity-to-interval-graphs-2404.10670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simultaneous-interval-number-a-new-width-parameter-that-measures-the-similarity-to-interval-graphs-2404.10670"/></url>
<url><loc>https://scifaro.com/en/abs/linear-search-for-an-escaping-target-with-unknown-speed-2404.14300</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-search-for-an-escaping-target-with-unknown-speed-2404.14300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-search-for-an-escaping-target-with-unknown-speed-2404.14300"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2404.15950</loc><lastmod>2026-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2404.15950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2404.15950"/></url>
<url><loc>https://scifaro.com/en/abs/fo-logic-on-cellular-automata-orbits-equals-mso-logic-2404.16430</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-logic-on-cellular-automata-orbits-equals-mso-logic-2404.16430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-logic-on-cellular-automata-orbits-equals-mso-logic-2404.16430"/></url>
<url><loc>https://scifaro.com/en/abs/computing-hamiltonian-paths-with-partial-order-restrictions-2404.16662</loc><lastmod>2025-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-hamiltonian-paths-with-partial-order-restrictions-2404.16662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-hamiltonian-paths-with-partial-order-restrictions-2404.16662"/></url>
<url><loc>https://scifaro.com/en/abs/tinygarden-a-java-package-for-testing-properties-of-spanning-trees-2404.16878</loc><lastmod>2024-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tinygarden-a-java-package-for-testing-properties-of-spanning-trees-2404.16878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tinygarden-a-java-package-for-testing-properties-of-spanning-trees-2404.16878"/></url>
<url><loc>https://scifaro.com/en/abs/first-fit-coloring-of-forests-in-random-arrival-model-2404.17011</loc><lastmod>2024-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-fit-coloring-of-forests-in-random-arrival-model-2404.17011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-fit-coloring-of-forests-in-random-arrival-model-2404.17011"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-graph-burning-problem-for-large-graphs-2404.17080</loc><lastmod>2024-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-graph-burning-problem-for-large-graphs-2404.17080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-graph-burning-problem-for-large-graphs-2404.17080"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-the-minimum-spanning-tree-cycle-intersection-problem-2404.17428</loc><lastmod>2024-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-the-minimum-spanning-tree-cycle-intersection-problem-2404.17428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-the-minimum-spanning-tree-cycle-intersection-problem-2404.17428"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-delivery-with-a-faulty-drone-2404.17711</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-delivery-with-a-faulty-drone-2404.17711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-delivery-with-a-faulty-drone-2404.17711"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-roberts-characterization-of-unit-interval-graphs-2404.17872</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-roberts-characterization-of-unit-interval-graphs-2404.17872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-roberts-characterization-of-unit-interval-graphs-2404.17872"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-dominating-sets-in-graphs-2404.18028</loc><lastmod>2024-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-dominating-sets-in-graphs-2404.18028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-dominating-sets-in-graphs-2404.18028"/></url>
<url><loc>https://scifaro.com/en/abs/graph-search-trees-and-the-intermezzo-problem-2404.18645</loc><lastmod>2024-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-search-trees-and-the-intermezzo-problem-2404.18645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-search-trees-and-the-intermezzo-problem-2404.18645"/></url>
<url><loc>https://scifaro.com/en/abs/on-classes-of-bounded-tree-rank-their-interpretations-and-efficient-sparsification-2404.18904</loc><lastmod>2025-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-classes-of-bounded-tree-rank-their-interpretations-and-efficient-sparsification-2404.18904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-classes-of-bounded-tree-rank-their-interpretations-and-efficient-sparsification-2404.18904"/></url>
<url><loc>https://scifaro.com/en/abs/cycles-of-well-linked-sets-i-an-elementary-bound-for-directed-cycle-packing-2404.19222</loc><lastmod>2026-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cycles-of-well-linked-sets-i-an-elementary-bound-for-directed-cycle-packing-2404.19222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cycles-of-well-linked-sets-i-an-elementary-bound-for-directed-cycle-packing-2404.19222"/></url>
<url><loc>https://scifaro.com/en/abs/alternative-paths-computation-for-congestion-mitigation-in-segment-routing-networks-2404.19314</loc><lastmod>2024-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternative-paths-computation-for-congestion-mitigation-in-segment-routing-networks-2404.19314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternative-paths-computation-for-congestion-mitigation-in-segment-routing-networks-2404.19314"/></url>
<url><loc>https://scifaro.com/en/abs/structural-parameters-for-dense-temporal-graphs-2404.19453</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-parameters-for-dense-temporal-graphs-2404.19453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-parameters-for-dense-temporal-graphs-2404.19453"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-temporal-graphs-under-perturbation-2404.19479</loc><lastmod>2025-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-temporal-graphs-under-perturbation-2404.19479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-temporal-graphs-under-perturbation-2404.19479"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-efficient-algorithm-for-enumerating-all-the-extreme-points-of-a-bisubmodular-polyhedron-2405.01039</loc><lastmod>2024-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-efficient-algorithm-for-enumerating-all-the-extreme-points-of-a-bisubmodular-polyhedron-2405.01039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-efficient-algorithm-for-enumerating-all-the-extreme-points-of-a-bisubmodular-polyhedron-2405.01039"/></url>
<url><loc>https://scifaro.com/en/abs/the-birkhoff-completion-of-finite-lattices-2405.02342</loc><lastmod>2024-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-birkhoff-completion-of-finite-lattices-2405.02342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-birkhoff-completion-of-finite-lattices-2405.02342"/></url>
<url><loc>https://scifaro.com/en/abs/the-number-of-random-2-sat-solutions-is-asymptotically-log-normal-2405.03302</loc><lastmod>2024-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-number-of-random-2-sat-solutions-is-asymptotically-log-normal-2405.03302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-number-of-random-2-sat-solutions-is-asymptotically-log-normal-2405.03302"/></url>
<url><loc>https://scifaro.com/en/abs/on-de-bruijn-rings-and-families-of-almost-perfect-maps-2405.03309</loc><lastmod>2025-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-de-bruijn-rings-and-families-of-almost-perfect-maps-2405.03309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-de-bruijn-rings-and-families-of-almost-perfect-maps-2405.03309"/></url>
<url><loc>https://scifaro.com/en/abs/partially-ordered-sets-corresponding-to-the-partition-problem-2405.05544</loc><lastmod>2024-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partially-ordered-sets-corresponding-to-the-partition-problem-2405.05544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partially-ordered-sets-corresponding-to-the-partition-problem-2405.05544"/></url>
<url><loc>https://scifaro.com/en/abs/strict-self-assembly-of-discrete-self-similar-fractal-shapes-2405.08548</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strict-self-assembly-of-discrete-self-similar-fractal-shapes-2405.08548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strict-self-assembly-of-discrete-self-similar-fractal-shapes-2405.08548"/></url>
<url><loc>https://scifaro.com/en/abs/on-maximal-families-of-binary-polynomials-with-pairwise-linear-common-factors-2405.08741</loc><lastmod>2024-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-maximal-families-of-binary-polynomials-with-pairwise-linear-common-factors-2405.08741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-maximal-families-of-binary-polynomials-with-pairwise-linear-common-factors-2405.08741"/></url>
<url><loc>https://scifaro.com/en/abs/roots-in-the-semiring-of-finite-deterministic-dynamical-systems-2405.09236</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/roots-in-the-semiring-of-finite-deterministic-dynamical-systems-2405.09236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/roots-in-the-semiring-of-finite-deterministic-dynamical-systems-2405.09236"/></url>
<url><loc>https://scifaro.com/en/abs/kolmogorov-complexity-as-a-combinatorial-tool-2405.09304</loc><lastmod>2024-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kolmogorov-complexity-as-a-combinatorial-tool-2405.09304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kolmogorov-complexity-as-a-combinatorial-tool-2405.09304"/></url>
<url><loc>https://scifaro.com/en/abs/counting-overlapping-pairs-of-words-2405.09393</loc><lastmod>2025-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-overlapping-pairs-of-words-2405.09393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-overlapping-pairs-of-words-2405.09393"/></url>
<url><loc>https://scifaro.com/en/abs/metric-dimension-and-resolvability-of-jaccard-spaces-2405.11424</loc><lastmod>2024-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-dimension-and-resolvability-of-jaccard-spaces-2405.11424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-dimension-and-resolvability-of-jaccard-spaces-2405.11424"/></url>
<url><loc>https://scifaro.com/en/abs/local-search-for-valued-constraint-satisfaction-parameterized-by-treedepth-2405.12410</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-search-for-valued-constraint-satisfaction-parameterized-by-treedepth-2405.12410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-search-for-valued-constraint-satisfaction-parameterized-by-treedepth-2405.12410"/></url>
<url><loc>https://scifaro.com/en/abs/exponential-steepest-ascent-from-valued-constraint-graphs-of-pathwidth-four-2405.12906</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exponential-steepest-ascent-from-valued-constraint-graphs-of-pathwidth-four-2405.12906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exponential-steepest-ascent-from-valued-constraint-graphs-of-pathwidth-four-2405.12906"/></url>
<url><loc>https://scifaro.com/en/abs/improved-upper-bounds-for-the-heilbronn-s-problem-for-k-gons-2405.12945</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-upper-bounds-for-the-heilbronn-s-problem-for-k-gons-2405.12945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-upper-bounds-for-the-heilbronn-s-problem-for-k-gons-2405.12945"/></url>
<url><loc>https://scifaro.com/en/abs/counting-the-number-of-inequivalent-arithmetic-expressions-on-n-variables-2405.13928</loc><lastmod>2026-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-the-number-of-inequivalent-arithmetic-expressions-on-n-variables-2405.13928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-the-number-of-inequivalent-arithmetic-expressions-on-n-variables-2405.13928"/></url>
<url><loc>https://scifaro.com/en/abs/soft-happy-colourings-and-community-structure-of-networks-2405.15663</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soft-happy-colourings-and-community-structure-of-networks-2405.15663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soft-happy-colourings-and-community-structure-of-networks-2405.15663"/></url>
<url><loc>https://scifaro.com/en/abs/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence-2405.16149</loc><lastmod>2024-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence-2405.16149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence-2405.16149"/></url>
<url><loc>https://scifaro.com/en/abs/remote-control-system-of-a-binary-tree-of-switches-i-constraints-and-inequalities-2405.16938</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/remote-control-system-of-a-binary-tree-of-switches-i-constraints-and-inequalities-2405.16938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/remote-control-system-of-a-binary-tree-of-switches-i-constraints-and-inequalities-2405.16938"/></url>
<url><loc>https://scifaro.com/en/abs/remote-control-system-of-a-binary-tree-of-switches-ii-balancing-for-a-perfect-binary-tree-2405.16968</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/remote-control-system-of-a-binary-tree-of-switches-ii-balancing-for-a-perfect-binary-tree-2405.16968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/remote-control-system-of-a-binary-tree-of-switches-ii-balancing-for-a-perfect-binary-tree-2405.16968"/></url>
<url><loc>https://scifaro.com/en/abs/dual-vc-dimension-obstructs-sample-compression-by-embeddings-2405.17120</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-vc-dimension-obstructs-sample-compression-by-embeddings-2405.17120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-vc-dimension-obstructs-sample-compression-by-embeddings-2405.17120"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-abelian-complexities-of-parikh-collinear-fixed-points-2405.18032</loc><lastmod>2024-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-abelian-complexities-of-parikh-collinear-fixed-points-2405.18032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-abelian-complexities-of-parikh-collinear-fixed-points-2405.18032"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-the-decomposition-of-complete-graph-into-minimum-number-of-edge-disjoint-trees-2405.18506</loc><lastmod>2024-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-the-decomposition-of-complete-graph-into-minimum-number-of-edge-disjoint-trees-2405.18506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-the-decomposition-of-complete-graph-into-minimum-number-of-edge-disjoint-trees-2405.18506"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-the-euclidean-bounded-multiple-traveling-salesman-problem-2405.18615</loc><lastmod>2024-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-the-euclidean-bounded-multiple-traveling-salesman-problem-2405.18615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-the-euclidean-bounded-multiple-traveling-salesman-problem-2405.18615"/></url>
<url><loc>https://scifaro.com/en/abs/homomorphism-counts-to-trees-2405.19147</loc><lastmod>2025-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homomorphism-counts-to-trees-2405.19147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homomorphism-counts-to-trees-2405.19147"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-high-dimensional-expanders-via-local-lifts-2405.19191</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-high-dimensional-expanders-via-local-lifts-2405.19191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-high-dimensional-expanders-via-local-lifts-2405.19191"/></url>
<url><loc>https://scifaro.com/en/abs/on-shortest-products-for-nonnegative-matrix-mortality-2405.19622</loc><lastmod>2025-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-shortest-products-for-nonnegative-matrix-mortality-2405.19622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-shortest-products-for-nonnegative-matrix-mortality-2405.19622"/></url>
<url><loc>https://scifaro.com/en/abs/matrix-rationalization-via-partial-orders-2405.20976</loc><lastmod>2024-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matrix-rationalization-via-partial-orders-2405.20976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matrix-rationalization-via-partial-orders-2405.20976"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-terminal-monitoring-set-2406.01730</loc><lastmod>2024-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-terminal-monitoring-set-2406.01730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-terminal-monitoring-set-2406.01730"/></url>
<url><loc>https://scifaro.com/en/abs/phenotype-control-and-elimination-of-variables-in-boolean-networks-2406.02304</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/phenotype-control-and-elimination-of-variables-in-boolean-networks-2406.02304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/phenotype-control-and-elimination-of-variables-in-boolean-networks-2406.02304"/></url>
<url><loc>https://scifaro.com/en/abs/representing-piecewise-linear-functions-by-functions-with-minimal-arity-2406.02421</loc><lastmod>2024-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-piecewise-linear-functions-by-functions-with-minimal-arity-2406.02421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-piecewise-linear-functions-by-functions-with-minimal-arity-2406.02421"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-about-majority-colorings-of-countable-dags-2406.04189</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-about-majority-colorings-of-countable-dags-2406.04189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-about-majority-colorings-of-countable-dags-2406.04189"/></url>
<url><loc>https://scifaro.com/en/abs/maximal-line-digraphs-2406.05141</loc><lastmod>2024-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximal-line-digraphs-2406.05141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximal-line-digraphs-2406.05141"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-properties-of-dynamic-processes-on-graphs-2406.05147</loc><lastmod>2024-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-properties-of-dynamic-processes-on-graphs-2406.05147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-properties-of-dynamic-processes-on-graphs-2406.05147"/></url>
<url><loc>https://scifaro.com/en/abs/open-packing-in-graphs-bounds-and-complexity-2406.06982</loc><lastmod>2024-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-packing-in-graphs-bounds-and-complexity-2406.06982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-packing-in-graphs-bounds-and-complexity-2406.06982"/></url>
<url><loc>https://scifaro.com/en/abs/highly-connected-graph-partitioning-exact-formulation-and-solution-methods-2406.08329</loc><lastmod>2024-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/highly-connected-graph-partitioning-exact-formulation-and-solution-methods-2406.08329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/highly-connected-graph-partitioning-exact-formulation-and-solution-methods-2406.08329"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-maximal-l1-influence-of-real-valued-boolean-functions-2406.10772</loc><lastmod>2024-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-maximal-l1-influence-of-real-valued-boolean-functions-2406.10772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-maximal-l1-influence-of-real-valued-boolean-functions-2406.10772"/></url>
<url><loc>https://scifaro.com/en/abs/gmsnp-and-finite-structures-2406.13529</loc><lastmod>2024-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gmsnp-and-finite-structures-2406.13529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gmsnp-and-finite-structures-2406.13529"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-the-assignment-game-beyond-additive-valuations-2406.13620</loc><lastmod>2025-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-the-assignment-game-beyond-additive-valuations-2406.13620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-the-assignment-game-beyond-additive-valuations-2406.13620"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-13th-edition-of-the-conference-on-random-generation-of-combinatorial-structures-polyominoes-and-tilings-2406.14588</loc><lastmod>2024-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-13th-edition-of-the-conference-on-random-generation-of-combinatorial-structures-polyominoes-and-tilings-2406.14588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-13th-edition-of-the-conference-on-random-generation-of-combinatorial-structures-polyominoes-and-tilings-2406.14588"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-characterization-of-dendricity-2406.15075</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-characterization-of-dendricity-2406.15075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-characterization-of-dendricity-2406.15075"/></url>
<url><loc>https://scifaro.com/en/abs/database-for-identifiability-properties-of-linear-compartmental-models-2406.16132</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/database-for-identifiability-properties-of-linear-compartmental-models-2406.16132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/database-for-identifiability-properties-of-linear-compartmental-models-2406.16132"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-confluence-of-directed-graph-reductions-preserving-feedback-vertex-set-minimality-2406.16390</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-confluence-of-directed-graph-reductions-preserving-feedback-vertex-set-minimality-2406.16390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-confluence-of-directed-graph-reductions-preserving-feedback-vertex-set-minimality-2406.16390"/></url>
<url><loc>https://scifaro.com/en/abs/interval-posets-and-polygon-dissections-2406.16392</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-posets-and-polygon-dissections-2406.16392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-posets-and-polygon-dissections-2406.16392"/></url>
<url><loc>https://scifaro.com/en/abs/type-b-analogue-of-bell-numbers-using-rota-s-umbral-calculus-approach-2406.16393</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-b-analogue-of-bell-numbers-using-rota-s-umbral-calculus-approach-2406.16393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-b-analogue-of-bell-numbers-using-rota-s-umbral-calculus-approach-2406.16393"/></url>
<url><loc>https://scifaro.com/en/abs/dyck-paths-enumerated-by-the-q-bonacci-numbers-2406.16394</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dyck-paths-enumerated-by-the-q-bonacci-numbers-2406.16394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dyck-paths-enumerated-by-the-q-bonacci-numbers-2406.16394"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-sampling-and-visualization-of-3d-reluctant-walks-2406.16397</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-sampling-and-visualization-of-3d-reluctant-walks-2406.16397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-sampling-and-visualization-of-3d-reluctant-walks-2406.16397"/></url>
<url><loc>https://scifaro.com/en/abs/pop-stacks-with-a-bypass-2406.16399</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pop-stacks-with-a-bypass-2406.16399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pop-stacks-with-a-bypass-2406.16399"/></url>
<url><loc>https://scifaro.com/en/abs/square-triangle-tilings-lift-flip-to-sample-2406.16402</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-triangle-tilings-lift-flip-to-sample-2406.16402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-triangle-tilings-lift-flip-to-sample-2406.16402"/></url>
<url><loc>https://scifaro.com/en/abs/restricted-permutations-enumerated-by-inversions-2406.16403</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/restricted-permutations-enumerated-by-inversions-2406.16403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/restricted-permutations-enumerated-by-inversions-2406.16403"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-gray-codes-for-some-restricted-classes-of-binary-words-2406.16405</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-gray-codes-for-some-restricted-classes-of-binary-words-2406.16405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-gray-codes-for-some-restricted-classes-of-binary-words-2406.16405"/></url>
<url><loc>https://scifaro.com/en/abs/morphic-sequences-complexity-and-decidability-2406.16406</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphic-sequences-complexity-and-decidability-2406.16406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphic-sequences-complexity-and-decidability-2406.16406"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-isohedral-polyforms-with-a-sat-solver-2406.16407</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-isohedral-polyforms-with-a-sat-solver-2406.16407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-isohedral-polyforms-with-a-sat-solver-2406.16407"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-orthogonality-of-generalized-pattern-sequences-2406.16411</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-orthogonality-of-generalized-pattern-sequences-2406.16411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-orthogonality-of-generalized-pattern-sequences-2406.16411"/></url>
<url><loc>https://scifaro.com/en/abs/counting-polyominoes-in-a-rectangle-b-x-h-2406.16413</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-polyominoes-in-a-rectangle-b-x-h-2406.16413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-polyominoes-in-a-rectangle-b-x-h-2406.16413"/></url>
<url><loc>https://scifaro.com/en/abs/counting-colored-tilings-on-grids-and-graphs-2406.16415</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-colored-tilings-on-grids-and-graphs-2406.16415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-colored-tilings-on-grids-and-graphs-2406.16415"/></url>
<url><loc>https://scifaro.com/en/abs/natural-measures-on-polyominoes-induced-by-the-abelian-sandpile-model-2406.16418</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-measures-on-polyominoes-induced-by-the-abelian-sandpile-model-2406.16418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-measures-on-polyominoes-induced-by-the-abelian-sandpile-model-2406.16418"/></url>
<url><loc>https://scifaro.com/en/abs/construction-of-minkowski-sums-by-cellular-automata-2406.16419</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/construction-of-minkowski-sums-by-cellular-automata-2406.16419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/construction-of-minkowski-sums-by-cellular-automata-2406.16419"/></url>
<url><loc>https://scifaro.com/en/abs/local-limit-theorems-for-q-multinomial-and-multiple-heine-distributions-2406.16420</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-limit-theorems-for-q-multinomial-and-multiple-heine-distributions-2406.16420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-limit-theorems-for-q-multinomial-and-multiple-heine-distributions-2406.16420"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-splendor-unraveling-universally-closest-refinements-and-fisher-market-equilibrium-through-density-friendly-decomposition-2406.17964</loc><lastmod>2024-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-splendor-unraveling-universally-closest-refinements-and-fisher-market-equilibrium-through-density-friendly-decomposition-2406.17964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-splendor-unraveling-universally-closest-refinements-and-fisher-market-equilibrium-through-density-friendly-decomposition-2406.17964"/></url>
<url><loc>https://scifaro.com/en/abs/staff-scheduling-for-demand-responsive-services-2406.19053</loc><lastmod>2026-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/staff-scheduling-for-demand-responsive-services-2406.19053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/staff-scheduling-for-demand-responsive-services-2406.19053"/></url>
<url><loc>https://scifaro.com/en/abs/cuts-in-graphs-with-matroid-constraints-2406.19134</loc><lastmod>2024-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cuts-in-graphs-with-matroid-constraints-2406.19134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cuts-in-graphs-with-matroid-constraints-2406.19134"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-group-search-on-the-disk-improved-lower-bounds-for-priority-evacuation-2406.19490</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-group-search-on-the-disk-improved-lower-bounds-for-priority-evacuation-2406.19490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-group-search-on-the-disk-improved-lower-bounds-for-priority-evacuation-2406.19490"/></url>
<url><loc>https://scifaro.com/en/abs/multi-agent-search-type-problems-on-polygons-2406.19495</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-agent-search-type-problems-on-polygons-2406.19495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-agent-search-type-problems-on-polygons-2406.19495"/></url>
<url><loc>https://scifaro.com/en/abs/differentiable-quadratic-optimization-for-the-maximum-independent-set-problem-2406.19532</loc><lastmod>2025-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentiable-quadratic-optimization-for-the-maximum-independent-set-problem-2406.19532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentiable-quadratic-optimization-for-the-maximum-independent-set-problem-2406.19532"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-immediate-neighbours-of-monotone-boolean-functions-2407.01337</loc><lastmod>2025-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-immediate-neighbours-of-monotone-boolean-functions-2407.01337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-immediate-neighbours-of-monotone-boolean-functions-2407.01337"/></url>
<url><loc>https://scifaro.com/en/abs/my-part-is-bigger-than-yours-assessment-within-a-group-of-peers-2407.01843</loc><lastmod>2026-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/my-part-is-bigger-than-yours-assessment-within-a-group-of-peers-2407.01843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/my-part-is-bigger-than-yours-assessment-within-a-group-of-peers-2407.01843"/></url>
<url><loc>https://scifaro.com/en/abs/dual-bounded-generation-polynomial-second-order-cone-and-positive-semidefinite-matrix-inequalities-2407.02201</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-bounded-generation-polynomial-second-order-cone-and-positive-semidefinite-matrix-inequalities-2407.02201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-bounded-generation-polynomial-second-order-cone-and-positive-semidefinite-matrix-inequalities-2407.02201"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-results-for-weak-roman-domination-problem-in-graphs-2407.03812</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-results-for-weak-roman-domination-problem-in-graphs-2407.03812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-results-for-weak-roman-domination-problem-in-graphs-2407.03812"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-mixing-for-randomly-sampling-edge-colorings-on-trees-down-to-the-max-degree-2407.04576</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-mixing-for-randomly-sampling-edge-colorings-on-trees-down-to-the-max-degree-2407.04576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-mixing-for-randomly-sampling-edge-colorings-on-trees-down-to-the-max-degree-2407.04576"/></url>
<url><loc>https://scifaro.com/en/abs/a-convenient-trick-to-compute-cluster-sizes-in-a-network-2407.04701</loc><lastmod>2024-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-convenient-trick-to-compute-cluster-sizes-in-a-network-2407.04701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-convenient-trick-to-compute-cluster-sizes-in-a-network-2407.04701"/></url>
<url><loc>https://scifaro.com/en/abs/flip-dynamics-for-sampling-colorings-improving-11-6-epsilon-using-a-simple-metric-2407.04870</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-dynamics-for-sampling-colorings-improving-11-6-epsilon-using-a-simple-metric-2407.04870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-dynamics-for-sampling-colorings-improving-11-6-epsilon-using-a-simple-metric-2407.04870"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-assignments-of-periodic-tasks-2407.05485</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-assignments-of-periodic-tasks-2407.05485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-assignments-of-periodic-tasks-2407.05485"/></url>
<url><loc>https://scifaro.com/en/abs/the-path-label-reconciliation-plr-dissimilarity-measure-for-gene-trees-2407.06367</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-path-label-reconciliation-plr-dissimilarity-measure-for-gene-trees-2407.06367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-path-label-reconciliation-plr-dissimilarity-measure-for-gene-trees-2407.06367"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-k-ary-orientable-sequences-with-asymptotically-optimal-length-2407.07029</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-k-ary-orientable-sequences-with-asymptotically-optimal-length-2407.07029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-k-ary-orientable-sequences-with-asymptotically-optimal-length-2407.07029"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-algorithm-for-checking-equivalence-of-counting-functions-on-free-monoids-2407.10569</loc><lastmod>2026-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-algorithm-for-checking-equivalence-of-counting-functions-on-free-monoids-2407.10569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-algorithm-for-checking-equivalence-of-counting-functions-on-free-monoids-2407.10569"/></url>
<url><loc>https://scifaro.com/en/abs/graph-traversals-associated-with-iterative-methods-for-solving-systems-of-linear-equations-2407.10790</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-traversals-associated-with-iterative-methods-for-solving-systems-of-linear-equations-2407.10790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-traversals-associated-with-iterative-methods-for-solving-systems-of-linear-equations-2407.10790"/></url>
<url><loc>https://scifaro.com/en/abs/the-storage-location-assignment-and-picker-routing-problem-a-generic-branch-cut-and-price-algorithm-2407.13570</loc><lastmod>2024-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-storage-location-assignment-and-picker-routing-problem-a-generic-branch-cut-and-price-algorithm-2407.13570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-storage-location-assignment-and-picker-routing-problem-a-generic-branch-cut-and-price-algorithm-2407.13570"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-normality-of-boolean-quartics-2407.14038</loc><lastmod>2024-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-normality-of-boolean-quartics-2407.14038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-normality-of-boolean-quartics-2407.14038"/></url>
<url><loc>https://scifaro.com/en/abs/de-bruijn-sequences-with-minimum-discrepancy-2407.17367</loc><lastmod>2024-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/de-bruijn-sequences-with-minimum-discrepancy-2407.17367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/de-bruijn-sequences-with-minimum-discrepancy-2407.17367"/></url>
<url><loc>https://scifaro.com/en/abs/models-of-random-spanning-trees-2407.20226</loc><lastmod>2026-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-of-random-spanning-trees-2407.20226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-of-random-spanning-trees-2407.20226"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-bridge-free-antiprismatic-graphs-2408.01328</loc><lastmod>2025-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-bridge-free-antiprismatic-graphs-2408.01328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-bridge-free-antiprismatic-graphs-2408.01328"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-nullstellensatz-techniques-2408.03443</loc><lastmod>2024-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-nullstellensatz-techniques-2408.03443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-nullstellensatz-techniques-2408.03443"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-treewidth-of-outer-k-planar-graphs-via-triangulations-2408.04264</loc><lastmod>2025-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-treewidth-of-outer-k-planar-graphs-via-triangulations-2408.04264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-treewidth-of-outer-k-planar-graphs-via-triangulations-2408.04264"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-randomized-algorithms-and-their-evaluation-2408.04445</loc><lastmod>2024-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-randomized-algorithms-and-their-evaluation-2408.04445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-randomized-algorithms-and-their-evaluation-2408.04445"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-computing-the-period-and-the-exponent-of-a-digraph-2408.05762</loc><lastmod>2025-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-computing-the-period-and-the-exponent-of-a-digraph-2408.05762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-computing-the-period-and-the-exponent-of-a-digraph-2408.05762"/></url>
<url><loc>https://scifaro.com/en/abs/the-signatures-of-ideal-flow-networks-2408.06344</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-signatures-of-ideal-flow-networks-2408.06344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-signatures-of-ideal-flow-networks-2408.06344"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-cop-number-of-string-graphs-2408.11002</loc><lastmod>2025-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-cop-number-of-string-graphs-2408.11002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-cop-number-of-string-graphs-2408.11002"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-approximation-algorithm-for-budgeted-sweep-coverage-with-mobile-sensors-2408.12468</loc><lastmod>2024-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-approximation-algorithm-for-budgeted-sweep-coverage-with-mobile-sensors-2408.12468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-approximation-algorithm-for-budgeted-sweep-coverage-with-mobile-sensors-2408.12468"/></url>
<url><loc>https://scifaro.com/en/abs/a-row-wise-algorithm-for-graph-realization-2408.12869</loc><lastmod>2025-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-row-wise-algorithm-for-graph-realization-2408.12869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-row-wise-algorithm-for-graph-realization-2408.12869"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-center-and-centroid-of-a-graph-with-multiple-sources-2408.13688</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-center-and-centroid-of-a-graph-with-multiple-sources-2408.13688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-center-and-centroid-of-a-graph-with-multiple-sources-2408.13688"/></url>
<url><loc>https://scifaro.com/en/abs/monotone-arc-diagrams-with-few-biarcs-2408.14299</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotone-arc-diagrams-with-few-biarcs-2408.14299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotone-arc-diagrams-with-few-biarcs-2408.14299"/></url>
<url><loc>https://scifaro.com/en/abs/new-results-on-periodic-golay-pairs-2408.15611</loc><lastmod>2025-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-results-on-periodic-golay-pairs-2408.15611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-results-on-periodic-golay-pairs-2408.15611"/></url>
<url><loc>https://scifaro.com/en/abs/non-promise-version-of-unique-sink-orientations-2408.17283</loc><lastmod>2024-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-promise-version-of-unique-sink-orientations-2408.17283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-promise-version-of-unique-sink-orientations-2408.17283"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-arc-geodetic-sets-of-oriented-graphs-2409.00350</loc><lastmod>2025-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-arc-geodetic-sets-of-oriented-graphs-2409.00350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-arc-geodetic-sets-of-oriented-graphs-2409.00350"/></url>
<url><loc>https://scifaro.com/en/abs/hypergraph-rewriting-and-causal-structure-of-lambda-calculus-2409.01006</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypergraph-rewriting-and-causal-structure-of-lambda-calculus-2409.01006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypergraph-rewriting-and-causal-structure-of-lambda-calculus-2409.01006"/></url>
<url><loc>https://scifaro.com/en/abs/static-nuel-games-with-terminal-payoff-2409.01681</loc><lastmod>2025-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-nuel-games-with-terminal-payoff-2409.01681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-nuel-games-with-terminal-payoff-2409.01681"/></url>
<url><loc>https://scifaro.com/en/abs/level-planarity-is-more-difficult-than-we-thought-2409.01727</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/level-planarity-is-more-difficult-than-we-thought-2409.01727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/level-planarity-is-more-difficult-than-we-thought-2409.01727"/></url>
<url><loc>https://scifaro.com/en/abs/directed-hypercube-routing-a-generalized-lehman-ron-theorem-and-monotonicity-testing-2409.02206</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-hypercube-routing-a-generalized-lehman-ron-theorem-and-monotonicity-testing-2409.02206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-hypercube-routing-a-generalized-lehman-ron-theorem-and-monotonicity-testing-2409.02206"/></url>
<url><loc>https://scifaro.com/en/abs/bootstrap-percolation-on-rhombus-tilings-2409.02520</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bootstrap-percolation-on-rhombus-tilings-2409.02520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bootstrap-percolation-on-rhombus-tilings-2409.02520"/></url>
<url><loc>https://scifaro.com/en/abs/gathering-information-about-a-graph-by-counting-walks-from-a-single-vertex-2409.03690</loc><lastmod>2024-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gathering-information-about-a-graph-by-counting-walks-from-a-single-vertex-2409.03690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gathering-information-about-a-graph-by-counting-walks-from-a-single-vertex-2409.03690"/></url>
<url><loc>https://scifaro.com/en/abs/n-way-joint-mutual-exclusion-does-not-imply-any-pairwise-mutual-exclusion-for-propositions-2409.03784</loc><lastmod>2024-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/n-way-joint-mutual-exclusion-does-not-imply-any-pairwise-mutual-exclusion-for-propositions-2409.03784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/n-way-joint-mutual-exclusion-does-not-imply-any-pairwise-mutual-exclusion-for-propositions-2409.03784"/></url>
<url><loc>https://scifaro.com/en/abs/galled-perfect-transfer-networks-2409.03935</loc><lastmod>2025-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/galled-perfect-transfer-networks-2409.03935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/galled-perfect-transfer-networks-2409.03935"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-and-randomized-heuristics-for-optimization-of-k-domination-models-in-digraphs-and-road-networks-2409.04226</loc><lastmod>2024-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-and-randomized-heuristics-for-optimization-of-k-domination-models-in-digraphs-and-road-networks-2409.04226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-and-randomized-heuristics-for-optimization-of-k-domination-models-in-digraphs-and-road-networks-2409.04226"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-deciding-the-equality-of-matching-numbers-2409.04855</loc><lastmod>2024-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-deciding-the-equality-of-matching-numbers-2409.04855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-deciding-the-equality-of-matching-numbers-2409.04855"/></url>
<url><loc>https://scifaro.com/en/abs/a-sequential-solution-to-the-density-classification-task-using-an-intermediate-alphabet-2409.06536</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequential-solution-to-the-density-classification-task-using-an-intermediate-alphabet-2409.06536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequential-solution-to-the-density-classification-task-using-an-intermediate-alphabet-2409.06536"/></url>
<url><loc>https://scifaro.com/en/abs/the-converse-of-the-real-orthogonal-holant-theorem-2409.06911</loc><lastmod>2025-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-converse-of-the-real-orthogonal-holant-theorem-2409.06911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-converse-of-the-real-orthogonal-holant-theorem-2409.06911"/></url>
<url><loc>https://scifaro.com/en/abs/rice-like-complexity-lower-bounds-for-boolean-and-uniform-automata-networks-2409.08762</loc><lastmod>2025-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rice-like-complexity-lower-bounds-for-boolean-and-uniform-automata-networks-2409.08762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rice-like-complexity-lower-bounds-for-boolean-and-uniform-automata-networks-2409.08762"/></url>
<url><loc>https://scifaro.com/en/abs/critical-thresholds-for-maximum-cardinality-matching-on-general-hypergraphs-2409.09155</loc><lastmod>2024-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-thresholds-for-maximum-cardinality-matching-on-general-hypergraphs-2409.09155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-thresholds-for-maximum-cardinality-matching-on-general-hypergraphs-2409.09155"/></url>
<url><loc>https://scifaro.com/en/abs/ants-on-the-highway-2409.10124</loc><lastmod>2025-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ants-on-the-highway-2409.10124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ants-on-the-highway-2409.10124"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-functions-with-small-approximate-spectral-norm-2409.10634</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-functions-with-small-approximate-spectral-norm-2409.10634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-functions-with-small-approximate-spectral-norm-2409.10634"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-free-chromatic-index-of-trees-2409.10899</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-free-chromatic-index-of-trees-2409.10899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-free-chromatic-index-of-trees-2409.10899"/></url>
<url><loc>https://scifaro.com/en/abs/decision-problems-on-geometric-tilings-2409.11739</loc><lastmod>2025-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-problems-on-geometric-tilings-2409.11739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-problems-on-geometric-tilings-2409.11739"/></url>
<url><loc>https://scifaro.com/en/abs/fault-tolerant-metric-dimensions-of-leafless-cacti-graphs-with-application-in-supply-chain-management-2409.12199</loc><lastmod>2026-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fault-tolerant-metric-dimensions-of-leafless-cacti-graphs-with-application-in-supply-chain-management-2409.12199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fault-tolerant-metric-dimensions-of-leafless-cacti-graphs-with-application-in-supply-chain-management-2409.12199"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-incremental-voting-on-expanders-2409.12615</loc><lastmod>2024-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-incremental-voting-on-expanders-2409.12615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-incremental-voting-on-expanders-2409.12615"/></url>
<url><loc>https://scifaro.com/en/abs/expectation-and-variance-of-the-degree-of-a-node-in-random-spanning-trees-2409.13472</loc><lastmod>2024-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expectation-and-variance-of-the-degree-of-a-node-in-random-spanning-trees-2409.13472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expectation-and-variance-of-the-degree-of-a-node-in-random-spanning-trees-2409.13472"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-local-and-tabu-search-strategies-for-large-scale-quadratic-integer-programming-2409.14176</loc><lastmod>2025-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-local-and-tabu-search-strategies-for-large-scale-quadratic-integer-programming-2409.14176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-local-and-tabu-search-strategies-for-large-scale-quadratic-integer-programming-2409.14176"/></url>
<url><loc>https://scifaro.com/en/abs/task-scheduling-for-autonomous-vehicles-in-the-martian-environment-2409.14889</loc><lastmod>2024-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/task-scheduling-for-autonomous-vehicles-in-the-martian-environment-2409.14889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/task-scheduling-for-autonomous-vehicles-in-the-martian-environment-2409.14889"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-periodic-decompositions-of-multidimensional-configurations-2409.14948</loc><lastmod>2026-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-periodic-decompositions-of-multidimensional-configurations-2409.14948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-periodic-decompositions-of-multidimensional-configurations-2409.14948"/></url>
<url><loc>https://scifaro.com/en/abs/listing-spanning-trees-of-outerplanar-graphs-by-pivot-exchanges-2409.15793</loc><lastmod>2024-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/listing-spanning-trees-of-outerplanar-graphs-by-pivot-exchanges-2409.15793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/listing-spanning-trees-of-outerplanar-graphs-by-pivot-exchanges-2409.15793"/></url>
<url><loc>https://scifaro.com/en/abs/aperiodic-monotiles-from-geometry-to-groups-2409.15880</loc><lastmod>2025-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aperiodic-monotiles-from-geometry-to-groups-2409.15880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aperiodic-monotiles-from-geometry-to-groups-2409.15880"/></url>
<url><loc>https://scifaro.com/en/abs/on-1-planar-graphs-with-bounded-cop-number-2409.16279</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-1-planar-graphs-with-bounded-cop-number-2409.16279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-1-planar-graphs-with-bounded-cop-number-2409.16279"/></url>
<url><loc>https://scifaro.com/en/abs/hpc-acceleration-of-large-min-matrix-products-to-compute-domination-type-parameters-in-graphs-2409.17688</loc><lastmod>2024-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hpc-acceleration-of-large-min-matrix-products-to-compute-domination-type-parameters-in-graphs-2409.17688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hpc-acceleration-of-large-min-matrix-products-to-compute-domination-type-parameters-in-graphs-2409.17688"/></url>
<url><loc>https://scifaro.com/en/abs/rotation-distance-using-flows-2409.17905</loc><lastmod>2024-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rotation-distance-using-flows-2409.17905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rotation-distance-using-flows-2409.17905"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-approximation-of-centrality-measures-in-uncertain-graphs-2409.18062</loc><lastmod>2024-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-approximation-of-centrality-measures-in-uncertain-graphs-2409.18062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-approximation-of-centrality-measures-in-uncertain-graphs-2409.18062"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-labelling-of-sparse-random-graphs-2409.18109</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-labelling-of-sparse-random-graphs-2409.18109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-labelling-of-sparse-random-graphs-2409.18109"/></url>
<url><loc>https://scifaro.com/en/abs/pointwise-order-of-generalized-hofstadter-functions-g-h-and-beyond-2410.00529</loc><lastmod>2026-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pointwise-order-of-generalized-hofstadter-functions-g-h-and-beyond-2410.00529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pointwise-order-of-generalized-hofstadter-functions-g-h-and-beyond-2410.00529"/></url>
<url><loc>https://scifaro.com/en/abs/the-z-curve-as-an-n-dimensional-hypersphere-properties-and-analysis-2410.04611</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-z-curve-as-an-n-dimensional-hypersphere-properties-and-analysis-2410.04611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-z-curve-as-an-n-dimensional-hypersphere-properties-and-analysis-2410.04611"/></url>
<url><loc>https://scifaro.com/en/abs/token-sliding-independent-set-reconfiguration-on-block-graphs-2410.07060</loc><lastmod>2024-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/token-sliding-independent-set-reconfiguration-on-block-graphs-2410.07060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/token-sliding-independent-set-reconfiguration-on-block-graphs-2410.07060"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-branch-and-cut-algorithm-for-bi-objective-binary-linear-programs-2410.08722</loc><lastmod>2024-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-branch-and-cut-algorithm-for-bi-objective-binary-linear-programs-2410.08722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-branch-and-cut-algorithm-for-bi-objective-binary-linear-programs-2410.08722"/></url>
<url><loc>https://scifaro.com/en/abs/block-coupling-and-rapidly-mixing-k-heights-2410.08992</loc><lastmod>2024-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/block-coupling-and-rapidly-mixing-k-heights-2410.08992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/block-coupling-and-rapidly-mixing-k-heights-2410.08992"/></url>
<url><loc>https://scifaro.com/en/abs/study-on-r-s-generalised-transformation-graphs-a-novel-perspective-based-on-transformation-graphs-2410.09122</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/study-on-r-s-generalised-transformation-graphs-a-novel-perspective-based-on-transformation-graphs-2410.09122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/study-on-r-s-generalised-transformation-graphs-a-novel-perspective-based-on-transformation-graphs-2410.09122"/></url>
<url><loc>https://scifaro.com/en/abs/two-person-positive-shortest-path-games-have-nash-equilibria-in-pure-stationary-strategies-2410.09257</loc><lastmod>2025-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-person-positive-shortest-path-games-have-nash-equilibria-in-pure-stationary-strategies-2410.09257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-person-positive-shortest-path-games-have-nash-equilibria-in-pure-stationary-strategies-2410.09257"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-varepsilon-scatter-dimension-via-metric-sparsity-2410.10191</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-varepsilon-scatter-dimension-via-metric-sparsity-2410.10191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-varepsilon-scatter-dimension-via-metric-sparsity-2410.10191"/></url>
<url><loc>https://scifaro.com/en/abs/the-formula-for-the-completion-time-of-project-networks-2410.10252</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-formula-for-the-completion-time-of-project-networks-2410.10252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-formula-for-the-completion-time-of-project-networks-2410.10252"/></url>
<url><loc>https://scifaro.com/en/abs/a-method-to-generate-multi-interval-pairwise-compatibility-graphs-2410.10525</loc><lastmod>2024-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-method-to-generate-multi-interval-pairwise-compatibility-graphs-2410.10525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-method-to-generate-multi-interval-pairwise-compatibility-graphs-2410.10525"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-sparsity-of-binary-numbers-2410.10620</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-sparsity-of-binary-numbers-2410.10620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-sparsity-of-binary-numbers-2410.10620"/></url>
<url><loc>https://scifaro.com/en/abs/an-incremental-exact-algorithm-for-the-hyper-rectangular-clustering-problem-with-axis-parallel-clusters-2410.11803</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-incremental-exact-algorithm-for-the-hyper-rectangular-clustering-problem-with-axis-parallel-clusters-2410.11803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-incremental-exact-algorithm-for-the-hyper-rectangular-clustering-problem-with-axis-parallel-clusters-2410.11803"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-computation-of-the-set-of-period-sets-2410.12077</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-computation-of-the-set-of-period-sets-2410.12077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-computation-of-the-set-of-period-sets-2410.12077"/></url>
<url><loc>https://scifaro.com/en/abs/stability-properties-for-subgroups-generated-by-return-words-2410.12534</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-properties-for-subgroups-generated-by-return-words-2410.12534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-properties-for-subgroups-generated-by-return-words-2410.12534"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguring-homomorphisms-to-reflexive-graphs-via-a-simple-reduction-2410.12687</loc><lastmod>2024-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguring-homomorphisms-to-reflexive-graphs-via-a-simple-reduction-2410.12687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguring-homomorphisms-to-reflexive-graphs-via-a-simple-reduction-2410.12687"/></url>
<url><loc>https://scifaro.com/en/abs/morse-sequences-a-simple-approach-to-discrete-morse-theory-2410.14227</loc><lastmod>2025-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morse-sequences-a-simple-approach-to-discrete-morse-theory-2410.14227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morse-sequences-a-simple-approach-to-discrete-morse-theory-2410.14227"/></url>
<url><loc>https://scifaro.com/en/abs/effects-of-graph-operations-on-star-pairwise-compatibility-graphs-2410.16023</loc><lastmod>2024-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effects-of-graph-operations-on-star-pairwise-compatibility-graphs-2410.16023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effects-of-graph-operations-on-star-pairwise-compatibility-graphs-2410.16023"/></url>
<url><loc>https://scifaro.com/en/abs/electre-tri-nb-pseudo-disjunctive-axiomatic-and-combinatorial-results-2410.18443</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/electre-tri-nb-pseudo-disjunctive-axiomatic-and-combinatorial-results-2410.18443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/electre-tri-nb-pseudo-disjunctive-axiomatic-and-combinatorial-results-2410.18443"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-saga-of-first-fit-and-last-fit-coloring-2410.20629</loc><lastmod>2024-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-saga-of-first-fit-and-last-fit-coloring-2410.20629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-saga-of-first-fit-and-last-fit-coloring-2410.20629"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-methods-of-finite-discrete-structures-graph-clique-problem-2410.22039</loc><lastmod>2024-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-methods-of-finite-discrete-structures-graph-clique-problem-2410.22039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-methods-of-finite-discrete-structures-graph-clique-problem-2410.22039"/></url>
<url><loc>https://scifaro.com/en/abs/cops-robber-on-periodic-temporal-graphs-2410.22618</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cops-robber-on-periodic-temporal-graphs-2410.22618"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cops-robber-on-periodic-temporal-graphs-2410.22618"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-methods-for-splitting-representations-of-rook-monoids-a-gentle-introduction-to-groupoids-2410.23731</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-methods-for-splitting-representations-of-rook-monoids-a-gentle-introduction-to-groupoids-2410.23731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-methods-for-splitting-representations-of-rook-monoids-a-gentle-introduction-to-groupoids-2410.23731"/></url>
<url><loc>https://scifaro.com/en/abs/clustering-coefficient-reflecting-pairwise-relationships-within-hyperedges-2410.23799</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustering-coefficient-reflecting-pairwise-relationships-within-hyperedges-2410.23799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustering-coefficient-reflecting-pairwise-relationships-within-hyperedges-2410.23799"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-diffusion-on-finite-multi-topology-systems-using-ultrametrics-2411.00806</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-diffusion-on-finite-multi-topology-systems-using-ultrametrics-2411.00806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-diffusion-on-finite-multi-topology-systems-using-ultrametrics-2411.00806"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-word-representable-graphs-2411.03274</loc><lastmod>2024-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-word-representable-graphs-2411.03274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-word-representable-graphs-2411.03274"/></url>
<url><loc>https://scifaro.com/en/abs/chorded-cycle-facets-of-the-clique-partitioning-polytope-2411.03407</loc><lastmod>2025-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chorded-cycle-facets-of-the-clique-partitioning-polytope-2411.03407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chorded-cycle-facets-of-the-clique-partitioning-polytope-2411.03407"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-multiple-strings-of-constant-weight-from-prefix-suffix-compositions-2411.03776</loc><lastmod>2024-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-multiple-strings-of-constant-weight-from-prefix-suffix-compositions-2411.03776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-multiple-strings-of-constant-weight-from-prefix-suffix-compositions-2411.03776"/></url>
<url><loc>https://scifaro.com/en/abs/noisy-linear-group-testing-exact-thresholds-and-efficient-algorithms-2411.03839</loc><lastmod>2024-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noisy-linear-group-testing-exact-thresholds-and-efficient-algorithms-2411.03839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noisy-linear-group-testing-exact-thresholds-and-efficient-algorithms-2411.03839"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-genus-algorithm-based-on-graph-rotations-2411.07347</loc><lastmod>2025-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-genus-algorithm-based-on-graph-rotations-2411.07347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-genus-algorithm-based-on-graph-rotations-2411.07347"/></url>
<url><loc>https://scifaro.com/en/abs/on-sampling-two-spin-models-using-the-local-connective-constant-2411.08179</loc><lastmod>2025-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sampling-two-spin-models-using-the-local-connective-constant-2411.08179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sampling-two-spin-models-using-the-local-connective-constant-2411.08179"/></url>
<url><loc>https://scifaro.com/en/abs/nearly-tight-bounds-on-testing-of-metric-properties-2411.08989</loc><lastmod>2024-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nearly-tight-bounds-on-testing-of-metric-properties-2411.08989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nearly-tight-bounds-on-testing-of-metric-properties-2411.08989"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-positive-spanning-sets-with-ties-to-strongly-connected-digraphs-2411.08994</loc><lastmod>2025-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-positive-spanning-sets-with-ties-to-strongly-connected-digraphs-2411.08994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-positive-spanning-sets-with-ties-to-strongly-connected-digraphs-2411.08994"/></url>
<url><loc>https://scifaro.com/en/abs/some-thoughts-on-graph-similarity-2411.10182</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-thoughts-on-graph-similarity-2411.10182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-thoughts-on-graph-similarity-2411.10182"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-compressiveness-of-the-burrows-wheeler-transform-2411.11298</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-compressiveness-of-the-burrows-wheeler-transform-2411.11298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-compressiveness-of-the-burrows-wheeler-transform-2411.11298"/></url>
<url><loc>https://scifaro.com/en/abs/pricing-filtering-in-dantzig-wolfe-decomposition-2411.11338</loc><lastmod>2025-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pricing-filtering-in-dantzig-wolfe-decomposition-2411.11338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pricing-filtering-in-dantzig-wolfe-decomposition-2411.11338"/></url>
<url><loc>https://scifaro.com/en/abs/a-stopping-game-on-zero-sum-sequences-2411.13206</loc><lastmod>2024-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-stopping-game-on-zero-sum-sequences-2411.13206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-stopping-game-on-zero-sum-sequences-2411.13206"/></url>
<url><loc>https://scifaro.com/en/abs/a-hierarchical-scale-free-graph-generator-under-limited-resources-2411.13888</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hierarchical-scale-free-graph-generator-under-limited-resources-2411.13888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hierarchical-scale-free-graph-generator-under-limited-resources-2411.13888"/></url>
<url><loc>https://scifaro.com/en/abs/disk-and-partial-disk-inspection-worst-to-average-case-and-pareto-upper-bounds-2411.15391</loc><lastmod>2025-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disk-and-partial-disk-inspection-worst-to-average-case-and-pareto-upper-bounds-2411.15391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disk-and-partial-disk-inspection-worst-to-average-case-and-pareto-upper-bounds-2411.15391"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-breaks-by-minimizing-odd-cycle-transversals-2411.15463</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-breaks-by-minimizing-odd-cycle-transversals-2411.15463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-breaks-by-minimizing-odd-cycle-transversals-2411.15463"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmics-and-complexity-of-cost-driven-task-offloading-with-submodular-optimization-in-edge-cloud-environments-2411.15687</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmics-and-complexity-of-cost-driven-task-offloading-with-submodular-optimization-in-edge-cloud-environments-2411.15687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmics-and-complexity-of-cost-driven-task-offloading-with-submodular-optimization-in-edge-cloud-environments-2411.15687"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-approach-for-bent-functions-with-dillon-like-exponents-and-characterizing-three-classes-of-bent-functions-via-kloosterman-sums-2411.15750</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-approach-for-bent-functions-with-dillon-like-exponents-and-characterizing-three-classes-of-bent-functions-via-kloosterman-sums-2411.15750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-approach-for-bent-functions-with-dillon-like-exponents-and-characterizing-three-classes-of-bent-functions-via-kloosterman-sums-2411.15750"/></url>
<url><loc>https://scifaro.com/en/abs/finding-hypergraph-immersion-is-fixed-parameter-tractable-2411.16017</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-hypergraph-immersion-is-fixed-parameter-tractable-2411.16017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-hypergraph-immersion-is-fixed-parameter-tractable-2411.16017"/></url>
<url><loc>https://scifaro.com/en/abs/linear-extensions-of-rotor-routing-in-directed-graphs-reachability-problems-2411.18364</loc><lastmod>2025-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-extensions-of-rotor-routing-in-directed-graphs-reachability-problems-2411.18364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-extensions-of-rotor-routing-in-directed-graphs-reachability-problems-2411.18364"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-energy-collection-with-rotational-movements-constraints-in-concentrated-solar-power-plants-2411.19198</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-energy-collection-with-rotational-movements-constraints-in-concentrated-solar-power-plants-2411.19198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-energy-collection-with-rotational-movements-constraints-in-concentrated-solar-power-plants-2411.19198"/></url>
<url><loc>https://scifaro.com/en/abs/on-connectedness-of-solutions-to-integer-linear-systems-2411.19516</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-connectedness-of-solutions-to-integer-linear-systems-2411.19516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-connectedness-of-solutions-to-integer-linear-systems-2411.19516"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computational-complexity-of-multi-objective-ordinal-unconstrained-combinatorial-optimization-2412.01465</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computational-complexity-of-multi-objective-ordinal-unconstrained-combinatorial-optimization-2412.01465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computational-complexity-of-multi-objective-ordinal-unconstrained-combinatorial-optimization-2412.01465"/></url>
<url><loc>https://scifaro.com/en/abs/broadcast-graph-is-np-complete-2412.03024</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/broadcast-graph-is-np-complete-2412.03024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/broadcast-graph-is-np-complete-2412.03024"/></url>
<url><loc>https://scifaro.com/en/abs/summa-summarum-moessner-s-theorem-without-dynamic-programming-2412.03127</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/summa-summarum-moessner-s-theorem-without-dynamic-programming-2412.03127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/summa-summarum-moessner-s-theorem-without-dynamic-programming-2412.03127"/></url>
<url><loc>https://scifaro.com/en/abs/recovery-of-cyclic-words-by-their-subwords-2412.03289</loc><lastmod>2025-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recovery-of-cyclic-words-by-their-subwords-2412.03289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recovery-of-cyclic-words-by-their-subwords-2412.03289"/></url>
<url><loc>https://scifaro.com/en/abs/scarf-s-algorithm-on-arborescence-hypergraphs-2412.03397</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scarf-s-algorithm-on-arborescence-hypergraphs-2412.03397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scarf-s-algorithm-on-arborescence-hypergraphs-2412.03397"/></url>
<url><loc>https://scifaro.com/en/abs/extending-robinson-spaces-complexity-and-algorithmic-solutions-for-non-symmetric-dissimilarity-spaces-2412.04118</loc><lastmod>2024-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-robinson-spaces-complexity-and-algorithmic-solutions-for-non-symmetric-dissimilarity-spaces-2412.04118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-robinson-spaces-complexity-and-algorithmic-solutions-for-non-symmetric-dissimilarity-spaces-2412.04118"/></url>
<url><loc>https://scifaro.com/en/abs/mathematical-formulations-and-results-regarding-two-echelon-electric-vehicle-routing-problems-2412.06671</loc><lastmod>2024-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathematical-formulations-and-results-regarding-two-echelon-electric-vehicle-routing-problems-2412.06671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathematical-formulations-and-results-regarding-two-echelon-electric-vehicle-routing-problems-2412.06671"/></url>
<url><loc>https://scifaro.com/en/abs/contribution-to-blocker-and-interdiction-optimization-problems-in-networks-2412.08256</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contribution-to-blocker-and-interdiction-optimization-problems-in-networks-2412.08256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contribution-to-blocker-and-interdiction-optimization-problems-in-networks-2412.08256"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-search-of-a-minimum-tree-on-points-in-a-space-with-the-l-1-norm-2412.08584</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-search-of-a-minimum-tree-on-points-in-a-space-with-the-l-1-norm-2412.08584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-search-of-a-minimum-tree-on-points-in-a-space-with-the-l-1-norm-2412.08584"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-search-for-minwise-independent-families-2412.11811</loc><lastmod>2024-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-search-for-minwise-independent-families-2412.11811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-search-for-minwise-independent-families-2412.11811"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-linear-program-for-periodic-scheduling-in-universities-2412.11941</loc><lastmod>2024-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-linear-program-for-periodic-scheduling-in-universities-2412.11941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-linear-program-for-periodic-scheduling-in-universities-2412.11941"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-patterns-in-mixed-linear-layouts-2412.12786</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-patterns-in-mixed-linear-layouts-2412.12786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-patterns-in-mixed-linear-layouts-2412.12786"/></url>
<url><loc>https://scifaro.com/en/abs/long-induced-paths-and-forbidden-patterns-polylogarithmic-bounds-2412.14863</loc><lastmod>2026-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/long-induced-paths-and-forbidden-patterns-polylogarithmic-bounds-2412.14863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/long-induced-paths-and-forbidden-patterns-polylogarithmic-bounds-2412.14863"/></url>
<url><loc>https://scifaro.com/en/abs/inflation-of-2d-boundary-ghosts-and-digital-watermarking-2412.16789</loc><lastmod>2024-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inflation-of-2d-boundary-ghosts-and-digital-watermarking-2412.16789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inflation-of-2d-boundary-ghosts-and-digital-watermarking-2412.16789"/></url>
<url><loc>https://scifaro.com/en/abs/the-envdesign-model-a-method-to-solve-the-environment-design-problem-2412.18109</loc><lastmod>2025-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-envdesign-model-a-method-to-solve-the-environment-design-problem-2412.18109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-envdesign-model-a-method-to-solve-the-environment-design-problem-2412.18109"/></url>
<url><loc>https://scifaro.com/en/abs/twin-width-one-2501.00991</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twin-width-one-2501.00991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twin-width-one-2501.00991"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-dynamics-of-boolean-networks-2501.03175</loc><lastmod>2026-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-dynamics-of-boolean-networks-2501.03175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-dynamics-of-boolean-networks-2501.03175"/></url>
<url><loc>https://scifaro.com/en/abs/multivariate-exploration-of-metric-dilation-2501.04555</loc><lastmod>2025-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multivariate-exploration-of-metric-dilation-2501.04555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multivariate-exploration-of-metric-dilation-2501.04555"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-trading-of-a-charging-station-company-in-auction-markets-for-electricity-2501.04647</loc><lastmod>2025-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-trading-of-a-charging-station-company-in-auction-markets-for-electricity-2501.04647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-trading-of-a-charging-station-company-in-auction-markets-for-electricity-2501.04647"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-generalized-coloring-numbers-2501.08698</loc><lastmod>2025-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-generalized-coloring-numbers-2501.08698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-generalized-coloring-numbers-2501.08698"/></url>
<url><loc>https://scifaro.com/en/abs/profile-and-neighbourhood-complexity-of-graphs-excluding-a-minor-and-tree-structured-graphs-2501.08895</loc><lastmod>2025-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/profile-and-neighbourhood-complexity-of-graphs-excluding-a-minor-and-tree-structured-graphs-2501.08895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/profile-and-neighbourhood-complexity-of-graphs-excluding-a-minor-and-tree-structured-graphs-2501.08895"/></url>
<url><loc>https://scifaro.com/en/abs/a-stochastic-programming-approach-for-the-scheduling-of-medical-interpreting-service-under-uncertainty-2501.08929</loc><lastmod>2025-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-stochastic-programming-approach-for-the-scheduling-of-medical-interpreting-service-under-uncertainty-2501.08929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-stochastic-programming-approach-for-the-scheduling-of-medical-interpreting-service-under-uncertainty-2501.08929"/></url>
<url><loc>https://scifaro.com/en/abs/block-designs-and-k-geodetic-graphs-a-survey-2501.09256</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/block-designs-and-k-geodetic-graphs-a-survey-2501.09256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/block-designs-and-k-geodetic-graphs-a-survey-2501.09256"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-variant-of-the-minimum-path-cover-problem-in-acyclic-digraphs-computational-complexity-results-and-exact-method-2501.09560</loc><lastmod>2025-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-variant-of-the-minimum-path-cover-problem-in-acyclic-digraphs-computational-complexity-results-and-exact-method-2501.09560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-variant-of-the-minimum-path-cover-problem-in-acyclic-digraphs-computational-complexity-results-and-exact-method-2501.09560"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-virtual-network-embedding-with-uniform-demands-2501.10154</loc><lastmod>2025-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-virtual-network-embedding-with-uniform-demands-2501.10154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-virtual-network-embedding-with-uniform-demands-2501.10154"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-the-correctness-and-computational-complexity-of-path-planning-in-payment-channel-networks-2501.11419</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-the-correctness-and-computational-complexity-of-path-planning-in-payment-channel-networks-2501.11419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-the-correctness-and-computational-complexity-of-path-planning-in-payment-channel-networks-2501.11419"/></url>
<url><loc>https://scifaro.com/en/abs/simple-strict-proper-and-directed-comparing-reachability-in-directed-and-undirected-temporal-graphs-2501.11697</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-strict-proper-and-directed-comparing-reachability-in-directed-and-undirected-temporal-graphs-2501.11697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-strict-proper-and-directed-comparing-reachability-in-directed-and-undirected-temporal-graphs-2501.11697"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-approximate-conflict-free-linearly-ordered-and-nonmonochromatic-hypergraph-colourings-2501.12062</loc><lastmod>2026-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-approximate-conflict-free-linearly-ordered-and-nonmonochromatic-hypergraph-colourings-2501.12062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-approximate-conflict-free-linearly-ordered-and-nonmonochromatic-hypergraph-colourings-2501.12062"/></url>
<url><loc>https://scifaro.com/en/abs/degree-based-logical-adjacency-checking-dblac-a-novel-heuristic-for-vertex-coloring-2501.12479</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-based-logical-adjacency-checking-dblac-a-novel-heuristic-for-vertex-coloring-2501.12479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-based-logical-adjacency-checking-dblac-a-novel-heuristic-for-vertex-coloring-2501.12479"/></url>
<url><loc>https://scifaro.com/en/abs/an-o-log-n-approximation-algorithm-for-p-q-flexible-graph-connectivity-via-independent-rounding-2501.12549</loc><lastmod>2026-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-o-log-n-approximation-algorithm-for-p-q-flexible-graph-connectivity-via-independent-rounding-2501.12549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-o-log-n-approximation-algorithm-for-p-q-flexible-graph-connectivity-via-independent-rounding-2501.12549"/></url>
<url><loc>https://scifaro.com/en/abs/atomic-column-generation-for-consensus-between-algorithms-application-to-path-computation-2501.13463</loc><lastmod>2025-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/atomic-column-generation-for-consensus-between-algorithms-application-to-path-computation-2501.13463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/atomic-column-generation-for-consensus-between-algorithms-application-to-path-computation-2501.13463"/></url>
<url><loc>https://scifaro.com/en/abs/dismountability-in-temporal-cliques-revisited-2502.01321</loc><lastmod>2025-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dismountability-in-temporal-cliques-revisited-2502.01321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dismountability-in-temporal-cliques-revisited-2502.01321"/></url>
<url><loc>https://scifaro.com/en/abs/injectivity-of-polynomials-over-finite-discrete-dynamical-systems-2502.02360</loc><lastmod>2026-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/injectivity-of-polynomials-over-finite-discrete-dynamical-systems-2502.02360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/injectivity-of-polynomials-over-finite-discrete-dynamical-systems-2502.02360"/></url>
<url><loc>https://scifaro.com/en/abs/the-labeled-coupon-collector-problem-with-random-sample-sizes-and-partial-recovery-2502.02968</loc><lastmod>2025-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-labeled-coupon-collector-problem-with-random-sample-sizes-and-partial-recovery-2502.02968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-labeled-coupon-collector-problem-with-random-sample-sizes-and-partial-recovery-2502.02968"/></url>
<url><loc>https://scifaro.com/en/abs/counting-tree-like-multigraphs-with-a-given-number-of-vertices-and-multiple-edges-2502.05529</loc><lastmod>2025-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-tree-like-multigraphs-with-a-given-number-of-vertices-and-multiple-edges-2502.05529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-tree-like-multigraphs-with-a-given-number-of-vertices-and-multiple-edges-2502.05529"/></url>
<url><loc>https://scifaro.com/en/abs/word-representability-and-comparability-minimal-forbidden-induced-subgraphs-and-cover-number-bounds-2502.06979</loc><lastmod>2026-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/word-representability-and-comparability-minimal-forbidden-induced-subgraphs-and-cover-number-bounds-2502.06979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/word-representability-and-comparability-minimal-forbidden-induced-subgraphs-and-cover-number-bounds-2502.06979"/></url>
<url><loc>https://scifaro.com/en/abs/multimodal-search-on-a-line-2502.07000</loc><lastmod>2025-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multimodal-search-on-a-line-2502.07000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multimodal-search-on-a-line-2502.07000"/></url>
<url><loc>https://scifaro.com/en/abs/low-temperature-sampling-on-sparse-random-graphs-2502.08328</loc><lastmod>2025-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-temperature-sampling-on-sparse-random-graphs-2502.08328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-temperature-sampling-on-sparse-random-graphs-2502.08328"/></url>
<url><loc>https://scifaro.com/en/abs/rtd-conjecture-and-concept-classes-induced-by-graphs-2502.09453</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rtd-conjecture-and-concept-classes-induced-by-graphs-2502.09453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rtd-conjecture-and-concept-classes-induced-by-graphs-2502.09453"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-tree-based-variant-of-bandwidth-and-forbidding-simple-topological-minors-2502.11674</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-tree-based-variant-of-bandwidth-and-forbidding-simple-topological-minors-2502.11674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-tree-based-variant-of-bandwidth-and-forbidding-simple-topological-minors-2502.11674"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-hofstadter-functions-g-h-and-beyond-numeration-systems-and-discrepancy-2502.12615</loc><lastmod>2025-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-hofstadter-functions-g-h-and-beyond-numeration-systems-and-discrepancy-2502.12615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-hofstadter-functions-g-h-and-beyond-numeration-systems-and-discrepancy-2502.12615"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-covering-of-rectangular-grid-graphs-with-tours-of-constrained-length-2502.13306</loc><lastmod>2025-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-covering-of-rectangular-grid-graphs-with-tours-of-constrained-length-2502.13306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-covering-of-rectangular-grid-graphs-with-tours-of-constrained-length-2502.13306"/></url>
<url><loc>https://scifaro.com/en/abs/slant-gokigen-naname-is-np-complete-and-some-variations-are-in-p-2502.13536</loc><lastmod>2025-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slant-gokigen-naname-is-np-complete-and-some-variations-are-in-p-2502.13536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slant-gokigen-naname-is-np-complete-and-some-variations-are-in-p-2502.13536"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-connectivity-augmentation-2502.14540</loc><lastmod>2025-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-connectivity-augmentation-2502.14540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-connectivity-augmentation-2502.14540"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-weighted-3-coloring-2502.15216</loc><lastmod>2025-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-weighted-3-coloring-2502.15216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-weighted-3-coloring-2502.15216"/></url>
<url><loc>https://scifaro.com/en/abs/fast-and-furious-a-study-on-monotonicity-and-speed-in-cops-and-robber-games-2502.15396</loc><lastmod>2025-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-and-furious-a-study-on-monotonicity-and-speed-in-cops-and-robber-games-2502.15396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-and-furious-a-study-on-monotonicity-and-speed-in-cops-and-robber-games-2502.15396"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-generating-transmission-irregular-trees-2502.15453</loc><lastmod>2026-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-generating-transmission-irregular-trees-2502.15453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-generating-transmission-irregular-trees-2502.15453"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-subgraph-complementation-to-bounded-degree-graphs-2502.15675</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-subgraph-complementation-to-bounded-degree-graphs-2502.15675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-subgraph-complementation-to-bounded-degree-graphs-2502.15675"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-placement-of-mobile-distance-limited-devices-for-line-routing-2502.16844</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-placement-of-mobile-distance-limited-devices-for-line-routing-2502.16844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-placement-of-mobile-distance-limited-devices-for-line-routing-2502.16844"/></url>
<url><loc>https://scifaro.com/en/abs/an-unconditional-lower-bound-for-the-active-set-method-on-the-hypercube-2502.18019</loc><lastmod>2025-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-unconditional-lower-bound-for-the-active-set-method-on-the-hypercube-2502.18019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-unconditional-lower-bound-for-the-active-set-method-on-the-hypercube-2502.18019"/></url>
<url><loc>https://scifaro.com/en/abs/on-piecewise-affine-reachability-with-bellman-operators-2502.19923</loc><lastmod>2026-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-piecewise-affine-reachability-with-bellman-operators-2502.19923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-piecewise-affine-reachability-with-bellman-operators-2502.19923"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-covering-colored-mixed-multigraphs-with-simple-degree-partitions-2502.20151</loc><lastmod>2025-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-covering-colored-mixed-multigraphs-with-simple-degree-partitions-2502.20151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-covering-colored-mixed-multigraphs-with-simple-degree-partitions-2502.20151"/></url>
<url><loc>https://scifaro.com/en/abs/solving-maker-breaker-games-on-5-uniform-hypergraphs-is-pspace-complete-2502.20271</loc><lastmod>2025-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-maker-breaker-games-on-5-uniform-hypergraphs-is-pspace-complete-2502.20271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-maker-breaker-games-on-5-uniform-hypergraphs-is-pspace-complete-2502.20271"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-size-enumeration-kernelizations-for-long-path-enumeration-2502.21164</loc><lastmod>2025-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-size-enumeration-kernelizations-for-long-path-enumeration-2502.21164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-size-enumeration-kernelizations-for-long-path-enumeration-2502.21164"/></url>
<url><loc>https://scifaro.com/en/abs/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots-2502.21175</loc><lastmod>2025-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots-2502.21175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots-2502.21175"/></url>
<url><loc>https://scifaro.com/en/abs/interval-h-graphs-recognition-and-forbidden-obstructions-2503.00672</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-h-graphs-recognition-and-forbidden-obstructions-2503.00672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-h-graphs-recognition-and-forbidden-obstructions-2503.00672"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchy-of-hub-covering-problems-2503.02566</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchy-of-hub-covering-problems-2503.02566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchy-of-hub-covering-problems-2503.02566"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-width-perspective-on-partially-ordered-hamiltonian-paths-2503.03553</loc><lastmod>2025-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-width-perspective-on-partially-ordered-hamiltonian-paths-2503.03553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-width-perspective-on-partially-ordered-hamiltonian-paths-2503.03553"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-block-parallel-automata-networks-2503.04591</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-block-parallel-automata-networks-2503.04591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-block-parallel-automata-networks-2503.04591"/></url>
<url><loc>https://scifaro.com/en/abs/a-quadratic-vertex-kernel-and-a-subexponential-algorithm-for-subset-fast-2503.07208</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quadratic-vertex-kernel-and-a-subexponential-algorithm-for-subset-fast-2503.07208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quadratic-vertex-kernel-and-a-subexponential-algorithm-for-subset-fast-2503.07208"/></url>
<url><loc>https://scifaro.com/en/abs/permanent-of-bipartite-graphs-in-terms-of-determinants-2503.08128</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permanent-of-bipartite-graphs-in-terms-of-determinants-2503.08128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permanent-of-bipartite-graphs-in-terms-of-determinants-2503.08128"/></url>
<url><loc>https://scifaro.com/en/abs/sorting-permutations-using-a-pop-stack-with-a-bypass-2503.08285</loc><lastmod>2025-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sorting-permutations-using-a-pop-stack-with-a-bypass-2503.08285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sorting-permutations-using-a-pop-stack-with-a-bypass-2503.08285"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-dimension-2503.10240</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-dimension-2503.10240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-dimension-2503.10240"/></url>
<url><loc>https://scifaro.com/en/abs/towards-transitive-free-digraphs-2503.10541</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-transitive-free-digraphs-2503.10541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-transitive-free-digraphs-2503.10541"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-fastmap-new-applications-2503.11908</loc><lastmod>2025-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-fastmap-new-applications-2503.11908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-fastmap-new-applications-2503.11908"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-amortization-on-minimizing-total-completion-time-with-explorable-uncertainty-2503.13357</loc><lastmod>2026-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-amortization-on-minimizing-total-completion-time-with-explorable-uncertainty-2503.13357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-amortization-on-minimizing-total-completion-time-with-explorable-uncertainty-2503.13357"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-convention-for-achievement-positional-games-2503.18163</loc><lastmod>2026-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-convention-for-achievement-positional-games-2503.18163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-convention-for-achievement-positional-games-2503.18163"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-asynchronous-attractors-in-and-not-boolean-networks-2503.19147</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-asynchronous-attractors-in-and-not-boolean-networks-2503.19147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-asynchronous-attractors-in-and-not-boolean-networks-2503.19147"/></url>
<url><loc>https://scifaro.com/en/abs/logiclearner-a-tool-for-the-guided-practice-of-propositional-logic-proofs-2503.19280</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logiclearner-a-tool-for-the-guided-practice-of-propositional-logic-proofs-2503.19280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logiclearner-a-tool-for-the-guided-practice-of-propositional-logic-proofs-2503.19280"/></url>
<url><loc>https://scifaro.com/en/abs/the-g-good-neighbor-diagnosability-of-product-networks-under-the-pmc-model-2503.19463</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-g-good-neighbor-diagnosability-of-product-networks-under-the-pmc-model-2503.19463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-g-good-neighbor-diagnosability-of-product-networks-under-the-pmc-model-2503.19463"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-minimizing-the-kirchhoff-index-via-adding-edges-2503.21409</loc><lastmod>2025-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-minimizing-the-kirchhoff-index-via-adding-edges-2503.21409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-minimizing-the-kirchhoff-index-via-adding-edges-2503.21409"/></url>
<url><loc>https://scifaro.com/en/abs/a-dense-neighborhood-lemma-applications-of-partial-concept-classes-to-domination-and-chromatic-number-2504.02992</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dense-neighborhood-lemma-applications-of-partial-concept-classes-to-domination-and-chromatic-number-2504.02992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dense-neighborhood-lemma-applications-of-partial-concept-classes-to-domination-and-chromatic-number-2504.02992"/></url>
<url><loc>https://scifaro.com/en/abs/constant-rate-isometric-embeddings-of-hamming-metric-into-edit-metric-2504.03605</loc><lastmod>2026-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-rate-isometric-embeddings-of-hamming-metric-into-edit-metric-2504.03605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-rate-isometric-embeddings-of-hamming-metric-into-edit-metric-2504.03605"/></url>
<url><loc>https://scifaro.com/en/abs/a-customized-sat-based-solver-for-graph-coloring-2504.04821</loc><lastmod>2025-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-customized-sat-based-solver-for-graph-coloring-2504.04821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-customized-sat-based-solver-for-graph-coloring-2504.04821"/></url>
<url><loc>https://scifaro.com/en/abs/strengthening-wilf-s-lower-bound-on-clique-number-2504.04836</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strengthening-wilf-s-lower-bound-on-clique-number-2504.04836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strengthening-wilf-s-lower-bound-on-clique-number-2504.04836"/></url>
<url><loc>https://scifaro.com/en/abs/broadcast-via-mobile-agents-in-a-dynamic-network-interplay-of-graph-properties-agents-2504.05442</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/broadcast-via-mobile-agents-in-a-dynamic-network-interplay-of-graph-properties-agents-2504.05442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/broadcast-via-mobile-agents-in-a-dynamic-network-interplay-of-graph-properties-agents-2504.05442"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-characterization-of-spartan-graphs-2504.06832</loc><lastmod>2025-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-characterization-of-spartan-graphs-2504.06832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-characterization-of-spartan-graphs-2504.06832"/></url>
<url><loc>https://scifaro.com/en/abs/solving-pseudo-injective-polynomial-equations-over-finite-dynamical-systems-2504.06986</loc><lastmod>2026-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-pseudo-injective-polynomial-equations-over-finite-dynamical-systems-2504.06986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-pseudo-injective-polynomial-equations-over-finite-dynamical-systems-2504.06986"/></url>
<url><loc>https://scifaro.com/en/abs/implied-integrality-in-mixed-integer-optimization-2504.07209</loc><lastmod>2025-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implied-integrality-in-mixed-integer-optimization-2504.07209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implied-integrality-in-mixed-integer-optimization-2504.07209"/></url>
<url><loc>https://scifaro.com/en/abs/computing-gradient-vector-fields-with-morse-sequences-2504.07526</loc><lastmod>2025-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-gradient-vector-fields-with-morse-sequences-2504.07526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-gradient-vector-fields-with-morse-sequences-2504.07526"/></url>
<url><loc>https://scifaro.com/en/abs/self-orthogonal-cellular-automata-2504.09173</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-orthogonal-cellular-automata-2504.09173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-orthogonal-cellular-automata-2504.09173"/></url>
<url><loc>https://scifaro.com/en/abs/token-sliding-reconfiguration-on-dags-2504.10671</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/token-sliding-reconfiguration-on-dags-2504.10671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/token-sliding-reconfiguration-on-dags-2504.10671"/></url>
<url><loc>https://scifaro.com/en/abs/cops-and-robbers-for-graphs-on-surfaces-with-crossings-2504.13813</loc><lastmod>2025-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cops-and-robbers-for-graphs-on-surfaces-with-crossings-2504.13813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cops-and-robbers-for-graphs-on-surfaces-with-crossings-2504.13813"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-distributed-discrete-evacuation-strategies-2504.14052</loc><lastmod>2026-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-distributed-discrete-evacuation-strategies-2504.14052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-distributed-discrete-evacuation-strategies-2504.14052"/></url>
<url><loc>https://scifaro.com/en/abs/progress-on-self-identifying-codes-2504.14124</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progress-on-self-identifying-codes-2504.14124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progress-on-self-identifying-codes-2504.14124"/></url>
<url><loc>https://scifaro.com/en/abs/maker-maker-games-of-rank-4-are-pspace-complete-2504.14256</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maker-maker-games-of-rank-4-are-pspace-complete-2504.14256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maker-maker-games-of-rank-4-are-pspace-complete-2504.14256"/></url>
<url><loc>https://scifaro.com/en/abs/circularity-and-repetitiveness-in-non-injective-df0l-systems-2504.15828</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circularity-and-repetitiveness-in-non-injective-df0l-systems-2504.15828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circularity-and-repetitiveness-in-non-injective-df0l-systems-2504.15828"/></url>
<url><loc>https://scifaro.com/en/abs/structural-properties-of-non-linear-cellular-automata-permutivity-surjectivity-and-reversibility-2504.15949</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-properties-of-non-linear-cellular-automata-permutivity-surjectivity-and-reversibility-2504.15949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-properties-of-non-linear-cellular-automata-permutivity-surjectivity-and-reversibility-2504.15949"/></url>
<url><loc>https://scifaro.com/en/abs/all-finite-lattices-are-stable-matching-lattices-2504.17916</loc><lastmod>2026-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-finite-lattices-are-stable-matching-lattices-2504.17916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-finite-lattices-are-stable-matching-lattices-2504.17916"/></url>
<url><loc>https://scifaro.com/en/abs/on-constrained-intersection-representations-of-graphs-and-digraphs-2504.18365</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-constrained-intersection-representations-of-graphs-and-digraphs-2504.18365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-constrained-intersection-representations-of-graphs-and-digraphs-2504.18365"/></url>
<url><loc>https://scifaro.com/en/abs/tight-lower-bound-for-multicolor-discrepancy-2504.18489</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-lower-bound-for-multicolor-discrepancy-2504.18489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-lower-bound-for-multicolor-discrepancy-2504.18489"/></url>
<url><loc>https://scifaro.com/en/abs/the-frequency-k-i-s-for-symmetrical-traveling-salesman-problem-2504.19608</loc><lastmod>2026-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-frequency-k-i-s-for-symmetrical-traveling-salesman-problem-2504.19608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-frequency-k-i-s-for-symmetrical-traveling-salesman-problem-2504.19608"/></url>
<url><loc>https://scifaro.com/en/abs/note-about-the-complexity-of-the-acyclic-orientation-with-parity-constraint-problem-2504.20935</loc><lastmod>2025-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-about-the-complexity-of-the-acyclic-orientation-with-parity-constraint-problem-2504.20935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-about-the-complexity-of-the-acyclic-orientation-with-parity-constraint-problem-2504.20935"/></url>
<url><loc>https://scifaro.com/en/abs/concurrency-constrained-scheduling-with-tree-like-constraints-2504.21502</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrency-constrained-scheduling-with-tree-like-constraints-2504.21502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrency-constrained-scheduling-with-tree-like-constraints-2504.21502"/></url>
<url><loc>https://scifaro.com/en/abs/elimination-distance-to-dominated-clusters-2504.21675</loc><lastmod>2025-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elimination-distance-to-dominated-clusters-2504.21675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elimination-distance-to-dominated-clusters-2504.21675"/></url>
<url><loc>https://scifaro.com/en/abs/normality-of-8-bit-bent-function-2504.21779</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normality-of-8-bit-bent-function-2504.21779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normality-of-8-bit-bent-function-2504.21779"/></url>
<url><loc>https://scifaro.com/en/abs/counting-specific-classes-of-relations-regarding-fixed-points-and-reflexive-points-2505.00140</loc><lastmod>2026-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-specific-classes-of-relations-regarding-fixed-points-and-reflexive-points-2505.00140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-specific-classes-of-relations-regarding-fixed-points-and-reflexive-points-2505.00140"/></url>
<url><loc>https://scifaro.com/en/abs/redundancy-analysis-using-lcm-filtrations-networks-system-signature-and-sensitivity-evaluation-2505.01416</loc><lastmod>2025-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/redundancy-analysis-using-lcm-filtrations-networks-system-signature-and-sensitivity-evaluation-2505.01416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/redundancy-analysis-using-lcm-filtrations-networks-system-signature-and-sensitivity-evaluation-2505.01416"/></url>
<url><loc>https://scifaro.com/en/abs/net-occurrences-in-fibonacci-and-thue-morse-words-2505.02307</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/net-occurrences-in-fibonacci-and-thue-morse-words-2505.02307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/net-occurrences-in-fibonacci-and-thue-morse-words-2505.02307"/></url>
<url><loc>https://scifaro.com/en/abs/p-complete-square-free-word-representation-of-word-representable-graphs-2505.05110</loc><lastmod>2025-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/p-complete-square-free-word-representation-of-word-representable-graphs-2505.05110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/p-complete-square-free-word-representation-of-word-representable-graphs-2505.05110"/></url>
<url><loc>https://scifaro.com/en/abs/sideways-on-the-highways-2505.05426</loc><lastmod>2025-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sideways-on-the-highways-2505.05426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sideways-on-the-highways-2505.05426"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-l-p-congestion-spanning-trees-on-weighted-graphs-2505.05969</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-l-p-congestion-spanning-trees-on-weighted-graphs-2505.05969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-l-p-congestion-spanning-trees-on-weighted-graphs-2505.05969"/></url>
<url><loc>https://scifaro.com/en/abs/scheduled-jacobian-chaining-2505.06056</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scheduled-jacobian-chaining-2505.06056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scheduled-jacobian-chaining-2505.06056"/></url>
<url><loc>https://scifaro.com/en/abs/reflexive-composition-of-elementary-state-machines-with-an-application-to-the-reversal-of-cellular-automata-rule-90-2505.07186</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflexive-composition-of-elementary-state-machines-with-an-application-to-the-reversal-of-cellular-automata-rule-90-2505.07186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflexive-composition-of-elementary-state-machines-with-an-application-to-the-reversal-of-cellular-automata-rule-90-2505.07186"/></url>
<url><loc>https://scifaro.com/en/abs/linear-search-with-probabilistic-detection-and-variable-speeds-2505.09429</loc><lastmod>2025-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-search-with-probabilistic-detection-and-variable-speeds-2505.09429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-search-with-probabilistic-detection-and-variable-speeds-2505.09429"/></url>
<url><loc>https://scifaro.com/en/abs/an-mathcal-o-n-space-construction-of-superpermutations-2505.09628</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-mathcal-o-n-space-construction-of-superpermutations-2505.09628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-mathcal-o-n-space-construction-of-superpermutations-2505.09628"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-color-temporal-graphs-to-ensure-proper-transitions-2505.10207</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-color-temporal-graphs-to-ensure-proper-transitions-2505.10207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-color-temporal-graphs-to-ensure-proper-transitions-2505.10207"/></url>
<url><loc>https://scifaro.com/en/abs/impact-of-a-synchronism-on-eca-towards-a-new-classification-2505.10645</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/impact-of-a-synchronism-on-eca-towards-a-new-classification-2505.10645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/impact-of-a-synchronism-on-eca-towards-a-new-classification-2505.10645"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-sensor-requirements-by-relaxing-the-network-metric-dimension-2505.11193</loc><lastmod>2025-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-sensor-requirements-by-relaxing-the-network-metric-dimension-2505.11193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-sensor-requirements-by-relaxing-the-network-metric-dimension-2505.11193"/></url>
</urlset>