4 | AC Group | TU Wienhttps://ac.tuwien.ac.at/publication-type/4/4Hugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png4https://ac.tuwien.ac.at/publication-type/4/F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairnesshttps://ac.tuwien.ac.at/publication/f2stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/f2stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/Improved Circuit Minimization with Exact Synthesishttps://ac.tuwien.ac.at/publication/improved-circuit-minimization-with-exact-synthesis/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-circuit-minimization-with-exact-synthesis/A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applicationshttps://ac.tuwien.ac.at/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications-2/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-2/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs-2/Certified DQBF Solving by Definition Extractionhttps://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction/Davis and Putnam Meet Henkin: Solving DQBF with Resolutionhttps://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution/Fixed-Parameter Tractabilityhttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-2/Hardness and Optimality in QBF Proof Systems Modulo NPhttps://ac.tuwien.ac.at/publication/hardness-and-optimality-in-qbf-proof-systems-modulo-np/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-and-optimality-in-qbf-proof-systems-modulo-np/Parameterized Complexity of Small Decision Tree Learninghttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning-2/Proof Complexity of Symbolic QBF Reasoninghttps://ac.tuwien.ac.at/publication/proof-complexity-of-symbolic-qbf-reasoning-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-symbolic-qbf-reasoning-2/SAT-based Decision Tree Learning for Large Data Setshttps://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-2/Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powershttps://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers-2/Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Stringshttps://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Stringshttps://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/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/The Parameterized Complexity of Clustering Incomplete Datahttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data-2/Two new Mixed-Integer Linear Programming Models for Solving the Multidimensional Multi-Way Number Partitioning Problemhttps://ac.tuwien.ac.at/publication/two-new-mixed-integer-linear-programming-models-for-solving-the-multidimensional-multi-way-number-partitioning-problem/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-new-mixed-integer-linear-programming-models-for-solving-the-multidimensional-multi-way-number-partitioning-problem/A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidthhttps://ac.tuwien.ac.at/publication/a-faster-algorithm-for-propositional-model-counting-parameterized-by-incidence-treewidth-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-faster-algorithm-for-propositional-model-counting-parameterized-by-incidence-treewidth-2/An A* Search Algorithm for the Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/Breaking Symmetries with RootClique and LexTopsorthttps://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort-2/Computing Optimal Hypertree Decompositionshttps://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-2/Finding the Hardest Formulas for Resolutionhttps://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-2/Fixed-Parameter Tractability of Dependency QBF with Structural Parametershttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters-2/Formalizing Graph Trail Properties in Isabelle/HOLhttps://ac.tuwien.ac.at/publication/formalizing-graph-trail-properties-in-isabelle-hol-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/formalizing-graph-trail-properties-in-isabelle-hol-2/MaxSAT-Based Postprocessing for Treedepthhttps://ac.tuwien.ac.at/publication/maxsat-based-postprocessing-for-treedepth-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/maxsat-based-postprocessing-for-treedepth-2/On the Parameterized Complexity of Clusteringhttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering/Short Q-Resolution Proofs with Homomorphismshttps://ac.tuwien.ac.at/publication/short-q-resolution-proofs-with-homomorphisms-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-q-resolution-proofs-with-homomorphisms-2/Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problemhttps://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem-2/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-2/Threshold Treewidth and Hypertree Widthhttps://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-2/A Join-Based Hybrid Parameter for Constraint Satisfactionhttps://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction-2/A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Threehttps://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/A SAT Approach to Branchwidthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-4/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-4/A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resourceshttps://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/Combining Resolution-Path Dependencies with Dependency Learninghttps://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning-2/Finding Longest Common Subsequences: New A* Anytime Resultshttps://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resourceshttps://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/Proof Complexity of Fragments of Long-Distance Q-resolutionhttps://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution-2/SAT-Encodings for Treecut Width and Treedepthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth-2/The Parameterized Complexity of Cascading Portfolio Schedulinghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling-2/A Model for Finding Transition-Minorshttps://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/A SAT Approach for Finding Sup-Transition-Minorshttps://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problemhttps://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem-2/An SMT Approach to Fractional Hypertree Widthhttps://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width-2/Anytime Algorithms for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/Exact approaches for the directed network design problem with relayshttps://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays-2/On the Parameterized Complexity of (k,s)-SAThttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-k-s-sat/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-k-s-sat/Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatmentshttps://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-with-limited-starting-time-variations-of-daily-treatments/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-with-limited-starting-time-variations-of-daily-treatments/Polynomial-Time Validation of QCDCL Certificateshttps://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates-2/Portfolio-Based Algorithm Selection for Circuit QBFshttps://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-3/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-3/QBF Encodings of Chess Problemshttps://ac.tuwien.ac.at/publication/qbf-encodings-of-chess-problems/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/qbf-encodings-of-chess-problems/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/An Iterative Time-Bucket Refinement Algorithm for a High Resolution Resource-Constrained Project Scheduling Problemhttps://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem/Backdoor Treewidth for SAThttps://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat/Dependency Learning for QBFhttps://ac.tuwien.ac.at/publication/dependency-learning-for-qbf/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/dependency-learning-for-qbf/Free Weak Nilpotent Minimum Algebrashttps://ac.tuwien.ac.at/publication/free-weak-nilpotent-minimum-algebras/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/free-weak-nilpotent-minimum-algebras/New Width Parameters for Model Countinghttps://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting-2/On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instanceshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances/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/SAT-Based Local Improvement for Finding Tree Decompositions of Small Widthhttps://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width-2/SAT-Encodings for Special Treewidth and Pathwidthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth-2/The Treewidth of Proofshttps://ac.tuwien.ac.at/publication/the-treewidth-of-proofs/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-treewidth-of-proofs/A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demandshttps://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands/Fri, 01 Jan 2016 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/Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-procedure-in-judgment-aggregation/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-procedure-in-judgment-aggregation/Parameterized Complexity Results for Agenda Safety in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-3/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-3/Positive and Negative Results for Parameterized Compilabilityhttps://ac.tuwien.ac.at/publication/positive-and-negative-results-for-parameterized-compilability/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/positive-and-negative-results-for-parameterized-compilability/Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decompositionhttps://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/An Overview of Non-Uniform Parameterized Complexityhttps://ac.tuwien.ac.at/publication/an-overview-of-non-uniform-parameterized-complexity/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-overview-of-non-uniform-parameterized-complexity/Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Younghttps://ac.tuwien.ac.at/publication/complexity-of-the-winner-determination-problem-in-judgment-aggregation-kemeny-slater-tideman-young-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-of-the-winner-determination-problem-in-judgment-aggregation-kemeny-slater-tideman-young-2/Exact Approaches for Network Design Problems with Relayshttps://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays-2/Machine Characterizations for Parameterized Complexity Classes Beyond Para-NPhttps://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np-2/Parameterized Complexity Results for Symbolic Model Checking of Temporal Logicshttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics/Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchyhttps://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy/PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/Backdoors to Tractable Answer-Set Programminghttps://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming-2/Backdoors to Acyclic SAThttps://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat/Backdoors to Satisfactionhttps://ac.tuwien.ac.at/publication/backdoors-to-satisfaction/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction/On Stabilized Branch-and-Price for Constrained Tree Problemshttps://ac.tuwien.ac.at/publication/on-stabilized-branch-and-price-for-constrained-tree-problems/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-stabilized-branch-and-price-for-constrained-tree-problems/Branch-and-Cut-and-Price for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location/Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhood-search-for-capacitated-connected-facility-location/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhood-search-for-capacitated-connected-facility-location/Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templateshttps://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates/Mon, 01 Sep 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates/(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem/The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/The Multidimensional Knapsack Problem: Structure and Algorithmshttps://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/Sat, 01 Jan 2005 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/Automated Drawing of Metro Mapshttps://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps-2/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps-2/Biased Mutation Operators for Subgraph-Selection Problemshttps://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problemhttps://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem/Thu, 01 Jan 2004 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/Models and Algorithms for Three-Stage Two-Dimensional Bin Packinghttps://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractablehttps://ac.tuwien.ac.at/publication/minimal-unsatisfiable-formulas-with-bounded-clause-variable-difference-are-fixed-parameter-tractable/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimal-unsatisfiable-formulas-with-bounded-clause-variable-difference-are-fixed-parameter-tractable/