https://ac.tuwien.ac.at/publication-type/2/2Hugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pnghttps://ac.tuwien.ac.at/publication-type/2/https://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2/https://ac.tuwien.ac.at/publication/annoyance-modeling-in-cooperative-personnel-scheduling/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/annoyance-modeling-in-cooperative-personnel-scheduling/https://ac.tuwien.ac.at/publication/arcol-aspect-ratio-constrained-orthogonal-layout/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/arcol-aspect-ratio-constrained-orthogonal-layout/https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-continued/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-continued/https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/https://ac.tuwien.ac.at/publication/dataset-of-electric-autonomous-dial-a-ride-instances-with-local-energy-communities-and-electricity-tariffs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/dataset-of-electric-autonomous-dial-a-ride-instances-with-local-energy-communities-and-electricity-tariffs/https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2/https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy-2/https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/https://ac.tuwien.ac.at/publication/revisiting-large-neighborhood-search-with-on-the-fly-chargingstation-insertion-for-the-electric-autonomous-dial-a-ride-problem/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-large-neighborhood-search-with-on-the-fly-chargingstation-insertion-for-the-electric-autonomous-dial-a-ride-problem/https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting-2/https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning-2/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-2/https://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/https://ac.tuwien.ac.at/publication/visualizing-treewidth-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-treewidth-2/https://ac.tuwien.ac.at/publication/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees/https://ac.tuwien.ac.at/publication/an-introduction-to-and-survey-of-biological-network-visualization/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-introduction-to-and-survey-of-biological-network-visualization/https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing-revisited/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing-revisited/https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number-and-vertex-integrity/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number-and-vertex-integrity/https://ac.tuwien.ac.at/publication/constrained-boundary-labeling-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/constrained-boundary-labeling-2/https://ac.tuwien.ac.at/publication/generating-streamlining-constraints-with-large-language-models/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/generating-streamlining-constraints-with-large-language-models/https://ac.tuwien.ac.at/publication/introducing-fairness-in-network-visualization/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-fairness-in-network-visualization/https://ac.tuwien.ac.at/publication/optimizing-staircase-motifs-in-biofabric-network-layouts/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-staircase-motifs-in-biofabric-network-layouts/https://ac.tuwien.ac.at/publication/parameterized-complexity-in-machine-learning/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-in-machine-learning/https://ac.tuwien.ac.at/publication/passenger-decision-making-in-mass-transit-systems-insights-from-dual-process-theories/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/passenger-decision-making-in-mass-transit-systems-insights-from-dual-process-theories/https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth/https://ac.tuwien.ac.at/publication/storysets-ordering-curves-and-dimensions-for-visualizing-uncertain-sets-and-multi-dimensional-discrete-data/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/storysets-ordering-curves-and-dimensions-for-visualizing-uncertain-sets-and-multi-dimensional-discrete-data/https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-for-solving-the-longest-common-square-subsequence-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-for-solving-the-longest-common-square-subsequence-problem/https://ac.tuwien.ac.at/publication/backdoor-dnfs-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs-3/https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/https://ac.tuwien.ac.at/publication/computing-data-driven-multilinear-metro-maps/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-data-driven-multilinear-metro-maps/https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework-2/https://ac.tuwien.ac.at/publication/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs/https://ac.tuwien.ac.at/publication/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs/https://ac.tuwien.ac.at/publication/exact-methods-for-the-selective-assessment-routing-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-methods-for-the-selective-assessment-routing-problem/https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-bend-restricted-rac-drawings-of-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-bend-restricted-rac-drawings-of-graphs/https://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/graphs-with-at-most-two-moplexes/https://ac.tuwien.ac.at/publication/hard-qbfs-for-merge-resolution/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hard-qbfs-for-merge-resolution/https://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/https://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices-2/https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/https://ac.tuwien.ac.at/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best-2/https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation-and-enumeration/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation-and-enumeration/https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/https://ac.tuwien.ac.at/publication/satisfiability-modulo-user-propagators/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/satisfiability-modulo-user-propagators/https://ac.tuwien.ac.at/publication/scheduling-jobs-using-queries-to-interactively-learn-human-availability-times/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/scheduling-jobs-using-queries-to-interactively-learn-human-availability-times/https://ac.tuwien.ac.at/publication/should-decisions-in-qcdcl-follow-prefix-order-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/should-decisions-in-qcdcl-follow-prefix-order-2/https://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/https://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/slim-tree-cut-width-2/https://ac.tuwien.ac.at/publication/smash-and-grab-the-0-6-scoring-game-on-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/smash-and-grab-the-0-6-scoring-game-on-graphs/https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity-2/https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/https://ac.tuwien.ac.at/publication/uncertainty-in-humanities-network-visualization/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/uncertainty-in-humanities-network-visualization/https://ac.tuwien.ac.at/publication/visualizing-extensions-of-argumentation-frameworks-as-layered-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-extensions-of-argumentation-frameworks-as-layered-graphs/https://ac.tuwien.ac.at/publication/the-silent-r-evolution-of-sat/Thu, 01 Jun 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-silent-r-evolution-of-sat/https://ac.tuwien.ac.at/publication/are-hitting-formulas-hard-for-resolution/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/are-hitting-formulas-hard-for-resolution/https://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2/https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat-2/https://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages-2/https://ac.tuwien.ac.at/publication/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs/https://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs-2/https://ac.tuwien.ac.at/publication/faster-edge-path-bundling-through-graph-spanners/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-edge-path-bundling-through-graph-spanners/https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types/https://ac.tuwien.ac.at/publication/growth-of-the-perfect-sequence-covering-array-number/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/growth-of-the-perfect-sequence-covering-array-number/https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors-2/https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-electric-vehicle-fleet-scheduling/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-electric-vehicle-fleet-scheduling/https://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/https://ac.tuwien.ac.at/publication/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-parameterized-by-feedback-vertex-set-and-other-structural-parameters/https://ac.tuwien.ac.at/publication/mosaicsets-embedding-set-systems-into-grid-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/mosaicsets-embedding-set-systems-into-grid-graphs/https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks-2/https://ac.tuwien.ac.at/publication/sample-compression-schemes-for-balls-in-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/sample-compression-schemes-for-balls-in-graphs/https://ac.tuwien.ac.at/publication/sat-boosted-tabu-search-for-coloring-massive-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-boosted-tabu-search-for-coloring-massive-graphs/https://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints-2/https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity-2/https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/https://ac.tuwien.ac.at/publication/hardness-characterisations-and-size-width-lower-bounds-for-qbf-resolution/Thu, 01 Sep 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-characterisations-and-size-width-lower-bounds-for-qbf-resolution/https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2/https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/https://ac.tuwien.ac.at/publication/colored-cut-games-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/colored-cut-games-2/https://ac.tuwien.ac.at/publication/computational-methods-for-scheduling-the-charging-and-assignment-of-an-on-site-shared-electric-vehicle-fleet/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/computational-methods-for-scheduling-the-charging-and-assignment-of-an-on-site-shared-electric-vehicle-fleet/https://ac.tuwien.ac.at/publication/edge-path-bundling-a-less-ambiguous-edge-bundling-approach/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-path-bundling-a-less-ambiguous-edge-bundling-approach/https://ac.tuwien.ac.at/publication/exploiting-textdollarc-textdollar-closure-in-kernelization-algorithms-for-graph-problems/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-textdollarc-textdollar-closure-in-kernelization-algorithms-for-graph-problems/https://ac.tuwien.ac.at/publication/finding-a-battleship-of-uncertain-shape/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-a-battleship-of-uncertain-shape/https://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/https://ac.tuwien.ac.at/publication/initial-learning-of-textual-programming-at-school-evolution-of-outreach-activities/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/initial-learning-of-textual-programming-at-school-evolution-of-outreach-activities/https://ac.tuwien.ac.at/publication/mixed-labeling-integrating-internal-and-external-labels/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-labeling-integrating-internal-and-external-labels/https://ac.tuwien.ac.at/publication/multi-level-area-balancing-of-clustered-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-level-area-balancing-of-clustered-graphs/https://ac.tuwien.ac.at/publication/multicriteria-optimization-for-dynamic-demers-cartograms/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/multicriteria-optimization-for-dynamic-demers-cartograms/https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals-2/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/https://ac.tuwien.ac.at/publication/preface-ninth-workshop-on-graph-classes-optimization-and-width-parameters-vienna-austria/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/preface-ninth-workshop-on-graph-classes-optimization-and-width-parameters-vienna-austria/https://ac.tuwien.ac.at/publication/recognizing-weighted-and-seeded-disk-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/recognizing-weighted-and-seeded-disk-graphs/https://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs-2/https://ac.tuwien.ac.at/publication/removing-popular-faces-in-curve-arrangements/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/removing-popular-faces-in-curve-arrangements/https://ac.tuwien.ac.at/publication/shape-guided-mixed-metro-map-layout/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/shape-guided-mixed-metro-map-layout/https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/https://ac.tuwien.ac.at/publication/twin-width-and-generalized-coloring-numbers/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/twin-width-and-generalized-coloring-numbers/https://ac.tuwien.ac.at/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem/https://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/https://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges-2/https://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison-2/https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-3/https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/https://ac.tuwien.ac.at/publication/labeling-nonograms-boundary-labeling-for-curve-arrangements/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/labeling-nonograms-boundary-labeling-for-curve-arrangements/https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-2/https://ac.tuwien.ac.at/publication/metrosets-visualizing-sets-as-metro-maps/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/metrosets-visualizing-sets-as-metro-maps/https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-3/https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem-2/https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem/https://ac.tuwien.ac.at/publication/on-the-readability-of-abstract-set-visualizations/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-readability-of-abstract-set-visualizations/https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/https://ac.tuwien.ac.at/publication/parameterized-k-clustering-tractability-island/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-k-clustering-tractability-island/https://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers/https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/https://ac.tuwien.ac.at/publication/strong-d-qbf-dependency-schemes-via-implication-free-resolution-paths/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-d-qbf-dependency-schemes-via-implication-free-resolution-paths/https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-programs-with-few-global-variables-and-constraints/https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths-2/https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set-2/https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/https://ac.tuwien.ac.at/publication/a-survey-on-transit-map-layout-from-design-machine-and-human-perspectives/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-survey-on-transit-map-layout-from-design-machine-and-human-perspectives/https://ac.tuwien.ac.at/publication/a-unified-model-and-algorithms-for-temporal-map-labeling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unified-model-and-algorithms-for-temporal-map-labeling/https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem-2/https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/https://ac.tuwien.ac.at/publication/complexity-of-independency-and-cliquy-trees/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-of-independency-and-cliquy-trees/https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/https://ac.tuwien.ac.at/publication/foreword-eighth-workshop-on-graph-classes-optimization-and-width-parameters-toronto-ontario-canada/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/foreword-eighth-workshop-on-graph-classes-optimization-and-width-parameters-toronto-ontario-canada/https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems-2/https://ac.tuwien.ac.at/publication/placing-labels-in-road-maps-algorithms-and-complexity/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/placing-labels-in-road-maps-algorithms-and-complexity/https://ac.tuwien.ac.at/publication/route-schematization-with-landmarks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/route-schematization-with-landmarks/https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix-2/https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-3/https://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy-2/https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth/https://ac.tuwien.ac.at/publication/dependency-learning-for-qbf-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/dependency-learning-for-qbf-2/https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays/https://ac.tuwien.ac.at/publication/external-labeling-techniques-a-taxonomy-and-survey/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/external-labeling-techniques-a-taxonomy-and-survey/https://ac.tuwien.ac.at/publication/guidelines-for-experimental-algorithmics-a-case-study-in-network-analysis/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/guidelines-for-experimental-algorithmics-a-case-study-in-network-analysis/https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links-2/https://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-3/https://ac.tuwien.ac.at/publication/metabopolis-scalable-network-layout-for-biological-pathway-diagrams-in-urban-map-style/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/metabopolis-scalable-network-layout-for-biological-pathway-diagrams-in-urban-map-style/https://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-3/https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems/https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-k-s-sat-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-k-s-sat-2/https://ac.tuwien.ac.at/publication/on-the-readability-of-leaders-in-boundary-labeling/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-readability-of-leaders-in-boundary-labeling/https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization-2/https://ac.tuwien.ac.at/publication/photonic-integrated-circuits-with-non-planar-topologies-realized-by-3d-printed-waveguide-overpasses/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/photonic-integrated-circuits-with-non-planar-topologies-realized-by-3d-printed-waveguide-overpasses/https://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs-2/https://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs-2/https://ac.tuwien.ac.at/publication/shrub-depth-capturing-height-of-dense-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/shrub-depth-capturing-height-of-dense-graphs/https://ac.tuwien.ac.at/publication/snarks-with-special-spanning-trees/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/snarks-with-special-spanning-trees/https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-by-exploiting-variable-constraint-interactions-a-survey/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-by-exploiting-variable-constraint-interactions-a-survey/https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands-2/https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion-2/https://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization-2/https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays/https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators-2/https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems-2/https://ac.tuwien.ac.at/publication/planar-and-poly-arc-lombardi-drawings/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-and-poly-arc-lombardi-drawings/https://ac.tuwien.ac.at/publication/scalable-set-visualizations-dagstuhl-seminar-17332/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/scalable-set-visualizations-dagstuhl-seminar-17332/https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width-2/https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp-2/https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp-2/https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting-2/https://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees-2/https://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems-2/https://ac.tuwien.ac.at/publication/free-weak-nilpotent-minimum-algebras-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/free-weak-nilpotent-minimum-algebras-2/https://ac.tuwien.ac.at/publication/full-load-route-planning-for-balancing-bike-sharing-systems-by-logic-based-benders-decomposition/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/full-load-route-planning-for-balancing-bike-sharing-systems-by-logic-based-benders-decomposition/https://ac.tuwien.ac.at/publication/hitting-selected-odd-cycles/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/hitting-selected-odd-cycles/https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-the-most-strings-with-few-bad-columns-problem/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-the-most-strings-with-few-bad-columns-problem/https://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts-2/https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-tree-length-graphs/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-tree-length-graphs/https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-2/https://ac.tuwien.ac.at/publication/parameterized-complexity-classes-beyond-para-np/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-classes-beyond-para-np/https://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs-2/https://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-2/https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/https://ac.tuwien.ac.at/publication/solving-the-two-state-fixed-charge-transportation-problem-with-a-hybrid-genetic-algorithm/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-two-state-fixed-charge-transportation-problem-with-a-hybrid-genetic-algorithm/https://ac.tuwien.ac.at/publication/the-treewidth-of-proofs-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-treewidth-of-proofs-2/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem-2/https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-based-model-for-multi-layer-hierarchical-ring-network-design/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-based-model-for-multi-layer-hierarchical-ring-network-design/https://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems/https://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps-2/https://ac.tuwien.ac.at/publication/an-integer-l-shaped-method-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-integer-l-shaped-method-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/https://ac.tuwien.ac.at/publication/backdoors-to-q-horn-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-q-horn-2/https://ac.tuwien.ac.at/publication/complexity-and-monotonicity-results-for-domination-games/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-and-monotonicity-results-for-domination-games/https://ac.tuwien.ac.at/publication/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem/https://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps-2/https://ac.tuwien.ac.at/publication/directed-elimination-games/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/directed-elimination-games/https://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps-2/https://ac.tuwien.ac.at/publication/extending-convex-partial-drawings-of-graphs/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-convex-partial-drawings-of-graphs/https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs-2/https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/https://ac.tuwien.ac.at/publication/mixed-map-labeling-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-map-labeling-2/https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets-2/https://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth-2/https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/https://ac.tuwien.ac.at/publication/new-developments-in-metaheuristics-and-their-applications-selected-extended-contributions-from-the-10th-metaheuristics-international-conference-mic-2013/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-developments-in-metaheuristics-and-their-applications-selected-extended-contributions-from-the-10th-metaheuristics-international-conference-mic-2013/https://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-2/https://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover-2/https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets-2/https://ac.tuwien.ac.at/publication/quantifier-reordering-for-qbf/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantifier-reordering-for-qbf/https://ac.tuwien.ac.at/publication/soundness-of-q-resolution-with-dependency-schemes/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/soundness-of-q-resolution-with-dependency-schemes/https://ac.tuwien.ac.at/publication/strict-confluent-drawing-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/strict-confluent-drawing-2/https://ac.tuwien.ac.at/publication/tree-depth-and-vertex-minors/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/tree-depth-and-vertex-minors/https://ac.tuwien.ac.at/publication/numerical-optimisation-of-electro-hybrid-powertrains/Sun, 01 Mar 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/numerical-optimisation-of-electro-hybrid-powertrains/https://ac.tuwien.ac.at/publication/numerische-optimierung-elektrifizierter-antriebsstrange/Sun, 01 Mar 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/numerische-optimierung-elektrifizierter-antriebsstrange/https://ac.tuwien.ac.at/publication/a-complete-parameterized-complexity-analysis-of-bounded-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-complete-parameterized-complexity-analysis-of-bounded-planning/https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/https://ac.tuwien.ac.at/publication/a-sat-approach-to-clique-width-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-clique-width-2/https://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs-2/https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-3/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-3/https://ac.tuwien.ac.at/publication/computing-secure-sets-in-graphs-using-answer-set-programming/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-secure-sets-in-graphs-using-answer-set-programming/https://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/https://ac.tuwien.ac.at/publication/empirical-evaluation-for-graph-drawing-dagstuhl-seminar-15052/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/empirical-evaluation-for-graph-drawing-dagstuhl-seminar-15052/https://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-for-deletion-to-split-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-for-deletion-to-split-graphs/https://ac.tuwien.ac.at/publication/improving-vertex-cover-as-a-graph-parameter/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/improving-vertex-cover-as-a-graph-parameter/https://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones-2/https://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/https://ac.tuwien.ac.at/publication/multi-row-boundary-labeling-algorithms-for-panorama-images/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-row-boundary-labeling-algorithms-for-panorama-images/https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees-2/https://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp/https://ac.tuwien.ac.at/publication/parameterized-and-subexponential-time-complexity-of-satisfiability-problems-and-applications-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-and-subexponential-time-complexity-of-satisfiability-problems-and-applications-2/https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/https://ac.tuwien.ac.at/publication/the-complexity-of-equivalence-entailment-and-minimization-in-existential-positive-logic/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-equivalence-entailment-and-minimization-in-existential-positive-logic/https://ac.tuwien.ac.at/publication/digraph-width-measures-in-parameterized-algorithmics/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/digraph-width-measures-in-parameterized-algorithmics/https://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-using-linear-programming/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-parameterized-algorithms-using-linear-programming/https://ac.tuwien.ac.at/publication/guarantees-and-limits-of-preprocessing-in-constraint-satisfaction-and-reasoning/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/guarantees-and-limits-of-preprocessing-in-constraint-satisfaction-and-reasoning/https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/https://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths/https://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough-2/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough-2/https://ac.tuwien.ac.at/publication/unification-and-projectivity-in-de-morgan-and-kleene-algebras/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/unification-and-projectivity-in-de-morgan-and-kleene-algebras/https://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments-2/https://ac.tuwien.ac.at/publication/a-unified-approach-to-polynomial-algorithms-on-graphs-of-bounded-bi-rank-width/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unified-approach-to-polynomial-algorithms-on-graphs-of-bounded-bi-rank-width/https://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-2/https://ac.tuwien.ac.at/publication/cops-and-robbers-remarks-and-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/cops-and-robbers-remarks-and-problems/https://ac.tuwien.ac.at/publication/drawing-graphs-and-maps-with-curves-dagstuhl-seminar-13151/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-graphs-and-maps-with-curves-dagstuhl-seminar-13151/https://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area-2/https://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs-2/https://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison-2/https://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs-2/https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-exact-bayesian-network-structure-learning/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-exact-bayesian-network-structure-learning/https://ac.tuwien.ac.at/publication/polynomial-space-hardness-without-disjunction-property/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-space-hardness-without-disjunction-property/https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-2/https://ac.tuwien.ac.at/publication/stabilizing-branch-and-price-for-constrained-tree-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/stabilizing-branch-and-price-for-constrained-tree-problems/https://ac.tuwien.ac.at/publication/algorithms-for-computing-the-maximum-weight-region-decomposable-into-elementary-shapes/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-computing-the-maximum-weight-region-decomposable-into-elementary-shapes/https://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation/https://ac.tuwien.ac.at/publication/cover-contact-graphs-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/cover-contact-graphs-2/https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams/https://ac.tuwien.ac.at/publication/editing-graphs-to-satisfy-degree-constraints-a-parameterized-approach/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/editing-graphs-to-satisfy-degree-constraints-a-parameterized-approach/https://ac.tuwien.ac.at/publication/finite-rdp-algebras-duality-coproducts-and-logic/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/finite-rdp-algebras-duality-coproducts-and-logic/https://ac.tuwien.ac.at/publication/lewis-dichotomies-in-many-valued-logics/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lewis-dichotomies-in-many-valued-logics/https://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs-2/https://ac.tuwien.ac.at/publication/on-graph-contractions-and-induced-minors/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-graph-contractions-and-induced-minors/https://ac.tuwien.ac.at/publication/on-the-expression-complexity-of-equivalence-and-isomorphism-of-primitive-positive-formulas/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-expression-complexity-of-equivalence-and-isomorphism-of-primitive-positive-formulas/https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming-2/https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization-2/https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds-2/https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation-2/https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location-2/https://ac.tuwien.ac.at/publication/drawing-and-labeling-high-quality-metro-maps-by-mixed-integer-programming/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-and-labeling-high-quality-metro-maps-by-mixed-integer-programming/https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/https://ac.tuwien.ac.at/publication/monadic-second-order-logic-on-graphs-with-local-cardinality-constraints-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/monadic-second-order-logic-on-graphs-with-local-cardinality-constraints-2/https://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth-2/https://ac.tuwien.ac.at/publication/parameterized-proof-complexity-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-proof-complexity-2/https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound-2/https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-mathematical-programming-techniques/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-mathematical-programming-techniques/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-k-flip-local-search-for-sat-and-max-sat-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-k-flip-local-search-for-sat-and-max-sat-2/https://ac.tuwien.ac.at/publication/tractable-cases-of-the-extended-global-cardinality-constraint-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-cases-of-the-extended-global-cardinality-constraint-2/https://ac.tuwien.ac.at/publication/algorithms-for-propositional-model-counting-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-propositional-model-counting-2/https://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders-2/https://ac.tuwien.ac.at/publication/constraint-satisfaction-with-bounded-treewidth-revisited-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/constraint-satisfaction-with-bounded-treewidth-revisited-2/https://ac.tuwien.ac.at/publication/on-parse-trees-and-myhill-nerode-type-tools-for-handling-graphs-of-bounded-rank-width/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-parse-trees-and-myhill-nerode-type-tools-for-handling-graphs-of-bounded-rank-width/https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling-2/https://ac.tuwien.ac.at/publication/the-coherence-of-lukasiewicz-assessments-is-np-complete/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-coherence-of-lukasiewicz-assessments-is-np-complete/https://ac.tuwien.ac.at/publication/the-free-n-generated-bl-algebra/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-free-n-generated-bl-algebra/https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/https://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-boundary-labeling/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-boundary-labeling/https://ac.tuwien.ac.at/publication/backdoor-sets-of-quantified-boolean-formulas-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-sets-of-quantified-boolean-formulas-2/https://ac.tuwien.ac.at/publication/clique-width-is-np-complete/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-is-np-complete/https://ac.tuwien.ac.at/publication/consistent-digital-rays-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-digital-rays-2/https://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs-2/https://ac.tuwien.ac.at/publication/matched-formulas-and-backdoor-sets-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/matched-formulas-and-backdoor-sets-2/https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/https://ac.tuwien.ac.at/publication/the-consequence-relation-in-the-logic-of-commutative-gbl-algebras-is-pspace-complete/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-consequence-relation-in-the-logic-of-commutative-gbl-algebras-is-pspace-complete/https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-artificial-intelligence-constraint-satisfaction-and-database-problems/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-artificial-intelligence-constraint-satisfaction-and-database-problems/https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems-2/https://ac.tuwien.ac.at/publication/morphing-polylines-a-step-towards-continuous-generalization/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/morphing-polylines-a-step-towards-continuous-generalization/https://ac.tuwien.ac.at/publication/proof-search-in-hajek-s-basic-logic/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-search-in-hajek-s-basic-logic/https://ac.tuwien.ac.at/publication/cymate-a-new-tool-for-methylation-analysis-of-plant-genomic-dna-after-bisulfite-sequencing/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/cymate-a-new-tool-for-methylation-analysis-of-plant-genomic-dna-after-bisulfite-sequencing/https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/https://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers-2/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers-2/https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value-2/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value-2/https://ac.tuwien.ac.at/publication/a-note-on-unsatisfiable-k-cnf-formulas-with-few-occurrences-per-variable/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-note-on-unsatisfiable-k-cnf-formulas-with-few-occurrences-per-variable/https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/https://ac.tuwien.ac.at/publication/cleaning-of-raw-peptide-ms-ms-spectra-improved-protein-identification-following-deconvolution-of-multiply-charged-peaks-isotope-clusters-and-removal-of-background-noise/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/cleaning-of-raw-peptide-ms-ms-spectra-improved-protein-identification-following-deconvolution-of-multiply-charged-peaks-isotope-clusters-and-removal-of-background-noise/https://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets-2/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets-2/https://ac.tuwien.ac.at/publication/backdoor-sets-for-dll-subsolvers/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-sets-for-dll-subsolvers/https://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable-2/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable-2/https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem-2/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem-2/https://ac.tuwien.ac.at/publication/generalizations-of-matched-cnf-formulas-2/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/generalizations-of-matched-cnf-formulas-2/https://ac.tuwien.ac.at/publication/on-edge-colored-graphs-covered-by-properly-colored-cycles/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-edge-colored-graphs-covered-by-properly-colored-cycles/https://ac.tuwien.ac.at/publication/the-complexity-of-resolution-with-generalized-symmetry-rules-2/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-resolution-with-generalized-symmetry-rules-2/https://ac.tuwien.ac.at/publication/minimal-unsatisfiable-formulas-with-bounded-clause-variable-difference-are-fixed-parameter-tractable-3/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimal-unsatisfiable-formulas-with-bounded-clause-variable-difference-are-fixed-parameter-tractable-3/https://ac.tuwien.ac.at/publication/on-theorems-equivalent-with-kotzig-s-result-on-graphs-with-unique-1-factors/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-theorems-equivalent-with-kotzig-s-result-on-graphs-with-unique-1-factors/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/https://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/https://ac.tuwien.ac.at/publication/finding-paths-in-graphs-avoiding-forbidden-transitions/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-paths-in-graphs-avoiding-forbidden-transitions/https://ac.tuwien.ac.at/publication/homomorphisms-of-conjunctive-normal-forms/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/homomorphisms-of-conjunctive-normal-forms/https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/https://ac.tuwien.ac.at/publication/polynomial-time-recognition-of-minimal-unsatisfiable-formulas-with-fixed-clause-variable-difference/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-time-recognition-of-minimal-unsatisfiable-formulas-with-fixed-clause-variable-difference/https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/