4

A Model for Finding Transition-Minors
PDF Cite
A SAT Approach for Finding Sup-Transition-Minors
PDF Cite
A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem
PDF Cite
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
PDF Cite
Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments
PDF Cite
QBF Encodings of Chess Problems
PDF Cite
Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract)
PDF Cite
Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation
PDF Cite
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
PDF Cite
Positive and Negative Results for Parameterized Compilability
PDF Cite