<?xml version="1.0" encoding="utf-8" standalone="yes"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml"><url><loc>https://ac.notready.eu/project/fwf-cluster-of-excellence-bilateral-artificial-intelligence/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/parameterized-graph-drawing/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sara-di-bartolomeo/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/doris-brazda/</loc><lastmod>2026-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/maria-bresich/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jiehua-chen/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-depian/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jan-niclas-dreier/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simon-dominik-fink/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alexander-firbas/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/robert-ganian/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/marlene-grundel/</loc><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-hatschka/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/phuc-hung-hoang/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/enrico-iurlano/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/liana-khazaliya/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-kirchweger/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pablo-manrique-merchan/</loc><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-nollenburg/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tomas-peitl/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gunther-raidl/</loc><lastmod>2026-03-05T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mathis-teva-rocton/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/manuel-sorge/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-strasser/</loc><lastmod>2026-03-06T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-szeider/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/laurenz-tomandl/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-varga/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/florentina-voboril/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simon-wietheger/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hai-xia/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tianwei-zhang/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ac-admin/</loc><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/alexander-firbas/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/christian-hatschka/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/enrico-iurlano/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/florentina-voboril/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/gunther-raidl/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/hai-xia/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/jan-niclas-dreier/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/jiehua-chen/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/johannes-varga/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/laurenz-tomandl/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/liana-khazaliya/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/manuel-sorge/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/maria-bresich/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/markus-kirchweger/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/martin-kronegger/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/martin-nollenburg/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/mathis-teva-rocton/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/phuc-hung-hoang/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/robert-ganian/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/sara-di-bartolomeo/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/simon-dominik-fink/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/simon-wietheger/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/stefan-szeider/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/thomas-depian/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/tianwei-zhang/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/tomas-peitl/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publist/</loc><lastmod>2026-03-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/jobs/2026-01-21-sysadmin/</loc><lastmod>2026-03-06T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/jobs/</loc><lastmod>2026-03-06T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/lehrling/</loc><lastmod>2026-03-06T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tags/</loc><lastmod>2026-03-06T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/authors/</loc><lastmod>2026-03-05T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/international-and-organizational-activities/</loc><lastmod>2026-03-05T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/courses/</loc><lastmod>2026-02-16T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/jobs/2026-01-22-postdoc-algorithms-copy/</loc><lastmod>2026-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/contact/</loc><lastmod>2026-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/postdoc/</loc><lastmod>2026-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/research/</loc><lastmod>2026-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication-type/0/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication-type/1/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication-type/2/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-denoising-diffusion-adaptive-search-for-the-alpha-domination-problem-on-social-graphs/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-parameterized-complexity-framework-for-finding-local-optima/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs-best-paper-award/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ajaykrishnan-e-s/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/asksat/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-satisfaction-continued/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bhore-sujoy/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/block-crossings-in-one-sided-tanglegrams/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bonerath-annika/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/clarity-and-computational-efficiency-of-orbital-boundary-labeling/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/coe/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complexity-of-positive-influence-domination-on-partial-grids/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-probabilistic-explanations-for-ml-models-fixed-parameter-algorithms/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-twin-width-via-treedepth-and-vertex-integrity/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lokshtanov/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/david-seka/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/djukanovic-marko/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/dobler-alexander/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/efficient-reversal-of-transductions-of-sparse-graph-classes/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fair-correlation-clustering-meets-graph-parameters/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/graph-choosability-via-sat-beyond-the-nullstellensatz/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-gajarsky/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-blaha/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jonathan-h%C3%B8jlev/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/katharina-gillig/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/le-thanh-son/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/linord/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/liotta-giuseppe/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/makespan-minimization-in-split-learning-from-theory-to-practice/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/matrix-editing-meets-fair-clustering-parameterized-algorithms-and-complexity/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/micha%C5%82-pilipczuk/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/montecchiani-fabrizio/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ordyniak-sebastian/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/parai/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/pgd/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/piselli-tommaso/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication_types/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/reveal/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/routing-few-robots-in-a-crowded-network/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rychlicki-mateusz/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/strides/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/superstrings-of-uniform-cardinality-set-systems-via-the-generalized-traveling-salesperson-problem/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/terziadis-soeren/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-graph-burning-problem-under-constrained-diffusion/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/toth-csaba-d./</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/vaishali-surianarayanan/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wallinger-markus/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/weinkauf-tino/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/weissenfels-alexander/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wulms-jules/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wustinger-martin/</loc><lastmod>2026-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-12-11-new-phd-alexander-dobler/</loc><lastmod>2025-12-11T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/</loc><lastmod>2025-12-11T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-12-04-what-happens-when-computers-go-quantum/</loc><lastmod>2025-12-04T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-11-05-herbert-fleischner-1944-2025/</loc><lastmod>2025-11-05T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-09-26-three-contest-awards-for-graph-drawing-student-teams/</loc><lastmod>2025-09-26T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-09-19-second-place-in-the-pace-challenge-for-a-team-of-ac-group-researchers/</loc><lastmod>2025-09-19T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-09-17-comsoc-2025-begins---computational-social-choice/</loc><lastmod>2025-09-17T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-09-16-learning-and-belief-revision-an-overview/</loc><lastmod>2025-09-16T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-06-23-axioms-as-rules-in-intuitionistic-logic/</loc><lastmod>2025-06-23T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-06-13-best-paper-award-and-honourable-mention-at-eurovis-2025/</loc><lastmod>2025-06-13T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-06-13-markus-wallinger-receives-eurovis-phd-award/</loc><lastmod>2025-06-13T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-06-11-towards-formalizing-cyclic-tableaux-and-interpolation-for-pdl-in-lean/</loc><lastmod>2025-06-11T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/approximate-evaluation-of-quantitative-second-order-queries/</loc><lastmod>2025-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hamm-thekla/</loc><lastmod>2025-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-03-19-logic-and-computation-of-social-behavior/</loc><lastmod>2025-03-19T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication-type/7/</loc><lastmod>2025-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/denoising-diffusion-based-evolutionary-algorithms-exploring-hybridizations-of-evolutionary-algorithms-with-denoising-diffusion-models/</loc><lastmod>2025-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/joan-salva-soler/</loc><lastmod>2025-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jonas-kompauer/</loc><lastmod>2025-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimizing-elevator-control-with-a-destination-registration-system/</loc><lastmod>2025-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-02-27-codds-theorem-for-databases-over-semirings/</loc><lastmod>2025-02-27T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-02-05-classical-versus-constructive-an-ecumenical-approach/</loc><lastmod>2025-02-05T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-01-24-explanatory-proofs-from-logic-to-mathematics/</loc><lastmod>2025-01-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-01-23-best-paper-award-at-sofsem-2025/</loc><lastmod>2025-01-23T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/master/</loc><lastmod>2025-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/theses/2026-01-22-master-graph-algo/</loc><lastmod>2025-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/theses/</loc><lastmod>2025-01-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2025-01-14-trustable-explainable-ai-a-redemption-by-logic/</loc><lastmod>2025-01-14T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication-type/4/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication-type/6/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-learning-twolevel-optimization-approach-for-the-demand-maximizing-battery-swapping-station-location-problem/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/acm-transactions-on-evolutionary-learning-and-optimization/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alexander-dobler/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-introduction-to-and-survey-of-biological-network-visualization/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anais-villedieu/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andre-schidler/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/archambault-daniel/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/balancing-latin-rectangles-with-llm-generated-streamliners/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/better-extension-variables-in-dqbf-via-independence/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/blum-christian/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/breaking-symmetries-in-quantified-graph-search-a-comparative-study/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/brich-nicolas/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/bridging-language-models-and-symbolic-solvers-via-the-model-context-protocol/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/bundling-aware-graph-drawing-revisited/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/caroppo-susanna/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/chiu-alvin/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/cofund/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-twin-width-parameterized-by-the-feedback-edge-number-and-vertex-integrity/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/constrained-boundary-labeling/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/crossing-and-independent-families-among-polygons/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/da-lozzo-giordano/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/di-battista-giuseppe/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eades-peter/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ehlers-henry/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eppstein-david/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/extracting-problem-structure-with-llms-for-optimized-sat-local-search/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/f2stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fabian-holzer/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fabrizio-montecchiani/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fleischner-herbert/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/generating-streamlining-constraints-with-large-language-models/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/genetic-programming-hyper-heuristic-for-the-dynamic-electric-dial-a-ride-problem/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/geometry-matters-in-planar-storyplans/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/giuseppe-liotta/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/goodrich-michael/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/goodrich-michael-t./</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/grison-elise/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gyselinck-valerie/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/haase-carolina/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/hcae/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hegemann-tim/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/holzmuller-maximilian/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hong-seok-hee/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/huang-william/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/huber-marc/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ignaz-rutter/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improvements-in-large-neighborhood-search-for-the-electric-autonomous-dial-a-ride-problem/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/introducing-fairness-in-network-visualization/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakob-schafellner/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-balaban/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jatschka-thomas/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kern-christoph/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/klemz-boris/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kobourov-stephen-g./</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/krone-michael/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/large-and-parallel-human-sorting-networks/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-to-select-promising-initial-solutions-for-large-neighborhood-search-based-multi-agent-path-finding/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/li-guangping/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/limmer-steffen/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-pfretzschner/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mei-yi/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/merge-width-and-first-order-model-checking/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mondal-debajyoti/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/monika-wi%C3%9Fmann/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/morgagni-simone/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/natsukawa-hiroaki/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/network-navigation-with-online-delays-is-pspace-complete/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-minimizing-wiggle-in-stacked-area-charts/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-planar-unit-length-linear-linkages-in-polygonal-domains/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimizing-staircase-motifs-in-biofabric-network-layouts/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimizing-wiggle-in-storylines/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-in-machine-learning/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-of-caching-in-networks/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/passenger-decision-making-in-mass-transit-systems-insights-from-dual-process-theories/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pathways-to-tractability-for-geometric-thickness/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peruvemba-ramaswamy-vaidyanathan/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/prabhakar-archana/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/quantum-speedups-for-polynomial-time-dynamic-programming-algorithms/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/representing-hypergraphs-by-point-line-incidences/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rodemann-tobias/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/roder-sebastian/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-modulo-symmetries-a-survey/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-based-search-for-minwise-independent-families/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schulz-andre/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sieper-marie-diana/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/steffen-limmer/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/streamllm-enhancing-constraint-programming-with-large-language-model-generated-streamliners/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/structural-parameterizations-of-simultaneous-planarity/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/tackling-the-alpha-domination-problem-heuristically/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tappini-alessandra/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-3-decomposition-conjecture-a-sat-based-approach-with-specialized-propagators/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-cluster-vertex-splitting-and-company/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-optimizing-atomic-congestion/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-peculiarities-of-extending-queue-layouts/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tommaso-piselli/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/torunczyk-szymon/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/training-one-dimensional-graph-neural-networks-is-np-hard/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/trainingshared-transportgenetic-programmingdynamic-schedulingreal-time-systemsdispatchingplanningresource-managementvehicle-dynamicstesting/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/transitions-in-dynamic-point-labeling/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/uncovering-and-verifying-optimal-community-structure-in-complex-networks-a-maxsat-approach/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/vaidyanathan-peruvemba-ramaswamy/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/villedieu-anais/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/visualizing-treewidth/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wismath-stephen/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wolff-alexander/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wu-hsiang-yun/</loc><lastmod>2025-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-12-09-nl-interface-of-proleg-system-and-extracting-normative-sentences-from-german-traffic-judgements/</loc><lastmod>2024-12-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-12-05-markus-wallinger-receives-award-of-excellence-for-his-phd-thesis/</loc><lastmod>2024-12-05T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-11-21-thomas-depian-receives-state-prize-for-his-masters-thesis/</loc><lastmod>2024-11-21T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alexander-simunics/</loc><lastmod>2024-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-alphazero-agent-for-just-4-fun-a-non-deterministic-game-with-imperfect-information/</loc><lastmod>2024-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/graph-neural-networks-meet-local-search-for-the-weighted-total-domination-problem/</loc><lastmod>2024-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-neubauer/</loc><lastmod>2024-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strength-estimation-in-the-game-of-go/</loc><lastmod>2024-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-07-24-best-paper-award-at-gecco-2024-for-m-bresich-g-raidl-and-s-limmer/</loc><lastmod>2024-07-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-06-14-welcome-to-our-feodor-lynen-fellow-dr-frank-sommer/</loc><lastmod>2024-06-14T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-05-31-esra-ceylan-won-the-ocg-award-2024/</loc><lastmod>2024-05-31T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-04-26-new-phd-markus-wallinger/</loc><lastmod>2024-04-26T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2024-01-09-phd-completed-by-soeren-terziadis/</loc><lastmod>2024-01-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-biased-random-key-genetic-algorithm-for-solving-the-longest-common-square-subsequence-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-neural-network-based-guidance-for-a-brkga-an-application-to-the-longest-common-square-subsequence-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-simulated-annealing-based-approach-for-the-roman-domination-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alexis-de-colnet/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andre-schidler/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-kerren/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/argyrios-deligkas-and-eduard-eiben-and-viktoriia-korchemna-and-simon-schierreich/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/ask-sat/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/asp-qrat-a-conditionally-optimal-dual-proof-system-for-asp/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoor-dnfs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/balancing-bicycle-sharing-systems/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benjamin-bergougnoux-and-oscar-defrain-and-fionn-mc-inerney/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/binucci-carla/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/blake-andrew/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/boundary-labeling-in-a-circular-orbit/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/bounding-and-computing-obstacle-numbers-of-graphs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/bundling-aware-graph-drawing/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/chapman-peter/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/chew-leroy/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-komusiewicz/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-komusiewicz-and-frank-sommer/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christina-gillmann/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christoph-kern/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christopher-n.-warren/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/compilation-and-fast-model-counting-beyond-cnf/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/solution-archives/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/completed-research-projects/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-data-driven-multilinear-metro-maps/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-hive-plots-a-combinatorial-framework/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-small-rainbow-cycle-numbers-with-sat-modulo-symmetries/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-twin-width-parameterized-by-the-feedback-edge-number/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/cooperative-optimization-approaches-for-distributing-service-points/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/cooperative-personnel-scheduling/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cornelius-brand-and-viktoriia-korchemna-and-kirill-simonov-and-michael-skotnica/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/counting-vanishing-matrix-vector-products/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/crossing-number-is-np-hard-for-constant-path-width-and-tree-width/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/current-research-projects/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/cutting-and-packing/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/cycles-on-graphs-and-properties-of-graphs-with-special-cycle-structure/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/de-colnet-alexis/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/di-giacomo-emilio/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/dial-a-ride-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/doctoral-college-logical-methods-in-computer-science/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/doctoral-college-vienna-graduate-school-on-computational-optimization/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eduard-eiben/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/electric-autonomous-vehicles/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eleftheriadis-ioannis/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/emanuel-herrendorf/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/linordvis/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/enumerating-minimal-solution-sets-for-metric-graph-problems/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eric-duchene-and-valentin-gledel-and-sylvain-gravier-and-fionn-mc-inerney-and-mehdi-mhalla-and-aline-parreau/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/eslim-circuit-minimization-with-sat-based-local-improvement/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-methods-for-the-selective-assessment-routing-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/explaining-decisions-in-ml-models-a-parameterized-complexity-analysis/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/1828-2/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/featured/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/first-order-model-checking-on-monadically-stable-graph-classes/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-algorithms-for-computing-bend-restricted-rac-drawings-of-graphs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/flip-breakability-a-combinatorial-dichotomy-for-monadically-dependent-graph-classes/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/florian-windhager/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/francis-harvey/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/frank-sommer/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/franz-xaver-reichl/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/friedrich-slivovsky/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/gdmetrix-a-networkx-extension-for-graph-drawing-metrics/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/generating-all-invertible-matrices-by-row-operations/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gerik-scheuermann/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/giacomo-paesani/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gregor-betz/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/greilhuber-jakob/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gronemann-martin/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gupta-siddharth/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hemmelmayr-vera-c./</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/henning-martin-woydt/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hoop-diagrams-a-set-visualization-method/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hot-off-the-press-the-first-proven-performance-guarantees-for-the-non-dominated-sorting-genetic-algorithm-ii-nsga-ii-on-a-combinatorial-optimization-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/humalgo/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improved-circuit-minimization-with-exact-synthesis/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improving-temporal-treemaps-by-minimizing-crossings/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/introducing-fairness-in-graph-visualization/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/introducing-fairness-in-graph-visualization-via-gradient-descent/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jannik-schestag-and-niels-gruttemeier-and-christian-komusiewicz-and-frank-sommer/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jeremie-chalopin-and-victor-chepoi-and-fionn-mc-inerney-and-sebastien-ratel/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jules-wulms/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/junger-michael/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/junger-paul-j./</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/karlsson-emil/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/katy-borner/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kimmo-elo/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/konrad-dabrowski/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/large-neighborhood-search/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/research-collaboration-with-medaustron/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-small-decision-trees-for-data-of-low-rank-width/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/learning-to-solve-dynamic-vehicle-routing-problems/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/l2solve/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lenhart-william-j./</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/leroy-chew/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/letting-a-large-neighborhood-search-for-an-electric-dial-a-ride-problem-fly-on-the-fly-charging-station-insertion/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lindsten-fredrik/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mahlmann-nikolas/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/malte-rehbein/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/matheuristics-hybrid-optimization-algorithms-for-transportation-problems-with-mutltiple-visits/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mccarty-rose/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/meffert-julian/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/melanie-conroy/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimizing-corners-in-colored-rectilinear-grids/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimizing-switches-in-cased-graph-drawings/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/mixed-integer-linear-programming-based-large-neighborhood-search-approaches-for-the-directed-feedback-vertex-set-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mohar-bojan/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/msca-cofund-doctoral-programme-logics-tuwien/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/ffg-i892-n23/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mutzel-petra/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/new-frontiers-for-parameterized-complexity/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/nfpc/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/niels-gruttemeier-and-philipp-heinrich-ke%C3%9Fler/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nils-morawietz/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/non-clashing-teaching-maps-for-balls-in-graphs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-critical-node-problems-with-vulnerable-vertices/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-complexity-of-community-aware-network-sparsification/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-complexity-of-the-storyplan-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/wwtf-ict-10-024/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/overcoming-intractability-in-the-knowledge-compilation-map/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/%C3%B8yvind-eide/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pace-solver-description-crgone/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/paesani-giacomo-and-rychlicki-mateusz/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/parameterized-analysis-in-ai/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/parameterized-compilation/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pilipczuk-micha%C5%82/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pirker-christian/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/qbf-proofs-and-certificates/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/r%5Cnnberg-elina/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ramaswamy-vaidyanathan-peruvemba/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rapberger-anna/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/reixach-jaume/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/revealai/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rodgers-peter/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ronnberg-elina/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/salva-soler-joan/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sara-irina-fabrikant/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-backdoors-depth-beats-size/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-modulo-symmetries-for-graph-generation-and-enumeration/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-based-decision-tree-learning-for-large-data-sets/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-based-tree-decomposition-with-iterative-cascading-policy-selection/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/satisfiability-modulo-user-propagators/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/scheduling-jobs-using-queries-to-interactively-learn-human-availability-times/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schober-sophia/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/scott-b.-weingart/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sebastian-ordyniak/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/selecting-user-queries-in-interactive-job-scheduling/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/should-decisions-in-qcdcl-follow-prefix-order/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/signed-double-roman-domination-on-cubic-graphs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/slim-tree-cut-width/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/slim/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/smash-and-grab-the-0-6-scoring-game-on-graphs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/speeding-up-logic-based-benders-decomposition-by-strengthening-cuts-with-graph-neural-networks/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/splitting-plane-graphs-to-outerplanarity/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-janicke/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stephen-kobourov/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/strides/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/structure-guided-local-improvement-for-maximum-satisfiability/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/submodst-a-fast-generic-solver-for-submodular-maximization-with-size-constraints/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/symvonis-antonios/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tamara-mchedlidze/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-k-opt-algorithm-for-the-traveling-salesman-problem-has-exponential-running-time-for-k-5/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-extending-stack-layouts/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/erc-project-the-parameterized-complexity-of-reasoning-problems/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-power-of-collaboration-learning-large-bayesian-networks-at-scale/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tim-dwyer/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/timothy-r.-tangherlini/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/todemann-tobias/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/toru%5C%C5%89czyk-szymon/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/twin-width-meets-feedback-edges-and-vertex-integrity/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/uncertainty-in-humanities-network-visualization/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/valentin-bartier-and-oscar-defrain-and-fionn-mc-inerney/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/project/qbfdependencies/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/viktoriia-korchemna/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/visualizing-extensions-of-argumentation-frameworks-as-layered-graphs/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/woltran-stefan/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/zec-tatjana/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/zehavi-meirav/</loc><lastmod>2024-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-12-06-informatics-awards-2023/</loc><lastmod>2023-12-06T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-10-18-jiehua-chen-promotion-to-tenured-associate-professor/</loc><lastmod>2023-10-18T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-09-23-successful-graph-drawing-conference-2023-in-palermo/</loc><lastmod>2023-09-23T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bernhard-kreutzer/</loc><lastmod>2023-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computational-optimization-approaches-for-distributing-battery-exchange-stations-for-electric-scooters/</loc><lastmod>2023-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-07-24-phd-completed-by-anais-villedieu/</loc><lastmod>2023-07-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-le-berre/</loc><lastmod>2023-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-k.-fichte/</loc><lastmod>2023-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-hecher/</loc><lastmod>2023-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-silent-r-evolution-of-sat/</loc><lastmod>2023-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-05-31-phd-completed-by-andre-schidler/</loc><lastmod>2023-05-31T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-05-12-phd-completed-by-vaidyanathan-pr/</loc><lastmod>2023-05-12T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-05-11-phd-completed-by-nikolaus-frohner/</loc><lastmod>2023-05-11T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-learning-multilevel-optimization-approach-for-a-large-location-allocation-problem/</loc><lastmod>2023-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/advancing-state-space-search-for-static-and-dynamic-optimization-by-parallelization-and-learning/</loc><lastmod>2023-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nikolaus-frohner/</loc><lastmod>2023-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-04-22-best-paper-award-at-ieee-pacificvis-2023/</loc><lastmod>2023-04-22T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2023-04-14-best-paper-award-at-evocop-2023/</loc><lastmod>2023-04-14T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-logic-based-algorithmic-meta-theorem-for-mim-width/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-multilevel-optimization-approach-for-large-scale-battery-exchange-station-location-planning/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-parameterized-theory-of-pac-learning/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-policy-based-learning-beam-search-for-combinatorial-optimization/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-polyhedral-perspective-on-tropical-convolutions/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-relative-value-function-based-learning-beam-search-for-the-longest-common-subsequence-problem/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-sat-solver-s-opinion-on-the-erdos-faber-lovasz-conjecture/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ahmed-reyan/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/aina-niemetz/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithms-for-satisfiability-testing/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/amadeus-reinald/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-approach-for-scheduling-a-fleet-of-shared-electric-vehicles/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/angelini-patrizio/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/are-hitting-formulas-hard-for-resolution/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/armin-biere/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/auber-david/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bekos-michael-a./</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benjamin-bergougnoux/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bernhard-neumann/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-komusiewicz-and-jannis-schramek-and-frank-sommer/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/circuit-minimization-with-exact-synthesis-from-qbf-back-to-sat/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/circuit-minimization-with-qbf-based-exact-synthesis/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/co-certificate-learning-with-sat-modulo-symmetries/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-optimal-hypertree-decompositions-with-sat/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-twin-width-with-sat-and-branch-bound/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cornelius-brand/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cornelius-brand-and-alexandra-lassota/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cornelius-brand-and-martin-koutecky-and-alexandra-lassota/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cornelius-brand-and-viktoriia-korchemna-and-michael-skotnica/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/crossing-minimization-in-time-interval-storylines/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/csp-beyond-tractable-constraint-languages/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/deterministic-constrained-multilinear-detection/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/emmanuel-arrighi-and-niels-gruttemeier-and-nils-morawietz-and-frank-sommer-and-petra-wolf/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/erik-jan-van-leeuwen/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/essentially-tight-kernels-for-weakly-closed-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/esther-galby/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ettrich-rupert/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-algorithms-for-group-closeness-centrality/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fast-convolutions-for-near-convex-sequences/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/faster-edge-path-bundling-through-graph-spanners/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fionn-mc~inerney/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/first-order-model-checking/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/first-order-model-checking-on-structurally-sparse-graph-classes/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/florian-schager/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/francisco-chicano/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gaetan-berthe/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gedicke-sven/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/growth-of-the-perfect-sequence-covering-array-number/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/haunert-jan-henrik/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/huber-michael/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-approaches-to-sports-league-scheduling-using-constraint-programming-and-simulated-annealing/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-metaheuristics-based-on-large-neighborhood-search-and-mixed-integer-linear-programming-for-the-directed-feedback-vertex-set-problem/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/inconsistent-cores-for-asp-the-perks-and-perils-of-non-monotonicity/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/interactive-job-scheduling-with-partially-known-personnel-availabilities/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ipasir-up-user-propagators-for-cdcl/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jaroslav-garvardt-and-christian-komusiewicz-and-frank-sommer/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jeremie-chalopin/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/katalin-fazekas/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kaufmann-michael/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kindermann-philipp/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kobourov-stephen/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/l2solve/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/large-neighborhood-search-for-electric-vehicle-fleet-scheduling/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lars-jaffke/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/laure-morelle/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-small-decision-trees-with-large-domain/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/linsets-zip-compressing-linear-set-diagrams/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/luca-pascal-staus-and-christian-komusiewicz-and-nils-morawietz-and-frank-sommer/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/maarten-loffler/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mamadou-moustapha-kante/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/manfred-scheucher/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/marcin-pilipczuk/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-bentert-and-jannik-schestag-and-frank-sommer/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-mnich/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/maximizing-social-welfare-in-score-based-social-distance-games/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mock-daniel/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/mosaicsets-embedding-set-systems-into-grid-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multi-objective-policy-evolution-for-a-same-day-delivery-problem-with-soft-deadlines/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/mysemcloud-semantic-aware-word-cloud-editing/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/new-complexity-theoretic-frontiers-of-tractability-for-neural-network-training/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nils-jakob-eckstein-and-niels-gruttemeier-and-christian-komusiewicz-and-frank-sommer/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-computing-optimal-tree-ensembles/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-families-of-planar-dags-with-constant-stack-number/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-complexity-of-finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-group-coverage-centrality-problem-parameterized-complexity-and-heuristics/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimizing-the-positions-of-battery-swapping-stations-pilot-studies-and-layout-optimization-algorithm/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pace-solver-description-touiouidth/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peltonen-jaakko/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/prafullkumar-tale/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proven-optimally-balanced-latin-rectangles-with-sat/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pseudorandom-finite-models/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pupyrev-sergey/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rafael-kiesel-and-andre-schidler/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/raimund-seidel/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/roohani-sharma/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rossmanith-peter/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rottmann-peter/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rutter-ignaz/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sample-compression-schemes-for-balls-in-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sang-il-oum/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-based-generation-of-planar-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-boosted-tabu-search-for-coloring-massive-graphs/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/searching-for-smallest-universal-graphs-and-tournaments-with-sat/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sebastian-roder/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sebastien-ratel/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/siebertz-sebastian/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/slim/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/splitting-vertices-in-2-layer-graph-drawings/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stephen-g.-kobourov/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stojanovic-daniel/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/structural-graph-theory/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-computational-complexity-of-concise-hypersphere-classification/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-coordinated-motion-planning/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-finding-concise-local-explanations/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-network-microaggregation/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tomohiro-koana-and-christian-komusiewicz-and-frank-sommer/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/untangling-circular-drawings-algorithms-and-complexity/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/vera-chekan/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/victor-chepoi/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/worbel-aggregating-point-labels-into-word-clouds/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/yann-vaxes/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/yoann-coudert-osmont/</loc><lastmod>2023-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lukas-felician-krasel/</loc><lastmod>2022-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimization-of-container-transportation-for-fixed-schedule-block-trains-with-optional-round-trips-in-collaborative-logistics/</loc><lastmod>2022-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2022-11-09-new-fwf-esprit-postdocs/</loc><lastmod>2022-11-09T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/people/</loc><lastmod>2022-10-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2022-10-01-best-student-paper-award-at-diagrams-2022/</loc><lastmod>2022-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/beyersdorff-olaf/</loc><lastmod>2022-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/blinkhorn-joshua/</loc><lastmod>2022-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hardness-characterisations-and-size-width-lower-bounds-for-qbf-resolution/</loc><lastmod>2022-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mahajan-meena/</loc><lastmod>2022-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/proof-complexity/</loc><lastmod>2022-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/quantified-boolean-formulas/</loc><lastmod>2022-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/size-width-tradeoff/</loc><lastmod>2022-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2022-07-01-robert-ganian-promoted-to-associate-professor/</loc><lastmod>2022-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2022-05-24-best-paper-award-at-evocop-2022/</loc><lastmod>2022-05-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2022-05-13-new-phd-guangping-li/</loc><lastmod>2022-05-13T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jonas-mayerhofer/</loc><lastmod>2022-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimizing-makespan-in-flow-shops-with-a-reinforcement-learning-like-approach/</loc><lastmod>2022-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters/</loc><lastmod>2022-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computational-optimization-approaches-for-distributing-service-points-for-mobility-applications-and-smart-charging-of-electric-vehicles/</loc><lastmod>2022-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-jatschka/</loc><lastmod>2022-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/47th-international-symposium-on-mathematical-foundations-of-computer-science-mfcs-2022-august-22-26-2022-vienna-austria/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-large-neighborhood-search-for-a-cooperative-optimization-approach-to-distribute-service-points-in-mobility-applications/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-matheuristic-for-battery-exchange-station-location-planning-for-electric-scooters/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-relative-value-function-based-learning-beam-search-for-longest-common-subsequence-problems/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-reproducibility-study-on-user-centric-mir-research-and-why-it-is-important/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-sat-approach-to-twin-width/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-sat-attack-on-rotas-basis-conjecture/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/a.-akitaya-hugo/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithmic-applications-of-tree-cut-width/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/amila-ceranic/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-rauber/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/annabel-resch/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bandyapadhyay-sayan/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/batik-tobias/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bliznets-ivan/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bonnet-edouard/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bruce-ferwerda/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cmolik-ladislav/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/colored-cut-games/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combinatorial-and-algorithmic-aspects-of-monadic-stability/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computational-methods-for-scheduling-the-charging-and-assignment-of-an-on-site-shared-electric-vehicle-fleet/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-treewidth-with-constraint-programming/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/demaine-erik-d./</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/detours-in-directed-graphs/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/djukanovic-marko/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/edge-path-bundling-a-less-ambiguous-edge-bundling-approach/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eun-jung-kim/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eva-maria-hainzl-and-maarten-loffler-and-daniel-perz-and-josef-tkadlec-and-markus-wallinger/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exploiting-c-closure-in-kernelization-algorithms-for-graph-problems/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/filip-pokr-yvka/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-a-battleship-of-uncertain-shape/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-a-cluster-in-incomplete-data/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fine-grained-complexity-of-partial-minimum-satisfiability/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fomin-fedor-v./</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fpt-approximation-for-fair-minimum-load-clustering/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/franz-xaver-reichl-and-friedrich-slivovsky/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fung-yee-tang/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/futschek-gerald/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gajarsky-jakub/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/generalized-coloring-numbers/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/golovach-petr-a./</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/grbic-milana/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/how-to-find-a-good-explanation-for-clustering/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/initial-learning-of-textual-programming-at-school-evolution-of-outreach-activities/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/iyad-kanj/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jean-florent-raymond/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/josip-bobinac/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/k-median-clustering/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kartelj-aleksandar/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/kernelization/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kiefer-sandra/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kirill-simonov/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/klute-fabian/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/korman-matias/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kostitsyna-irina/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kreutzer-stephan/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/landman-martina/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-beam-search-utilizing-machine-learning-to-guide-beam-search-for-solving-combinatorial-optimization-problems/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-large-bayesian-networks-with-expert-constraints/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/leroy-chew-and-friedrich-slivovsky/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lochet-william/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/loffler-maarten/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/longest-cycle-above-erdos-gallai-bound/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lossy-kernelization-of-same-size-clustering/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/lossy-kernels/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/manferd-scheucher/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matic-dragan/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-konig-and-andre-schidler/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-rauscher/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mayerhofer-jonas/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/meulemans-wouter/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimum-link-fencing/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/mixed-labeling-integrating-internal-and-external-labels/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/model-checking-on-interpretations-of-classes-of-bounded-local-cliquewidth/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mouawad-amer-e./</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multi-level-area-balancing-of-clustered-graphs/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multicriteria-optimization-for-dynamic-demers-cartograms/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multidimensional-manhattan-preferences/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nickel-soeren/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nils-morawietz-and-niels-gruttemeier-and-christian-komusiewicz-and-frank-sommer/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-computing-optimal-linear-diagrams/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-covering-segments-with-unit-intervals/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-hard-subgraph-problems-parameterized-algorithms-and-efficient-implementations/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/parada-irene/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterised-partially-predrawn-crossing-number/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-queue-layouts/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-upward-planarity/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/parameterized-approximation/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/patrice-ossona-de-mendez/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pavlovec-vaclav/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pedant-a-certifying-dqbf-solver/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-knees/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/phoebe-de-nooijer-and-soeren-nickel-and-alexandra-weinberger-and-zuzana-masarova-and-tamara-mchedlidze-and-maarten-loffler-and-gunter-rote/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/preface-47th-international-symposium-on-mathematical-foundations-of-computer-science-mfcs-2022-august-22-26-2022-vienna-austria/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/preface-ninth-workshop-on-graph-classes-optimization-and-width-parameters-vienna-austria/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/prutkin-roman/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/purohit-nidhi/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/qbf/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/recognizing-weighted-and-seeded-disk-graphs/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/removing-popular-faces-in-curve-arrangements/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/riad-dizdar/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sagunov-danil/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/saurabh-saket/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sayan-bandyapadhyay-and-fedor-v.-fomin-and-petr-a.-golovach-and-william-lochet-and-nidhi-purohit-and-kirill-simonov/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/scrambling-permutations-and-related-structures-asymptotics-and-constructions/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sebastian-strumbelj/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/shape-guided-mixed-metro-map-layout/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/siminov-kirill/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simola-sofia/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simon-pierre/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simonov-kirill/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sondag-max/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sonke-willem/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/speckmann-bettina/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-woltran/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/testing-upward-planarity-of-partial-2-trees/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-envy-free-graph-cutting/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-k-means-clustering-when-little-is-known/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thekla-hamm-and-nina-klobas-and-george-b.-mertzios-and-paul-g.-spirakis/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thekla-hamm-and-petr-hlineny/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/threshold-treewidth-and-hypertree-width/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tomohiro-koana-and-christian-komusiewicz-and-andre-nichterlein-and-frank-sommer/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-uniform-certification-in-qbf/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/tractable-abstract-argumentation-via-backdoor-treewidth/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/treelike-decompositions-for-transductions-of-sparse-graphs/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/turbocharging-heuristics-for-weak-coloring-numbers/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/twin-width/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/twin-width-and-generalized-coloring-numbers/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/uehara-ryuhei/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/unkovic-svetlana/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/valentin-bauer/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/vigny-alexandre/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/villedieu-anais/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/viola-ivan/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wang-yu-shuen/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/weighted-model-counting-with-twin-width/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wolfgang-dvorak/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/yiting-jiang/</loc><lastmod>2022-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-and-heuristic-approaches-for-solving-string-problems-from-bioinformatics/</loc><lastmod>2021-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/marko-djukanovic/</loc><lastmod>2021-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/</loc><lastmod>2021-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fabio-francisco-oberweger/</loc><lastmod>2021-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2021-09-24-outstanding-results-for-tu-wien-students-at-the-2021-graph-drawing-contest/</loc><lastmod>2021-09-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computational-methods-for-fleet-scheduling-in-e-mobility/</loc><lastmod>2021-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2021-07-02-jan-dreier-receives-a-lics21-distinguished-paper-award/</loc><lastmod>2021-07-02T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2021-06-16-lecture-at-austrian-parliament/</loc><lastmod>2021-06-16T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2021-06-14-promotio-sub-auspiciis-praesidentis-rei-publica/</loc><lastmod>2021-06-14T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benjamin-schaden/</loc><lastmod>2021-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/scheduling-the-charging-of-electric-vehicles-with-soc-dependent-maximum-charging-power/</loc><lastmod>2021-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/giulio-pace/</loc><lastmod>2021-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/randomized-construction-approaches-to-the-traveling-tournament-problem-using-lower-bound-based-heuristics/</loc><lastmod>2021-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/-means/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/-median/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication-type/5/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/adrian-bracher/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anna-rapberger/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/approximate-evaluation-of-first-order-counting-queries/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/banik-aritra/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bettina-speckmann/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bojan-nikolic/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/certified-dqbf-solving-by-definition-extraction/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/clement-dallard/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/clustering/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-kemeny-rankings-from-d-euclidean-preferences/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cornelsen-sabine/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/crossing-optimal-extension-of-simple-drawings/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/destroying-bicolored-p-3-s-by-deleting-few-edges/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/disjoint-box-covering-in-a-rectilinear-polygon/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/dragan-matic/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/driver-shift-planning-for-an-online-store-with-short-delivery-times/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/dynamic/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eduard-eiben-and-fedor-v.-fomin-and-petr-a.-golovach-and-william-lochet-and-fahad-panolan-and-kirill-simonov/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/engineering-an-efficient-boolean-functional-synthesis-engine/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/external-labeling-fundamental-concepts-and-algorithmic-techniques/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fabian-klute/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fedor-v.-fomin/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-the-hardest-formulas-for-resolution/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-the-hardest-formulas-for-resolution-extended-abstract/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/first-order-logic-in-finite-domains-where-semantic-evaluation-competes-with-smt-solving/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-tractability/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/geiger-jakob/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/geometric-planar-networks-on-bichromatic-collinear-points/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/graphs-with-at-most-two-moplexes/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/graphs-with-two-moplexes/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/grbic-milana/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hardness-and-optimality-in-qbf-proof-systems-modulo-np/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/henry-forster/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/iyad-kanj-and-sebastian-ordyniak/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jacobsen-ben/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/juri-buchmuller/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kartelj-aleksandar/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kevin-verbeek/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/labeling-nonograms-boundary-labeling-for-curve-arrangements/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lacon-and-shrub-decompositions-a-new-characterization-of-first-order-transductions-of-bounded-expansion-classes/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/layered-area-proportional-rectangle-contact-representation/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-fast-inference-bayesian-networks/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/marko-samer/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-lackner/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-milanic/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matic-dragan/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matjaz-krnc/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-horn/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mchedlidze-tamara/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/meike-hatzel/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metrosets-visualizing-sets-as-metro-maps/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/new-width-parameters-for-sat-and-sharp-sat/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/niedermann-benjamin/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/niels-gruttemeier-and-christian-komusiewicz-and-jannik-schestag-and-frank-sommer/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/niels-gruttemeier-and-christian-komusiewicz-and-nils-morawietz-and-frank-sommer/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nikolic-bojan/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/okamoto-yoshio/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-strict-outer-confluent-graphs/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-readability-of-abstract-set-visualizations/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/parameterized-complexity/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-of-small-decision-tree-learning/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-k-clustering-tractability-island/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/performance-prediction/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/petr-a.-golovach/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/preventing-small-s-t-cuts-by-protecting-edges/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/priyanka-golia-and-friedrich-slivovsky-and-subhajit-roy-and-kuldeep-s.-meel/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proof-complexity-of-symbolic-qbf-reasoning/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/route-duration-prediction-in-a-stochastic-and-dynamic-vehicle-routing-problem-with-short-delivery-deadlines/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-modulo-symmetries-for-graph-generation/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sayan-bandyapadhyay-and-fedor-v.-fomin-and-kirill-simonov/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schaden-benjamin/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/stable-visual-summaries-for-trajectory-collections/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-mengel-and-friedrich-slivovsky/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/stochastic-vrp-with-time-windows/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strong-d-qbf-dependency-schemes-via-implication-free-resolution-paths/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-object-association-in-multiple-object-tracking/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-clustering-incomplete-data/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-connected-fair-division/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thekla-hamm/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tobias-rodemann/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/turbocharging-treewidth-bounded-bayesian-network-structure-learning/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/two-new-mixed-integer-linear-programming-models-for-solving-the-multidimensional-multi-way-number-partitioning-problem/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/weighted-least-squares/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wolfgang-schreiner-and-franz-xaver-reichl/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wouter-meulemans/</loc><lastmod>2021-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-12-17-martin-nollenburg-promotion-to-full-professor/</loc><lastmod>2020-12-17T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/casual-employee-scheduling-with-constraint-programming-and-metaheuristics/</loc><lastmod>2020-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stephan-teuschl/</loc><lastmod>2020-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-10-23-martin-kronegger-wins-the-best-teaching-award-2020/</loc><lastmod>2020-10-23T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-10-12-welcome-to-our-feodor-lynen-fellow-dr-manuel-sorge/</loc><lastmod>2020-10-12T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-10-01-tu-wien-students-excel-at-the-2020-graph-drawing-contest/</loc><lastmod>2020-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-09-11-best-paper-award-at-cp2020/</loc><lastmod>2020-09-11T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-06-17-robert-ganian-receives-an-fwf-start-prize/</loc><lastmod>2020-06-17T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christoph-berger/</loc><lastmod>2020-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-a-generalized-constrained-longest-common-subsequence-problem/</loc><lastmod>2020-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benedikt-klocker/</loc><lastmod>2020-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combinatorial-optimization-approaches-for-graph-construction-problems/</loc><lastmod>2020-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-03-16-new-phd-fabian-klute/</loc><lastmod>2020-03-16T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-03-03-new-phd-benedikt-klocker/</loc><lastmod>2020-03-03T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/heuristische-optimierungsverfahren-fur-die-koordinierung-von-flughafenslots/</loc><lastmod>2020-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simeon-kuran/</loc><lastmod>2020-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/updates/2020-01-27-soeren-nickel-wins-the-distinguished-young-alumn-award/</loc><lastmod>2020-01-27T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-beam-search-approach-to-the-traveling-tournament-problem/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-double-horizon-approach-to-a-purely-dynamic-and-stochastic-vehicle-routing-problem-with-delivery-deadlines-and-shift-flexibility/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-faster-algorithm-for-propositional-model-counting-parameterized-by-incidence-treewidth/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-large-neighborhood-search-for-distributing-service-points-in-mobility-applications-with-capacities-and-limited-resources/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-survey-on-transit-map-layout-from-design-machine-and-human-perspectives/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-time-leap-challenge-for-sat-solving/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-unified-model-and-algorithms-for-temporal-map-labeling/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alberto-santini/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ankit-shukla/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/biedl-therese/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/breaking-symmetries-with-rootclique-and-lextopsort/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/building-large-k-cores-from-sparse-graphs/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/chaplick-steven/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-blum/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/chu-min-li/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complexity-of-independency-and-cliquy-trees/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-optimal-hypertree-decompositions/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/crossing-layout-in-non-planar-graphs/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/danil-sagunov/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/distributing-battery-swapping-stations-for-electric-scooters-in-an-urban-area/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eduard-eiben-and-fedor-v.-fomin-and-fahad-panolan-and-kirill-simonov/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eiben-eduard/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exploiting-similar-behavior-of-users-in-a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/extending-partial-1-planar-drawings/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fahad-panolan/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/felipe-manya/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-longest-common-subsequences-new-anytime-a-search-results/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/first-order-model-checking-in-random-graphs-and-complex-networks/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixcon-a-generic-solver-for-fixed-cardinality-subgraph-problems/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/foreword-eighth-workshop-on-graph-classes-optimization-and-width-parameters-toronto-ontario-canada/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/formalizing-graph-trail-properties-in-isabelle-hol/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/frank-sommer-and-christian-komusiewicz/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/galvao-marcelo/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gemsa-andreas/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/geometric-planar-networks-on-bichromatic-points/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hard-problems-on-random-graphs/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hard-qbfs-for-merge-resolution/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/henri-lotze/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/horn-matthias/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hua-jiang/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/interpolation-based-semantic-gate-extraction-and-its-applications-to-qbf-preprocessing/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-klaus-fichte-and-markus-hecher-and-andre-schidler/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-klaus-fichte-and-norbert-manthey-and-julian-stecklina-and-andre-schidler/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/krukar-jakub/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/labeling-nonograms/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/layered-fan-planar-graph-drawings/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/manipulating-districts-to-win-elections-fine-grained-complexity/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/maschler-johannes/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/matheuristics/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-schlaipfer-and-friedrich-slivovsky-and-georg-weissenbacher-and-florian-zuleger/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/maximum-shallow-clique-minors-in-preferential-attachment-graphs-have-polylogarithmic-size/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/maxsat-based-postprocessing-for-treedepth/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/merging-quality-estimation-for-binary-decision-diagrams-with-binary-classifiers/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/mixed-integer-linear-programming/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multi-linear-strategy-extraction-for-qbf-expansion-proofs-via-local-soundness/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/oberweger-fabio-f./</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-clustering/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-book-embedding-problems/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-module-map-problems/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/particle-therapy/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-rossmanith/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/philipp-kuinke/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/placing-labels-in-road-maps-algorithms-and-complexity/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/purchase-helen-c./</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/raftopoulou-chrysanthi/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/resource-constrained-project-scheduling/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/riedler-martin/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/roberts-maxwell-j./</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/route-schematization-with-landmarks/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schwering-angela/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/short-q-resolution-proofs-with-homomorphisms/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-steiner-tree-problem-with-few-terminals/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/string-factorizations-under-various-collision-constraints/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strong-d-qbf-dependency-schemes-via-tautology-free-resolution-paths/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/takahashi-shigeo/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-landscape-of-resource-constrained-scheduling/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-turing-test-for-graph-drawing-algorithms/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/time-bucket-relaxation/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-data-driven-multilinear-metro-maps/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-faster-reasoners-by-using-transparent-huge-pages/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/using-decomposition-parameters-for-qbf-mind-the-prefix/</loc><lastmod>2020-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem/</loc><lastmod>2019-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-kaufmann/</loc><lastmod>2019-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benjamin-schwendinger/</loc><lastmod>2019-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/perfect-pseudo-matchings-on-snarks/</loc><lastmod>2019-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/metaheuristic/</loc><lastmod>2019-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/scheduling/</loc><lastmod>2019-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging/</loc><lastmod>2019-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-heuristic-approach-to-aircraft-trajectory-optimization-with-constraints/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithmic-approaches-for-optimization-problems-in-bike-sharing-and-security-control/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-windbichler/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/automated-calculation-of-optimal-adjustment-parameters-for-myoelectric-hand-prostheses/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/bbss/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-kloimullner/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/facilitylocation/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-maschler/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/lbbd/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/patient-scheduling-in-particle-therapy/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/planbiss/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/rose/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sigrid-gerger/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/vehiclerouting/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/vns/</loc><lastmod>2019-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points/</loc><lastmod>2019-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-for-competitive-facility-location-problems/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-novel-approach-for-solving-large-scale-bike-sharing-station-planning-problems/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-sat-approach-to-branchwidth/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/approximation-algorithms-for-balancedcc-multiwinner-rules/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/barth-lukas/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benjamin-biesinger/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bin-hu/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bjoern-tauer/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/blaicher-matthias/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/c.-s.-rahul/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/castermans-thom/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/casual-employee-scheduling-with-constraint-programming-and-ant-colony-optimization/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/charilaos-tzovas/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/chimani-markus/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-resolution-path-dependencies-with-dependency-learning/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-stable-demers-cartograms/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel~paulusma/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/de-col-philipp/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/de-luca-felice/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/dependency-learning-for-qbf/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/didimo-walter/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/dusan-knop-and-sebastian-ordyniak/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/efficient-non-segregated-routing-for-reconfigurable-demand-aware-networks/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/efficient-segment-folding-is-hard/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/elina-ronnberg/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ernst-andreas-t./</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eugenio-angriman/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/evolcomp/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exploring-semi-automatic-map-labeling/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/external-labeling-techniques-a-taxonomy-and-survey/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-linear-arrangements-of-hypergraphs-with-bounded-cutwidth-in-linear-time/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-longest-common-subsequences-new-a-anytime-results/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/freude-wolfgang/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/group-activity-selection-with-few-agent-types/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/guidelines-for-experimental-algorithmics-a-case-study-in-network-analysis/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hardness-of-fo-model-checking-on-random-graphs/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/henning-meyerhenke/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/herbert-fleischner/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hoffmann-ostenhof-arthur/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hofmann-andreas/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hoose-tobias/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/horiyama-takashi/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hummel-matthias/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hung-lung-wang/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/hybrid/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/integer-programming-and-incidence-treedepth/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakob-puchinger/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jan-obdrz%5Clek/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/janosch-fuchs/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jaroslav-nesetril/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kirill-simonov-and-fedor-v.-fomin-and-petr-a.-golovach-and-fahad-panolan/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/klaus-tycho-foerster/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/koos-christian/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kutuvantavida-yasar/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lauermann-matthias/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/loffler-raphael/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lombardi-drawings-of-knots-and-links/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/long-distance-q-resolution-with-dependency-schemes/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/maria-predari/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mario-ruthmair/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-brill-and-piotr-faliszewski-and-frank-sommer-and-nimrod-talmon/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-kronegger/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-riedler/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metabopolis-scalable-network-layout-for-biological-pathway-diagrams-in-urban-map-style/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristic-hybrids/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/mip/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/mixed-linear-layouts-complexity-heuristics-and-experiments/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/motif-counting-in-preferential-attachment-graphs/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/neha-lodha/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nesic-aleksandar/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-k-s-sat/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-readability-of-leaders-in-boundary-labeling/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/packing/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-of-asynchronous-border-minimization/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/pcjsocmsr/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/petr-hlinen-y/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/photonic-integrated-circuits-with-non-planar-topologies-realized-by-3d-printed-waveguide-overpasses/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/planar-drawings-of-fixed-mobile-bigraphs/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proof-complexity-of-fragments-of-long-distance-q-resolution/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/randel-sebastian/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/refined-complexity-of-pca-with-outliers/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-encodings-for-treecut-width-and-treedepth/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schmidt-manuela/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/short-plane-supports-for-spatial-hypergraphs/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/shrub-depth-capturing-height-of-dense-graphs/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/snarks-with-special-spanning-trees/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-integer-linear-programs-by-exploiting-variable-constraint-interactions-a-survey/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-integer-quadratic-programming-via-explicit-and-structural-restrictions/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sousa-filipa-l./</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-schmid/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strategies-for-iteratively-refining-layered-graph-models/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-packing-edge-disjoint-paths/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thiruvady-dhananjay/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-fenz/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tim-a.-hartmann/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tollis-ioannis/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-improving-merging-heuristics-for-binary-decision-diagrams/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/van-der-grinten-alexander/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/van-garderen-mereke/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/vogtenhuber-birgit/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/von-looz-moritz/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/yamanaka-katsuhisa/</loc><lastmod>2019-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/advances-in-decomposition-approaches-for-mixed-integer-linear-programming/</loc><lastmod>2018-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/methods-for-intraday-scheduling-in-particle-therapy/</loc><lastmod>2018-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michael-hofler/</loc><lastmod>2018-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/vrp/</loc><lastmod>2018-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/abraham-hinteregger/</loc><lastmod>2018-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/blockchain/</loc><lastmod>2018-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/local-search-methods-for-the-particle-therapy-patient-scheduling-problem/</loc><lastmod>2018-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/monero-chross-chain-traceability/</loc><lastmod>2018-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-hackl/</loc><lastmod>2018-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/software/82-software-frasmt/</loc><lastmod>2018-08-26T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/software/</loc><lastmod>2018-08-26T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/software/</loc><lastmod>2018-08-26T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gajo-gajic/</loc><lastmod>2018-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parallel-hybrid-metaheuristics-for-solving-the-firefighter-problem-using-the-gpu/</loc><lastmod>2018-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/software/81-software-branchlis/</loc><lastmod>2018-01-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-model-for-finding-transition-minors/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-sat-approach-for-finding-sup-transition-minors/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-structural-approach-to-activity-selection/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-visual-comparison-of-hand-drawn-and-machine-generated-human-metabolic-pathways/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/airam-exposito/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-a-algorithm-for-solving-a-prize-collecting-sequencing-problem-with-one-common-and-multiple-secondary-resources-and-time-windows/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-smt-approach-to-fractional-hypertree-width/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anita-graser/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/argyriou-evmorfia/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/bikesharing/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/branch-and-bound/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/cancer-treatment/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-rudloff/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/combinatorial-optimization/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/dndpr/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/duncan-christian-a./</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/exact/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-approaches-for-the-directed-network-design-problem-with-relays/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/experimental-evaluation-of-book-drawing-algorithms/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/felix-beyer/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-smooth-graphs-with-small-independence-numbers/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/forster-henry/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/frasmt/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/froschl-theresa/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/graph-visualization/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/grasp-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hoos-holger-h./</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hu-yifan/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/hybrid-metaheuristic/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/incremental-refinement/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/iterated-greedy-metaheuristic/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ivana-ljubic/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/julio-brito-and-jose-a.-moreno-perez/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/klawitter-jonathan/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/klocker-benedikt/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-applications/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/luana-micallef/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-leitner/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-pajones/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-straub/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/meta-kernelization-using-well-structured-modulators/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/metaheuristics/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/meyerhenke-henning/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimzing-wiggles-in-storyline-visualizations/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/multivalued-decision-diagrams/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multivalued-decision-diagrams-for-a-prize-collecting-sequencing-problem/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/networks/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-complexity-of-rainbow-coloring-problems/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-the-matrix-completion-problem/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/particle-therapy-patient-scheduling/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/particle-therapy-patient-scheduling-with-limited-starting-time-variations-of-daily-treatments/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/patrignani-maurizio/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-rodgers/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/planar-and-poly-arc-lombardi-drawings/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/planar-l-drawings-of-directed-graphs/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/polynomial-time-validation-of-qcdcl-certificates/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/portfolio-solvers-for-qdimacs-and-qcir/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/portfolio-based-algorithm-selection-for-circuit-qbfs/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/qbf-encodings-of-chess-problems/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/scalable-set-visualizations-dagstuhl-seminar-17332/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schulz-christian/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/semi-automated-location-planning-for-urban-bike-sharing-systems/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/sequencing/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/slivovsky-friedrich/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/small-resolution-proofs-for-qbf-using-dependency-treewidth/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/smooth-graphs/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-problems-on-graphs-of-high-rank-width/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tollis-ioannis-g./</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-characterizing-strict-outerconfluent-graphs/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/unary-integer-linear-programming-with-structural-restrictions/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/xtract/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/yifan-hu/</loc><lastmod>2018-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/software/80-software-qute/</loc><lastmod>2017-11-30T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-iterative-time-bucket-refinement-algorithm-for-high-resolution-scheduling-problems/</loc><lastmod>2017-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-linear-time-parameterized-algorithm-for-node-unique-label-cover/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-logic-based-benders-decomposition-approach-for-the-3-staged-strip-packing-problem/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anirban-dasgupta/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoor-sets-for-csp/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoor-trees-for-answer-set-programming/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoor-treewidth-for-sat/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/backdoors-to-satisfiability/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/baharak-rastegari/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/balancing-bike-sharing-systems/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/branch-and-check/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bruckdorfer-till/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/circuit-treewidth-sentential-decision-and-query-compilation/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-treewidth-and-backdoors-for-csp/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/compile/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complexity-results-for-aggregating-judgments-using-scoring-or-distance-based-procedures/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-judgment-aggregation-procedure/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cosmin-sabo/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/crowdsourcing-versus-the-laboratory-towards-human-centered-experiments-using-the-crowd/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lokshtanov-and-fahad-panolan-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/de-haan-ronald/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/diego-valota/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/drpsc/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/efficient-consideration-of-soft-time-windows-in-a-large-neighborhood-search-for-the-districting-and-routing-problem-for-security-control/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/egger-lampl-sebastian/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/euclidean-greedy-drawings-of-trees/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/evelia-lizarraga/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fabio-mogavero/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/faster-exact-algorithms-for-some-terminal-set-problems/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/felix-reidl/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fisher-brian/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/frederico-dusberger/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/free-weak-nilpotent-minimum-algebras/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/full-load-route-planning-for-balancing-bike-sharing-systems-by-logic-based-benders-decomposition/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gadiraju-ujwal/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/going-beyond-primal-treewidth-for-m-ilp/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/graph-bipartization/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/graph-separation-problems/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/grasp-and-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gregory-gutin/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gutwenger-carsten/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/haris-aziz/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/herbrand-property-finite-quasi-herbrand-models-and-lifting-chandra-merlin-theorem-to-quantified-conjunctive-queries/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hierarchical-clustering-and-multilevel-refinement-for-the-bike-sharing-station-planning-problem/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hitting-selected-odd-cycles/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/how-many-variables-are-needed-to-express-an-existential-positive-query/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-gajarsky-and-petr-hlineny-and-jan-obdrzalek-and-sebastian-ordyniak-and-felix-reidl-and-peter-rossmanith-and-fernando-sanchez-villaamil-and-somnath-sikdar/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jayesh-choudhari/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kanj-iyad/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kim-bong-min/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kloimullner-christian/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/large-neighborhood-search-for-the-most-strings-with-few-bad-columns-problem/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/linear-representation-of-transversal-matroids-and-gammoids-parameterized-by-rank/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/lns/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/logic-based-benders-decomposition/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lossy-kernelization/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/m.-s.-ramanujan/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/magnus-wahlstrom/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/maria-j.-blesa/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/marija-slavkovik/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mark-jones-and-daniel-lokshtanov-and-m.-s.-ramanujan-and-saket-saurabh-and-ondrej-suchy/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metric-dimension-of-bounded-tree-length-graphs/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/moller-sebastian/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/moritz-muller/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/neeldhara-misra/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/new-width-parameters-for-model-counting/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nicholas-mattei-and-baharak-rastegari/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-classes-beyond-para-np/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pareto-optimal-allocation-under-uncertain-preferences/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pareto-optimal-allocation-under-uncertain-preferences-extended-abstract/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/particle-therapy-patient-scheduling-time-estimation-to-schedule-sets-of-treatments/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/path-contractions-edge-deletions-and-connectivity-preservation/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-bir%5C-and-tamas-fleiner/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/petrica-c.-pop/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/pickup-delivery/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pranabendu-misra/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/progress-on-partial-edge-drawings/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/radial-contour-labeling-with-straight-leaders/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rajesh-chitnis-and-fedor-v.-fomin-and-daniel-lokshtanov-and-pranabendu-misra-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ramanujan-m.-s./</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/recent-trends-in-knowledge-compilation-dagstuhl-seminar-17381/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/remy-belmonte-and-fedor-v.-fomin-and-petr-a.-golovach-and-m.-s.-ramanujan/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/rigging-nearly-acyclic-tournaments-is-fixed-parameter-tractable/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ronald-de-haan/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/saket-saurabh/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sat-encodings-for-special-treewidth-and-pathwidth/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/saupe-dietmar/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/saving-critical-nodes-with-firefighters-is-fpt/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/serge-gaspers/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-two-state-fixed-charge-transportation-problem-with-a-hybrid-genetic-algorithm/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/stable-matching-with-uncertain-pairwise-preferences/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefano-aguzzoli/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-treewidth-of-proofs/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/traveling-salesman-problem/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/vehicle-routing/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/vnd/</loc><lastmod>2017-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristics-for-the-districting-and-routing-problem-for-security-control/</loc><lastmod>2016-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michael-prischink/</loc><lastmod>2016-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complete-solution-archives-for-evolutionary-combinatorial-optimization-application-to-a-competitive-facility-location-and-stochastic-vehicle-routing-problem/</loc><lastmod>2016-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/column-generation-at-strip-level-for-the-k-staged-two-dimensional-cutting-stock-problem/</loc><lastmod>2016-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/cutting/</loc><lastmod>2016-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/franz-leberl/</loc><lastmod>2016-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-branch-and-bound-approach-for-the-constrained-k-staged-2-dimensional-cutting-stock-problem/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-faster-parameterized-algorithm-for-group-feedback-edge-set/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-multi-commodity-flow-based-model-for-multi-layer-hierarchical-ring-network-design/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-new-perspective-on-fo-model-checking-of-dense-graph-classes/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-parameterized-algorithm-for-mixed-cut/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/adjacency-preserving-spatial-treemaps/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-algorithmic-framework-for-labeling-road-maps/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-integer-l-shaped-method-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/are-there-any-good-digraph-measures/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/arne-meier/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ashutosh-rai-and-m.-s.-ramanujan/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ashutosh-rai-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-for-linear-temporal-logic/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-q-horn/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-tractable-valued-csp/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bernhard-bliem-and-sebastian-ordyniak-and-stefan-woltran/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bernhard-bonigl/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/buchin-kevin/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/c.s.-rahul/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/carina-schwab/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-schauer/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/clique-width-and-directed-width-measures-for-answer-set-programming/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complexity-and-monotonicity-results-for-domination-games/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-procedure-in-judgment-aggregation/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/consistent-labeling-of-rotating-maps/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/counting-linear-extensions-parameterizations-by-treewidth/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-kr%5Cal/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-meister/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-paulusma/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/darp/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/directed-elimination-games/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/districting-and-routing-for-security-control/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/edge-editing-to-a-dense-and-a-sparse-graph-class/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evaluation-of-labeling-strategies-for-rotating-maps/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/extending-convex-partial-drawings-of-graphs/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fo-model-checking-of-interval-graphs/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/grasp/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/guillaume-blin-and-marie-gasparoux-and-sebastian-ordyniak-and-alexandru-popa/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/holten-danny/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hoong-chuin-lau/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-metaheuristics-powerful-tools-for-optimization/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/ig/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/irena-schindler/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-gajarsky-and-petr-hlineny-and-jan-obdrzalek-and-daniel-lokshtanov-and-m.-s.-ramanujan/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-teska/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jan-obdrz%5Cek/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jarett-schwartz/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jerome-lang/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/joachim-kneis/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-infuhr/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/knowledge-compilation-meets-communication-complexity/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kustaa-kangas/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/m.s.-ramanujan/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/manu-basavaraju-and-mathew-c.-francis-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-stock/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/meta-kernelization-with-structural-parameters/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michal-kotrbcik-and-rastislav-kralovic-and-sebastian-ordyniak/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/mixed-map-labeling/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/model-checking-existential-logic-on-partially-ordered-sets/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/n.s.-narayanaswamy/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/netdesign/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/new-developments-in-metaheuristics-and-their-applications-selected-extended-contributions-from-the-10th-metaheuristics-international-conference-mic-2013/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nicholas-mattei/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-existential-mso-and-its-relation-to-eth/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-complexity-landscape-of-connected-f-factor-problems/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-in-the-polynomial-hierarchy/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/partially-polynomial-kernels-for-set-cover-and-test-cover/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pascal-van-hentenryck/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-biro/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/petr-hlineny-and-o-joung-kwon-and-jan-obdrzalek-and-sebastian-ordyniak/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/polynomial-time-construction-of-optimal-mpi-derived-datatype-trees/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/positive-and-negative-results-for-parameterized-compilability/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proc-24th-international-symposium-on-graph-drawing-and-network-visualization-gd-16/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/ptpsp/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/quantified-conjunctive-queries-on-partially-ordered-sets/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/quantifier-reordering-for-qbf/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ramanujan-m.-s./</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ramanujan-sridharan/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schuhmacher-alfred/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sdds-are-exponentially-more-succinct-than-obdds/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sebastian-ordyniak-and-m.-s.-ramanujan/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/silveira-rodrigo-i./</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova-and-florent-capelli-and-stefan-mengel-and-friedrich-slivovsky/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sobra-shielding-optimization-for-brachytherapy/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/software-visualization-via-hierarchic-micro-macro-layouts/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/solarch/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/somnath-sikdar/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/soundness-of-q-resolution-with-dependency-schemes/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/staals-frank/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/stable-matching-with-uncertain-linear-preferences/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stephan-kreutzer-and-sebastian-ordyniak/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/strash-darren/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strict-confluent-drawing/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strong-parameterized-deletion-bipartite-graphs/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/succinctness-of-languages-for-judgment-aggregation/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/temporal-map-labeling-a-new-unified-framework-with-experiments/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/tree-depth-and-vertex-minors/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ulle-endriss/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/umberto-grandi/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/verbeek-kevin/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/viktor-engelmann-and-sebastian-ordyniak-and-stephan-kreutzer/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/visibility-based-obstacle-placing-automated-obstacle-placing-based-on-circularity/</loc><lastmod>2016-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christoph-wachter/</loc><lastmod>2015-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-travelling-thief-problem-with-an-evolutionary-algorithm/</loc><lastmod>2015-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/electric-vehicles-recharge-scheduling-with-logic-based-benders-decomposition/</loc><lastmod>2015-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/katharina-olsbock/</loc><lastmod>2015-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimization-approaches-for-recreational-bicycle-tour-planning/</loc><lastmod>2015-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bacher-christopher/</loc><lastmod>2015-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/krenek-thorsten/</loc><lastmod>2015-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lauer-thomas/</loc><lastmod>2015-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/numerical-optimisation-of-electro-hybrid-powertrains/</loc><lastmod>2015-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/numerische-optimierung-elektrifizierter-antriebsstrange/</loc><lastmod>2015-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/resources/90-resource-instances/</loc><lastmod>2015-02-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/resources/</loc><lastmod>2015-02-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/resources/</loc><lastmod>2015-02-24T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-cluster-first-route-second-approach-for-balancing-bicycle-sharing-systems/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-complete-parameterized-complexity-analysis-of-bounded-planning/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-dichotomy-result-for-ramsey-quantifiers/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-genetic-algorithm-for-the-capacity-and-distance-constrained-plant-location-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-new-solution-representation-for-the-firefighter-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-sat-approach-to-clique-width/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-value-correction-construction-heuristic-for-the-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-variable-neighborhood-search-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alan-tus/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-overview-of-non-uniform-parameterized-complexity/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andrea-rendl/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-pfandler/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreev-simeon/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-normality-for-disjunctive-logic-programs/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-tractable-answer-set-programming/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/backstrom-christer/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bekos-michael/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bernhard-bliem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/brandes-ulrik/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christoph-weiler/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christopher-bacher/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/community-structure-inspired-algorithms-for-sat-and-sat/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/complexity-of-the-winner-determination-problem-in-judgment-aggregation-kemeny-slater-tideman-young/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-secure-sets-in-graphs-using-answer-set-programming/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cpu-versus-gpu-parallelization-of-an-ant-colony-optimization-for-the-longest-common-subsequence-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lokshtanov-and-amer-e.-mouawad-and-fahad-panolan-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lokshtanov-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/david-markvica-christian-schauer/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/decomposition-based-hybrid-metaheuristics/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/dibbelt-julian/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/empirical-evaluation-for-graph-drawing-dagstuhl-seminar-15052/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/esha-ghosh-and-sudeshna-kolay-and-mrinal-kumar-and-pranabendu-misra-and-fahad-panolan-and-ashutosh-rai-and-m.-s.-ramanujan/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-approaches-for-network-design-problems-with-relays/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fahad-panolan-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/faster-parameterized-algorithms-for-deletion-to-split-graphs/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fedor-v.-fomin-and-daniel-lokshtanov-and-neeldhara-misra-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/finocchi-irene/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/first-order-queries-on-finite-abelian-groups/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-tractable-reductions-to-sat-for-planning/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fo-model-checking-on-posets-of-bounded-width/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/georg-brandstatter/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gerhard-hiermann/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gunther-charwat/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hu-bin/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improving-the-efficiency-of-dynamic-programming-on-tree-decompositions-via-machine-learning/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improving-vertex-cover-as-a-graph-parameter/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-gajarsky-and-michael-lampis-and-kazuhisa-makino-and-valia-mitsou-and-sebastian-ordyniak/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-gajarsky-and-petr-hlineny-and-daniel-lokshtanov-and-jan-obdrzalek-and-sebastian-ordyniak-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-szymanik/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/johannes-klaus-fichte/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jonsson-peter/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/label-placement-in-road-maps/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/leibfried-thomas/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/linear-time-parameterized-algorithms-for-subset-feedback-vertex-set/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/many-to-one-boundary-labeling-with-backbones/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-lanzinger/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-prandtstetter/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristics-for-the-two-dimensional-container-pre-marshalling-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metric-dimension-of-bounded-width-graphs/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/meyer-hubner-nico/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michael-abseher/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multi-row-boundary-labeling-algorithms-for-panorama-images/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/ndpr/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nysret-musliu/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-compiling-cnfs-into-structured-deterministic-dnnfs/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-compiling-structured-cnfs-to-obdds/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-finding-optimal-polytrees/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-minimizing-crossings-in-storyline-visualizations/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-solving-the-most-strings-with-few-bad-columns-problem-an-ilp-model-and-heuristics/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-comparison-of-decoding-strategies-for-a-memetic-algorithm-for-the-multi-layer-hierarchical-ring-network-design-problem/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-girth-and-connectivity-problems-on-linear-matroids/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-readability-of-boundary-labeling/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/operating-power-grids-with-few-flow-control-buses/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pajor-thomas/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/papazek-petrina/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-parity-games/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-and-subexponential-time-complexity-of-satisfiability-problems-and-applications/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/petrina-papazek/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/polishchuk-valentin/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/quigley-aaron/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rainer-harbach-marian/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/recognizing-weighted-disk-contact-graphs/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/reconfiguration-on-sparse-graphs/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sanders-peter/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova-and-barnaby-martin/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova-and-friedrich-slivovsky/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-d-sat-via-backdoors-to-small-treewidth/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-3-staged-2-dimensional-cutting-stock-problem-by-dynamic-programming-and-variable-neighborhood-search/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-multi-objective-steiner-tree-problem-with-resources/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-equivalence-entailment-and-minimization-in-existential-positive-logic/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thorsten-krenek/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-realistic-flow-control-in-power-grid-operation/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/towards-realistic-pedestrian-route-planning/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ueckerdt-torsten/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-deletion-backdoors-to-planning/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wagner-dorothea/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wegner-franziska/</loc><lastmod>2015-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/heuristic-solution-approaches-for-the-two-dimensional-pre-marshalling-problem/</loc><lastmod>2014-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/patrick-klaffenboeck/</loc><lastmod>2014-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pfadsuche-in-einer-triangulation-reduction-im-mammoth-massive-multiplayer-online-research-framework/</loc><lastmod>2014-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-survey-on-automated-metro-map-layout-methods/</loc><lastmod>2014-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-hybrid-algorithm-for-the-partition-coloring-problem/</loc><lastmod>2014-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/applying-ant-colony-optimization-to-the-periodic-vehicle-routing-problem-with-time-windows/</loc><lastmod>2014-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/david-markvica/</loc><lastmod>2014-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/dietmar-trummer/</loc><lastmod>2014-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-longest-common-subsequences-by-gpu-based-parallel-ant-colony-optimization/</loc><lastmod>2014-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gilbert-fritz/</loc><lastmod>2014-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-metaheuristic-approach-for-integrated-timetable-based-design-of-railway-infrastructure/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-efficient-variable-neighborhood-search-solving-a-robust-dynamic-facility-location-problem-in-emergency-service-network/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/athenstadt-jan-christoph/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-planning/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/besau-gerhard/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/blasius-thomas/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/boosting-an-exact-logic-based-benders-decomposition-approach-by-variable-neighborhood-search/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lokshtanov-and-n.-s.-narayanaswamy-and-venkatesh-raman-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/digraph-width-measures-in-parameterized-algorithmics/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/dwyer-tim/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fabrikant-sara-irina/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/faster-existential-fo-model-checking-on-posets/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/faster-parameterized-algorithms-using-linear-programming/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finite-integer-index-of-pathwidth-and-treewidth/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-tractable-reductions-to-sat/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gaspers-serge/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/geevarghese-philip-and-m.-s.-ramanujan/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/grujicic-igor/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/guarantees-and-limits-of-preprocessing-in-constraint-satisfaction-and-reasoning/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hartmann-tanja/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hurter-christophe/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/hybrid-electric-vehicles-hybrid-metaheuristics-search-space-discretization-metamodels/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/igor-grujicic/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/iyad-a.-kanj/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-gajarsky-and-jan-obdrzalek-and-sebastian-ordyniak-and-felix-reidl-and-peter-rossmanith-and-fernando-sanchez-villaamil-and-somnath-sikdar/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakub-gajarsky-and-petr-hlineny-and-jan-obdrzalek-and-sebastian-ordyniak/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jankun-kelly-t.-j./</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lubiw-anna/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/manu-basavaraju-and-fahad-panolan-and-ashutosh-rai-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/manu-basavaraju-and-fedor-v.-fomin-and-petr-a.-golovach-and-pranabendu-misra-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimum-tree-supports-for-hypergraphs-and-low-concurrency-euler-diagrams/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-kernelization-complexity-of-string-problems/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-to-preserve-connectivity/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-approximations-via-d-skew-symmetric-multicut/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/pigra-a-tool-for-pixelated-graph-representations/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/reducing-the-number-of-simulations-in-operation-strategy-optimization-for-hybrid-electric-vehicles/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/scalability-considerations-for-multivariate-graph-visualization/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schobel-andreas/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sebastian-ordyniak-and-alexandru-popa/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova-and-leonardo-manuel-cabrer/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/simultaneous-embeddability-of-two-partitions/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/small-unsatisfiable-subsets-in-constraint-satisfaction/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/squarcella-claudio/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-miskovic/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/subexponential-time-complexity-of-csp-with-global-constraints/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sudeshna-kolay-and-pranabendu-misra-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-width-minimization-for-existential-positive-queries/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-reasoning-problems-beyond-np/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-baumhauer/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/unification-and-projectivity-in-de-morgan-and-kleene-algebras/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-dependencies-and-q-resolution/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighbourhood-search-for-integrated-timetable-design-of-railway-infrastructure/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/vertex-exponential-algorithms-for-connected-f-factors/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/weaver-chris/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/xu-kai/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/zorica-stanimirovic/</loc><lastmod>2014-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-pinter/</loc><lastmod>2013-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/balancing-bike-sharing-systems/</loc><lastmod>2013-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/roman-karl/</loc><lastmod>2013-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-rooted-delay-constrained-steiner-tree-problem-with-uncertain-delays/</loc><lastmod>2013-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-petelin/</loc><lastmod>2013-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/two-phase-local-search-for-the-bi-objective-connected-facility-location-problem/</loc><lastmod>2013-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/infuhr-johannes/</loc><lastmod>2013-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimization-challenges-of-the-future-federated-internet/</loc><lastmod>2013-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/analyse-und-implementierung-von-fallzusammenfuhrungen-diagnosebezogener-fallgruppen-aus-sicht-eines-krankenhausinformationssystems/</loc><lastmod>2013-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-putzenlechner/</loc><lastmod>2013-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristic-optimization-of-electro-hybrid-powertrains-using-machine-learning-techniques/</loc><lastmod>2013-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/claus-dieter-volko/</loc><lastmod>2013-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/critical-links-detection-using-cuda/</loc><lastmod>2013-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/selective-graph-coloring-problem/</loc><lastmod>2013-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-schnabl/</loc><lastmod>2013-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristics-for-the-regenerator-location-problem/</loc><lastmod>2013-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-jahrmann/</loc><lastmod>2013-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-unified-approach-to-polynomial-algorithms-on-graphs-of-bounded-bi-rank-width/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-optimization-model-for-integrated-timetable-based-design-of-railway-infrastructure/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-schobel/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anna-roubickova/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-abduction/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benoit-theriault/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/capturing-structure-in-hard-combinatorial-problems/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christer-backstrom/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/circular-arc-cartograms/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/clique-and-independent-set-based-grasp-approaches-for-the-regenerator-location-problem/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cops-and-robbers-remarks-and-problems/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lokshtanov-and-neeldhara-misra-and-geevarghese-philip-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/david-stezenbach/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-graphs-and-maps-with-curves-dagstuhl-seminar-13151/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-metro-maps-using-bezier-curves/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-planar-graphs-with-a-prescribed-inner-face/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/edge-weighted-contact-representations-of-planar-graphs/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/enhancing-a-genetic-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/expanding-the-expressive-power-of-monadic-second-order-logic-on-restricted-graph-classes/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-tractability-of-workflow-satisfiability-in-the-presence-of-seniority-constraints/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gena-hahn-and-carsten-moldenauer/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gerhard-besau/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gorke-robert/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gottfried-schuster/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hamer-john/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hardness-of-r-dominating-set-on-graphs-of-diameter-r-1/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/haverkort-herman/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jason-crampton-and-robert-crowston-and-gregory-gutin-and-mark-jones-and-m.-s.-ramanujan/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kamper-jan-hinrich/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/krug-marcus/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kurt-tutschku/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/local-backbones/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/marian-rainer-harbach/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-vatshelle/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/matthias-hartmann/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michael-pimmer/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michel-boyer/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/model-counting-for-formulas-of-bounded-clique-width/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mumford-elena/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-subexponential-time-complexity-of-csp/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-usability-of-lombardi-graph-drawings/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimal-3d-angular-resolution-for-low-degree-graphs/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-and-exact-computation-8th-international-symposium-ipec-2013-sophia-antipolis-france-september-4-6-2013-revised-selected-papers/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-results-for-exact-bayesian-network-structure-learning/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-results-for-plan-reuse/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-jonsson-and-sebastian-ordyniak/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/planar-lombardi-drawings-of-outerpaths/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/polynomial-space-hardness-without-disjunction-property/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/pranabendu-misra-and-venkatesh-raman-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proceedings-of-the-10th-metaheuristics-international-conference/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/revisiting-space-in-proof-complexity-treewidth-and-pathwidth/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/schuhmann-julian/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sif-el-harti/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova-and-franco-montagna/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/stabilizing-branch-and-price-for-constrained-tree-problems/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-rummele/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strong-backdoors-to-bounded-treewidth-sat/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/teillaud-monique/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-constraint-satisfaction-and-reasoning/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tomas-gavenciak/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/trajectory-based-dynamic-map-labeling/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/upper-and-lower-bounds-for-weak-backdoor-set-detection/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/using-optimized-virtual-network-embedding-for-network-dimensioning/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/venkatesh-raman/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/visualizing-large-hierarchically-clustered-graphs-with-a-landscape-metaphor/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/werner-olz/</loc><lastmod>2013-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/extending-the-gecode-framework-with-interval-constraint-programming/</loc><lastmod>2012-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improving-the-protein-identification-performance-in-high-resolution-mass-spectrometry-data/</loc><lastmod>2012-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ivan-ivezic/</loc><lastmod>2012-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/philipp-gebhard/</loc><lastmod>2012-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-vehicle-routing-problem-with-compartments/</loc><lastmod>2012-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-sturm/</loc><lastmod>2012-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-multimodal-resource-constrained-project-scheduling-problems/</loc><lastmod>2012-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/bioinf/</loc><lastmod>2012-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/enhancing-an-evolutionary-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/</loc><lastmod>2012-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-metaheuristics-and-matheuristics-for-problems-in-bioinformatics-and-transportation/</loc><lastmod>2012-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristics-for-a-multimodal-home-health-care-scheduling-problem/</loc><lastmod>2012-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-solving-constrained-tree-problems-and-an-adaptive-layers-framework/</loc><lastmod>2012-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ruthmair-mario/</loc><lastmod>2012-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sandro-pirkwieser/</loc><lastmod>2012-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-and-a-solution-archive-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-variable-neighborhood-search-approach-for-the-two-echelon-location-routing-problem/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/abstract-argumentation-via-monadic-second-order-logic/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alfred-mayer/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithms-for-computing-the-maximum-weight-region-decomposable-into-elementary-shapes/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anders-yeo/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-chwatal/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/applying-hybrid-metaheuristics-to-fuel-consumption-optimization-of-hybrid-electric-vehicles/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/arezou-soleimanfallah/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/atienza-nieves/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-acyclic-sat/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoors-to-satisfaction/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/buchin-maike/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/byrka-jaroslaw/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/chun-jinhee/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/clemens-nothegger/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computational-models-of-argument-proceedings-of-comma-2012-vienna-austria-september-10-12-2012/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-resolution-path-dependencies-in-linear-time/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/cortes-carmen/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cover-contact-graphs/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lokshtanov-and-m.-s.-ramanujan/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/de-castro-natalia/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/description-logic-based-reasoning-on-programming-languages/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/don-t-be-strict-in-local-search/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-complete-binary-tanglegrams/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/editing-graphs-to-satisfy-degree-constraints-a-parameterized-approach/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/eun-jung-kim-and-sebastian-ordyniak/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finite-rdp-algebras-duality-coproducts-and-logic/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/garrido-m.-angeles/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gerhard-hiermann-and-jakob-puchinger/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/grima-clara-i./</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hernandez-gregorio/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/heuristics/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improved-packing-and-routing-of-vehicles-with-compartments/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jens-gottlieb/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/k-gap-interval-graphs/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kami%5C%C5%89ski-marcin-and-paulusma-daniel/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kaothanthong-natsuda/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/karol-suchan/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kasai-ryosei/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lewis-dichotomies-in-many-valued-logics/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lombardi-drawings-of-graphs/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lp-can-be-a-cure-for-parameterized-problems/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/marquez-alberto/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-berlakovich/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-schwengerer/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mathieson-luke/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michael-planer/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/moreno-auxiliadora/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/n.-s.-narayanaswamy-and-venkatesh-raman-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-graph-contractions-and-induced-minors/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-solving-the-rooted-delay-and-delay-variation-constrained-steiner-tree-problem/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-expression-complexity-of-equivalence-and-isomorphism-of-primitive-positive-formulas/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/paper/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-algorithms-for-even-cycle-transversal/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-tractability-of-multiway-cut-with-parity-constraints/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-jonsson/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/portillo-jose-ramon/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/reyes-pedro/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/silveira-rodrigo/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova-and-diego-valota/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strong-backdoors-to-nested-satisfiability/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-planning-revisited-a-parameterized-analysis/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/tokuyama-takeshi/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/valenzuela-jesus/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/valued-based-argumentation-for-tree-like-value-graphs/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/van-t-hof-pim/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-and-greedy-randomized-adaptive-search-for-capacitated-connected-facility-location/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-search-and-grasp-for-three-layer-hierarchical-ring-network-design/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/villar-maria-trinidad/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/when-trees-grow-low-shrubs-and-fast-mso1/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wolfgang-dvorak/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/yngve-villanger/</loc><lastmod>2012-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-multilevel-refinement-approach-to-the-rooted-delay-constrained-steiner-tree-problem/</loc><lastmod>2011-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-gruber/</loc><lastmod>2011-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-losungsarchiv-mit-branch-and-bound-erweiterung-fur-das-generalized-minimum-spanning-tree-problem/</loc><lastmod>2011-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gernot-fritz/</loc><lastmod>2011-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/heuristic-methods-for-the-hop-constrained-survivable-network-design-problem/</loc><lastmod>2011-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-seidl/</loc><lastmod>2011-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/branch-and-price-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints/</loc><lastmod>2011-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-sinnl/</loc><lastmod>2011-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/anwendung-von-kombinatorischen-optimierungsmethoden-zur-rekonstruktion-von-in-streifen-geschnittenen-papierdokumenten/</loc><lastmod>2011-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/karl-michael-edlinger/</loc><lastmod>2011-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimierung-der-periodischen-tourenplanung-in-der-mullentsorgung/</loc><lastmod>2011-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-winkler/</loc><lastmod>2011-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/verbrauchsminimierung-eines-hybridfahrzeuges-im-neuen-europaischen-fahrzyklus/</loc><lastmod>2011-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/stabilized-branch-and-price-for-the-rooted-delay-constrained-steiner-tree-problem/</loc><lastmod>2011-06-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/stabilized-column-generation-for-the-rooted-delay-constrained-steiner-tree-problem/</loc><lastmod>2011-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-branch-and-cut-and-price-algorithm-for-a-fingerprint-template-compression-application/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-layered-graph-model-and-an-adaptive-layers-framework-to-solve-delay-constrained-minimum-tree-problems/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithms-and-complexity-results-for-persuasive-argumentation/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/alon-noga/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andrea-roli/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-hubmer/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-m.-chwatal/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/augmenting-tractable-fragments-of-abstract-argumentation/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/automatic-generation-of-route-sketches/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/boundary-labeling-algorithms-for-panorama-images/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/clique-width-when-hard-does-not-mean-impossible/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/connecting-two-trees-with-optimal-routing-cost/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/corina-thoni/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-and-labeling-high-quality-metro-maps-by-mixed-integer-programming/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/fellows-michael-r./</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gutin-gregory/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/introducing-the-virtual-network-mapping-problem-with-delay-routing-and-location-constraints/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kao-mong-jen/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/katz-bastian/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/kernels-for-global-constraints/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kim-eun-jung/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lee-d.-t./</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/limits-of-preprocessing/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/lokshtanov-daniel-and-rosamond-frances/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/monadic-second-order-logic-on-graphs-with-local-cardinality-constraints/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/new-results-on-the-complexity-of-the-max-and-min-rep-problems/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-d-regular-schematization-of-embedded-paths/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-stabilized-branch-and-price-for-constrained-tree-problems/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-proof-complexity/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/paths-flowers-and-vertex-cover/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-ii/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/sliding-labels-for-dynamic-point-labeling/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-max-r-sat-above-a-tight-lower-bound/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-minimum-label-spanning-tree-problem-by-mathematical-programming-techniques/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-k-flip-local-search-for-sat-and-max-sat/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-local-consistency/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/tractable-cases-of-the-extended-global-cardinality-constraint/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/twin-cover-beyond-vertex-cover-in-parameterized-algorithmics/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/using-a-solution-archive-to-enhance-metaheuristics-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-search-for-capacitated-connected-facility-location/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/venkatesh-raman-and-m.-s.-ramanujan-and-saket-saurabh/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/yeo-anders/</loc><lastmod>2011-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-timeslot-based-heuristic-approach-to-construct-high-school-timetables/</loc><lastmod>2010-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-neues-losungsarchiv-fur-das-generalized-minimum-spanning-tree-problem/</loc><lastmod>2010-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/mika-sonnleitner/</loc><lastmod>2010-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/karin-oberlechner/</loc><lastmod>2010-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-k-node-minimum-label-spanning-arborescence-problem-with-exact-and-heuristic-methods/</loc><lastmod>2010-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/automatic-generation-of-2-antwars-players-with-genetic-programming/</loc><lastmod>2010-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/j.-infuhr/</loc><lastmod>2010-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multilevel-heuristiken-fur-das-rooted-delay-constrained-minimum-spanning-tree-problem/</loc><lastmod>2010-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/c.-schauer/</loc><lastmod>2010-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-minimum-label-spanning-tree-problem-solution-methods-and-applications/</loc><lastmod>2010-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/reconstructing-cross-cut-shredded-documents-by-means-of-evolutionary-algorithms/</loc><lastmod>2010-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-two-network-design-problems-by-mixed-integer-programming-and-hybrid-optimization-methods/</loc><lastmod>2010-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anna-pagacz/</loc><lastmod>2010-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/compressing-fingerprint-templates-by-solving-the-k-node-minimum-label-spanning-arborescence-problem-by-branch-and-price/</loc><lastmod>2010-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/corinna-thoni/</loc><lastmod>2010-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/heuristic-methods-for-solving-two-generalized-network-problems/</loc><lastmod>2010-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-brief-survey-on-hybrid-metaheuristics/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/abhimanyu-m.-ambalath-and-radheshyam-balasundaram-and-chintan-rao-h.-and-venkata-koppula-and-neeldhara-misra-and-geevarghese-philip-and-m.-s.-ramanujan/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithms-and-complexity-results-for-exact-bayesian-structure-learning/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithms-for-propositional-model-counting/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-improved-algorithm-for-the-metro-line-crossing-minimization-problem/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/are-there-any-good-digraph-width-measures/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/been-ken/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/boundary-labeling-with-octilinear-leaders/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/constraint-satisfaction-with-bounded-treewidth-revisited/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/delling-daniel/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/dvorak/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/dynamic-one-sided-boundary-labeling/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fitting-multi-planet-transit-models-to-photometric-time-data-series-by-evolution-strategies/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hannes-obweger/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-metaheuristics-7th-int-workshop-hm-2010/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/josef-schiefer-and-philip-limbeck/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-suntinger/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/matheuristics-for-the-periodic-vehicle-routing-problem-with-time-windows/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multilevel-variable-neighborhood-search-for-periodic-routing-problems/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/new-results-on-the-complexity-of-oriented-colouring-on-restricted-digraph-classes/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-contracting-graphs-to-fixed-pattern-graphs/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-parse-trees-and-myhill-nerode-type-tools-for-handling-graphs-of-bounded-rank-width/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-kernelization-complexity-of-colorful-motifs/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/path-schematization-for-route-sketches/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/poon-sheung-hung/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/reasoning-in-argumentation-frameworks-of-bounded-clique-width/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/samer-marko/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/schauder-hats-for-the-two-variable-fragment-of-bl/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/shooting-bricks-with-orthogonal-laser-beams-a-first-step-towards-internal-external-map-labeling/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/similarity-searching-in-sequences-of-complex-events/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/simone-bova-and-tommaso-flaminio/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-minimum-label-spanning-tree-problem-by-ant-colony-optimization/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefano-aguzzoli-and-simone-bova/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/strong-lower-bounds-for-a-survivable-network-design-problem/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sysikaski-mikko/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-coherence-of-lukasiewicz-assessments-is-np-complete/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-free-n-generated-bl-algebra/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/theory-and-applications-of-satisfiability-testing-sat-2010-13th-international-conference-sat-2010-edinburgh-uk-july-11-14-2010-proceedings/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/thread-graphs-linear-rank-width-and-their-algorithmic-applications/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/trend-based-similarity-search-in-time-series-data/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ulrich-pferschy/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-search-and-ant-colony-optimization-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-search-coupled-with-ilp-based-large-neighborhood-searches-for-the-periodic-location-routing-problem/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/visualisierung-von-netzen-algorithmen-anwendungen-und-komplexitat/</loc><lastmod>2010-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-optimization-methods-for-warehouse-logistics-and-the-reconstruction-of-destroyed-paper-documents/</loc><lastmod>2009-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-losungsarchiv-unterstutzter-evolutionarer-algorithmus-fur-das-generalized-minimum-spanning-tree-problem/</loc><lastmod>2009-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-wolf/</loc><lastmod>2009-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/bdmst/</loc><lastmod>2009-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-and-heuristic-approaches-for-solving-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2009-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin-gruber/</loc><lastmod>2009-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/accelerating-column-generation-for-a-survivable-network-design-problem/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-hybrides-verfahren-basierend-auf-variabler-nachbarschaftssuche-und-dynamischer-programmierung-zur-tourenfindung-in-einem-ersatzteillager-mit-domanenspezifischen-nebenbedingungen/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exakte-und-heuristische-optimierungsmethoden-zur-losung-von-video-server-load-re-balancing/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakob-walla/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/netquest/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nina-musil/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-misar/</loc><lastmod>2009-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/event-based-similarity-search-and-its-applications-in-business-analytics/</loc><lastmod>2009-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/similarity-searching-in-complex-business-events-and-sequences-thereof/</loc><lastmod>2009-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andrej-sramko/</loc><lastmod>2009-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/enhancing-a-genetic-algorithm-by-a-complete-solution-archive-based-on-a-trie-data-structure/</loc><lastmod>2009-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/network-visualization-algorithms-applications-and-complexity/</loc><lastmod>2009-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-column-generation-approach-for-the-periodic-vehicle-routing-problem-with-time-windows/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-lagrangian-decomposition-based-heuristic-for-capacitated-connected-facility-location/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithms-for-multi-criteria-boundary-labeling/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/applications-of-finite-duality-to-locally-finite-varieties-of-bl-algebras/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoor-sets-of-quantified-boolean-formulas/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/benkert-marc/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/better-polynomial-algorithms-on-graphs-of-bounded-rank-width/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/boosting-a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows-by-ilp-techniques/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/clique-width-is-np-complete/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhood-search-for-capacitated-connected-facility-location/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhoood-search-for-capacitated-connected-facility-location/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/consistent-digital-rays/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cooperative-hybrids-for-combinatorial-optimization/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/covering-graphs-with-few-complete-bipartite-subgraphs/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/drawing-binary-tanglegrams-an-experimental-evaluation/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fitting-multi-planet-transit-models-to-corot-time-data-series-by-evolutionary-algorithms/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/gecco-2009-proceedings-of-the-11th-annual-conference-on-genetic-and-evolutionary-computation/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-metaheuristics/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kroll-moritz/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/logistics/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/martin~gruber/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/matched-formulas-and-backdoor-sets/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaboosting-enhancing-integer-programming-techniques-by-metaheuristics/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-digraph-width-measures-in-parameterized-algorithmics/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/rosamond-frances-a./</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/soft-constraints-processing-over-divisible-residuated-lattices/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefano-aguzzoli-and-simone-bova-and-vincenzo-marra/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-consequence-relation-in-the-logic-of-commutative-gbl-algebras-is-pspace-complete/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-oriented-colouring/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ulrike-ritzinger/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/volker-markus/</loc><lastmod>2009-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/design-eines-sicherheits-zeit-und-kostenkritischen-kommunikationsnetzwerkes-mittels-lagrange-relaxierung-und-spaltengenerierung/</loc><lastmod>2008-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/generierung-von-ein-und-umlagervorschlagen-in-lagern-mit-einer-last-in-first-out-strategie-und-kundenspezifischen-auslagerpr-ferenzen/</loc><lastmod>2008-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-metaheuristics-for-generalized-network-design-problems/</loc><lastmod>2008-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/anna-katarzyna-potocka/</loc><lastmod>2008-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/carsp/</loc><lastmod>2008-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/markus-knausz/</loc><lastmod>2008-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parallel-variable-neighborhood-search-for-the-car-sequencing-problem/</loc><lastmod>2008-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/webbasierte-darstellung-grosser-datenmengen-als-pivot-tabelle-mithilfe-ressourcenoptimierter-aggregationsverfahren/</loc><lastmod>2008-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/</loc><lastmod>2008-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/franz-berger/</loc><lastmod>2008-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-complete-archive-genetic-algorithm-for-the-multidimensional-knapsack-problem/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-incremental-dynamic-programming-approach-for-multidimensional-allocation-problems/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christoph-bonitz/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combinatorial-optimization-for-the-compression-of-biometric-templates/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evaluation-and-reconstruction-of-strip-shredded-text-documents/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ferdinand-zaubzer/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lagrangian-relax-and-cut-and-hybrid-methods-for-the-bounded-diameter-and-the-hop-constrained-minimum-spanning-tree-problems/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/olivia-dietzel/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stephan-zaubzer/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/wolfgang-morandell/</loc><lastmod>2008-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/meta-heuristic-separation-of-jump-cuts-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-lagrangian-relax-and-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithms-for-multi-criteria-one-sided-boundary-labeling/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/automata-approach-to-graphs-of-bounded-rank-width/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoor-trees/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-integer-linear-programming-techniques-and-metaheuristics-for-combinatorial-optimization/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-algorithms-for-artificial-intelligence-constraint-satisfaction-and-database-problems/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fixed-parameter-complexity-of-minimum-profile-problems/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/georg-gottlob/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/heuristic-cut-separation-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lagrangian-decomposition-metaheuristics-and-hybrid-approaches-for-the-design-of-the-last-mile-in-fiber-optic-networks/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/luke-mathieson/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/merrick-damian/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/morphing-polylines-a-step-towards-continuous-generalization/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/not-so-easy-problems-for-tree-decomposable-graphs-invited-talk/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-graph-editing-with-chosen-vertex-degrees/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parameterized-sat/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-schuller/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/petr-hlineny/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proof-search-in-hajek-s-basic-logic/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/reconstructing-borders-of-manually-torn-paper-scheets-using-integer-linear-programming/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ruben-ruiz-torrubiano/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-regular-subgraph-problems-and-generalizations/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/</loc><lastmod>2008-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-braumann/</loc><lastmod>2007-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/map-matching-und-wegsuche-in-einem-geografischen-informationssystem/</loc><lastmod>2007-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithmic-approaches-to-the-string-barcoding-problem/</loc><lastmod>2007-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-putz/</loc><lastmod>2007-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/philipp-neuner/</loc><lastmod>2007-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/subgradient-optimization-based-lagrangian-relaxation-and-relax-and-cut-approaches-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2007-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improved-protein-identification-after-fast-elimination-of-non-interpretable-peptide-ms-ms-spectra-and-noise-reduction/</loc><lastmod>2007-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/nedim-mujezinovic/</loc><lastmod>2007-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/improved-algorithms-for-length-minimal-one-sided-boundary-labeling/</loc><lastmod>2007-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/metaheuristic-approaches-for-designing-survivable-fiber-optic-networks/</loc><lastmod>2007-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/thomas-bucsics/</loc><lastmod>2007-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-directed-cut-model-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-multi-commodity-flow-approach-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andrea-m.-foerster/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/arash-rafiey/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-lagrangian-decomposition-with-an-evolutionary-algorithm-for-the-knapsack-constrained-maximum-spanning-tree-problem/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/compressing-fingerprint-templates-by-solving-an-extended-minimum-label-spanning-tree-problem/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cymate-a-new-tool-for-methylation-analysis-of-plant-genomic-dna-after-bisulfite-sequencing/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-wagner/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-wanger/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/determining-orbital-elements-of-extrasolar-planets-by-evolution-strategies/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/fingerprint-template-compression-by-solving-a-minimum-label-k-node-subtree-problem/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/geographic-visualization/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jennifer-hetzl/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/naomi-nishimura/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ortrun-mittelsten-scheid/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/p.bachhiesl/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/peter-bachhiesl/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/petra-mutzel/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/prabhakar-ragde/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-sat-using-vertex-covers/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/uno-takeaki/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/without-loss-of-generality-symmetric-reasoning-for-resolution-systems-invited-talk/</loc><lastmod>2007-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cluster-planarity-testing-for-the-case-of-not-necessarily-connected-clusters/</loc><lastmod>2006-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/robert-beibl/</loc><lastmod>2006-12-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-lagrangian-decomposition-approach-combined-with-metaheuristics-for-the-knapsack-constrained-maximum-spanning-tree-problem/</loc><lastmod>2006-10-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-two-generalized-network-design-problems-with-exact-and-heuristic-methods/</loc><lastmod>2006-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-mixed-integer-program-for-drawing-high-quality-metro-maps/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-note-on-unsatisfiable-k-cnf-formulas-with-few-occurrences-per-variable/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-unified-view-on-hybrid-metaheuristics/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/aco/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-ant-colony-optimisation-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/bestimmung-der-bahnelemente-von-extrasolaren-planeten-aufgrund-von-radialgeschwindigkeitsmessdaten-mittels-evolutionarer-algorithmen/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/biased-mutation-operators-for-subgraph-selection-problems/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/boris-kopinitsch/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bryant-a.-julstrom/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cleaning-of-raw-peptide-ms-ms-spectra-improved-protein-identification-following-deconvolution-of-multiply-charged-peaks-isotope-clusters-and-removal-of-background-noise/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/clique-width-minimization-is-np-hard/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-metaheuristics-and-integer-programming-for-solving-cutting-and-packing-problems/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/tag/ea/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evolutionary-approach-to-constrained-minimum-spanning-tree-problem/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2006/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/frances-a.-rosamond/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/frank-eisenhaber/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gabriele-koller/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/graham-wrightson/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/james-r.-a.-hutchins/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jan-michael-peters/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jano-van-hemert/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/karl-mechtler/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/michael-r.-fellows/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/shlomo-hoory/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stanislaw-zawislak/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-core-concept-for-the-multidimensional-knapsack-problem/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/</loc><lastmod>2006-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/automated-drawing-of-metro-maps/</loc><lastmod>2005-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/david-fischinger/</loc><lastmod>2005-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/dynamische-reihenfolgeoptimierung-mittels-simulation-und-meta-heuristiken/</loc><lastmod>2005-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/eine-generische-bibliothek-fur-metaheuristiken-und-ihre-anwendung-auf-das-quadratic-assignment-problem/</loc><lastmod>2005-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/exact-and-heuristic-methods-for-solving-the-car-sequencing-problem/</loc><lastmod>2005-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/multiple-structural-rna-alignment-with-affine-gap-costs-based-on-lagrangian-relaxation/</loc><lastmod>2005-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/veronika-gamper/</loc><lastmod>2005-08-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-application-of-dijkstra-s-algorithm-for-a-on-board-route-re-planning-module/</loc><lastmod>2005-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gregoire-verlut/</loc><lastmod>2005-07-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-extended-local-branching-framework-and-its-application-to-the-multidimensional-knapsack-problem/</loc><lastmod>2005-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/daniel-lichtenberger/</loc><lastmod>2005-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/andreas-heigl/</loc><lastmod>2005-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/option-pricing-by-means-of-genetic-programming/</loc><lastmod>2005-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-new-0-1-ilp-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/backdoor-sets-for-dll-subsolvers/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-metaheuristics-and-exact-algorithms-in-combinatorial-optimization-a-survey-and-classification/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2005/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evolutionary-computation-an-overview-and-recent-trends/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/generalizations-of-matched-cnf-formulas/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/hoory-shlomo/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-edge-colored-graphs-covered-by-properly-colored-cycles/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proceedings-of-the-2005-ieee-congress-on-evolutionary-computation/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proceedings-of-the-genetic-and-evolutionary-computation-conference-gecco-2005/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/relaxation-guided-variable-neighborhood-search/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-complexity-of-resolution-with-generalized-symmetry-rules/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2005-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-genetischer-algorithmus-fur-das-optimum-communication-spanning-tree-problem/</loc><lastmod>2004-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gunther-gruber/</loc><lastmod>2004-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/jakel-jens/</loc><lastmod>2004-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/validation-in-the-cluster-analysis-of-gene-expression-data/</loc><lastmod>2004-11-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-alignment-graph-based-evolutionary-algorithm-for-the-multiple-sequence-alignment-problem/</loc><lastmod>2004-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/stefan-leopold/</loc><lastmod>2004-02-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/a.~moser/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-algorithm-for-the-maximum-weight-trace-formulation-of-the-multiple-sequence-alignment-problem/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-improved-hybrid-genetic-algorithm-for-the-generalized-assignment-problem/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/applications-of-evolutionary-computing-evoworkshops-2004/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/detecting-backdoor-sets-with-respect-to-horn-and-binary-clauses/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2004/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/g.w.~klau/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/h.-feltl/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/i.~ljubic/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/minimal-unsatisfiable-formulas-with-bounded-clause-variable-difference-are-fixed-parameter-tractable/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-fixed-parameter-tractable-parameterizations-of-sat/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-theorems-equivalent-with-kotzig-s-result-on-graphs-with-unique-1-factors/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/p.~mutzel/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/p.~neuner-and-u.~pferschy/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/r.~weiskircher/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/solving-a-real-world-glass-cutting-problem/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/special-issue-on-evolutionary-computation-in-combinatorial-optimization/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-parameterized-complexity-of-sat-backdoors/</loc><lastmod>2004-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-evolutionarer-algorithmus-zur-l-sung-des-vertex-biconnectivity-augmentation-problems/</loc><lastmod>2003-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/sandor-alexander-kersting/</loc><lastmod>2003-09-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/janosch-fauster/</loc><lastmod>2003-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/neue-heuristische-losungsans-tze-f-das-multiple-sequence-alignment-problem/</loc><lastmod>2003-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/verfahren-zur-losung-eines-glasverschnittproblems/</loc><lastmod>2003-05-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/ein-genetischer-algorithmus-fur-das-generalized-assignment-problem/</loc><lastmod>2003-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/harald-feltl/</loc><lastmod>2003-04-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/hybrid-evolutionary-algorithms-for-combinatorial-optimization/</loc><lastmod>2003-03-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/applications-of-evolutionary-computing-evoworkshops-2003/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/b.-a.-julstrom/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/finding-paths-in-graphs-avoiding-forbidden-transitions/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/homomorphisms-of-conjunctive-normal-forms/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/i.-ljubic/</loc><lastmod>2003-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/applications-of-evolutionary-computing-evoworkshops-2002/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/bryant-julstrom/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gabriele-kodydek/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/kullmann-oliver/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/letting-ants-labeling-point-features/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/m.-schreyer/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-weight-biased-mutation-for-graph-problems/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/polynomial-time-recognition-of-minimal-unsatisfiable-formulas-with-fixed-clause-variable-difference/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/s.-kersting/</loc><lastmod>2002-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/</loc><lastmod>2001-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/applications-of-evolutionary-computing-evoworkshops-2001/</loc><lastmod>2001-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/conjunctive-normal-forms-with-bounded-deficiency/</loc><lastmod>2001-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/j.-gottlieb/</loc><lastmod>2001-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/np-completeness-of-refutability-by-literal-once-resolution/</loc><lastmod>2001-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/</loc><lastmod>2001-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/</loc><lastmod>2001-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/</loc><lastmod>2000-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-predecessor-coding-in-an-evolutionary-algorithm-for-the-capacitated-minimum-spanning-tree-problem/</loc><lastmod>2000-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</loc><lastmod>2000-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-efficient-evolutionary-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</loc><lastmod>2000-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/c.-drexel/</loc><lastmod>2000-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/j.-kratica/</loc><lastmod>2000-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/</loc><lastmod>2000-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/</loc><lastmod>1999-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-evolutionary-approach-to-point-feature-label-placement/</loc><lastmod>1999-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/characterizing-locality-in-decoder-based-eas-for-the-multidimensional-knapsack-problem/</loc><lastmod>1999-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/</loc><lastmod>1999-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/</loc><lastmod>1999-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/</loc><lastmod>1999-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-genetic-algorithm-for-labeling-point-features/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/a-hybrid-gp-approach-for-numerically-robust-symbolic-regression/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/approximation-with-evolutionary-optimized-tensor-product-bernstein-polynomials/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/christian-wurm/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/evolutionary-optimized-tensor-product-bernstein-polynomials-versus-backpropagation-networks/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/genetic-algorithms-for-the-multiple-container-packing-problem/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/ingeborg-tastl/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/proceedings-of-the-international-conference-on-imaging-science-systems-and-technology/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/transforming-an-analytically-defined-color-space-to-match-psychophysically-gained-color-distances/</loc><lastmod>1998-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/progressives-adaptives-ray-tracing-von-bildern-mit-hoher-zeitlicher-koharenz/</loc><lastmod>1994-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/akanksha-agrawal/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/algorithmic-extensions-of-dirac-s-theorem/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/amer-e.-mouawad/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/danny-hermelin/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/frohner-nikolaus/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/gmys-jan/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/lossy-kernels-for-hitting-subgraphs/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/melab-nourdine/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/on-the-parameterized-complexity-of-simultaneous-deletion-problems/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/publication/parallel-beam-search-for-combinatorial-optimization/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/r.-krithika/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/talbi-el-ghazali/</loc><lastmod>1970-01-01T00:00:00+00:00</lastmod><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/author/</loc><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/courses/courses/</loc><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/categories/</loc><changefreq>weekly</changefreq></url><url><loc>https://ac.notready.eu/research/</loc><changefreq>weekly</changefreq></url></urlset>