16504 search results - page 111 / 3301 » New Problems, New Solutions |
162
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
168
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
180
click to vote
SARA
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
222
click to vote
CRIWG
2004
15 years 7 months ago
2004
Abstract. Creativity has become an important factor in recent years, as companies need to be able to quickly adapt to take advantage of new opportunities and handle fast paced chan...
179
click to vote
CCCG
2009
15 years 7 months ago
2009
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...