Sciweavers

JDA
2011
104views more  JDA 2011»
13 years 5 months ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
DCG
2007
79views more  DCG 2007»
13 years 10 months ago
Distance Measures for Well-Distributed Sets
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
Alex Iosevich, Michael Rudnev
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 11 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
IPCO
2007
109views Optimization» more  IPCO 2007»
14 years 9 days ago
Inequalities from Two Rows of a Simplex Tableau
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
Kent Andersen, Quentin Louveaux, Robert Weismantel...
CAV
2009
Springer
218views Hardware» more  CAV 2009»
14 years 11 months ago
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
Isil Dillig, Thomas Dillig, Alex Aiken