1 | AC Group | TU Wienhttps://ac.tuwien.ac.at/publication-type/1/1Hugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png1https://ac.tuwien.ac.at/publication-type/1/A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximizationhttps://ac.tuwien.ac.at/publication/a-construct-merge-solve-and-adapt-heuristic-for-least-cost-influence-maximization/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-construct-merge-solve-and-adapt-heuristic-for-least-cost-influence-maximization/A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphshttps://ac.tuwien.ac.at/publication/a-denoising-diffusion-adaptive-search-for-the-alpha-domination-problem-on-social-graphs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-denoising-diffusion-adaptive-search-for-the-alpha-domination-problem-on-social-graphs/A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problemhttps://ac.tuwien.ac.at/publication/a-denoising-diffusion-based-evolutionary-algorithm-framework-application-to-the-maximum-independent-set-problem/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-denoising-diffusion-based-evolutionary-algorithm-framework-application-to-the-maximum-independent-set-problem/A Fixed-Parameter Algorithm for Extending Upward Planar Drawingshttps://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-fixed-parameter-algorithm-for-extending-upward-planar-drawings/A Parameterized-Complexity Framework for Finding Local Optimahttps://ac.tuwien.ac.at/publication/a-parameterized-complexity-framework-for-finding-local-optima/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-complexity-framework-for-finding-local-optima/A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphshttps://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problemhttps://ac.tuwien.ac.at/publication/a-reinforcement-learning-guided-large-neighborhood-search-for-the-dynamic-electric-autonomous-dial-a-ride-problem/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-reinforcement-learning-guided-large-neighborhood-search-for-the-dynamic-electric-autonomous-dial-a-ride-problem/Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Designhttps://ac.tuwien.ac.at/publication/agentic-neurosymbolic-collaboration-for-mathematical-discovery-a-case-study-in-combinatorial-design/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/agentic-neurosymbolic-collaboration-for-mathematical-discovery-a-case-study-in-combinatorial-design/Algorithm Selection with Zero Domain Knowledge via Text Embeddingshttps://ac.tuwien.ac.at/publication/algorithm-selection-with-zero-domain-knowledge-via-text-embeddings/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithm-selection-with-zero-domain-knowledge-via-text-embeddings/ASP-Bench: From Natural Language to Logic Programshttps://ac.tuwien.ac.at/publication/asp-bench-from-natural-language-to-logic-programs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/asp-bench-from-natural-language-to-logic-programs/Bilateral Treewidth for QBF: Where Strategies and Resolution Meethttps://ac.tuwien.ac.at/publication/bilateral-treewidth-for-qbf-where-strategies-and-resolution-meet/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/bilateral-treewidth-for-qbf-where-strategies-and-resolution-meet/Circle Graph 3-Coloring: Can Simplicity Beat SAT?https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/Clarity and Computational Efficiency of Orbital Boundary Labelinghttps://ac.tuwien.ac.at/publication/clarity-and-computational-efficiency-of-orbital-boundary-labeling/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/clarity-and-computational-efficiency-of-orbital-boundary-labeling/Combined Network and Set Visualization with Hoop and Linear Diagramshttps://ac.tuwien.ac.at/publication/combined-network-and-set-visualization-with-hoop-and-linear-diagrams/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/combined-network-and-set-visualization-with-hoop-and-linear-diagrams/Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithmshttps://ac.tuwien.ac.at/publication/computing-probabilistic-explanations-for-ml-models-fixed-parameter-algorithms/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-probabilistic-explanations-for-ml-models-fixed-parameter-algorithms/Computing Twin-Width via Treedepth and Vertex Integrityhttps://ac.tuwien.ac.at/publication/computing-twin-width-via-treedepth-and-vertex-integrity/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-via-treedepth-and-vertex-integrity/ContReAct: A Feedback-Based Architecture for Continuous Agentic Operationhttps://ac.tuwien.ac.at/publication/contreact-a-feedback-based-architecture-for-continuous-agentic-operation/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/contreact-a-feedback-based-architecture-for-continuous-agentic-operation/Coordinated Motion Planning Is FPT on Discretized Simple Polygonshttps://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/coordinated-motion-planning-is-fpt-on-discretized-simple-polygons/CP-Agent: Agentic Constraint Programminghttps://ac.tuwien.ac.at/publication/cp-agent-agentic-constraint-programming/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/cp-agent-agentic-constraint-programming/Determining Destroy Sets in Large Neighborhood Search by Generative Flow Networkshttps://ac.tuwien.ac.at/publication/determining-destroy-sets-in-large-neighborhood-search-by-generative-flow-networks/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/determining-destroy-sets-in-large-neighborhood-search-by-generative-flow-networks/Fair Correlation Clustering Meets Graph Parametershttps://ac.tuwien.ac.at/publication/fair-correlation-clustering-meets-graph-parameters/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/fair-correlation-clustering-meets-graph-parameters/Fine-Grained Complexity of Computing Degree-Constrained Spanning Treeshttps://ac.tuwien.ac.at/publication/fine-grained-complexity-of-computing-degree-constrained-spanning-trees/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/fine-grained-complexity-of-computing-degree-constrained-spanning-trees/Formally Verified Graph Generation with SAT Modulo Symmetries and Leanhttps://ac.tuwien.ac.at/publication/formally-verified-graph-generation-with-sat-modulo-symmetries-and-lean/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/formally-verified-graph-generation-with-sat-modulo-symmetries-and-lean/Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchyhttps://ac.tuwien.ac.at/publication/gateways-to-tractability-for-satisfiability-in-pearls-causal-hierarchy/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/gateways-to-tractability-for-satisfiability-in-pearls-causal-hierarchy/Graph Choosability via SAT: Beyond the Nullstellensatzhttps://ac.tuwien.ac.at/publication/graph-choosability-via-sat-beyond-the-nullstellensatz/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/graph-choosability-via-sat-beyond-the-nullstellensatz/Learning to Predict User Replies in Interactive Job Schedulinghttps://ac.tuwien.ac.at/publication/learning-to-predict-user-replies-in-interactive-job-scheduling/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-to-predict-user-replies-in-interactive-job-scheduling/LLM-Guided Graph Generation for Structure-Based Local Improvement Methodshttps://ac.tuwien.ac.at/publication/llm-guided-graph-generation-for-structure-based-local-improvement-methods/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/llm-guided-graph-generation-for-structure-based-local-improvement-methods/LLM-Guided Semantic Vtrees for SDD Compilationhttps://ac.tuwien.ac.at/publication/llm-guided-semantic-vtrees-for-sdd-compilation/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/llm-guided-semantic-vtrees-for-sdd-compilation/Makespan Minimization in Split Learning: From Theory to Practicehttps://ac.tuwien.ac.at/publication/makespan-minimization-in-split-learning-from-theory-to-practice/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/makespan-minimization-in-split-learning-from-theory-to-practice/Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/matrix-editing-meets-fair-clustering-parameterized-algorithms-and-complexity/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/matrix-editing-meets-fair-clustering-parameterized-algorithms-and-complexity/MaxSAT-Based Compression for Tsetlin Machineshttps://ac.tuwien.ac.at/publication/maxsat-based-compression-for-tsetlin-machines/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/maxsat-based-compression-for-tsetlin-machines/Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchieshttps://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/Neurosymbolic Discovery of Algebraic Graph Constructionshttps://ac.tuwien.ac.at/publication/neurosymbolic-discovery-of-algebraic-graph-constructions/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/neurosymbolic-discovery-of-algebraic-graph-constructions/Not All Degree Constraints Are Created Equal when Computing Spanning Treeshttps://ac.tuwien.ac.at/publication/not-all-degree-constraints-are-created-equal-when-computing-spanning-trees/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/not-all-degree-constraints-are-created-equal-when-computing-spanning-trees/On the Complexity of Extending Storylineshttps://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/On the Recognition of Outerplanar Graphs with Queue Number 1https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/One-Sided Local Crossing Minimizationhttps://ac.tuwien.ac.at/publication/one-sided-local-crossing-minimization/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/one-sided-local-crossing-minimization/Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraintshttps://ac.tuwien.ac.at/publication/paged-geophylogenies-a-coloring-approach-to-external-labeling-with-tree-constraints/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/paged-geophylogenies-a-coloring-approach-to-external-labeling-with-tree-constraints/Parameterized Complexity of Efficient Sortationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-efficient-sortation/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-efficient-sortation/Perfect Rectangular Tilings with Two Colorshttps://ac.tuwien.ac.at/publication/perfect-rectangular-tilings-with-two-colors/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/perfect-rectangular-tilings-with-two-colors/Point Set Embeddability with List Constraintshttps://ac.tuwien.ac.at/publication/point-set-embeddability-with-list-constraints/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/point-set-embeddability-with-list-constraints/Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphshttps://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/Realizing Planar Linkages in Polygonal Domainshttps://ac.tuwien.ac.at/publication/realizing-planar-linkages-in-polygonal-domains/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/realizing-planar-linkages-in-polygonal-domains/Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radiihttps://ac.tuwien.ac.at/publication/revisiting-graph-modification-via-disk-scaling-from-one-radius-to-interval-based-radii/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-graph-modification-via-disk-scaling-from-one-radius-to-interval-based-radii/SAT-Based Search for Minwise Independent Familieshttps://ac.tuwien.ac.at/publication/sat-based-search-for-minwise-independent-families/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-search-for-minwise-independent-families/Search Space Reduction Through Machine Learning for the Electric Autonomous Dial-A-Ride Problemhttps://ac.tuwien.ac.at/publication/search-space-reduction-through-machine-learning-for-the-electric-autonomous-dial-a-ride-problem/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/search-space-reduction-through-machine-learning-for-the-electric-autonomous-dial-a-ride-problem/Smart Cubing for Graph Search: A Comparative Studyhttps://ac.tuwien.ac.at/publication/smart-cubing-for-graph-search-a-comparative-study/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/smart-cubing-for-graph-search-a-comparative-study/Streamliners for Answer Set Programminghttps://ac.tuwien.ac.at/publication/streamliners-for-answer-set-programming/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/streamliners-for-answer-set-programming/Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checkinghttps://ac.tuwien.ac.at/publication/strong-d-qbf-dependency-schemes-via-pure-paths-with-applications-to-proof-checking/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-d-qbf-dependency-schemes-via-pure-paths-with-applications-to-proof-checking/Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problemhttps://ac.tuwien.ac.at/publication/superstrings-of-uniform-cardinality-set-systems-via-the-generalized-traveling-salesperson-problem/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/superstrings-of-uniform-cardinality-set-systems-via-the-generalized-traveling-salesperson-problem/Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selectionhttps://ac.tuwien.ac.at/publication/synthesizing-feature-extractors-an-agentic-approach-for-algorithm-selection/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/synthesizing-feature-extractors-an-agentic-approach-for-algorithm-selection/The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Patternhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Patternhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern/The Graph Burning Problem under Constrained Diffusionhttps://ac.tuwien.ac.at/publication/the-graph-burning-problem-under-constrained-diffusion/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-graph-burning-problem-under-constrained-diffusion/The Peculiarities of Extending Queue Layoutshttps://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts/Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networkshttps://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractability-via-low-dimensionality-the-parameterized-complexity-of-training-quantized-neural-networks/Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithmshttps://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms-2/Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithmshttps://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-layer-drawings-with-a-tree-on-top-vertex-splits-and-fixed-parameter-algorithms/Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawingshttps://ac.tuwien.ac.at/publication/using-beta-proximity-to-reduce-distortion-in-bundled-graph-drawings/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-beta-proximity-to-reduce-distortion-in-bundled-graph-drawings/VIPR Certificate Construction from Black-Box ILP Solvershttps://ac.tuwien.ac.at/publication/vipr-certificate-construction-from-black-box-ilp-solvers/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/vipr-certificate-construction-from-black-box-ilp-solvers/A Hybrid CMSA–Column Generation Approach to Variable-Sized Bin Packinghttps://ac.tuwien.ac.at/publication/a-hybrid-cmsa-column-generation-approach-to-variable-sized-bin-packing/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-cmsa-column-generation-approach-to-variable-sized-bin-packing/A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problemhttps://ac.tuwien.ac.at/publication/a-learning-twolevel-optimization-approach-for-the-demand-maximizing-battery-swapping-station-location-problem/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-learning-twolevel-optimization-approach-for-the-demand-maximizing-battery-swapping-station-location-problem/A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robotshttps://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-minor-testing-approach-for-coordinated-motion-planning-with-sliding-robots/A Structural Complexity Analysis of Hierarchical Task Network Planninghttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/Analyzing Reformulation Performance in Core-Guided MaxSAT Solvinghttps://ac.tuwien.ac.at/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/Approximate Evaluation of Quantitative Second Order Querieshttps://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Balancing Latin Rectangles with LLM-Generated Streamlinershttps://ac.tuwien.ac.at/publication/balancing-latin-rectangles-with-llm-generated-streamliners/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-latin-rectangles-with-llm-generated-streamliners/Better Extension Variables in DQBF via Independencehttps://ac.tuwien.ac.at/publication/better-extension-variables-in-dqbf-via-independence/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/better-extension-variables-in-dqbf-via-independence/Breaking Symmetries in Quantified Graph Search: A Comparative Studyhttps://ac.tuwien.ac.at/publication/breaking-symmetries-in-quantified-graph-search-a-comparative-study/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/breaking-symmetries-in-quantified-graph-search-a-comparative-study/Bridging Language Models and Symbolic Solvers via the Model Context Protocolhttps://ac.tuwien.ac.at/publication/bridging-language-models-and-symbolic-solvers-via-the-model-context-protocol/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/bridging-language-models-and-symbolic-solvers-via-the-model-context-protocol/Complexity of Positive Influence Domination on Partial Gridshttps://ac.tuwien.ac.at/publication/complexity-of-positive-influence-domination-on-partial-grids/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-of-positive-influence-domination-on-partial-grids/Crossing and Independent Families Among Polygonshttps://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-and-independent-families-among-polygons/Extracting Problem Structure with LLMs for Optimized SAT Local Searchhttps://ac.tuwien.ac.at/publication/extracting-problem-structure-with-llms-for-optimized-sat-local-search/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/extracting-problem-structure-with-llms-for-optimized-sat-local-search/Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problemhttps://ac.tuwien.ac.at/publication/genetic-programming-hyper-heuristic-for-the-dynamic-electric-dial-a-ride-problem/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/genetic-programming-hyper-heuristic-for-the-dynamic-electric-dial-a-ride-problem/Geometry Matters in Planar Storyplanshttps://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithmshttps://ac.tuwien.ac.at/publication/hot-off-the-press-near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/hot-off-the-press-near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Improvements in Large Neighborhood Search for the Electric Autonomous Dial-a-Ride Problemhttps://ac.tuwien.ac.at/publication/improvements-in-large-neighborhood-search-for-the-electric-autonomous-dial-a-ride-problem/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/improvements-in-large-neighborhood-search-for-the-electric-autonomous-dial-a-ride-problem/Large and Parallel Human Sorting Networkshttps://ac.tuwien.ac.at/publication/large-and-parallel-human-sorting-networks/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/large-and-parallel-human-sorting-networks/Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Findinghttps://ac.tuwien.ac.at/publication/learning-to-select-promising-initial-solutions-for-large-neighborhood-search-based-multi-agent-path-finding/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-to-select-promising-initial-solutions-for-large-neighborhood-search-based-multi-agent-path-finding/Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regimehttps://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime-2/Linear Layouts Revisited: Stacks, Queues, and Exact Algorithmshttps://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/Merge-Width and First-Order Model Checkinghttps://ac.tuwien.ac.at/publication/merge-width-and-first-order-model-checking/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/merge-width-and-first-order-model-checking/Metric Dimension and Geodetic Set Parameterized by Vertex Coverhttps://ac.tuwien.ac.at/publication/metric-dimension-and-geodetic-set-parameterized-by-vertex-cover/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-and-geodetic-set-parameterized-by-vertex-cover/On Minimizing Wiggle in Stacked Area Chartshttps://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/On Planar Unit-Length Linear Linkages in Polygonal Domainshttps://ac.tuwien.ac.at/publication/on-planar-unit-length-linear-linkages-in-polygonal-domains/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-planar-unit-length-linear-linkages-in-polygonal-domains/Optimal Decision Tree Pruning Revisited: Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/Optimizing Wiggle in Storylineshttps://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/PACE Solver Description: Bad Dominating Set Makerhttps://ac.tuwien.ac.at/publication/pace-solver-description-bad-dominating-set-maker/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-bad-dominating-set-maker/Parameterized Algorithms for Multiagent Pathfinding on Treeshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-multiagent-pathfinding-on-trees/Parameterized Complexity of Caching in Networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-caching-in-networks/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-caching-in-networks/Partial Level Planarity Parameterized by the Size of the Missing Graphhttps://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/Pathways to Tractability for Geometric Thicknesshttps://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness/Pathways to Tractability for Geometric Thickness (Best Paper Award)https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/pathways-to-tractability-for-geometric-thickness-best-paper-award/Quantum Speedups for Polynomial-Time Dynamic Programming Algorithmshttps://ac.tuwien.ac.at/publication/quantum-speedups-for-polynomial-time-dynamic-programming-algorithms/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantum-speedups-for-polynomial-time-dynamic-programming-algorithms/Representing Hypergraphs by Point-Line Incidenceshttps://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/Routing Few Robots in a Crowded Networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network/SAT Modulo Symmetries: A Surveyhttps://ac.tuwien.ac.at/publication/sat-modulo-symmetries-a-survey/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-a-survey/Selecting User Queries in Interactive Job Schedulinghttps://ac.tuwien.ac.at/publication/selecting-user-queries-in-interactive-job-scheduling/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/selecting-user-queries-in-interactive-job-scheduling/StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamlinershttps://ac.tuwien.ac.at/publication/streamllm-enhancing-constraint-programming-with-large-language-model-generated-streamliners/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/streamllm-enhancing-constraint-programming-with-large-language-model-generated-streamliners/Structural Parameterizations of Simultaneous Planarityhttps://ac.tuwien.ac.at/publication/structural-parameterizations-of-simultaneous-planarity/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/structural-parameterizations-of-simultaneous-planarity/Tackling the Alpha-Domination Problem Heuristicallyhttps://ac.tuwien.ac.at/publication/tackling-the-alpha-domination-problem-heuristically/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/tackling-the-alpha-domination-problem-heuristically/The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagatorshttps://ac.tuwien.ac.at/publication/the-3-decomposition-conjecture-a-sat-based-approach-with-specialized-propagators/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-3-decomposition-conjecture-a-sat-based-approach-with-specialized-propagators/The Complexity of Extending Fair Allocations of Indivisible Goodshttps://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods/The Computational Complexity of Positive Non-Clashing Teaching in Graphshttps://ac.tuwien.ac.at/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/The Peculiarities of Extending Queue Layoutshttps://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-peculiarities-of-extending-queue-layouts-2/Training One-Dimensional Graph Neural Networks is NP-Hardhttps://ac.tuwien.ac.at/publication/training-one-dimensional-graph-neural-networks-is-np-hard/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/training-one-dimensional-graph-neural-networks-is-np-hard/Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approachhttps://ac.tuwien.ac.at/publication/uncovering-and-verifying-optimal-community-structure-in-complex-networks-a-maxsat-approach/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/uncovering-and-verifying-optimal-community-structure-in-complex-networks-a-maxsat-approach/Visualizing Treewidthhttps://ac.tuwien.ac.at/publication/visualizing-treewidth/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-treewidth/A General Theoretical Framework for Learning Smallest Interpretable Modelshttps://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-neural-network-based-guidance-for-a-brkga-an-application-to-the-longest-common-square-subsequence-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-neural-network-based-guidance-for-a-brkga-an-application-to-the-longest-common-square-subsequence-problem/A Simulated Annealing Based Approach for the Roman Domination Problemhttps://ac.tuwien.ac.at/publication/a-simulated-annealing-based-approach-for-the-roman-domination-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-simulated-annealing-based-approach-for-the-roman-domination-problem/A Tight Subexponential-Time Algorithm for Two-Page Book Embeddinghttps://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/ASP-QRAT: A Conditionally Optimal Dual Proof System for ASPhttps://ac.tuwien.ac.at/publication/asp-qrat-a-conditionally-optimal-dual-proof-system-for-asp/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/asp-qrat-a-conditionally-optimal-dual-proof-system-for-asp/Boundary Labeling in a Circular Orbithttps://ac.tuwien.ac.at/publication/boundary-labeling-in-a-circular-orbit/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-in-a-circular-orbit/Bundling-Aware Graph Drawinghttps://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/Compilation and Fast Model Counting beyond CNFhttps://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/Computing small Rainbow Cycle Numbers with SAT modulo Symmetrieshttps://ac.tuwien.ac.at/publication/computing-small-rainbow-cycle-numbers-with-sat-modulo-symmetries/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-small-rainbow-cycle-numbers-with-sat-modulo-symmetries/Computing Twin-Width Parameterized by the Feedback Edge Numberhttps://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-parameterized-by-the-feedback-edge-number/Constrained Boundary Labelinghttps://ac.tuwien.ac.at/publication/constrained-boundary-labeling/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/constrained-boundary-labeling/Counting Vanishing Matrix-Vector Productshttps://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)https://ac.tuwien.ac.at/publication/crossing-number-is-np-hard-for-constant-path-width-and-tree-width/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-number-is-np-hard-for-constant-path-width-and-tree-width/Enumerating Minimal Solution Sets for Metric Graph Problemshttps://ac.tuwien.ac.at/publication/enumerating-minimal-solution-sets-for-metric-graph-problems/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/enumerating-minimal-solution-sets-for-metric-graph-problems/eSLIM: Circuit Minimization with SAT Based Local Improvementhttps://ac.tuwien.ac.at/publication/eslim-circuit-minimization-with-sat-based-local-improvement/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/eslim-circuit-minimization-with-sat-based-local-improvement/Exact Algorithms for Clustered Planarity with Linear Saturatorshttps://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/Explaining Decisions in ML Models: A Parameterized Complexity Analysishttps://ac.tuwien.ac.at/publication/explaining-decisions-in-ml-models-a-parameterized-complexity-analysis/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/explaining-decisions-in-ml-models-a-parameterized-complexity-analysis/First-Order Model Checking on Monadically Stable Graph Classeshttps://ac.tuwien.ac.at/publication/first-order-model-checking-on-monadically-stable-graph-classes/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-model-checking-on-monadically-stable-graph-classes/Flip-breakability: A combinatorial dichotomy for monadically dependent graph classeshttps://ac.tuwien.ac.at/publication/flip-breakability-a-combinatorial-dichotomy-for-monadically-dependent-graph-classes/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/flip-breakability-a-combinatorial-dichotomy-for-monadically-dependent-graph-classes/Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Timehttps://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time/GdMetriX - A NetworkX Extension For Graph Drawing Metricshttps://ac.tuwien.ac.at/publication/gdmetrix-a-networkx-extension-for-graph-drawing-metrics/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/gdmetrix-a-networkx-extension-for-graph-drawing-metrics/Generating All Invertible Matrices by Row Operationshttps://ac.tuwien.ac.at/publication/generating-all-invertible-matrices-by-row-operations/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/generating-all-invertible-matrices-by-row-operations/Hardness of Random Reordered Encodings of Parity for Resolution and CDCLhttps://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/Hoop Diagrams: A Set Visualization Methodhttps://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problemhttps://ac.tuwien.ac.at/publication/hot-off-the-press-the-first-proven-performance-guarantees-for-the-non-dominated-sorting-genetic-algorithm-ii-nsga-ii-on-a-combinatorial-optimization-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hot-off-the-press-the-first-proven-performance-guarantees-for-the-non-dominated-sorting-genetic-algorithm-ii-nsga-ii-on-a-combinatorial-optimization-problem/Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimensionhttps://ac.tuwien.ac.at/publication/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension/Introducing Fairness in Graph Visualizationhttps://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization/Introducing Fairness in Graph Visualization via Gradient Descenthttps://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization-via-gradient-descent/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization-via-gradient-descent/Learning Small Decision Trees for Data of Low Rank-Widthhttps://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertionhttps://ac.tuwien.ac.at/publication/letting-a-large-neighborhood-search-for-an-electric-dial-a-ride-problem-fly-on-the-fly-charging-station-insertion/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/letting-a-large-neighborhood-search-for-an-electric-dial-a-ride-problem-fly-on-the-fly-charging-station-insertion/Minimizing Corners in Colored Rectilinear Gridshttps://ac.tuwien.ac.at/publication/minimizing-corners-in-colored-rectilinear-grids/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-corners-in-colored-rectilinear-grids/Minimizing Switches in Cased Graph Drawingshttps://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-switches-in-cased-graph-drawings/Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problemhttps://ac.tuwien.ac.at/publication/mixed-integer-linear-programming-based-large-neighborhood-search-approaches-for-the-directed-feedback-vertex-set-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-integer-linear-programming-based-large-neighborhood-search-approaches-for-the-directed-feedback-vertex-set-problem/Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithmshttps://ac.tuwien.ac.at/publication/near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/near-tight-runtime-guarantees-for-many-objective-evolutionary-algorithms/Non-Clashing Teaching Maps for Balls in Graphshttps://ac.tuwien.ac.at/publication/non-clashing-teaching-maps-for-balls-in-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/non-clashing-teaching-maps-for-balls-in-graphs/On the Complexity of Community-aware Network~Sparsificationhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-community-aware-network-sparsification/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-community-aware-network-sparsification/PACE Solver Description: CRGonehttps://ac.tuwien.ac.at/publication/pace-solver-description-crgone/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-crgone/Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energyhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-coordinated-motion-planning-minimizing-energy/Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Coverhttps://ac.tuwien.ac.at/publication/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover/Revisiting Causal Discovery from a Complexity-Theoretic Perspectivehttps://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawingshttps://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/SAT-Based Tree Decomposition with Iterative Cascading Policy Selectionhttps://ac.tuwien.ac.at/publication/sat-based-tree-decomposition-with-iterative-cascading-policy-selection/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-tree-decomposition-with-iterative-cascading-policy-selection/Small unsatisfiable k-CNFs with bounded literal occurrencehttps://ac.tuwien.ac.at/publication/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence/Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networkshttps://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-strengthening-cuts-with-graph-neural-networks/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-strengthening-cuts-with-graph-neural-networks/Structure-guided Local Improvement for Maximum Satisfiabilityhttps://ac.tuwien.ac.at/publication/structure-guided-local-improvement-for-maximum-satisfiability/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/structure-guided-local-improvement-for-maximum-satisfiability/SubModST: A Fast Generic Solver for Submodular~Maximization with Size Constraintshttps://ac.tuwien.ac.at/publication/submodst-a-fast-generic-solver-for-submodular-maximization-with-size-constraints/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/submodst-a-fast-generic-solver-for-submodular-maximization-with-size-constraints/The Complexity of Cluster Vertex Splitting and Companyhttps://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/The Complexity of Fair Division of Indivisible Items with Externalitieshttps://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-fair-division-of-indivisible-items-with-externalities/The Complexity of Optimizing Atomic Congestionhttps://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(\geq\) 5https://ac.tuwien.ac.at/publication/the-k-opt-algorithm-for-the-traveling-salesman-problem-has-exponential-running-time-for-k-geq-5/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-k-opt-algorithm-for-the-traveling-salesman-problem-has-exponential-running-time-for-k-geq-5/The Parameterized Complexity Landscape of the Unsplittable Flow Problemhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem/The Parameterized Complexity of Extending Stack Layoutshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts/The Parameterized Complexity Of Extending Stack Layoutshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-extending-stack-layouts-3/The Power of Collaboration: Learning Large Bayesian Networks at Scalehttps://ac.tuwien.ac.at/publication/the-power-of-collaboration-learning-large-bayesian-networks-at-scale/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-power-of-collaboration-learning-large-bayesian-networks-at-scale/Twin-Width Meets Feedback Edges and Vertex Integrityhttps://ac.tuwien.ac.at/publication/twin-width-meets-feedback-edges-and-vertex-integrity/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/twin-width-meets-feedback-edges-and-vertex-integrity/A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Setshttps://ac.tuwien.ac.at/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/A logic-based algorithmic meta-theorem for mim-widthhttps://ac.tuwien.ac.at/publication/a-logic-based-algorithmic-meta-theorem-for-mim-width/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-logic-based-algorithmic-meta-theorem-for-mim-width/A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planninghttps://ac.tuwien.ac.at/publication/a-multilevel-optimization-approach-for-large-scale-battery-exchange-station-location-planning/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multilevel-optimization-approach-for-large-scale-battery-exchange-station-location-planning/A Parameterized Theory of PAC Learninghttps://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/A Policy-Based Learning Beam Search for Combinatorial Optimizationhttps://ac.tuwien.ac.at/publication/a-policy-based-learning-beam-search-for-combinatorial-optimization/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-policy-based-learning-beam-search-for-combinatorial-optimization/A Polyhedral Perspective on Tropical Convolutionshttps://ac.tuwien.ac.at/publication/a-polyhedral-perspective-on-tropical-convolutions/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-polyhedral-perspective-on-tropical-convolutions/A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-the-longest-common-subsequence-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-the-longest-common-subsequence-problem/A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecturehttps://ac.tuwien.ac.at/publication/a-sat-solver-s-opinion-on-the-erdos-faber-lovasz-conjecture/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-solver-s-opinion-on-the-erdos-faber-lovasz-conjecture/A Structural Complexity Analysis of Synchronous Dynamical Systemshttps://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-complexity-analysis-of-synchronous-dynamical-systems/An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicleshttps://ac.tuwien.ac.at/publication/an-evolutionary-approach-for-scheduling-a-fleet-of-shared-electric-vehicles/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-approach-for-scheduling-a-fleet-of-shared-electric-vehicles/Block Crossings in One-Sided Tanglegramshttps://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/Circuit Minimization with Exact Synthesis: From QBF Back to SAThttps://ac.tuwien.ac.at/publication/circuit-minimization-with-exact-synthesis-from-qbf-back-to-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/circuit-minimization-with-exact-synthesis-from-qbf-back-to-sat/Circuit Minimization with QBF-Based Exact Synthesishttps://ac.tuwien.ac.at/publication/circuit-minimization-with-qbf-based-exact-synthesis/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/circuit-minimization-with-qbf-based-exact-synthesis/Co-Certificate Learning with SAT Modulo Symmetrieshttps://ac.tuwien.ac.at/publication/co-certificate-learning-with-sat-modulo-symmetries/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/co-certificate-learning-with-sat-modulo-symmetries/Computing Hive Plots: A Combinatorial Frameworkhttps://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework/Computing twin-width with SAT and branch \& boundhttps://ac.tuwien.ac.at/publication/computing-twin-width-with-sat-and-branch-bound/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-with-sat-and-branch-bound/Consistency Checking Problems: A Gateway to Parameterized Sample Complexityhttps://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/Crossing Minimization in Time Interval Storylineshttps://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/Deterministic Constrained Multilinear Detectionhttps://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/deterministic-constrained-multilinear-detection/Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyondhttps://ac.tuwien.ac.at/publication/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond/Exact Algorithms for Group Closeness Centralityhttps://ac.tuwien.ac.at/publication/exact-algorithms-for-group-closeness-centrality/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-algorithms-for-group-closeness-centrality/Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/Fast Convolutions for Near-Convex Sequenceshttps://ac.tuwien.ac.at/publication/fast-convolutions-for-near-convex-sequences/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/fast-convolutions-for-near-convex-sequences/First-Order Model Checking on Structurally Sparse Graph Classeshttps://ac.tuwien.ac.at/publication/first-order-model-checking-on-structurally-sparse-graph-classes/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-model-checking-on-structurally-sparse-graph-classes/Fixed-Parameter Algorithms for Computing RAC Drawings of Graphshttps://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs/From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problemhttps://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicityhttps://ac.tuwien.ac.at/publication/inconsistent-cores-for-asp-the-perks-and-perils-of-non-monotonicity/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/inconsistent-cores-for-asp-the-perks-and-perils-of-non-monotonicity/Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classeshttps://ac.tuwien.ac.at/publication/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes/Interactive Job Scheduling with Partially Known Personnel Availabilitieshttps://ac.tuwien.ac.at/publication/interactive-job-scheduling-with-partially-known-personnel-availabilities/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/interactive-job-scheduling-with-partially-known-personnel-availabilities/IPASIR-UP: User Propagators for CDCLhttps://ac.tuwien.ac.at/publication/ipasir-up-user-propagators-for-cdcl/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/ipasir-up-user-propagators-for-cdcl/Learning Small Decision Trees with Large Domainhttps://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/Maximizing Social Welfare in Score-Based Social Distance Gameshttps://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximizing-social-welfare-in-score-based-social-distance-games/Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlineshttps://ac.tuwien.ac.at/publication/multi-objective-policy-evolution-for-a-same-day-delivery-problem-with-soft-deadlines/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-objective-policy-evolution-for-a-same-day-delivery-problem-with-soft-deadlines/Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphshttps://ac.tuwien.ac.at/publication/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs/MySemCloud: Semantic-aware Word Cloud Editinghttps://ac.tuwien.ac.at/publication/mysemcloud-semantic-aware-word-cloud-editing/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/mysemcloud-semantic-aware-word-cloud-editing/New Complexity-Theoretic Frontiers of Tractability for Neural Network Traininghttps://ac.tuwien.ac.at/publication/new-complexity-theoretic-frontiers-of-tractability-for-neural-network-training/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-complexity-theoretic-frontiers-of-tractability-for-neural-network-training/On Computing Optimal Tree Ensembleshttps://ac.tuwien.ac.at/publication/on-computing-optimal-tree-ensembles/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-computing-optimal-tree-ensembles/On Families of Planar DAGs with Constant Stack Numberhttps://ac.tuwien.ac.at/publication/on-families-of-planar-dags-with-constant-stack-number/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-families-of-planar-dags-with-constant-stack-number/On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Modelhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-finding-a-sparse-connected-spanning-subgraph-in-a-non-uniform-failure-model/On the Complexity of the Storyplan Problemhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem/On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristicshttps://ac.tuwien.ac.at/publication/on-the-group-coverage-centrality-problem-parameterized-complexity-and-heuristics/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-group-coverage-centrality-problem-parameterized-complexity-and-heuristics/Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithmhttps://ac.tuwien.ac.at/publication/optimizing-the-positions-of-battery-swapping-stations-pilot-studies-and-layout-optimization-algorithm/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-the-positions-of-battery-swapping-stations-pilot-studies-and-layout-optimization-algorithm/PACE Solver Description: Touiouidthhttps://ac.tuwien.ac.at/publication/pace-solver-description-touiouidth/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-touiouidth/Planarizing Graphs and their Drawings by Vertex Splittinghttps://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/Proven optimally-balanced Latin rectangles with SAThttps://ac.tuwien.ac.at/publication/proven-optimally-balanced-latin-rectangles-with-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/proven-optimally-balanced-latin-rectangles-with-sat/Pseudorandom Finite Modelshttps://ac.tuwien.ac.at/publication/pseudorandom-finite-models/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/pseudorandom-finite-models/SAT-Based Generation of Planar Graphshttps://ac.tuwien.ac.at/publication/sat-based-generation-of-planar-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-generation-of-planar-graphs/Searching for smallest universal graphs and tournaments with SAThttps://ac.tuwien.ac.at/publication/searching-for-smallest-universal-graphs-and-tournaments-with-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/searching-for-smallest-universal-graphs-and-tournaments-with-sat/Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepthhttps://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth-2/Splitting Plane Graphs to Outerplanarityhttps://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity/Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBFhttps://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/The Computational Complexity of Concise Hypersphere Classificationhttps://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/The Influence of Dimensions on the Complexity of Computing Decision Treeshttps://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/The Parameterized Complexity of Coordinated Motion Planninghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-coordinated-motion-planning/The Parameterized Complexity of Finding Concise Local Explanationshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/The Parameterized Complexity of Network Microaggregationhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/Transitions in Dynamic Point Labelinghttps://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling/Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidthhttps://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculationhttps://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculationhttps://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applicationshttps://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-a-cooperative-optimization-approach-to-distribute-service-points-in-mobility-applications/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-a-cooperative-optimization-approach-to-distribute-service-points-in-mobility-applications/A Learning Large Neighborhood Search for the Staff Rerostering Problemhttps://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/A Reproducibility Study on User-centric MIR Research and Why it is Importanthttps://ac.tuwien.ac.at/publication/a-reproducibility-study-on-user-centric-mir-research-and-why-it-is-important/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-reproducibility-study-on-user-centric-mir-research-and-why-it-is-important/A SAT Approach to Twin-Widthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-twin-width/A SAT Attack on Rota’s Basis Conjecturehttps://ac.tuwien.ac.at/publication/a-sat-attack-on-rotas-basis-conjecture/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-attack-on-rotas-basis-conjecture/A Unifying Framework for Characterizing and Computing Width Measureshttps://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unifying-framework-for-characterizing-and-computing-width-measures/Bounding and Computing Obstacle Numbers of Graphshttps://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/Combinatorial and Algorithmic Aspects of Monadic Stabilityhttps://ac.tuwien.ac.at/publication/combinatorial-and-algorithmic-aspects-of-monadic-stability/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-and-algorithmic-aspects-of-monadic-stability/Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squareshttps://ac.tuwien.ac.at/publication/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares/Covering Many (Or Few) Edges with k Vertices in Sparse Graphshttps://ac.tuwien.ac.at/publication/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs/CSP Beyond Tractable Constraint Languageshttps://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages/Detours in Directed Graphshttps://ac.tuwien.ac.at/publication/detours-in-directed-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/detours-in-directed-graphs/Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cutshttps://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts/Finding a Cluster in Incomplete Datahttps://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/Fine-grained Complexity of Partial Minimum Satisfiabilityhttps://ac.tuwien.ac.at/publication/fine-grained-complexity-of-partial-minimum-satisfiability/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/fine-grained-complexity-of-partial-minimum-satisfiability/FPT Approximation for Fair Minimum-Load Clusteringhttps://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/Hedonic Diversity Games: A Complexity Picture with More than Two Colorshttps://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/hedonic-diversity-games-a-complexity-picture-with-more-than-two-colors/How to Find a Good Explanation for Clustering?https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problemshttps://ac.tuwien.ac.at/publication/learning-beam-search-utilizing-machine-learning-to-guide-beam-search-for-solving-combinatorial-optimization-problems/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-beam-search-utilizing-machine-learning-to-guide-beam-search-for-solving-combinatorial-optimization-problems/Learning Large Bayesian Networks with Expert Constraintshttps://ac.tuwien.ac.at/publication/learning-large-bayesian-networks-with-expert-constraints/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-large-bayesian-networks-with-expert-constraints/Longest Cycle above Erdős–Gallai Boundhttps://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/Lossy Kernelization of Same-Size Clusteringhttps://ac.tuwien.ac.at/publication/lossy-kernelization-of-same-size-clustering/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/lossy-kernelization-of-same-size-clustering/Minimum Link Fencinghttps://ac.tuwien.ac.at/publication/minimum-link-fencing/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimum-link-fencing/Model Checking on Interpretations of Classes of Bounded Local Cliquewidthhttps://ac.tuwien.ac.at/publication/model-checking-on-interpretations-of-classes-of-bounded-local-cliquewidth/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-checking-on-interpretations-of-classes-of-bounded-local-cliquewidth/Multidimensional Manhattan Preferenceshttps://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/On Computing Optimal Linear Diagramshttps://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/On Critical Node Problems with Vulnerable Verticeshttps://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-critical-node-problems-with-vulnerable-vertices/PACE Solver Description: DAGer - Cutting out Cycles with MaxSAThttps://ac.tuwien.ac.at/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/Parallel Beam Search for Combinatorial Optimizationhttps://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization/Parameterised Partially-Predrawn Crossing Numberhttps://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterised-partially-predrawn-crossing-number/Parameterized Algorithms for Upward Planarityhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Pedant: A Certifying DQBF Solverhttps://ac.tuwien.ac.at/publication/pedant-a-certifying-dqbf-solver/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/pedant-a-certifying-dqbf-solver/Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austriahttps://ac.tuwien.ac.at/publication/preface-47th-international-symposium-on-mathematical-foundations-of-computer-science-mfcs-2022-august-22-26-2022-vienna-austria/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/preface-47th-international-symposium-on-mathematical-foundations-of-computer-science-mfcs-2022-august-22-26-2022-vienna-austria/QCDCL with Cube Learning or Pure Literal Elimination - What is Best?https://ac.tuwien.ac.at/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/qcdcl-with-cube-learning-or-pure-literal-elimination-what-is-best/SAT Backdoors: Depth Beats Sizehttps://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)https://ac.tuwien.ac.at/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/Should Decisions in QCDCL Follow Prefix Order?https://ac.tuwien.ac.at/publication/should-decisions-in-qcdcl-follow-prefix-order/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/should-decisions-in-qcdcl-follow-prefix-order/Slim Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/slim-tree-cut-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/slim-tree-cut-width/Testing Upward Planarity of Partial 2-Treeshttps://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/The Complexity of Envy-Free Graph Cuttinghttps://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-envy-free-graph-cutting/The Complexity of k-Means Clustering when Little is Knownhttps://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/The Complexity of Temporal Vertex Cover in Small-Degree Graphshttps://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/The Parameterized Complexity of s-Club with Triangle and Seed Constraintshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints/Towards Uniform Certification in QBFhttps://ac.tuwien.ac.at/publication/towards-uniform-certification-in-qbf/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-uniform-certification-in-qbf/Tractable Abstract Argumentation via Backdoor-Treewidthhttps://ac.tuwien.ac.at/publication/tractable-abstract-argumentation-via-backdoor-treewidth/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-abstract-argumentation-via-backdoor-treewidth/Treelike Decompositions for Transductions of Sparse Graphshttps://ac.tuwien.ac.at/publication/treelike-decompositions-for-transductions-of-sparse-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/treelike-decompositions-for-transductions-of-sparse-graphs/Turbocharging Heuristics for Weak Coloring Numbershttps://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/Weighted Model Counting with Twin-Widthhttps://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Approximate Evaluation of First-Order Counting Querieshttps://ac.tuwien.ac.at/publication/approximate-evaluation-of-first-order-counting-queries/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximate-evaluation-of-first-order-counting-queries/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs/Balanced Independent and Dominating Sets on Colored Interval Graphshttps://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs-2/Certified DQBF Solving by Definition Extractionhttps://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction-2/Computing Kemeny Rankings from d-Euclidean Preferenceshttps://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-kemeny-rankings-from-d-euclidean-preferences/Computing Optimal Hypertree Decompositions with SAThttps://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat/Crossing-Optimal Extension of Simple Drawingshttps://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-optimal-extension-of-simple-drawings/Davis and Putnam Meet Henkin: Solving DQBF with Resolutionhttps://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution-2/Disjoint Box Covering in a Rectilinear Polygonhttps://ac.tuwien.ac.at/publication/disjoint-box-covering-in-a-rectilinear-polygon/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/disjoint-box-covering-in-a-rectilinear-polygon/Driver Shift Planning for an Online Store with Short Delivery Timeshttps://ac.tuwien.ac.at/publication/driver-shift-planning-for-an-online-store-with-short-delivery-times/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/driver-shift-planning-for-an-online-store-with-short-delivery-times/Engineering an Efficient Boolean Functional Synthesis Enginehttps://ac.tuwien.ac.at/publication/engineering-an-efficient-boolean-functional-synthesis-engine/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/engineering-an-efficient-boolean-functional-synthesis-engine/EPTAS for \emphk-means Clustering of Affine Subspaceshttps://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/Essentially Tight Kernels For (Weakly) Closed Graphshttps://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/essentially-tight-kernels-for-weakly-closed-graphs/Finding the Hardest Formulas for Resolution (Extended Abstract)https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-extended-abstract/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-extended-abstract/First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solvinghttps://ac.tuwien.ac.at/publication/first-order-logic-in-finite-domains-where-semantic-evaluation-competes-with-smt-solving/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-logic-in-finite-domains-where-semantic-evaluation-competes-with-smt-solving/Graphs with two moplexeshttps://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/graphs-with-two-moplexes/Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classeshttps://ac.tuwien.ac.at/publication/lacon-and-shrub-decompositions-a-new-characterization-of-first-order-transductions-of-bounded-expansion-classes/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/lacon-and-shrub-decompositions-a-new-characterization-of-first-order-transductions-of-bounded-expansion-classes/Layered Area-Proportional Rectangle Contact Representationhttps://ac.tuwien.ac.at/publication/layered-area-proportional-rectangle-contact-representation/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/layered-area-proportional-rectangle-contact-representation/Learning fast-inference Bayesian networkshttps://ac.tuwien.ac.at/publication/learning-fast-inference-bayesian-networks/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-fast-inference-bayesian-networks/Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problemshttps://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems-2/Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problemshttps://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems/On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applicationshttps://ac.tuwien.ac.at/publication/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications/On the Upward Book Thickness Problem: Combinatorial and Complexity Resultshttps://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/Parameterized Complexity of Feature Selection for Categorical Data Clusteringhttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/Parameterized Complexity of Small Decision Tree Learninghttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning/Preventing Small (s,t)Cuts by Protecting Edgeshttps://ac.tuwien.ac.at/publication/preventing-small-s-t-cuts-by-protecting-edges/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/preventing-small-s-t-cuts-by-protecting-edges/Proof Complexity of Symbolic QBF Reasoninghttps://ac.tuwien.ac.at/publication/proof-complexity-of-symbolic-qbf-reasoning/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-symbolic-qbf-reasoning/Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlineshttps://ac.tuwien.ac.at/publication/route-duration-prediction-in-a-stochastic-and-dynamic-vehicle-routing-problem-with-short-delivery-deadlines/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/route-duration-prediction-in-a-stochastic-and-dynamic-vehicle-routing-problem-with-short-delivery-deadlines/SAT Modulo Symmetries for Graph Generationhttps://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation/SAT-based Decision Tree Learning for Large Data Setshttps://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets/Stable Visual Summaries for Trajectory Collectionshttps://ac.tuwien.ac.at/publication/stable-visual-summaries-for-trajectory-collections/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-visual-summaries-for-trajectory-collections/The Complexity of Bayesian Network Learning: Revisiting the Superstructurehttps://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-bayesian-network-learning-revisiting-the-superstructure/The Complexity of Object Association in Multiple Object Trackinghttps://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-object-association-in-multiple-object-tracking/The Parameterized Complexity of Clustering Incomplete Datahttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/The Parameterized Complexity of Connected Fair Divisionhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-connected-fair-division/Turbocharging Treewidth-Bounded Bayesian Network Structure Learninghttps://ac.tuwien.ac.at/publication/turbocharging-treewidth-bounded-bayesian-network-structure-learning/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/turbocharging-treewidth-bounded-bayesian-network-structure-learning/Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphshttps://ac.tuwien.ac.at/publication/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs/Untangling Circular Drawings: Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity/Worbel: Aggregating Point Labels into Word Cloudshttps://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/Worbel: Aggregating Point Labels into Word Cloudshttps://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/A Beam Search Approach to the Traveling Tournament Problemhttps://ac.tuwien.ac.at/publication/a-beam-search-approach-to-the-traveling-tournament-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-approach-to-the-traveling-tournament-problem/A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculationhttps://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibilityhttps://ac.tuwien.ac.at/publication/a-double-horizon-approach-to-a-purely-dynamic-and-stochastic-vehicle-routing-problem-with-delivery-deadlines-and-shift-flexibility/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-double-horizon-approach-to-a-purely-dynamic-and-stochastic-vehicle-routing-problem-with-delivery-deadlines-and-shift-flexibility/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/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-faster-algorithm-for-propositional-model-counting-parameterized-by-incidence-treewidth/A Time Leap Challenge for SAT-Solvinghttps://ac.tuwien.ac.at/publication/a-time-leap-challenge-for-sat-solving/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-time-leap-challenge-for-sat-solving/A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problemhttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem/An Algorithmic Study of Fully Dynamic Independent Sets for Map Labelinghttps://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling/An Efficient Algorithm for Counting Markov Equivalent DAGshttps://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/Balanced Independent and Dominating Sets on Colored Interval Graphshttps://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs/Breaking Symmetries with RootClique and LexTopsorthttps://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort/Building Large k-Cores from Sparse Graphshttps://ac.tuwien.ac.at/publication/building-large-k-cores-from-sparse-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/building-large-k-cores-from-sparse-graphs/Casual Employee Scheduling with Constraint Programming and Metaheuristicshttps://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-metaheuristics/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-metaheuristics/Colored Cut Gameshttps://ac.tuwien.ac.at/publication/colored-cut-games/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/colored-cut-games/Computing Dense and Sparse Subgraphs of Weakly Closed Graphshttps://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs/Computing Optimal Hypertree Decompositionshttps://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions/Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problemhttps://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem-2/Distributing Battery Swapping Stations for Electric Scooters in an Urban Areahttps://ac.tuwien.ac.at/publication/distributing-battery-swapping-stations-for-electric-scooters-in-an-urban-area/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/distributing-battery-swapping-stations-for-electric-scooters-in-an-urban-area/Exploiting c-Closure in Kernelization Algorithms for Graph Problemshttps://ac.tuwien.ac.at/publication/exploiting-c-closure-in-kernelization-algorithms-for-graph-problems/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-c-closure-in-kernelization-algorithms-for-graph-problems/Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applicationshttps://ac.tuwien.ac.at/publication/exploiting-similar-behavior-of-users-in-a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-similar-behavior-of-users-in-a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/Extending Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2/Extending Nearly Complete 1-Planar Drawings in Polynomial Timehttps://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-nearly-complete-1-planar-drawings-in-polynomial-time/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings-2/Extending Partial 1-Planar Drawingshttps://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-partial-1-planar-drawings/Finding the Hardest Formulas for Resolutionhttps://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution/First-Order Model-Checking in Random Graphs and Complex Networkshttps://ac.tuwien.ac.at/publication/first-order-model-checking-in-random-graphs-and-complex-networks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-model-checking-in-random-graphs-and-complex-networks/FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problemshttps://ac.tuwien.ac.at/publication/fixcon-a-generic-solver-for-fixed-cardinality-subgraph-problems/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixcon-a-generic-solver-for-fixed-cardinality-subgraph-problems/Fixed-Parameter Tractability of Dependency QBF with Structural Parametershttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/Formalizing Graph Trail Properties in Isabelle/HOLhttps://ac.tuwien.ac.at/publication/formalizing-graph-trail-properties-in-isabelle-hol/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/formalizing-graph-trail-properties-in-isabelle-hol/Geometric Planar Networks on Bichromatic Pointshttps://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/Hard Problems on Random Graphshttps://ac.tuwien.ac.at/publication/hard-problems-on-random-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/hard-problems-on-random-graphs/Hard QBFs for Merge Resolutionhttps://ac.tuwien.ac.at/publication/hard-qbfs-for-merge-resolution-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/hard-qbfs-for-merge-resolution-2/Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessinghttps://ac.tuwien.ac.at/publication/interpolation-based-semantic-gate-extraction-and-its-applications-to-qbf-preprocessing/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/interpolation-based-semantic-gate-extraction-and-its-applications-to-qbf-preprocessing/Labeling Nonogramshttps://ac.tuwien.ac.at/publication/labeling-nonograms/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/labeling-nonograms/Layered Fan-Planar Graph Drawingshttps://ac.tuwien.ac.at/publication/layered-fan-planar-graph-drawings/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/layered-fan-planar-graph-drawings/Low-Rank Binary Matrix Approximation in Column-Sum Normhttps://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/Manipulating Districts to Win Elections: Fine-Grained Complexityhttps://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Sizehttps://ac.tuwien.ac.at/publication/maximum-shallow-clique-minors-in-preferential-attachment-graphs-have-polylogarithmic-size/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximum-shallow-clique-minors-in-preferential-attachment-graphs-have-polylogarithmic-size/MaxSAT-Based Postprocessing for Treedepthhttps://ac.tuwien.ac.at/publication/maxsat-based-postprocessing-for-treedepth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/maxsat-based-postprocessing-for-treedepth/Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiershttps://ac.tuwien.ac.at/publication/merging-quality-estimation-for-binary-decision-diagrams-with-binary-classifiers/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/merging-quality-estimation-for-binary-decision-diagrams-with-binary-classifiers/Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundnesshttps://ac.tuwien.ac.at/publication/multi-linear-strategy-extraction-for-qbf-expansion-proofs-via-local-soundness/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-linear-strategy-extraction-for-qbf-expansion-proofs-via-local-soundness/On Covering Segments with Unit Intervalshttps://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-covering-segments-with-unit-intervals/On Solving a Generalized Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rankhttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequenceshttps://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/Parameterized Complexity of Envy-Free Resource Allocation in Social Networkshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-envy-free-resource-allocation-in-social-networks/Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphshttps://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs/Short Q-Resolution Proofs with Homomorphismshttps://ac.tuwien.ac.at/publication/short-q-resolution-proofs-with-homomorphisms/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-q-resolution-proofs-with-homomorphisms/Solving the Steiner Tree Problem with few Terminalshttps://ac.tuwien.ac.at/publication/solving-the-steiner-tree-problem-with-few-terminals/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-steiner-tree-problem-with-few-terminals/Stable Matchings with Diversity Constraints: Affirmative Action is beyond NPhttps://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-matchings-with-diversity-constraints-affirmative-action-is-beyond-np/String Factorizations Under Various Collision Constraintshttps://ac.tuwien.ac.at/publication/string-factorizations-under-various-collision-constraints/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/string-factorizations-under-various-collision-constraints/Strong (D)QBF Dependency Schemes via Tautology-free Resolution Pathshttps://ac.tuwien.ac.at/publication/strong-d-qbf-dependency-schemes-via-tautology-free-resolution-paths/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-d-qbf-dependency-schemes-via-tautology-free-resolution-paths/The Complexity Landscape of Resource-Constrained Schedulinghttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-resource-constrained-scheduling/The Turing Test for Graph Drawing Algorithmshttps://ac.tuwien.ac.at/publication/the-turing-test-for-graph-drawing-algorithms/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-turing-test-for-graph-drawing-algorithms/Threshold Treewidth and Hypertree Widthhttps://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/Towards Data-Driven Multilinear Metro Mapshttps://ac.tuwien.ac.at/publication/towards-data-driven-multilinear-metro-maps/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-data-driven-multilinear-metro-maps/Towards Faster Reasoners by Using Transparent Huge Pageshttps://ac.tuwien.ac.at/publication/towards-faster-reasoners-by-using-transparent-huge-pages/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-faster-reasoners-by-using-transparent-huge-pages/VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Pointshttps://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points/A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problemhttps://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/A Cooperative Optimization Approach for Distributing Service Points in Mobility Applicationshttps://ac.tuwien.ac.at/publication/a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/A Heuristic Approach for Solving the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/A Heuristic Approach for Solving the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/A Join-Based Hybrid Parameter for Constraint Satisfactionhttps://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-join-based-hybrid-parameter-for-constraint-satisfaction/A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problemshttps://ac.tuwien.ac.at/publication/a-novel-approach-for-solving-large-scale-bike-sharing-station-planning-problems/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-novel-approach-for-solving-large-scale-bike-sharing-station-planning-problems/A SAT Approach for Finding Sup-Transition-Minorshttps://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/Approximation Algorithms for BalancedCC Multiwinner Ruleshttps://ac.tuwien.ac.at/publication/approximation-algorithms-for-balancedcc-multiwinner-rules/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximation-algorithms-for-balancedcc-multiwinner-rules/Combining Resolution-Path Dependencies with Dependency Learninghttps://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning/Computing Stable Demers Cartogramshttps://ac.tuwien.ac.at/publication/computing-stable-demers-cartograms/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-stable-demers-cartograms/Destroying Bicolored $P_3$s by Deleting Few Edgeshttps://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/destroying-bicolored-p-3-s-by-deleting-few-edges/Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networkshttps://ac.tuwien.ac.at/publication/efficient-non-segregated-routing-for-reconfigurable-demand-aware-networks/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/efficient-non-segregated-routing-for-reconfigurable-demand-aware-networks/Efficient Segment Folding is Hardhttps://ac.tuwien.ac.at/publication/efficient-segment-folding-is-hard/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/efficient-segment-folding-is-hard/Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparisonhttps://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/enumerating-connected-induced-subgraphs-improved-delay-and-experimental-comparison/Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/Exploring Semi-Automatic Map Labelinghttps://ac.tuwien.ac.at/publication/exploring-semi-automatic-map-labeling/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploring-semi-automatic-map-labeling/Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Timehttps://ac.tuwien.ac.at/publication/finding-linear-arrangements-of-hypergraphs-with-bounded-cutwidth-in-linear-time/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-linear-arrangements-of-hypergraphs-with-bounded-cutwidth-in-linear-time/Group Activity Selection with Few Agent Typeshttps://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/group-activity-selection-with-few-agent-types-2/Hardness of FO Model-Checking on Random Graphshttps://ac.tuwien.ac.at/publication/hardness-of-fo-model-checking-on-random-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-fo-model-checking-on-random-graphs/Integer Programming and Incidence Treedepthhttps://ac.tuwien.ac.at/publication/integer-programming-and-incidence-treedepth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/integer-programming-and-incidence-treedepth/Maximizing Ink in Partial Edge Drawings of k-plane Graphshttps://ac.tuwien.ac.at/publication/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs/Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidthhttps://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth/Mixed Linear Layouts: Complexity, Heuristics, and Experimentshttps://ac.tuwien.ac.at/publication/mixed-linear-layouts-complexity-heuristics-and-experiments/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-linear-layouts-complexity-heuristics-and-experiments/Motif Counting in Preferential Attachment Graphshttps://ac.tuwien.ac.at/publication/motif-counting-in-preferential-attachment-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/motif-counting-in-preferential-attachment-graphs/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs-2/On Strict (Outer-)Confluent Graphshttps://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-strict-outer-confluent-graphs/Parameterized Algorithms for Book Embedding Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/Parameterized Algorithms for Book Embedding Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/Proof Complexity of Fragments of Long-Distance Q-resolutionhttps://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution/Refined Complexity of PCA with Outliershttps://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/SAT-Encodings for Treecut Width and Treedepthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-treecut-width-and-treedepth/Solving integer quadratic programming via explicit and structural restrictionshttps://ac.tuwien.ac.at/publication/solving-integer-quadratic-programming-via-explicit-and-structural-restrictions/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-integer-quadratic-programming-via-explicit-and-structural-restrictions/Strategies for Iteratively Refining Layered Graph Modelshttps://ac.tuwien.ac.at/publication/strategies-for-iteratively-refining-layered-graph-models/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/strategies-for-iteratively-refining-layered-graph-models/The Complexity of Packing Edge-Disjoint Pathshttps://ac.tuwien.ac.at/publication/the-complexity-of-packing-edge-disjoint-paths/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-packing-edge-disjoint-paths/The Parameterized Complexity of Cascading Portfolio Schedulinghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-cascading-portfolio-scheduling/The Power of Cut-Based Parameters for Computing Edge Disjoint Pathshttps://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths/Towards Improving Merging Heuristics for Binary Decision Diagramshttps://ac.tuwien.ac.at/publication/towards-improving-merging-heuristics-for-binary-decision-diagrams/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-improving-merging-heuristics-for-binary-decision-diagrams/A Structural Approach to Activity Selectionhttps://ac.tuwien.ac.at/publication/a-structural-approach-to-activity-selection/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-structural-approach-to-activity-selection/A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathwayshttps://ac.tuwien.ac.at/publication/a-visual-comparison-of-hand-drawn-and-machine-generated-human-metabolic-pathways/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-visual-comparison-of-hand-drawn-and-machine-generated-human-metabolic-pathways/An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windowshttps://ac.tuwien.ac.at/publication/an-a-algorithm-for-solving-a-prize-collecting-sequencing-problem-with-one-common-and-multiple-secondary-resources-and-time-windows/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-a-algorithm-for-solving-a-prize-collecting-sequencing-problem-with-one-common-and-multiple-secondary-resources-and-time-windows/An SMT Approach to Fractional Hypertree Widthhttps://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-smt-approach-to-fractional-hypertree-width/Experimental Evaluation of Book Drawing Algorithmshttps://ac.tuwien.ac.at/publication/experimental-evaluation-of-book-drawing-algorithms/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/experimental-evaluation-of-book-drawing-algorithms/Finding Smooth Graphs with Small Independence Numbershttps://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collectionhttps://ac.tuwien.ac.at/publication/grasp-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/grasp-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applicationshttps://ac.tuwien.ac.at/publication/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-applications/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-applications/Lombardi Drawings of Knots and Linkshttps://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links/Minimizing Crossings in Constrained Two-Sided Circular Graph Layoutshttps://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-2/Minimzing Wiggles in Storyline Visualizationshttps://ac.tuwien.ac.at/publication/minimzing-wiggles-in-storyline-visualizations/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimzing-wiggles-in-storyline-visualizations/Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problemhttps://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-a-prize-collecting-sequencing-problem/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-a-prize-collecting-sequencing-problem/On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-bounded-degree-vertex-deletion-problem/Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexityhttps://ac.tuwien.ac.at/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/Parameterized Algorithms for Module Map Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-module-map-problems/Parameterized Algorithms for the Matrix Completion Problemhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-the-matrix-completion-problem/Planar Drawings of Fixed-Mobile Bigraphshttps://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-drawings-of-fixed-mobile-bigraphs/Planar L-Drawings of Directed Graphshttps://ac.tuwien.ac.at/publication/planar-l-drawings-of-directed-graphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-l-drawings-of-directed-graphs/Polynomial-Time Validation of QCDCL Certificateshttps://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates/Portfolio-Based Algorithm Selection for Circuit QBFshttps://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-2/Portfolio-Based Algorithm Selection for Circuit QBFshttps://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs/Semi-Automated Location Planning for Urban Bike-Sharing Systemshttps://ac.tuwien.ac.at/publication/semi-automated-location-planning-for-urban-bike-sharing-systems/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/semi-automated-location-planning-for-urban-bike-sharing-systems/Short Plane Supports for Spatial Hypergraphshttps://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-plane-supports-for-spatial-hypergraphs/Small Resolution Proofs for QBF using Dependency Treewidthhttps://ac.tuwien.ac.at/publication/small-resolution-proofs-for-qbf-using-dependency-treewidth/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/small-resolution-proofs-for-qbf-using-dependency-treewidth/Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merginghttps://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/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/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/Towards Characterizing Strict Outerconfluent Graphshttps://ac.tuwien.ac.at/publication/towards-characterizing-strict-outerconfluent-graphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-characterizing-strict-outerconfluent-graphs/Unary Integer Linear Programming with Structural Restrictionshttps://ac.tuwien.ac.at/publication/unary-integer-linear-programming-with-structural-restrictions/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/unary-integer-linear-programming-with-structural-restrictions/Minimizing crossings in constrained two-sided circular graph layoutshttps://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts/Sat, 01 Apr 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts/A Linear-Time Parameterized Algorithm for Node Unique Label Coverhttps://ac.tuwien.ac.at/publication/a-linear-time-parameterized-algorithm-for-node-unique-label-cover/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-linear-time-parameterized-algorithm-for-node-unique-label-cover/A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problemhttps://ac.tuwien.ac.at/publication/a-logic-based-benders-decomposition-approach-for-the-3-staged-strip-packing-problem/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-logic-based-benders-decomposition-approach-for-the-3-staged-strip-packing-problem/A SAT Approach to Branchwidthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth-2/A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problemhttps://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem/Backdoor Trees for Answer Set Programminghttps://ac.tuwien.ac.at/publication/backdoor-trees-for-answer-set-programming/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-trees-for-answer-set-programming/Backdoor Treewidth for SAThttps://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-treewidth-for-sat-2/Circuit Treewidth, Sentential Decision, and Query Compilationhttps://ac.tuwien.ac.at/publication/circuit-treewidth-sentential-decision-and-query-compilation/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/circuit-treewidth-sentential-decision-and-query-compilation/Combining Treewidth and Backdoors for CSPhttps://ac.tuwien.ac.at/publication/combining-treewidth-and-backdoors-for-csp/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-treewidth-and-backdoors-for-csp/Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedureshttps://ac.tuwien.ac.at/publication/complexity-results-for-aggregating-judgments-using-scoring-or-distance-based-procedures/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-results-for-aggregating-judgments-using-scoring-or-distance-based-procedures/Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedurehttps://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-judgment-aggregation-procedure/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-judgment-aggregation-procedure/Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Controlhttps://ac.tuwien.ac.at/publication/efficient-consideration-of-soft-time-windows-in-a-large-neighborhood-search-for-the-districting-and-routing-problem-for-security-control/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/efficient-consideration-of-soft-time-windows-in-a-large-neighborhood-search-for-the-districting-and-routing-problem-for-security-control/Going Beyond Primal Treewidth for (M)ILPhttps://ac.tuwien.ac.at/publication/going-beyond-primal-treewidth-for-m-ilp/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/going-beyond-primal-treewidth-for-m-ilp/GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collectionhttps://ac.tuwien.ac.at/publication/grasp-and-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/grasp-and-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Querieshttps://ac.tuwien.ac.at/publication/herbrand-property-finite-quasi-herbrand-models-and-lifting-chandra-merlin-theorem-to-quantified-conjunctive-queries/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/herbrand-property-finite-quasi-herbrand-models-and-lifting-chandra-merlin-theorem-to-quantified-conjunctive-queries/Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problemhttps://ac.tuwien.ac.at/publication/hierarchical-clustering-and-multilevel-refinement-for-the-bike-sharing-station-planning-problem/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/hierarchical-clustering-and-multilevel-refinement-for-the-bike-sharing-station-planning-problem/How many variables are needed to express an existential positive query?https://ac.tuwien.ac.at/publication/how-many-variables-are-needed-to-express-an-existential-positive-query/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/how-many-variables-are-needed-to-express-an-existential-positive-query/Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatmenthttps://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/Linear Representation of Transversal Matroids and Gammoids parameterized by rankhttps://ac.tuwien.ac.at/publication/linear-representation-of-transversal-matroids-and-gammoids-parameterized-by-rank/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-representation-of-transversal-matroids-and-gammoids-parameterized-by-rank/Long-Distance Q-Resolution with Dependency Schemeshttps://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-2/Lossy kernelizationhttps://ac.tuwien.ac.at/publication/lossy-kernelization/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/lossy-kernelization/New Width Parameters for Model Countinghttps://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-width-parameters-for-model-counting/On Structural Parameterizations of the Edge Disjoint Paths Problemhttps://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-structural-parameterizations-of-the-edge-disjoint-paths-problem-2/Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract)https://ac.tuwien.ac.at/publication/pareto-optimal-allocation-under-uncertain-preferences-extended-abstract/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/pareto-optimal-allocation-under-uncertain-preferences-extended-abstract/Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatmentshttps://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-time-estimation-to-schedule-sets-of-treatments/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-time-estimation-to-schedule-sets-of-treatments/Path-Contractions, Edge Deletions and Connectivity Preservationhttps://ac.tuwien.ac.at/publication/path-contractions-edge-deletions-and-connectivity-preservation/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/path-contractions-edge-deletions-and-connectivity-preservation/Radial Contour Labeling with Straight Leadershttps://ac.tuwien.ac.at/publication/radial-contour-labeling-with-straight-leaders/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/radial-contour-labeling-with-straight-leaders/Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/rigging-nearly-acyclic-tournaments-is-fixed-parameter-tractable/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/rigging-nearly-acyclic-tournaments-is-fixed-parameter-tractable/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/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-local-improvement-for-finding-tree-decompositions-of-small-width/SAT-Encodings for Special Treewidth and Pathwidthhttps://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-encodings-for-special-treewidth-and-pathwidth/Saving Critical Nodes with Firefighters is FPThttps://ac.tuwien.ac.at/publication/saving-critical-nodes-with-firefighters-is-fpt/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/saving-critical-nodes-with-firefighters-is-fpt/Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merginghttps://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging/Solving Integer Linear Programs with a Small Number of Global Variables and Constraintshttps://ac.tuwien.ac.at/publication/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-integer-linear-programs-with-a-small-number-of-global-variables-and-constraints/Stable Matching with Uncertain Pairwise Preferenceshttps://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-pairwise-preferences/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-pairwise-preferences/Towards a Polynomial Kernel for Directed Feedback Vertex Sethttps://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-a-polynomial-kernel-for-directed-feedback-vertex-set/A Faster Parameterized Algorithm for Group Feedback Edge Sethttps://ac.tuwien.ac.at/publication/a-faster-parameterized-algorithm-for-group-feedback-edge-set/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-faster-parameterized-algorithm-for-group-feedback-edge-set/A New Perspective on FO Model Checking of Dense Graph Classeshttps://ac.tuwien.ac.at/publication/a-new-perspective-on-fo-model-checking-of-dense-graph-classes/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-perspective-on-fo-model-checking-of-dense-graph-classes/A Parameterized Algorithm for Mixed-Cuthttps://ac.tuwien.ac.at/publication/a-parameterized-algorithm-for-mixed-cut/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-algorithm-for-mixed-cut/A SAT Approach to Branchwidthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-branchwidth/A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletionhttps://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion/An Algorithmic Framework for Labeling Road Mapshttps://ac.tuwien.ac.at/publication/an-algorithmic-framework-for-labeling-road-maps/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-framework-for-labeling-road-maps/Backdoors for Linear Temporal Logichttps://ac.tuwien.ac.at/publication/backdoors-for-linear-temporal-logic/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-for-linear-temporal-logic/Backdoors to Tractable Valued CSPhttps://ac.tuwien.ac.at/publication/backdoors-to-tractable-valued-csp/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-tractable-valued-csp/Clique-Width and Directed Width Measures for Answer-Set Programminghttps://ac.tuwien.ac.at/publication/clique-width-and-directed-width-measures-for-answer-set-programming/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-and-directed-width-measures-for-answer-set-programming/Counting Linear Extensions: Parameterizations by Treewidthhttps://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-linear-extensions-parameterizations-by-treewidth-2/Discovering Archipelagos of Tractability for Constraint Satisfaction and Countinghttps://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting/Districting and Routing for Security Controlhttps://ac.tuwien.ac.at/publication/districting-and-routing-for-security-control/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/districting-and-routing-for-security-control/Edge-Editing to a Dense and a Sparse Graph Classhttps://ac.tuwien.ac.at/publication/edge-editing-to-a-dense-and-a-sparse-graph-class/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-editing-to-a-dense-and-a-sparse-graph-class/Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbershttps://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/Knowledge Compilation Meets Communication Complexityhttps://ac.tuwien.ac.at/publication/knowledge-compilation-meets-communication-complexity/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/knowledge-compilation-meets-communication-complexity/Long Distance Q-Resolution with Dependency Schemeshttps://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes/On Existential MSO and its Relation to ETHhttps://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/On the Complexity Landscape of Connected f-factor Problemshttps://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-landscape-of-connected-f-factor-problems-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-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics-2/Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation-2/Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation/Particle Therapy Patient Scheduling: First Heuristic Approacheshttps://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/Polynomial-Time Construction of Optimal MPI Derived Datatype Treeshttps://ac.tuwien.ac.at/publication/polynomial-time-construction-of-optimal-mpi-derived-datatype-trees/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-time-construction-of-optimal-mpi-derived-datatype-trees/SDDs Are Exponentially More Succinct than OBDDshttps://ac.tuwien.ac.at/publication/sdds-are-exponentially-more-succinct-than-obdds/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/sdds-are-exponentially-more-succinct-than-obdds/SOBRA - Shielding Optimization for BRAchytherapyhttps://ac.tuwien.ac.at/publication/sobra-shielding-optimization-for-brachytherapy/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/sobra-shielding-optimization-for-brachytherapy/Software Visualization via Hierarchic Micro/Macro Layoutshttps://ac.tuwien.ac.at/publication/software-visualization-via-hierarchic-micro-macro-layouts/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/software-visualization-via-hierarchic-micro-macro-layouts/Stable Matching with Uncertain Linear Preferenceshttps://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-linear-preferences/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-linear-preferences/Strong Parameterized Deletion: Bipartite Graphshttps://ac.tuwien.ac.at/publication/strong-parameterized-deletion-bipartite-graphs/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-parameterized-deletion-bipartite-graphs/Succinctness of Languages for Judgment Aggregationhttps://ac.tuwien.ac.at/publication/succinctness-of-languages-for-judgment-aggregation/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/succinctness-of-languages-for-judgment-aggregation/Temporal Map Labeling: A New Unified Framework with Experimentshttps://ac.tuwien.ac.at/publication/temporal-map-labeling-a-new-unified-framework-with-experiments/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/temporal-map-labeling-a-new-unified-framework-with-experiments/The Complexity Landscape of Decompositional Parameters for ILPhttps://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-landscape-of-decompositional-parameters-for-ilp/Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristicshttps://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/Using Decomposition-Parameters for QBF: Mind the Prefix!https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-decomposition-parameters-for-qbf-mind-the-prefix/A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/a-cluster-first-route-second-approach-for-balancing-bicycle-sharing-systems/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-cluster-first-route-second-approach-for-balancing-bicycle-sharing-systems/A Dichotomy Result for Ramsey Quantifiershttps://ac.tuwien.ac.at/publication/a-dichotomy-result-for-ramsey-quantifiers/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-dichotomy-result-for-ramsey-quantifiers/A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problemhttps://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-the-capacity-and-distance-constrained-plant-location-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-the-capacity-and-distance-constrained-plant-location-problem/A New Solution Representation for the Firefighter Problemhttps://ac.tuwien.ac.at/publication/a-new-solution-representation-for-the-firefighter-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-solution-representation-for-the-firefighter-problem/A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicleshttps://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles-2/A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Sizehttps://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem-with-variable-sheet-size/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem-with-variable-sheet-size/A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Sizehttps://ac.tuwien.ac.at/publication/a-value-correction-construction-heuristic-for-the-two-dimensional-cutting-stock-problem-with-variable-sheet-size/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-value-correction-construction-heuristic-for-the-two-dimensional-cutting-stock-problem-with-variable-sheet-size/A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demandshttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/Algorithmic Applications of Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problemhttps://ac.tuwien.ac.at/publication/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem/Community Structure Inspired Algorithms for SAT and \#SAThttps://ac.tuwien.ac.at/publication/community-structure-inspired-algorithms-for-sat-and-sat/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/community-structure-inspired-algorithms-for-sat-and-sat/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/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/CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/cpu-versus-gpu-parallelization-of-an-ant-colony-optimization-for-the-longest-common-subsequence-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/cpu-versus-gpu-parallelization-of-an-ant-colony-optimization-for-the-longest-common-subsequence-problem/Drawing Large Graphs by Multilevel Maxent-Stress Optimizationhttps://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-large-graphs-by-multilevel-maxent-stress-optimization/First-Order Queries on Finite Abelian Groupshttps://ac.tuwien.ac.at/publication/first-order-queries-on-finite-abelian-groups/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-queries-on-finite-abelian-groups/Fixed-parameter Tractable Reductions to SAT for Planninghttps://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat-for-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat-for-planning/FO Model Checking on Posets of Bounded Widthhttps://ac.tuwien.ac.at/publication/fo-model-checking-on-posets-of-bounded-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/fo-model-checking-on-posets-of-bounded-width/Heuristic Approaches for the Probabilistic Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learninghttps://ac.tuwien.ac.at/publication/improving-the-efficiency-of-dynamic-programming-on-tree-decompositions-via-machine-learning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/improving-the-efficiency-of-dynamic-programming-on-tree-decompositions-via-machine-learning/Label Placement in Road Mapshttps://ac.tuwien.ac.at/publication/label-placement-in-road-maps/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/label-placement-in-road-maps/Linear Time Parameterized Algorithms for Subset Feedback Vertex Sethttps://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-for-subset-feedback-vertex-set/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-for-subset-feedback-vertex-set/Machine Characterizations for Parameterized Complexity Classes Beyond Para-NPhttps://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np/Meta-Kernelization using Well-Structured Modulatorshttps://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-using-well-structured-modulators/Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problemhttps://ac.tuwien.ac.at/publication/metaheuristics-for-the-two-dimensional-container-pre-marshalling-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-the-two-dimensional-container-pre-marshalling-problem/Metric Dimension of Bounded Width Graphshttps://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-width-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-width-graphs/Mixed Map Labelinghttps://ac.tuwien.ac.at/publication/mixed-map-labeling/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/mixed-map-labeling/On Compiling CNFs into Structured Deterministic DNNFshttps://ac.tuwien.ac.at/publication/on-compiling-cnfs-into-structured-deterministic-dnnfs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-compiling-cnfs-into-structured-deterministic-dnnfs/On Compiling Structured CNFs to OBDDshttps://ac.tuwien.ac.at/publication/on-compiling-structured-cnfs-to-obdds/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-compiling-structured-cnfs-to-obdds/On Minimizing Crossings in Storyline Visualizationshttps://ac.tuwien.ac.at/publication/on-minimizing-crossings-in-storyline-visualizations/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-minimizing-crossings-in-storyline-visualizations/On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristicshttps://ac.tuwien.ac.at/publication/on-solving-the-most-strings-with-few-bad-columns-problem-an-ilp-model-and-heuristics/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-the-most-strings-with-few-bad-columns-problem-an-ilp-model-and-heuristics/On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problemhttps://ac.tuwien.ac.at/publication/on-the-comparison-of-decoding-strategies-for-a-memetic-algorithm-for-the-multi-layer-hierarchical-ring-network-design-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-comparison-of-decoding-strategies-for-a-memetic-algorithm-for-the-multi-layer-hierarchical-ring-network-design-problem/On the Complexity of Rainbow Coloring Problemshttps://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-rainbow-coloring-problems/On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroidshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-girth-and-connectivity-problems-on-linear-matroids/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-girth-and-connectivity-problems-on-linear-matroids/On the Readability of Boundary Labelinghttps://ac.tuwien.ac.at/publication/on-the-readability-of-boundary-labeling/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-readability-of-boundary-labeling/Operating Power Grids with Few Flow Control Buseshttps://ac.tuwien.ac.at/publication/operating-power-grids-with-few-flow-control-buses/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/operating-power-grids-with-few-flow-control-buses/Parameterized Algorithms for Parity Gameshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-parity-games/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-parity-games/Parameterized Complexity of Asynchronous Border Minimizationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-asynchronous-border-minimization/Parameterized Complexity Results for Agenda Safety in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-2/Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regionshttps://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions/Recognizing Weighted Disk Contact Graphshttps://ac.tuwien.ac.at/publication/recognizing-weighted-disk-contact-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/recognizing-weighted-disk-contact-graphs/Reconfiguration on Sparse Graphshttps://ac.tuwien.ac.at/publication/reconfiguration-on-sparse-graphs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconfiguration-on-sparse-graphs/Solving d-SAT via Backdoors to Small Treewidthhttps://ac.tuwien.ac.at/publication/solving-d-sat-via-backdoors-to-small-treewidth/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-d-sat-via-backdoors-to-small-treewidth/Solving Problems on Graphs of High Rank-Widthhttps://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-problems-on-graphs-of-high-rank-width/Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/solving-the-3-staged-2-dimensional-cutting-stock-problem-by-dynamic-programming-and-variable-neighborhood-search/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-3-staged-2-dimensional-cutting-stock-problem-by-dynamic-programming-and-variable-neighborhood-search/Towards Realistic Flow Control in Power Grid Operationhttps://ac.tuwien.ac.at/publication/towards-realistic-flow-control-in-power-grid-operation/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-realistic-flow-control-in-power-grid-operation/Towards Realistic Pedestrian Route Planninghttps://ac.tuwien.ac.at/publication/towards-realistic-pedestrian-route-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-realistic-pedestrian-route-planning/Variable-Deletion Backdoors to Planninghttps://ac.tuwien.ac.at/publication/variable-deletion-backdoors-to-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-deletion-backdoors-to-planning/A survey on automated metro map layout methodshttps://ac.tuwien.ac.at/publication/a-survey-on-automated-metro-map-layout-methods/Tue, 01 Apr 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-survey-on-automated-metro-map-layout-methods/A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructurehttps://ac.tuwien.ac.at/publication/a-metaheuristic-approach-for-integrated-timetable-based-design-of-railway-infrastructure/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-metaheuristic-approach-for-integrated-timetable-based-design-of-railway-infrastructure/A Parameterized Study of Maximum Generalized Pattern Matching Problemshttps://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems-2/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-study-of-maximum-generalized-pattern-matching-problems-2/A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problemhttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/An Efficient Variable Neighborhood Search Solving a Robust Dynamic Facility Location Problem in Emergency Service Networkhttps://ac.tuwien.ac.at/publication/an-efficient-variable-neighborhood-search-solving-a-robust-dynamic-facility-location-problem-in-emergency-service-network/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-variable-neighborhood-search-solving-a-robust-dynamic-facility-location-problem-in-emergency-service-network/An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behaviorhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/Backdoors into Heterogeneous Classes of SAT and CSPhttps://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-into-heterogeneous-classes-of-sat-and-csp/Backdoors to Planninghttps://ac.tuwien.ac.at/publication/backdoors-to-planning/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-planning/Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybridhttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/Balancing Bicycle Sharing Systems: An Approach for the Dynamic Casehttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/boosting-an-exact-logic-based-benders-decomposition-approach-by-variable-neighborhood-search/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/boosting-an-exact-logic-based-benders-decomposition-approach-by-variable-neighborhood-search/Evaluation of Labeling Strategies for Rotating Mapshttps://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluation-of-labeling-strategies-for-rotating-maps/Faster Existential FO Model Checking on Posetshttps://ac.tuwien.ac.at/publication/faster-existential-fo-model-checking-on-posets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-existential-fo-model-checking-on-posets/Finite Integer Index of Pathwidth and Treewidthhttps://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/Fixed-Parameter Tractable Reductions to SAThttps://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat/Linear Time Parameterized Algorithms via Skew-Symmetric Multicutshttps://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts/Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagramshttps://ac.tuwien.ac.at/publication/minimum-tree-supports-for-hypergraphs-and-low-concurrency-euler-diagrams/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimum-tree-supports-for-hypergraphs-and-low-concurrency-euler-diagrams/Model checking existential logic on partially ordered setshttps://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-checking-existential-logic-on-partially-ordered-sets/On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphshttps://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs/On the Kernelization Complexity of String Problemshttps://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-string-problems/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-string-problems/Parameterized Algorithms to Preserve Connectivityhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-to-preserve-connectivity/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-to-preserve-connectivity/Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applicationshttps://ac.tuwien.ac.at/publication/parameterized-and-subexponential-time-complexity-of-satisfiability-problems-and-applications/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-and-subexponential-time-complexity-of-satisfiability-problems-and-applications/Parameterized Approximations via d-Skew-Symmetric Multicuthttps://ac.tuwien.ac.at/publication/parameterized-approximations-via-d-skew-symmetric-multicut/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-approximations-via-d-skew-symmetric-multicut/Parameterized Complexity Results for Agenda Safety in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation/PIGRA – A Tool for Pixelated Graph Representationshttps://ac.tuwien.ac.at/publication/pigra-a-tool-for-pixelated-graph-representations/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/pigra-a-tool-for-pixelated-graph-representations/Quantified Conjunctive Queries on Partially Ordered Setshttps://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantified-conjunctive-queries-on-partially-ordered-sets/Semantic Word Cloud Representations: Hardness and Approximation Algorithmshttps://ac.tuwien.ac.at/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/Simultaneous Embeddability of Two Partitionshttps://ac.tuwien.ac.at/publication/simultaneous-embeddability-of-two-partitions/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/simultaneous-embeddability-of-two-partitions/Small Unsatisfiable Subsets in Constraint Satisfactionhttps://ac.tuwien.ac.at/publication/small-unsatisfiable-subsets-in-constraint-satisfaction/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/small-unsatisfiable-subsets-in-constraint-satisfaction/Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problemhttps://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/Subexponential Time Complexity of CSP with Global Constraintshttps://ac.tuwien.ac.at/publication/subexponential-time-complexity-of-csp-with-global-constraints/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/subexponential-time-complexity-of-csp-with-global-constraints/The Complexity of Width Minimization for Existential Positive Querieshttps://ac.tuwien.ac.at/publication/the-complexity-of-width-minimization-for-existential-positive-queries/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-width-minimization-for-existential-positive-queries/The Parameterized Complexity of Reasoning Problems Beyond NPhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-reasoning-problems-beyond-np/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-reasoning-problems-beyond-np/Variable Dependencies and Q-Resolutionhttps://ac.tuwien.ac.at/publication/variable-dependencies-and-q-resolution/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-dependencies-and-q-resolution/Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructurehttps://ac.tuwien.ac.at/publication/variable-neighbourhood-search-for-integrated-timetable-design-of-railway-infrastructure/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighbourhood-search-for-integrated-timetable-design-of-railway-infrastructure/Vertex Exponential Algorithms for Connected f-Factorshttps://ac.tuwien.ac.at/publication/vertex-exponential-algorithms-for-connected-f-factors/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/vertex-exponential-algorithms-for-connected-f-factors/A Memetic Algorithm for the Partition Graph Coloring Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/A Memetic Algorithm for the Virtual Network Mapping Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem/A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problemhttps://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/A SAT Approach to Clique-Widthhttps://ac.tuwien.ac.at/publication/a-sat-approach-to-clique-width/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-clique-width/An Optimization Model for Integrated Timetable Based Design of Railway Infrastructurehttps://ac.tuwien.ac.at/publication/an-optimization-model-for-integrated-timetable-based-design-of-railway-infrastructure/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-optimization-model-for-integrated-timetable-based-design-of-railway-infrastructure/Backdoors to Abductionhttps://ac.tuwien.ac.at/publication/backdoors-to-abduction/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-abduction/Backdoors to Normality for Disjunctive Logic Programshttps://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-normality-for-disjunctive-logic-programs/Backdoors to q-Hornhttps://ac.tuwien.ac.at/publication/backdoors-to-q-horn/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-q-horn/Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approachhttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operationshttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/Capturing Structure in Hard Combinatorial Problemshttps://ac.tuwien.ac.at/publication/capturing-structure-in-hard-combinatorial-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/capturing-structure-in-hard-combinatorial-problems/Circular-Arc Cartogramshttps://ac.tuwien.ac.at/publication/circular-arc-cartograms/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/circular-arc-cartograms/Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problemhttps://ac.tuwien.ac.at/publication/clique-and-independent-set-based-grasp-approaches-for-the-regenerator-location-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-and-independent-set-based-grasp-approaches-for-the-regenerator-location-problem/Drawing Metro Maps using Bézier Curveshttps://ac.tuwien.ac.at/publication/drawing-metro-maps-using-bezier-curves/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-metro-maps-using-bezier-curves/Drawing Planar Graphs with a Prescribed Inner Facehttps://ac.tuwien.ac.at/publication/drawing-planar-graphs-with-a-prescribed-inner-face/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-planar-graphs-with-a-prescribed-inner-face/Edge-weighted contact representations of planar graphshttps://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-weighted-contact-representations-of-planar-graphs/Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documentshttps://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/Euclidean Greedy Drawings of Treeshttps://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/euclidean-greedy-drawings-of-trees/Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classeshttps://ac.tuwien.ac.at/publication/expanding-the-expressive-power-of-monadic-second-order-logic-on-restricted-graph-classes/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/expanding-the-expressive-power-of-monadic-second-order-logic-on-restricted-graph-classes/Faster Exact Algorithms for Some Terminal Set Problemshttps://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-exact-algorithms-for-some-terminal-set-problems/Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraintshttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-workflow-satisfiability-in-the-presence-of-seniority-constraints/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-workflow-satisfiability-in-the-presence-of-seniority-constraints/FO Model Checking of Interval Graphshttps://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/fo-model-checking-of-interval-graphs/GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problemhttps://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/Hardness of r-dominating set on Graphs of Diameter (r + 1)https://ac.tuwien.ac.at/publication/hardness-of-r-dominating-set-on-graphs-of-diameter-r-1/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-r-dominating-set-on-graphs-of-diameter-r-1/Kernelization Using Structural Parameters on Sparse Graph Classeshttps://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Local Backboneshttps://ac.tuwien.ac.at/publication/local-backbones/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/local-backbones/Many-to-One Boundary Labeling with Backboneshttps://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/many-to-one-boundary-labeling-with-backbones/Meta-kernelization with Structural Parametershttps://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters/Model Counting for CNF Formulas of Bounded Modular Treewidthhttps://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth/Model Counting for Formulas of Bounded Clique-Widthhttps://ac.tuwien.ac.at/publication/model-counting-for-formulas-of-bounded-clique-width/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-counting-for-formulas-of-bounded-clique-width/On the Subexponential Time Complexity of CSPhttps://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp-2/On The Usability of Lombardi Graph Drawingshttps://ac.tuwien.ac.at/publication/on-the-usability-of-lombardi-graph-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-usability-of-lombardi-graph-drawings/Parameterized Complexity and Kernel Bounds for Hard Planning Problemshttps://ac.tuwien.ac.at/publication/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems/Parameterized Complexity of Directed Steiner Tree on Sparse Graphshttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs/Parameterized Complexity Results for Plan Reusehttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-plan-reuse/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-plan-reuse/Partially Polynomial Kernels for Set Cover and Test Coverhttps://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/partially-polynomial-kernels-for-set-cover-and-test-cover/Planar Lombardi Drawings of Outerpathshttps://ac.tuwien.ac.at/publication/planar-lombardi-drawings-of-outerpaths/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-lombardi-drawings-of-outerpaths/Progress on Partial Edge Drawingshttps://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archivehttps://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/Revisiting Space in Proof Complexity: Treewidth and Pathwidthhttps://ac.tuwien.ac.at/publication/revisiting-space-in-proof-complexity-treewidth-and-pathwidth/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-space-in-proof-complexity-treewidth-and-pathwidth/Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descenthttps://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/Strict Confluent Drawinghttps://ac.tuwien.ac.at/publication/strict-confluent-drawing/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/strict-confluent-drawing/Strong Backdoors to Bounded Treewidth SAThttps://ac.tuwien.ac.at/publication/strong-backdoors-to-bounded-treewidth-sat/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-backdoors-to-bounded-treewidth-sat/The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentationhttps://ac.tuwien.ac.at/publication/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation/The Parameterized Complexity of Constraint Satisfaction and Reasoninghttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-constraint-satisfaction-and-reasoning/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-constraint-satisfaction-and-reasoning/Trajectory-Based Dynamic Map Labelinghttps://ac.tuwien.ac.at/publication/trajectory-based-dynamic-map-labeling/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/trajectory-based-dynamic-map-labeling/Upper and Lower Bounds for Weak Backdoor Set Detectionhttps://ac.tuwien.ac.at/publication/upper-and-lower-bounds-for-weak-backdoor-set-detection/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/upper-and-lower-bounds-for-weak-backdoor-set-detection/Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawingshttps://ac.tuwien.ac.at/publication/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings/Using Optimized Virtual Network Embedding for Network Dimensioninghttps://ac.tuwien.ac.at/publication/using-optimized-virtual-network-embedding-for-network-dimensioning/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-optimized-virtual-network-embedding-for-network-dimensioning/Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphorhttps://ac.tuwien.ac.at/publication/visualizing-large-hierarchically-clustered-graphs-with-a-landscape-metaphor/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-large-hierarchically-clustered-graphs-with-a-landscape-metaphor/A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-and-a-solution-archive-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-and-a-solution-archive-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problemhttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-the-two-echelon-location-routing-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-the-two-echelon-location-routing-problem/Abstract Argumentation via Monadic Second Order Logichttps://ac.tuwien.ac.at/publication/abstract-argumentation-via-monadic-second-order-logic/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/abstract-argumentation-via-monadic-second-order-logic/An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem-2/An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicleshttps://ac.tuwien.ac.at/publication/applying-hybrid-metaheuristics-to-fuel-consumption-optimization-of-hybrid-electric-vehicles/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/applying-hybrid-metaheuristics-to-fuel-consumption-optimization-of-hybrid-electric-vehicles/Automatic Generation of 2-AntWars Players with Genetic Programminghttps://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-2/Backdoors to Acyclic SAThttps://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-acyclic-sat-2/Backdoors to Satisfactionhttps://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-2/Computing Resolution-Path Dependencies in Linear Timehttps://ac.tuwien.ac.at/publication/computing-resolution-path-dependencies-in-linear-time/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-resolution-path-dependencies-in-linear-time/Don't Be Strict in Local Search!https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/Hybrid Heuristics for Multimodal Homecare Schedulinghttps://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/Improved Packing and Routing of Vehicles with Compartmentshttps://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments-2/k-Gap Interval Graphshttps://ac.tuwien.ac.at/publication/k-gap-interval-graphs/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/k-gap-interval-graphs/Lower Bounds on the Complexity of MSO1 Model-Checkinghttps://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/LP can be a cure for Parameterized Problemshttps://ac.tuwien.ac.at/publication/lp-can-be-a-cure-for-parameterized-problems/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/lp-can-be-a-cure-for-parameterized-problems/On Finding Optimal Polytreeshttps://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-optimal-polytrees/On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/on-solving-the-rooted-delay-and-delay-variation-constrained-steiner-tree-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-the-rooted-delay-and-delay-variation-constrained-steiner-tree-problem/Parameterized Algorithms for Even Cycle Transversalhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-even-cycle-transversal/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-even-cycle-transversal/Parameterized Tractability of Multiway Cut with Parity Constraintshttps://ac.tuwien.ac.at/publication/parameterized-tractability-of-multiway-cut-with-parity-constraints/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-tractability-of-multiway-cut-with-parity-constraints/Strong Backdoors to Nested Satisfiabilityhttps://ac.tuwien.ac.at/publication/strong-backdoors-to-nested-satisfiability/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-backdoors-to-nested-satisfiability/The Complexity of Planning Revisited - A Parameterized Analysishttps://ac.tuwien.ac.at/publication/the-complexity-of-planning-revisited-a-parameterized-analysis/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-planning-revisited-a-parameterized-analysis/Valued-Based Argumentation for Tree-like Value Graphshttps://ac.tuwien.ac.at/publication/valued-based-argumentation-for-tree-like-value-graphs/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/valued-based-argumentation-for-tree-like-value-graphs/Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/variable-neighborhood-and-greedy-randomized-adaptive-search-for-capacitated-connected-facility-location/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-and-greedy-randomized-adaptive-search-for-capacitated-connected-facility-location/Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Designhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-grasp-for-three-layer-hierarchical-ring-network-design/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-grasp-for-three-layer-hierarchical-ring-network-design/When Trees Grow Low: Shrubs and Fast MSO1https://ac.tuwien.ac.at/publication/when-trees-grow-low-shrubs-and-fast-mso1/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/when-trees-grow-low-shrubs-and-fast-mso1/Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/stabilized-branch-and-price-for-the-rooted-delay-constrained-steiner-tree-problem/Wed, 01 Jun 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/stabilized-branch-and-price-for-the-rooted-delay-constrained-steiner-tree-problem/Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/stabilized-column-generation-for-the-rooted-delay-constrained-steiner-tree-problem/Sun, 01 May 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/stabilized-column-generation-for-the-rooted-delay-constrained-steiner-tree-problem/A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Applicationhttps://ac.tuwien.ac.at/publication/a-branch-and-cut-and-price-algorithm-for-a-fingerprint-template-compression-application/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-branch-and-cut-and-price-algorithm-for-a-fingerprint-template-compression-application/A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problemshttps://ac.tuwien.ac.at/publication/a-layered-graph-model-and-an-adaptive-layers-framework-to-solve-delay-constrained-minimum-tree-problems/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-layered-graph-model-and-an-adaptive-layers-framework-to-solve-delay-constrained-minimum-tree-problems/A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/A Polynomial Kernel for Feedback Arc Set on Bipartite Tournamentshttps://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-polynomial-kernel-for-feedback-arc-set-on-bipartite-tournaments/A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetableshttps://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/Adjacency-Preserving Spatial Treemapshttps://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/adjacency-preserving-spatial-treemaps/An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/Augmenting Tractable Fragments of Abstract Argumentationhttps://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/augmenting-tractable-fragments-of-abstract-argumentation-2/Automatic Generation of 2-AntWars Players with Genetic Programminghttps://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming/Automatic Generation of Route Sketcheshttps://ac.tuwien.ac.at/publication/automatic-generation-of-route-sketches/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/automatic-generation-of-route-sketches/Backdoors to Tractable Answer-Set Programminghttps://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-tractable-answer-set-programming/Boundary-Labeling Algorithms for Panorama Imageshttps://ac.tuwien.ac.at/publication/boundary-labeling-algorithms-for-panorama-images/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-algorithms-for-panorama-images/Clique-width: When Hard Does Not Mean Impossiblehttps://ac.tuwien.ac.at/publication/clique-width-when-hard-does-not-mean-impossible/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-when-hard-does-not-mean-impossible/Connecting Two Trees with Optimal Routing Costhttps://ac.tuwien.ac.at/publication/connecting-two-trees-with-optimal-routing-cost/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/connecting-two-trees-with-optimal-routing-cost/Consistent Labeling of Rotating Mapshttps://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-labeling-of-rotating-maps/Drawing Trees with Perfect Angular Resolution and Polynomial Areahttps://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-trees-with-perfect-angular-resolution-and-polynomial-area/Generic Expression Hardness Results for Primitive Positive Formula Comparisonhttps://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/generic-expression-hardness-results-for-primitive-positive-formula-comparison/Improved Packing and Routing of Vehicles with Compartmentshttps://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments/Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraintshttps://ac.tuwien.ac.at/publication/introducing-the-virtual-network-mapping-problem-with-delay-routing-and-location-constraints/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-the-virtual-network-mapping-problem-with-delay-routing-and-location-constraints/Kernels for Global Constraintshttps://ac.tuwien.ac.at/publication/kernels-for-global-constraints/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/kernels-for-global-constraints/Limits of Preprocessinghttps://ac.tuwien.ac.at/publication/limits-of-preprocessing/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/limits-of-preprocessing/Lombardi Drawings of Graphshttps://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/lombardi-drawings-of-graphs/New Results on the Complexity of the Max- and Min-Rep Problemshttps://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-the-max-and-min-rep-problems/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-the-max-and-min-rep-problems/On d-regular Schematization of Embedded Pathshttps://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-d-regular-schematization-of-embedded-paths-2/Optimal 3D Angular Resolution for Low-Degree Graphshttps://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimal-3d-angular-resolution-for-low-degree-graphs/Paths, Flowers and Vertex Coverhttps://ac.tuwien.ac.at/publication/paths-flowers-and-vertex-cover/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/paths-flowers-and-vertex-cover/Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-ii/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-ii/Sliding Labels for Dynamic Point Labelinghttps://ac.tuwien.ac.at/publication/sliding-labels-for-dynamic-point-labeling/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/sliding-labels-for-dynamic-point-labeling/Tackling the Loading Aspect of the Vehicle Routing Problem with Compartmentshttps://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/The Parameterized Complexity of Local Consistencyhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-local-consistency/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-local-consistency/Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmicshttps://ac.tuwien.ac.at/publication/twin-cover-beyond-vertex-cover-in-parameterized-algorithmics/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/twin-cover-beyond-vertex-cover-in-parameterized-algorithmics/Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/using-a-solution-archive-to-enhance-metaheuristics-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-a-solution-archive-to-enhance-metaheuristics-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Variable Neighborhood Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-capacitated-connected-facility-location/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-capacitated-connected-facility-location/A Brief Survey on Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documentshttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/Algorithms and Complexity Results for Exact Bayesian Structure Learninghttps://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-exact-bayesian-structure-learning/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-exact-bayesian-structure-learning/Algorithms and Complexity Results for Persuasive Argumentationhttps://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation/An Improved Algorithm for the Metro-Line Crossing Minimization Problemhttps://ac.tuwien.ac.at/publication/an-improved-algorithm-for-the-metro-line-crossing-minimization-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-improved-algorithm-for-the-metro-line-crossing-minimization-problem/Are There Any Good Digraph Width Measures?https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-widthhttps://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width/Dynamic One-Sided Boundary Labelinghttps://ac.tuwien.ac.at/publication/dynamic-one-sided-boundary-labeling/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/dynamic-one-sided-boundary-labeling/Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archivehttps://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategieshttps://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-photometric-time-data-series-by-evolution-strategies/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-photometric-time-data-series-by-evolution-strategies/Matheuristics for the Periodic Vehicle Routing Problem with Time Windowshttps://ac.tuwien.ac.at/publication/matheuristics-for-the-periodic-vehicle-routing-problem-with-time-windows/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/matheuristics-for-the-periodic-vehicle-routing-problem-with-time-windows/Multilevel Variable Neighborhood Search for Periodic Routing Problemshttps://ac.tuwien.ac.at/publication/multilevel-variable-neighborhood-search-for-periodic-routing-problems/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/multilevel-variable-neighborhood-search-for-periodic-routing-problems/New Results on the Complexity of Oriented Colouring on Restricted Digraph Classeshttps://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-oriented-colouring-on-restricted-digraph-classes/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-results-on-the-complexity-of-oriented-colouring-on-restricted-digraph-classes/On Contracting Graphs to Fixed Pattern Graphshttps://ac.tuwien.ac.at/publication/on-contracting-graphs-to-fixed-pattern-graphs/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-contracting-graphs-to-fixed-pattern-graphs/On the Kernelization Complexity of Colorful Motifshttps://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-colorful-motifs/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-kernelization-complexity-of-colorful-motifs/Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programminghttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming/Path Schematization for Route Sketcheshttps://ac.tuwien.ac.at/publication/path-schematization-for-route-sketches/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/path-schematization-for-route-sketches/Reasoning in Argumentation Frameworks of Bounded Clique-Widthhttps://ac.tuwien.ac.at/publication/reasoning-in-argumentation-frameworks-of-bounded-clique-width/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/reasoning-in-argumentation-frameworks-of-bounded-clique-width/Satisfiability of Acyclic and Almost Acyclic CNF Formulashttps://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas/Schauder Hats for the Two-Variable Fragment of BLhttps://ac.tuwien.ac.at/publication/schauder-hats-for-the-two-variable-fragment-of-bl/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/schauder-hats-for-the-two-variable-fragment-of-bl/Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labelinghttps://ac.tuwien.ac.at/publication/shooting-bricks-with-orthogonal-laser-beams-a-first-step-towards-internal-external-map-labeling/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/shooting-bricks-with-orthogonal-laser-beams-a-first-step-towards-internal-external-map-labeling/Similarity Searching in Sequences of Complex Eventshttps://ac.tuwien.ac.at/publication/similarity-searching-in-sequences-of-complex-events/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/similarity-searching-in-sequences-of-complex-events/Solving MAX-r-SAT Above a Tight Lower Boundhttps://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound/Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimizationhttps://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-ant-colony-optimization/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-ant-colony-optimization/Strong Lower Bounds for a Survivable Network Design Problemhttps://ac.tuwien.ac.at/publication/strong-lower-bounds-for-a-survivable-network-design-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-lower-bounds-for-a-survivable-network-design-problem/Thread Graphs, Linear Rank-Width and Their Algorithmic Applicationshttps://ac.tuwien.ac.at/publication/thread-graphs-linear-rank-width-and-their-algorithmic-applications/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/thread-graphs-linear-rank-width-and-their-algorithmic-applications/Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enoughhttps://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough/Trend-Based Similarity Search in Time-Series Datahttps://ac.tuwien.ac.at/publication/trend-based-similarity-search-in-time-series-data/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/trend-based-similarity-search-in-time-series-data/Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-ant-colony-optimization-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-ant-colony-optimization-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-coupled-with-ilp-based-large-neighborhood-searches-for-the-periodic-location-routing-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-coupled-with-ilp-based-large-neighborhood-searches-for-the-periodic-location-routing-problem/Accelerating Column Generation for a Survivable Network Design Problemhttps://ac.tuwien.ac.at/publication/accelerating-column-generation-for-a-survivable-network-design-problem/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/accelerating-column-generation-for-a-survivable-network-design-problem/Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generationhttps://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windowshttps://ac.tuwien.ac.at/publication/a-column-generation-approach-for-the-periodic-vehicle-routing-problem-with-time-windows/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-column-generation-approach-for-the-periodic-vehicle-routing-problem-with-time-windows/A Hybrid Algorithm for Computing Tours in a Spare Parts Warehousehttps://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-based-heuristic-for-capacitated-connected-facility-location/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-based-heuristic-for-capacitated-connected-facility-location/A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/A Probabilistic Approach to Problems Parameterized above or below Tight Boundshttps://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds/Applications of Finite Duality to Locally Finite Varieties of BL-Algebrashttps://ac.tuwien.ac.at/publication/applications-of-finite-duality-to-locally-finite-varieties-of-bl-algebras/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/applications-of-finite-duality-to-locally-finite-varieties-of-bl-algebras/Better Polynomial Algorithms on Graphs of Bounded Rank-Widthhttps://ac.tuwien.ac.at/publication/better-polynomial-algorithms-on-graphs-of-bounded-rank-width/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/better-polynomial-algorithms-on-graphs-of-bounded-rank-width/Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniqueshttps://ac.tuwien.ac.at/publication/boosting-a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows-by-ilp-techniques/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/boosting-a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows-by-ilp-techniques/Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouseshttps://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/Cooperative Hybrids for Combinatorial Optimizationhttps://ac.tuwien.ac.at/publication/cooperative-hybrids-for-combinatorial-optimization/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/cooperative-hybrids-for-combinatorial-optimization/Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractabilityhttps://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/Drawing Binary Tanglegrams: An Experimental Evaluationhttps://ac.tuwien.ac.at/publication/drawing-binary-tanglegrams-an-experimental-evaluation/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-binary-tanglegrams-an-experimental-evaluation/Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instanceshttps://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithmshttps://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithmshttps://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documentshttps://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windowshttps://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/On Digraph Width Measures in Parameterized Algorithmicshttps://ac.tuwien.ac.at/publication/on-digraph-width-measures-in-parameterized-algorithmics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-digraph-width-measures-in-parameterized-algorithmics/Soft Constraints Processing over Divisible Residuated Latticeshttps://ac.tuwien.ac.at/publication/soft-constraints-processing-over-divisible-residuated-lattices/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/soft-constraints-processing-over-divisible-residuated-lattices/Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristicshttps://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAThttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-k-flip-local-search-for-sat-and-max-sat/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-k-flip-local-search-for-sat-and-max-sat/The Parameterized Complexity of Oriented Colouringhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-oriented-colouring/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-oriented-colouring/(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-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-for-the-bounded-diameter-minimum-spanning-tree-problem/A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-lagrangian-relax-and-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-relax-and-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windowshttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows/Algorithms for Multi-Criteria One-Sided Boundary Labelinghttps://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-one-sided-boundary-labeling/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-multi-criteria-one-sided-boundary-labeling/Automata approach to graphs of bounded rank-widthhttps://ac.tuwien.ac.at/publication/automata-approach-to-graphs-of-bounded-rank-width/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/automata-approach-to-graphs-of-bounded-rank-width/Backdoor Treeshttps://ac.tuwien.ac.at/publication/backdoor-trees/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-trees/Boundary Labeling with Octilinear Leadershttps://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-with-octilinear-leaders/Combining Forces to Reconstruct Strip Shredded Text Documentshttps://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/Consistent Digital Rayshttps://ac.tuwien.ac.at/publication/consistent-digital-rays/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistent-digital-rays/Cover Contact Graphshttps://ac.tuwien.ac.at/publication/cover-contact-graphs/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/cover-contact-graphs/Effective Neighborhood Structures for the Generalized Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Treeshttps://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithmshttps://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/Heuristic Cut Separation in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/heuristic-cut-separation-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/heuristic-cut-separation-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networkshttps://ac.tuwien.ac.at/publication/lagrangian-decomposition-metaheuristics-and-hybrid-approaches-for-the-design-of-the-last-mile-in-fiber-optic-networks/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/lagrangian-decomposition-metaheuristics-and-hybrid-approaches-for-the-design-of-the-last-mile-in-fiber-optic-networks/Monadic Second Order Logic on Graphs with Local Cardinality Constraintshttps://ac.tuwien.ac.at/publication/monadic-second-order-logic-on-graphs-with-local-cardinality-constraints/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/monadic-second-order-logic-on-graphs-with-local-cardinality-constraints/Not So Easy Problems For Tree Decomposable Graphs (invited talk)https://ac.tuwien.ac.at/publication/not-so-easy-problems-for-tree-decomposable-graphs-invited-talk/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/not-so-easy-problems-for-tree-decomposable-graphs-invited-talk/Optimizing Active Ranges for Consistent Dynamic Map Labelinghttps://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling/Parameterized Graph Editing with Chosen Vertex Degreeshttps://ac.tuwien.ac.at/publication/parameterized-graph-editing-with-chosen-vertex-degrees/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-graph-editing-with-chosen-vertex-degrees/Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimizationhttps://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/The Parameterized Complexity of Regular Subgraph Problems and Generalizationshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-regular-subgraph-problems-and-generalizations/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-regular-subgraph-problems-and-generalizations/Tractable Cases of the Extended Global Cardinality Constrainthttps://ac.tuwien.ac.at/publication/tractable-cases-of-the-extended-global-cardinality-constraint/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-cases-of-the-extended-global-cardinality-constraint/Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/Improved Algorithms for Length-Minimal One-Sided Boundary Labelinghttps://ac.tuwien.ac.at/publication/improved-algorithms-for-length-minimal-one-sided-boundary-labeling/Thu, 01 Mar 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-algorithms-for-length-minimal-one-sided-boundary-labeling/A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networkshttps://ac.tuwien.ac.at/publication/a-directed-cut-model-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-directed-cut-model-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networkshttps://ac.tuwien.ac.at/publication/a-multi-commodity-flow-approach-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-approach-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/Algorithms for Propositional Model Countinghttps://ac.tuwien.ac.at/publication/algorithms-for-propositional-model-counting/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-for-propositional-model-counting/Backdoor Sets of Quantified Boolean Formulashttps://ac.tuwien.ac.at/publication/backdoor-sets-of-quantified-boolean-formulas/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-sets-of-quantified-boolean-formulas/Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-an-evolutionary-algorithm-for-the-knapsack-constrained-maximum-spanning-tree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-an-evolutionary-algorithm-for-the-knapsack-constrained-maximum-spanning-tree-problem/Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-an-extended-minimum-label-spanning-tree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-an-extended-minimum-label-spanning-tree-problem/Covering Graphs with Few Complete Bipartite Subgraphshttps://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs/Determining Orbital Elements of Extrasolar Planets by Evolution Strategieshttps://ac.tuwien.ac.at/publication/determining-orbital-elements-of-extrasolar-planets-by-evolution-strategies/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/determining-orbital-elements-of-extrasolar-planets-by-evolution-strategies/Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problemhttps://ac.tuwien.ac.at/publication/fingerprint-template-compression-by-solving-a-minimum-label-k-node-subtree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/fingerprint-template-compression-by-solving-a-minimum-label-k-node-subtree-problem/Matched Formulas and Backdoor Setshttps://ac.tuwien.ac.at/publication/matched-formulas-and-backdoor-sets/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/matched-formulas-and-backdoor-sets/Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Mapshttps://ac.tuwien.ac.at/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/Morphing Polygonal Lines: A Step Towards Continuous Generalizationhttps://ac.tuwien.ac.at/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/On the Complexity of Some Colorful Problems Parameterized by Treewidthhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/Parameterized Proof Complexityhttps://ac.tuwien.ac.at/publication/parameterized-proof-complexity/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-proof-complexity/Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk)https://ac.tuwien.ac.at/publication/without-loss-of-generality-symmetric-reasoning-for-resolution-systems-invited-talk/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/without-loss-of-generality-symmetric-reasoning-for-resolution-systems-invited-talk/A Mixed-Integer Program for Drawing High-Quality Metro Mapshttps://ac.tuwien.ac.at/publication/a-mixed-integer-program-for-drawing-high-quality-metro-maps/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-mixed-integer-program-for-drawing-high-quality-metro-maps/A Unified View on Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/a-unified-view-on-hybrid-metaheuristics/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unified-view-on-hybrid-metaheuristics/Clique-width Minimization is NP-hardhttps://ac.tuwien.ac.at/publication/clique-width-minimization-is-np-hard/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-minimization-is-np-hard/Constraint satisfaction with bounded treewidth revisitedhttps://ac.tuwien.ac.at/publication/constraint-satisfaction-with-bounded-treewidth-revisited/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/constraint-satisfaction-with-bounded-treewidth-revisited/Evolutionary Approach to Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/evolutionary-approach-to-constrained-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-approach-to-constrained-minimum-spanning-tree-problem/Fixed-Parameter Complexity of Minimum Profile Problemshttps://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems/Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACOhttps://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/Solving \#SAT using Vertex Covershttps://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-sat-using-vertex-covers/The Core Concept for the Multidimensional Knapsack Problemhttps://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/The Linear Arrangement Problem Parameterized Above Guaranteed Valuehttps://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value/Variable Neighborhood Descent with Self-Adaptive Neighborhood-Orderinghttps://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-new-0-1-ilp-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-0-1-ilp-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/A Variable Neighborhood Search Approach for Solving the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classificationhttps://ac.tuwien.ac.at/publication/combining-metaheuristics-and-exact-algorithms-in-combinatorial-optimization-a-survey-and-classification/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-exact-algorithms-in-combinatorial-optimization-a-survey-and-classification/Computing Generalized Minimum Spanning Trees with Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problemhttps://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/Relaxation Guided Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packinghttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problemhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-maximum-weight-trace-formulation-of-the-multiple-sequence-alignment-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-maximum-weight-trace-formulation-of-the-multiple-sequence-alignment-problem/An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problemhttps://ac.tuwien.ac.at/publication/an-improved-hybrid-genetic-algorithm-for-the-generalized-assignment-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-improved-hybrid-genetic-algorithm-for-the-generalized-assignment-problem/Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem/Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variablehttps://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-unsatisfiable-k-sat-instances-with-few-occurrences-per-variable/Detecting Backdoor Sets with Respect to Horn and Binary Clauseshttps://ac.tuwien.ac.at/publication/detecting-backdoor-sets-with-respect-to-horn-and-binary-clauses/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/detecting-backdoor-sets-with-respect-to-horn-and-binary-clauses/On Finding Short Resolution Refutations and Small Unsatisfiable Subsetshttps://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets/On fixed-parameter tractable parameterizations of SAThttps://ac.tuwien.ac.at/publication/on-fixed-parameter-tractable-parameterizations-of-sat/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-fixed-parameter-tractable-parameterizations-of-sat/Solving a Real-World Glass Cutting Problemhttps://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/The Parameterized Complexity of SAT Backdoorshttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-sat-backdoors/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-sat-backdoors/Validation in the Cluster Analysis of Gene Expression Datahttps://ac.tuwien.ac.at/publication/validation-in-the-cluster-analysis-of-gene-expression-data/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/validation-in-the-cluster-analysis-of-gene-expression-data/A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/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-2/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-2/The complexity of resolution with generalized symmetry ruleshttps://ac.tuwien.ac.at/publication/the-complexity-of-resolution-with-generalized-symmetry-rules/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-resolution-with-generalized-symmetry-rules/A Memetic Algorithm for Vertex-Biconnectivity Augmentationhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/Generalizations of matched CNF formulashttps://ac.tuwien.ac.at/publication/generalizations-of-matched-cnf-formulas/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/generalizations-of-matched-cnf-formulas/Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edgeshttps://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/Letting Ants Labeling Point Featureshttps://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/On Weight-Biased Mutation for Graph Problemshttps://ac.tuwien.ac.at/publication/on-weight-biased-mutation-for-graph-problems/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-weight-biased-mutation-for-graph-problems/An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problemhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/NP-Completeness of Refutability by Literal-Once Resolutionhttps://ac.tuwien.ac.at/publication/np-completeness-of-refutability-by-literal-once-resolution/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/np-completeness-of-refutability-by-literal-once-resolution/Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Searchhttps://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problemshttps://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/A Hybrid GA for the Edge-Biconnectivity Augmentation Problemhttps://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-predecessor-coding-in-an-evolutionary-algorithm-for-the-capacitated-minimum-spanning-tree-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-predecessor-coding-in-an-evolutionary-algorithm-for-the-capacitated-minimum-spanning-tree-problem/A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/an-efficient-evolutionary-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-evolutionary-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Searchhttps://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problemhttps://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/An Evolutionary Approach to Point-Feature Label Placementhttps://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problemhttps://ac.tuwien.ac.at/publication/characterizing-locality-in-decoder-based-eas-for-the-multidimensional-knapsack-problem/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/characterizing-locality-in-decoder-based-eas-for-the-multidimensional-knapsack-problem/On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithmshttps://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problemhttps://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/A Genetic Algorithm for Labeling Point Featureshttps://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/A Hybrid GP Approach for Numerically Robust Symbolic Regressionhttps://ac.tuwien.ac.at/publication/a-hybrid-gp-approach-for-numerically-robust-symbolic-regression/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-gp-approach-for-numerically-robust-symbolic-regression/An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problemhttps://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomialshttps://ac.tuwien.ac.at/publication/approximation-with-evolutionary-optimized-tensor-product-bernstein-polynomials/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximation-with-evolutionary-optimized-tensor-product-bernstein-polynomials/Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networkshttps://ac.tuwien.ac.at/publication/evolutionary-optimized-tensor-product-bernstein-polynomials-versus-backpropagation-networks/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-optimized-tensor-product-bernstein-polynomials-versus-backpropagation-networks/Genetic Algorithms for the Multiple Container Packing Problemhttps://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distanceshttps://ac.tuwien.ac.at/publication/transforming-an-analytically-defined-color-space-to-match-psychophysically-gained-color-distances/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/transforming-an-analytically-defined-color-space-to-match-psychophysically-gained-color-distances/Lossy Kernels for Hitting Subgraphshttps://ac.tuwien.ac.at/publication/lossy-kernels-for-hitting-subgraphs/Thu, 01 Jan 1970 00:00:00 +0000https://ac.tuwien.ac.at/publication/lossy-kernels-for-hitting-subgraphs/On the Parameterized Complexity of Simultaneous Deletion Problemshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-simultaneous-deletion-problems/Thu, 01 Jan 1970 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-simultaneous-deletion-problems/Parallel Beam Search for Combinatorial Optimizationhttps://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization-2/Thu, 01 Jan 1970 00:00:00 +0000https://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization-2/