| Publication | Date of Publication | Type |
|---|
| On Tamaki's Algorithm to Compute Treewidths. | 2023-06-23 | Paper |
| Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves | 2023-02-10 | Paper |
| Learning molecular classes from small numbers of positive examples using graph grammars | 2021-12-21 | Paper |
Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
(available as arXiv preprint) | 2021-12-08 | Paper |
Computing Euclidean Steiner trees over segments
EURO Journal on Computational Optimization | 2021-01-20 | Paper |
Scheduling shared continuous resources on many-cores
Journal of Scheduling | 2018-11-07 | Paper |
Improving interpolants for linear arithmetic
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
Algorithms for the maximum weight connected \(k\)-induced subgraph problem
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
| Point containment in the integer hull of a polyhedron | 2015-08-03 | Paper |
| Efficient interpretation of tandem mass tags in top-down proteomics | 2014-02-27 | Paper |
On the low-dimensional Steiner minimum tree problem in Hamming metric
Theoretical Computer Science | 2014-01-16 | Paper |
Certifying feasibility and objective value of linear programs
Operations Research Letters | 2012-09-18 | Paper |
Symbolic worst case execution times
Theoretical Aspects of Computing – ICTAC 2011 | 2012-01-06 | Paper |
Approximation algorithms for the interval constrained coloring problem
Algorithmica | 2011-09-20 | Paper |
Integration of an LP solver into interval constraint propagation
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
On the low-dimensional Steiner minimum tree problem in Hamming metric
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Computing steiner minimum trees in Hamming metric
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Superposition modulo linear arithmetic SUP(LA)
Frontiers of Combining Systems | 2010-01-07 | Paper |
Integer Linear Programming in Computational Biology
Lecture Notes in Computer Science | 2009-11-12 | Paper |
A Lagrangian relaxation approach for the multiple sequence alignment problem
Journal of Combinatorial Optimization | 2009-05-04 | Paper |
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Approximating the Interval Constrained Coloring Problem
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Maximum network flow with floating point arithmetic.
Information Processing Letters | 2006-01-17 | Paper |
A branch-and-cut algorithm for multiple sequence alignment
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Approximating \(k\)-hop minimum-spanning trees
Operations Research Letters | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2086927 (Why is no real title available?) | 2004-08-11 | Paper |
An efficient graph algorithm for dominance constraints
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1982172 (Why is no real title available?) | 2003-09-16 | Paper |
| scientific article; zbMATH DE number 1947383 (Why is no real title available?) | 2003-07-08 | Paper |
| An efficient algorithm for the configuration problem of dominance graphs | 2002-03-24 | Paper |
Traveling salesman-based curve reconstruction in polynomial time
SIAM Journal on Computing | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1445366 (Why is no real title available?) | 2000-05-10 | Paper |
A Random Walk Approach to Broadcasting on Random Recursive Trees
(available as arXiv preprint) | N/A | Paper |
