Algorithmics
- Beziehungen:
-
- Privately Querying Privacy: Privacy Estimation with Guaranteed Privacy of User and Database Party.
- Most Diverse Near-Shortest Paths.
- On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric.
- A Polyhedral Approach to Surface Reconstruction from Planar Contours.
- Computing Locally Coherent Discourses.
- Symbolic Worst Case Execution Times.
- Fast and Accurate Bounds on Linear Programs.
- LASA: A Tool for Non-heuristic Alignment of Multiple Sequences.
- Computing H/D-exchange speeds of single residues from data of peptic fragments.
- On Tamaki's Algorithm to Compute Treewidths.
- Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm.
- Fully Automatic Trunk Packing with Free Placements
- Curve reconstruction and the traveling salesman problem.
- A Column Generation Approach to Scheduling of Real-Time Networks - Best Paper Award of International Conference on Computer Science and Applications 2012
- University Course Timetabling with Conflict Minimization and Elective Courses
- Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm
- Traveling Salesman-Based Curve Reconstruction in Polynomial Time
- On the low-dimensional Steiner minimum tree problem in Hamming metric
- Maximum network flow with floating point arithmetic
- Privacy Preserving Queries of Shortest Path Distances
- Efficient Interpretation of Tandem Mass Tags in Top-Down Proteomics
- Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves.
- Computing Euclidean Steiner trees over segments
- Fast Private Parameter Learning and Evaluation for Sum-Product Networks.
- Privacy-Preserving Learning of Random Forests Without Revealing the Trees.
- Trunk Packing Revisited
- Computing H/D-Exchange rates of single residues from data of proteolytic fragments
- Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm.
- Fully Automatic Trunk Packing with Free Placements
- Computing steiner minimum trees in Hamming metric.
- A Combinatorial Approach to Protein Docking with Flexible Side Chains
- TSP-based curve reconstruction in polynomial time.
- Approximation Algorithms for the Interval Constrained Coloring Problem
- Superposition Modulo Linear Arithmetic SUP(LA).
- Integration of an LP Solver into Interval Constraint Propagation.
- Approximating the Interval Constrained Coloring Problem.
- Power efficient range assignment in ad-hoc wireless networks.
- Improving Interpolants for Linear Arithmetic.
- An efficient algorithm for the configuration problem of dominance graphs.
- Integer Linear Programming in Computational Biology.
- Algorithms for the maximum weight connected k-induced subgraph problem
- Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement
- A Greedy Algorithm for Hierarchical Complete Linkage Clustering
- Approximating k-hop minimum-spanning trees
- Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks
- An efficient graph algorithm for dominance constraints
- Precise and efficient parametric path analysis.
- Certifying feasibility and objective value of linear programs
- Point containment in the integer hull of a polyhedron.
- Robust Stability Analysis of the Tryptophan Regulatory Network of E.Coli.
- Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness
- Scheduling shared continuous resources on many-cores
- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem.
- A combinatorial approach to protein docking with flexible side-chains.
- Global uniform stability analysis of biological networks with different time-scales under perturbations
- A branch-and-cut algorithm for multiple sequence alignment
- A Column Generation Approach to Scheduling of Periodic Tasks.
- Efficient computation of root mean square deviations under rigid transformations
- Simple interpolants for linear arithmetic.
- Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments.
- SCIL - Symbolic Constraints in Integer Linear Programming.
- Improving Linear Programming Approaches for the Steiner Tree Problem.
- Reconstructing Phylogenetic Networks with One Recombination.
- Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.
- A Lagrangian relaxation approach for the multiple sequence alignment problem
- Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars
- On the Optimality of the Greedy Garbage Collection Strategy for SSDs
Has propertyThe following list shows all publications with a direct relation to the organisational unit. To retrieve a list which includes publications of subordinate organisational units, use the search facet "Organizational structure".
Child of