History

Please fill in your query. A complete syntax description you will find on the General Help page.

Result 61 to 80 of 181 total

Parameterized algorithms for the independent set problem in some hereditary graph classes (English)
IWOCA, 1-9 (2010).
61
On the hull number of triangle-free graphs. (English)
SIAM J. Discrete Math. 23, No. 4, 2163-2172 (2009).
62
Binary trees with choosable edge lengths. (English)
Inf. Process. Lett. 109, No. 18, 1087-1092 (2009).
63
An $Ω(n\log n)$ lower bound for computing the sum of even-ranked elements. (English)
Inf. Process. Lett. 109, No. 16, 955-956 (2009).
64
On packing shortest cycles in graphs. (English)
Inf. Process. Lett. 109, No. 14, 816-821 (2009).
65
On ${\cal F}$-independence in graphs. (English)
Discuss. Math., Graph Theory 29, No. 2, 377-383 (2009).
66
Remarks about disjoint dominating sets. (English)
Discrete Math. 309, No. 23-24, 6451-6458 (2009).
67
A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. (English)
J. Discrete Algorithms 7, No. 4, 377-390 (2009).
68
On spanning tree congestion. (English)
Discrete Math. 309, No. 13, 4653-4655 (2009).
69
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. (English)
Discrete Math. 309, No. 12, 3843-3852 (2009).
70
Edge irregular total labellings for graphs of linear size. (English)
Discrete Math. 309, No. 12, 3786-3792 (2009).
71
On the existence of edge cuts leaving several large components. (English)
Discrete Math. 309, No. 6, 1703-1707 (2009).
72
On the OBDD size for graphs of bounded tree- and clique-width. (English)
Discrete Math. 309, No. 4, 843-851 (2009).
73
Domination in bipartite graphs. (English)
Discrete Math. 309, No. 1, 113-122 (2009).
74
On $F$-independence in graphs (English)
Discussiones Mathematicae Graph Theory 29, No. 2, 377-383 (2009).
75
Cycles, paths, connectivity and diameter in distance graphs (English)
WG, 320-328 (2009).
76
Fast buffering for optimizing worst slack and resource consumption in repeater trees (English)
ISPD, 43-50 (2009).
77
The independence number in graphs of maximum degree three. (English)
Discrete Math. 308, No. 23, 5829-5833 (2008).
78
Some remarks on $λ_{p,q}$-connectedness. (English)
Discrete Math. 308, No. 23, 5562-5569 (2008).
79
Domination in cubic graphs of large girth. (English)
Ito, Hiro (ed.) et al., Computational geometry and graph theory. International conference, KyotoCGGT 2007, Kyoto, Japan, June 11‒15, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89549-7/pbk). Lecture Notes in Computer Science 4535, 186-190 (2008).
80

Result 61 to 80 of 181 total