Technical Reports

26 results

2017
[26]	On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances Ronald de Haan, Iyad Kanj, Stefan Szeider 2017, Technical report AC-TR-17-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[25]	Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures Ronald de Haan, Marija Slavkovik 2017, Technical report AC-TR-17-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[24]	Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract) Haris Aziz, Ronald de Haan, Baharak Rastegari 2017, Technical report AC-TR-17-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[23]	Stable Matching with Uncertain Pairwise Preferences Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari 2017, Technical report AC-TR-17-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[22]	Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure Ronald de Haan 2017, Technical report AC-TR-17-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[21]	Parameterized Complexity Classes Beyond Para-NP Ronald de Haan, Stefan Szeider 2017, Technical report AC-TR-17-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[20]	Long-Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2017, Technical report AC-TR-17-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[19]	Free Weak Nilpotent Minimum Algebras Stefano Aguzzoli Simone Bova, Diego Valota 2017, Technical report AC-TR-17-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[18]	An Iterative Time-Bucket Refinement Algorithm for a High Resolution Resource-Constrained Project Scheduling Problem Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther Raidl 2017, Technical report AC-TR-17-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
2016
[17]	Solving a selective Dial-a-Ride problem with Logic-based Benders Decomposition Martin Riedler, Günther Raidl 2016, Technical report AC-TR-16-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[16]	Succinctness of Languages for Judgment Aggregation Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang 2016, Technical report AC-TR-16-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[15]	Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Ulle Endriss, Ronald de Haan, Stefan Szeider 2016, Technical report AC-TR-16-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[14]	A SAT Approach to Branchwidth Sebastian Ordyniak Neha Lodha, Stefan Szeider 2016, Technical report AC-TR-16-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[13]	Positive and Negative Results for Parameterized Compilability Simone Bova, Ronald de Haan, Neha Lodha, Stefan Szeider 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[12]	Knowledge Compilation Meets Communication Complexity Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky 2016, Technical report AC-TR-16-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[11]	A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther Raidl 2016, Technical report AC-TR-16-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
2015
[10]	Fixed-Parameter Tractable Reductions to SAT for Planning Ronald de Haan, Martin Kronegger, Andreas Pfandler 2015, Technical report AC-TR-15-011, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[9]	Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young Ulle Endriss, Ronald de Haan 2015, Technical report AC-TR-15-010, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[8]	Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP Ronald de Haan, Stefan Szeider 2015, Technical report AC-TR-15-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[7]	First-Order Queries on Finite Abelian Groups Simone Bova, Barnaby Martin 2015, Technical report AC-TR-15-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[6]	The Complexity of Equivalence, Entailment, and Minimization in Existential Positive Logic Simone Bova, Hubie Chen 2015, Technical report AC-TR-15-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[5]	On Compiling CNFs into Structured Deterministic DNNFs Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky 2015, Technical report AC-TR-15-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[4]	Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider 2015, Technical report AC-TR-15-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[3]	Exact Approaches for Network Design Problems with Relays Markus Leitner, Ivana Ljubić, Martin Riedler, Mario Ruthmair 2015, Technical report AC-TR-15-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[2]	Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Ronald de Haan, Stefan Szeider 2015, Technical report AC-TR-15-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[1]	Community Structure Inspired Algorithms for SAT and #SAT Robert Ganian, Stefan Szeider 2015, Technical report AC-TR-15-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]