494 search results - page 46 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
ICALP
2009
Springer
14 years 2 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
TCS
2011
13 years 2 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
ADG
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...