Result 61 to 80 of 202 total
Exact algorithms for graph homomorphisms. (English)
Theory Comput. Syst. 41, No. 2, 381-393 (2007).
61
Exact algorithms for $L$ (2, 1)-labeling of graphs (English)
MFCS, 513-524 (2007).
62
07211 abstracts collection - exact, approximative, robust and certifying algorithms on particular graph classes (English)
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes (2007).
63
Branch and recharge: exact algorithms for generalized domination (English)
WADS, 507-518 (2007).
64
Exact, approximative, robust and certifying algorithms on particular graph classes, 20.05. - 25.05.2007 (English)
Dagstuhl Seminar Proceedings: Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 07211 (2007).
65
Measure and conquer: a simple $O(2^{0.288n})$ independent set algorithm. (English)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22‒24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 18-25 (2006).
66
An exact algorithm for the minimum dominating clique problem. (English)
Bodlaender, Hans L. (ed.) et al., Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13‒15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-39098-5/pbk). Lecture Notes in Computer Science 4169, 130-141 (2006).
67
Solving connected dominating set faster than $2^{n}$. (English)
Arun-Kumar, S. (ed.) et al., FSTTCS 2006: Foundations of software technology and theoretical computer science. 26th international conference, Kolkata, India, December 13‒15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49994-7/pbk). Lecture Notes in Computer Science 4337, 152-163 (2006).
68
On exact algorithms for treewidth. (English)
Azar, Yossi (ed.) et al., Algorithms ‒ ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11‒13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 672-683 (2006).
69
Exponential time algorithms for the minimum dominating set problem on some graph classes. (English)
Arge, Lars (ed.) et al., Algorithm theory ‒ SWAT 2006. 10th Scandinavian workshop on algorithm theory, Riga, Latvia, July 6‒8, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-35753-7/pbk). Lecture Notes in Computer Science 4059, 148-159 (2006).
70
Optimal linear arrangement of interval graphs. (English)
Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2006. 31st international symposium, MFCS 2006, Stará Lesná, Slovakia, August 28‒September 1, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37791-3/pbk). Lecture Notes in Computer Science 4162, 267-279 (2006).
71
Certifying algorithms for recognizing interval graphs and permutation graphs. (English)
SIAM J. Comput. 36, No. 2, 326-353 (2006).
72
Between $O(nm)$ and $O(n^α)$. (English)
SIAM J. Comput. 36, No. 2, 310-325 (2006).
73
Improved bottleneck domination algorithms. (English)
Discrete Appl. Math. 154, No. 11, 1578-1592 (2006).
74
Minimal fill in O($n^{2.69}$) time. (English)
Discrete Math. 306, No. 3, 366-371 (2006).
75
On exact algorithms for treewidth (English)
ESA, 672-683 (2006).
76
Measure and conquer: a simple $O(2^{0.288$n}) independent set algorithm (English)
SODA, 18-25 (2006).
77
Optimal linear arrangement of interval graphs (English)
MFCS, 267-279 (2006).
78
An exact algorithm for the minimum dominating clique problem (English)
IWPEC, 130-141 (2006).
79
Exponential time algorithms for the minimum dominating set problem on some graph classes (English)
SWAT, 148-159 (2006).
80
Result 61 to 80 of 202 total
Start
Contact
Print
General Help
