Result 1 to 20 of 31 total
Counting subgraphs via homomorphisms. (English)
SIAM J. Discrete Math. 26, No. 2, 695-717 (2012).
1
On the approximability of some degree-constrained subgraph problems. (English)
Discrete Appl. Math. 160, No. 12, 1661-1679 (2012).
2
Parameterized complexity of finding small degree-constrained subgraphs. (English)
J. Discrete Algorithms 10, 70-83 (2012).
3
Implicit branching and parameterized partial cover problems. (English)
J. Comput. Syst. Sci. 77, No. 6, 1159-1171 (2011).
4
Subgraphs of weakly quasi-random oriented graphs. (English)
SIAM J. Discrete Math. 25, No. 1, 234-259 (2011).
5
Minimal selectors and fault tolerant networks. (English)
Networks 55, No. 4, 326-340 (2010).
6
Riemann-Roch for sub-lattices of the root lattice $A_{n}$. (English)
Electron. J. Comb. 17, No. 1, Research Paper R124, 50 p., electronic only (2010).
7
WDM and directed star arboricity. (English)
Comb. Probab. Comput. 19, No. 2, 161-182 (2010).
8
WDM and directed star arboricity (English)
Combinatorics, Probability & Computing 19, No. 2, 161-182 (2010).
9
Geometric tomography with topological guarantees (English)
Symposium on Computational Geometry, 287-296 (2010).
10
On the path-width of planar graphs. (English)
SIAM J. Discrete Math. 23, No. 3, 1311-1316 (2009).
11
Submodular partition functions. (English)
Discrete Math. 309, No. 20, 6000-6008 (2009).
12
Hardness and approximation of traffic grooming. (English)
Theor. Comput. Sci. 410, No. 38-40, 3751-3760 (2009).
13
Counting subgraphs via homomorphisms. (English)
Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5‒12, 2009. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-02926-4/pbk). Lecture Notes in Computer Science 5555, 71-82 (2009).
14
Degree-constrained subgraph problems: Hardness and approximation results. (English)
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18‒19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 29-42 (2009).
15
A unified approach to distance-two colouring of planar graphs (English)
SODA, 273-282 (2009).
16
Counting subgraphs via homomorphisms (English)
ICALP (1), 71-82 (2009).
17
Implicit branching and parameterized partial cover problems (extended abstract). (English)
Hariharan, Ramesh (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2008), December 9‒11, 2008, Bangalore, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-08-8). LIPICS ‒ Leibniz International Proceedings in Informatics 2, 1-12, electronic only (2008).
18
Parameterized algorithms for partial cover problems. (English)
Comput. Res. Repos. 2008, Article No. 0802.1722 (2008).
19
Guarding art galleries: The extra cost for sculptures is linear. (English)
Gudmundsson, Joachim (ed.), Algorithm theory ‒ SWAT 2008. 11th Scandinavian workshop on algorithm theory, Gothenburg, Sweden, July 2‒4, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69900-2/pbk). Lecture Notes in Computer Science 5124, 41-52 (2008).
20
Result 1 to 20 of 31 total
Start
Contact
Print
General Help
