Coe | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/coe/CoeHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngCoehttps://ac.tuwien.ac.at/tag/coe/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/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/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/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/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/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/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/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/Routing few robots in a crowded networkhttps://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/routing-few-robots-in-a-crowded-network-2/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/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 Complexity of Extending Fair Allocations of Indivisible Goodshttps://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-extending-fair-allocations-of-indivisible-goods-2/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/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 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/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/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/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/Generating Streamlining Constraints with Large Language Modelshttps://ac.tuwien.ac.at/publication/generating-streamlining-constraints-with-large-language-models/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/generating-streamlining-constraints-with-large-language-models/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/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/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/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/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/