- Nearly Optimal Strategies for Special Cases of On-line Capital Investment
- A Remark on the Subsequence Problem for Arc-Annotated Sequences with
- Even Faster Parameterized Cluster Deletion and Cluster Editing
- Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
- Parameterized Algorithms for Double Hypergraph Dualization with
- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex
- Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
- Minimum Common String Partition Parameterized
- Fixed-Parameter Enumerability of Cluster Editing and Related
- CCCG 2008, Montreal, Quebec, August 1315, 2008 Competitive Search for Longest Empty Intervals
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
- Ranking Hypotheses to Minimize the Search Cost in Probabilistic Inference
- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds
- Scheduling Search Procedures: The Wheel of Fortune
- Threshold Group Testing Peter Damaschke
- Incremental Haplotype Inference, Phylogeny, and Almost Bipartite
- Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities
- Homogeneous String Segmentation using Trees and Weighted
- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
- Parameterized Reductions and Algorithms for a Graph Editing Problem that Generalizes Vertex
- Optimal Randomized Group Testing: A Canonical Form and the One-Defective Case
- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
- Randomized Group Testing Both Query-Optimal And Minimal Adaptive
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an
- Homogeneous String Segmentation using Trees and Weighted
- Discrete Optimization 2012. Home Exam Deadline and announcements: see course homepage.
- A Note on the Parameterized Complexity of Unordered Maximum Tree Orientation
- Discrete Optimization. Lecture Notes 3 ILP is NP-complete
- Discrete Optimization. Lecture Notes 10 Variations on the Theme of Graph Coloring
- Discrete Optimization. Lecture Notes 2 Disjunctive Constraints
- Discrete Optimization 2012. Exercises 1-4 Exercise 1.
- TDA206/DIT370: Discrete Optimization, Period 3, 2012 GLPK Based Practical Exercise, Deadline: 23:59, 1st
- Discrete Optimization. Lecture Notes 1 Optimization Problems
- Discrete Optimization. Lecture Notes 8 Langrangian Duality
- Discrete Optimization 2012. Exercises 5-7 Exercise 5.
- Discrete Optimization. Lecture Notes 11 Coloring Edges of Bipartite Graphs
- Discrete Optimization. Lecture Notes 7 Knapsack: Cover Inequalities
- Discrete Optimization. Lecture Notes 4 Minimum Cost Flow
- Discrete Optimization. Lecture Notes 6 Problem Examples
- Discrete Optimization 2012. Exercises 9-11 Exercise 9.
- Discrete Optimization. Lecture Notes 5 Christofides' Approximation Algorithm for Metric TSP
- Discrete Optimization. Lecture Notes 9 A Lagrangian Dual of STSP
