| Publication | Date of Publication | Type |
|---|
How much geometry it takes to reconstruct a 2-manifold in \(\mathbb{R}^3\)
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
ScrewBox: a randomized certifying graph-non-isomorphism algorithm
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Most finite point sets in the plane have dilation \(>1\)
Discrete & Computational Geometry | 2015-02-19 | Paper |
How much geometry it takes to reconstruct a 2-manifold in \(\mathbb{R}^{3}\)
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Faster algorithms for computing longest common increasing subsequences
Journal of Discrete Algorithms | 2012-01-04 | Paper |
The complexity of Boolean matrix root computation
Lecture Notes in Computer Science | 2011-03-18 | Paper |
| Weak positional games on hypergraphs | 2010-07-30 | Paper |
Computing geometric minimum-dilation graphs is NP-hard
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Determining the consistency of partial tree descriptions
Artificial Intelligence | 2009-07-09 | Paper |
| scientific article; zbMATH DE number 5506217 (Why is no real title available?) | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506235 (Why is no real title available?) | 2009-02-10 | Paper |
On the Locality of Extracting a 2-Manifold in
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Faster Algorithms for Computing Longest Common Increasing Subsequences
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
Graph Drawing | 2007-08-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Conway's Angel in three dimensions
Theoretical Computer Science | 2006-03-20 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
The complexity of Boolean matrix root computation
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2086393 (Why is no real title available?) | 2004-08-11 | Paper |
Lower Bounds for Lucas Chains
SIAM Journal on Computing | 2003-01-05 | Paper |
| Computing roots of directed graphs is graph isomorphism hard | 2002-07-02 | Paper |
On the Asymptotic Behaviour of Some Cotes Numbers
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3901380 (Why is no real title available?) | 1984-01-01 | Paper |
Asymptotic Error Bounds for a Class of Interpolatory Quadratures
SIAM Journal on Numerical Analysis | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3798362 (Why is no real title available?) | 1982-01-01 | Paper |
On the positivity of certain Cotes numbers
Aequationes Mathematicae | 1982-01-01 | Paper |
A note on the mean convergence of Lagrange interpolation
Journal of Approximation Theory | 1982-01-01 | Paper |
Monotony in interpolatory quadratures
Numerische Mathematik | 1982-01-01 | Paper |
