Result 1 to 20 of 450 total
Towards a comprehensive theory of conflict-tolerance graphs. (English)
Discrete Appl. Math. 160, No. 18, 2742-2751 (2012).
1
Mixed unit interval graphs. (English)
Discrete Math. 312, No. 22, 3357-3363 (2012).
2
Separation properties of 3-Steiner and 3-monophonic convexity in graphs. (English)
Discrete Math. 312, No. 22, 3293-3305 (2012).
3
Forbidden subgraph characterization of bipartite unit probe interval graphs. (English)
Australas. J. Comb. 52, 19-31 (2012).
4
Computing role assignments of proper interval graphs in polynomial time. (English)
J. Discrete Algorithms 14, 173-188 (2012).
5
The complexity of finding uniform sparsest cuts in various graph classes. (English)
J. Discrete Algorithms 14, 136-149 (2012).
6
$p$-Wiener intervals and $p$-Wiener free intervals. (English)
Discuss. Math., Graph Theory 32, No. 1, 121-127 (2012).
7
Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs. (English)
Discrete Math. Algorithms Appl. 4, No. 1, 1250005, 9 p. (2012).
8
Backup 2-center on interval graphs. (English)
Theor. Comput. Sci. 445, 25-35 (2012).
9
On coloring problems with local constraints. (English)
Discrete Math. 312, No. 12-13, 2027-2039 (2012).
10
Efficient oracles for generating binary bubble languages. (English)
Electron. J. Comb. 19, No. 1, Research Paper P42, 20 p., electronic only (2012).
11
A note on upper bounds for the maximum span in interval edge-colorings of graphs. (English)
Discrete Math. 312, No. 8, 1393-1399 (2012).
12
On sum coloring and sum multi-coloring for restricted families of graphs. (English)
Theor. Comput. Sci. 418, 1-13 (2012).
13
Cubicity, degeneracy, and crossing number. (English)
Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12‒14, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPICS ‒ Leibniz International Proceedings in Informatics 13, 176-190, electronic only (2011).
14
A note on 3-Steiner intervals and betweenness. (English)
Discrete Math. 311, No. 22, 2601-2609 (2011).
15
Boxicity of line graphs. (English)
Discrete Math. 311, No. 21, 2359-2367 (2011).
16
Further characterizations for interval tournaments. (English)
J. Indian Math. Soc., New Ser. 78, No. 1-4, 15-26 (2011).
17
Interval graphs: canonical representations in logspace. (English)
SIAM J. Comput. 40, No. 5, 1292-1315 (2011).
18
A vertex ordering result for tripartite unit probe interval graphs. (English)
Congr. Numerantium 209, 161-177 (2011).
19
The conditional covering problem on interval graphs with unequal costs. (English)
Tamsui Oxf. J. Inf. Math. Sci. 27, No. 2, 183-195 (2011).
20
Result 1 to 20 of 450 total
Start
Contact
Print
General Help
