Result 1 to 20 of 35 total
Fast algorithms for max independent set. (English)
Algorithmica 62, No. 1-2, 382-415 (2012).
1
Exact algorithms for dominating set. (English)
Discrete Appl. Math. 159, No. 17, 2147-2164 (2011).
2
On partitioning a graph into two connected subgraphs. (English)
Theor. Comput. Sci. 412, No. 48, 6761-6769 (2011).
3
Solving connectivity problems parameterized by treewidth in single exponential time. (English)
Comput. Res. Repos. 2011, Article No. 1103.0534 (2011).
4
Exact algorithms for intervalizing colored graphs. (English)
Marchetti-Spaccamela, Alberto (ed.) et al., Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). Lecture Notes in Computer Science 6595, 45-56 (2011).
5
Partition into triangles on bounded degree graphs. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 558-569 (2011).
6
Exact algorithms for intervalizing colored graphs (English)
TAPAS, 45-56 (2011).
7
Partition into triangles on bounded degree graphs (English)
SOFSEM, 558-569 (2011).
8
Inclusion/exclusion branching for partial dominating set and set splitting. (English)
Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 204-215 (2010).
9
Computing role assignments of chordal graphs. (English)
Theor. Comput. Sci. 411, No. 40-42, 3601-3613 (2010).
10
Faster algorithms on branch and clique decompositions. (English)
Hliněný, Petr (ed.) et al., Mathematical foundations of computer science 2010. 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23‒27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15154-5/pbk). Lecture Notes in Computer Science 6281, 174-185 (2010).
11
A bottom-up method and fast algorithms for max independent set. (English)
Kaplan, Haim (ed.), Algorithm theory ‒ SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 62-73 (2010).
12
Maximum independent set in graphs of average degree at most three in ${\mathcal O}(1.08537^n)$. (English)
Kratochvíl, Jan (ed.) et al., Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7‒11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). Lecture Notes in Computer Science 6108, 373-384 (2010).
13
Polynomial space algorithms for counting dominating sets and the domatic number. (English)
Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 7th international conference, CIAC 2010, Rome, Italy, May 26‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13072-4/pbk). Lecture Notes in Computer Science 6078, 73-84 (2010).
14
Maximum independent set in graphs of average degree at most three in $O(1.08537^{n}){\mathcal O}$(1.08537^n) (English)
TAMC, 373-384 (2010).
15
Faster algorithms on branch and clique decompositions (English)
MFCS, 174-185 (2010).
16
Inclusion/exclusion branching for partial dominating set and set splitting (English)
IPEC, 204-215 (2010).
17
A bottom-up method and fast algorithms for Max independent set (English)
SWAT, 62-73 (2010).
18
Polynomial space algorithms for counting dominating sets and the domatic number (English)
CIAC, 73-84 (2010).
19
On partitioning a graph into two connected subgraphs. (English)
Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16‒18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 1215-1224 (2009).
20
Result 1 to 20 of 35 total
Start
Contact
Print
General Help
